| /dports/math/py-sympy/sympy-1.9/sympy/polys/ |
| H A D | densearith.py | 14 def dup_add_term(f, c, i, K): argument
435 def dup_abs(f, K): argument
452 def dmp_abs(f, u, K): argument
474 def dup_neg(f, K): argument
491 def dmp_neg(f, u, K): argument
513 def dup_add(f, g, K): argument
590 def dup_sub(f, g, K): argument
735 def dup_mul(f, g, K): argument
835 def dup_sqr(f, K): argument
875 def dmp_sqr(f, u, K): argument
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 16 bool set_contains(const std::set< K, C, A >& s, const T& x) in set_contains()
28 bool set_equal(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_equal()
36 int set_lex_order(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_lex_order()
59 bool set_empty(const std::set< K, C, A >& x) in set_empty()
65 void set_insert(std::set< K, C, A >& x, const T& a) in set_insert()
71 void set_remove(std::set< K, C, A >& x, const T& a) in set_remove()
77 void set_intersect(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_intersect()
86 void set_union(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_union()
94 void set_difference(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_difference()
103 bool set_subset(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_subset()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 16 bool set_contains(const std::set< K, C, A >& s, const T& x) in set_contains()
28 bool set_equal(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_equal()
36 int set_lex_order(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_lex_order()
59 bool set_empty(const std::set< K, C, A >& x) in set_empty()
65 void set_insert(std::set< K, C, A >& x, const T& a) in set_insert()
71 void set_remove(std::set< K, C, A >& x, const T& a) in set_remove()
77 void set_intersect(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_intersect()
86 void set_union(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_union()
94 void set_difference(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_difference()
103 bool set_subset(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_subset()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 16 bool set_contains(const std::set< K, C, A >& s, const T& x) in set_contains()
28 bool set_equal(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_equal()
36 int set_lex_order(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_lex_order()
59 bool set_empty(const std::set< K, C, A >& x) in set_empty()
65 void set_insert(std::set< K, C, A >& x, const T& a) in set_insert()
71 void set_remove(std::set< K, C, A >& x, const T& a) in set_remove()
77 void set_intersect(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_intersect()
86 void set_union(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_union()
94 void set_difference(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_difference()
103 bool set_subset(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_subset()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 16 bool set_contains(const std::set< K, C, A >& s, const T& x) in set_contains()
28 bool set_equal(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_equal()
36 int set_lex_order(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_lex_order()
59 bool set_empty(const std::set< K, C, A >& x) in set_empty()
65 void set_insert(std::set< K, C, A >& x, const T& a) in set_insert()
71 void set_remove(std::set< K, C, A >& x, const T& a) in set_remove()
77 void set_intersect(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_intersect()
86 void set_union(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_union()
94 void set_difference(const std::set< K, C, A >& x, const std::set< K, C, A >& y, in set_difference()
103 bool set_subset(const std::set< K, C, A >& x, const std::set< K, C, A >& y) in set_subset()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 25 bool set_equal(const std::set<K,C,A>& x, in set_equal()
34 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
52 void set_clear(std::set<K,C,A>& x) { in set_clear()
57 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
62 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
67 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
72 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
83 void set_union(const std::set<K,C,A>& x, in set_union()
94 void set_difference(const std::set<K,C,A>& x, in set_difference()
105 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/detail/ |
| H A D | set_adaptor.hpp | 19 bool set_equal(const std::set<K,C,A>& x, in set_equal()
28 int set_lex_order(const std::set<K,C,A>& x, in set_lex_order()
46 void set_clear(std::set<K,C,A>& x) { in set_clear()
51 bool set_empty(const std::set<K,C,A>& x) { in set_empty()
56 void set_insert(std::set<K,C,A>& x, const T& a) { in set_insert()
61 void set_remove(std::set<K,C,A>& x, const T& a) { in set_remove()
66 void set_intersect(const std::set<K,C,A>& x, in set_intersect()
77 void set_union(const std::set<K,C,A>& x, in set_union()
88 void set_difference(const std::set<K,C,A>& x, in set_difference()
99 bool set_subset(const std::set<K,C,A>& x, in set_subset()
[all …]
|
| /dports/math/octave-forge-stk/stk/inst/model/prior_struct/ |
| H A D | stk_covmat_noise.m | 61 K = stk_covmat (model.lognoisevariance, x1, [], diff, pairwise); variable
79 K = zeros (n1, 1); variable
81 K = repmat (exp (model.lognoisevariance), n1, 1); variable
85 K = zeros (n1); variable
87 K = (exp (model.lognoisevariance)) * (eye (n1)); variable
113 K = exp (model.lognoisevariance(:)); variable
115 K = diag (exp (model.lognoisevariance)); variable
129 K = zeros (n1, 1); variable
131 K = zeros (n1, n2); variable
|
| /dports/devel/stylua/StyLua-0.11.0/cargo-crates/itertools-0.10.1/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
142 FO: FnMut(R, &K, V) -> R, in fold()
178 where FO: FnMut(V, &K, V) -> V, in fold_first()
206 pub fn collect<C>(self) -> HashMap<K, C> in collect()
236 pub fn max(self) -> HashMap<K, V> in max()
290 where F: FnMut(&K, &V) -> CK, in max_by_key()
314 pub fn min(self) -> HashMap<K, V> in min()
368 where F: FnMut(&K, &V) -> CK, in min_by_key()
481 where F: FnMut(&K, &V) -> CK, in minmax_by_key()
506 pub fn sum(self) -> HashMap<K, V> in sum()
[all …]
|
| /dports/multimedia/librav1e/rav1e-0.5.1/cargo-crates/itertools-0.10.3/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
142 FO: FnMut(R, &K, V) -> R, in fold()
178 where FO: FnMut(V, &K, V) -> V, in fold_first()
206 pub fn collect<C>(self) -> HashMap<K, C> in collect()
236 pub fn max(self) -> HashMap<K, V> in max()
290 where F: FnMut(&K, &V) -> CK, in max_by_key()
314 pub fn min(self) -> HashMap<K, V> in min()
368 where F: FnMut(&K, &V) -> CK, in min_by_key()
481 where F: FnMut(&K, &V) -> CK, in minmax_by_key()
506 pub fn sum(self) -> HashMap<K, V> in sum()
[all …]
|
| /dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/itertools-0.10.3/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
142 FO: FnMut(R, &K, V) -> R, in fold()
178 where FO: FnMut(V, &K, V) -> V, in fold_first()
206 pub fn collect<C>(self) -> HashMap<K, C> in collect()
236 pub fn max(self) -> HashMap<K, V> in max()
290 where F: FnMut(&K, &V) -> CK, in max_by_key()
314 pub fn min(self) -> HashMap<K, V> in min()
368 where F: FnMut(&K, &V) -> CK, in min_by_key()
481 where F: FnMut(&K, &V) -> CK, in minmax_by_key()
506 pub fn sum(self) -> HashMap<K, V> in sum()
[all …]
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/itertools-0.10.1/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
142 FO: FnMut(R, &K, V) -> R, in fold()
178 where FO: FnMut(V, &K, V) -> V, in fold_first()
206 pub fn collect<C>(self) -> HashMap<K, C> in collect()
236 pub fn max(self) -> HashMap<K, V> in max()
290 where F: FnMut(&K, &V) -> CK, in max_by_key()
314 pub fn min(self) -> HashMap<K, V> in min()
368 where F: FnMut(&K, &V) -> CK, in min_by_key()
481 where F: FnMut(&K, &V) -> CK, in minmax_by_key()
506 pub fn sum(self) -> HashMap<K, V> in sum()
[all …]
|
| /dports/devel/sccache/sccache-0.2.15/cargo-crates/itertools-0.10.0/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
142 FO: FnMut(R, &K, V) -> R, in fold()
178 where FO: FnMut(V, &K, V) -> V, in fold_first()
206 pub fn collect<C>(self) -> HashMap<K, C> in collect()
236 pub fn max(self) -> HashMap<K, V> in max()
290 where F: FnMut(&K, &V) -> CK, in max_by_key()
314 pub fn min(self) -> HashMap<K, V> in min()
368 where F: FnMut(&K, &V) -> CK, in min_by_key()
481 where F: FnMut(&K, &V) -> CK, in minmax_by_key()
506 pub fn sum(self) -> HashMap<K, V> in sum()
[all …]
|