deno.land / std@0.166.0 / collections / permutations.ts

permutations.ts
نووسراو ببینە
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Copyright 2018-2022 the Deno authors. All rights reserved. MIT license.// This module is browser compatible.
/** * Builds all possible orders of all elements in the given array * Ignores equality of elements, meaning this will always return the same * number of permutations for a given length of input. * * Example: * * ```ts * import { permutations } from "https://deno.land/std@$STD_VERSION/collections/permutations.ts"; * import { assertEquals } from "https://deno.land/std@$STD_VERSION/testing/asserts.ts"; * * const numbers = [ 1, 2 ] * const windows = permutations(numbers) * * assertEquals(windows, [ * [ 1, 2 ], * [ 2, 1 ], * ]) * ``` */export function permutations<T>(inputArray: readonly T[]): T[][] { const ret: T[][] = []; const k = inputArray.length;
if (k === 0) { return ret; }
// Heap's Algorithm const array = [...inputArray]; const c = new Array<number>(k).fill(0);
ret.push([...array]);
let i = 1;
while (i < k) { if (c[i] < i) { if (i % 2 === 0) { [array[0], array[i]] = [array[i], array[0]]; } else { [array[c[i]], array[i]] = [array[i], array[c[i]]]; }
ret.push([...array]);
c[i] += 1; i = 1; } else { c[i] = 0; i += 1; } }
return ret;}
std
Deno standard library
GitHub Repositorydenoland/deno_std
GitHub Stars
2458

Version Info

Tagged at
2 months ago