Searched refs:f_n (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/boost/math/tools/ |
| D | recurrence.hpp | 244 forward_recurrence_iterator(const Recurrence& r, value_type f_n_minus_1, value_type f_n) in forward_recurrence_iterator()
245 : f_n_minus_1(f_n_minus_1), f_n(f_n), coef(r), k(0) {} in forward_recurrence_iterator()
247 forward_recurrence_iterator(const Recurrence& r, value_type f_n) in forward_recurrence_iterator()
248 : f_n(f_n), coef(r), k(0) in forward_recurrence_iterator()
251 …f_n_minus_1 = f_n * boost::math::tools::function_ratio_from_forwards_recurrence(detail::recurrence… in forward_recurrence_iterator()
260 value_type f_n_plus_1 = a * f_n_minus_1 / -c + b * f_n / -c; in operator ++()
261 swap(f_n_minus_1, f_n); in operator ++()
262 swap(f_n, f_n_plus_1); in operator ++()
274 value_type operator*() { return f_n; } in operator *()
276 value_type f_n_minus_1, f_n; member
[all …]
|
| /third_party/boost/libs/math/example/ |
| D | cardinal_cubic_b_spline_example.cpp | 105 auto f_n = [=](double t) { return std::make_pair(p(t) - 100000000, p.prime(t)); }; in main() local
107 time = boost::math::tools::newton_raphson_iterate(f_n, 1910.0, 1900.0, 2000.0, 20, iterations); in main()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/ |
| D | allocator.h | 108 auto deleter = [](T *p, C f_alloc, size_t f_n) { in MakeUnique()
110 for (size_t i = 0; i < f_n; ++i) { in MakeUnique()
114 f_alloc.deallocate(p, f_n); in MakeUnique()
|
| /third_party/boost/libs/math/doc/internals/ |
| D | recurrence.qbk | 137 forward_recurrence_iterator(const Recurrence& r, value_type f_n_minus_1, value_type f_n);
138 forward_recurrence_iterator(const Recurrence& r, value_type f_n);
151 backward_recurrence_iterator(const Recurrence& r, value_type f_n_plus_1, value_type f_n);
152 backward_recurrence_iterator(const Recurrence& r, value_type f_n);
|
| /third_party/chromium/patch/ |
| D | 0001-cve.patch | 49284 z;y)?WBDLVP#P@vEcJQA=f_n}lzNR;}gxCz#^GY<S_a-urFqVuL&LAg{B#~2|lF1C<
|