@scrabble-solver/configs 2.13.0 → 2.13.1

package/dictionaries/node_modules/@kamilmielnik/trie/README.md

@@ -0,0 +1,187 @@
+# @kamilmielnik/trie
+
+![Version](https://img.shields.io/github/package-json/v/kamilmielnik/trie)
+![License](https://img.shields.io/npm/l/@kamilmielnik/trie)
+![Node version](https://img.shields.io/node/v/@kamilmielnik/trie)
+![Dependencies](https://img.shields.io/librariesio/github/kamilmielnik/trie)
+![Vulnerabilities](https://img.shields.io/snyk/vulnerabilities/github/kamilmielnik/trie)
+![Test](https://github.com/kamilmielnik/trie/workflows/Test/badge.svg)
+![Coverage](https://img.shields.io/badge/coverage-100%25-brightgreen.svg)
+![Prettier](https://github.com/kamilmielnik/trie/workflows/Prettier/badge.svg)
+
+[Trie](https://en.wikipedia.org/wiki/Trie) data structure implementation in TypeScript.
+Highly performant. No dependencies. Built for a [Scrabble Solver](https://github.com/kamilmielnik/scrabble-solver).
+
+# Table of contents
+
+- [Installation](#installation)
+- [API](#api)
+  - [Object-oriented API](#object-oriented-api)
+  - [Functional API](#functional-api)
+- [Examples](#examples)
+  - [Load dictionary from file](#load-dictionary-from-file)
+  - [Serialize `Node` to a file](#serialize-node-to-a-file)
+  - [Load serialized `Node` from a file](#load-serialized-node-from-a-file)
+  - [Find all words with given prefix](#find-all-words-with-given-prefix)
+- [Serialization and compression](#serialization-and-compression)
+- [Performance](#performance)
+
+# Installation
+
+## npm
+
+```Shell
+npm install @kamilmielnik/trie --save
+```
+
+## yarn
+
+```Shell
+yarn add @kamilmielnik/trie
+```
+
+# [API](docs/README.md)
+
+See full [API Docs](docs/README.md) - generated by [typedoc](http://typedoc.org/).
+
+Good to know:
+
+- all objects are mutable
+- every class, interface, type, constant and function is exported
+- all exports are named (there is no default export)
+
+There are 2 ways to use the API.
+
+## [Object-oriented API](docs/README.md#classes)
+
+Create [`Trie`](docs/classes/trie.md) instance and use its' methods.
+
+### Example
+
+```ts
+import { Trie } from '@kamilmielnik/trie';
+
+const trie = new Trie();
+trie.add('master');
+trie.add('mask');
+console.log(trie.hasPrefix('man')); // false
+console.log(trie.hasPrefix('mas')); // true
+console.log(trie.has('mas')); // false
+console.log(trie.remove('mas')); // false
+console.log(trie.has('master')); // true
+console.log(trie.serialize()); // "(m(a(s(t(e(r))k))))"
+console.log(trie.remove('master')); // true
+console.log(trie.serialize()); // "(m(a(s(k))))"
+```
+
+## [Functional API](docs/README.md#functions)
+
+Manipulate existing instances of [`Node`](docs/interfaces/node.md) with [functions](docs/README.md#functions).
+
+### Example
+
+The following example works identically to the object-oriented example above.
+
+```ts
+import { add, has, hasPrefix, Node, remove, serialize } from '@kamilmielnik/trie';
+
+const root: Node = {};
+
+add(root, 'master');
+add(root, 'mask');
+console.log(hasPrefix(root, 'man')); // false
+console.log(hasPrefix(root, 'mas')); // true
+console.log(has(root, 'mas')); // false
+console.log(remove(root, 'mas')); // false
+console.log(has(root, 'master')); // true
+console.log(serialize(root)); // "(m(a(s(t(e(r))k))))"
+console.log(remove(root, 'master')); // true
+console.log(serialize(root)); // "(m(a(s(k))))"
+```
+
+# Examples
+
+- [Load dictionary from file](#load-dictionary-from-file)
+- [Serialize `Node` to a file](#serialize-node-to-a-file)
+- [Load serialized `Node` from a file](#load-serialized-node-from-a-file)
+- [Find all words with given prefix](#find-all-words-with-given-prefix)
+
+## Load dictionary from file
+
+```ts
+import { fromArray, Node } from '@kamilmielnik/trie';
+import fs from 'fs';
+
+const fromFile = (filepath: string): Node => {
+  const file = fs.readFileSync(filepath, 'utf-8');
+  // Assuming file contains 1 word per line
+  const words = file.split('\n').filter(Boolean);
+  const node = fromArray(words);
+  return node;
+};
+```
+
+## Serialize [`Node`](docs/interfaces/node.md) to a file
+
+```ts
+import { Trie } from '@kamilmielnik/trie';
+import fs from 'fs';
+
+const toFile = (filepath: string, trie: Trie): void => {
+  const serialized = trie.serialize();
+  fs.writeFileSync(filepath, serialized);
+};
+```
+
+## Load serialized [`Node`](docs/interfaces/node.md) from a file
+
+```ts
+import { deserialize, Node } from '@kamilmielnik/trie';
+import fs from 'fs';
+
+const fromFile = (filepath: string): Node => {
+  const serialized = fs.readFileSync(filepath, 'utf-8');
+  const node = deserialize(serialized);
+  return node;
+};
+```
+
+## Find all words with given prefix
+
+```ts
+import { find, Node, toArray } from '@kamilmielnik/trie';
+
+const findWordsWithPrefix = (node: Node, prefix: string): string[] => {
+  const prefixNode = find(node, prefix) || {};
+  const descendants = toArray(prefixNode, { prefix, sort: true, wordsOnly: true });
+  const words = descendants.map(({ prefix: word }) => word);
+  return words;
+};
+```
+
+# Serialization and compression
+
+This package can be used to efficiently [serialize](docs/README.md#serialize) and compress dictionaries.
+It reaches 54.79 [compression ratio](https://en.wikipedia.org/wiki/Data_compression_ratio) (98.17% space saving) for Polish dictionary when combined with [7-Zip](https://en.wikipedia.org/wiki/7z) at ultra compression level.
+
+| Language                                                            | 🇺🇸 en-US                                                                | 🇬🇧 en-GB                                                                    | 🇵🇱 pl-PL                                  |
+| ------------------------------------------------------------------- | ----------------------------------------------------------------------- | --------------------------------------------------------------------------- | ----------------------------------------- |
+| Name                                                                | [TWL06](https://en.wikipedia.org/wiki/NASPA_Word_List)                  | [SOWPODS](https://en.wikipedia.org/wiki/Collins_Scrabble_Words)             | [SJP.PL](https://sjp.pl/slownik/dp.phtml) |
+| Source                                                              | [Download](https://www.wordgamedictionary.com/twl06/download/twl06.txt) | [Download](https://www.wordgamedictionary.com/sowpods/download/sowpods.txt) | [Download](https://sjp.pl/slownik/growy/) |
+| Words count                                                         | 178,691                                                                 | 267,753                                                                     | 3,045,878                                 |
+| File size [B]                                                       | 1,941,856                                                               | 2,974,773                                                                   | 42,838,508                                |
+| File size (serialized) [B]                                          | (-29.75%) 1,364,242                                                     | (-31.57%) 2,035,697                                                         | (-56.33%) 18,705,990                      |
+| File size ([7z](https://en.wikipedia.org/wiki/7z)) [B]              | (-80.46%) 379,483                                                       | (-81.04%) 563,913                                                           | (-87.58%) 5,320,397                       |
+| File size (serialized + [7z](https://en.wikipedia.org/wiki/7z)) [B] | (-89.94%) 195,299                                                       | (-90.40%) 285,430                                                           | (-98.17%) 781,875                         |
+
+# Performance
+
+[`add`](docs/README.md#add), [`find`](docs/README.md#find), [`has`](docs/README.md#has), [`hasPrefix`](docs/README.md#hasPrefix), [`remove`](docs/README.md#remove) are very fast - logarithmic complexity (millions of operations per second).
+
+![image](https://user-images.githubusercontent.com/6830683/100113381-d5b63580-2ea2-11eb-8ed6-0e03515b5d9a.png)
+
+----
+
+[`deserialize`](docs/README.md#deserialize), [`fromArray`](docs/README.md#fromArray), [`serialize`](docs/README.md#serialize), [`toArray`](docs/README.md#toArray) are slow - linear complexity (few operations per second).
+
+![image](https://user-images.githubusercontent.com/6830683/100113526-fe3e2f80-2ea2-11eb-9b1e-22ae954e297a.png)

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

@@ -0,0 +1,99 @@
+import type { Descendant, Node, TraverseCallback, TraverseOptions } from './types';
+/**
+ * A class representing the {@link https://en.wikipedia.org/wiki/Trie | Trie data structure}.
+ */
+declare class Trie {
+    /**
+     * Creates a new {@link Trie} by deserializing given string.
+     *
+     * The inverse of {@link Trie.serialize | serialize}.
+     *
+     * @param serialized - String with serialized data.
+     * @returns {@link Trie} representing deserialized data.
+     */
+    static deserialize(serialized: string): Trie;
+    /**
+     * 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.
+     */
+    static fromArray(words: string[]): Trie;
+    /**
+     * Represents the root {@link Node} of the {@link Trie}.
+     * It's not a copy. Mutate at your own risk.
+     */
+    readonly root: Node;
+    /**
+     * Creates a new {@link Trie} with optionally given root {@link Node}.
+     *
+     * @param root - Root {@link Node} of the {@link Trie} to be created.
+     */
+    constructor(root?: Node);
+    /**
+     * 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.
+     */
+    add(word: string): Node;
+    /**
+     * 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.
+     */
+    find(prefix: string): Node | undefined;
+    /**
+     * 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.
+     */
+    has(word: string): boolean;
+    /**
+     * Tells you whether there are any words with given prefix in the {@link Trie}.
+     *
+     * See: https://en.wikipedia.org/wiki/String_operations#Prefixes
+     *
+     * @param prefix - Prefix to be found.
+     * @returns true if there are any words with given prefix in the {@link Trie}, false otherwise.
+     */
+    hasPrefix(prefix: string): boolean;
+    /**
+     * 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.
+     */
+    remove(word: string): boolean;
+    /**
+     * Converts the {@link Trie} into a string.
+     *
+     * The inverse of {@link Trie.deserialize | 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%).
+     *
+     * @returns String with serialized data.
+     */
+    serialize(): string;
+    /**
+     * 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}.
+     */
+    toArray(options?: TraverseOptions): Descendant[];
+    /**
+     * 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}.
+     */
+    traverse(callback: TraverseCallback, options?: TraverseOptions): void;
+}
+export default Trie;

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

@@ -0,0 +1,118 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const lib_1 = require("./lib");
+/**
+ * A class representing the {@link https://en.wikipedia.org/wiki/Trie | Trie data structure}.
+ */
+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.
+     */
+    constructor(root = {}) {
+        this.root = root;
+    }
+    /**
+     * Creates a new {@link Trie} by deserializing given string.
+     *
+     * The inverse of {@link Trie.serialize | serialize}.
+     *
+     * @param serialized - String with serialized data.
+     * @returns {@link Trie} representing deserialized data.
+     */
+    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.
+     */
+    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.
+     */
+    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.
+     */
+    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.
+     */
+    has(word) {
+        return (0, lib_1.has)(this.root, word);
+    }
+    /**
+     * Tells you whether there are any words with given prefix in the {@link Trie}.
+     *
+     * See: https://en.wikipedia.org/wiki/String_operations#Prefixes
+     *
+     * @param prefix - Prefix to be found.
+     * @returns true if there are any words with given prefix in the {@link Trie}, false otherwise.
+     */
+    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.
+     */
+    remove(word) {
+        return (0, lib_1.remove)(this.root, word);
+    }
+    /**
+     * Converts the {@link Trie} into a string.
+     *
+     * The inverse of {@link Trie.deserialize | 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%).
+     *
+     * @returns String with serialized data.
+     */
+    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}.
+     */
+    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}.
+     */
+    traverse(callback, options) {
+        return (0, lib_1.traverse)(this.root, callback, options);
+    }
+}
+exports.default = Trie;

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

@@ -0,0 +1,8 @@
+/**
+ * Represents end of a node in serialized format.
+ */
+export declare const CLOSE_PARENS = ")";
+/**
+ * Represents start of a node in serialized format.
+ */
+export declare const OPEN_PARENS = "(";

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

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.OPEN_PARENS = exports.CLOSE_PARENS = void 0;
+/**
+ * Represents end of a node in serialized format.
+ */
+exports.CLOSE_PARENS = ')';
+/**
+ * Represents start of a node in serialized format.
+ */
+exports.OPEN_PARENS = '(';

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

@@ -0,0 +1,5 @@
+import { default as Trie } from './Trie';
+export { Trie };
+export * from './constants';
+export * from './lib';
+export type { Descendant, Node, TraverseCallback, TraverseOptions } from './types';

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

@@ -0,0 +1,24 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = 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];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Trie = void 0;
+const Trie_1 = __importDefault(require("./Trie"));
+Object.defineProperty(exports, "Trie", { enumerable: true, get: function () { return Trie_1.default; } });
+__exportStar(require("./constants"), exports);
+__exportStar(require("./lib"), exports);

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

@@ -0,0 +1,10 @@
+import type { Node } from '../types';
+/**
+ * Inserts given `word` into given `node`.
+ *
+ * @param node - {@link Node} to insert the `word` to.
+ * @param word - Word to be inserted into `node`.
+ * @returns {@link Node} representing the end of the added word.
+ */
+declare const add: (node: Node, word: string) => Node;
+export default add;

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

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Inserts given `word` into given `node`.
+ *
+ * @param node - {@link Node} to insert the `word` to.
+ * @param word - Word to be inserted into `node`.
+ * @returns {@link Node} representing the end of the added word.
+ */
+const add = (node, word) => {
+    let currentNode = node;
+    for (let index = 0; index < word.length; ++index) {
+        const character = word[index];
+        if (!currentNode[character]) {
+            currentNode[character] = {};
+        }
+        currentNode = currentNode[character];
+    }
+    currentNode.wordEnd = true;
+    return currentNode;
+};
+exports.default = add;

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

@@ -0,0 +1,11 @@
+import type { Node } from '../types';
+/**
+ * Creates a new {@link Node} by deserializing given string.
+ *
+ * The inverse of {@link serialize}.
+ *
+ * @param serialized - String with value returned by {@link serialize}.
+ * @returns Instance of a root {@link Node} of deserialized string.
+ */
+declare const deserialize: (serialized: string) => Node;
+export default deserialize;

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

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const constants_1 = require("../constants");
+/**
+ * Creates a new {@link Node} by deserializing given string.
+ *
+ * The inverse of {@link serialize}.
+ *
+ * @param serialized - String with value returned by {@link serialize}.
+ * @returns Instance of a root {@link Node} of deserialized string.
+ */
+const deserialize = (serialized) => {
+    const stack = [];
+    let node = {};
+    let i = 1;
+    while (i < serialized.length - 1) {
+        const character = serialized[i];
+        const nextCharacter = serialized[i + 1];
+        ++i;
+        if (character === constants_1.CLOSE_PARENS) {
+            const nextNode = stack.pop();
+            if (!nextNode) {
+                throw new Error(`Syntax error: misplaced "${constants_1.CLOSE_PARENS}"`);
+            }
+            node = nextNode;
+        }
+        else if (nextCharacter === constants_1.CLOSE_PARENS) {
+            node[character] = { wordEnd: true };
+            const nextNode = stack.pop();
+            if (!nextNode) {
+                throw new Error(`Syntax error: misplaced "${constants_1.CLOSE_PARENS}"`);
+            }
+            node = nextNode;
+            ++i;
+        }
+        else if (nextCharacter === constants_1.OPEN_PARENS) {
+            stack.push(node);
+            const newNode = node[character] || {};
+            node[character] = newNode;
+            node = newNode;
+            ++i;
+        }
+        else {
+            node[character] = { wordEnd: true };
+        }
+    }
+    return node;
+};
+exports.default = deserialize;

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

@@ -0,0 +1,10 @@
+import type { Node } from '../types';
+/**
+ * Finds {@link Node} representing given prefix in given {@link Node}.
+ *
+ * @param node - {@link Node} to look for prefix in.
+ * @param prefix - Prefix to be found.
+ * @returns {@link Node} representing a given prefix, undefined if there is no such node.
+ */
+declare const find: (node: Node, prefix: string) => Node | undefined;
+export default find;

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

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Finds {@link Node} representing given prefix in given {@link Node}.
+ *
+ * @param node - {@link Node} to look for prefix in.
+ * @param prefix - Prefix to be found.
+ * @returns {@link Node} representing a given prefix, undefined if there is no such node.
+ */
+const find = (node, prefix) => {
+    let currentNode = node;
+    for (let index = 0; index < prefix.length; ++index) {
+        const character = prefix[index];
+        if (!currentNode[character]) {
+            return undefined;
+        }
+        currentNode = currentNode[character];
+    }
+    return currentNode;
+};
+exports.default = find;

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

@@ -0,0 +1,9 @@
+import type { Node } from '../types';
+/**
+ * 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.
+ */
+declare const fromArray: (words: string[]) => Node;
+export default fromArray;

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

@@ -0,0 +1,18 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const add_1 = __importDefault(require("./add"));
+/**
+ * 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.
+ */
+const fromArray = (words) => {
+    const node = {};
+    words.forEach((word) => (0, add_1.default)(node, word));
+    return node;
+};
+exports.default = fromArray;

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

@@ -0,0 +1,10 @@
+import type { Node } from '../types';
+/**
+ * Tells you whether given word is in the {@link Node}.
+ *
+ * @param node - {@link Node} to look for word in.
+ * @param word - Word to be found.
+ * @returns true if given word is in the {@link Node}, false otherwise.
+ */
+declare const has: (node: Node, word: string) => boolean;
+export default has;

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

@@ -0,0 +1,18 @@
+"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 given word is in the {@link Node}.
+ *
+ * @param node - {@link Node} to look for word in.
+ * @param word - Word to be found.
+ * @returns true if given word is in the {@link Node}, false otherwise.
+ */
+const has = (node, word) => {
+    const foundNode = (0, find_1.default)(node, word);
+    return Boolean(foundNode && foundNode.wordEnd);
+};
+exports.default = has;

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

@@ -0,0 +1,12 @@
+import type { Node } from '../types';
+/**
+ * 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.
+ */
+declare const hasPrefix: (node: Node, prefix: string) => boolean;
+export default hasPrefix;