Home
last modified time | relevance | path

Searched defs:K (Results 51 – 75 of 18498) sorted by relevance

12345678910>>...740

/dports/textproc/jql/jql-3.0.6/cargo-crates/itertools-0.10.3/src/
H A Dgrouping_map.rs32 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/textproc/mdbook/mdBook-0.4.13/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/graphics/pastel/pastel-0.8.1/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/www/xh/xh-0.14.1/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/www/miniserve/miniserve-0.18.0/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/lang/rust/rustc-1.58.1-src/vendor/itertools/src/
H A Dgrouping_map.rs32 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/www/firefox-esr/firefox-91.8.0/third_party/rust/itertools/src/
H A Dgrouping_map.rs32 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/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/benchmarks/inferno/inferno-0.10.9/cargo-crates/itertools-0.10.3/src/
H A Dgrouping_map.rs32 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/neolink/neolink-cf54129/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/graphics/dssim/dssim-3.1.2/cargo-crates/itertools-0.10.3/src/
H A Dgrouping_map.rs32 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/x11/wmfocus/wmfocus-1.2.0/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/www/monolith/monolith-2.6.1/cargo-crates/itertools-0.10.1/src/
H A Dgrouping_map.rs32 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/math/py-sympy/sympy-1.9/sympy/polys/
H A Dsqfreetools.py33 def dup_sqf_p(f, K): argument
55 def dmp_sqf_p(f, u, K): argument
77 def dup_sqf_norm(f, K): argument
121 def dmp_sqf_norm(f, u, K): argument
171 def dmp_norm(f, u, K): argument
184 def dup_gf_sqf_part(f, K): argument
191 def dmp_gf_sqf_part(f, u, K): argument
196 def dup_sqf_part(f, K): argument
228 def dmp_sqf_part(f, u, K): argument
458 def dup_gff_list(f, K): argument
[all …]
H A Deuclidtools.py51 def dup_half_gcdex(f, g, K): argument
103 def dup_gcdex(f, g, K): argument
130 def dmp_gcdex(f, g, u, K): argument
147 def dup_invert(f, g, K): argument
178 def dmp_invert(f, g, u, K): argument
1590 def dup_gcd(f, g, K): argument
1607 def dmp_gcd(f, g, u, K): argument
1627 def dup_rr_lcm(f, g, K): argument
1652 def dup_ff_lcm(f, g, K): argument
1675 def dup_lcm(f, g, K): argument
[all …]
H A Ddensetools.py39 def dup_integrate(f, m, K): argument
138 def dup_diff(f, m, K): argument
181 def dmp_diff(f, m, u, K): argument
262 def dup_eval(f, a, K): argument
432 def dup_trunc(f, p, K): argument
506 def dup_monic(f, K): argument
571 def dup_content(f, K): argument
826 def dup_mirror(f, K): argument
848 def dup_scale(f, a, K): argument
870 def dup_shift(f, a, K): argument
[all …]
H A Dgaloistools.py15 def gf_crt(U, M, K=None): argument
60 def gf_crt1(M, K): argument
151 def gf_LC(f, K): argument
171 def gf_TC(f, K): argument
235 def gf_normal(f, p, K): argument
347 def gf_neg(f, p, K): argument
457 def gf_add(f, g, p, K): argument
492 def gf_sub(f, g, p, K): argument
527 def gf_mul(f, g, p, K): argument
558 def gf_sqr(f, p, K): argument
[all …]
H A Dfactortools.py125 def dup_zz_mignotte_bound(f, K): argument
315 def dup_zz_zassenhaus(f, K): argument
418 def dup_zz_irreducible_p(f, K): argument
578 def dup_zz_factor_sqf(f, K): argument
607 def dup_zz_factor(f, K): argument
1092 def dmp_zz_factor(f, u, K): argument
1223 def dup_ext_factor(f, K): argument
1254 def dmp_ext_factor(f, u, K): argument
1284 def dup_gf_factor(f, K): argument
1296 def dmp_gf_factor(f, u, K): argument
[all …]
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/albertagrid/
H A Dalgebra.hh17 vectorProduct ( const FieldVector< K, 3 > &u, const FieldVector< K, 3 > &v ) in vectorProduct()
34 inline static K determinant ( const FieldMatrix< K, 1, 1 > &matrix ) in determinant()
40 inline static K determinant ( const FieldMatrix< K, 1, m > &matrix ) in determinant()
50 inline static K determinant ( const FieldMatrix< K, 2, 2 > &matrix ) in determinant()
56 inline static K determinant ( const FieldMatrix< K, 2, 3 > &matrix ) in determinant()
79 inline static K invert ( [[maybe_unused]] const FieldMatrix< K, 0, m > &matrix, in invert()
86 inline static K invert ( const FieldMatrix< K, 1, 1 > &matrix, in invert()
94 inline static K invert ( const FieldMatrix< K, 1, m > &matrix, in invert()
106 inline static K invert ( const FieldMatrix< K, 2, 2 > &matrix, in invert()
119 inline static K invert ( const FieldMatrix< K, 2, m > &matrix, in invert()
[all …]
/dports/math/givaro/givaro-4.1.1/src/kernel/recint/
H A Drmmul.h83 inline __RECINT_IS_ARITH(T, rmint<K, MG>&) operator*=(rmint<K, MG>& a, const T& b) { in __RECINT_IS_ARITH()
97 inline __RECINT_IS_ARITH(T, rmint<K, MG>) operator*(const rmint<K, MG>& b, const T& c) { in __RECINT_IS_ARITH()
104 inline __RECINT_IS_ARITH(T, rmint<K, MG>) operator*(const T& c, const rmint<K, MG>& b) { in __RECINT_IS_ARITH()
119 inline void mul(rmint<K, MG>& a, const rmint<K, MG>& b, const rmint<K, MG>& c) { in mul()
127 inline void mul(rmint<K, MG>& a, const rmint<K, MG>& b) { in mul()
142 inline void square(rmint<K, MG>& a, const rmint<K, MG>& b) { in square()
150 inline void square(rmint<K, MG>& a) { in square()
/dports/security/liboqs/liboqs-0.7.0/src/kem/ntru/pqclean_ntruhps2048677_clean/
H A Dpoly_rq_mul.c8 #define K (L/16) macro
84 static void toom4_k2x2_eval_0(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_0()
91 static void toom4_k2x2_eval_p1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p1()
101 static void toom4_k2x2_eval_m1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m1()
111 static void toom4_k2x2_eval_p2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p2()
121 static void toom4_k2x2_eval_m2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m2()
131 static void toom4_k2x2_eval_p3(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p3()
141 static void toom4_k2x2_eval_inf(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_inf()
148 static inline void k2x2_eval(uint16_t r[9 * K]) { in k2x2_eval()
166 …tic void toom4_k2x2_basemul(uint16_t r[18 * K], const uint16_t a[9 * K], const uint16_t b[9 * K]) { in toom4_k2x2_basemul()
[all …]
/dports/security/liboqs/liboqs-0.7.0/src/kem/ntru/pqclean_ntruhrss701_clean/
H A Dpoly_rq_mul.c8 #define K (L/16) macro
84 static void toom4_k2x2_eval_0(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_0()
91 static void toom4_k2x2_eval_p1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p1()
101 static void toom4_k2x2_eval_m1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m1()
111 static void toom4_k2x2_eval_p2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p2()
121 static void toom4_k2x2_eval_m2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m2()
131 static void toom4_k2x2_eval_p3(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p3()
141 static void toom4_k2x2_eval_inf(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_inf()
148 static inline void k2x2_eval(uint16_t r[9 * K]) { in k2x2_eval()
166 …tic void toom4_k2x2_basemul(uint16_t r[18 * K], const uint16_t a[9 * K], const uint16_t b[9 * K]) { in toom4_k2x2_basemul()
[all …]
/dports/security/liboqs/liboqs-0.7.0/src/kem/ntru/pqclean_ntruhps2048509_clean/
H A Dpoly_rq_mul.c8 #define K (L/16) macro
84 static void toom4_k2x2_eval_0(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_0()
91 static void toom4_k2x2_eval_p1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p1()
101 static void toom4_k2x2_eval_m1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m1()
111 static void toom4_k2x2_eval_p2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p2()
121 static void toom4_k2x2_eval_m2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m2()
131 static void toom4_k2x2_eval_p3(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p3()
141 static void toom4_k2x2_eval_inf(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_inf()
148 static inline void k2x2_eval(uint16_t r[9 * K]) { in k2x2_eval()
166 …tic void toom4_k2x2_basemul(uint16_t r[18 * K], const uint16_t a[9 * K], const uint16_t b[9 * K]) { in toom4_k2x2_basemul()
[all …]
/dports/security/liboqs/liboqs-0.7.0/src/kem/ntru/pqclean_ntruhps4096821_clean/
H A Dpoly_rq_mul.c8 #define K (L/16) macro
84 static void toom4_k2x2_eval_0(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_0()
91 static void toom4_k2x2_eval_p1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p1()
101 static void toom4_k2x2_eval_m1(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m1()
111 static void toom4_k2x2_eval_p2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p2()
121 static void toom4_k2x2_eval_m2(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_m2()
131 static void toom4_k2x2_eval_p3(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_p3()
141 static void toom4_k2x2_eval_inf(uint16_t r[9 * K], const uint16_t a[M]) { in toom4_k2x2_eval_inf()
148 static inline void k2x2_eval(uint16_t r[9 * K]) { in k2x2_eval()
166 …tic void toom4_k2x2_basemul(uint16_t r[18 * K], const uint16_t a[9 * K], const uint16_t b[9 * K]) { in toom4_k2x2_basemul()
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/matrices/
H A Ddensesolve.py22 def row_echelon(matlist, K): argument
55 def rref(matlist, K): argument
86 def LU(matlist, K, reverse = 0): argument
119 def cholesky(matlist, K): argument
152 def LDL(matlist, K): argument
186 def upper_triangle(matlist, K): argument
213 def lower_triangle(matlist, K): argument
240 def rref_solve(matlist, variable, constant, K): argument
279 def LU_solve(matlist, variable, constant, K): argument
322 def cholesky_solve(matlist, variable, constant, K): argument
[all …]

12345678910>>...740