cubing 0.24.5 → 0.25.1

package/dist/types/vendor/xyzzy/ftosolver-smaller-phase3-table.d.ts

@@ -0,0 +1 @@
+export function randomFTOScrambleString(): Promise<any>;

package/dist/types/vendor/xyzzy/ftosolver.d.ts

@@ -0,0 +1,203 @@
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function C4(n: any, k0: any, k1: any, k2: any, k3?: number): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function random_permutation(n: any): number[];
+declare function random_even_permutation(n: any): number[];
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function ctz(n: any): number;
+declare function generate_comb_lookup_tables(n: any, k: any): any;
+declare function popcount(n: any): number;
+declare function spread_bits(n: any): any;
+declare function interleave_bits(x: any, y: any): number;
+declare function generate_comb4_lookup_tables(n: any, k0: any, k1: any, k2: any, k3: any): any;
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose3(A: any, B: any, C: any): any[];
+declare function compose_o(A: any, B: any): any[][];
+declare function compose_o(A: any, B: any): any[][];
+declare function permutation_from_cycles(cycles: any, n: any): any[];
+declare function reduce_permutation(perm: any, keep: any): any[];
+declare function invert_permutation(perm: any): any[];
+declare function gcd(a: any, b: any): number;
+declare function lcm(a: any, b: any): number;
+declare function permutation_order(perm: any): number;
+declare function identify_corner_piece(colourA: any, colourB: any): number[];
+declare function identify_edge_piece(colourA: any, colourB: any): number;
+declare function get_corner_piece(facelets: any, location: any): number[];
+declare function get_edge_piece(facelets: any, location: any): number;
+declare function set_corner_piece(facelets: any, location: any, value: any, orientation: any): void;
+declare function set_edge_piece(facelets: any, location: any, value: any): void;
+declare function convert_move_to_permutations(move: any): {
+    cp: number[];
+    ep: number[];
+    ap: number[];
+    bp: number[];
+};
+declare function random_state(): any[];
+declare function random_state(): any[][];
+declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function invert_move_sequence(move_sequence: any): any;
+declare function simplify_move_sequence(move_sequence: any, make_noise?: boolean): any[][];
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_multiple_random_state_scrambles(n: any): any[];
+declare function generate_mtable_comb_generic(n: any, k: any, permutations: any): Uint32Array[];
+declare function generate_mtable_comb4_generic(n: any, k0: any, k1: any, k2: any, k3: any, permutations: any): Uint32Array[];
+declare function generate_mtable_single_generic(permutations: any): Uint32Array[];
+declare function combine_mtables(mtable0: any, mtable1: any): Uint32Array[];
+declare function trim_unreachable(mtable: any, origin: any): any[];
+declare function reduce_to_quotient(mtable: any, origins: any): (Int32Array | Int32Array[])[];
+declare function generate_mirrored_coordinate_table(mtable: any, a: any, b: any): Int32Array;
+declare function bfs(mtable: any, goal_states: any): Int8Array;
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any, commute: any): Generator<any, void, any>;
+declare function ida_solve_gen(indices: any, mtables: any, ptables: any): Generator<any, void, any>;
+declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any, commute: any): any;
+declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
+declare function solve(facelets: any, readable?: boolean): any[][];
+declare function solve(state: any): any[];
+declare function solve(state: any): any;
+declare function index_phase1(facelets: any): any[];
+declare function index_phase1(state: any): number[];
+declare function generate_phase1_edge_mtable(): any;
+declare function generate_phase1_edge_mtable(): any;
+declare function generate_phase1_edge_ptable(): any;
+declare function generate_phase1_edge_ptable(): any;
+declare function generate_phase1_centreA_mtable(): any;
+declare function generate_phase1_centreB_mtable(): any;
+declare function generate_phase1_centre_ptable(): any;
+declare function solve_phase1_gen(facelets: any): Generator<any, void, any>;
+declare function phase1_ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any): Generator<any, void, any>;
+declare function phase1_ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
+declare function index_phase2(facelets: any): any[];
+declare function index_phase2(state: any): number[];
+declare function solve_phase2_gen(facelets: any): Generator<any, void, any>;
+declare function solve_phase2(facelets: any): any;
+declare function solve_phase2(state: any): any;
+declare function generate_phase2_centre_mtables(): any;
+declare function generate_phase2_edge_mtable(): any;
+declare function generate_phase2_edge_mtable(): any;
+declare function generate_phase2_corner_mtable(): any;
+declare function generate_phase2_corner_mtable(): any;
+declare function generate_phase2_corner_mtable_compact(): any;
+declare function generate_phase2_ce_mtable(): any;
+declare function generate_phase2_ce_mirror_map(): any;
+declare function phase2_centre_goal_states(): any;
+declare function phase2_corner_goal_states(): number[];
+declare function generate_phase2_ace_ptable(): any;
+declare function phase2_ida_solve_gen(indices: any, moves_left: any): Generator<any, void, any>;
+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;
+declare function index_phase3_2gen(facelets: any): any[];
+declare function generate_phase3_2gen_edge_mtable(): any;
+declare function generate_phase3_2gen_corner_mtable(): any;
+declare function generate_phase3_2gen_corneredge_mtable(): any;
+declare function generate_phase3_2gen_centre_mtable(): any;
+declare function generate_phase3_2gen_depth_table(): any;
+declare function solve_phase3_2gen(facelets: any, indices?: any[], simplify?: boolean): any[];
+declare function solve_phase3_2gen_readable(facelets: any, indices?: any[]): any[][] | undefined;
+declare function alternation_penalty(x: any): number;
+declare function grade_readability(seq: any): any;
+declare function alternations(seq: any): number[];
+declare function solve_phase3_2gen_ida(ab: any, ce: any, mtable_ab: any, mtable_ce: any, depth_table: any, bound: any, last?: number): any;
+declare function solve_phase2_and_phase3_fast(facelets: any, phase2_attempts?: number, cap?: number): any;
+declare function solve_phase2_and_phase3_readable(facelets: any, phase2_attempts?: number, cap?: number): any[][] | undefined;
+declare function phase3_benchmark(solver?: typeof solve_phase3_2gen): void;
+declare function solver_benchmark(solver?: typeof solve): void;
+declare namespace rng {
+    export { next };
+    export const is_crypto: boolean;
+}
+declare function evenpermutation8_to_index(perm: any): number;
+declare function index_to_evenpermutation8(ind: any, perm: any): any;
+declare let comb_lookup_tables: {};
+declare let comb4_lookup_tables: {};
+declare let solved_state: number[];
+declare let move_U: any[];
+declare let move_Ui: any[];
+declare let move_X: number[];
+declare let move_Y: number[];
+declare let move_Z: number[];
+declare let move_L: any[];
+declare let move_F: any[];
+declare let move_R: any[];
+declare let move_Us: any[];
+declare let move_Uw: any[];
+declare let move_Uwi: any[];
+declare let move_Lw: any[];
+declare let move_Fw: any[];
+declare let move_Rw: any[];
+declare let colour_map: number[];
+declare let corner_piece_facelets: number[][];
+declare let edge_piece_facelets: number[][];
+declare let centreA_piece_facelets: number[];
+declare let centreB_piece_facelets: number[];
+declare let moves: any[][];
+declare let move_names: string[];
+declare let move_permutations: {
+    cp: number[];
+    ep: number[];
+    ap: number[];
+    bp: number[];
+}[];
+declare let cached_mtables: {};
+declare let cached_ptables: {};
+declare let phase1_centre_colour_map: number[];
+declare let phase2_centre_colour_map: number[];
+declare let phase2_centre_indices: number[];
+declare let phase2_keep: boolean[];
+declare let phase2_corner_keep: boolean[];
+declare let phase2_edge_reduction_map: any;
+declare let phase2_corner_reduction_map: any;
+declare let phase2_ce_mirror_map: any;
+declare let phase3_2gen_centre_indices: number[];
+declare let phase3_2gen_keep: boolean[];
+declare let phase3_2gen_move_seqs: number[][][];
+declare let phase3_2gen_nmoves: number;
+declare let phase3_2gen_facelet_permutations: any[];
+declare let phase3_2gen_piece_permutations: {
+    cp: number[];
+    ep: number[];
+    ap: number[];
+    bp: number[];
+}[];
+declare let phase3_2gen_move_orders: number[];
+declare let phase3_2gen_depth_table: any;
+declare function next(bound: any): number | undefined;

package/dist/types/vendor/xyzzy/kilosolver.d.ts

@@ -0,0 +1,140 @@
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose_o(A: any, B: any): any[][];
+declare function compose_o(A: any, B: any): any[][];
+declare function permutation_from_cycle(cycle: any, n: any): any[];
+declare function permutation_from_cycle(cycle: any, n: any): any[];
+declare function unsparsify_list(d: any, n: any): any[];
+declare function unsparsify_list(d: any, n: any): any[];
+declare function random_state(): any[];
+declare function random_state(): any[][];
+declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_random_move_scramble(M: any, N: any): number[][];
+declare function map_piece_to_face(loc: any, ori: any): string;
+declare function create_svg_template(state: any, colour_scheme: any): Element;
+declare function draw_state(svgel: any, state: any, colour_scheme: any): any;
+declare function solve_phase1(state: any): any;
+declare function search_phase1(flags: any, depth: any, last: any): any;
+declare function index_phase2(facelets: any): any[];
+declare function index_phase2(state: any): number[];
+declare function solve_phase2(facelets: any): any;
+declare function solve_phase2(state: any): any;
+declare function index_phase3(state: any): number[];
+declare function solve_phase3(state: any): any;
+declare function index_phase4(state: any): number[];
+declare function solve_phase4(state: any): any;
+declare function solve_phase4_fast(state: any): any;
+declare function solve(facelets: any, readable?: boolean): any[][];
+declare function solve(state: any): any[];
+declare function solve(state: any): any;
+declare function cn_solve(state: any): any;
+declare function generate_phase23_orientation_mtable(): any;
+declare function generate_phase2_orientation_ptable(): any;
+declare function generate_phase3_orientation_ptable(): any;
+declare function generate_phase23_permutation_mtable(): any;
+declare function generate_phase2_permutation_ptable(): any;
+declare function generate_phase3_permutation_ptable(): any;
+declare function generate_phase4_orientation_mtable(): any;
+declare function generate_phase4_permutation_mtable(): any;
+declare function generate_phase4_orientation_ptable(): any;
+declare function generate_phase4_permutation_ptable(): any;
+declare function generate_phase4_near_ptable_list(threshold: any): any;
+declare function binary_search(A: any, x: any): boolean;
+declare function cache_all_tables(): void;
+declare function bfs(mtable: any, goal_states: any): Int8Array;
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function ida_solve(indices: any, mtables: any, ptables: any): any;
+declare function ida_solve(indices: any, mtables: any, ptables: any, max_bound: any): any;
+declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): number[][] | undefined;
+declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
+declare function phase4_ida_solve(indices: any): any;
+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;
+declare function phase4_ida_solve_gen(indices: any): Generator<any, void, any>;
+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;
+declare function generate_hs_mtable(): any;
+declare function generate_hs_u_ptable(): any;
+declare function generate_hs_d_ptable(): any;
+declare function index_hs(state: any): number[];
+declare function solve_hs(state: any): any;
+declare function solve_hs_twophase(state: any): any;
+declare function generate_hybrid_scramble(): any[][];
+declare function generate_fullseparate_mtable(): any;
+declare function generate_fullseparate_ptable(): any;
+declare function bfs5(mtable: any, goal_states: any): any[];
+declare let PHASE4_THRESHOLD: number;
+declare function evenpermutation10_to_index(perm: any): number;
+declare function index_to_evenpermutation10(ind: any, perm: any): any;
+declare let move_U: any[][];
+declare let move_R: any[][];
+declare let move_F: any[][];
+declare let move_L: any[][];
+declare let move_BL: any[][];
+declare let move_BR: any[][];
+declare let move_x2: any[][];
+declare let move_y: any[][];
+declare let move_rot: number[][];
+declare let moves: any[][];
+declare let move_names: string[];
+declare let id: any[][];
+declare let moves_full: any[];
+declare namespace default_colour_scheme {
+    const U: string;
+    const L: string;
+    const F: string;
+    const R: string;
+    const BR: string;
+    const BL: string;
+    const DBR: string;
+    const DB: string;
+    const DBL: string;
+    const DFL: string;
+    const DFR: string;
+    const D: string;
+}
+declare let face_names: string[];
+declare let rotation_amounts: number[][];
+declare let translation_amounts: any;
+declare let tables: {};

package/dist/types/vendor/xyzzy/masterpyra.d.ts

@@ -0,0 +1 @@
+export function randomMasterTetraminxScrambleString(): Promise<any>;

package/dist/types/vendor/xyzzy/rediscrambler.d.ts

@@ -0,0 +1,94 @@
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function counter(A: any): any[];
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function factorial(n: any): any;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function C(n: any, k: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function permutation_to_index(perm: any): number;
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function index_to_permutation(ind: any, n: any): number[];
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function permutation_parity(A: any): number;
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function index_to_evenpermutation(ind: any, n: any): number[];
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function evenpermutation_to_index(perm: any): number;
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function comb_to_index(l: any): number;
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function index_to_comb(ind: any, ones: any, bits: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function compose(A: any, B: any): any[];
+declare function permutation_from_cycle(cycle: any, n: any): any[];
+declare function permutation_from_cycle(cycle: any, n: any): any[];
+declare function unsparsify_list(d: any, n: any): any[];
+declare function unsparsify_list(d: any, n: any): any[];
+declare function compose_state(state1: any, state2: any): any[][];
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function apply_move_sequence(state: any, move_sequence: any): any;
+declare function stringify_move_sequence(move_sequence: any, no_wide?: boolean): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function stringify_move_sequence(move_sequence: any): any;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function print_move_sequence(move_sequence: any): void;
+declare function generate_random_state(): any[][];
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_random_state_scramble(): any;
+declare function generate_scramble_sequence(): any;
+declare function solve(facelets: any, readable?: boolean): any[][];
+declare function solve(state: any): any[];
+declare function solve(state: any): any;
+declare function index_phase1(facelets: any): any[];
+declare function index_phase1(state: any): number[];
+declare function generate_phase1_corner_mtable(): any;
+declare function generate_phase1_corner_ptable(): any;
+declare function generate_phase1_edge_mtable(): any;
+declare function generate_phase1_edge_mtable(): any;
+declare function generate_phase1_edge_ptable(): any;
+declare function generate_phase1_edge_ptable(): any;
+declare function generate_phase1_separate_mtable(): any;
+declare function generate_phase1_separate_ptable(): any;
+declare function generate_phase2_corner_mtable(): any;
+declare function generate_phase2_corner_mtable(): any;
+declare function generate_phase2_edge_mtable(): any;
+declare function generate_phase2_edge_mtable(): any;
+declare function generate_phase2_edge_ptable(): any;
+declare function bfs(mtable: any, goal_states: any): Int8Array;
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function bfs(mtable: any, goal_states: any): any[];
+declare function ida_solve(indices: any, mtables: any, ptables: any): any;
+declare function ida_solve(indices: any, mtables: any, ptables: any, max_bound: any): any;
+declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): number[][] | undefined;
+declare function ida_search(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
+declare function ida_solve_gen(indices: any, mtables: any, ptables: any, moves_left: any, commute: any): Generator<any, void, any>;
+declare function ida_solve_gen(indices: any, mtables: any, ptables: any): Generator<any, void, any>;
+declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any, commute: any): any;
+declare function ida_search_gen(indices: any, mtables: any, ptables: any, bound: any, last: any): any;
+declare let move_L: any[][];
+declare let move_B: any[][];
+declare let move_R: any[][];
+declare let move_F: any[][];
+declare let move_l: any[][];
+declare let move_b: any[][];
+declare let move_r: any[][];
+declare let move_f: any[][];
+declare let solved: any[][];
+declare let moves: any[][];
+declare let move_names: string[];
+declare let tetrad: number[];
+declare let tables: {};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "cubing",
-  "version": "0.24.5",
+  "version": "0.25.1",
   "description": "A collection of JavaScript cubing libraries.",
   "author": "The js.cubing.net team",
   "type": "module",
@@ -32,7 +32,7 @@
     "jszip": "^3.5.0",
     "peggy": "^1.1.0",
     "prettier": "^2.2.1",
-    "puppeteer": "^13.1.1",
+    "puppeteer": "^13.1.2",
     "typescript": "^4.5.4",
     "yargs": "^16.2.0"
   },

package/dist/esm/chunk-37EHU3GZ.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/vendor/random-uint-below/get-random-values.ts", "../../src/cubing/vendor/random-uint-below/random53BitValue.ts", "../../src/cubing/vendor/random-uint-below/random-choice.ts", "../../src/cubing/vendor/random-uint-below/index.ts"],
-  "sourcesContent": ["export type GetRandomValuesFunction = (arr: Uint32Array) => void;\n\n// This is a workaround for a `node` segfault.\n// In theory, imports are cached and safe to import multiple times: https://nodejs.org/api/esm.html#esm_urls\n// In practice, a rapid series of inline imports inside a worker causes a segfault(!) in `node`.\n// So we cache a single import reference. We avoid populating it until we first need it, so that we don't attempt to perform the import in environments that don't need or have it (e.g. browsers, `deno`).\nlet cryptoPromise: Promise<typeof import(\"crypto\")> | null = null;\n\n// `@types/node` is... lacking. This type may cause an error in the future, at which point we can hopefully use `@types/node` directly.\ntype NodeWebCrypto = typeof import(\"crypto\").webcrypto & {\n  getRandomValues: GetRandomValuesFunction;\n};\n\n// We could use top-level await to define this more statically, but that has limited transpilation support.\nexport async function getRandomValuesFactory(): Promise<GetRandomValuesFunction> {\n  if (!globalThis?.crypto?.getRandomValues) {\n    const nodeWebcrypto = (await (cryptoPromise ??= import(\"crypto\")))\n      .webcrypto as NodeWebCrypto;\n    return nodeWebcrypto.getRandomValues;\n  } else {\n    return crypto.getRandomValues.bind(crypto) as GetRandomValuesFunction;\n  }\n}\n", "import {\n  getRandomValuesFactory,\n  GetRandomValuesFunction,\n} from \"./get-random-values\";\n\n/*\n * randomInt.below(max) returns a random non-negative integer less than max (0 <= output < max).\n * `max` must be at most 2^53.\n */\n\nconst MAX_JS_PRECISE_INT = 9007199254740992;\n\nconst UPPER_HALF_MULTIPLIER = 2097152; // 2^21. We have to use multiplication because bit shifts truncate to 32 bits.\nconst LOWER_HALF_DIVIDER = 2048;\n\nfunction random53BitValue(getRandomValues: GetRandomValuesFunction): number {\n  // Construct a random 53-bit value from a 32-bit upper half and a 21-bit lower half.\n  const arr = new Uint32Array(2);\n  getRandomValues(arr);\n  const upper = arr[0];\n  const lower = arr[1];\n  return (\n    Math.floor(upper * UPPER_HALF_MULTIPLIER) +\n    Math.floor(lower / LOWER_HALF_DIVIDER)\n  );\n}\n\nfunction validateMax(max: number): void {\n  if (typeof max !== \"number\" || max < 0 || Math.floor(max) !== max) {\n    throw new Error(\n      \"randomInt.below() not called with a positive integer value.\",\n    );\n  }\n  if (max > MAX_JS_PRECISE_INT) {\n    throw new Error(\n      `Called randomInt.below() with max == ${max}, which is larger than JavaScript can handle with integer precision.`,\n    );\n  }\n}\n\n// TODO: cache generated `randomUIntBelow`?\nexport async function randomUIntBelowFactory(): Promise<\n  (max: number) => number\n> {\n  const getRandomValues = await getRandomValuesFactory();\n  const randomUIntBelow = (max: number): number => {\n    validateMax(max);\n\n    const val = random53BitValue(getRandomValues);\n    const maxUniformSamplingRange = Math.floor(MAX_JS_PRECISE_INT / max) * max;\n\n    // Rejection sampling:\n    if (val < maxUniformSamplingRange) {\n      return val % max;\n    } else {\n      // val % max would produce a biased result. This bias an be very bad if `max` is on the order of MAX_JS_PRECISE_INT. We have to try again, so just call ourselves recursively.\n      // For some values of `max` just above 9007199254740992 / 2, this happens about once on average. For other values of `max`, it's less than that (and for small values of `max` it's extremely unlikely).\n\n      // TODO: Use more bits of accuracy instead of rejection sampling to avoid DoS.\n      return randomUIntBelow(max);\n    }\n  };\n  return randomUIntBelow;\n}\n", "import { randomUIntBelowFactory } from \"./random53BitValue\";\n\n// Inspired by https://reference.wolfram.com/language/ref/RandomChoice.html\n// This library itself should be kept small, but a wrapper library may want to implement selecting multiple element without replacement as with replacement:\n// https://reference.wolfram.com/language/ref/RandomSample.html\nexport async function randomChoiceFactory<T>(): Promise<(arr: Array<T>) => T> {\n  const randomUIntBelow = await randomUIntBelowFactory();\n  return (arr: Array<T>): T => arr[randomUIntBelow(arr.length)];\n}\n", "export { randomChoiceFactory } from \"./random-choice\";\nexport { randomUIntBelowFactory } from \"./random53BitValue\";\n\n// TODO: reuse factory properly, move this to a separate file, add to impl.\nimport { randomUIntBelowFactory } from \"./random53BitValue\";\nconst randomUIntBelowPromise = randomUIntBelowFactory();\nexport async function randomPermute<T>(list: T[]): Promise<void> {\n  for (let i = 1; i < list.length; i++) {\n    const j = (await randomUIntBelowPromise)(i);\n    [list[i], list[j]] = [list[j], list[i]];\n  }\n}\n"],
-  "mappings": ";AAMA,IAAI,gBAAyD;AAQ7D,wCAAiF;AAC/E,MAAI,CAAC,YAAY,QAAQ,iBAAiB;AACxC,UAAM,gBAAiB,OAAO,mCAAkB,OAAO,aACpD;AACH,WAAO,cAAc;AAAA,SAChB;AACL,WAAO,OAAO,gBAAgB,KAAK;AAAA;AAAA;;;ACVvC,IAAM,qBAAqB;AAE3B,IAAM,wBAAwB;AAC9B,IAAM,qBAAqB;AAE3B,0BAA0B,iBAAkD;AAE1E,QAAM,MAAM,IAAI,YAAY;AAC5B,kBAAgB;AAChB,QAAM,QAAQ,IAAI;AAClB,QAAM,QAAQ,IAAI;AAClB,SACE,KAAK,MAAM,QAAQ,yBACnB,KAAK,MAAM,QAAQ;AAAA;AAIvB,qBAAqB,KAAmB;AACtC,MAAI,OAAO,QAAQ,YAAY,MAAM,KAAK,KAAK,MAAM,SAAS,KAAK;AACjE,UAAM,IAAI,MACR;AAAA;AAGJ,MAAI,MAAM,oBAAoB;AAC5B,UAAM,IAAI,MACR,wCAAwC;AAAA;AAAA;AAM9C,wCAEE;AACA,QAAM,kBAAkB,MAAM;AAC9B,QAAM,kBAAkB,CAAC,QAAwB;AAC/C,gBAAY;AAEZ,UAAM,MAAM,iBAAiB;AAC7B,UAAM,0BAA0B,KAAK,MAAM,qBAAqB,OAAO;AAGvE,QAAI,MAAM,yBAAyB;AACjC,aAAO,MAAM;AAAA,WACR;AAKL,aAAO,gBAAgB;AAAA;AAAA;AAG3B,SAAO;AAAA;;;ACzDT,qCAA8E;AAC5E,QAAM,kBAAkB,MAAM;AAC9B,SAAO,CAAC,QAAqB,IAAI,gBAAgB,IAAI;AAAA;;;ACFvD,IAAM,yBAAyB;AAC/B,6BAAuC,MAA0B;AAC/D,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,IAAK,OAAM,wBAAwB;AACzC,KAAC,KAAK,IAAI,KAAK,MAAM,CAAC,KAAK,IAAI,KAAK;AAAA;AAAA;",
-  "names": []
-}

package/dist/esm/node-SP4L2AKI.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/vendor/comlink-everywhere/inside/node.js"],
-  "sourcesContent": ["export async function port() {\n  const { parentPort } = await import(\"worker_threads\").catch();\n  const nodeEndpoint = (await import(\"comlink/dist/esm/node-adapter.mjs\"))\n    .default;\n  return nodeEndpoint(parentPort);\n}\n"],
-  "mappings": ";;;AAAA,sBAA6B;AAC3B,QAAM,EAAE,eAAe,MAAM,OAAO,kBAAkB;AACtD,QAAM,eAAgB,OAAM,OAAO,sCAChC;AACH,SAAO,aAAa;AAAA;",
-  "names": []
-}

package/dist/esm/node-W3AD4HBK.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/vendor/comlink-everywhere/outside/node.js"],
-  "sourcesContent": ["async function getImports() {\n  return {\n    NodeWorker: (await import(\"worker_threads\")).Worker,\n    nodeEndpoint: (await import(\"comlink/dist/esm/node-adapter.mjs\")).default,\n  };\n}\n\nfunction construct(imports, url, nodeOptions) {\n  const worker = new imports.NodeWorker(url, nodeOptions);\n  // Avoid holding up the entire program exit if only workers are running.\n  // https://nodejs.org/api/worker_threads.html#worker_threads_broadcastchannel_unref\n  worker.unref();\n  const wrappedWorker = imports.nodeEndpoint(worker);\n  wrappedWorker.nodeWorker = worker; // TODO\n  return wrappedWorker;\n}\n\nlet cachedNodeWorkerWrapper = null;\nexport async function NodeWorkerWrapper() {\n  const imports = await getImports();\n  return (\n    cachedNodeWorkerWrapper ||\n    (cachedNodeWorkerWrapper = class {\n      constructor(url, _options) {\n        return construct(imports, url);\n      }\n    })\n  );\n}\n\nlet cachedNodeWorkerStringWrapper = null;\nexport async function NodeWorkerStringWrapper() {\n  const imports = await getImports();\n  return (\n    cachedNodeWorkerStringWrapper ||\n    (cachedNodeWorkerStringWrapper = class {\n      constructor(url, _options) {\n        return construct(imports, url, { eval: true });\n      }\n    })\n  );\n}\n"],
-  "mappings": ";;;AAAA,4BAA4B;AAC1B,SAAO;AAAA,IACL,YAAa,OAAM,OAAO,mBAAmB;AAAA,IAC7C,cAAe,OAAM,OAAO,sCAAsC;AAAA;AAAA;AAItE,mBAAmB,SAAS,KAAK,aAAa;AAC5C,QAAM,SAAS,IAAI,QAAQ,WAAW,KAAK;AAG3C,SAAO;AACP,QAAM,gBAAgB,QAAQ,aAAa;AAC3C,gBAAc,aAAa;AAC3B,SAAO;AAAA;AAGT,IAAI,0BAA0B;AAC9B,mCAA0C;AACxC,QAAM,UAAU,MAAM;AACtB,SACE,2BACC,2BAA0B,MAAM;AAAA,IAC/B,YAAY,KAAK,UAAU;AACzB,aAAO,UAAU,SAAS;AAAA;AAAA;AAAA;AAMlC,IAAI,gCAAgC;AACpC,yCAAgD;AAC9C,QAAM,UAAU,MAAM;AACtB,SACE,iCACC,iCAAgC,MAAM;AAAA,IACrC,YAAY,KAAK,UAAU;AACzB,aAAO,UAAU,SAAS,KAAK,EAAE,MAAM;AAAA;AAAA;AAAA;",
-  "names": []
-}