@scrabble-solver/scrabble-solver 2.8.2 → 2.8.4

package/.next/server/chunks/206.js

@@ -8,18 +8,17 @@ exports.modules = {
 "use strict";
 
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var lib_1 = __webpack_require__(19336);
+const lib_1 = __webpack_require__(19336);
 /**
  * A class representing the {@link https://en.wikipedia.org/wiki/Trie | Trie data structure}.
  */
-var Trie = /** @class */ (function () {
+class Trie {
     /**
      * Creates a new {@link Trie} with optionally given root {@link Node}.
      *
      * @param root - Root {@link Node} of the {@link Trie} to be created.
      */
-    function Trie(root) {
-        if (root === void 0) { root = {}; }
+    constructor(root = {}) {
         this.root = root;
     }
     /**
@@ -30,45 +29,45 @@ var Trie = /** @class */ (function () {
      * @param serialized - String with serialized data.
      * @returns {@link Trie} representing deserialized data.
      */
-    Trie.deserialize = function (serialized) {
-        return new Trie(lib_1.deserialize(serialized));
-    };
+    static deserialize(serialized) {
+        return new Trie((0, lib_1.deserialize)(serialized));
+    }
     /**
      * Creates a new {@link Trie} based on array of words.
      *
      * @params words - array of words to put in the {@link Trie}.
      * @returns New {@link Trie} containing all given words.
      */
-    Trie.fromArray = function (words) {
-        return new Trie(lib_1.fromArray(words));
-    };
+    static fromArray(words) {
+        return new Trie((0, lib_1.fromArray)(words));
+    }
     /**
      * Inserts given word into the {@link Trie}.
      *
      * @param word - Word to be inserted into the {@link Trie}.
      * @returns {@link Node} representing the end of the added word.
      */
-    Trie.prototype.add = function (word) {
-        return lib_1.add(this.root, word);
-    };
+    add(word) {
+        return (0, lib_1.add)(this.root, word);
+    }
     /**
      * Finds {@link Node} representing given prefix in the {@link Trie}.
      *
      * @param prefix - Prefix to be found.
      * @returns {@link Node} representing a given prefix, undefined if there is no such node.
      */
-    Trie.prototype.find = function (prefix) {
-        return lib_1.find(this.root, prefix);
-    };
+    find(prefix) {
+        return (0, lib_1.find)(this.root, prefix);
+    }
     /**
      * Tells you whether given word is in the {@link Trie}.
      *
      * @param word - Word to be found.
      * @returns true if given word is in the {@link Trie}, false otherwise.
      */
-    Trie.prototype.has = function (word) {
-        return lib_1.has(this.root, word);
-    };
+    has(word) {
+        return (0, lib_1.has)(this.root, word);
+    }
     /**
      * Tells you whether there are any words with given prefix in the {@link Trie}.
      *
@@ -77,18 +76,18 @@ var Trie = /** @class */ (function () {
      * @param prefix - Prefix to be found.
      * @returns true if there are any words with given prefix in the {@link Trie}, false otherwise.
      */
-    Trie.prototype.hasPrefix = function (prefix) {
-        return lib_1.hasPrefix(this.root, prefix);
-    };
+    hasPrefix(prefix) {
+        return (0, lib_1.hasPrefix)(this.root, prefix);
+    }
     /**
      * Removes given word from the {@link Trie} if it exists.
      *
      * @param word - Word to be removed.
      * @returns true if the word was removed, false otherwise.
      */
-    Trie.prototype.remove = function (word) {
-        return lib_1.remove(this.root, word);
-    };
+    remove(word) {
+        return (0, lib_1.remove)(this.root, word);
+    }
     /**
      * Converts the {@link Trie} into a string.
      *
@@ -102,29 +101,28 @@ var Trie = /** @class */ (function () {
      *
      * @returns String with serialized data.
      */
-    Trie.prototype.serialize = function () {
-        return lib_1.serialize(this.root);
-    };
+    serialize() {
+        return (0, lib_1.serialize)(this.root);
+    }
     /**
      * Finds all {@link Descendant | descendants} of the {@link Trie | Trie's} root and returns them as an array.
      *
      * @param options - See {@link TraverseOptions}.
      * @returns An array of {@link Descendant | descendants}.
      */
-    Trie.prototype.toArray = function (options) {
-        return lib_1.toArray(this.root, options);
-    };
+    toArray(options) {
+        return (0, lib_1.toArray)(this.root, options);
+    }
     /**
      * Visits every descendant {@link Node} of the {@link Trie} and calls a callback.
      *
      * @param callback - Callback that will be called for each visited {@link Node}. Return true from callback to stop traversing.
      * @param options - See {@link TraverseOptions}.
      */
-    Trie.prototype.traverse = function (callback, options) {
-        return lib_1.traverse(this.root, callback, options);
-    };
-    return Trie;
-}());
+    traverse(callback, options) {
+        return (0, lib_1.traverse)(this.root, callback, options);
+    }
+}
 exports["default"] = Trie;
 
 
@@ -156,7 +154,11 @@ exports.OPEN_PARENS = '(';
 
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
 }) : (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     o[k2] = m[k];
@@ -169,7 +171,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
 exports.Trie = void 0;
-var Trie_1 = __importDefault(__webpack_require__(43210));
+const Trie_1 = __importDefault(__webpack_require__(43210));
 Object.defineProperty(exports, "Trie", ({ enumerable: true, get: function () { return Trie_1.default; } }));
 __exportStar(__webpack_require__(31430), exports);
 __exportStar(__webpack_require__(19336), exports);
@@ -191,10 +193,10 @@ Object.defineProperty(exports, "__esModule", ({ value: true }));
  * @param word - Word to be inserted into `node`.
  * @returns {@link Node} representing the end of the added word.
  */
-var add = function (node, word) {
-    var currentNode = node;
-    for (var index = 0; index < word.length; ++index) {
-        var character = word[index];
+const add = (node, word) => {
+    let currentNode = node;
+    for (let index = 0; index < word.length; ++index) {
+        const character = word[index];
         if (!currentNode[character]) {
             currentNode[character] = {};
         }
@@ -214,7 +216,7 @@ exports["default"] = add;
 "use strict";
 
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var constants_1 = __webpack_require__(31430);
+const constants_1 = __webpack_require__(31430);
 /**
  * Creates a new {@link Node} by deserializing given string.
  *
@@ -223,33 +225,33 @@ var constants_1 = __webpack_require__(31430);
  * @param serialized - String with value returned by {@link serialize}.
  * @returns Instance of a root {@link Node} of deserialized string.
  */
-var deserialize = function (serialized) {
-    var stack = [];
-    var node = {};
-    var i = 1;
+const deserialize = (serialized) => {
+    const stack = [];
+    let node = {};
+    let i = 1;
     while (i < serialized.length - 1) {
-        var character = serialized[i];
-        var nextCharacter = serialized[i + 1];
+        const character = serialized[i];
+        const nextCharacter = serialized[i + 1];
         ++i;
         if (character === constants_1.CLOSE_PARENS) {
-            var nextNode = stack.pop();
+            const nextNode = stack.pop();
             if (!nextNode) {
-                throw new Error("Syntax error: misplaced \"" + constants_1.CLOSE_PARENS + "\"");
+                throw new Error(`Syntax error: misplaced "${constants_1.CLOSE_PARENS}"`);
             }
             node = nextNode;
         }
         else if (nextCharacter === constants_1.CLOSE_PARENS) {
             node[character] = { wordEnd: true };
-            var nextNode = stack.pop();
+            const nextNode = stack.pop();
             if (!nextNode) {
-                throw new Error("Syntax error: misplaced \"" + constants_1.CLOSE_PARENS + "\"");
+                throw new Error(`Syntax error: misplaced "${constants_1.CLOSE_PARENS}"`);
             }
             node = nextNode;
             ++i;
         }
         else if (nextCharacter === constants_1.OPEN_PARENS) {
             stack.push(node);
-            var newNode = node[character] || {};
+            const newNode = node[character] || {};
             node[character] = newNode;
             node = newNode;
             ++i;
@@ -278,10 +280,10 @@ Object.defineProperty(exports, "__esModule", ({ value: true }));
  * @param prefix - Prefix to be found.
  * @returns {@link Node} representing a given prefix, undefined if there is no such node.
  */
-var find = function (node, prefix) {
-    var currentNode = node;
-    for (var index = 0; index < prefix.length; ++index) {
-        var character = prefix[index];
+const find = (node, prefix) => {
+    let currentNode = node;
+    for (let index = 0; index < prefix.length; ++index) {
+        const character = prefix[index];
         if (!currentNode[character]) {
             return undefined;
         }
@@ -303,16 +305,16 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var add_1 = __importDefault(__webpack_require__(3661));
+const add_1 = __importDefault(__webpack_require__(3661));
 /**
  * Creates a new {@link Node} based on array of words.
  *
  * @params words - array of words to put in the {@link Node}.
  * @returns New {@link Node} containing all given words.
  */
-var fromArray = function (words) {
-    var node = {};
-    words.forEach(function (word) { return add_1.default(node, word); });
+const fromArray = (words) => {
+    const node = {};
+    words.forEach((word) => (0, add_1.default)(node, word));
     return node;
 };
 exports["default"] = fromArray;
@@ -329,7 +331,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var find_1 = __importDefault(__webpack_require__(89129));
+const find_1 = __importDefault(__webpack_require__(89129));
 /**
  * Tells you whether given word is in the {@link Node}.
  *
@@ -337,8 +339,8 @@ var find_1 = __importDefault(__webpack_require__(89129));
  * @param word - Word to be found.
  * @returns true if given word is in the {@link Node}, false otherwise.
  */
-var has = function (node, word) {
-    var foundNode = find_1.default(node, word);
+const has = (node, word) => {
+    const foundNode = (0, find_1.default)(node, word);
     return Boolean(foundNode && foundNode.wordEnd);
 };
 exports["default"] = has;
@@ -355,7 +357,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var find_1 = __importDefault(__webpack_require__(89129));
+const find_1 = __importDefault(__webpack_require__(89129));
 /**
  * Tells you whether there are any words with given prefix in the {@link Node}.
  *
@@ -365,8 +367,8 @@ var find_1 = __importDefault(__webpack_require__(89129));
  * @param prefix - Prefix to be found.
  * @returns true if there are any words with given prefix in the {@link Node}, false otherwise.
  */
-var hasPrefix = function (node, prefix) {
-    var foundNode = find_1.default(node, prefix);
+const hasPrefix = (node, prefix) => {
+    const foundNode = (0, find_1.default)(node, prefix);
     return foundNode ? Object.keys(foundNode).length > 0 : false;
 };
 exports["default"] = hasPrefix;
@@ -424,7 +426,7 @@ Object.defineProperty(exports, "__esModule", ({ value: true }));
  * @param key2 - Second key to compare.
  * @returns -1 if key1 should precede key2, 0 if they're the same, 1 if key2 should precede key1.
  */
-var nodeKeyComparator = function (key1, key2) {
+const nodeKeyComparator = (key1, key2) => {
     if (key1 === 'wordEnd') {
         return -1;
     }
@@ -451,7 +453,7 @@ Object.defineProperty(exports, "__esModule", ({ value: true }));
  * @param word - Word to be removed.
  * @returns true if the word was removed, false otherwise.
  */
-var remove = function (node, word) {
+const remove = (node, word) => {
     if (word.length === 0) {
         if (node.wordEnd) {
             delete node.wordEnd;
@@ -459,12 +461,12 @@ var remove = function (node, word) {
         }
         return false;
     }
-    var letter = word[0];
-    var nextNode = node[letter];
+    const letter = word[0];
+    const nextNode = node[letter];
     if (!nextNode) {
         return false;
     }
-    var removed = remove(nextNode, word.substring(1));
+    const removed = remove(nextNode, word.substring(1));
     if (!removed) {
         return false;
     }
@@ -484,18 +486,18 @@ exports["default"] = remove;
 "use strict";
 
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var constants_1 = __webpack_require__(31430);
-var serializeNode = function (node, character) {
-    var letters = Object.keys(node).filter(function (key) { return key.length === 1; });
-    var hasPrefix = letters.length > 0;
-    var serialized = '';
+const constants_1 = __webpack_require__(31430);
+const serializeNode = (node, character) => {
+    const letters = Object.keys(node).filter((key) => key.length === 1);
+    const hasPrefix = letters.length > 0;
+    let serialized = '';
     if (node.wordEnd) {
         serialized += character;
     }
     if (hasPrefix) {
         serialized += character;
         serialized += constants_1.OPEN_PARENS;
-        serialized += letters.map(function (letter) { return serializeNode(node[letter], letter); }).join('');
+        serialized += letters.map((letter) => serializeNode(node[letter], letter)).join('');
         serialized += constants_1.CLOSE_PARENS;
     }
     return serialized;
@@ -514,7 +516,7 @@ var serializeNode = function (node, character) {
  * @param node - {@link Node} to serialize.
  * @returns String with serialized data.
  */
-var serialize = function (node) { return serializeNode(node, ''); };
+const serialize = (node) => serializeNode(node, '');
 exports["default"] = serialize;
 
 
@@ -529,7 +531,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var traverse_1 = __importDefault(__webpack_require__(6026));
+const traverse_1 = __importDefault(__webpack_require__(6026));
 /**
  * Finds all {@link Descendant | descendants} of given {@link Node} and returns them as an array.
  *
@@ -537,12 +539,12 @@ var traverse_1 = __importDefault(__webpack_require__(6026));
  * @param options - See {@link TraverseOptions}.
  * @returns An array of {@link Descendant | descendants}.
  */
-var toArray = function (node, options) {
-    var descendants = [];
-    var callback = function (parameters) {
+const toArray = (node, options) => {
+    const descendants = [];
+    const callback = (parameters) => {
         descendants.push(parameters);
     };
-    traverse_1.default(node, callback, options);
+    (0, traverse_1.default)(node, callback, options);
     return descendants;
 };
 exports["default"] = toArray;
@@ -559,7 +561,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var nodeKeyComparator_1 = __importDefault(__webpack_require__(68693));
+const nodeKeyComparator_1 = __importDefault(__webpack_require__(68693));
 /**
  * Visits every descendant {@link Node} of given {@link Node} and calls a callback.
  *
@@ -567,21 +569,20 @@ var nodeKeyComparator_1 = __importDefault(__webpack_require__(68693));
  * @param callback - Callback that will be called for each visited {@link Node}. Return true from callback to stop traversing.
  * @param options - See {@link TraverseOptions}.
  */
-var traverse = function (node, callback, options) {
-    if (options === void 0) { options = {}; }
-    var stack = [];
-    var currentKeyIndex = 0;
-    var currentNode = node;
-    var currentPrefix = options.prefix || '';
+const traverse = (node, callback, options = {}) => {
+    const stack = [];
+    let currentKeyIndex = 0;
+    let currentNode = node;
+    let currentPrefix = options.prefix || '';
     while (stack.length > 0 || currentNode) {
         while (currentNode) {
-            var keys = Object.keys(currentNode);
+            const keys = Object.keys(currentNode);
             if (currentKeyIndex >= keys.length) {
                 currentNode = undefined;
             }
             else {
-                var sortedKeys = options.sort ? keys.sort(nodeKeyComparator_1.default) : keys;
-                var key = sortedKeys[currentKeyIndex];
+                const sortedKeys = options.sort ? keys.sort(nodeKeyComparator_1.default) : keys;
+                const key = sortedKeys[currentKeyIndex];
                 if (key === 'wordEnd') {
                     ++currentKeyIndex;
                 }
@@ -591,7 +592,7 @@ var traverse = function (node, callback, options) {
                     currentNode = currentNode[key];
                     currentPrefix += key;
                     if (!options.wordsOnly || currentNode.wordEnd) {
-                        var shouldStop = callback({ node: currentNode, prefix: currentPrefix });
+                        const shouldStop = callback({ node: currentNode, prefix: currentPrefix });
                         if (shouldStop) {
                             return;
                         }
@@ -600,7 +601,7 @@ var traverse = function (node, callback, options) {
             }
         }
         if (stack.length > 0) {
-            var state = stack.pop();
+            const state = stack.pop();
             currentKeyIndex = state.keyIndex + 1;
             currentNode = state.node;
             currentPrefix = currentPrefix.slice(0, -1);