| /dports/devel/gdb/gdb-11.1/gdb/testsuite/gdb.cp/ |
| H A D | nsalias.exp | 71 {name int}
229 set permutations {}
230 lappend permutations "outer"
231 lappend permutations "Outer"
232 lappend permutations "outer::inner"
233 lappend permutations "Outer::inner"
234 lappend permutations "outer::Inner"
235 lappend permutations "Outer::Inner"
236 lappend permutations "outer::inner::innermost"
245 foreach p $permutations {
[all …]
|
| /dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/stats/distance/ |
| H A D | _mantel.py | 21 def mantel(x, y, method='pearson', permutations=999, alternative='two-sided', argument
262 if permutations < 0:
280 if permutations == 0 or np.isnan(orig_stat):
284 for _ in range(permutations))
285 permuted_stats = np.fromiter(perm_gen, np.float, count=permutations)
295 p_value = (count_better + 1) / (permutations + 1)
301 def pwmantel(dms, labels=None, method='pearson', permutations=999, argument
405 ('p-value', float), ('n', int), ('method', object),
406 ('permutations', int), ('alternative', object)]
416 stat, p_val, n = mantel(x, y, method=method, permutations=permutations,
[all …]
|
| H A D | _permanova.py | 18 def permanova(distance_matrix, grouping, column=None, permutations=999): argument
102 permutations)
105 stat, p_value, permutations)
114 grouping_matrix = -1 * np.ones((sample_size, sample_size), dtype=int)
|
| /dports/lang/nim/nim-1.6.2/tests/iter/ |
| H A D | tpermutations.nim | 15 iterator permutations*[T](ys: openarray[T]): tuple[perm: seq[T], sign: int] =
18 c = newSeq[int](ys.len)
42 for sigma, sign in n.permutations:
43 result += sign.float * n.map((i: int) => a[i][sigma[i]]).foldl(a * b)
47 for sigma, sign in n.permutations:
48 result += n.map((i: int) => a[i][sigma[i]]).foldl(a * b)
|
| /dports/math/gsl/gsl-2.7/doc/ |
| H A D | permutation.rst | 1 .. index:: permutations
10 permutations. A permutation :math:`p` is represented by an array of
19 Note that the permutations produced by the linear algebra routines
80 permutations.
135 .. index:: iterating through permutations
141 permutations are available it returns :macro:`GSL_FAILURE` and leaves
144 permutations of a given order.
204 Reading and writing permutations
285 many applications in the theory of permutations.
334 permutations, starting from the identity,
[all …]
|
| /dports/print/py-fonttools3/fonttools-3.44.0/Lib/fontTools/varLib/ |
| H A D | interpolatable.py | 86 permutations = itertools.permutations(range(n))
87 best = list(next(permutations))
89 for p in permutations:
126 int(size),
127 int(stats.meanX),
128 int(stats.meanY),
129 int(stats.stddevX * 2),
130 int(stats.stddevY * 2),
131 int(stats.correlation * size),
|
| /dports/graphics/py-giddy/giddy-2.3.3/giddy/ |
| H A D | rank.py | 104 self.permutations = permutations
105 if permutations:
111 den = permutations + 1.0
366 self.pairs_spatial = int(w.s0 / 2.0)
370 if permutations > 0:
609 self.sign = concor_sign.astype(int)
611 if permutations > 0:
630 1 + permutations
775 self.sign = concor_sign.astype(int)
777 if permutations > 0:
[all …]
|
| /dports/science/py-esda/esda-2.4.1/esda/ |
| H A D | crand.py | 38 def vec_permutations(max_card: int, n: int, k_replications: int, seed: int): argument
68 z, w, observed, permutations, keep, n_jobs, stat_func, scaling=None, seed=None argument
164 permuted_ids = vec_permutations(max_card, n, permutations, seed)
211 low_extreme = (permutations - larger) < larger
212 larger[low_extreme] = permutations - larger[low_extreme]
213 p_sim = (larger + 1.0) / (permutations + 1.0)
220 chunk_start: int, argument
312 def build_weights_offsets(cardinalities: np.ndarray, n_chunks: int): argument
344 n_jobs: int, argument
422 n_jobs: int, argument
|
| /dports/textproc/kdiff3/kdiff3-1.9.4/test/ |
| H A D | generate_testdata_from_permutations.py | 34 def permutations(nr_of_options, count, currentlist): function
75 permutations(nr_of_options, count - 1, [optionindex] + currentlist)
86 parser.add_argument('-r', metavar='num', nargs='?', type=int, default=len(options), const=len(optio…
88 parser.add_argument('-s', metavar='num', nargs='?', type=int, default=0, const=0,
99 permutations(args.r, len(defaultlines), [])
|
| /dports/math/maxima/maxima-5.43.2/share/combinatorics/ |
| H A D | README | 9 I have added a package that implements some of the permutations
13 Since Maxima's nset package already includes functions permutations
15 list, I have used the name "perm" for permutations written as a list
16 of the first n positive integers without repetitions. Thus, perms(int)
17 will give the list of permutations of degree n, in contrast to
18 permutations(set) which gives that list of permutations applied to the
32 perms_lex returns the list of permutations of degree n in
35 perms(n) gives tht complete list of permutations using a
|
| /dports/lang/cython/Cython-0.29.24/Demos/benchmarks/ |
| H A D | nqueens.py | 24 @cython.locals(n=int, i=int, j=int)
25 def permutations(iterable): function
47 @cython.locals(queen_count=int, i=int, vec=list)
61 for vec in permutations(cols):
|
| /dports/lang/cython-devel/cython-2b1e743/Demos/benchmarks/ |
| H A D | nqueens.py | 24 @cython.locals(n=int, i=int, j=int)
25 def permutations(iterable): function
47 @cython.locals(queen_count=int, i=int, vec=list)
61 for vec in permutations(cols):
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/lld/test/MachO/tools/ |
| H A D | generate-cfi-funcs.py | 12 from itertools import permutations
19 saved_regs_combined = list(list(permutations(saved_regs, i))
94 parser.add_argument('--pages', type=int, default=2,
96 parser.add_argument('--functions', type=int, default=None,
98 parser.add_argument('--encodings', type=int, default=127,
100 parser.add_argument('--lsda', type=int, default=0,
|
| /dports/print/py-fonttools/fonttools-4.28.2/Lib/fontTools/varLib/ |
| H A D | interpolatable.py | 98 permutations = itertools.permutations(range(n))
99 best = list(next(permutations))
101 for p in permutations:
161 int(size),
162 int(stats.meanX),
163 int(stats.meanY),
164 int(stats.stddevX * 2),
165 int(stats.stddevY * 2),
166 int(stats.correlation * size),
372 sys.exit(int(bool(problems)))
|
| /dports/lang/nim/nim-1.6.2/tests/controlflow/ |
| H A D | tcontrolflow.nim | 28 iterator foo: int =
37 iterator permutations: int =
40 for p in permutations():
83 x, y: int
|
| /dports/graphics/py-pointpats/pointpats-2.2.0/pointpats/ |
| H A D | spacetime.py | 243 if permutations:
244 joint = np.zeros((permutations, 1), int)
245 for p in range(permutations):
251 if (permutations - larger) < larger:
252 larger = permutations - larger
347 if not permutations:
352 for i in range(permutations):
453 if not permutations:
458 for p in range(permutations):
580 if not permutations:
[all …]
|
| /dports/science/py-hiphive/hiphive-0.7.1/hiphive/core/ |
| H A D | orbits.py | 22 permutations, prim, symprec): argument
59 permutations = prepare_permutations(permutations)
69 cell, rotations, permutations)
75 def prepare_permutations(permutations): argument
77 for p in permutations:
108 permutation_map = np.zeros((len(atoms), len(rotations)), dtype=int)
130 rotations, permutations): argument
146 populate_orbit(orbit, permutations, clusters,
175 def populate_orbit(orbit, permutations, clusters, argument
189 perm_index = permutations.index(argsort)
|
| /dports/math/py-nevergrad/nevergrad-0.4.3.post2/nevergrad/optimization/ |
| H A D | sequences.py | 38 …self, dimension: int, budget: tp.Optional[int] = None, random_state: tp.Optional[RandomState] = No… argument
92 dimension: int, argument
93 budget: int, argument
100 self.permutations = np.zeros((dimension, budget), dtype=int)
102 self.permutations[k] = self.random_state.permutation(budget)
111 x = self.permutations[:, self.index].tolist()
120 dimension: int, argument
121 budget: int, argument
164 dimension: int, argument
172 def vdc(self, n: int, permut: tp.List[int]) -> float: # TODO speed up? argument
[all …]
|