1 | import { flatten } from '../../utils/array.js';
|
2 | import { factory } from '../../utils/factory.js';
|
3 | var name = 'setPowerset';
|
4 | var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
|
5 | export var createSetPowerset = factory(name, dependencies, (_ref) => {
|
6 | var {
|
7 | typed,
|
8 | size,
|
9 | subset,
|
10 | compareNatural,
|
11 | Index
|
12 | } = _ref;
|
13 |
|
14 | |
15 |
|
16 |
|
17 |
|
18 |
|
19 |
|
20 |
|
21 |
|
22 |
|
23 |
|
24 |
|
25 |
|
26 |
|
27 |
|
28 |
|
29 |
|
30 |
|
31 |
|
32 |
|
33 | return typed(name, {
|
34 | 'Array | Matrix': function ArrayMatrix(a) {
|
35 | if (subset(size(a), new Index(0)) === 0) {
|
36 |
|
37 | return [];
|
38 | }
|
39 |
|
40 | var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
|
41 | var result = [];
|
42 | var number = 0;
|
43 |
|
44 | while (number.toString(2).length <= b.length) {
|
45 | result.push(_subset(b, number.toString(2).split('').reverse()));
|
46 | number++;
|
47 | }
|
48 |
|
49 |
|
50 | return _sort(result);
|
51 | }
|
52 | });
|
53 |
|
54 | function _subset(array, bitarray) {
|
55 | var result = [];
|
56 |
|
57 | for (var i = 0; i < bitarray.length; i++) {
|
58 | if (bitarray[i] === '1') {
|
59 | result.push(array[i]);
|
60 | }
|
61 | }
|
62 |
|
63 | return result;
|
64 | }
|
65 |
|
66 |
|
67 | function _sort(array) {
|
68 | var temp = [];
|
69 |
|
70 | for (var i = array.length - 1; i > 0; i--) {
|
71 | for (var j = 0; j < i; j++) {
|
72 | if (array[j].length > array[j + 1].length) {
|
73 | temp = array[j];
|
74 | array[j] = array[j + 1];
|
75 | array[j + 1] = temp;
|
76 | }
|
77 | }
|
78 | }
|
79 |
|
80 | return array;
|
81 | }
|
82 | }); |
\ | No newline at end of file |