Home
last modified time | relevance | path

Searched refs:permutes (Results 1 – 25 of 626) sorted by relevance

12345678910>>...26

/dports/math/spooles-mpich/spooles.2.2_SHARED/Utilities/doc/
H A Dsort.tex57 descending order using an insertion sort and permutes
68 using an insertion sort and permutes the companion array {\tt dvec[]}
79 descending order using an insertion sort and permutes
91 using an insertion sort and permutes the double precision complex
103 using an insertion sort and permutes the companion arrays
137 descending order using an insertion sort and permutes
166 descending order using a quick sort and permutes
177 descending order using a quick sort and permutes
199 descending order using a quick sort and permutes
233 descending order using a quick sort and permutes
[all …]
/dports/math/spooles/spooles.2.2/Utilities/doc/
H A Dsort.tex57 descending order using an insertion sort and permutes
68 using an insertion sort and permutes the companion array {\tt dvec[]}
79 descending order using an insertion sort and permutes
91 using an insertion sort and permutes the double precision complex
103 using an insertion sort and permutes the companion arrays
137 descending order using an insertion sort and permutes
166 descending order using a quick sort and permutes
177 descending order using a quick sort and permutes
199 descending order using a quick sort and permutes
233 descending order using a quick sort and permutes
[all …]
/dports/math/spooles-mpich/spooles.2.2/Utilities/doc/
H A Dsort.tex57 descending order using an insertion sort and permutes
68 using an insertion sort and permutes the companion array {\tt dvec[]}
79 descending order using an insertion sort and permutes
91 using an insertion sort and permutes the double precision complex
103 using an insertion sort and permutes the companion arrays
137 descending order using an insertion sort and permutes
166 descending order using a quick sort and permutes
177 descending order using a quick sort and permutes
199 descending order using a quick sort and permutes
233 descending order using a quick sort and permutes
[all …]
/dports/math/spooles/spooles.2.2_SHARED/Utilities/doc/
H A Dsort.tex57 descending order using an insertion sort and permutes
68 using an insertion sort and permutes the companion array {\tt dvec[]}
79 descending order using an insertion sort and permutes
91 using an insertion sort and permutes the double precision complex
103 using an insertion sort and permutes the companion arrays
137 descending order using an insertion sort and permutes
166 descending order using a quick sort and permutes
177 descending order using a quick sort and permutes
199 descending order using a quick sort and permutes
233 descending order using a quick sort and permutes
[all …]
/dports/math/gap/gap-4.11.0/pkg/permut-2.0.3/lib/
H A Dpermut.gd53 ## H is permutable in G when H permutes with all subgroups of G.
63 ## This operation returns true if a subgroup H of G permutes
74 ## This operation returns fail if H permutes with all members of F
89 ## H is conjugate-permutable in G when H permutes with H^g for every g of G.
100 ## H is S-permutable in G when H permutes with all Sylow subgroups of G.
111 ## H is SN-permutable in G when H permutes with all system normalisers of G.
545 ## if <U> permutes with all subgroups of <V>
546 ## and <V> permutes with all subgroups of <U>.
560 ## if every subgroup of <U> permutes with every subgroup of <V>.
598 ## This operation returns true if <U> permutes with <V> and all members
[all …]
/dports/devel/libsimdpp/libsimdpp-2.1-400-g9dac213d/doc/wiki/Template/shuffle/
H A Ddsc_permute2.mwiki1 {{dsc tfun | shuffle/permute2 | permutes pairs of elements within vector }}
H A Ddsc_permute4.mwiki1 {{dsc tfun | shuffle/permute4 | permutes quadruples of elements within vector }}
H A Ddsc_permute_bytes16.mwiki1 {{dsc tfun | shuffle/permute_bytes16 | permutes elements in a vector according to another vector}}
H A Ddsc_permute_zbytes16.mwiki1 {{dsc tfun | shuffle/permute_zbytes16 | permutes or zeroes elements in a vector according to anothe…
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-vect-slp-patterns.c332 vect_check_evenodd_blend (lane_permutation_t &permutes, in vect_check_evenodd_blend() argument
335 if (permutes.length () == 0 in vect_check_evenodd_blend()
336 || permutes.length () % 2 != 0) in vect_check_evenodd_blend()
341 for (unsigned i = 0; i < permutes.length (); i++) in vect_check_evenodd_blend()
342 if (permutes[i].first != val[i % 2] in vect_check_evenodd_blend()
343 || permutes[i].second != seed++) in vect_check_evenodd_blend()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-vect-slp-patterns.c332 vect_check_evenodd_blend (lane_permutation_t &permutes, in vect_check_evenodd_blend() argument
335 if (permutes.length () == 0 in vect_check_evenodd_blend()
336 || permutes.length () % 2 != 0) in vect_check_evenodd_blend()
341 for (unsigned i = 0; i < permutes.length (); i++) in vect_check_evenodd_blend()
342 if (permutes[i].first != val[i % 2] in vect_check_evenodd_blend()
343 || permutes[i].second != seed++) in vect_check_evenodd_blend()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-vect-slp-patterns.c332 vect_check_evenodd_blend (lane_permutation_t &permutes, in vect_check_evenodd_blend() argument
335 if (permutes.length () == 0 in vect_check_evenodd_blend()
336 || permutes.length () % 2 != 0) in vect_check_evenodd_blend()
341 for (unsigned i = 0; i < permutes.length (); i++) in vect_check_evenodd_blend()
342 if (permutes[i].first != val[i % 2] in vect_check_evenodd_blend()
343 || permutes[i].second != seed++) in vect_check_evenodd_blend()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-vect-slp-patterns.c314 vect_check_evenodd_blend (lane_permutation_t &permutes, in vect_check_evenodd_blend() argument
317 if (permutes.length () == 0 in vect_check_evenodd_blend()
318 || permutes.length () % 2 != 0) in vect_check_evenodd_blend()
323 for (unsigned i = 0; i < permutes.length (); i++) in vect_check_evenodd_blend()
324 if (permutes[i].first != val[i % 2] in vect_check_evenodd_blend()
325 || permutes[i].second != seed++) in vect_check_evenodd_blend()
/dports/math/gap/gap-4.11.0/pkg/guava-3.15/lib/
H A Dutil.gd31 #F PermutedCols( <M>, <P> ) . . . . . . . . . . permutes columns of matrix
/dports/math/scilab/scilab-6.1.1/scilab/modules/elementary_functions/tests/nonreg_tests/
H A Dbug_13409.dia.ref20 res = permute(x, [3 2 1]); // this permutes x across the 3rd dimension
H A Dbug_13409.tst22 res = permute(x, [3 2 1]); // this permutes x across the 3rd dimension
/dports/print/ghostscript9-agpl-base/ghostscript-9.52/toolbin/halftone/ETS/
H A Dtest_ets.c628 uchar permutes[M][M] = { { 0 }, in main() local
740 if (permutes[planes-1] != 0) in main()
745 psd_ctx.permute[i] = permutes[planes-1][i]; in main()
/dports/print/ghostscript9-agpl-x11/ghostscript-9.52/toolbin/halftone/ETS/
H A Dtest_ets.c628 uchar permutes[M][M] = { { 0 }, in main() local
740 if (permutes[planes-1] != 0) in main()
745 psd_ctx.permute[i] = permutes[planes-1][i]; in main()
/dports/devel/R-cran-gbm/gbm/man/
H A Dsummary.gbm.Rd33 \code{\link{permutation.test.gbm}}. This method randomly permutes each predictor
/dports/cad/netgen-lvs/netgen-1.5.211/base/
H A Dobjlist.h212 struct Permutation *permutes; /* list of permuting pins */ member
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/MATLAB_Tools/MESHND/
H A Dmeshnd.m80 %ND2 p = nd2 (G) permutes a 2D or 3D mesh G.
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/MATLAB_Tools/MESHND/
H A Dmeshnd.m80 %ND2 p = nd2 (G) permutes a 2D or 3D mesh G.
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/MATLAB_Tools/MESHND/
H A Dmeshnd.m80 %ND2 p = nd2 (G) permutes a 2D or 3D mesh G.
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/MATLAB_Tools/MESHND/
H A Dmeshnd.m80 %ND2 p = nd2 (G) permutes a 2D or 3D mesh G.
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/MATLAB_Tools/MESHND/
H A Dmeshnd.m80 %ND2 p = nd2 (G) permutes a 2D or 3D mesh G.

12345678910>>...26