Searched refs:Permutations (Results 1 – 13 of 13) sorted by relevance
/external/rust/crates/itertools/src/ |
D | permutations.rs | 13 pub struct Permutations<I: Iterator> { struct 18 impl<I> Clone for Permutations<I> implementation 55 impl<I> fmt::Debug for Permutations<I> implementation 59 debug_fmt_fields!(Permutations, vals, state); 62 pub fn permutations<I: Iterator>(iter: I, k: usize) -> Permutations<I> { in permutations() 69 return Permutations { in permutations() 90 Permutations { in permutations() 96 impl<I> Iterator for Permutations<I> implementation 106 let &mut Permutations { ref vals, ref state } = self; in next() 127 let Permutations { vals, state } = self; in count() localVariable [all …]
|
D | lib.rs | 136 pub use crate::permutations::Permutations; 1412 fn permutations(self, k: usize) -> Permutations<Self> in permutations()
|
/external/oboe/samples/RhythmGame/third_party/glm/gtc/ |
D | noise.inl | 614 // Permutations 672 // Permutations 772 // Permutations
|
/external/one-true-awk/testdir/ |
D | funstack.ok | 272 P. J. Chase ACM Algorithm 383: Permutations of a Set 1531 Generation of Permutations in 1534 Generation of Permutations in 1654 William G. Poole, Jr. Tridiagonalization by Permutations . . . 20--24 2437 Gary D. Knott A Numbering System for Permutations of
|
D | funstack.in | 1863 title = "{ACM} Algorithm 383: Permutations of a Set with Repetitions", 11479 …title = "Remark on {``Algorithm 323 [G6]: Generation of Permutations in Lexicographic Order… 11498 …title = "Remark on {``Algorithm 323 [G6]: Generation of Permutations in Lexicographic Order… 12363 title = "Tridiagonalization by Permutations", 18523 title = "A Numbering System for Permutations of Combinations", 27186 …eber Suchen und Sortieren 5. Sorting 5.1. Combinatorial Properties of Permutations 5.2. Internal S…
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
D | IntrinsicsAArch64.td | 1358 // Permutations and selection
|
/external/python/cpython2/Doc/library/ |
D | itertools.rst | 506 Permutations are emitted in lexicographic sort order. So, if the
|
/external/llvm-project/llvm/include/llvm/IR/ |
D | IntrinsicsAArch64.td | 1669 // Permutations and selection
|
/external/python/cpython3/Doc/whatsnew/ |
D | 3.8.rst | 974 >>> math.perm(10, 3) # Permutations of 10 things taken 3 at a time
|
/external/llvm-project/clang/include/clang/Basic/ |
D | arm_sve.td | 1187 // Permutations and selection
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/unicode/ |
D | BidiCharacterTest.txt | 251 # Permutations of sequences containing paired brackets
|
/external/icu/icu4c/source/test/testdata/ |
D | BidiCharacterTest.txt | 251 # Permutations of sequences containing paired brackets
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/data/unicode/ |
D | BidiCharacterTest.txt | 251 # Permutations of sequences containing paired brackets
|