/dports/science/pynn/PyNN-0.10.0/pyNN/neuron/nmodl/ |
H A D | tsodyksmarkram.mod | 26 t_last (ms) 34 t_last = -1e99 39 t_last = t 41 z = z*exp(-(t - t_last)/tau_rec) 42 z = z + y*(exp(-(t - t_last)/tau_syn) - exp(-(t - t_last)/tau_rec)) / ((tau_syn/tau_rec) - 1) 43 y = y*exp(-(t - t_last)/tau_syn) 46 u = u*exp(-(t - t_last)/tau_facil) 54 :printf("%g\t%g\t%g\t%g\t%g\t%g\t%g\n", t, t - t_last, y, z, u, x, wsyn) 55 t_last = t
|
H A D | stochastic_tsodyksmarkram.mod | 26 t_last (ms) : time of the last spike 34 t_last = -1e99 43 t_last = t 47 … p_surv=%-5.3g t_surv=%4.1f t_last=%4.1f u=%-5.3g R=%g wsyn=%g\n", tau_facil, tau_rec, U, t,… 50 u = u*exp(-(t - t_last)/tau_facil) 55 t_last = t 83 … p_surv=%-5.3g t_surv=%4.1f t_last=%4.1f u=%-5.3g R=%g wsyn=%g\n\n", tau_facil, tau_rec, U, t…
|
H A D | quantal_stp.mod | 32 NET_RECEIVE(w, available, t_last (ms)) { 34 : t_last - time of the last spike 40 t_last = -1e99 44 p_decay = exp(-(t - t_last)/tau_rec) 48 u_decay = exp( -(t - t_last)/tau_fac) 81 t_last = t
|
/dports/devel/hyperscan/boost_1_75_0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/compute/algorithm/ |
H A D | search_n.hpp | 41 TextIterator t_last, in set_range() argument 52 m_count = iterator_range_size(t_first, t_last); in set_range() 107 TextIterator t_last, in search_n() argument 114 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 123 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 132 return t_last; in search_n()
|
H A D | search.hpp | 39 TextIterator t_last, in search() argument 46 detail::iterator_range_size(t_first, t_last) in search() 56 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 65 return t_last; in search()
|
/dports/devel/boost-libs/boost_1_72_0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in reverse_copy_kernel() 55 m_count = iterator_range_size(t_first, t_last); in reverse_copy_kernel() 111 TextIterator t_last, 120 detail::iterator_range_size(t_first, t_last) + 1 - n, 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); 138 return t_last;
|
H A D | search.hpp | 43 TextIterator t_last, in reverse_kernel() 53 detail::iterator_range_size(t_first, t_last) in reverse_kernel() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in reverse_kernel() 72 return t_last; in reverse_kernel()
|
/dports/devel/boost-docs/boost_1_72_0/boost/compute/algorithm/ |
H A D | search_n.hpp | 44 TextIterator t_last, in set_range() argument 55 m_count = iterator_range_size(t_first, t_last); in set_range() 111 TextIterator t_last, in search_n() argument 120 detail::iterator_range_size(t_first, t_last) + 1 - n, in search_n() 129 kernel.set_range(t_first, t_last, value, n, matching_indices.begin()); in search_n() 138 return t_last; in search_n()
|
H A D | search.hpp | 43 TextIterator t_last, in search() argument 53 detail::iterator_range_size(t_first, t_last) in search() 63 kernel.set_range(p_first, p_last, t_first, t_last, matching_indices.begin()); in search() 72 return t_last; in search()
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/linesearch/ |
H A D | linesearch.F | 106 real*8 t_last, f_last 126 t_last = t(1) 144 t_last = t(2) 153 t_last = t(3) 182 t_last = tmin 214 t_last = tmin 251 if (tmin.ne.t_last) fmin = FUNC1(tmin)
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/linesearch/ |
H A D | linesearch.F | 106 real*8 t_last, f_last 126 t_last = t(1) 144 t_last = t(2) 153 t_last = t(3) 182 t_last = tmin 214 t_last = tmin 251 if (tmin.ne.t_last) fmin = FUNC1(tmin)
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/kurbo-0.6.1/src/ |
H A D | param_curve.rs | 86 let mut t_last = 0.0; in inv_arclen() localVariable 94 let (range, dir) = if tm > t_last { in inv_arclen() 95 (t_last..tm, 1.0) in inv_arclen() 97 (tm..t_last, -1.0) in inv_arclen() 111 t_last = tm; in inv_arclen()
|
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/kurbo-0.5.11/src/ |
H A D | param_curve.rs | 86 let mut t_last = 0.0; in inv_arclen() localVariable 94 let (range, dir) = if tm > t_last { in inv_arclen() 95 (t_last..tm, 1.0) in inv_arclen() 97 (tm..t_last, -1.0) in inv_arclen() 111 t_last = tm; in inv_arclen()
|