HomeSort by relevance Sort by last modified time
    Searched refs:Perm (Results 1 - 25 of 37) sorted by null

1 2

  /prebuilts/go/darwin-x86/src/math/rand/
regress_test.go 55 if m.Name == "Perm" {
324 []int{}, // Perm(0)
325 []int{0}, // Perm(1)
326 []int{0, 4, 1, 3, 2}, // Perm(5)
327 []int{3, 1, 0, 4, 7, 5, 2, 6}, // Perm(8)
328 []int{5, 0, 3, 6, 7, 4, 2, 1, 8}, // Perm(9)
329 []int{4, 5, 0, 2, 6, 9, 3, 1, 8, 7}, // Perm(10)
330 []int{14, 2, 0, 8, 3, 5, 13, 12, 1, 4, 6, 7, 11, 9, 15, 10}, // Perm(16)
331 []int{}, // Perm(0)
332 []int{0}, // Perm(1
    [all...]
example_test.go 83 // Perm generates a random permutation of the numbers [0, n).
84 show("Perm", r.Perm(5), r.Perm(5), r.Perm(5))
96 // Perm [1 4 2 3 0] [4 2 1 3 0] [1 2 4 0 3]
100 for _, value := range rand.Perm(3) {
race_test.go 37 for _, p := range Perm(10) {
rand.go 188 // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers [0,n).
189 func (r *Rand) Perm(n int) []int {
193 // statement. But Perm also effects r. Making this change will affect
286 // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers [0,n)
288 func Perm(n int) []int { return globalRand.Perm(n) }
rand_test.go 504 r.Perm(3)
511 r.Perm(30)
  /prebuilts/go/linux-x86/src/math/rand/
regress_test.go 55 if m.Name == "Perm" {
324 []int{}, // Perm(0)
325 []int{0}, // Perm(1)
326 []int{0, 4, 1, 3, 2}, // Perm(5)
327 []int{3, 1, 0, 4, 7, 5, 2, 6}, // Perm(8)
328 []int{5, 0, 3, 6, 7, 4, 2, 1, 8}, // Perm(9)
329 []int{4, 5, 0, 2, 6, 9, 3, 1, 8, 7}, // Perm(10)
330 []int{14, 2, 0, 8, 3, 5, 13, 12, 1, 4, 6, 7, 11, 9, 15, 10}, // Perm(16)
331 []int{}, // Perm(0)
332 []int{0}, // Perm(1
    [all...]
example_test.go 83 // Perm generates a random permutation of the numbers [0, n).
84 show("Perm", r.Perm(5), r.Perm(5), r.Perm(5))
96 // Perm [1 4 2 3 0] [4 2 1 3 0] [1 2 4 0 3]
100 for _, value := range rand.Perm(3) {
race_test.go 37 for _, p := range Perm(10) {
rand.go 188 // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers [0,n).
189 func (r *Rand) Perm(n int) []int {
193 // statement. But Perm also effects r. Making this change will affect
286 // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers [0,n)
288 func Perm(n int) []int { return globalRand.Perm(n) }
rand_test.go 504 r.Perm(3)
511 r.Perm(30)
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/
fft.c 756 fftstate->Perm [0] = ns;
762 fftstate->Perm [k] = jc;
764 fftstate->Perm [j] = fftstate->Perm [j - 1] / fftstate->factor [j - 1];
765 fftstate->Perm [k - 1] = fftstate->Perm [k] * fftstate->factor [j - 1];
769 k3 = fftstate->Perm [k];
770 kspan = fftstate->Perm [1];
795 k2 -= fftstate->Perm [j - 1];
797 k2 = fftstate->Perm [j] + k2
    [all...]
structs.h 256 int Perm[MAXFFTSIZE];
  /external/eigen/test/
permutationmatrices.cpp 127 typedef PermutationMatrix<Dynamic> Perm;
134 Perm P(2);
  /prebuilts/go/darwin-x86/src/os/
types.go 102 // Perm returns the Unix permission bits in m.
103 func (m FileMode) Perm() FileMode {
file_posix.go 33 o |= uint32(i.Perm())
  /prebuilts/go/linux-x86/src/os/
types.go 102 // Perm returns the Unix permission bits in m.
103 func (m FileMode) Perm() FileMode {
file_posix.go 33 o |= uint32(i.Perm())
  /prebuilts/go/darwin-x86/doc/play/
tree.go 76 for _, v := range rand.Perm(n) {
  /prebuilts/go/linux-x86/doc/play/
tree.go 76 for _, v := range rand.Perm(n) {
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 36 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::StorageIndex>& _dest, const typename MatrixType::StorageIndex* perm = 0);
39 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::StorageIndex>& _dest, const typename MatrixType::StorageIndex* perm = 0);
127 SparseSymmetricPermutationProduct<_MatrixTypeNested,Mode> twistedBy(const PermutationMatrix<Dynamic,Dynamic,StorageIndex>& perm) const
129 return SparseSymmetricPermutationProduct<_MatrixTypeNested,Mode>(m_matrix, perm);
427 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::StorageIndex>& _dest, const typename MatrixType::StorageIndex* perm)
449 Index jp = perm ? perm[j] : j;
455 Index ip = perm ? perm[i] : i;
486 StorageIndex jp = perm ? perm[j] : j
621 const Perm& perm() const { return m_perm; } function in class:Eigen::SparseSymmetricPermutationProduct
    [all...]
  /prebuilts/go/darwin-x86/src/archive/tar/
common.go 91 mode = os.FileMode(fi.h.Mode).Perm()
108 // clear perm, setuid, setgid and sticky bits.
207 Mode: int64(fm.Perm()), // or'd with c_IS* constants later
tar_test.go 30 if g, e := h.Mode, int64(fi.Mode().Perm())|c_ISREG; g != e {
58 if g, e := h.Mode&^c_ISGID, int64(fi.Mode().Perm())|c_ISDIR; g != e {
  /prebuilts/go/linux-x86/src/archive/tar/
common.go 91 mode = os.FileMode(fi.h.Mode).Perm()
108 // clear perm, setuid, setgid and sticky bits.
207 Mode: int64(fm.Perm()), // or'd with c_IS* constants later
tar_test.go 30 if g, e := h.Mode, int64(fi.Mode().Perm())|c_ISREG; g != e {
58 if g, e := h.Mode&^c_ISGID, int64(fi.Mode().Perm())|c_ISDIR; g != e {
  /external/boringssl/src/util/
all_tests.go 369 perm := rand.Perm(len(tests))
370 for i, j := range perm {

Completed in 2411 milliseconds

1 2