@scrabble-solver/configs 2.12.5 → 2.13.1

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/hasPrefix.js

@@ -0,0 +1,20 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const find_1 = __importDefault(require("./find"));
+/**
+ * Tells you whether there are any words with given prefix in the {@link Node}.
+ *
+ * See: https://en.wikipedia.org/wiki/String_operations#Prefixes
+ *
+ * @param node - {@link Node} to look for prefix in.
+ * @param prefix - Prefix to be found.
+ * @returns true if there are any words with given prefix in the {@link Node}, false otherwise.
+ */
+const hasPrefix = (node, prefix) => {
+    const foundNode = (0, find_1.default)(node, prefix);
+    return foundNode ? Object.keys(foundNode).length > 0 : false;
+};
+exports.default = hasPrefix;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/index.d.ts

@@ -0,0 +1,11 @@
+export { default as add } from './add';
+export { default as deserialize } from './deserialize';
+export { default as has } from './has';
+export { default as hasPrefix } from './hasPrefix';
+export { default as find } from './find';
+export { default as fromArray } from './fromArray';
+export { default as nodeKeyComparator } from './nodeKeyComparator';
+export { default as remove } from './remove';
+export { default as serialize } from './serialize';
+export { default as toArray } from './toArray';
+export { default as traverse } from './traverse';

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/index.js

@@ -0,0 +1,28 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.traverse = exports.toArray = exports.serialize = exports.remove = exports.nodeKeyComparator = exports.fromArray = exports.find = exports.hasPrefix = exports.has = exports.deserialize = exports.add = void 0;
+var add_1 = require("./add");
+Object.defineProperty(exports, "add", { enumerable: true, get: function () { return __importDefault(add_1).default; } });
+var deserialize_1 = require("./deserialize");
+Object.defineProperty(exports, "deserialize", { enumerable: true, get: function () { return __importDefault(deserialize_1).default; } });
+var has_1 = require("./has");
+Object.defineProperty(exports, "has", { enumerable: true, get: function () { return __importDefault(has_1).default; } });
+var hasPrefix_1 = require("./hasPrefix");
+Object.defineProperty(exports, "hasPrefix", { enumerable: true, get: function () { return __importDefault(hasPrefix_1).default; } });
+var find_1 = require("./find");
+Object.defineProperty(exports, "find", { enumerable: true, get: function () { return __importDefault(find_1).default; } });
+var fromArray_1 = require("./fromArray");
+Object.defineProperty(exports, "fromArray", { enumerable: true, get: function () { return __importDefault(fromArray_1).default; } });
+var nodeKeyComparator_1 = require("./nodeKeyComparator");
+Object.defineProperty(exports, "nodeKeyComparator", { enumerable: true, get: function () { return __importDefault(nodeKeyComparator_1).default; } });
+var remove_1 = require("./remove");
+Object.defineProperty(exports, "remove", { enumerable: true, get: function () { return __importDefault(remove_1).default; } });
+var serialize_1 = require("./serialize");
+Object.defineProperty(exports, "serialize", { enumerable: true, get: function () { return __importDefault(serialize_1).default; } });
+var toArray_1 = require("./toArray");
+Object.defineProperty(exports, "toArray", { enumerable: true, get: function () { return __importDefault(toArray_1).default; } });
+var traverse_1 = require("./traverse");
+Object.defineProperty(exports, "traverse", { enumerable: true, get: function () { return __importDefault(traverse_1).default; } });

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/nodeKeyComparator.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Comparator that allows sorting {@link Node} keys alphabetically
+ * with the exception of "wordEnd" which should always come first.
+ *
+ * @param key1 - First key to compare.
+ * @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.
+ */
+declare const nodeKeyComparator: (key1: string, key2: string) => number;
+export default nodeKeyComparator;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/nodeKeyComparator.js

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Comparator that allows sorting {@link Node} keys alphabetically
+ * with the exception of "wordEnd" which should always come first.
+ *
+ * @param key1 - First key to compare.
+ * @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.
+ */
+const nodeKeyComparator = (key1, key2) => {
+    if (key1 === 'wordEnd') {
+        return -1;
+    }
+    if (key2 === 'wordEnd') {
+        return 1;
+    }
+    return key1.localeCompare(key2);
+};
+exports.default = nodeKeyComparator;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/remove.d.ts

@@ -0,0 +1,10 @@
+import type { Node } from '../types';
+/**
+ * Removes given word from given {@link Node} if it exists.
+ *
+ * @param node - {@link Node} to remove word from.
+ * @param word - Word to be removed.
+ * @returns true if the word was removed, false otherwise.
+ */
+declare const remove: (node: Node, word: string) => boolean;
+export default remove;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/remove.js

@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Removes given word from given {@link Node} if it exists.
+ *
+ * @param node - {@link Node} to remove word from.
+ * @param word - Word to be removed.
+ * @returns true if the word was removed, false otherwise.
+ */
+const remove = (node, word) => {
+    if (word.length === 0) {
+        if (node.wordEnd) {
+            delete node.wordEnd;
+            return true;
+        }
+        return false;
+    }
+    const letter = word[0];
+    const nextNode = node[letter];
+    if (!nextNode) {
+        return false;
+    }
+    const removed = remove(nextNode, word.substring(1));
+    if (!removed) {
+        return false;
+    }
+    if (Object.keys(nextNode).length === 0) {
+        delete node[letter];
+    }
+    return true;
+};
+exports.default = remove;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/serialize.d.ts

@@ -0,0 +1,17 @@
+import type { Node } from '../types';
+/**
+ * Converts given {@link Node} into a string.
+ *
+ * The inverse of {@link deserialize}.
+ *
+ * It serializes {@link https://sjp.pl/slownik/growy/ | 42.8 MB Polish dictionary} down to 18.7 MB (-56%).
+ *
+ * It serializes {@link https://www.wordgamedictionary.com/twl06/download/twl06.txt | 1.9 MB English (US) dictionary} down to 1.4 MB (-30%).
+ *
+ * It serializes {@link https://www.wordgamedictionary.com/sowpods/download/sowpods.txt | 3 MB English (GB) dictionary} down to 2 MB (-32%).
+ *
+ * @param node - {@link Node} to serialize.
+ * @returns String with serialized data.
+ */
+declare const serialize: (node: Node) => string;
+export default serialize;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/serialize.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const constants_1 = require("../constants");
+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((letter) => serializeNode(node[letter], letter)).join('');
+        serialized += constants_1.CLOSE_PARENS;
+    }
+    return serialized;
+};
+/**
+ * Converts given {@link Node} into a string.
+ *
+ * The inverse of {@link deserialize}.
+ *
+ * It serializes {@link https://sjp.pl/slownik/growy/ | 42.8 MB Polish dictionary} down to 18.7 MB (-56%).
+ *
+ * It serializes {@link https://www.wordgamedictionary.com/twl06/download/twl06.txt | 1.9 MB English (US) dictionary} down to 1.4 MB (-30%).
+ *
+ * It serializes {@link https://www.wordgamedictionary.com/sowpods/download/sowpods.txt | 3 MB English (GB) dictionary} down to 2 MB (-32%).
+ *
+ * @param node - {@link Node} to serialize.
+ * @returns String with serialized data.
+ */
+const serialize = (node) => serializeNode(node, '');
+exports.default = serialize;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/toArray.d.ts

@@ -0,0 +1,10 @@
+import type { Descendant, Node, TraverseOptions } from '../types';
+/**
+ * Finds all {@link Descendant | descendants} of given {@link Node} and returns them as an array.
+ *
+ * @param node - {@link Node} to look for {@link Descendant | descendants} in.
+ * @param options - See {@link TraverseOptions}.
+ * @returns An array of {@link Descendant | descendants}.
+ */
+declare const toArray: (node: Node, options?: TraverseOptions) => Descendant[];
+export default toArray;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/toArray.js

@@ -0,0 +1,22 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const traverse_1 = __importDefault(require("./traverse"));
+/**
+ * Finds all {@link Descendant | descendants} of given {@link Node} and returns them as an array.
+ *
+ * @param node - {@link Node} to look for {@link Descendant | descendants} in.
+ * @param options - See {@link TraverseOptions}.
+ * @returns An array of {@link Descendant | descendants}.
+ */
+const toArray = (node, options) => {
+    const descendants = [];
+    const callback = (parameters) => {
+        descendants.push(parameters);
+    };
+    (0, traverse_1.default)(node, callback, options);
+    return descendants;
+};
+exports.default = toArray;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/traverse.d.ts

@@ -0,0 +1,10 @@
+import type { Node, TraverseCallback, TraverseOptions } from '../types';
+/**
+ * Visits every descendant {@link Node} of given {@link Node} and calls a callback.
+ *
+ * @param node - {@link Node} to look for descendant {@link Node | Nodes} in.
+ * @param callback - Callback that will be called for each visited {@link Node}. Return true from callback to stop traversing.
+ * @param options - See {@link TraverseOptions}.
+ */
+declare const traverse: (node: Node, callback: TraverseCallback, options?: TraverseOptions) => void;
+export default traverse;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/lib/traverse.js

@@ -0,0 +1,53 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const nodeKeyComparator_1 = __importDefault(require("./nodeKeyComparator"));
+/**
+ * Visits every descendant {@link Node} of given {@link Node} and calls a callback.
+ *
+ * @param node - {@link Node} to look for descendant {@link Node | Nodes} in.
+ * @param callback - Callback that will be called for each visited {@link Node}. Return true from callback to stop traversing.
+ * @param options - See {@link TraverseOptions}.
+ */
+const traverse = (node, callback, options = {}) => {
+    const stack = [];
+    let currentKeyIndex = 0;
+    let currentNode = node;
+    let currentPrefix = options.prefix || '';
+    while (stack.length > 0 || currentNode) {
+        while (currentNode) {
+            const keys = Object.keys(currentNode);
+            if (currentKeyIndex >= keys.length) {
+                currentNode = undefined;
+            }
+            else {
+                const sortedKeys = options.sort ? keys.sort(nodeKeyComparator_1.default) : keys;
+                const key = sortedKeys[currentKeyIndex];
+                if (key === 'wordEnd') {
+                    ++currentKeyIndex;
+                }
+                else {
+                    stack.push({ keyIndex: currentKeyIndex, node: currentNode });
+                    currentKeyIndex = 0;
+                    currentNode = currentNode[key];
+                    currentPrefix += key;
+                    if (!options.wordsOnly || currentNode.wordEnd) {
+                        const shouldStop = callback({ node: currentNode, prefix: currentPrefix });
+                        if (shouldStop) {
+                            return;
+                        }
+                    }
+                }
+            }
+        }
+        if (stack.length > 0) {
+            const state = stack.pop();
+            currentKeyIndex = state.keyIndex + 1;
+            currentNode = state.node;
+            currentPrefix = currentPrefix.slice(0, -1);
+        }
+    }
+};
+exports.default = traverse;

package/dictionaries/node_modules/@kamilmielnik/trie/dist/types.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Keys are single characters (strings of length 1) or "wordEnd".
+ * "wordEnd: true" indicates that keys of all parent {@link Node | Nodes} make a valid word when joined together.
+ */
+export interface Node extends Record<string, Node | true | undefined> {
+    wordEnd?: true;
+}
+export declare type TraverseCallback = (descendant: Descendant) => boolean | void;
+export declare type Descendant = {
+    node: Node;
+    prefix: string;
+};
+export declare type TraverseOptions = {
+    /**
+     * Set the prefix to be applied to all descendants.
+     * It should be the prefix represented by the {@link Node} at which traversing starts.
+     * Defaults to empty string.
+     */
+    prefix?: string;
+    /**
+     * Set to true to visit {@link Node | Nodes} in alphabetical order.
+     * Defaults to false.
+     */
+    sort?: boolean;
+    /**
+     * Set to true to only visit {@link Node | Nodes} representing complete words.
+     * Defaults to false.
+     */
+    wordsOnly?: boolean;
+};

package/dictionaries/node_modules/@kamilmielnik/trie/dist/types.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dictionaries/node_modules/@kamilmielnik/trie/package.json

@@ -0,0 +1,69 @@
+{
+  "name": "@kamilmielnik/trie",
+  "version": "2.0.1",
+  "description": "Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.",
+  "keywords": [
+    "trie",
+    "data",
+    "structure",
+    "algorithm",
+    "scrabble",
+    "solver",
+    "typescript",
+    "prefix",
+    "tree"
+  ],
+  "engines": {
+    "node": ">=16"
+  },
+  "main": "./dist/index.js",
+  "license": "MIT",
+  "author": {
+    "name": "Kamil Mielnik",
+    "email": "kamil.adam.mielnik@gmail.com",
+    "url": "https://kamilmielnik.com/"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/kamilmielnik/trie.git"
+  },
+  "bugs": {
+    "url": "https://github.com/kamilmielnik/trie/issues"
+  },
+  "homepage": "https://github.com/kamilmielnik/trie#readme",
+  "files": [
+    "dist/**"
+  ],
+  "types": "./dist/index.d.ts",
+  "np": {
+    "yarn": false
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "clean": "rimraf coverage dist docs",
+    "build": "tsc --project .",
+    "build:docs": "typedoc",
+    "postbuild": "npm run build:docs",
+    "prettier": "prettier --list-different './src/**/*.{js,ts}'",
+    "prettier:fix": "npm run prettier:js -- --write --no-list-different",
+    "prebuild": "npm run clean",
+    "prerelease": "npm run test && npm run build && npm run build:docs",
+    "release": "np",
+    "test": "jest",
+    "test:debug": "node --inspect-brk node_modules/.bin/jest --runInBand",
+    "test:watch": "jest --watch"
+  },
+  "devDependencies": {
+    "@types/jest": "^29.1.2",
+    "jest": "^29.1.2",
+    "np": "^7.6.2",
+    "prettier": "^2.7.1",
+    "rimraf": "^3.0.2",
+    "ts-jest": "^29.0.3",
+    "typedoc": "^0.23.15",
+    "typedoc-plugin-markdown": "^3.13.6",
+    "typescript": "^4.8.4"
+  }
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@scrabble-solver/configs",
-  "version": "2.12.5",
+  "version": "2.13.1",
   "description": "Scrabble Solver 2 - Configs",
   "main": "build/index.js",
   "types": "build/index.d.ts",
@@ -24,8 +24,8 @@
     "clean:force": "npm run clean && rimraf package-lock.json"
   },
   "dependencies": {
-    "@scrabble-solver/constants": "^2.12.5",
-    "@scrabble-solver/types": "^2.12.5"
+    "@scrabble-solver/constants": "^2.13.1",
+    "@scrabble-solver/types": "^2.13.1"
   },
-  "gitHead": "ff33bcbceeb7010bade54d6a370efe3c574fe183"
+  "gitHead": "0588fd5c88be44c2f3e96d8cf8cc6fa7166c924c"
 }

package/src/locales/index.ts

@@ -5,3 +5,4 @@ export { default as esEs } from './esEs';
 export { default as faIr } from './faIr';
 export { default as frFr } from './frFr';
 export { default as plPl } from './plPl';
+export { default as roRo } from './roRo';

package/src/locales/roRo.ts

@@ -0,0 +1,39 @@
+import { Config, Locale } from '@scrabble-solver/types';
+
+import { scrabble } from '../games';
+
+const roRo: Config[] = [
+  new Config({
+    ...scrabble,
+    locale: Locale.RO_RO,
+    /**
+     * @see https://frsc1.fortunecity.ws/reg6scr.htm#vallit
+     */
+    tiles: [
+      { character: 'a', count: 11, score: 1 },
+      { character: 'b', count: 2, score: 9 },
+      { character: 'c', count: 5, score: 1 },
+      { character: 'd', count: 4, score: 2 },
+      { character: 'e', count: 9, score: 1 },
+      { character: 'f', count: 2, score: 8 },
+      { character: 'g', count: 2, score: 9 },
+      { character: 'h', count: 1, score: 10 },
+      { character: 'i', count: 10, score: 1 },
+      { character: 'j', count: 1, score: 10 },
+      { character: 'l', count: 4, score: 1 },
+      { character: 'm', count: 3, score: 4 },
+      { character: 'n', count: 6, score: 1 },
+      { character: 'o', count: 5, score: 1 },
+      { character: 'p', count: 4, score: 2 },
+      { character: 'r', count: 7, score: 1 },
+      { character: 's', count: 5, score: 1 },
+      { character: 't', count: 7, score: 1 },
+      { character: 'u', count: 6, score: 1 },
+      { character: 'v', count: 2, score: 8 },
+      { character: 'x', count: 1, score: 10 },
+      { character: 'z', count: 1, score: 10 },
+    ],
+  }),
+];
+
+export default roRo;