cubing 0.24.7 → 0.25.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +12 -5
- package/dist/esm/{2x2x2.sgs.json-KBCXHIZP.js → 2x2x2.sgs.json-TCTAV5XU.js} +2 -2
- package/dist/esm/{2x2x2.sgs.json-KBCXHIZP.js.map → 2x2x2.sgs.json-TCTAV5XU.js.map} +0 -0
- package/dist/esm/{3d-dynamic-inside-IIG5EJZP.js → 3d-dynamic-inside-MLJKFLGH.js} +3 -3
- package/dist/esm/{3d-dynamic-inside-IIG5EJZP.js.map → 3d-dynamic-inside-MLJKFLGH.js.map} +0 -0
- package/dist/esm/bluetooth/index.js +1 -1
- package/dist/esm/{chunk-OOIEAACO.js → chunk-4SUQM4XH.js} +2 -2
- package/dist/esm/{chunk-OOIEAACO.js.map → chunk-4SUQM4XH.js.map} +0 -0
- package/dist/esm/{chunk-V7BTHDW3.js → chunk-AAB2V4UB.js} +2 -2
- package/dist/esm/{chunk-V7BTHDW3.js.map → chunk-AAB2V4UB.js.map} +0 -0
- package/dist/esm/{chunk-BJIOROQC.js → chunk-L7W7Q42Q.js} +2 -2
- package/dist/esm/{chunk-BJIOROQC.js.map → chunk-L7W7Q42Q.js.map} +0 -0
- package/dist/esm/{chunk-37EHU3GZ.js → chunk-RENZB7QN.js} +4 -2
- package/dist/esm/chunk-RENZB7QN.js.map +7 -0
- package/dist/esm/{chunk-UOI5KUW4.js → chunk-TVY3UOOK.js} +3 -3
- package/dist/esm/{chunk-UOI5KUW4.js.map → chunk-TVY3UOOK.js.map} +0 -0
- package/dist/esm/{chunk-MVJPIWT7.js → chunk-U2R5E2A4.js} +2 -2
- package/dist/esm/{chunk-MVJPIWT7.js.map → chunk-U2R5E2A4.js.map} +1 -1
- package/dist/esm/{chunk-DMCRTYR4.js → chunk-V7Z6KRM2.js} +6 -6
- package/dist/esm/{chunk-DMCRTYR4.js.map → chunk-V7Z6KRM2.js.map} +0 -0
- package/dist/esm/{entry-FHL2XSAP.js → entry-Y2R6JXV7.js} +30 -59
- package/dist/esm/{entry-FHL2XSAP.js.map → entry-Y2R6JXV7.js.map} +2 -2
- package/dist/esm/esm-test-worker.js +1 -1
- package/dist/esm/{fto.sgs.json-USV4WNQJ.js → fto.sgs.json-2IU2J6W7.js} +2 -2
- package/dist/esm/{fto.sgs.json-USV4WNQJ.js.map → fto.sgs.json-2IU2J6W7.js.map} +0 -0
- package/dist/esm/ftosolver-smaller-phase3-table-PUTNXKKW.js +1330 -0
- package/dist/esm/ftosolver-smaller-phase3-table-PUTNXKKW.js.map +7 -0
- package/dist/esm/{module-entry-TKJ6ZAZB.js → module-entry-3WBGTDCZ.js} +3 -3
- package/dist/esm/{module-entry-TKJ6ZAZB.js.map → module-entry-3WBGTDCZ.js.map} +0 -0
- package/dist/esm/{node-W3AD4HBK.js → node-KTVORTZB.js} +4 -2
- package/dist/esm/node-KTVORTZB.js.map +7 -0
- package/dist/esm/{node-SP4L2AKI.js → node-LMAS5PGZ.js} +4 -2
- package/dist/esm/node-LMAS5PGZ.js.map +7 -0
- package/dist/esm/puzzles/index.js +1 -1
- package/dist/esm/{pyraminx.sgs.json-HMKDN3ZT.js → pyraminx.sgs.json-NZWNQPLL.js} +3 -3
- package/dist/esm/{pyraminx.sgs.json-HMKDN3ZT.js.map → pyraminx.sgs.json-NZWNQPLL.js.map} +0 -0
- package/dist/esm/scramble/index.js +4 -4
- package/dist/esm/{scramble_444-ZFKBLRUE.js → scramble_444-Q334Y5FH.js} +4 -4
- package/dist/esm/{scramble_444-ZFKBLRUE.js.map → scramble_444-Q334Y5FH.js.map} +0 -0
- package/dist/esm/{scramble_sq1-PQ2AYBFW.js → scramble_sq1-OZR6K4WV.js} +2 -2
- package/dist/esm/{scramble_sq1-PQ2AYBFW.js.map → scramble_sq1-OZR6K4WV.js.map} +0 -0
- package/dist/esm/search/index.js +4 -4
- package/dist/esm/twisty/index.js +2 -2
- package/dist/esm/worker-inside-generated-string-BERQU3U7.js +2828 -0
- package/dist/esm/worker-inside-generated-string-BERQU3U7.js.map +7 -0
- package/dist/types/search/inside/solve/puzzles/fto.d.ts +1 -1
- package/dist/types/search/worker-inside-generated-string.d.ts +1 -1
- package/dist/types/vendor/xyzzy/ftosolver-smaller-phase3-table.d.ts +1 -0
- package/dist/types/vendor/xyzzy/ftosolver.d.ts +224 -0
- package/dist/types/vendor/xyzzy/kilosolver.d.ts +158 -0
- package/dist/types/vendor/xyzzy/masterpyra.d.ts +217 -0
- package/dist/types/vendor/xyzzy/rediscrambler.d.ts +130 -0
- package/package.json +1 -1
- package/dist/esm/chunk-37EHU3GZ.js.map +0 -7
- package/dist/esm/node-SP4L2AKI.js.map +0 -7
- package/dist/esm/node-W3AD4HBK.js.map +0 -7
- package/dist/esm/worker-inside-generated-string-XYHIVIPG.js +0 -3447
- package/dist/esm/worker-inside-generated-string-XYHIVIPG.js.map +0 -7
|
@@ -0,0 +1 @@
|
|
|
1
|
+
export function randomFTOScrambleString(): any;
|
|
@@ -0,0 +1,224 @@
|
|
|
1
|
+
declare function counter(A: any): any[];
|
|
2
|
+
declare function counter(A: any): any[];
|
|
3
|
+
declare function counter(A: any): any[];
|
|
4
|
+
declare function counter(A: any): any[];
|
|
5
|
+
declare function factorial(n: any): any;
|
|
6
|
+
declare function factorial(n: any): any;
|
|
7
|
+
declare function factorial(n: any): any;
|
|
8
|
+
declare function factorial(n: any): any;
|
|
9
|
+
declare function C(n: any, k: any): number;
|
|
10
|
+
declare function C(n: any, k: any): number;
|
|
11
|
+
declare function C(n: any, k: any): number;
|
|
12
|
+
declare function C4(n: any, k0: any, k1: any, k2: any, k3?: number): number;
|
|
13
|
+
declare function permutation_to_index(perm: any): number;
|
|
14
|
+
declare function permutation_to_index(perm: any): number;
|
|
15
|
+
declare function permutation_to_index(perm: any): number;
|
|
16
|
+
declare function permutation_to_index(perm: any): number;
|
|
17
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
18
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
19
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
20
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
21
|
+
declare function permutation_parity(A: any): number;
|
|
22
|
+
declare function permutation_parity(A: any): number;
|
|
23
|
+
declare function permutation_parity(A: any): number;
|
|
24
|
+
declare function permutation_parity(A: any): number;
|
|
25
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
26
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
27
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
28
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
29
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
30
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
31
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
32
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
33
|
+
declare function random_permutation(n: any): number[];
|
|
34
|
+
declare function random_even_permutation(n: any): number[];
|
|
35
|
+
declare function comb_to_index(l: any): number;
|
|
36
|
+
declare function comb_to_index(l: any): number;
|
|
37
|
+
declare function comb_to_index(l: any): number;
|
|
38
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
39
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
40
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
41
|
+
declare function ctz(n: any): number;
|
|
42
|
+
declare function generate_comb_lookup_tables(n: any, k: any): any;
|
|
43
|
+
declare function popcount(n: any): number;
|
|
44
|
+
declare function spread_bits(n: any): any;
|
|
45
|
+
declare function interleave_bits(x: any, y: any): number;
|
|
46
|
+
declare function generate_comb4_lookup_tables(n: any, k0: any, k1: any, k2: any, k3: any): any;
|
|
47
|
+
declare function compose(A: any, B: any): any[];
|
|
48
|
+
declare function compose(A: any, B: any): any[];
|
|
49
|
+
declare function compose(A: any, B: any): any[];
|
|
50
|
+
declare function compose(A: any, B: any): any[];
|
|
51
|
+
declare function compose3(A: any, B: any, C: any): any[];
|
|
52
|
+
declare function compose_o(A: any, B: any): any[][];
|
|
53
|
+
declare function compose_o(A: any, B: any): any[][];
|
|
54
|
+
declare function permutation_from_cycles(cycles: any, n: any): any[];
|
|
55
|
+
declare function permutation_from_cycles(cycles: any, n: any): any;
|
|
56
|
+
declare function reduce_permutation(perm: any, keep: any): any[];
|
|
57
|
+
declare function invert_permutation(perm: any): any[];
|
|
58
|
+
declare function gcd(a: any, b: any): number;
|
|
59
|
+
declare function lcm(a: any, b: any): number;
|
|
60
|
+
declare function permutation_order(perm: any): number;
|
|
61
|
+
declare function identify_corner_piece(colourA: any, colourB: any): number[];
|
|
62
|
+
declare function identify_edge_piece(colourA: any, colourB: any): number;
|
|
63
|
+
declare function get_corner_piece(facelets: any, location: any): number[];
|
|
64
|
+
declare function get_edge_piece(facelets: any, location: any): number;
|
|
65
|
+
declare function set_corner_piece(facelets: any, location: any, value: any, orientation: any): void;
|
|
66
|
+
declare function set_edge_piece(facelets: any, location: any, value: any): void;
|
|
67
|
+
declare function convert_move_to_permutations(move: any): {
|
|
68
|
+
cp: number[];
|
|
69
|
+
ep: number[];
|
|
70
|
+
ap: number[];
|
|
71
|
+
bp: number[];
|
|
72
|
+
};
|
|
73
|
+
declare function random_state(): any[];
|
|
74
|
+
declare function random_state(): any[][];
|
|
75
|
+
declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
|
|
76
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
77
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
78
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
79
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
80
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
81
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
82
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
83
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
84
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
85
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
86
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
87
|
+
declare function invert_move_sequence(move_sequence: any): any;
|
|
88
|
+
declare function simplify_move_sequence(move_sequence: any, make_noise?: boolean): any[][];
|
|
89
|
+
declare function generate_random_state_scramble(): any;
|
|
90
|
+
declare function generate_random_state_scramble(): any;
|
|
91
|
+
declare function generate_random_state_scramble(): any;
|
|
92
|
+
declare function generate_random_state_scramble(): any;
|
|
93
|
+
declare function generate_multiple_random_state_scrambles(n: any): any[];
|
|
94
|
+
declare function generate_mtable_comb_generic(n: any, k: any, permutations: any): Uint32Array[];
|
|
95
|
+
declare function generate_mtable_comb4_generic(n: any, k0: any, k1: any, k2: any, k3: any, permutations: any): Uint32Array[];
|
|
96
|
+
declare function generate_mtable_single_generic(permutations: any): Uint32Array[];
|
|
97
|
+
declare function combine_mtables(mtable0: any, mtable1: any): Uint32Array[];
|
|
98
|
+
declare function trim_unreachable(mtable: any, origin: any): any[];
|
|
99
|
+
declare function reduce_to_quotient(mtable: any, origins: any): (Int32Array | Int32Array[])[];
|
|
100
|
+
declare function generate_mirrored_coordinate_table(mtable: any, a: any, b: any): Int32Array;
|
|
101
|
+
declare function bfs(mtable: any, goal_states: any): Int8Array;
|
|
102
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
103
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
104
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
105
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any, commute: any): Generator<any, void, any>;
|
|
106
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any): Generator<any, void, any>;
|
|
107
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any): Generator<any, void, any>;
|
|
108
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any, commute: any): any;
|
|
109
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): Generator<number[][], void, unknown>;
|
|
110
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
|
|
111
|
+
declare function solve(facelets: any, readable?: boolean): any[][];
|
|
112
|
+
declare function solve(state: any): any[];
|
|
113
|
+
declare function solve(state: any): any;
|
|
114
|
+
declare function solve(state: any): any;
|
|
115
|
+
declare function index_phase1(facelets: any): any[];
|
|
116
|
+
declare function index_phase1(state: any): number[];
|
|
117
|
+
declare function index_phase1(state: any): number[];
|
|
118
|
+
declare function generate_phase1_edge_mtable(): any;
|
|
119
|
+
declare function generate_phase1_edge_mtable(): any;
|
|
120
|
+
declare function generate_phase1_edge_ptable(): any;
|
|
121
|
+
declare function generate_phase1_edge_ptable(): any;
|
|
122
|
+
declare function generate_phase1_centreA_mtable(): any;
|
|
123
|
+
declare function generate_phase1_centreB_mtable(): any;
|
|
124
|
+
declare function generate_phase1_centre_ptable(): any;
|
|
125
|
+
declare function solve_phase1_gen(facelets: any): Generator<any, void, any>;
|
|
126
|
+
declare function phase1_ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any): Generator<any, void, any>;
|
|
127
|
+
declare function phase1_ida_solve_gen(coords: any): Generator<any, void, any>;
|
|
128
|
+
declare function phase1_ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): Generator<number[][], void, unknown>;
|
|
129
|
+
declare function phase1_ida_search_gen(a: any, b: any, c: any, d: any, e: any, f: any, mtable: any, ptable: any, bound: any, last: any): any;
|
|
130
|
+
declare function index_phase2(facelets: any): any[];
|
|
131
|
+
declare function index_phase2(state: any): number[];
|
|
132
|
+
declare function index_phase2(state: any): any[];
|
|
133
|
+
declare function solve_phase2_gen(facelets: any): Generator<any, void, any>;
|
|
134
|
+
declare function solve_phase2(facelets: any): any;
|
|
135
|
+
declare function solve_phase2(state: any): any;
|
|
136
|
+
declare function generate_phase2_centre_mtables(): any;
|
|
137
|
+
declare function generate_phase2_edge_mtable(): any;
|
|
138
|
+
declare function generate_phase2_edge_mtable(): any;
|
|
139
|
+
declare function generate_phase2_corner_mtable(): any;
|
|
140
|
+
declare function generate_phase2_corner_mtable(): any;
|
|
141
|
+
declare function generate_phase2_corner_mtable_compact(): any;
|
|
142
|
+
declare function generate_phase2_ce_mtable(): any;
|
|
143
|
+
declare function generate_phase2_ce_mirror_map(): any;
|
|
144
|
+
declare function phase2_centre_goal_states(): any;
|
|
145
|
+
declare function phase2_corner_goal_states(): number[];
|
|
146
|
+
declare function generate_phase2_ace_ptable(): any;
|
|
147
|
+
declare function phase2_ida_solve_gen(indices: any, moves_left: any): Generator<any, void, any>;
|
|
148
|
+
declare function phase2_ida_search_gen(a: any, b: any, ce: any, mtable_a: any, mtable_b: any, mtable_ce: any, ptable_ace: any, mirror_map: any, bound: any, last: any): any;
|
|
149
|
+
declare function index_phase3_2gen(facelets: any): any[];
|
|
150
|
+
declare function generate_phase3_2gen_edge_mtable(): any;
|
|
151
|
+
declare function generate_phase3_2gen_corner_mtable(): any;
|
|
152
|
+
declare function generate_phase3_2gen_corneredge_mtable(): any;
|
|
153
|
+
declare function generate_phase3_2gen_centre_mtable(): any;
|
|
154
|
+
declare function generate_phase3_2gen_depth_table(): any;
|
|
155
|
+
declare function solve_phase3_2gen(facelets: any, indices?: any[], simplify?: boolean): any[];
|
|
156
|
+
declare function solve_phase3_2gen_readable(facelets: any, indices?: any[]): any[][] | undefined;
|
|
157
|
+
declare function alternation_penalty(x: any): number;
|
|
158
|
+
declare function grade_readability(seq: any): any;
|
|
159
|
+
declare function alternations(seq: any): number[];
|
|
160
|
+
declare function solve_phase3_2gen_ida(ab: any, ce: any, mtable_ab: any, mtable_ce: any, depth_table: any, bound: any, last?: number): any;
|
|
161
|
+
declare function solve_phase2_and_phase3_fast(facelets: any, phase2_attempts?: number, cap?: number): any;
|
|
162
|
+
declare function solve_phase2_and_phase3_readable(facelets: any, phase2_attempts?: number, cap?: number): any[][] | undefined;
|
|
163
|
+
declare function phase3_benchmark(solver?: typeof solve_phase3_2gen): void;
|
|
164
|
+
declare function solver_benchmark(solver?: typeof solve): void;
|
|
165
|
+
declare namespace rng {
|
|
166
|
+
export { next };
|
|
167
|
+
export const is_crypto: boolean;
|
|
168
|
+
}
|
|
169
|
+
declare function evenpermutation8_to_index(perm: any): number;
|
|
170
|
+
declare function index_to_evenpermutation8(ind: any, perm: any): any;
|
|
171
|
+
declare let comb_lookup_tables: {};
|
|
172
|
+
declare let comb4_lookup_tables: {};
|
|
173
|
+
declare let solved_state: number[];
|
|
174
|
+
declare let move_U: any;
|
|
175
|
+
declare let move_Ui: any[];
|
|
176
|
+
declare let move_X: number[];
|
|
177
|
+
declare let move_Y: number[];
|
|
178
|
+
declare let move_Z: number[];
|
|
179
|
+
declare let move_L: any[];
|
|
180
|
+
declare let move_F: any[];
|
|
181
|
+
declare let move_R: any[];
|
|
182
|
+
declare let move_Us: any;
|
|
183
|
+
declare let move_Uw: any[];
|
|
184
|
+
declare let move_Uwi: any[];
|
|
185
|
+
declare let move_Lw: any[];
|
|
186
|
+
declare let move_Fw: any[];
|
|
187
|
+
declare let move_Rw: any[];
|
|
188
|
+
declare let colour_map: number[];
|
|
189
|
+
declare let corner_piece_facelets: number[][];
|
|
190
|
+
declare let edge_piece_facelets: number[][];
|
|
191
|
+
declare let centreA_piece_facelets: number[];
|
|
192
|
+
declare let centreB_piece_facelets: number[];
|
|
193
|
+
declare let moves: any[];
|
|
194
|
+
declare let move_names: string[];
|
|
195
|
+
declare let move_permutations: {
|
|
196
|
+
cp: number[];
|
|
197
|
+
ep: number[];
|
|
198
|
+
ap: number[];
|
|
199
|
+
bp: number[];
|
|
200
|
+
}[];
|
|
201
|
+
declare let cached_mtables: {};
|
|
202
|
+
declare let cached_ptables: {};
|
|
203
|
+
declare let phase1_centre_colour_map: number[];
|
|
204
|
+
declare let phase2_centre_colour_map: number[];
|
|
205
|
+
declare let phase2_centre_indices: number[];
|
|
206
|
+
declare let phase2_keep: boolean[];
|
|
207
|
+
declare let phase2_corner_keep: boolean[];
|
|
208
|
+
declare let phase2_edge_reduction_map: any;
|
|
209
|
+
declare let phase2_corner_reduction_map: any;
|
|
210
|
+
declare let phase2_ce_mirror_map: any;
|
|
211
|
+
declare let phase3_2gen_centre_indices: number[];
|
|
212
|
+
declare let phase3_2gen_keep: boolean[];
|
|
213
|
+
declare let phase3_2gen_move_seqs: number[][][];
|
|
214
|
+
declare let phase3_2gen_nmoves: number;
|
|
215
|
+
declare let phase3_2gen_facelet_permutations: any[];
|
|
216
|
+
declare let phase3_2gen_piece_permutations: {
|
|
217
|
+
cp: number[];
|
|
218
|
+
ep: number[];
|
|
219
|
+
ap: number[];
|
|
220
|
+
bp: number[];
|
|
221
|
+
}[];
|
|
222
|
+
declare let phase3_2gen_move_orders: number[];
|
|
223
|
+
declare let phase3_2gen_depth_table: any;
|
|
224
|
+
declare function next(bound: any): number | undefined;
|
|
@@ -0,0 +1,158 @@
|
|
|
1
|
+
declare function counter(A: any): any[];
|
|
2
|
+
declare function counter(A: any): any[];
|
|
3
|
+
declare function counter(A: any): any[];
|
|
4
|
+
declare function counter(A: any): any[];
|
|
5
|
+
declare function factorial(n: any): any;
|
|
6
|
+
declare function factorial(n: any): any;
|
|
7
|
+
declare function factorial(n: any): any;
|
|
8
|
+
declare function factorial(n: any): any;
|
|
9
|
+
declare function C(n: any, k: any): number;
|
|
10
|
+
declare function C(n: any, k: any): number;
|
|
11
|
+
declare function C(n: any, k: any): number;
|
|
12
|
+
declare function permutation_to_index(perm: any): number;
|
|
13
|
+
declare function permutation_to_index(perm: any): number;
|
|
14
|
+
declare function permutation_to_index(perm: any): number;
|
|
15
|
+
declare function permutation_to_index(perm: any): number;
|
|
16
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
17
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
18
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
19
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
20
|
+
declare function permutation_parity(A: any): number;
|
|
21
|
+
declare function permutation_parity(A: any): number;
|
|
22
|
+
declare function permutation_parity(A: any): number;
|
|
23
|
+
declare function permutation_parity(A: any): number;
|
|
24
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
25
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
26
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
27
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
28
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
29
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
30
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
31
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
32
|
+
declare function comb_to_index(l: any): number;
|
|
33
|
+
declare function comb_to_index(l: any): number;
|
|
34
|
+
declare function comb_to_index(l: any): number;
|
|
35
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
36
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
37
|
+
declare function index_to_comb(ind: any, ones: any, bits: any): any[];
|
|
38
|
+
declare function compose(A: any, B: any): any[];
|
|
39
|
+
declare function compose(A: any, B: any): any[];
|
|
40
|
+
declare function compose(A: any, B: any): any[];
|
|
41
|
+
declare function compose(A: any, B: any): any[];
|
|
42
|
+
declare function compose_o(A: any, B: any): any[][];
|
|
43
|
+
declare function compose_o(A: any, B: any): any[][];
|
|
44
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
45
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
46
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
47
|
+
declare function unsparsify_list(d: any, n: any): any[];
|
|
48
|
+
declare function unsparsify_list(d: any, n: any): any[];
|
|
49
|
+
declare function random_state(): any[];
|
|
50
|
+
declare function random_state(): any[][];
|
|
51
|
+
declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
|
|
52
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
53
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
54
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
55
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
56
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
57
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
58
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
59
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
60
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
61
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
62
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
63
|
+
declare function generate_random_state_scramble(): any;
|
|
64
|
+
declare function generate_random_state_scramble(): any;
|
|
65
|
+
declare function generate_random_state_scramble(): any;
|
|
66
|
+
declare function generate_random_state_scramble(): any;
|
|
67
|
+
declare function generate_random_move_scramble(M: any, N: any): number[][];
|
|
68
|
+
declare function map_piece_to_face(loc: any, ori: any): string;
|
|
69
|
+
declare function create_svg_template(state: any, colour_scheme: any): Element;
|
|
70
|
+
declare function draw_state(svgel: any, state: any, colour_scheme: any): any;
|
|
71
|
+
declare function solve_phase1(state: any): any;
|
|
72
|
+
declare function search_phase1(flags: any, depth: any, last: any): any;
|
|
73
|
+
declare function index_phase2(facelets: any): any[];
|
|
74
|
+
declare function index_phase2(state: any): number[];
|
|
75
|
+
declare function index_phase2(state: any): any[];
|
|
76
|
+
declare function solve_phase2(facelets: any): any;
|
|
77
|
+
declare function solve_phase2(state: any): any;
|
|
78
|
+
declare function index_phase3(state: any): number[];
|
|
79
|
+
declare function solve_phase3(state: any): any;
|
|
80
|
+
declare function index_phase4(state: any): number[];
|
|
81
|
+
declare function solve_phase4(state: any): any;
|
|
82
|
+
declare function solve_phase4_fast(state: any): any;
|
|
83
|
+
declare function solve(facelets: any, readable?: boolean): any[][];
|
|
84
|
+
declare function solve(state: any): any[];
|
|
85
|
+
declare function solve(state: any): any;
|
|
86
|
+
declare function solve(state: any): any;
|
|
87
|
+
declare function cn_solve(state: any): any;
|
|
88
|
+
declare function generate_phase23_orientation_mtable(): any;
|
|
89
|
+
declare function generate_phase2_orientation_ptable(): any;
|
|
90
|
+
declare function generate_phase2_orientation_ptable(): any;
|
|
91
|
+
declare function generate_phase3_orientation_ptable(): any;
|
|
92
|
+
declare function generate_phase23_permutation_mtable(): any;
|
|
93
|
+
declare function generate_phase2_permutation_ptable(): any;
|
|
94
|
+
declare function generate_phase2_permutation_ptable(): any;
|
|
95
|
+
declare function generate_phase3_permutation_ptable(): any;
|
|
96
|
+
declare function generate_phase4_orientation_mtable(): any;
|
|
97
|
+
declare function generate_phase4_permutation_mtable(): any;
|
|
98
|
+
declare function generate_phase4_orientation_ptable(): any;
|
|
99
|
+
declare function generate_phase4_permutation_ptable(): any;
|
|
100
|
+
declare function generate_phase4_near_ptable_list(threshold: any): any;
|
|
101
|
+
declare function binary_search(A: any, x: any): boolean;
|
|
102
|
+
declare function cache_all_tables(): void;
|
|
103
|
+
declare function bfs(mtable: any, goal_states: any): Int8Array;
|
|
104
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
105
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
106
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
107
|
+
declare function ida_solve(indices: any, mtables: any, ptables: any): any;
|
|
108
|
+
declare function ida_solve(indices: any, mtables: any, ptables: any, max_bound: any): any;
|
|
109
|
+
declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): number[][] | undefined;
|
|
110
|
+
declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
|
|
111
|
+
declare function phase4_ida_solve(indices: any): any;
|
|
112
|
+
declare function phase4_ida_search(indices: any, bound: any, last: any, mtable_o: any, mtable_p: any, ptable_o: any, ptable_p: any, ptable_n: any): any;
|
|
113
|
+
declare function phase4_ida_solve_gen(indices: any): Generator<any, void, any>;
|
|
114
|
+
declare function phase4_ida_search_gen(indices: any, bound: any, last: any, mtable_o: any, mtable_p: any, ptable_o: any, ptable_p: any, ptable_n: any): any;
|
|
115
|
+
declare function generate_hs_mtable(): any;
|
|
116
|
+
declare function generate_hs_u_ptable(): any;
|
|
117
|
+
declare function generate_hs_d_ptable(): any;
|
|
118
|
+
declare function index_hs(state: any): number[];
|
|
119
|
+
declare function solve_hs(state: any): any;
|
|
120
|
+
declare function solve_hs_twophase(state: any): any;
|
|
121
|
+
declare function generate_hybrid_scramble(): any[][];
|
|
122
|
+
declare function generate_fullseparate_mtable(): any;
|
|
123
|
+
declare function generate_fullseparate_ptable(): any;
|
|
124
|
+
declare function bfs5(mtable: any, goal_states: any): any[];
|
|
125
|
+
declare let PHASE4_THRESHOLD: number;
|
|
126
|
+
declare function evenpermutation10_to_index(perm: any): number;
|
|
127
|
+
declare function index_to_evenpermutation10(ind: any, perm: any): any;
|
|
128
|
+
declare let move_U: any[][];
|
|
129
|
+
declare let move_R: any[][];
|
|
130
|
+
declare let move_F: any[][];
|
|
131
|
+
declare let move_L: any[][];
|
|
132
|
+
declare let move_BL: any[][];
|
|
133
|
+
declare let move_BR: any[][];
|
|
134
|
+
declare let move_x2: any[][];
|
|
135
|
+
declare let move_y: any[][];
|
|
136
|
+
declare let move_rot: number[][];
|
|
137
|
+
declare let moves: any[];
|
|
138
|
+
declare let move_names: string[];
|
|
139
|
+
declare let id: any[][];
|
|
140
|
+
declare let moves_full: any[];
|
|
141
|
+
declare namespace default_colour_scheme {
|
|
142
|
+
const U: string;
|
|
143
|
+
const L: string;
|
|
144
|
+
const F: string;
|
|
145
|
+
const R: string;
|
|
146
|
+
const BR: string;
|
|
147
|
+
const BL: string;
|
|
148
|
+
const DBR: string;
|
|
149
|
+
const DB: string;
|
|
150
|
+
const DBL: string;
|
|
151
|
+
const DFL: string;
|
|
152
|
+
const DFR: string;
|
|
153
|
+
const D: string;
|
|
154
|
+
}
|
|
155
|
+
declare let face_names: string[];
|
|
156
|
+
declare let rotation_amounts: number[][];
|
|
157
|
+
declare let translation_amounts: any;
|
|
158
|
+
declare let tables: {};
|
|
@@ -0,0 +1,217 @@
|
|
|
1
|
+
declare function counter(A: any): any[];
|
|
2
|
+
declare function counter(A: any): any[];
|
|
3
|
+
declare function counter(A: any): any[];
|
|
4
|
+
declare function counter(A: any): any[];
|
|
5
|
+
declare function factorial(n: any): any;
|
|
6
|
+
declare function factorial(n: any): any;
|
|
7
|
+
declare function factorial(n: any): any;
|
|
8
|
+
declare function factorial(n: any): any;
|
|
9
|
+
declare function identity_permutation(n: any): any[];
|
|
10
|
+
declare function permutation_to_index(perm: any): number;
|
|
11
|
+
declare function permutation_to_index(perm: any): number;
|
|
12
|
+
declare function permutation_to_index(perm: any): number;
|
|
13
|
+
declare function permutation_to_index(perm: any): number;
|
|
14
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
15
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
16
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
17
|
+
declare function index_to_permutation(ind: any, n: any): number[];
|
|
18
|
+
declare function permutation_parity(A: any): number;
|
|
19
|
+
declare function permutation_parity(A: any): number;
|
|
20
|
+
declare function permutation_parity(A: any): number;
|
|
21
|
+
declare function permutation_parity(A: any): number;
|
|
22
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
23
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
24
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
25
|
+
declare function index_to_evenpermutation(ind: any, n: any): number[];
|
|
26
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
27
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
28
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
29
|
+
declare function evenpermutation_to_index(perm: any): number;
|
|
30
|
+
declare function compose(A: any, B: any): any[];
|
|
31
|
+
declare function compose(A: any, B: any): any[];
|
|
32
|
+
declare function compose(A: any, B: any): any[];
|
|
33
|
+
declare function compose(A: any, B: any): any[];
|
|
34
|
+
declare function double_compose(A: any, B: any, C: any): any[];
|
|
35
|
+
declare function invert(perm: any): number[];
|
|
36
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
37
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
38
|
+
declare function permutation_from_cycle(cycle: any, n: any): any[];
|
|
39
|
+
declare function permutation_from_cycles(cycles: any, n: any): any[];
|
|
40
|
+
declare function permutation_from_cycles(cycles: any, n: any): any;
|
|
41
|
+
declare function compose_state(state1: any, state2: any): {
|
|
42
|
+
co: any[];
|
|
43
|
+
mp: any[];
|
|
44
|
+
wp: any[];
|
|
45
|
+
cp: any[];
|
|
46
|
+
};
|
|
47
|
+
declare function compose_state(state1: any, state2: any): any[][];
|
|
48
|
+
declare function invert_state(state: any): {
|
|
49
|
+
co: any[];
|
|
50
|
+
mp: number[];
|
|
51
|
+
wp: number[];
|
|
52
|
+
cp: number[];
|
|
53
|
+
};
|
|
54
|
+
declare function moves_commute(i: any, j: any): boolean;
|
|
55
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
56
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
57
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
58
|
+
declare function apply_move_sequence(state: any, move_sequence: any): any;
|
|
59
|
+
declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
|
|
60
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
61
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
62
|
+
declare function stringify_move_sequence(move_sequence: any): any;
|
|
63
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
64
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
65
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
66
|
+
declare function print_move_sequence(move_sequence: any): void;
|
|
67
|
+
declare function generate_random_move_sequence(length?: number): number[][];
|
|
68
|
+
declare function generate_random_state(): {
|
|
69
|
+
co: any[];
|
|
70
|
+
mp: number[];
|
|
71
|
+
wp: number[];
|
|
72
|
+
cp: number[];
|
|
73
|
+
};
|
|
74
|
+
declare function generate_random_state(): any[][];
|
|
75
|
+
declare function generate_random_state_scramble(): any;
|
|
76
|
+
declare function generate_random_state_scramble(): any;
|
|
77
|
+
declare function generate_random_state_scramble(): any;
|
|
78
|
+
declare function generate_random_state_scramble(): any;
|
|
79
|
+
declare function generate_scramble_sequence(tips?: boolean, obfuscate_tips?: boolean): any;
|
|
80
|
+
declare function generate_scramble_sequence(): any;
|
|
81
|
+
declare function solve(facelets: any, readable?: boolean): any[][];
|
|
82
|
+
declare function solve(state: any): any[];
|
|
83
|
+
declare function solve(state: any): any;
|
|
84
|
+
declare function solve(state: any): any;
|
|
85
|
+
declare function determine_V_coset(p: any): any;
|
|
86
|
+
declare function index_phase1(facelets: any): any[];
|
|
87
|
+
declare function index_phase1(state: any): number[];
|
|
88
|
+
declare function index_phase1(state: any): number[];
|
|
89
|
+
declare function phase1_benchmark(): number;
|
|
90
|
+
declare function phase1_ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any): Generator<any, void, any>;
|
|
91
|
+
declare function phase1_ida_solve_gen(coords: any): Generator<any, void, any>;
|
|
92
|
+
declare function phase1_ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): Generator<number[][], void, unknown>;
|
|
93
|
+
declare function phase1_ida_search_gen(a: any, b: any, c: any, d: any, e: any, f: any, mtable: any, ptable: any, bound: any, last: any): any;
|
|
94
|
+
declare function index_phase2(facelets: any): any[];
|
|
95
|
+
declare function index_phase2(state: any): number[];
|
|
96
|
+
declare function index_phase2(state: any): any[];
|
|
97
|
+
declare function generate_phase1_pairing_mtable(): any;
|
|
98
|
+
declare function generate_phase1_pairingc_mtable(): any;
|
|
99
|
+
declare function generate_phase1_pairing2c_ptable(): any;
|
|
100
|
+
declare function generate_phase1_full_ptable(): any;
|
|
101
|
+
declare function generate_phase2_permutation_mtable(): any;
|
|
102
|
+
declare function generate_phase2_orientation_mtable(): any;
|
|
103
|
+
declare function generate_phase2_permutation_ptable(): any;
|
|
104
|
+
declare function generate_phase2_permutation_ptable(): any;
|
|
105
|
+
declare function generate_phase2_orientation_ptable(): any;
|
|
106
|
+
declare function generate_phase2_orientation_ptable(): any;
|
|
107
|
+
declare function bfs(mtable: any, goal_states: any): Int8Array;
|
|
108
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
109
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
110
|
+
declare function bfs(mtable: any, goal_states: any): any[];
|
|
111
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any, commute: any): Generator<any, void, any>;
|
|
112
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any): Generator<any, void, any>;
|
|
113
|
+
declare function ida_solve_gen(indices: any, mtables: any, ptables: any): Generator<any, void, any>;
|
|
114
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any, commute: any): any;
|
|
115
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): Generator<number[][], void, unknown>;
|
|
116
|
+
declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
|
|
117
|
+
declare function evenpermutation12_to_index(perm: any): number;
|
|
118
|
+
declare function index_to_evenpermutation12(ind: any, perm: any): any;
|
|
119
|
+
declare namespace solved {
|
|
120
|
+
const co: number[];
|
|
121
|
+
const mp: any[];
|
|
122
|
+
const wp: any[];
|
|
123
|
+
const cp: number[];
|
|
124
|
+
}
|
|
125
|
+
declare namespace move_U {
|
|
126
|
+
const co_1: number[];
|
|
127
|
+
export { co_1 as co };
|
|
128
|
+
const mp_1: any[];
|
|
129
|
+
export { mp_1 as mp };
|
|
130
|
+
const wp_1: any[];
|
|
131
|
+
export { wp_1 as wp };
|
|
132
|
+
const cp_1: number[];
|
|
133
|
+
export { cp_1 as cp };
|
|
134
|
+
}
|
|
135
|
+
declare namespace move_L {
|
|
136
|
+
const co_2: number[];
|
|
137
|
+
export { co_2 as co };
|
|
138
|
+
const mp_2: any[];
|
|
139
|
+
export { mp_2 as mp };
|
|
140
|
+
const wp_2: any[];
|
|
141
|
+
export { wp_2 as wp };
|
|
142
|
+
const cp_2: number[];
|
|
143
|
+
export { cp_2 as cp };
|
|
144
|
+
}
|
|
145
|
+
declare namespace move_R {
|
|
146
|
+
const co_3: number[];
|
|
147
|
+
export { co_3 as co };
|
|
148
|
+
const mp_3: any[];
|
|
149
|
+
export { mp_3 as mp };
|
|
150
|
+
const wp_3: any[];
|
|
151
|
+
export { wp_3 as wp };
|
|
152
|
+
const cp_3: number[];
|
|
153
|
+
export { cp_3 as cp };
|
|
154
|
+
}
|
|
155
|
+
declare namespace move_B {
|
|
156
|
+
const co_4: number[];
|
|
157
|
+
export { co_4 as co };
|
|
158
|
+
const mp_4: any[];
|
|
159
|
+
export { mp_4 as mp };
|
|
160
|
+
const wp_4: any[];
|
|
161
|
+
export { wp_4 as wp };
|
|
162
|
+
const cp_4: number[];
|
|
163
|
+
export { cp_4 as cp };
|
|
164
|
+
}
|
|
165
|
+
declare namespace move_Uw {
|
|
166
|
+
const co_5: number[];
|
|
167
|
+
export { co_5 as co };
|
|
168
|
+
const mp_5: any;
|
|
169
|
+
export { mp_5 as mp };
|
|
170
|
+
const wp_5: any;
|
|
171
|
+
export { wp_5 as wp };
|
|
172
|
+
const cp_5: number[];
|
|
173
|
+
export { cp_5 as cp };
|
|
174
|
+
}
|
|
175
|
+
declare namespace move_Lw {
|
|
176
|
+
const co_6: number[];
|
|
177
|
+
export { co_6 as co };
|
|
178
|
+
const mp_6: any;
|
|
179
|
+
export { mp_6 as mp };
|
|
180
|
+
const wp_6: any;
|
|
181
|
+
export { wp_6 as wp };
|
|
182
|
+
const cp_6: number[];
|
|
183
|
+
export { cp_6 as cp };
|
|
184
|
+
}
|
|
185
|
+
declare namespace move_Rw {
|
|
186
|
+
const co_7: number[];
|
|
187
|
+
export { co_7 as co };
|
|
188
|
+
const mp_7: any;
|
|
189
|
+
export { mp_7 as mp };
|
|
190
|
+
const wp_7: any;
|
|
191
|
+
export { wp_7 as wp };
|
|
192
|
+
const cp_7: number[];
|
|
193
|
+
export { cp_7 as cp };
|
|
194
|
+
}
|
|
195
|
+
declare namespace move_Bw {
|
|
196
|
+
const co_8: number[];
|
|
197
|
+
export { co_8 as co };
|
|
198
|
+
const mp_8: any;
|
|
199
|
+
export { mp_8 as mp };
|
|
200
|
+
const wp_8: any;
|
|
201
|
+
export { wp_8 as wp };
|
|
202
|
+
const cp_8: number[];
|
|
203
|
+
export { cp_8 as cp };
|
|
204
|
+
}
|
|
205
|
+
declare let moves: any[];
|
|
206
|
+
declare let move_names: string[];
|
|
207
|
+
declare const N_MOVES: 8;
|
|
208
|
+
declare const N_MOVES_PHASE2: 4;
|
|
209
|
+
declare let phase1_permtable_m: any[];
|
|
210
|
+
declare let phase1_permtable_minv: any[];
|
|
211
|
+
declare let phase1_permtable_w: any[];
|
|
212
|
+
declare let phase1_permtable_winv: any[];
|
|
213
|
+
declare let phase1_c_update: number[];
|
|
214
|
+
declare let phase1_score_ptable: number[][];
|
|
215
|
+
declare let phase1_score_ptable_condensed: Int8Array;
|
|
216
|
+
declare let phase1_coord_to_score: Int8Array;
|
|
217
|
+
declare let tables: {};
|