Home
last modified time | relevance | path

Searched refs:T_t (Results 1 – 25 of 103) sorted by relevance

12345

/dports/cad/verilator/verilator-4.216/test_regress/t/
H A Dt_param_type3.v7 typedef logic T_t; typedef
16 input T_t i;
17 output T_t o;
18 output T_t o2;
20 sub1 #(.T_t(T_t), .CHECK(1))
23 sub2 #(.T_t(T_t), .CHECK(2))
26 sub1 #(T_t, 1)
29 sub2 #(T_t, 2)
38 input T_t i;
51 input T_t i,
[all …]
H A Dt_param_type2.v26 tt_buf #(.T_t(test_t))
34 parameter type T_t = logic [0:0] constant
37 input T_t i,
38 output T_t o
/dports/lang/sdcc/sdcc-4.0.0/src/
H A DSDCCtree_dec.hpp290 template <class T_t>
291 void nicify_joins(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t) in nicify_joins()
349 template <class T_t>
350 void nicify_diffs(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t) in nicify_diffs()
404 template <class T_t>
483 template <class T_t>
484 typename boost::graph_traits<T_t>::vertex_descriptor find_root(T_t &T) in find_root()
499 template <class T_t>
520 template <class T_t>
521 void nicify(T_t &T) in nicify()
[all …]
H A DSDCCnaddr.hpp210 template <class T_t, class G_t>
211 void tree_dec_naddrswitch_leaf(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, cons… in tree_dec_naddrswitch_leaf()
222 template <class T_t, class G_t>
223 int tree_dec_naddrswitch_introduce(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, … in tree_dec_naddrswitch_introduce()
255 template <class T_t, class G_t>
256 void tree_dec_naddrswitch_forget(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, co… in tree_dec_naddrswitch_forget()
328 template <class T_t, class G_t>
329 void tree_dec_naddrswitch_join(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, cons… in tree_dec_naddrswitch_join()
374 template <class T_t, class G_t>
375 int tree_dec_naddrswitch_nodes(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, cons… in tree_dec_naddrswitch_nodes()
[all …]
H A DSDCClospre.hpp140 template <class T_t, class G_t>
141 void tree_dec_lospre_leaf(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, const G_t… in tree_dec_lospre_leaf()
153 template <class T_t, class G_t>
187 template <class T_t, class G_t>
281 template <class T_t, class G_t>
282 void tree_dec_lospre_join(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t, const G_t… in tree_dec_lospre_join()
323 template <class T_t, class G_t>
369 template <class T_t, class G_t>
470 template <class T_t, class G_t>
520 template <class T_t, class G_t>
[all …]
H A DSDCCralloc.hpp253 template <class T_t>
880 template <class T_t, class G_t, class I_t>
908 template <class T_t, class G_t, class I_t>
981 template <class T_t, class G_t, class I_t>
1118 template <class T_t>
1175 template <class T_t>
1176 …T_t>::vertex_descriptor, size_t> find_best_root(const T_t &T, typename boost::graph_traits<T_t>::v… in find_best_root()
1206 template <class T_t>
1207 static void re_root(T_t &T, typename boost::graph_traits<T_t>::vertex_descriptor t) in re_root()
1232 template <class T_t>
[all …]
/dports/math/stanmath/math-4.2.0/stan/math/prim/prob/
H A Dbernoulli_logit_rng.hpp29 template <typename T_t, class RNG>
30 inline typename VectorBuilder<true, int, T_t>::type bernoulli_logit_rng( in bernoulli_logit_rng()
31 const T_t& t, RNG& rng) { in bernoulli_logit_rng()
34 ref_type_t<T_t> t_ref = t; in bernoulli_logit_rng()
38 scalar_seq_view<T_t> t_vec(t_ref); in bernoulli_logit_rng()
40 VectorBuilder<true, int, T_t> output(N); in bernoulli_logit_rng()
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/stan/math/prim/scal/prob/
H A Dbernoulli_logit_rng.hpp29 template <typename T_t, class RNG>
30 inline typename VectorBuilder<true, int, T_t>::type bernoulli_logit_rng( in bernoulli_logit_rng()
31 const T_t& t, RNG& rng) { in bernoulli_logit_rng()
38 scalar_seq_view<T_t> t_vec(t); in bernoulli_logit_rng()
40 VectorBuilder<true, int, T_t> output(N); in bernoulli_logit_rng()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/linalg/bwc/
H A Dlingen_tuning.cpp734 typedef tuning_thresholds_t T_t; typedef
736 T_t const & T(tuner.tuning_thresholds); in from_thresholds_mesh_level()
743 for(auto k : T_t::thresholds_verbs) { in from_thresholds_mesh_level()
744 if (k == T_t::notiming) continue; in from_thresholds_mesh_level()
773 if (tk.second == T_t::collective) in from_thresholds_mesh_level()
827 bool hc = T.has(T_t::cantor); in from_thresholds_fft_level()
828 bool ht = T.has(T_t::ternary); in from_thresholds_fft_level()
829 unsigned int tc = T[T_t::cantor]; in from_thresholds_fft_level()
830 unsigned int tt = T[T_t::ternary]; in from_thresholds_fft_level()
888 bool hf = T.has(T_t::flint); in from_thresholds_fft_level()
[all …]
/dports/science/py-ase/ase-3.22.0/ase/
H A Dthermochemistry.py261 T_t = units._k * temperature / (units._hplanck * self.freq_t)
263 dU_t = 2 * (-1. / 2 - 1. / T_t / (2 + 16 * R_t) + R_t / 2 / T_t -
264 R_t / 2 / T_t *
265 iv(1, R_t / 2 / T_t) / iv(0, R_t / 2 / T_t) +
266 1. / T_t / (np.exp(1. / T_t) - 1))
325 S_t = 2 * (-1. / 2 + 1. / 2 * np.log(np.pi * R_t / T_t) -
326 R_t / 2 / T_t *
327 iv(1, R_t / 2 / T_t) / iv(0, R_t / 2 / T_t) +
328 np.log(iv(0, R_t / 2 / T_t)) +
329 1. / T_t / (np.exp(1. / T_t) - 1) -
[all …]
/dports/math/stanmath/math-4.2.0/stan/math/rev/functor/
H A Dode_store_sensitivities.hpp32 template <typename F, typename T_y0_t0, typename T_t0, typename T_t,
34 require_any_autodiff_t<T_y0_t0, T_t0, T_t,
39 const T_t& t, std::ostream* msgs, const Args&... args) { in ode_store_sensitivities()
53 if (is_var<T_t>::value) in ode_store_sensitivities()
94 if (is_var<T_t>::value) { in ode_store_sensitivities()
/dports/math/stanmath/math-4.2.0/stan/math/prim/functor/
H A Dode_store_sensitivities.hpp32 typename F, typename T_y0_t0, typename T_t0, typename T_t, typename... Args,
34 = require_all_arithmetic_t<T_y0_t0, T_t0, T_t, scalar_type_t<Args>...>>
37 const Eigen::Matrix<T_y0_t0, Eigen::Dynamic, 1>& y0, T_t0 t0, T_t t, in ode_store_sensitivities()
/dports/lang/asn1c/asn1c-0.9.27/asn1c/tests/check-src/
H A Dcheck-132.-gen-PER.c13 verify(int testNo, T_t *ti) { in verify()
17 T_t *to = 0; in verify()
42 T_t t; in main()
H A Dcheck-127.-gen-PER.c13 verify(int testNo, T_t *ti) { in verify()
17 T_t *to = 0; in verify()
48 T_t ti; in main()
H A Dcheck-133.-gen-PER.c13 verify(int testNo, T_t *ti) { in verify()
17 T_t *to = 0; in verify()
52 T_t t; in main()
H A Dcheck-62.c48 save_object(T_t *st) { in save_object()
67 static T_t *
70 T_t *st = 0; in load_object()
117 T_t *st; in process_data()
H A Dcheck-35.c126 check(T_t *tp, uint8_t *buf, size_t size, size_t consumed) { in check()
170 compare(T_t *tp, uint8_t *cmp_buf, size_t cmp_buf_size) { in compare()
202 T_t t, *tp; in partial_read()
287 T_t *tp = 0; in check_xer()
311 T_t t; in main()
H A Dcheck64-134.-gen-PER.c40 verify(int testNo, T_t *ti) { in verify()
44 T_t *to = 0; in verify()
76 NO_encode(int testNo, T_t *ti) { in NO_encode()
90 T_t ti; in main()
H A Dcheck-41.c50 check(T_t *tp, uint8_t *buf, size_t size, size_t consumed) { in check()
93 compare(T_t *tp, uint8_t *cmp_buf, int cmp_buf_size) { in compare()
125 T_t t, *tp; in partial_read()
198 T_t t; in main()
H A Dcheck-41.-fwide-types.c133 check(T_t *tp, uint8_t *buf, size_t size, size_t consumed) { in check()
186 compare(T_t *tp, uint8_t *cmp_buf, size_t cmp_buf_size) { in compare()
218 T_t t, *tp; in partial_read()
291 T_t t; in main()
H A Dcheck-131.-gen-PER.c16 T_t t; in main()
17 T_t *t2 = 0; in main()
/dports/math/stanmath/math-4.2.0/test/unit/math/rev/functor/
H A Dtest_fixture_ode_fho.hpp36 using T_t = std::tuple_element_t<2, T>; typedef
43 std::vector<T_t> ts;
62 std::vector<T_t>& times() { return ts; } in times()
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/tsa/statespace/_smoothers/
H A D_classical.pyx157 # $L_t = (T_t - K_t Z_t)$
185 # $\hat \alpha_t = a_t|t + P_t|t T_t' r_t$
196 # $V_t = P_t|t [I - T_t' N_t T_t P_t|t]$
309 # $L_t = (T_t - K_t Z_t)$
337 # $\hat \alpha_t = a_t|t + P_t|t T_t' r_t$
348 # $V_t = P_t|t [I - T_t' N_t T_t P_t|t]$
461 # $L_t = (T_t - K_t Z_t)$
489 # $\hat \alpha_t = a_t|t + P_t|t T_t' r_t$
500 # $V_t = P_t|t [I - T_t' N_t T_t P_t|t]$
613 # $L_t = (T_t - K_t Z_t)$
[all …]
H A D_alternative.pyx38 # $L_t = T_t$
89 # $L_t = T_t C_t$
129 # $\hat N_{t-1} = T_t' \tilde N_t T_t$
285 # $L_t = T_t$
336 # $L_t = T_t C_t$
376 # $\hat N_{t-1} = T_t' \tilde N_t T_t$
532 # $L_t = T_t$
583 # $L_t = T_t C_t$
623 # $\hat N_{t-1} = T_t' \tilde N_t T_t$
779 # $L_t = T_t$
[all …]
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/tsa/statespace/_filters/
H A D_univariate.pyx404 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
443 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
507 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
941 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
980 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
1044 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
1477 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
1516 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
1580 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
2013 # $P_{t+1} = T_t P_{t,n} T_t' + Q_t^*$
[all …]

12345