| /dports/math/fxt/fxt/src/perm/ |
| H A D | permq.cc | 14 is_identity(const ulong *f, ulong n) in is_identity()
24 has_fixed_points(const ulong *f, ulong n) in has_fixed_points()
44 count_descents(const ulong *f, ulong n) in count_descents()
50 for (ulong k=1; k<n; ++k) in count_descents() local
81 for (ulong k=1; k<n; ++k) in count_inversions() local
138 is_connected(const ulong *f, ulong n) in is_connected()
172 is_cyclic(const ulong *f, ulong n) in is_cyclic()
176 ulong k = 0, e = 0; in is_cyclic() local
196 ulong k; in is_valid_permutation() local
259 get_index(const ulong *f, ulong n) in get_index()
[all …]
|
| /dports/benchmarks/stress-ng/stress-ng-0.13.09/ |
| H A D | stress-matrix-3d.c | 92 register size_t k; in stress_matrix_3d_xyz_add() local
113 register size_t k; in stress_matrix_3d_zyx_add() local
167 register size_t k; in stress_matrix_3d_zyx_sub() local
223 register size_t k; in stress_matrix_3d_zyx_trans() local
282 register size_t k; in stress_matrix_3d_zyx_mult() local
342 register size_t k; in stress_matrix_3d_zyx_div() local
401 register size_t k; in stress_matrix_3d_zyx_hadamard() local
461 register size_t k; in stress_matrix_3d_zyx_frobenius() local
521 register size_t k; in stress_matrix_3d_zyx_copy() local
577 register size_t k; in stress_matrix_3d_zyx_mean() local
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/util/ |
| H A D | CombinationsTest.java | 34 final int n = 5; in testAccessor1() local
35 final int k = 3; in testAccessor1() local
40 final int n = 5; in testAccessor2() local
41 final int k = 3; in testAccessor2() local
61 final int n = 5; in testLexicographicComparatorWrongIterate1() local
62 final int k = 3; in testLexicographicComparatorWrongIterate1() local
70 final int k = 3; in testLexicographicComparatorWrongIterate2() local
78 final int k = 3; in testLexicographicComparatorWrongIterate3() local
86 final int k = 3; in testLexicographicComparatorWrongIterate4() local
94 final int k = 3; in testLexicographicComparator() local
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/glm/test/core/ |
| H A D | core_func_integer_find_msb.cpp | 21 int n; in nlz1() local
34 int n; in nlz1a() local
50 int n; in nlz2() local
65 int n, c; in nlz2a() local
77 int y, n; in nlz3() local
90 int y, m, n; in nlz4() local
149 int n; in nlz6() local
161 int n; in nlz7() local
183 int n; in nlz8() local
204 int n; in nlz9() local
[all …]
|
| /dports/emulators/mame/mame-mame0226/3rdparty/glm/test/core/ |
| H A D | core_func_integer_find_msb.cpp | 21 int n; in nlz1() local
34 int n; in nlz1a() local
50 int n; in nlz2() local
65 int n, c; in nlz2a() local
77 int y, n; in nlz3() local
90 int y, m, n; in nlz4() local
149 int n; in nlz6() local
161 int n; in nlz7() local
183 int n; in nlz8() local
204 int n; in nlz9() local
[all …]
|
| /dports/games/warzone2100/warzone2100/3rdparty/glm/test/core/ |
| H A D | core_func_integer_find_msb.cpp | 18 int n; in nlz1() local
31 int n; in nlz1a() local
47 int n; in nlz2() local
62 int n, c; in nlz2a() local
74 int y, n; in nlz3() local
87 int y, m, n; in nlz4() local
147 int n; in nlz6() local
160 int n; in nlz7() local
183 int n; in nlz8() local
205 int n; in nlz9() local
[all …]
|
| /dports/graphics/nanort/nanort-b1feea8/examples/common/glm/test/core/ |
| H A D | core_func_integer_find_msb.cpp | 21 int n; in nlz1() local
34 int n; in nlz1a() local
50 int n; in nlz2() local
65 int n, c; in nlz2a() local
77 int y, n; in nlz3() local
90 int y, m, n; in nlz4() local
149 int n; in nlz6() local
161 int n; in nlz7() local
183 int n; in nlz8() local
204 int n; in nlz9() local
[all …]
|
| /dports/math/glm/glm-0.9.9.8/test/core/ |
| H A D | core_func_integer_find_msb.cpp | 18 int n; in nlz1() local
31 int n; in nlz1a() local
47 int n; in nlz2() local
62 int n, c; in nlz2a() local
74 int y, n; in nlz3() local
87 int y, m, n; in nlz4() local
147 int n; in nlz6() local
160 int n; in nlz7() local
183 int n; in nlz8() local
205 int n; in nlz9() local
[all …]
|
| /dports/math/fxt/fxt/src/comb/ |
| H A D | composition-rank.h | 30 explicit composition_rank(ulong n, ulong k) in composition_rank()
38 bool is_comp(const ulong *x, ulong n, ulong k) const in is_comp()
46 ulong rank_lex(const ulong *x, ulong n, ulong k) const in rank_lex()
59 ulong rank_gray(const ulong *x, ulong n, ulong k) const in rank_gray()
74 ulong rank_enup_rev(const ulong *x, ulong n, ulong k) const in rank_enup_rev()
89 ulong rank_enup(const ulong *x, ulong n, ulong k) const in rank_enup()
97 ulong unrank_get_el(ulong n, ulong k, ulong &r) const in unrank_get_el()
117 void unrank_lex(ulong *x, ulong n, ulong k, ulong r) const in unrank_lex()
130 void unrank_gray(ulong *x, ulong n, ulong k, ulong r) const in unrank_gray()
144 void unrank_enup(ulong *x, ulong n, ulong k, ulong r) const in unrank_enup()
[all …]
|
| H A D | fact2perm-swp.cc | 12 perm2ffact_swp(const ulong *x, ulong n, ulong *fc) in perm2ffact_swp()
25 for (ulong k=0; k<n-1; ++k) in perm2ffact_swp() local
37 ffact2perm_swp(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in ffact2perm_swp()
46 for (ulong k=0; k<n-1; ++k) in ffact2perm_swp() local
55 ffact2invperm_swp(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in ffact2invperm_swp()
64 ulong k = n-2; in ffact2invperm_swp() local
76 perm2rfact_swp(const ulong *x, ulong n, ulong *fc) in perm2rfact_swp()
89 for (ulong k=0; k<n-1; ++k) in perm2rfact_swp() local
101 rfact2perm_swp(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in rfact2perm_swp()
120 rfact2invperm_swp(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in rfact2invperm_swp()
[all …]
|
| H A D | fact2perm.cc | 13 perm2ffact(const ulong *x, ulong n, ulong *fc) in perm2ffact()
24 for (ulong k=0; k<n-1; ++k) in perm2ffact() local
35 ffact2perm(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in ffact2perm()
45 for (ulong k=0; k<n-1; ++k) in ffact2perm() local
54 ffact2invperm(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in ffact2invperm()
64 for (ulong k=n-2; (long)k>=0; --k) in ffact2invperm() local
74 perm2rfact(const ulong *x, ulong n, ulong *fc) in perm2rfact()
84 for (ulong k=1; k<n; ++k) in perm2rfact() local
95 rfact2perm(const ulong *fc, ulong n, ulong *x, bool iq/*=true*/) in rfact2perm()
127 for (ulong k=0; k<n-1; ++k, ++y) in rfact2invperm() local
[all …]
|
| /dports/devel/gcem/gcem-1.13.1/include/gcem_incl/ |
| H A D | binomial_coef.hpp | 30 binomial_coef_recur(const T n, const T k) in binomial_coef_recur()
43 binomial_coef_check(const T n, const T k) in binomial_coef_check()
52 binomial_coef_check(const T n, const T k) in binomial_coef_check()
64 binomial_coef_type_check(const T1 n, const T2 k) in binomial_coef_type_check()
85 binomial_coef(const T1 n, const T2 k) in binomial_coef()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/fe/ |
| H A D | fe_poly_tensor.cc | 541 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
566 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
593 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
634 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
673 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
700 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
742 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
802 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
895 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
1131 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_face_values() local
[all …]
|
| /dports/math/dbcsr/dbcsr-2.1.0/src/acc/libsmm_acc/parameters/ |
| H A D | parameters_V100.json | 10 {"m": 4, "n": 4, "k": 12, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
12 {"m": 4, "n": 4, "k": 14, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
14 {"m": 4, "n": 4, "k": 16, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
15 {"m": 4, "n": 4, "k": 17, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
16 {"m": 4, "n": 4, "k": 18, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
17 {"m": 4, "n": 4, "k": 19, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
18 {"m": 4, "n": 4, "k": 20, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
19 {"m": 4, "n": 4, "k": 21, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
22 {"m": 4, "n": 4, "k": 24, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
25 {"m": 4, "n": 4, "k": 27, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
[all …]
|
| /dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/acc/libsmm_acc/parameters/ |
| H A D | parameters_V100.json | 10 {"m": 4, "n": 4, "k": 12, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
12 {"m": 4, "n": 4, "k": 14, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
14 {"m": 4, "n": 4, "k": 16, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
15 {"m": 4, "n": 4, "k": 17, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
16 {"m": 4, "n": 4, "k": 18, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
17 {"m": 4, "n": 4, "k": 19, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
18 {"m": 4, "n": 4, "k": 20, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
19 {"m": 4, "n": 4, "k": 21, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
22 {"m": 4, "n": 4, "k": 24, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
25 {"m": 4, "n": 4, "k": 27, "threads": 32, "grouping": 2, "minblocks": 1, "algorithm": "tiny", "sourc… number
[all …]
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/sodiumoxide-0.2.7/src/crypto/stream/ |
| H A D | stream_macros.rs | 149 let k = gen_key(); localVariable
150 let n = gen_random_nonce(); localVariable
162 let k = gen_key(); localVariable
163 let n = gen_random_nonce(); localVariable
179 let k = gen_key(); localVariable
180 let n = gen_random_nonce(); localVariable
196 let k = gen_key(); localVariable
209 let k = gen_key(); localVariable
225 let k = gen_key(); localVariable
244 let k = gen_key(); localVariable
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/lib/ |
| H A D | klist.c | 94 static void add_head(struct klist *k, struct klist_node *n) in add_head()
101 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
108 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
122 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
134 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
148 struct klist *k = knode_klist(pos); in klist_add_behind() local
164 struct klist *k = knode_klist(pos); in klist_add_before() local
211 struct klist *k = knode_klist(n); in klist_put() local
228 void klist_del(struct klist_node *n) in klist_del()
238 void klist_remove(struct klist_node *n) in klist_remove()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/lib/ |
| H A D | klist.c | 94 static void add_head(struct klist *k, struct klist_node *n) in add_head()
101 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
108 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
122 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
134 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
148 struct klist *k = knode_klist(pos); in klist_add_behind() local
164 struct klist *k = knode_klist(pos); in klist_add_before() local
211 struct klist *k = knode_klist(n); in klist_put() local
228 void klist_del(struct klist_node *n) in klist_del()
238 void klist_remove(struct klist_node *n) in klist_remove()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/lib/ |
| H A D | klist.c | 94 static void add_head(struct klist *k, struct klist_node *n) in add_head()
101 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
108 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
122 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
134 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
148 struct klist *k = knode_klist(pos); in klist_add_behind() local
164 struct klist *k = knode_klist(pos); in klist_add_before() local
211 struct klist *k = knode_klist(n); in klist_put() local
228 void klist_del(struct klist_node *n) in klist_del()
238 void klist_remove(struct klist_node *n) in klist_remove()
[all …]
|
| /dports/math/fxt/fxt/src/sort/ |
| H A D | usearch.h | 12 inline ulong first_eq_idx(const Type *f, ulong n, Type v) in first_eq_idx()
16 ulong k = 0; in first_eq_idx() local
28 ulong k; in first_eq_idx_large() local
53 ulong k = 0; in first_neq_idx() local
84 inline ulong last_eq_idx(const Type *f, ulong n, Type v) in last_eq_idx()
88 ulong k = n-1; in last_eq_idx() local
104 ulong k = n-1; in last_neq_idx() local
120 ulong k = n-1; in last_geq_idx() local
136 ulong k = n-1; in last_leq_idx() local
144 bool u_unique(const Type *f, ulong n) in u_unique()
[all …]
|
| /dports/math/fxt/fxt/demo/perm/ |
| H A D | perm-decomp-demo.cc | 25 for (ulong k=0; k<n; ++k) in swap() local
46 for (ulong k=0; k<n; ++k, start += step) in is_seq() local
59 hswap(ulong *f, ulong n) in hswap()
65 pswap(ulong *f, ulong n) in pswap()
72 qtest(const ulong *f, ulong n) in qtest()
76 for (ulong k=0; k<n; k+=n4) in qtest() local
81 for (ulong k=0; k<n; k+=n4) in qtest() local
247 void perm1(ulong *f, ulong n) in perm1()
250 for (ulong k=2; k<=n; k*=2) in perm1() local
318 ulong n = 1UL << ldn; in main() local
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rrel/ |
| H A D | rrel_muse_table.cxx | 20 rrel_muse_table::expected_kth( unsigned int k, unsigned int n ) in expected_kth()
31 rrel_muse_table::standard_dev_kth( unsigned int k, unsigned int n ) in standard_dev_kth()
42 rrel_muse_table::muset_divisor( unsigned int k, unsigned int n ) in muset_divisor()
54 rrel_muse_table::muset_sq_divisor( unsigned int k, unsigned int n ) in muset_sq_divisor()
65 rrel_muse_table::calculate_all( unsigned int k, unsigned int n, in calculate_all()
76 rrel_muse_table::calculate_expected( unsigned int k, unsigned int n ) const in calculate_expected()
83 rrel_muse_table::calculate_standard_dev( unsigned int k, unsigned int n, in calculate_standard_dev()
121 rrel_muse_table::calculate_divisor( unsigned int /* k */, unsigned int n, in calculate_divisor()
128 rrel_muse_table::calculate_sq_divisor( unsigned int k, unsigned int n, in calculate_sq_divisor()
|
| /dports/math/yices/yices-2.6.2/src/terms/ |
| H A D | bv_constants.c | 232 uint32_t k; in bvconstant_set_bitsize() local
253 uint32_t k; in bvconstant_set_all_zero() local
265 uint32_t k; in bvconstant_set_all_one() local
278 uint32_t k; in bvconstant_copy() local
292 uint32_t k; in bvconstant_copy64() local
1595 int32_t n, p; in bvconst_is_power_of_two() local
1638 int32_t n, p; in bvconst_ctz() local
1684 uint32_t k; in bvconst_le() local
1729 uint32_t k; in bvconst_hash() local
1750 uint32_t k; in unsigned_bv2mpz() local
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/util/ |
| H A D | CombinatoricsUtils.java | 77 public static long binomialCoefficient(final int n, final int k) in binomialCoefficient()
158 public static double binomialCoefficientDouble(final int n, final int k) in binomialCoefficientDouble()
203 public static double binomialCoefficientLog(final int n, final int k) in binomialCoefficientLog()
275 public static long factorial(final int n) throws NotPositiveException, MathArithmeticException { in factorial()
299 public static double factorialDouble(final int n) throws NotPositiveException { in factorialDouble()
317 public static double factorialLog(final int n) throws NotPositiveException { in factorialLog()
351 public static long stirlingS2(final int n, final int k) in stirlingS2()
438 public static Iterator<int[]> combinationsIterator(int n, int k) { in combinationsIterator()
450 public static void checkBinomial(final int n, in checkBinomial()
451 final int k) in checkBinomial()
|
| /dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/minivector/ |
| H A D | eig3.cpp | 12 #define n 3 macro
20 static void tred2(double V[n][n], double d[n], double e[n]) { in tred2()
39 for (int k = 0; k < i; k++) { in tred2() local
53 for (int k = 0; k < i; k++) { in tred2() local
110 for (int k = 0; k <= i; k++) { in tred2() local
115 for (int k = 0; k <= i; k++) { in tred2() local
118 for (int k = 0; k <= i; k++) { in tred2() local
123 for (int k = 0; k <= i; k++) { in tred2() local
137 static void tql2(double V[n][n], double d[n], double e[n]) { in tql2()
235 int k = i; in tql2() local
[all …]
|