@calcit/ternary-tree 0.0.17 → 0.0.19

package/lib/bundle.js

@@ -1,2988 +0,0 @@
-/******/ (() => { // webpackBootstrap
-/******/ 	"use strict";
-/******/ 	var __webpack_modules__ = ({
-
-/***/ "./lib/list.js":
-/*!*********************!*\
-  !*** ./lib/list.js ***!
-  \*********************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "getDepth": () => (/* binding */ getDepth),
-/* harmony export */   "makeTernaryTreeList": () => (/* binding */ makeTernaryTreeList),
-/* harmony export */   "initTernaryTreeList": () => (/* binding */ initTernaryTreeList),
-/* harmony export */   "initTernaryTreeListFromRange": () => (/* binding */ initTernaryTreeListFromRange),
-/* harmony export */   "initEmptyTernaryTreeList": () => (/* binding */ initEmptyTernaryTreeList),
-/* harmony export */   "listToString": () => (/* binding */ listToString),
-/* harmony export */   "listLen": () => (/* binding */ listLen),
-/* harmony export */   "formatListInline": () => (/* binding */ formatListInline),
-/* harmony export */   "listToItems": () => (/* binding */ listToItems),
-/* harmony export */   "findIndex": () => (/* binding */ findIndex),
-/* harmony export */   "indexOf": () => (/* binding */ indexOf),
-/* harmony export */   "indexToItems": () => (/* binding */ indexToItems),
-/* harmony export */   "listToPairs": () => (/* binding */ listToPairs),
-/* harmony export */   "listGet": () => (/* binding */ listGet),
-/* harmony export */   "first": () => (/* binding */ first),
-/* harmony export */   "last": () => (/* binding */ last),
-/* harmony export */   "assocList": () => (/* binding */ assocList),
-/* harmony export */   "dissocList": () => (/* binding */ dissocList),
-/* harmony export */   "rest": () => (/* binding */ rest),
-/* harmony export */   "butlast": () => (/* binding */ butlast),
-/* harmony export */   "insert": () => (/* binding */ insert),
-/* harmony export */   "assocBefore": () => (/* binding */ assocBefore),
-/* harmony export */   "assocAfter": () => (/* binding */ assocAfter),
-/* harmony export */   "forceListInplaceBalancing": () => (/* binding */ forceListInplaceBalancing),
-/* harmony export */   "prepend": () => (/* binding */ prepend),
-/* harmony export */   "append": () => (/* binding */ append),
-/* harmony export */   "concat": () => (/* binding */ concat),
-/* harmony export */   "sameListShape": () => (/* binding */ sameListShape),
-/* harmony export */   "listEqual": () => (/* binding */ listEqual),
-/* harmony export */   "checkListStructure": () => (/* binding */ checkListStructure),
-/* harmony export */   "slice": () => (/* binding */ slice),
-/* harmony export */   "reverse": () => (/* binding */ reverse),
-/* harmony export */   "listMapValues": () => (/* binding */ listMapValues)
-/* harmony export */ });
-/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./types */ "./lib/types.js");
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./lib/utils.js");
-
-
-// just get, will not compute recursively
-function getDepth(tree) {
-    if (tree == null)
-        return 0;
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return 1;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return tree.depth;
-    }
-}
-let emptyBranch = null;
-let isEmptyBranch = (x) => {
-    if (x == null) {
-        return true;
-    }
-    return x.size == 0;
-};
-function decideParentDepth(...xs) {
-    let depth = 0;
-    for (let i = 0; i < xs.length; i++) {
-        let x = xs[i];
-        let y = getDepth(x);
-        if (y > depth) {
-            depth = y;
-        }
-    }
-    return depth + 1;
-}
-function makeTernaryTreeList(size, offset, xs) {
-    switch (size) {
-        case 0: {
-            return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch, size: 0, depth: 1, left: emptyBranch, middle: emptyBranch, right: emptyBranch };
-        }
-        case 1:
-            return xs[offset];
-        case 2: {
-            let left = xs[offset];
-            let middle = xs[offset + 1];
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: listLen(left) + listLen(middle),
-                left: left,
-                middle: middle,
-                right: emptyBranch,
-                depth: decideParentDepth(left, middle),
-            };
-            return result;
-        }
-        case 3: {
-            let left = xs[offset];
-            let middle = xs[offset + 1];
-            let right = xs[offset + 2];
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: listLen(left) + listLen(middle) + listLen(right),
-                left: left,
-                middle: middle,
-                right: right,
-                depth: decideParentDepth(left, middle, right),
-            };
-            return result;
-        }
-        default: {
-            let divided = (0,_utils__WEBPACK_IMPORTED_MODULE_1__.divideTernarySizes)(size);
-            let left = makeTernaryTreeList(divided.left, offset, xs);
-            let middle = makeTernaryTreeList(divided.middle, offset + divided.left, xs);
-            let right = makeTernaryTreeList(divided.right, offset + divided.left + divided.middle, xs);
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: listLen(left) + listLen(middle) + listLen(right),
-                depth: decideParentDepth(left, middle, right),
-                left: left,
-                middle: middle,
-                right: right,
-            };
-            return result;
-        }
-    }
-}
-function initTernaryTreeList(xs) {
-    let ys = new Array(xs.length);
-    let size = xs.length;
-    for (let idx = 0; idx < size; idx++) {
-        let x = xs[idx];
-        ys[idx] = { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: x };
-    }
-    return makeTernaryTreeList(xs.length, 0, ys);
-}
-// from a slice of an existed array
-function initTernaryTreeListFromRange(xs, from, to) {
-    let ys = new Array(xs.length);
-    for (let idx = from; idx < to; idx++) {
-        let x = xs[idx];
-        ys[idx] = { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: x };
-    }
-    return makeTernaryTreeList(xs.length, 0, ys);
-}
-function initEmptyTernaryTreeList() {
-    return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch, size: 0, depth: 1, middle: emptyBranch, left: emptyBranch, right: emptyBranch };
-}
-function listToString(tree) {
-    return `TernaryTreeList[${tree.size}, ...]`;
-}
-function listLen(tree) {
-    if (tree == null) {
-        return 0;
-    }
-    else {
-        return tree.size;
-    }
-}
-function isLeaf(tree) {
-    return tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf;
-}
-function isBranch(tree) {
-    return tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch;
-}
-function formatListInline(tree) {
-    if (tree == null) {
-        return "_";
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return `${tree.value}`;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return "(" + formatListInline(tree.left) + " " + formatListInline(tree.middle) + " " + formatListInline(tree.right) + ")";
-        // "(" & tree.left.formatListInline & " " & tree.middle.formatListInline & " " & tree.right.formatListInline & ")@{tree.depth} " & "{tree.left.getDepth} {tree.middle.getDepth} {tree.right.getDepth}..."
-    }
-}
-function* listToItems(tree) {
-    if (tree != null) {
-        switch (tree.kind) {
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-                yield tree.value;
-                break;
-            }
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-                if (tree.left != null) {
-                    for (let x of listToItems(tree.left)) {
-                        yield x;
-                    }
-                }
-                if (tree.middle != null) {
-                    for (let x of listToItems(tree.middle)) {
-                        yield x;
-                    }
-                }
-                if (tree.right != null) {
-                    for (let x of listToItems(tree.right)) {
-                        yield x;
-                    }
-                }
-                break;
-            }
-        }
-    }
-}
-// returns -1 if (not foun)
-function findIndex(tree, f) {
-    if (tree == null) {
-        return -1;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-            if (f(tree.value)) {
-                return 0;
-            }
-            else {
-                return -1;
-            }
-        }
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-            let tryLeft = findIndex(tree.left, f);
-            if (tryLeft >= 0) {
-                return tryLeft;
-            }
-            let tryMiddle = findIndex(tree.middle, f);
-            if (tryMiddle >= 0) {
-                return tryMiddle + listLen(tree.left);
-            }
-            let tryRight = findIndex(tree.right, f);
-            if (tryRight >= 0) {
-                return tryRight + listLen(tree.left) + listLen(tree.middle);
-            }
-            return -1;
-        }
-    }
-}
-// returns -1 if (not foun)
-function indexOf(tree, item) {
-    if (tree == null) {
-        return -1;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(item, tree.value)) {
-                return 0;
-            }
-        default:
-            return -1;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            let tryLeft = indexOf(tree.left, item);
-            if (tryLeft >= 0) {
-                return tryLeft;
-            }
-            let tryMiddle = indexOf(tree.middle, item);
-            if (tryMiddle >= 0) {
-                return tryMiddle + listLen(tree.left);
-            }
-            let tryRight = indexOf(tree.right, item);
-            if (tryRight >= 0) {
-                return tryRight + listLen(tree.left) + listLen(tree.middle);
-            }
-            return -1;
-    }
-}
-function writeLeavesArray(tree, acc, idx) {
-    if (tree == null) {
-        //
-    }
-    else {
-        switch (tree.kind) {
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-                acc[idx.value] = tree;
-                idx.value = idx.value + 1;
-                break;
-            }
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-                if (tree.left != null) {
-                    writeLeavesArray(tree.left, acc, idx);
-                }
-                if (tree.middle != null) {
-                    writeLeavesArray(tree.middle, acc, idx);
-                }
-                if (tree.right != null) {
-                    writeLeavesArray(tree.right, acc, idx);
-                }
-                break;
-            }
-            default: {
-                throw new Error("Unknown");
-            }
-        }
-    }
-}
-function toLeavesArray(tree) {
-    let acc = new Array(listLen(tree));
-    let counter = { value: 0 };
-    writeLeavesArray(tree, acc, counter);
-    return acc;
-}
-function* indexToItems(tree) {
-    for (let idx = 0; idx < listLen(tree); idx++) {
-        yield listGet(tree, idx);
-    }
-}
-function* listToPairs(tree) {
-    let idx = 0;
-    for (let x of listToItems(tree)) {
-        yield [idx, x];
-        idx = idx + 1;
-    }
-}
-function listGet(originalTree, originalIdx) {
-    let tree = originalTree;
-    let idx = originalIdx;
-    while (tree != null) {
-        if (idx < 0) {
-            throw new Error("Cannot index negative number");
-        }
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (idx === 0) {
-                return tree.value;
-            }
-            else {
-                throw new Error(`Cannot get from leaf with index ${idx}`);
-            }
-        }
-        if (idx > tree.size - 1) {
-            throw new Error("Index too large");
-        }
-        let leftSize = tree.left == null ? 0 : tree.left.size;
-        let middleSize = tree.middle == null ? 0 : tree.middle.size;
-        let rightSize = tree.right == null ? 0 : tree.right.size;
-        if (leftSize + middleSize + rightSize !== tree.size) {
-            throw new Error("tree.size does not match sum case branch sizes");
-        }
-        if (idx <= leftSize - 1) {
-            tree = tree.left;
-        }
-        else if (idx <= leftSize + middleSize - 1) {
-            tree = tree.middle;
-            idx = idx - leftSize;
-        }
-        else {
-            tree = tree.right;
-            idx = idx - leftSize - middleSize;
-        }
-    }
-    throw new Error(`Failed to get ${idx}`);
-}
-function first(tree) {
-    if (listLen(tree) > 0) {
-        return listGet(tree, 0);
-    }
-    else {
-        throw new Error("Cannot get from empty list");
-    }
-}
-function last(tree) {
-    if (listLen(tree) > 0) {
-        return listGet(tree, listLen(tree) - 1);
-    }
-    else {
-        throw new Error("Cannot get from empty list");
-    }
-}
-function assocList(tree, idx, item) {
-    if (idx < 0) {
-        throw new Error("Cannot index negative number");
-    }
-    if (idx > tree.size - 1) {
-        throw new Error("Index too large");
-    }
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (idx === 0) {
-            return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item };
-        }
-        else {
-            throw new Error(`Cannot get from leaf with index ${idx}`);
-        }
-    }
-    let leftSize = listLen(tree.left);
-    let middleSize = listLen(tree.middle);
-    let rightSize = listLen(tree.right);
-    if (leftSize + middleSize + rightSize !== tree.size)
-        throw new Error("tree.size does not match sum case branch sizes");
-    if (idx <= leftSize - 1) {
-        let changedBranch = assocList(tree.left, idx, item);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size,
-            depth: decideParentDepth(changedBranch, tree.middle, tree.right),
-            left: changedBranch,
-            middle: tree.middle,
-            right: tree.right,
-        };
-        return result;
-    }
-    else if (idx <= leftSize + middleSize - 1) {
-        let changedBranch = assocList(tree.middle, idx - leftSize, item);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size,
-            depth: decideParentDepth(tree.left, changedBranch, tree.right),
-            left: tree.left,
-            middle: changedBranch,
-            right: tree.right,
-        };
-        return result;
-    }
-    else {
-        let changedBranch = assocList(tree.right, idx - leftSize - middleSize, item);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size,
-            depth: decideParentDepth(tree.left, tree.middle, changedBranch),
-            left: tree.left,
-            middle: tree.middle,
-            right: changedBranch,
-        };
-        return result;
-    }
-}
-function dissocList(tree, idx) {
-    if (tree == null) {
-        throw new Error("dissoc does not work on null");
-    }
-    if (idx < 0) {
-        throw new Error(`Index is negative ${idx}`);
-    }
-    if (listLen(tree) === 0) {
-        throw new Error("Cannot remove from empty list");
-    }
-    if (idx > listLen(tree) - 1) {
-        throw new Error(`Index too large ${idx}`);
-    }
-    if (listLen(tree) === 1) {
-        return emptyBranch;
-    }
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        throw new Error("dissoc should be handled at branches");
-    }
-    let leftSize = listLen(tree.left);
-    let middleSize = listLen(tree.middle);
-    let rightSize = listLen(tree.right);
-    if (leftSize + middleSize + rightSize !== tree.size) {
-        throw new Error("tree.size does not match sum from branch sizes");
-    }
-    let result = emptyBranch;
-    if (idx <= leftSize - 1) {
-        let changedBranch = dissocList(tree.left, idx);
-        if (changedBranch == null || changedBranch.size === 0) {
-            result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size - 1,
-                depth: decideParentDepth(tree.middle, tree.right),
-                left: tree.middle,
-                middle: tree.right,
-                right: emptyBranch,
-            };
-        }
-        else {
-            result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size - 1,
-                depth: decideParentDepth(changedBranch, tree.middle, tree.right),
-                left: changedBranch,
-                middle: tree.middle,
-                right: tree.right,
-            };
-        }
-    }
-    else if (idx <= leftSize + middleSize - 1) {
-        let changedBranch = dissocList(tree.middle, idx - leftSize);
-        if (changedBranch == null || changedBranch.size === 0) {
-            result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size - 1,
-                depth: decideParentDepth(tree.left, changedBranch, tree.right),
-                left: tree.left,
-                middle: tree.right,
-                right: emptyBranch,
-            };
-        }
-        else {
-            result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size - 1,
-                depth: decideParentDepth(tree.left, changedBranch, tree.right),
-                left: tree.left,
-                middle: changedBranch,
-                right: tree.right,
-            };
-        }
-    }
-    else {
-        let changedBranch = dissocList(tree.right, idx - leftSize - middleSize);
-        if (changedBranch == null || changedBranch.size === 0) {
-            changedBranch = emptyBranch;
-        }
-        result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size - 1,
-            depth: decideParentDepth(tree.left, tree.middle, changedBranch),
-            left: tree.left,
-            middle: tree.middle,
-            right: changedBranch,
-        };
-    }
-    if (result.middle == null) {
-        return result.left;
-    }
-    return result;
-}
-function rest(tree) {
-    if (tree == null) {
-        throw new Error("Cannot call rest on null");
-    }
-    if (listLen(tree) < 1) {
-        throw new Error("Cannot call rest on empty list");
-    }
-    return dissocList(tree, 0);
-}
-function butlast(tree) {
-    if (tree == null) {
-        throw new Error("Cannot call butlast on null");
-    }
-    if (listLen(tree) < 1) {
-        throw new Error("Cannot call butlast on empty list");
-    }
-    return dissocList(tree, listLen(tree) - 1);
-}
-function insert(tree, idx, item, after = false) {
-    if (tree == null) {
-        throw new Error("Cannot insert into null");
-    }
-    if (listLen(tree) === 0) {
-        throw new Error("Empty node is not a correct position for inserting");
-    }
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (after) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                depth: getDepth(tree) + 1,
-                size: 2,
-                left: tree,
-                middle: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                right: emptyBranch,
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                depth: getDepth(tree) + 1,
-                size: 2,
-                left: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                middle: tree,
-                right: emptyBranch,
-            };
-            return result;
-        }
-    }
-    if (listLen(tree) === 1) {
-        if (after) {
-            // in compact mode, values placed at left
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: 2,
-                depth: 2,
-                left: tree.left,
-                middle: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                right: emptyBranch,
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: 2,
-                depth: getDepth(tree.middle) + 1,
-                left: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                middle: tree.left,
-                right: emptyBranch,
-            };
-            return result;
-        }
-    }
-    if (listLen(tree) === 2 && tree.middle != null) {
-        if (after) {
-            if (idx === 0) {
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    size: 3,
-                    depth: 2,
-                    left: tree.left,
-                    middle: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                    right: tree.middle,
-                };
-                return result;
-            }
-            if (idx === 1) {
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    size: 3,
-                    depth: 2,
-                    left: tree.left,
-                    middle: tree.middle,
-                    right: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                };
-                return result;
-            }
-            else {
-                throw new Error("cannot insert after position 2 since only 2 elements here");
-            }
-        }
-        else {
-            if (idx === 0) {
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    size: 3,
-                    depth: 2,
-                    left: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                    middle: tree.left,
-                    right: tree.middle,
-                };
-                return result;
-            }
-            else if (idx === 1) {
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    size: 3,
-                    depth: 2,
-                    left: tree.left,
-                    middle: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                    right: tree.middle,
-                };
-                return result;
-            }
-            else {
-                throw new Error("cannot insert before position 2 since only 2 elements here");
-            }
-        }
-    }
-    let leftSize = listLen(tree.left);
-    let middleSize = listLen(tree.middle);
-    let rightSize = listLen(tree.right);
-    if (leftSize + middleSize + rightSize !== tree.size) {
-        throw new Error("tree.size does not match sum case branch sizes");
-    }
-    // echo "picking: ", idx, " ", leftSize, " ", middleSize, " ", rightSize
-    if (idx === 0 && !after) {
-        if (listLen(tree.left) >= listLen(tree.middle) && listLen(tree.left) >= listLen(tree.right)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size + 1,
-                depth: tree.depth + 1,
-                left: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                middle: tree,
-                right: emptyBranch,
-            };
-            return result;
-        }
-    }
-    if (idx === listLen(tree) - 1 && after) {
-        if (listLen(tree.right) >= listLen(tree.middle) && listLen(tree.right) >= listLen(tree.left)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size + 1,
-                depth: tree.depth + 1,
-                left: tree,
-                middle: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-                right: emptyBranch,
-            };
-            return result;
-        }
-    }
-    if (after && idx === listLen(tree) - 1 && rightSize === 0 && middleSize >= leftSize) {
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size + 1,
-            depth: tree.depth,
-            left: tree.left,
-            middle: tree.middle,
-            right: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-        };
-        return result;
-    }
-    if (!after && idx === 0 && rightSize === 0 && middleSize >= rightSize) {
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size + 1,
-            depth: tree.depth,
-            left: { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item },
-            middle: tree.left,
-            right: tree.middle,
-        };
-        return result;
-    }
-    if (idx <= leftSize - 1) {
-        let changedBranch = insert(tree.left, idx, item, after);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size + 1,
-            depth: decideParentDepth(changedBranch, tree.middle, tree.right),
-            left: changedBranch,
-            middle: tree.middle,
-            right: tree.right,
-        };
-        return result;
-    }
-    else if (idx <= leftSize + middleSize - 1) {
-        let changedBranch = insert(tree.middle, idx - leftSize, item, after);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size + 1,
-            depth: decideParentDepth(tree.left, changedBranch, tree.right),
-            left: tree.left,
-            middle: changedBranch,
-            right: tree.right,
-        };
-        return result;
-    }
-    else {
-        let changedBranch = insert(tree.right, idx - leftSize - middleSize, item, after);
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            size: tree.size + 1,
-            depth: decideParentDepth(tree.left, tree.middle, changedBranch),
-            left: tree.left,
-            middle: tree.middle,
-            right: changedBranch,
-        };
-        return result;
-    }
-}
-function assocBefore(tree, idx, item, after = false) {
-    return insert(tree, idx, item, false);
-}
-function assocAfter(tree, idx, item, after = false) {
-    return insert(tree, idx, item, true);
-}
-// this function mutates original tree to make it more balanced
-function forceListInplaceBalancing(tree) {
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch) {
-        // echo "Force inplace balancing case list: ", tree.size
-        let ys = toLeavesArray(tree);
-        let newTree = makeTernaryTreeList(ys.length, 0, ys);
-        // let newTree = initTernaryTreeList(ys)
-        tree.left = newTree.left;
-        tree.middle = newTree.middle;
-        tree.right = newTree.right;
-        tree.depth = decideParentDepth(tree.left, tree.middle, tree.right);
-    }
-    else {
-        //
-    }
-}
-// TODO, need better strategy for detecting
-function maybeReblance(tree) {
-    let currentDepth = getDepth(tree);
-    if (currentDepth > 50) {
-        if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.roughIntPow)(3, currentDepth - 50) > tree.size) {
-            forceListInplaceBalancing(tree);
-        }
-    }
-}
-function prepend(tree, item, disableBalancing = false) {
-    if (tree == null || listLen(tree) === 0) {
-        return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item };
-    }
-    let result = insert(tree, 0, item, false);
-    if (!disableBalancing) {
-        maybeReblance(result);
-    }
-    return result;
-}
-function append(tree, item, disableBalancing = false) {
-    if (tree == null || listLen(tree) === 0) {
-        return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, size: 1, value: item };
-    }
-    let result = insert(tree, listLen(tree) - 1, item, true);
-    if (!disableBalancing) {
-        maybeReblance(result);
-    }
-    return result;
-}
-function concat(...xsGroups) {
-    xsGroups = xsGroups.filter((xs) => listLen(xs) > 0);
-    let result = makeTernaryTreeList(xsGroups.length, 0, xsGroups);
-    maybeReblance(result);
-    return result;
-}
-function sameListShape(xs, ys) {
-    if (xs == null) {
-        if (ys == null) {
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    if (ys == null) {
-        return false;
-    }
-    if (listLen(xs) !== listLen(ys)) {
-        return false;
-    }
-    if (xs.kind !== ys.kind) {
-        return false;
-    }
-    if (xs.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf && ys.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (!(0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(xs.value, ys.value)) {
-            return false;
-        }
-        else {
-            return true;
-        }
-    }
-    if (xs.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch && ys.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch) {
-        if (!sameListShape(xs.left, ys.left))
-            return false;
-        if (!sameListShape(xs.middle, ys.middle))
-            return false;
-        if (!sameListShape(xs.right, ys.right))
-            return false;
-        return true;
-    }
-    return false;
-}
-function listEqual(xs, ys) {
-    if (xs === ys) {
-        return true;
-    }
-    if (listLen(xs) !== listLen(ys)) {
-        return false;
-    }
-    for (let idx = 0; idx < listLen(xs); idx++) {
-        if (!(0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(listGet(xs, idx), listGet(ys, idx))) {
-            return false;
-        }
-    }
-    return true;
-}
-function checkListStructure(tree) {
-    if (tree == null) {
-        return true;
-    }
-    else {
-        switch (tree.kind) {
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-                if (tree.size !== 1) {
-                    throw new Error(`Bad size at node ${formatListInline(tree)}`);
-                }
-                break;
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-                if (tree.size !== listLen(tree.left) + listLen(tree.middle) + listLen(tree.right)) {
-                    throw new Error(`Bad size at branch ${formatListInline(tree)}`);
-                }
-                if (tree.depth !== decideParentDepth(tree.left, tree.middle, tree.right)) {
-                    let x = decideParentDepth(tree.left, tree.middle, tree.right);
-                    throw new Error(`Bad depth at branch ${formatListInline(tree)}`);
-                }
-                checkListStructure(tree.left);
-                checkListStructure(tree.middle);
-                checkListStructure(tree.right);
-                break;
-            }
-        }
-        return true;
-    }
-}
-// excludes value at endIdx, kept aligned with JS & Clojure
-function slice(tree, startIdx, endIdx) {
-    // echo "slice {tree.formatListInline}: {startIdx}..{endIdx}"
-    if (endIdx > listLen(tree)) {
-        throw new Error("Slice range too large {endIdx} for {tree}");
-    }
-    if (startIdx < 0) {
-        throw new Error("Slice range too small {startIdx} for {tree}");
-    }
-    if (startIdx > endIdx) {
-        throw new Error("Invalid slice range {startIdx}..{endIdx} for {tree}");
-    }
-    if (startIdx === endIdx) {
-        return { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch, size: 0, depth: 0 };
-    }
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf)
-        if (startIdx === 0 && endIdx === 1) {
-            return tree;
-        }
-        else {
-            throw new Error(`Invalid slice range for a leaf: ${startIdx} ${endIdx}`);
-        }
-    if (startIdx === 0 && endIdx === listLen(tree)) {
-        return tree;
-    }
-    let leftSize = listLen(tree.left);
-    let middleSize = listLen(tree.middle);
-    let rightSize = listLen(tree.right);
-    // echo "sizes: {leftSize} {middleSize} {rightSize}"
-    if (startIdx >= leftSize + middleSize) {
-        return slice(tree.right, startIdx - leftSize - middleSize, endIdx - leftSize - middleSize);
-    }
-    if (startIdx >= leftSize)
-        if (endIdx <= leftSize + middleSize) {
-            return slice(tree.middle, startIdx - leftSize, endIdx - leftSize);
-        }
-        else {
-            let middleCut = slice(tree.middle, startIdx - leftSize, middleSize);
-            let rightCut = slice(tree.right, 0, endIdx - leftSize - middleSize);
-            return concat(middleCut, rightCut);
-        }
-    if (endIdx <= leftSize) {
-        return slice(tree.left, startIdx, endIdx);
-    }
-    if (endIdx <= leftSize + middleSize) {
-        let leftCut = slice(tree.left, startIdx, leftSize);
-        let middleCut = slice(tree.middle, 0, endIdx - leftSize);
-        return concat(leftCut, middleCut);
-    }
-    if (endIdx <= leftSize + middleSize + rightSize) {
-        let leftCut = slice(tree.left, startIdx, leftSize);
-        let rightCut = slice(tree.right, 0, endIdx - leftSize - middleSize);
-        return concat(concat(leftCut, tree.middle), rightCut);
-    }
-    throw new Error("Unknown");
-}
-function reverse(tree) {
-    if (tree == null) {
-        return tree;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return tree;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size,
-                depth: tree.depth,
-                left: reverse(tree.right),
-                middle: reverse(tree.middle),
-                right: reverse(tree.left),
-            };
-            return result;
-        }
-    }
-}
-function listMapValues(tree, f) {
-    if (tree == null) {
-        return tree;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                size: tree.size,
-                value: f(tree.value),
-            };
-            return result;
-        }
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                size: tree.size,
-                depth: tree.depth,
-                left: tree.left == null ? emptyBranch : listMapValues(tree.left, f),
-                middle: tree.middle == null ? emptyBranch : listMapValues(tree.middle, f),
-                right: tree.right == null ? emptyBranch : listMapValues(tree.right, f),
-            };
-            return result;
-        }
-    }
-}
-
-
-/***/ }),
-
-/***/ "./lib/map.js":
-/*!********************!*\
-  !*** ./lib/map.js ***!
-  \********************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "getMapDepth": () => (/* binding */ getMapDepth),
-/* harmony export */   "initTernaryTreeMapFromHashEntries": () => (/* binding */ initTernaryTreeMapFromHashEntries),
-/* harmony export */   "initTernaryTreeMap": () => (/* binding */ initTernaryTreeMap),
-/* harmony export */   "initEmptyTernaryTreeMap": () => (/* binding */ initEmptyTernaryTreeMap),
-/* harmony export */   "mapToString": () => (/* binding */ mapToString),
-/* harmony export */   "mapLen": () => (/* binding */ mapLen),
-/* harmony export */   "mapLenBound": () => (/* binding */ mapLenBound),
-/* harmony export */   "formatMapInline": () => (/* binding */ formatMapInline),
-/* harmony export */   "isMapEmpty": () => (/* binding */ isMapEmpty),
-/* harmony export */   "isMapOfOne": () => (/* binding */ isMapOfOne),
-/* harmony export */   "toHashSortedPairs": () => (/* binding */ toHashSortedPairs),
-/* harmony export */   "contains": () => (/* binding */ contains),
-/* harmony export */   "mapGetDefault": () => (/* binding */ mapGetDefault),
-/* harmony export */   "checkMapStructure": () => (/* binding */ checkMapStructure),
-/* harmony export */   "assocMap": () => (/* binding */ assocMap),
-/* harmony export */   "dissocMap": () => (/* binding */ dissocMap),
-/* harmony export */   "toPairsArray": () => (/* binding */ toPairsArray),
-/* harmony export */   "toPairs": () => (/* binding */ toPairs),
-/* harmony export */   "toKeys": () => (/* binding */ toKeys),
-/* harmony export */   "toValues": () => (/* binding */ toValues),
-/* harmony export */   "mapEqual": () => (/* binding */ mapEqual),
-/* harmony export */   "merge": () => (/* binding */ merge),
-/* harmony export */   "mergeSkip": () => (/* binding */ mergeSkip),
-/* harmony export */   "forceMapInplaceBalancing": () => (/* binding */ forceMapInplaceBalancing),
-/* harmony export */   "sameMapShape": () => (/* binding */ sameMapShape),
-/* harmony export */   "mapMapValues": () => (/* binding */ mapMapValues)
-/* harmony export */ });
-/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./types */ "./lib/types.js");
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./lib/utils.js");
-
-
-let emptyBranch = null;
-let nilResult = null;
-function getMax(tree) {
-    if (tree == null) {
-        throw new Error("Cannot find max hash of nil");
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return tree.hash;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return tree.maxHash;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function getMin(tree) {
-    if (tree == null) {
-        throw new Error("Cannot find min hash of nil");
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return tree.hash;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return tree.minHash;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function getMapDepth(tree) {
-    // console.log( "calling...", tree)
-    if (tree == null) {
-        return 0;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return 1;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return Math.max(getMapDepth(tree.left), getMapDepth(tree.middle), getMapDepth(tree.right)) + 1;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function createLeaf(k, v) {
-    let result = {
-        kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-        hash: (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(k),
-        elements: [[k, v]],
-    };
-    return result;
-}
-function createLeafFromHashEntry(item) {
-    let result = {
-        kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-        hash: item.hash,
-        elements: item.pairs,
-    };
-    return result;
-}
-// this proc is not exported, pick up next proc as the entry.
-// pairs must be sorted before passing to proc.
-function makeTernaryTreeMap(size, offset, xs) {
-    switch (size) {
-        case 0: {
-            let result = emptyBranch;
-            return result;
-        }
-        case 1: {
-            let leftPair = xs[offset];
-            let result = createLeafFromHashEntry(leftPair);
-            return result;
-        }
-        case 2: {
-            let leftPair = xs[offset];
-            let middlePair = xs[offset + 1];
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: middlePair.hash,
-                minHash: leftPair.hash,
-                left: createLeafFromHashEntry(leftPair),
-                middle: createLeafFromHashEntry(middlePair),
-                right: emptyBranch,
-                depth: 1,
-            };
-            return result;
-        }
-        case 3: {
-            let leftPair = xs[offset];
-            let middlePair = xs[offset + 1];
-            let rightPair = xs[offset + 2];
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: rightPair.hash,
-                minHash: leftPair.hash,
-                left: createLeafFromHashEntry(leftPair),
-                middle: createLeafFromHashEntry(middlePair),
-                right: createLeafFromHashEntry(rightPair),
-                depth: 1,
-            };
-            return result;
-        }
-        default: {
-            let divided = (0,_utils__WEBPACK_IMPORTED_MODULE_1__.divideTernarySizes)(size);
-            let left = makeTernaryTreeMap(divided.left, offset, xs);
-            let middle = makeTernaryTreeMap(divided.middle, offset + divided.left, xs);
-            let right = makeTernaryTreeMap(divided.right, offset + divided.left + divided.middle, xs);
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: getMax(right),
-                minHash: getMin(left),
-                left: left,
-                middle: middle,
-                right: right,
-                depth: Math.max(getMapDepth(left), getMapDepth(middle), getMapDepth(right)) + 1,
-            };
-            return result;
-        }
-    }
-}
-function initTernaryTreeMapFromHashEntries(xs) {
-    return makeTernaryTreeMap(xs.length, 0, xs);
-}
-function initTernaryTreeMap(t) {
-    let groupBuffers = new Map();
-    for (let [k, v] of t) {
-        let h = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(k);
-        if (groupBuffers.has(h)) {
-            let branch = groupBuffers.get(h);
-            if (branch != null) {
-                branch.push([k, v]);
-            }
-            else {
-                throw new Error("Expected referece to pairs");
-            }
-        }
-        else {
-            groupBuffers.set(h, [[k, v]]);
-        }
-    }
-    let xs = [];
-    for (let [k, v] of groupBuffers) {
-        if (v != null) {
-            xs.push({
-                hash: k,
-                pairs: v,
-            });
-        }
-        else {
-            throw new Error("Expected reference to paris");
-        }
-    }
-    // MUTABLE in-place sort
-    xs.sort((a, b) => (0,_utils__WEBPACK_IMPORTED_MODULE_1__.cmp)(a.hash, b.hash));
-    let result = initTernaryTreeMapFromHashEntries(xs);
-    // checkMapStructure(result);
-    return result;
-}
-// for empty map
-function initEmptyTernaryTreeMap() {
-    let result = emptyBranch;
-    return result;
-}
-function mapToString(tree) {
-    return `TernaryTreeMap[${mapLen(tree)}, ...]`;
-}
-function mapLen(tree) {
-    if (tree == null) {
-        return 0;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return tree.elements.length;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return mapLen(tree.left) + mapLen(tree.middle) + mapLen(tree.right); // TODO
-        default:
-            throw new Error("Unknown");
-    }
-}
-// when size succeeds bound, no longer counting, faster than traversing whole tree
-function mapLenBound(tree, bound) {
-    if (tree == null) {
-        return 0;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return tree.elements.length;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            let ret = mapLenBound(tree.left, bound);
-            if (ret > bound) {
-                return ret;
-            }
-            ret = ret + mapLenBound(tree.middle, bound);
-            if (ret > bound) {
-                return ret;
-            }
-            ret = ret + mapLenBound(tree.right, bound);
-            return ret;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function formatMapInline(tree, withHash = false) {
-    if (tree == null) {
-        return "_";
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            if (withHash) {
-                return `${tree.hash}->${tree.elements[0][0]}:${tree.elements[0][1]}`; // TODO show whole list
-            }
-            else {
-                return `${tree.elements[0][0]}:${tree.elements[0][1]}`;
-            }
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-            return "(" + formatMapInline(tree.left, withHash) + " " + formatMapInline(tree.middle, withHash) + " " + formatMapInline(tree.right, withHash) + ")";
-        }
-        default:
-            throw new Error("Unknown");
-    }
-}
-function isMapEmpty(tree) {
-    if (tree == null) {
-        return true;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return false;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return tree.left == null && tree.middle == null && tree.right == null;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function isMapOfOne(tree, counted = 0) {
-    if (tree == null) {
-        return true;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf:
-            return false;
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch:
-            return tree.left == null && tree.middle == null && tree.right == null;
-        default:
-            throw new Error("Unknown");
-    }
-}
-function collectHashSortedArray(tree, acc, idx) {
-    if (tree == null || isMapEmpty(tree)) {
-        // discard
-    }
-    else {
-        switch (tree.kind) {
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-                for (let i = 0; i < tree.elements.length; i++) {
-                    let item = tree.elements[i];
-                    acc[idx.value] = item;
-                    idx.value = idx.value + 1;
-                }
-                break;
-            }
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-                collectHashSortedArray(tree.left, acc, idx);
-                collectHashSortedArray(tree.middle, acc, idx);
-                collectHashSortedArray(tree.right, acc, idx);
-                break;
-            }
-            default:
-                throw new Error("Unknown");
-        }
-    }
-}
-// sorted by hash(tree.key)
-function toHashSortedPairs(tree) {
-    let acc = new Array(mapLen(tree));
-    let idx = { value: 0 };
-    collectHashSortedArray(tree, acc, idx);
-    return acc;
-}
-function collectOrderedHashEntries(tree, acc, idx) {
-    if (tree == null || isMapEmpty(tree)) {
-        // discard
-    }
-    else {
-        switch (tree.kind) {
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-                acc[idx.value] = { hash: tree.hash, pairs: tree.elements };
-                idx.value = idx.value + 1;
-                break;
-            }
-            case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-                collectOrderedHashEntries(tree.left, acc, idx);
-                collectOrderedHashEntries(tree.middle, acc, idx);
-                collectOrderedHashEntries(tree.right, acc, idx);
-                break;
-            }
-            default: {
-                throw new Error("Unknown");
-            }
-        }
-    }
-}
-// for reusing leaves during rebalancing
-function toOrderedHashEntries(tree) {
-    let acc = new Array(mapLen(tree));
-    let idx = { value: 0 };
-    collectOrderedHashEntries(tree, acc, idx);
-    return acc;
-}
-function contains(originalTree, item) {
-    if (originalTree == null) {
-        return false;
-    }
-    // TODO
-    // reduce redundant computation by reusing hash result
-    let hx = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(item);
-    let tree = originalTree;
-    whileLoop: while (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx === tree.hash) {
-                let size = tree.elements.length;
-                for (let idx = 0; idx < size; idx++) {
-                    let pair = tree.elements[idx];
-                    if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(pair[0], item)) {
-                        return true;
-                    }
-                }
-            }
-            return false;
-        }
-        // echo "looking for: ", hx, " ", item, " in ", tree.formatInline(true)
-        if (tree.left == null) {
-            return false;
-        }
-        if (tree.left.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.left.hash) {
-                return false;
-            }
-            if (tree.left.hash === hx) {
-                tree = tree.left;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.left.minHash) {
-                return false;
-            }
-            if (hx <= tree.left.maxHash) {
-                tree = tree.left;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        if (tree.middle == null) {
-            return false;
-        }
-        if (tree.middle.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.middle.hash) {
-                return false;
-            }
-            if (tree.middle.hash === hx) {
-                tree = tree.middle;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.middle.minHash) {
-                return false;
-            }
-            if (hx <= tree.middle.maxHash) {
-                tree = tree.middle;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        if (tree.right == null) {
-            return false;
-        }
-        if (tree.right.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.right.hash) {
-                return false;
-            }
-            if (tree.right.hash === hx) {
-                tree = tree.right;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.right.minHash) {
-                return false;
-            }
-            if (hx <= tree.right.maxHash) {
-                tree = tree.right;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        return false;
-    }
-    return false;
-}
-function mapGetDefault(originalTree, item, v0) {
-    let hx = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(item);
-    let tree = originalTree;
-    whileLoop: while (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            let size = tree.elements.length;
-            for (let i = 0; i < size; i++) {
-                let pair = tree.elements[i];
-                if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(pair[0], item)) {
-                    return pair[1];
-                }
-            }
-            return v0;
-        }
-        // echo "looking for: ", hx, " ", item, " in ", tree.formatInline
-        if (tree.left == null) {
-            return v0;
-        }
-        if (tree.left.kind == _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.left.hash) {
-                return v0;
-            }
-            if (tree.left.hash === hx) {
-                tree = tree.left;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.left.minHash) {
-                return v0;
-            }
-            if (hx <= tree.left.maxHash) {
-                tree = tree.left;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        if (tree.middle == null) {
-            return v0;
-        }
-        if (tree.middle.kind == _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.middle.hash) {
-                return v0;
-            }
-            if (tree.middle.hash === hx) {
-                tree = tree.middle;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.middle.minHash) {
-                return v0;
-            }
-            if (hx <= tree.middle.maxHash) {
-                tree = tree.middle;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        if (tree.right == null) {
-            return v0;
-        }
-        if (tree.right.kind == _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            if (hx < tree.right.hash) {
-                return v0;
-            }
-            if (tree.right.hash === hx) {
-                tree = tree.right;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        else {
-            if (hx < tree.right.minHash) {
-                return v0;
-            }
-            if (hx <= tree.right.maxHash) {
-                tree = tree.right;
-                continue whileLoop; // notice, it jumps to while loop
-            }
-        }
-        return v0;
-    }
-    return v0;
-}
-// leaves on the left has smaller hashes
-// TODO check sizes, hashes
-function checkMapStructure(tree) {
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        for (let i = 0; i < tree.elements.length; i++) {
-            let pair = tree.elements[i];
-            if (pair.length !== 2) {
-                throw new Error("Expected pair to br [k,v] :" + pair);
-            }
-            if (tree.hash !== (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(pair[0])) {
-                throw new Error(`Bad hash at leaf node ${tree}`);
-            }
-        }
-        if (mapLenBound(tree, 2) !== 1) {
-            throw new Error(`Bad len at leaf node ${tree}`);
-        }
-    }
-    else {
-        if (tree.left == null) {
-            if (tree.middle != null) {
-                throw new Error("Layout is not compact");
-            }
-            if (tree.middle != null) {
-                throw new Error("Layout is not compact");
-            }
-        }
-        if (tree.middle == null) {
-            if (tree.right != null) {
-                throw new Error("Layout is not compact");
-            }
-        }
-        if (tree.left != null && tree.middle != null) {
-            if (getMax(tree.left) >= getMin(tree.middle)) {
-                throw new Error(`Wrong hash order at left/middle branches ${formatMapInline(tree, true)}`);
-            }
-        }
-        if (tree.left != null && tree.right != null) {
-            if (getMax(tree.left) >= getMin(tree.right)) {
-                console.log(getMax(tree.left), getMin(tree.right));
-                throw new Error(`Wrong hash order at left/right branches ${formatMapInline(tree, true)}`);
-            }
-        }
-        if (tree.middle != null && tree.right != null) {
-            if (getMax(tree.middle) >= getMin(tree.right)) {
-                throw new Error(`Wrong hash order at middle/right branches ${formatMapInline(tree, true)}`);
-            }
-        }
-        if (tree.left != null) {
-            checkMapStructure(tree.left);
-        }
-        if (tree.middle != null) {
-            checkMapStructure(tree.middle);
-        }
-        if (tree.right != null) {
-            checkMapStructure(tree.right);
-        }
-    }
-    return true;
-}
-function rangeContainsHash(tree, thisHash) {
-    if (tree == null) {
-        return false;
-    }
-    else if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        return tree.hash === thisHash;
-    }
-    else {
-        return thisHash >= tree.minHash && thisHash <= tree.maxHash;
-    }
-}
-function assocExisted(tree, key, item, thisHash = null) {
-    if (tree == null || isMapEmpty(tree)) {
-        throw new Error("Cannot call assoc on nil");
-    }
-    thisHash = thisHash !== null && thisHash !== void 0 ? thisHash : (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(key);
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (tree.hash !== thisHash) {
-            throw new Error("Expected hashes to be identical, otherwise element is missing");
-        }
-        let newPairs = new Array(tree.elements.length);
-        let replaced = false;
-        let size = tree.elements.length;
-        for (let idx = 0; idx < size; idx++) {
-            let pair = tree.elements[idx];
-            if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(pair[0], key)) {
-                newPairs[idx] = [key, item];
-                replaced = true;
-            }
-            else {
-                newPairs[idx] = pair;
-            }
-        }
-        if (replaced) {
-            let result = { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, hash: thisHash, elements: newPairs };
-            return result;
-        }
-        else {
-            throw new Error("Unexpected missing hash in assoc, invalid branch");
-        }
-    }
-    if (thisHash < tree.minHash)
-        throw new Error("Unexpected missing hash in assoc, hash too small");
-    else if (thisHash > tree.maxHash)
-        throw new Error("Unexpected missing hash in assoc, hash too large");
-    if (tree.left == null) {
-        throw new Error("Unexpected missing hash in assoc, found not branch");
-    }
-    if (rangeContainsHash(tree.left, thisHash)) {
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            maxHash: tree.maxHash,
-            minHash: tree.minHash,
-            left: assocExisted(tree.left, key, item, thisHash),
-            middle: tree.middle,
-            right: tree.right,
-            depth: 0, // TODO
-        };
-        return result;
-    }
-    if (tree.middle == null) {
-        throw new Error("Unexpected missing hash in assoc, found not branch");
-    }
-    if (rangeContainsHash(tree.middle, thisHash)) {
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            maxHash: tree.maxHash,
-            minHash: tree.minHash,
-            left: tree.left,
-            middle: assocExisted(tree.middle, key, item, thisHash),
-            right: tree.right,
-            depth: 0, // TODO
-        };
-        return result;
-    }
-    if (tree.right == null) {
-        throw new Error("Unexpected missing hash in assoc, found not branch");
-    }
-    if (rangeContainsHash(tree.right, thisHash)) {
-        let result = {
-            kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-            maxHash: tree.maxHash,
-            minHash: tree.minHash,
-            left: tree.left,
-            middle: tree.middle,
-            right: assocExisted(tree.right, key, item, thisHash),
-            depth: 0, // TODO
-        };
-        return result;
-    }
-    throw new Error("Unexpected missing hash in assoc, found not branch");
-}
-function assocNew(tree, key, item, thisHash = null) {
-    // echo fmt"assoc new: {key} to {tree.formatInline}"
-    if (tree == null || isMapEmpty(tree)) {
-        return createLeaf(key, item);
-    }
-    thisHash = thisHash !== null && thisHash !== void 0 ? thisHash : (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(key);
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (thisHash > tree.hash) {
-            let childBranch = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                hash: thisHash,
-                elements: [[key, item]],
-            };
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: thisHash,
-                minHash: tree.hash,
-                left: tree,
-                middle: childBranch,
-                right: emptyBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else if (thisHash < tree.hash) {
-            let childBranch = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                hash: thisHash,
-                elements: [[key, item]],
-            };
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.hash,
-                minHash: thisHash,
-                left: childBranch,
-                middle: tree,
-                right: emptyBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else {
-            let size = tree.elements.length;
-            for (let i = 0; i < size; i++) {
-                let pair = tree.elements[i];
-                if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(pair[0], key)) {
-                    throw new Error("Unexpected existed key in assoc");
-                }
-            }
-            let newPairs = new Array(tree.elements.length + 1);
-            for (let idx = 0; idx < size; idx++) {
-                let pair = tree.elements[idx];
-                newPairs[idx] = pair;
-            }
-            newPairs[tree.elements.length] = [key, item];
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                hash: tree.hash,
-                elements: newPairs,
-            };
-            return result;
-        }
-    }
-    else {
-        if (thisHash < tree.minHash) {
-            if (tree.right == null) {
-                let childBranch = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                    hash: thisHash,
-                    elements: [[key, item]],
-                };
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    maxHash: tree.maxHash,
-                    minHash: thisHash,
-                    left: childBranch,
-                    middle: tree.left,
-                    right: tree.middle,
-                    depth: 0, // TODO
-                };
-                return result;
-            }
-            else {
-                let childBranch = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                    hash: thisHash,
-                    elements: [[key, item]],
-                };
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    maxHash: tree.maxHash,
-                    minHash: thisHash,
-                    left: childBranch,
-                    middle: tree,
-                    right: emptyBranch,
-                    depth: 0, // TODO
-                };
-                return result;
-            }
-        }
-        if (thisHash > tree.maxHash) {
-            // in compact layout, left arm must be existed
-            if (tree.middle == null) {
-                let childBranch = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                    hash: thisHash,
-                    elements: [[key, item]],
-                };
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    maxHash: thisHash,
-                    minHash: tree.minHash,
-                    left: tree.left,
-                    middle: childBranch,
-                    right: emptyBranch,
-                    depth: 0, // TODO
-                };
-                return result;
-            }
-            else if (tree.right == null) {
-                let childBranch = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                    hash: thisHash,
-                    elements: [[key, item]],
-                };
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    maxHash: thisHash,
-                    minHash: tree.minHash,
-                    left: tree.left,
-                    middle: tree.middle,
-                    right: childBranch,
-                    depth: 0, // TODO
-                };
-                return result;
-            }
-            else {
-                let childBranch = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                    hash: thisHash,
-                    elements: [[key, item]],
-                };
-                let result = {
-                    kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                    maxHash: thisHash,
-                    minHash: tree.minHash,
-                    left: tree,
-                    middle: childBranch,
-                    right: emptyBranch,
-                    depth: 0, // TODO
-                };
-                return result;
-            }
-        }
-        if (rangeContainsHash(tree.left, thisHash)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: assocNew(tree.left, key, item, thisHash),
-                middle: tree.middle,
-                right: tree.right,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        if (rangeContainsHash(tree.middle, thisHash)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: assocNew(tree.middle, key, item, thisHash),
-                right: tree.right,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        if (rangeContainsHash(tree.right, thisHash)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: tree.middle,
-                right: assocNew(tree.right, key, item, thisHash),
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        if (tree.middle == null) {
-            throw new Error("unreachable. if inside range, then middle should be here");
-        }
-        if (thisHash < getMin(tree.middle)) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: assocNew(tree.left, key, item, thisHash),
-                middle: tree.middle,
-                right: tree.right,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: tree.middle,
-                right: assocNew(tree.right, key, item, thisHash),
-                depth: 0, // TODO
-            };
-            return result;
-        }
-    }
-}
-function assocMap(tree, key, item, disableBalancing = false) {
-    if (tree == null || isMapEmpty(tree)) {
-        return createLeaf(key, item);
-    }
-    if (contains(tree, key)) {
-        return assocExisted(tree, key, item);
-    }
-    else {
-        return assocNew(tree, key, item);
-    }
-}
-function dissocExisted(tree, key) {
-    if (tree == null) {
-        throw new Error("Unexpected missing key in dissoc");
-    }
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (tree.hash === (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(key)) {
-            let size = tree.elements.length;
-            if (size === 1 && (0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(key, tree.elements[0][0])) {
-                return emptyBranch;
-            }
-            else {
-                let newPairs = [];
-                for (let i = 0; i < size; i++) {
-                    let pair = tree.elements[i];
-                    if (!(0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(pair[0], key)) {
-                        newPairs.push(pair);
-                    }
-                }
-                let result = { kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf, hash: tree.hash, elements: newPairs };
-                return result;
-            }
-        }
-        else {
-            throw new Error("Unexpected missing key in dissoc on leaf");
-        }
-    }
-    if (mapLenBound(tree, 2) === 1) {
-        if (!contains(tree, key)) {
-            throw new Error("Unexpected missing key in dissoc single branch");
-        }
-        return emptyBranch;
-    }
-    let thisHash = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(key);
-    if (rangeContainsHash(tree.left, thisHash)) {
-        let changedBranch = dissocExisted(tree.left, key);
-        if (isMapEmpty(changedBranch)) {
-            if (isMapEmpty(tree.right)) {
-                return tree.middle;
-            }
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: getMin(tree.middle),
-                left: tree.middle,
-                middle: tree.right,
-                right: emptyBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: getMin(changedBranch),
-                left: changedBranch,
-                middle: tree.middle,
-                right: tree.right,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-    }
-    if (rangeContainsHash(tree.middle, thisHash)) {
-        let changedBranch = dissocExisted(tree.middle, key);
-        if (isMapEmpty(changedBranch)) {
-            if (isMapEmpty(tree.right)) {
-                return tree.left;
-            }
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: tree.right,
-                right: emptyBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: tree.maxHash,
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: changedBranch,
-                right: tree.right,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-    }
-    if (rangeContainsHash(tree.right, thisHash)) {
-        let changedBranch = dissocExisted(tree.right, key);
-        if (changedBranch == null) {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: getMax(tree.middle),
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: tree.middle,
-                right: emptyBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-        else {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                maxHash: getMax(changedBranch),
-                minHash: tree.minHash,
-                left: tree.left,
-                middle: tree.middle,
-                right: changedBranch,
-                depth: 0, // TODO
-            };
-            return result;
-        }
-    }
-    throw new Error("Cannot find branch in dissoc");
-}
-function dissocMap(tree, key) {
-    if (contains(tree, key)) {
-        return dissocExisted(tree, key);
-    }
-    else {
-        return tree;
-    }
-}
-function collectToPairsArray(acc, tree) {
-    if (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            for (let i = 0; i < tree.elements.length; i++) {
-                let pair = tree.elements[i];
-                acc.push(pair);
-            }
-        }
-        else {
-            if (tree.left != null) {
-                collectToPairsArray(acc, tree.left);
-            }
-            if (tree.middle != null) {
-                collectToPairsArray(acc, tree.middle);
-            }
-            if (tree.right != null) {
-                collectToPairsArray(acc, tree.right);
-            }
-        }
-    }
-}
-/** similar to `toPairs`, but using Array.push directly */
-function toPairsArray(tree) {
-    let result = [];
-    collectToPairsArray(result, tree);
-    return result;
-}
-function* toPairs(tree) {
-    if (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            for (let pair of tree.elements) {
-                yield pair;
-            }
-        }
-        else {
-            if (tree.left != null) {
-                for (let item of toPairs(tree.left)) {
-                    yield item;
-                }
-            }
-            if (tree.middle != null) {
-                for (let item of toPairs(tree.middle)) {
-                    yield item;
-                }
-            }
-            if (tree.right != null) {
-                for (let item of toPairs(tree.right)) {
-                    yield item;
-                }
-            }
-        }
-    }
-}
-function* toKeys(tree) {
-    if (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            for (let i = 0; i < tree.elements.length; i++) {
-                let pair = tree.elements[i];
-                yield pair[0];
-            }
-        }
-        else {
-            if (tree.left != null) {
-                for (let item of toKeys(tree.left)) {
-                    yield item;
-                }
-            }
-            if (tree.middle != null) {
-                for (let item of toKeys(tree.middle)) {
-                    yield item;
-                }
-            }
-            if (tree.right != null) {
-                for (let item of toKeys(tree.right)) {
-                    yield item;
-                }
-            }
-        }
-    }
-}
-function* toValues(tree) {
-    if (tree != null) {
-        if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-            for (let i = 0; i < tree.elements.length; i++) {
-                let pair = tree.elements[i];
-                yield pair[1];
-            }
-        }
-        else {
-            if (tree.left != null) {
-                for (let item of toValues(tree.left)) {
-                    yield item;
-                }
-            }
-            if (tree.middle != null) {
-                for (let item of toValues(tree.middle)) {
-                    yield item;
-                }
-            }
-            if (tree.right != null) {
-                for (let item of toValues(tree.right)) {
-                    yield item;
-                }
-            }
-        }
-    }
-}
-function mapEqual(xs, ys) {
-    if (xs === ys) {
-        return true;
-    }
-    if (mapLen(xs) !== mapLen(ys)) {
-        return false;
-    }
-    if (isMapEmpty(xs)) {
-        return true;
-    }
-    for (let pair of toPairsArray(xs)) {
-        let key = pair[0];
-        let vx = pair[1];
-        if (!contains(ys, key)) {
-            return false;
-        }
-        let vy = mapGetDefault(ys, key, null);
-        // TODO compare deep structures
-        if (!(0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(vx, vy)) {
-            return false;
-        }
-    }
-    return true;
-}
-function merge(xs, ys) {
-    let ret = xs;
-    let counted = 0;
-    for (let [key, item] of toPairs(ys)) {
-        ret = assocMap(ret, key, item);
-        // # TODO pickd loop by experience
-        if (counted > 700) {
-            forceMapInplaceBalancing(ret);
-            counted = 0;
-        }
-        else {
-            counted = counted + 1;
-        }
-    }
-    return ret;
-}
-// # skip a value, mostly for nil
-function mergeSkip(xs, ys, skipped) {
-    let ret = xs;
-    let counted = 0;
-    for (let [key, item] of toPairs(ys)) {
-        if ((0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(item, skipped)) {
-            continue;
-        }
-        ret = assocMap(ret, key, item);
-        // # TODO pickd loop by experience
-        if (counted > 700) {
-            forceMapInplaceBalancing(ret);
-            counted = 0;
-        }
-        else {
-            counted = counted + 1;
-        }
-    }
-    return ret;
-}
-// this function mutates original tree to make it more balanced
-function forceMapInplaceBalancing(tree) {
-    // echo "Force inplace balancing of list"
-    if (tree.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch) {
-        let xs = toOrderedHashEntries(tree);
-        let newTree = makeTernaryTreeMap(xs.length, 0, xs);
-        tree.left = newTree.left;
-        tree.middle = newTree.middle;
-        tree.right = newTree.right;
-    }
-    else {
-        // discard
-    }
-}
-function sameMapShape(xs, ys) {
-    if (xs == null) {
-        if (ys == null) {
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    if (ys == null) {
-        return false;
-    }
-    if (mapLen(xs) !== mapLen(ys)) {
-        return false;
-    }
-    if (xs.kind !== ys.kind) {
-        return false;
-    }
-    if (xs.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf && ys.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf) {
-        if (xs.elements.length !== ys.elements.length) {
-            return false;
-        }
-        for (let idx = 0; idx < xs.elements.length; idx++) {
-            if (!(0,_utils__WEBPACK_IMPORTED_MODULE_1__.dataEqual)(xs.elements[idx], ys.elements[idx])) {
-                return false;
-            }
-        }
-        return true;
-    }
-    else if (xs.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch && ys.kind === _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch) {
-        if (!sameMapShape(xs.left, ys.left)) {
-            return false;
-        }
-        if (!sameMapShape(xs.middle, ys.middle)) {
-            return false;
-        }
-        if (!sameMapShape(xs.right, ys.right)) {
-            return false;
-        }
-        return true;
-    }
-    else {
-        throw new Error("Unknown");
-    }
-}
-function mapMapValues(tree, f) {
-    if (tree == null) {
-        return tree;
-    }
-    switch (tree.kind) {
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf: {
-            let newElements = new Array(tree.elements.length);
-            let size = tree.elements.length;
-            for (let idx = 0; idx < size; idx++) {
-                newElements[idx] = [tree.elements[idx][0], f(tree.elements[idx][1])];
-            }
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeLeaf,
-                hash: tree.hash,
-                elements: newElements,
-            };
-            return result;
-        }
-        case _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch: {
-            let result = {
-                kind: _types__WEBPACK_IMPORTED_MODULE_0__.TernaryTreeKind.ternaryTreeBranch,
-                depth: tree.depth,
-                minHash: tree.minHash,
-                maxHash: tree.maxHash,
-                left: mapMapValues(tree.left, f),
-                middle: mapMapValues(tree.middle, f),
-                right: mapMapValues(tree.right, f),
-            };
-            return result;
-        }
-    }
-}
-
-
-/***/ }),
-
-/***/ "./lib/test-list.js":
-/*!**************************!*\
-  !*** ./lib/test-list.js ***!
-  \**************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "runListTests": () => (/* binding */ runListTests)
-/* harmony export */ });
-/* harmony import */ var _list__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./list */ "./lib/list.js");
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./lib/utils.js");
-
-
-let runListTests = () => {
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("init list", () => {
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listToString)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4])) === "TernaryTreeList[4, ...]");
-        let origin11 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];
-        let data11 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin11);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)(data11));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data11), "((1 (2 3 _) 4) (5 6 7) (8 (9 10 _) 11))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.arrayEqual)(origin11, [...(0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(data11)]));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.arrayEqual)([...(0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(data11)], [...(0,_list__WEBPACK_IMPORTED_MODULE_0__.indexToItems)(data11)]));
-        let emptyXs = new Array(0);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initEmptyTernaryTreeList)(), (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(emptyXs)));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("list operations", () => {
-        let origin11 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];
-        let data11 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin11);
-        // get
-        for (let idx = 0; idx < origin11.length; idx++) {
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(origin11[idx] === (0,_list__WEBPACK_IMPORTED_MODULE_0__.listGet)(data11, idx));
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.first)(data11) === 1);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.last)(data11) === 11);
-        // assoc
-        let origin5 = [1, 2, 3, 4, 5];
-        let data5 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin5);
-        let updated = (0,_list__WEBPACK_IMPORTED_MODULE_0__.assocList)(data5, 3, 10);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listGet)(updated, 3) === 10);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listGet)(data5, 3) === 4);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)(updated) === (0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)(data5));
-        for (let idx = 0; idx < (0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)(data5); idx++) {
-            // echo data5.dissoc(idx).formatInline
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, idx)) === (0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)(data5) - 1);
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data5), "((1 2 _) 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, 0)), "(2 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, 1)), "(1 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, 2)), "((1 2 _) (4 5 _) _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, 3)), "((1 2 _) 3 5)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.dissocList)(data5, 4)), "((1 2 _) 3 4)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.rest)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1]))), "_");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.rest)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2]))), "2");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.rest)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3]))), "(2 3 _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.rest)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4]))), "((2 3 _) 4 _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.rest)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4, 5]))), "(2 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.butlast)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1]))), "_");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.butlast)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2]))), "1");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.butlast)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3]))), "(1 2 _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.butlast)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4]))), "(1 (2 3 _) _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.butlast)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4, 5]))), "((1 2 _) 3 4)");
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("list insertions", () => {
-        let origin5 = [1, 2, 3, 4, 5];
-        let data5 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin5);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data5), "((1 2 _) 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 0, 10, false)), "(10 ((1 2 _) 3 (4 5 _)) _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 0, 10, true)), "((1 10 2) 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 1, 10, false)), "((1 10 2) 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 1, 10, true)), "((1 2 10) 3 (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 2, 10, false)), "((1 2 _) (10 3 _) (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 2, 10, true)), "((1 2 _) (3 10 _) (4 5 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 3, 10, false)), "((1 2 _) 3 (10 4 5))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 3, 10, true)), "((1 2 _) 3 (4 10 5))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 4, 10, false)), "((1 2 _) 3 (4 10 5))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.insert)(data5, 4, 10, true)), "(((1 2 _) 3 (4 5 _)) 10 _)");
-        let origin4 = [1, 2, 3, 4];
-        let data4 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin4);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.assocBefore)(data4, 3, 10)), "(1 (2 3 _) (10 4 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.assocAfter)(data4, 3, 10)), "(1 (2 3 _) (4 10 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.prepend)(data4, 10)), "((10 1 _) (2 3 _) 4)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.checkEqual)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.append)(data4, 10)), "(1 (2 3 _) (4 10 _))");
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("concat", () => {
-        let data1 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2]);
-        let data2 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([3, 4]);
-        let data3 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([5, 6]);
-        let data4 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([7, 8]);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2)) === "((1 2 _) (3 4 _) _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([]), data1)) === "(1 2 _)");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2, data3)) === "((1 2 _) (3 4 _) (5 6 _))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2, data3, data4)) === "((1 2 _) ((3 4 _) (5 6 _) _) (7 8 _))");
-        (0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2));
-        (0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2, data3));
-        (0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2, data3, data4));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listLen)((0,_list__WEBPACK_IMPORTED_MODULE_0__.concat)(data1, data2, data3, data4)) === 8);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("check(equality", () => {
-        let origin4 = [1, 2, 3, 4];
-        let data4 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin4);
-        let data4n = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin4);
-        let data4Made = (0,_list__WEBPACK_IMPORTED_MODULE_0__.prepend)((0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([2, 3, 4]), 1);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.sameListShape)(data4, data4) === true);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.sameListShape)(data4, data4n) === true);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.sameListShape)(data4, data4Made) === false);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)(data4, data4n));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)(data4, data4Made));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)(data4n, data4Made));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(data4 !== data4Made); // identical false
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("force balancing", () => {
-        var data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([]);
-        for (let idx = 0; idx < 20; idx++) {
-            data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.append)(data, idx, true);
-        }
-        // echo data.formatInline
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data) === "(((0 1 2) (3 4 5) (6 7 8)) ((9 10 11) (12 13 14) (15 16 17)) (18 19 _))");
-        (0,_list__WEBPACK_IMPORTED_MODULE_0__.forceListInplaceBalancing)(data);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data) === "(((0 1 _) (2 3 4) (5 6 _)) ((7 8 _) (9 10 _) (11 12 _)) ((13 14 _) (15 16 17) (18 19 _)))");
-        // echo data.formatInline
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("iterator", () => {
-        let origin4 = [1, 2, 3, 4];
-        let data4 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin4);
-        var i = 0;
-        for (let item of (0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(data4)) {
-            i = i + 1;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 4);
-        i = 0;
-        for (let [idx, item] of (0,_list__WEBPACK_IMPORTED_MODULE_0__.listToPairs)(data4)) {
-            i = i + idx;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 6);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("check structure", () => {
-        var data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([]);
-        for (let idx = 0; idx < 20; idx++) {
-            data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.append)(data, idx, true);
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)(data));
-        let origin11 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];
-        let data11 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)(origin11);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)(data11));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("slices", () => {
-        var data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([]);
-        for (let idx = 0; idx < 40; idx++) {
-            data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.append)(data, idx, true);
-        }
-        var list40 = [];
-        for (let idx = 0; idx < 40; idx++) {
-            list40.push(idx);
-        }
-        for (let i = 0; i < 40; i++) {
-            for (let j = i; j < 40; j++) {
-                (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.arrayEqual)([...(0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)((0,_list__WEBPACK_IMPORTED_MODULE_0__.slice)(data, i, j))], list40.slice(i, j)));
-            }
-        }
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("reverse", () => {
-        let data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
-        let reversedData = (0,_list__WEBPACK_IMPORTED_MODULE_0__.reverse)(data);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.arrayEqual)([...(0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(data)].reverse(), [...(0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(reversedData)]));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)(reversedData));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("list traverse", () => {
-        var i = 0;
-        let data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
-        for (let x of (0,_list__WEBPACK_IMPORTED_MODULE_0__.listToItems)(data)) {
-            i = i + 1;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 10);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("index of", () => {
-        let data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4, 5, 6, 7, 8]);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.indexOf)(data, 2) === 1);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.findIndex)(data, (x) => x === 2) === 1);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.indexOf)(data, 9) === -1);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.findIndex)(data, (x) => x === 9) === -1);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("map values", () => {
-        let data = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 2, 3, 4]);
-        let data2 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([1, 4, 9, 16]);
-        let data3 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.listMapValues)(data, (x) => x * x);
-        (0,_list__WEBPACK_IMPORTED_MODULE_0__.checkListStructure)(data3);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)(data2, data3));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data2) === (0,_list__WEBPACK_IMPORTED_MODULE_0__.formatListInline)(data3));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("concat", () => {
-        let data1 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeList)([3, 4]);
-        let data2 = (0,_list__WEBPACK_IMPORTED_MODULE_0__.initTernaryTreeListFromRange)([1, 2, 3, 4, 5, 6], 2, 4);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_list__WEBPACK_IMPORTED_MODULE_0__.listEqual)(data1, data2));
-    });
-};
-
-
-/***/ }),
-
-/***/ "./lib/test-map.js":
-/*!*************************!*\
-  !*** ./lib/test-map.js ***!
-  \*************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "runMapTests": () => (/* binding */ runMapTests)
-/* harmony export */ });
-/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./types */ "./lib/types.js");
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./lib/utils.js");
-/* harmony import */ var _map__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./map */ "./lib/map.js");
-
-
-
-let runMapTests = () => {
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("init map", () => {
-        var dict = new Map();
-        var inList = [];
-        for (let idx = 0; idx < 10; idx++) {
-            dict.set(`${idx}`, idx + 10);
-            inList.push([`${idx}`, idx + 10]);
-        }
-        // TODO
-        inList.sort((x, y) => {
-            let hx = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(x[0]);
-            let hy = (0,_types__WEBPACK_IMPORTED_MODULE_0__.hashGenerator)(y[0]);
-            return (0,_utils__WEBPACK_IMPORTED_MODULE_1__.cmp)(hx, hy);
-        });
-        let data10 = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        let data11 = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(inList);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data10);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data11);
-        // echo data10
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.justDisplay)((0,_map__WEBPACK_IMPORTED_MODULE_2__.formatMapInline)(data10, true), " ((0:10 1:11 2:12) (3:13 (4:14 5:15 _) 6:16) (7:17 8:18 9:19))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.toHashSortedPairs)(data10), inList));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.toHashSortedPairs)(data11), inList));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data10, "1") === true);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data10, "11") === false);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(data10, "1", null), 11));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(data10, "111", 0), 0));
-        // check(deepEqual(mapGetDefault(data10, "11", {} as any), null)); // should throws error
-        let emptyData = new Map();
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.initEmptyTernaryTreeMap)(), (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(emptyData)));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("assoc and contains", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 100; idx++) {
-            dict.set(`${idx * 2}`, idx);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        for (let idx = 0; idx < 100; idx++) {
-            dict.set(`${idx * 2 + 1}`, idx);
-            let data2 = (0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(data, `${idx * 2 + 1}`, idx);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data2, `${idx * 2 + 1}`));
-        }
-        var dict = new Map();
-        data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        for (let idx = 0; idx < 1000; idx++) {
-            let p = 100 - idx / 10;
-            data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(data, `${p}`, idx);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data, `${p}`));
-        }
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("check structure", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 100; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("assoc map", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 10; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        // echo data.formatInline
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data, "1") === true);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data, "12") === false);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.justDisplay)((0,_map__WEBPACK_IMPORTED_MODULE_2__.formatMapInline)((0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(data, "1", 2222), true), "((0:10 1:2222 2:12) (3:13 (4:14 5:15 _) 6:16) (7:17 8:18 9:19))");
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.justDisplay)((0,_map__WEBPACK_IMPORTED_MODULE_2__.formatMapInline)((0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(data, "23", 2222), true), "(((0:10 1:11 2:12) (3:13 (4:14 5:15 _) 6:16) (7:17 8:18 9:19)) 23:2222 _)");
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("dissoc", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 10; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        // echo data.formatInline
-        for (let idx = 0; idx < 10; idx++) {
-            let v = (0,_map__WEBPACK_IMPORTED_MODULE_2__.dissocMap)(data, `${idx}`);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(v, `${idx}`) === false);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(data, `${idx}`) === true);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapLen)(v) === (0,_map__WEBPACK_IMPORTED_MODULE_2__.mapLen)(data) - 1);
-        }
-        for (let idx = 10; idx < 12; idx++) {
-            let v = (0,_map__WEBPACK_IMPORTED_MODULE_2__.dissocMap)(data, `${idx}`);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.contains)(v, `${idx}`) === false);
-            (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapLen)(v) === (0,_map__WEBPACK_IMPORTED_MODULE_2__.mapLen)(data));
-        }
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("to array", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 10; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        // TODO
-        // justDisplay((mapToString(toPairs(data))) , "@[2:12, 3:13, 7:17, 9:19, 6:16, 5:15, 1:11, 8:18, 0:10, 4:14]")
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.justDisplay)([...(0,_map__WEBPACK_IMPORTED_MODULE_2__.toKeys)(data)], ["2", "3", "7", "9", "6", "5", "1", "8", "0", "4"]);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.toPairsArray)(data), [...(0,_map__WEBPACK_IMPORTED_MODULE_2__.toPairs)(data)]));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("Equality", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 10; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        let b = (0,_map__WEBPACK_IMPORTED_MODULE_2__.dissocMap)(data, "3");
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(b);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)(data, data));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(!(0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)(data, b));
-        let c = (0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(data, "3", 15);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.sameMapShape)(data, data));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.sameMapShape)(data, b) === false);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.sameMapShape)(data, c) === false);
-        let d = (0,_map__WEBPACK_IMPORTED_MODULE_2__.assocMap)(c, "3", 13);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)(data, d));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(data !== d); // not identical
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("Merge", () => {
-        var dict = new Map();
-        var dictBoth = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict.set(`${idx}`, idx + 10);
-            dictBoth.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        var dictB = new Map();
-        for (let idx = 10; idx < 14; idx++) {
-            dictB.set(`${idx}`, idx + 23);
-            dictBoth.set(`${idx}`, idx + 23);
-        }
-        let b = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dictB);
-        let merged = (0,_map__WEBPACK_IMPORTED_MODULE_2__.merge)(data, b);
-        let both = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dictBoth);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)(merged, both));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("Merge skip", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let a = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(a);
-        var dict2 = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict2.set(`${idx}`, idx + 11);
-        }
-        let b = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict2);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(b);
-        let c = (0,_map__WEBPACK_IMPORTED_MODULE_2__.mergeSkip)(a, b, 11);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(c, "0", null), 10));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(c, "1", null), 12));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(c, "2", null), 13));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_utils__WEBPACK_IMPORTED_MODULE_1__.deepEqual)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapGetDefault)(c, "3", null), 14));
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("iterator", () => {
-        var dict = new Map();
-        var dictBoth = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict.set(`${idx}`, idx + 10);
-            dictBoth.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        var i = 0;
-        for (let [k, v] of (0,_map__WEBPACK_IMPORTED_MODULE_2__.toPairs)(data)) {
-            i = i + 1;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 4);
-        i = 0;
-        for (let key of (0,_map__WEBPACK_IMPORTED_MODULE_2__.toPairs)(data)) {
-            i = i + 1;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 4);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("each map", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 100; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data);
-        var i = 0;
-        for (let [k, v] of (0,_map__WEBPACK_IMPORTED_MODULE_2__.toPairs)(data)) {
-            // echo "..{k}-{v}.."
-            i = i + 1;
-        }
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)(i === 100);
-    });
-    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.test)("map values", () => {
-        var dict = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict.set(`${idx}`, idx + 10);
-        }
-        let data = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict);
-        var dict2 = new Map();
-        for (let idx = 0; idx < 4; idx++) {
-            dict2.set(`${idx}`, idx + 20);
-        }
-        let data2 = (0,_map__WEBPACK_IMPORTED_MODULE_2__.initTernaryTreeMap)(dict2);
-        let data3 = (0,_map__WEBPACK_IMPORTED_MODULE_2__.mapMapValues)(data, (x) => x + 10);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data3);
-        (0,_map__WEBPACK_IMPORTED_MODULE_2__.checkMapStructure)(data3);
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.mapEqual)(data2, data3));
-        (0,_utils__WEBPACK_IMPORTED_MODULE_1__.check)((0,_map__WEBPACK_IMPORTED_MODULE_2__.formatMapInline)(data2) === (0,_map__WEBPACK_IMPORTED_MODULE_2__.formatMapInline)(data3));
-    });
-};
-
-
-/***/ }),
-
-/***/ "./lib/types.js":
-/*!**********************!*\
-  !*** ./lib/types.js ***!
-  \**********************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "TernaryTreeKind": () => (/* binding */ TernaryTreeKind),
-/* harmony export */   "valueHash": () => (/* binding */ valueHash),
-/* harmony export */   "hashGenerator": () => (/* binding */ hashGenerator),
-/* harmony export */   "overwriteHashGenerator": () => (/* binding */ overwriteHashGenerator),
-/* harmony export */   "mergeValueHash": () => (/* binding */ mergeValueHash)
-/* harmony export */ });
-var TernaryTreeKind;
-(function (TernaryTreeKind) {
-    TernaryTreeKind[TernaryTreeKind["ternaryTreeBranch"] = 0] = "ternaryTreeBranch";
-    TernaryTreeKind[TernaryTreeKind["ternaryTreeLeaf"] = 1] = "ternaryTreeLeaf";
-})(TernaryTreeKind || (TernaryTreeKind = {}));
-let valueHash = (x) => {
-    if (typeof x === "number") {
-        // console.log("hash for x:", x, "\t", result);
-        return x;
-    }
-    else if (typeof x === "string") {
-        let h = 0;
-        // https://gist.github.com/hyamamoto/fd435505d29ebfa3d9716fd2be8d42f0#gistcomment-2775538
-        for (var i = 0; i < x.length; i++) {
-            h = Math.imul(31, h) + (x[i].charCodeAt(0) | 0);
-        }
-        // console.log("hash for x:", x, "\t", result);
-        return h;
-    }
-    throw new Error("Hash solution not provided for this type(other than number and string)");
-};
-/** default hash function only handles number and string, need customization */
-let hashGenerator = valueHash;
-/** allow customizing hash function from outside */
-let overwriteHashGenerator = (f) => {
-    hashGenerator = f;
-};
-let mergeValueHash = (base, x) => {
-    if (typeof x === "number") {
-        return Math.imul(31, base) + x;
-    }
-    else if (typeof x === "string") {
-        let h = base;
-        // https://gist.github.com/hyamamoto/fd435505d29ebfa3d9716fd2be8d42f0#gistcomment-2775538
-        for (var i = 0; i < x.length; i++) {
-            h = Math.imul(31, h) + (x[i].charCodeAt(0) | 0);
-        }
-        return h;
-    }
-    throw new Error("Hash solution not provided for this type(other than number and string)");
-};
-
-
-/***/ }),
-
-/***/ "./lib/utils.js":
-/*!**********************!*\
-  !*** ./lib/utils.js ***!
-  \**********************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "dataEqual": () => (/* binding */ dataEqual),
-/* harmony export */   "overwriteComparator": () => (/* binding */ overwriteComparator),
-/* harmony export */   "roughIntPow": () => (/* binding */ roughIntPow),
-/* harmony export */   "divideTernarySizes": () => (/* binding */ divideTernarySizes),
-/* harmony export */   "shallowCloneArray": () => (/* binding */ shallowCloneArray),
-/* harmony export */   "test": () => (/* binding */ test),
-/* harmony export */   "check": () => (/* binding */ check),
-/* harmony export */   "checkEqual": () => (/* binding */ checkEqual),
-/* harmony export */   "justDisplay": () => (/* binding */ justDisplay),
-/* harmony export */   "cmp": () => (/* binding */ cmp),
-/* harmony export */   "deepEqual": () => (/* binding */ deepEqual),
-/* harmony export */   "arrayEqual": () => (/* binding */ arrayEqual)
-/* harmony export */ });
-/** by default, it compares by reference
- * supposed to be overwritten by user
- */
-let dataEqual = (x, y) => {
-    return x === y;
-};
-let overwriteComparator = (f) => {
-    dataEqual = f;
-};
-let roughIntPow = (x, times) => {
-    if (times < 1) {
-        return x;
-    }
-    let result = 1;
-    for (let idx = 0; idx < times; idx++) {
-        result = result * x;
-    }
-    return result;
-};
-let divideTernarySizes = (size) => {
-    if (size < 0) {
-        throw new Error("Unexpected negative size");
-    }
-    let extra = size % 3;
-    let groupSize = Math.floor(size / 3);
-    var leftSize = groupSize;
-    var middleSize = groupSize;
-    var rightSize = groupSize;
-    switch (extra) {
-        case 0:
-            break;
-        case 1:
-            middleSize = middleSize + 1;
-            break;
-        case 2:
-            leftSize = leftSize + 1;
-            rightSize = rightSize + 1;
-            break;
-        default:
-            throw new Error(`Unexpected mod result ${extra}`);
-    }
-    return { left: leftSize, middle: middleSize, right: rightSize };
-};
-function shallowCloneArray(xs) {
-    let ys = new Array(xs.length);
-    for (let i = 0; i < xs.length; i++) {
-        ys[i] = xs[i];
-    }
-    return ys;
-}
-let test = (name, cb) => {
-    console.log("Test:", name);
-    cb();
-};
-let check = (x) => {
-    if (!x) {
-        throw new Error("Test failed");
-    }
-};
-/** compare by reference */
-let checkEqual = (x, y) => {
-    if (x !== y) {
-        console.log("Left:  ", x);
-        console.log("Right: ", y);
-        throw new Error("Test failed");
-    }
-};
-let justDisplay = (x, y) => {
-    console.group("Compare:");
-    console.log(x);
-    console.log(y);
-    console.groupEnd();
-};
-let cmp = (x, y) => {
-    if (x < y) {
-        return -1;
-    }
-    if (x > y) {
-        return 1;
-    }
-    return 0;
-};
-// https://stackoverflow.com/a/25456134/883571
-let deepEqual = function (x, y) {
-    if (x === y) {
-        return true;
-    }
-    else if (typeof x === "object" && x != null && typeof y === "object" && y != null) {
-        if (Object.keys(x).length != Object.keys(y).length)
-            return false;
-        for (var prop in x) {
-            if (y.hasOwnProperty(prop)) {
-                if (!deepEqual(x[prop], y[prop]))
-                    return false;
-            }
-            else
-                return false;
-        }
-        return true;
-    }
-    else
-        return false;
-};
-let arrayEqual = (xs, ys) => {
-    if (xs.length != ys.length) {
-        return false;
-    }
-    for (let idx = 0; idx < xs.length; idx++) {
-        if (xs[idx] !== ys[idx]) {
-            return false;
-        }
-    }
-    return true;
-};
-
-
-/***/ })
-
-/******/ 	});
-/************************************************************************/
-/******/ 	// The module cache
-/******/ 	var __webpack_module_cache__ = {};
-/******/ 	
-/******/ 	// The require function
-/******/ 	function __webpack_require__(moduleId) {
-/******/ 		// Check if module is in cache
-/******/ 		var cachedModule = __webpack_module_cache__[moduleId];
-/******/ 		if (cachedModule !== undefined) {
-/******/ 			return cachedModule.exports;
-/******/ 		}
-/******/ 		// Create a new module (and put it into the cache)
-/******/ 		var module = __webpack_module_cache__[moduleId] = {
-/******/ 			// no module.id needed
-/******/ 			// no module.loaded needed
-/******/ 			exports: {}
-/******/ 		};
-/******/ 	
-/******/ 		// Execute the module function
-/******/ 		__webpack_modules__[moduleId](module, module.exports, __webpack_require__);
-/******/ 	
-/******/ 		// Return the exports of the module
-/******/ 		return module.exports;
-/******/ 	}
-/******/ 	
-/************************************************************************/
-/******/ 	/* webpack/runtime/define property getters */
-/******/ 	(() => {
-/******/ 		// define getter functions for harmony exports
-/******/ 		__webpack_require__.d = (exports, definition) => {
-/******/ 			for(var key in definition) {
-/******/ 				if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {
-/******/ 					Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });
-/******/ 				}
-/******/ 			}
-/******/ 		};
-/******/ 	})();
-/******/ 	
-/******/ 	/* webpack/runtime/hasOwnProperty shorthand */
-/******/ 	(() => {
-/******/ 		__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
-/******/ 	})();
-/******/ 	
-/******/ 	/* webpack/runtime/make namespace object */
-/******/ 	(() => {
-/******/ 		// define __esModule on exports
-/******/ 		__webpack_require__.r = (exports) => {
-/******/ 			if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
-/******/ 				Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-/******/ 			}
-/******/ 			Object.defineProperty(exports, '__esModule', { value: true });
-/******/ 		};
-/******/ 	})();
-/******/ 	
-/************************************************************************/
-var __webpack_exports__ = {};
-// This entry need to be wrapped in an IIFE because it need to be isolated against other modules in the chunk.
-(() => {
-/*!*********************!*\
-  !*** ./lib/main.js ***!
-  \*********************/
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./utils */ "./lib/utils.js");
-/* harmony import */ var _test_list__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./test-list */ "./lib/test-list.js");
-/* harmony import */ var _test_map__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./test-map */ "./lib/test-map.js");
-/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./types */ "./lib/types.js");
-
-
-
-
-
-
-(0,_utils__WEBPACK_IMPORTED_MODULE_0__.overwriteComparator)((x, y) => {
-    // console.log("comparing", x, y);
-    return (0,_utils__WEBPACK_IMPORTED_MODULE_0__.deepEqual)(x, y);
-});
-(0,_types__WEBPACK_IMPORTED_MODULE_3__.overwriteHashGenerator)((x) => {
-    let ret = (0,_types__WEBPACK_IMPORTED_MODULE_3__.mergeValueHash)(10, (0,_types__WEBPACK_IMPORTED_MODULE_3__.valueHash)(x));
-    // console.log("hashing", x, ret);
-    return ret;
-});
-(0,_test_list__WEBPACK_IMPORTED_MODULE_1__.runListTests)();
-(0,_test_map__WEBPACK_IMPORTED_MODULE_2__.runMapTests)();
-
-})();
-
-/******/ })()
-;