binary-decision-diagram 3.2.0 → 5.0.0

package/src/minimal-string/minimal-string-to-simple-bdd.ts

@@ -1,67 +0,0 @@
-import {
-    SimpleBdd,
-    SimpleBddLeafNode
-} from '../types.js';
-import { splitStringToChunks } from '../util.js';
-import { getNumberOfChar } from './string-format.js';
-
-export function minimalStringToSimpleBdd(
-    str: string
-): SimpleBdd {
-    const nodesById: Map<string, SimpleBdd | SimpleBddLeafNode> = new Map();
-
-    // parse leaf nodes
-    const leafNodeAmount = parseInt(str.charAt(0) + str.charAt(1), 10);
-    const lastLeafNodeChar = (2 + leafNodeAmount * 2);
-    const leafNodeChars = str.substring(2, lastLeafNodeChar);
-    const leafNodeChunks = splitStringToChunks(leafNodeChars, 2);
-    for (let i = 0; i < leafNodeChunks.length; i++) {
-        const chunk = leafNodeChunks[i];
-        const id = chunk.charAt(0);
-        const value: SimpleBddLeafNode = getNumberOfChar(chunk.charAt(1));
-        nodesById.set(id, value);
-    }
-
-    // parse internal nodes
-    const internalNodeChars = str.substring(lastLeafNodeChar, str.length - 3);
-    const internalNodeChunks = splitStringToChunks(internalNodeChars, 4);
-    for (let i = 0; i < internalNodeChunks.length; i++) {
-        const chunk = internalNodeChunks[i];
-        const id = chunk.charAt(0);
-        const idOf0Branch = chunk.charAt(1);
-        const idOf1Branch = chunk.charAt(2);
-        const level = getNumberOfChar(chunk.charAt(3));
-
-
-        if (!nodesById.has(idOf0Branch)) {
-            throw new Error('missing node with id ' + idOf0Branch);
-        }
-        if (!nodesById.has(idOf1Branch)) {
-            throw new Error('missing node with id ' + idOf1Branch);
-        }
-
-        const node0 = nodesById.get(idOf0Branch) as SimpleBdd;
-        const node1 = nodesById.get(idOf1Branch) as SimpleBdd;
-        const node: SimpleBdd = {
-            l: level, // level is first for prettier json output
-            0: node0,
-            1: node1
-        };
-        nodesById.set(id, node);
-    }
-
-    // parse root node
-    const last3 = str.slice(-3);
-    const idOf0 = last3.charAt(0);
-    const idOf1 = last3.charAt(1);
-    const levelOfRoot = getNumberOfChar(last3.charAt(2));
-    const nodeOf0 = nodesById.get(idOf0) as SimpleBdd;
-    const nodeOf1 = nodesById.get(idOf1) as SimpleBdd;
-    const rootNode: SimpleBdd = {
-        l: levelOfRoot,
-        0: nodeOf0,
-        1: nodeOf1,
-    };
-
-    return rootNode;
-}

package/src/minimal-string/resolve-with-simple-bdd.ts

@@ -1,25 +0,0 @@
-import {
-    SimpleBdd,
-    ResolverFunctions,
-    SimpleBddLeafNode
-} from '../types.js';
-import { booleanToBooleanString } from '../util.js';
-
-export function resolveWithSimpleBdd(
-    simpleBdd: SimpleBdd,
-    fns: ResolverFunctions,
-    input: any
-): number {
-    let currentNode: SimpleBdd | SimpleBddLeafNode = simpleBdd;
-    let currentLevel: number = simpleBdd.l;
-    while (true) {
-        const booleanResult = fns[currentLevel](input);
-        const branchKey = booleanToBooleanString(booleanResult);
-        currentNode = currentNode[branchKey];
-        if (typeof currentNode === 'number' || typeof currentNode === 'string') {
-            return currentNode as any;
-        } else {
-            currentLevel = currentNode.l;
-        }
-    }
-}

package/src/minimal-string/string-format.ts

@@ -1,67 +0,0 @@
-/*
-let t = 0;
-while (t < 10000) {
-    const char = String.fromCharCode(t);
-    console.log(t + ' : ' + char);
-    t++;
-}
-*/
-
-/*
-
-To have a really small string representation, we have to hack some stuff
-which makes is complicated but effective.
-
-Rules for the string:
-- The string starts with a number like '23' that defines how many leaf-nodes we have
-- leaf nodes consist of two chars like 'ab'
-    - the first char is the id
-    - the second the value is a number you can get via String.charCodeAt()
-- Internal nodes have four chars like 'abcd'
-    - the first char is the id
-    - the second char is the id of the 0-branch
-    - the third char is the id of the 1-branch
-    - the last char is the id of the boolean-function (= level)
-- The last 3 chars of the string is the root node like 'abc'
-    - it looks like the internal-node but without the id (first char)
-
-*/
-
-// we use this because 39 is the quotes which causes problems
-export const CHAR_CODE_OFFSET = 40; // String.fromCharCode(33) === ')'
-
-
-export function getCharOfLevel(level: number): string {
-    const charCode = CHAR_CODE_OFFSET + level;
-    return String.fromCharCode(charCode);
-}
-
-export function getNumberOfChar(char: string): number {
-    const charCode = char.charCodeAt(0);
-    return charCode - CHAR_CODE_OFFSET;
-}
-
-export function getCharOfValue(value: number): string {
-    const charCode = CHAR_CODE_OFFSET + value;
-    return String.fromCharCode(charCode);
-}
-
-
-export const FIRST_CHAR_CODE_FOR_ID = 97; // String.fromCharCode(97) === 'a'
-
-export function getNextCharId(lastCode: number): {
-    char: string,
-    nextCode: number
-} {
-
-    // jump these codes because they look strange
-    if (lastCode >= 128 && lastCode <= 160) {
-        lastCode = 161;
-    }
-
-    const char = String.fromCharCode(lastCode);
-    return {
-        char,
-        nextCode: lastCode + 1
-    };
-}