| /dports/lang/guile2/guile-2.2.7/gc-benchmarks/larceny/ |
| H A D | perm.sch | 23 ; The perm9 benchmark generates a list of all 362880 permutations of
25 ; bytes), all of which goes into the generated list. (That is, the
28 ; an unshared list of permutations. The generated permutations are
42 ; with individually computed copies of all permutations of a list of
49 ; over all permutations.
118 ; Given a list of lists of numbers, returns the sum of the sums
228 (sort!! (list-copy list) less?))
264 (queue (make-vector k '())))
270 (begin (vector-set! queue i (permutations (one..n n)))
278 (begin (vector-set! queue
[all …]
|
| /dports/lang/guile/guile-3.0.7/gc-benchmarks/larceny/ |
| H A D | perm.sch | 23 ; The perm9 benchmark generates a list of all 362880 permutations of
25 ; bytes), all of which goes into the generated list. (That is, the
28 ; an unshared list of permutations. The generated permutations are
42 ; with individually computed copies of all permutations of a list of
49 ; over all permutations.
118 ; Given a list of lists of numbers, returns the sum of the sums
228 (sort!! (list-copy list) less?))
264 (queue (make-vector k '())))
270 (begin (vector-set! queue i (permutations (one..n n)))
278 (begin (vector-set! queue
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/math-lib/math/private/number-theory/ |
| H A D | factorial.rkt | 5 (provide factorial permutations multinomial)
9 ;; The number of factorials whose flonum representation is finite
16 (list->vector
22 (build-list (- fact-table-size 1) add1)))))
30 (cond [(n . < . fact-table-size) (vector-ref fact-table n)]
50 (: permutations (case-> (Integer Zero -> One)
53 (define (permutations n k) function
54 (cond [(negative? n) (raise-argument-error 'permutations "Natural" 0 n k)]
55 [(negative? k) (raise-argument-error 'permutations "Natural" 1 n k)]
|
| /dports/lang/racket/racket-8.3/collects/racket/ |
| H A D | list.rkt | 56 permutations
631 (vector->list a))
644 (define v (list->vector l))
682 (begin0 (for/list ([i (in-vector k*)]) (vector-ref v i))
713 ;; returns a list of reverses of permutations in lexical order of the input,
716 ;; (permutations (reverse l))) is a list of lexicographically-ordered
717 ;; permutations (but of course has no shared tails at all -- I couldn't find
726 ;; an efficient `in-permutations'. It uses a vector to hold state -- it's easy
727 ;; to avoid this and use a list instead (in the loop, the part of the c vector
754 ;; use a byte-string instead of a vector -- doesn't matter much for
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/racket/ |
| H A D | list.rkt | 56 permutations
631 (vector->list a))
644 (define v (list->vector l))
682 (begin0 (for/list ([i (in-vector k*)]) (vector-ref v i))
713 ;; returns a list of reverses of permutations in lexical order of the input,
716 ;; (permutations (reverse l))) is a list of lexicographically-ordered
717 ;; permutations (but of course has no shared tails at all -- I couldn't find
726 ;; an efficient `in-permutations'. It uses a vector to hold state -- it's easy
727 ;; to avoid this and use a list instead (in the loop, the part of the c vector
754 ;; use a byte-string instead of a vector -- doesn't matter much for
[all …]
|
| /dports/math/R-cran-combinat/combinat/man/ |
| H A D | permn.Rd | 4 \title{ Generates all permutations of the elements of x }
6 Generates all permutations of the elements of x, in a minimal-
7 change order. If x is a positive integer, returns all permutations
8 of the elements of seq(x). If argument "fun" is not null, applies
17 \item{x}{ vector }
24 list: each component is either a permutation, or the
25 results of applying fun to a permutation
36 # Convert output to a matrix of dim c(6, 720)
38 # A check that every element occurs the same number of times in each
|
| /dports/math/fricas/fricas-1.3.7/src/input/ |
| H A D | perm.input | 5 -- This file demonstrates some of the new routines for permutations.
12 -- Usually permutations are given as a product of cycles,
33 -- Since these permutations generate a group, you can
35 -- You may have to be careful, because permutations are viewed
66 -- They are represented as a list of generating permutations:
90 -- corresponding vector space
95 -- Now we can write down the action of our matrices on this list vl
96 -- as a list of pairs
107 -- and we can coerce these lists to permutations
128 -- We can also ask for the orbit of the unordered set of vectors
[all …]
|
| /dports/math/gap/gap-4.11.0/lib/ |
| H A D | ctblauto.gi | 29 permutations, # list of perms for each family
30 families, # list of members of each family
34 famlengths, # list of lengths of the families
102 ## <K> a list of generators for a subgroup $K$ of $G$,
109 ## for a family <rows> of rows with representative (i.e., sorted vector)
149 # a list of same length as `permutations';
150 # `allowed[<i>]' is the list of all <x> in `permutations' where the
255 # `LL' is a list of generators of $LL$.
448 # Split `nonfixedpoints[j]' according to the entries of the vector.
946 # `family[<k>]' is the list of all
[all …]
|
| /dports/math/R-cran-spdep/spdep/man/ |
| H A D | lee.mc.Rd | 7 …calculated by using nsim random permutations of x and y for the given spatial weighting scheme, to…
14 \item{x}{a numeric vector the same length as the neighbours list in listw}
15 \item{y}{a numeric vector the same length as the neighbours list in listw}
17 \item{nsim}{number of permutations}
21 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
22 …em{return_boot}{return an object of class \code{boot} from the equivalent permutation bootstrap ra…
26 A list with class \code{htest} and \code{mc.sim} containing the following components:
27 \item{statistic}{the value of the observed Lee's L.}
28 \item{parameter}{the rank of the observed Lee's L.}
29 \item{p.value}{the pseudo p-value of the test.}
[all …]
|
| H A D | geary.mc.Rd | 6 …ic calculated by using nsim random permutations of x for the given spatial weighting scheme, to es…
13 \item{x}{a numeric vector the same length as the neighbours list in listw}
15 \item{nsim}{number of permutations}
18 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
19 …default TRUE, if FALSE the number of observations is not adjusted for no-neighbour observations, i…
20 …em{return_boot}{return an object of class \code{boot} from the equivalent permutation bootstrap ra…
24 A list with class \code{htest} and \code{mc.sim} containing the following components:
25 \item{statistic}{the value of the observed Geary's C.}
26 \item{parameter}{the rank of the observed Geary's C.}
27 \item{p.value}{the pseudo p-value of the test.}
[all …]
|
| H A D | moran.mc.Rd | 7 …ic calculated by using nsim random permutations of x for the given spatial weighting scheme, to es…
14 \item{x}{a numeric vector the same length as the neighbours list in listw}
16 \item{nsim}{number of permutations}
20 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
21 …em{return_boot}{return an object of class \code{boot} from the equivalent permutation bootstrap ra…
22 …default TRUE, if FALSE the number of observations is not adjusted for no-neighbour observations, i…
26 A list with class \code{htest} and \code{mc.sim} containing the following components:
27 \item{statistic}{the value of the observed Moran's I.}
28 \item{parameter}{the rank of the observed Moran's I.}
29 \item{p.value}{the pseudo p-value of the test.}
[all …]
|
| H A D | EBImoran.mc.Rd | 9 …of Moran's I for testing for spatial autocorrelation in a rate, typically the number of observed c…
18 \item{n}{a numeric vector of counts of cases the same length as the neighbours list in listw}
19 \item{x}{a numeric vector of populations at risk the same length as the neighbours list in listw}
21 \item{nsim}{number of permutations}
24 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
29 The statistic used is (m is the number of observations):
44 A list with class \code{htest} and \code{mc.sim} containing the
47 \item{parameter}{the rank of the observed Moran's I.}
48 \item{p.value}{the pseudo p-value of the test.}
51 …\item{data.name}{a character string giving the name(s) of the data, and the number of simulations.}
[all …]
|
| H A D | localG.Rd | 10 of a local cluster of high values of the variable being analysed, very
11 low relative values a similar cluster of low values. For inference,
12 a Bonferroni-type test is suggested in the references, where tables of
21 \item{x}{a numeric vector the same length as the neighbours list in listw}
24 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
31 If the neighbours member of listw has a "self.included" attribute set
33 is calculated and returned. The returned vector will have a "gstari"
36 the neighbour list to a spatial weights list with \code{nb2listw} as
39 The critical values of the statistic under assumptions given in the
44 A vector of G or Gstar values, with attributes "gstari" set to TRUE or
[all …]
|
| H A D | joincount.mc.Rd | 7 …s calculated by using nsim random permutations of fx for the given spatial weighting scheme, to es…
14 \item{fx}{a factor of the same length as the neighbours and weights objects in listw}
16 \item{nsim}{number of permutations}
19 …\item{spChk}{should the data vector names be checked against the spatial objects for identity inte…
23 A list with class \code{jclist} of lists with class \code{htest} and \code{mc.sim} for each of the …
24 \item{statistic}{the value of the observed statistic.}
25 \item{parameter}{the rank of the observed statistic.}
27 \item{data.name}{a character string giving the name(s) of the data.}
28 \item{p.value}{the pseudo p-value of the test.}
30 \item{estimate}{the mean and variance of the simulated distribution.}
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/crack/ |
| H A D | crorder.red | 31 % notice, this list of conditions and the following disclaimer. *
33 % notice, this list of conditions and the following disclaimer in the *
68 terpri()$ write "confused! expected list of functions"$
83 % ordering_function a function which, given a list of
115 % permu() is TW's list of permutations generator
118 % generates a list of permutations of the elements of li
126 % in each of the entries of the orderings_ vector and acts as a
131 % p - list of derivatives to be sorted in the format used by
166 % orderings_prop_list_all() returns a list of all orderings in the
167 % format which we use for the property list of each equation, i.e.
[all …]
|
| H A D | v3tools.red | 57 genpro: generation of all scalar and spate products for a given vector list
73 is a list of vector expressions to the effect that no term of
235 %% % generates a list of permutations of the elements of li without multiple
271 % generates a list of permutations of the elements of li without multiple
275 % the same sub-permutations within this call of permu_repi.
308 % This procedure generates a list of all n-vector products for given
309 % vli : the list of vector variables and their weights
319 % now generation of all permutations
322 write"Generating specific permutations of products of the vectors ",
406 % generates a lisp list of the 3 components for a given vector
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/data-enumerate-lib/data/enumerate/private/ |
| H A D | more.rkt | 35 permutations/e
36 permutations-of-n/e
47 vector/e
313 (define (permutations-of-n/e n)
318 (define p-sub1 (permutations-of-n/e (sub1 n)))
349 (define (permutations/e l #:contract [c
354 (define idx->e (list->vector l))
366 (permutations-of-n/e (vector-length idx->e))
644 (define vec (list->vector args))
832 (map/e list->vector
[all …]
|
| /dports/lang/chez-scheme/ChezScheme-9.5.4/mats/ |
| H A D | cp0.ms | 6 ;;; You may obtain a copy of the License at
890 ; verify optimization of or pattern
921 ; verify expansion of not pattern
1816 ($permutations
1823 '(#%apply (lambda (x y z) (#%vector x y)) (#%list e1 2 e3))))
1979 '(#%apply (lambda (x y z) (#%vector x y)) (#%list* e1 2 e3 '()))))
1985 (expand/optimize '(#%apply (lambda (x y z) (#%vector x y z)) (#%list* 1 '(2 3)))))
2007 ($permutations
2217 '(vector-ref (vector 1 2 3) 1)))
2680 ; cause the allocation of z's location not to be in the continuation of the rhs of x.
[all …]
|
| /dports/math/pari/pari-2.13.3/src/functions/combinatorics/ |
| H A D | stirling | 6 of the first kind s(n,k), if flag=2, return the Stirling number of the second
8 Doc: \idx{Stirling number} of the first kind $s(n,k)$ ($\fl=1$, default) or
9 of the second kind $S(n,k)$ (\fl=2), where $n$, $k$ are nonnegative
11 number of permutations of $n$ symbols with exactly $k$ cycles; the latter is
12 the number of ways of partitioning a set of $n$ elements into $k$ nonempty
15 Similarly, if a large number of $S(n,k)$ are needed for the same $k$,
21 /* list of s(n,k), k = 1..n */
22 vecstirling(n) = Vec( factorback(vector(n-1,i,1-i*'x)) )
24 /* list of S(n,k), k = 1..n */
27 vector(n, i, t = divrem(Q, x-i); Q=t[1]; simplify(t[2]));
[all …]
|
| /dports/devel/fpc-fcl-stl/fpc-3.2.2/packages/fcl-stl/doc/ |
| H A D | arrayutils.tex | 3 Set of utilities for manipulating arrays data.
5 Takes 3 arguements for specialization. First one is type of array (can be anything, which is
6 accesible by [] operator, e. g. ordinary array, vector, ...), second one is type of array element.
12 Members list:
25 Set of utilities for manipulating arrays data.
27 Takes 3 arguements for specialization. First one is type of array (can be anything, which is
28 accesible by [] operator, e. g. ordinary array, vector, ...), second one is type of array element,
29 third one is comparator class (see TPriorityQueue for definition of comparator class).
35 Members list:
48 Worst case for one call $O(N)$. Going through all permutations takes $O(N!)$ time.\\ \hline
|
| /dports/lang/fpc-source/fpc-3.2.2/packages/fcl-stl/doc/ |
| H A D | arrayutils.tex | 3 Set of utilities for manipulating arrays data.
5 Takes 3 arguements for specialization. First one is type of array (can be anything, which is
6 accesible by [] operator, e. g. ordinary array, vector, ...), second one is type of array element.
12 Members list:
25 Set of utilities for manipulating arrays data.
27 Takes 3 arguements for specialization. First one is type of array (can be anything, which is
28 accesible by [] operator, e. g. ordinary array, vector, ...), second one is type of array element,
29 third one is comparator class (see TPriorityQueue for definition of comparator class).
35 Members list:
48 Worst case for one call $O(N)$. Going through all permutations takes $O(N!)$ time.\\ \hline
|
| /dports/math/dieharder/dieharder-3.31.1/libdieharder/ |
| H A D | diehard_operm5.c.save | 13 * This is the OPERM5 test. It looks at a sequence of one mill- ::
18 * are observed, cumulative counts are made of the number of ::
34 * the rgb permutations test, which uses non-overlapping samples
36 * be used for permutations of other than 5 integers. I was able
39 * used, and I wanted to (if possible) use the GSL permutations
40 * routines to count/index the permutations, which yield a different
66 * kperm computes the permutation number of a vector of five integers
127 * Zero count vector, was t(120) in diehard.f90.
150 * OK, now we are ready to generate a list of permutation indices.
151 * Basically, we take a vector of 5 integers and transform it into a
[all …]
|
| /dports/math/py-sympy/sympy-1.9/doc/cheatsheet/ |
| H A D | combinatoric_cheatsheet.tex | 174 Returns the number of all possible permutations.
195 Calculates the permutation from the inversion vector.
231 Return the inversion vector of the permutation.
444 Returns the size of the permutations in the group.
538 Return the normal closure of a subgroup/set of permutations.
600 Computes the schreier vector for \verb!alpha!.
661 Get the permutations of the Polyhedron.
690 Return a list of edges and the number of nodes from the given
729 Return the tree (as a list of edges) of the given Prufer sequence.
818 Return indices of subset in superset in a list;
[all …]
|
| /dports/math/fricas/fricas-1.3.7/src/algebra/ |
| H A D | rep1.spad | 27 ++ this package allows list notation of permutations as well:
105 ++ tensorProduct([a1, ..., ak], [b1, ..., bk]) calculates the list of
108 ++ Note: If each list of matrices corresponds to a group representation
115 ++ tensorProduct([a1, ...ak]) calculates the list of
118 ++ Note: If the list of matrices corresponds to a group representation
157 -- vector
266 -- permutations are assumed to permute {1, 2, ..., n}
274 -- permutations are assumed to permute {1, 2, ..., n}
283 -- permutations are assumed to permute {1, 2, ..., n}
309 -- notice, this list of conditions and the following disclaimer.
[all …]
|
| /dports/math/R-cran-expm/expm/man/ |
| H A D | balance.Rd | 32 A list with components
33 \item{z}{the transformation of matrix \code{A}, after permutation and
35 \item{scale}{numeric vector of length \eqn{n}, containing the
40 describe where permutations and where scaling took place; see the
45 An excerpt of the LAPACK documentation about DGEBAL(), describing the
55 \item{scale}{(output) numeric vector of length \code{n}.
56 Details of the permutations and scaling factors applied to
57 \code{A}. If \code{P[j]} is the index of the row and column interchanged
|