generative-bayesian-network 0.1.0-beta.3 → 2.0.0-dev.2

package/{LICENSE → LICENSE.md}

@@ -178,7 +178,7 @@
    APPENDIX: How to apply the Apache License to your work.
 
       To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
+      boilerplate notice, with the fields enclosed by brackets "{}"
       replaced with your own identifying information. (Don't include
       the brackets!)  The text should be enclosed in the appropriate
       comment syntax for the file format. We also recommend that a
@@ -186,7 +186,7 @@
       same "printed page" as the copyright notice for easier
       identification within third-party archives.
 
-   Copyright [yyyy] [name of copyright owner]
+   Copyright 2018 Apify Technologies s.r.o.
 
    Licensed under the Apache License, Version 2.0 (the "License");
    you may not use this file except in compliance with the License.

package/README.md

@@ -1,155 +1,3 @@
-# Generative bayesian network
-NodeJs package containing a bayesian network capable of randomly sampling from a distribution defined by a json object.
-
-<!-- toc -->
-
-- [Installation](#installation)
-- [Usage](#usage)
-- [API Reference](#api-reference)
-
-<!-- tocstop -->
-
-## Installation
-Run the `npm i generative-bayesian-network` command. No further setup is needed afterwards.
-## Usage
-To use the network, you need to create an instance of the `BayesianNetwork` class which is exported from this package. Constructor of this class accepts a JSON object containing the network definition.  This definition can either include the probability distributions for the nodes, or these can be calculated later using data. An example of such a definition saved in a JSON file could look like:
-```json
-{
-    "nodes": [
-        {
-            "name": "ParentNode",
-            "values": ["A", "B", "C"],
-            "parentNames": [],
-            "conditionalProbabilities": {
-                "A": 0.1,
-                "B": 0.8,
-                "C": 0.1
-            }
-        },
-        {
-            "name": "ChildNode",
-            "values": [".", ",", "!", "?"],
-            "parentNames": ["ParentNode"],
-            "conditionalProbabilities": {
-                "A": {
-                    ".": 0.7,
-                    "!": 0.3
-                },
-                "B": {
-                    ",": 0.3,
-                    "?": 0.7
-                },
-                "C": {
-                    ".": 0.5,
-                    "?": 0.5
-                }
-            }
-        }
-    ]
-}
-```
-Once you have the network definition ready, you can create an instance simply by executing:
-```js
-let generatorNetwork = new BayesianNetwork(networkDefinition);
-```
-If the network definition didn't include the probabilities, you also need to call the `setProbabilitiesAccordingToData` method and provide it with a [Danfo.js dataframe](https://danfo.jsdata.org/api-reference/dataframe) containing the dataset you want to be used to calculate the probabilities:
-```js
-generatorNetwork.setProbabilitiesAccordingToData(dataframe);
-```
-After the setup, you can save the current network's definition by doing:
-```js
-generatorNetwork.saveNetworkDefinition(networkDefinitionFilePath);
-```
-Once you have the network all set up, you can use two methods to actually generate the samples - `generateSample` and `generateConsistentSampleWhenPossible`. The first one generates a sample of all node values given (optionally) the values we already know in the form of an object. The second does much the same thing, but instead of just getting the known values of some of the attributes, the object you can give it as an argument can contain multiple possible values for each node, not just one. You could run them for example like this:
-```js
-let sample = generatorNetwork.generateSample({ "ParentNode": "A" });
-let consistentSample = generatorNetwork.generateSample({
-    "ParentNode": ["A","B"], "ChildNode": [",","!"]
-});
-```
-
-## API Reference
-All public classes, methods and their parameters can be inspected in this API reference.
-
-<a name="BayesianNetwork"></a>
-
-### BayesianNetwork
-BayesianNetwork is an implementation of a bayesian network capable of randomly sampling from the distribution
-represented by the network.
-
-
-* [BayesianNetwork](#BayesianNetwork)
-    * [`new BayesianNetwork(networkDefinition)`](#new_BayesianNetwork_new)
-    * [`.generateSample(inputValues)`](#BayesianNetwork+generateSample)
-    * [`.generateConsistentSampleWhenPossible(valuePossibilities)`](#BayesianNetwork+generateConsistentSampleWhenPossible)
-    * [`.setProbabilitiesAccordingToData(dataframe)`](#BayesianNetwork+setProbabilitiesAccordingToData)
-    * [`.saveNetworkDefinition(networkDefinitionFilePath)`](#BayesianNetwork+saveNetworkDefinition)
-
-
-* * *
-
-<a name="new_BayesianNetwork_new"></a>
-
-#### `new BayesianNetwork(networkDefinition)`
-
-| Param | Type | Description |
-| --- | --- | --- |
-| networkDefinition | <code>object</code> | object defining the network structure and distributions |
-
-
-* * *
-
-<a name="BayesianNetwork+generateSample"></a>
-
-#### `bayesianNetwork.generateSample(inputValues)`
-Randomly samples from the distribution represented by the bayesian network.
-
-
-| Param | Type | Description |
-| --- | --- | --- |
-| inputValues | <code>object</code> | node values that are known already |
-
-
-* * *
-
-<a name="BayesianNetwork+generateConsistentSampleWhenPossible"></a>
-
-#### `bayesianNetwork.generateConsistentSampleWhenPossible(valuePossibilities)`
-Randomly samples from the distribution represented by the bayesian network,
-making sure the sample is consistent with the provided restrictions on value possibilities.
-Returns false if no such sample can be generated.
-
-
-| Param | Type | Description |
-| --- | --- | --- |
-| valuePossibilities | <code>object</code> | a dictionary of lists of possible values for nodes                                      (if a node isn't present in the dictionary, all values are possible) |
-
-
-* * *
-
-<a name="BayesianNetwork+setProbabilitiesAccordingToData"></a>
-
-#### `bayesianNetwork.setProbabilitiesAccordingToData(dataframe)`
-Sets the conditional probability distributions of this network's nodes to match the given data.
-
-
-| Param | Type | Description |
-| --- | --- | --- |
-| dataframe | <code>object</code> | a Danfo.js dataframe containing the data |
-
-
-* * *
-
-<a name="BayesianNetwork+saveNetworkDefinition"></a>
-
-#### `bayesianNetwork.saveNetworkDefinition(networkDefinitionFilePath)`
-Saves the network definition to the specified file path to be used later.
-
-
-| Param | Type | Description |
-| --- | --- | --- |
-| networkDefinitionFilePath | <code>string</code> | a file path where the network definition should be saved |
-
-
-* * *
+# Fingerprint suite
 
+This repository contains a set of fingerprinting tools developed by Apify.

package/bayesian-network.d.ts

@@ -0,0 +1,44 @@
+import type { DataFrame } from 'danfojs-node';
+/**
+ * BayesianNetwork is an implementation of a bayesian network capable of randomly sampling from the distribution
+ * represented by the network.
+ */
+export declare class BayesianNetwork {
+    private nodesInSamplingOrder;
+    private nodesByName;
+    constructor({ path }: {
+        path: string;
+    });
+    /**
+     * Randomly samples from the distribution represented by the bayesian network.
+     * @param inputValues Already known node values.
+     */
+    generateSample(inputValues?: Record<string, string>): Record<string, string>;
+    /**
+     * Randomly samples values from the distribution represented by the bayesian network,
+     * making sure the sample is consistent with the provided restrictions on value possibilities.
+     * Returns false if no such sample can be generated.
+     * @param valuePossibilities A dictionary of lists of possible values for nodes (if a node isn't present in the dictionary, all values are possible).
+     */
+    generateConsistentSampleWhenPossible(valuePossibilities: Record<string, string[]>): Record<string, string>;
+    /**
+     * Recursively generates a random sample consistent with the given restrictions on possible values.
+     * @param sampleSoFar Already known node values.
+     * @param valuePossibilities A dictionary of lists of possible values for nodes (if a node isn't present in the dictionary, all values are possible).
+     * @param depth Current recursion depth.
+     */
+    private recursivelyGenerateConsistentSampleWhenPossible;
+    /**
+     * Sets the conditional probability distributions of this network's nodes to match the given data.
+     * @param dataframe A Danfo.js dataframe containing the data.
+     */
+    setProbabilitiesAccordingToData(dataframe: DataFrame): void;
+    /**
+     * Saves the network definition to the specified file path to be used later.
+     * @param networkDefinitionFilePath File path where the network definition should be saved.
+     */
+    saveNetworkDefinition({ path }: {
+        path: string;
+    }): void;
+}
+//# sourceMappingURL=bayesian-network.d.ts.map

package/bayesian-network.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian-network.d.ts","sourceRoot":"","sources":["../src/bayesian-network.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAI9C;;;GAGG;AACH,qBAAa,eAAe;IACxB,OAAO,CAAC,oBAAoB,CAAuB;IACnD,OAAO,CAAC,WAAW,CAAqC;gBAE5C,EAAE,IAAI,EAAE,EAAE;QAAC,IAAI,EAAE,MAAM,CAAA;KAAC;IAapC;;;OAGG;IACH,cAAc,CAAC,WAAW,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM;IAUvD;;;;;OAKG;IACH,oCAAoC,CAAC,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAIjF;;;;;OAKG;IACH,OAAO,CAAC,+CAA+C;IA4BvD;;;OAGG;IACH,+BAA+B,CAAC,SAAS,EAAE,SAAS;IAUpD;;;OAGG;IACH,qBAAqB,CAAC,EAAE,IAAI,EAAE,EAAG;QAAC,IAAI,EAAE,MAAM,CAAA;KAAC;CAWlD"}

package/bayesian-network.js

@@ -0,0 +1,111 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BayesianNetwork = void 0;
+const AdmZip = require("adm-zip");
+const bayesian_node_1 = require("./bayesian-node");
+/**
+ * BayesianNetwork is an implementation of a bayesian network capable of randomly sampling from the distribution
+ * represented by the network.
+ */
+class BayesianNetwork {
+    constructor({ path }) {
+        Object.defineProperty(this, "nodesInSamplingOrder", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: []
+        });
+        Object.defineProperty(this, "nodesByName", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: {}
+        });
+        const zip = new AdmZip(path);
+        const zipEntries = zip.getEntries();
+        const networkDefinition = JSON.parse(zipEntries[0].getData().toString('utf8'));
+        this.nodesInSamplingOrder = networkDefinition.nodes.map((nodeDefinition) => new bayesian_node_1.BayesianNode(nodeDefinition));
+        this.nodesByName = this.nodesInSamplingOrder.reduce((p, node) => ({
+            ...p,
+            [node.name]: node,
+        }), {});
+    }
+    /**
+     * Randomly samples from the distribution represented by the bayesian network.
+     * @param inputValues Already known node values.
+     */
+    generateSample(inputValues = {}) {
+        const sample = inputValues;
+        for (const node of this.nodesInSamplingOrder) {
+            if (!(node.name in sample)) {
+                sample[node.name] = node.sample(sample);
+            }
+        }
+        return sample;
+    }
+    /**
+     * Randomly samples values from the distribution represented by the bayesian network,
+     * making sure the sample is consistent with the provided restrictions on value possibilities.
+     * Returns false if no such sample can be generated.
+     * @param valuePossibilities A dictionary of lists of possible values for nodes (if a node isn't present in the dictionary, all values are possible).
+     */
+    generateConsistentSampleWhenPossible(valuePossibilities) {
+        return this.recursivelyGenerateConsistentSampleWhenPossible({}, valuePossibilities, 0);
+    }
+    /**
+     * Recursively generates a random sample consistent with the given restrictions on possible values.
+     * @param sampleSoFar Already known node values.
+     * @param valuePossibilities A dictionary of lists of possible values for nodes (if a node isn't present in the dictionary, all values are possible).
+     * @param depth Current recursion depth.
+     */
+    recursivelyGenerateConsistentSampleWhenPossible(sampleSoFar, valuePossibilities, depth) {
+        const bannedValues = [];
+        const node = this.nodesInSamplingOrder[depth];
+        let sampleValue;
+        do {
+            sampleValue = node.sampleAccordingToRestrictions(sampleSoFar, valuePossibilities[node.name], bannedValues);
+            if (!sampleValue)
+                break;
+            sampleSoFar[node.name] = sampleValue;
+            if (depth + 1 < this.nodesInSamplingOrder.length) {
+                const sample = this.recursivelyGenerateConsistentSampleWhenPossible(sampleSoFar, valuePossibilities, depth + 1);
+                if (Object.keys(sample).length !== 0) {
+                    return sample;
+                }
+            }
+            else {
+                return sampleSoFar;
+            }
+            bannedValues.push(sampleValue);
+        } while (sampleValue);
+        return {};
+    }
+    /**
+     * Sets the conditional probability distributions of this network's nodes to match the given data.
+     * @param dataframe A Danfo.js dataframe containing the data.
+     */
+    setProbabilitiesAccordingToData(dataframe) {
+        this.nodesInSamplingOrder.forEach((node) => {
+            const possibleParentValues = {};
+            for (const parentName of node.parentNames) {
+                possibleParentValues[parentName] = this.nodesByName[parentName].possibleValues;
+            }
+            node.setProbabilitiesAccordingToData(dataframe, possibleParentValues);
+        });
+    }
+    /**
+     * Saves the network definition to the specified file path to be used later.
+     * @param networkDefinitionFilePath File path where the network definition should be saved.
+     */
+    saveNetworkDefinition({ path }) {
+        const network = {
+            nodes: this.nodesInSamplingOrder,
+        };
+        // creating archives
+        const zip = new AdmZip();
+        zip.addFile('network.json', Buffer.from(JSON.stringify(network), 'utf8'));
+        zip.writeZip(path);
+    }
+}
+exports.BayesianNetwork = BayesianNetwork;
+//# sourceMappingURL=bayesian-network.js.map

package/bayesian-network.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian-network.js","sourceRoot":"","sources":["../src/bayesian-network.ts"],"names":[],"mappings":";;;AACA,kCAAmC;AACnC,mDAA+C;AAE/C;;;GAGG;AACH,MAAa,eAAe;IAIxB,YAAY,EAAE,IAAI,EAAkB;QAHpC;;;;mBAAgD,EAAE;WAAC;QACnD;;;;mBAAqD,EAAE;WAAC;QAGpD,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;QAEpC,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,oBAAoB,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,cAAmB,EAAE,EAAE,CAAC,IAAI,4BAAY,CAAC,cAAc,CAAC,CAAC,CAAC;QAEnH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YAC9D,GAAG,CAAC;YACJ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI;SACpB,CAAC,EAAE,EAAE,CAAC,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,cAAsC,EAAE;QACnD,MAAM,MAAM,GAAG,WAAW,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE;gBACxB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;aAC3C;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,oCAAoC,CAAC,kBAA4C;QAC7E,OAAO,IAAI,CAAC,+CAA+C,CAAC,EAAE,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED;;;;;OAKG;IACK,+CAA+C,CACnD,WAAmC,EAAE,kBAA4C,EAAE,KAAa;QAEhG,MAAM,YAAY,GAAc,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC;QAEhB,GAAG;YACC,WAAW,GAAG,IAAI,CAAC,6BAA6B,CAAC,WAAW,EAAE,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC;YAC3G,IAAI,CAAC,WAAW;gBAAE,MAAM;YAExB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC;YAErC,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE;gBAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,kBAAkB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChH,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;oBAClC,OAAO,MAAM,CAAC;iBACjB;aACJ;iBAAM;gBACH,OAAO,WAAW,CAAC;aACtB;YAED,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAClC,QAAQ,WAAW,EAAE;QAEtB,OAAO,EAAE,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,+BAA+B,CAAC,SAAoB;QAChD,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACvC,MAAM,oBAAoB,GAA6B,EAAE,CAAC;YAC1D,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACvC,oBAAoB,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC;aAClF;YACD,IAAI,CAAC,+BAA+B,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACH,qBAAqB,CAAC,EAAE,IAAI,EAAmB;QAC3C,MAAM,OAAO,GAAG;YACZ,KAAK,EAAE,IAAI,CAAC,oBAAoB;SACnC,CAAC;QAEF,oBAAoB;QACpB,MAAM,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;QAEzB,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAC1E,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;CACJ;AAxGD,0CAwGC"}

package/bayesian-node.d.ts

@@ -0,0 +1,76 @@
+import type { DataFrame } from 'danfojs-node';
+/**
+ * Bayesian network node definition.
+ */
+interface NodeDefinition {
+    /**
+     * Name of this node.
+     */
+    name: string;
+    /**
+     * Name of the current node's parent nodes.
+     */
+    parentNames: string[];
+    /**
+     * Array of possible values for this node.
+     */
+    possibleValues: string[];
+    /**
+     * Conditional probabilities for the `possibleValues`, given specified ancestor values.
+     */
+    conditionalProbabilities: any;
+}
+/**
+ * BayesianNode is an implementation of a single node in a bayesian network allowing sampling from its conditional distribution.
+ */
+export declare class BayesianNode {
+    private nodeDefinition;
+    /**
+     * @param nodeDefinition Node structure and distributions definition taken from the network definition file.
+     */
+    constructor(nodeDefinition: NodeDefinition);
+    toJSON(): NodeDefinition;
+    /**
+     * Extracts unconditional probabilities of node values given the values of the parent nodes
+     * @param parentValues Parent nodes values.
+     */
+    private getProbabilitiesGivenKnownValues;
+    /**
+     * Randomly samples from the given values using the given probabilities
+     * @param possibleValues A list of values to sample from.
+     * @param totalProbabilityOfPossibleValues Sum of probabilities of possibleValues in the conditional distribution.
+     * @param probabilities A dictionary of probabilities from the conditional distribution, indexed by the values.
+     */
+    private sampleRandomValueFromPossibilities;
+    /**
+     * Randomly samples from the conditional distribution of this node given values of parents
+     * @param parentValues Values of the parent nodes.
+     */
+    sample(parentValues?: {}): string;
+    /**
+     * Randomly samples from the conditional distribution of this node given restrictions on the possible
+     * values and the values of the parents.
+     * @param parentValues Values of the parent nodes.
+     * @param valuePossibilities List of possible values for this node.
+     * @param bannedValues What values of this node are banned.
+     */
+    sampleAccordingToRestrictions(parentValues: Record<string, string>, valuePossibilities: string[], bannedValues: string[]): string | false;
+    /**
+     * Sets the conditional probability distribution for this node to match the given data.
+     * @param dataframe A Danfo.js dataframe containing the data.
+     * @param possibleParentValues A dictionary of lists of possible values for parent nodes.
+     */
+    setProbabilitiesAccordingToData(dataframe: DataFrame, possibleParentValues?: Record<string, string[]>): void;
+    /**
+     * Recursively calculates the conditional probability distribution for this node from the data.
+     * @param dataframe A Danfo.js dataframe containing the data.
+     * @param possibleParentValues A dictionary of lists of possible values for parent nodes.
+     * @param depth Depth of the current recursive call.
+     */
+    private recursivelyCalculateConditionalProbabilitiesAccordingToData;
+    get name(): string;
+    get parentNames(): string[];
+    get possibleValues(): string[];
+}
+export {};
+//# sourceMappingURL=bayesian-node.d.ts.map

package/bayesian-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian-node.d.ts","sourceRoot":"","sources":["../src/bayesian-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAU,MAAM,cAAc,CAAC;AAmBtD;;GAEG;AACH,UAAU,cAAc;IACpB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB;;OAEG;IACH,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB;;OAEG;IACH,wBAAwB,EAAE,GAAG,CAAC;CACjC;AAED;;GAEG;AACH,qBAAa,YAAY;IACrB,OAAO,CAAC,cAAc,CAAiB;IAEvC;;OAEG;gBACS,cAAc,EAAE,cAAc;IAI1C,MAAM;IAIN;;;OAGG;IACH,OAAO,CAAC,gCAAgC;IAcxC;;;;;OAKG;IACH,OAAO,CAAC,kCAAkC;IAe1C;;;OAGG;IACH,MAAM,CAAC,YAAY,KAAK;IAOxB;;;;;;OAMG;IACH,6BAA6B,CAAC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,kBAAkB,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,GAAI,MAAM,GAAG,KAAK;IAiB1I;;;;OAIG;IACH,+BAA+B,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAM;IASzG;;;;;OAKG;IACH,OAAO,CAAC,2DAA2D;IAgCnE,IAAI,IAAI,IAAK,MAAM,CAElB;IAED,IAAI,WAAW,IAAK,MAAM,EAAE,CAE3B;IAED,IAAI,cAAc,IAAK,MAAM,EAAE,CAE9B;CACJ"}

package/{src/bayesian-node.js → bayesian-node.js}

@@ -1,63 +1,63 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BayesianNode = void 0;
 /**
 * Calculates relative frequencies of values of specific attribute from the given data
-* @param {object} dataframe - a Danfo.js dataframe containing the data
-* @param {string} attributeName - name of the attribute
-* @private
+* @param dataframe A Danfo.js dataframe containing the data.
+* @param attributeName Attribute name.
 */
 function getRelativeFrequencies(dataframe, attributeName) {
     const frequencies = {};
     const totalCount = dataframe.shape[0];
-    const valueCounts = dataframe[attributeName].value_counts();
-
+    const valueCounts = dataframe[attributeName].valueCounts();
     for (let index = 0; index < valueCounts.index.length; index++) {
         frequencies[valueCounts.index[index]] = valueCounts.values[index] / totalCount;
     }
-
     return frequencies;
 }
-
 /**
- * BayesianNode is an implementation of a single node in a bayesian network allowing
- * sampling from its conditional distribution.
+ * BayesianNode is an implementation of a single node in a bayesian network allowing sampling from its conditional distribution.
  */
 class BayesianNode {
     /**
-     * @param {object} nodeDefinition - node structure and distributions definition
-     *                                  taken from the network definition file
+     * @param nodeDefinition Node structure and distributions definition taken from the network definition file.
      */
     constructor(nodeDefinition) {
+        Object.defineProperty(this, "nodeDefinition", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: void 0
+        });
         this.nodeDefinition = nodeDefinition;
     }
-
+    toJSON() {
+        return this.nodeDefinition;
+    }
     /**
      * Extracts unconditional probabilities of node values given the values of the parent nodes
-     * @param {object} parentValues - values of the parent nodes
-     * @private
+     * @param parentValues Parent nodes values.
      */
-    _getProbabilitiesGivenKnownValues(parentValues = {}) {
+    getProbabilitiesGivenKnownValues(parentValues = {}) {
         let probabilities = this.nodeDefinition.conditionalProbabilities;
-
         for (const parentName of this.parentNames) {
             const parentValue = parentValues[parentName];
             if (parentValue in probabilities.deeper) {
                 probabilities = probabilities.deeper[parentValue];
-            } else {
+            }
+            else {
                 probabilities = probabilities.skip;
             }
         }
         return probabilities;
     }
-
     /**
      * Randomly samples from the given values using the given probabilities
-     * @param {array} possibleValues - a list of values to sample from
-     * @param {number} totalProbabilityOfPossibleValues - a sum of probabilities of possibleValues
-     *                                                    in the conditional distribution
-     * @param {object} probabilities - a dictionary of probabilities from the conditional distribution
-     *                                 indexed by the values
-     * @private
+     * @param possibleValues A list of values to sample from.
+     * @param totalProbabilityOfPossibleValues Sum of probabilities of possibleValues in the conditional distribution.
+     * @param probabilities A dictionary of probabilities from the conditional distribution, indexed by the values.
      */
-    _sampleRandomValueFromPossibilities(possibleValues, totalProbabilityOfPossibleValues, probabilities) {
+    sampleRandomValueFromPossibilities(possibleValues, totalProbabilityOfPossibleValues, probabilities) {
         let chosenValue = possibleValues[0];
         const anchor = Math.random() * totalProbabilityOfPossibleValues;
         let cumulativeProbability = 0;
@@ -68,30 +68,26 @@ class BayesianNode {
                 break;
             }
         }
-
         return chosenValue;
     }
-
     /**
      * Randomly samples from the conditional distribution of this node given values of parents
-     * @param {object} parentValues - values of the parent nodes
+     * @param parentValues Values of the parent nodes.
      */
     sample(parentValues = {}) {
-        const probabilities = this._getProbabilitiesGivenKnownValues(parentValues);
+        const probabilities = this.getProbabilitiesGivenKnownValues(parentValues);
         const possibleValues = Object.keys(probabilities);
-
-        return this._sampleRandomValueFromPossibilities(possibleValues, 1.0, probabilities);
+        return this.sampleRandomValueFromPossibilities(possibleValues, 1.0, probabilities);
     }
-
     /**
      * Randomly samples from the conditional distribution of this node given restrictions on the possible
      * values and the values of the parents.
-     * @param {object} parentValues - values of the parent nodes
-     * @param {object} valuePossibilities - a list of possible values for this node
-     * @param {object} bannedValues - what values of this node are banned
+     * @param parentValues Values of the parent nodes.
+     * @param valuePossibilities List of possible values for this node.
+     * @param bannedValues What values of this node are banned.
      */
     sampleAccordingToRestrictions(parentValues, valuePossibilities, bannedValues) {
-        const probabilities = this._getProbabilitiesGivenKnownValues(parentValues);
+        const probabilities = this.getProbabilitiesGivenKnownValues(parentValues);
         let totalProbability = 0.0;
         const validValues = [];
         const valuesInDistribution = Object.keys(probabilities);
@@ -102,81 +98,60 @@ class BayesianNode {
                 totalProbability += probabilities[value];
             }
         }
-
-        if (validValues.length === 0) return false;
-        return this._sampleRandomValueFromPossibilities(validValues, totalProbability, probabilities);
+        if (validValues.length === 0)
+            return false;
+        return this.sampleRandomValueFromPossibilities(validValues, totalProbability, probabilities);
     }
-
     /**
      * Sets the conditional probability distribution for this node to match the given data.
-     * @param {object} dataframe - a Danfo.js dataframe containing the data
-     * @param {object} possibleParentValues - a dictionary of lists of possible values for parent nodes
+     * @param dataframe A Danfo.js dataframe containing the data.
+     * @param possibleParentValues A dictionary of lists of possible values for parent nodes.
      */
     setProbabilitiesAccordingToData(dataframe, possibleParentValues = {}) {
         this.nodeDefinition.possibleValues = dataframe[this.name].unique().values;
-        this.nodeDefinition.conditionalProbabilities = this._recursivelyCalculateConditionalProbabilitiesAccordingToData(
-            dataframe,
-            possibleParentValues,
-            0,
-        );
+        this.nodeDefinition.conditionalProbabilities = this.recursivelyCalculateConditionalProbabilitiesAccordingToData(dataframe, possibleParentValues, 0);
     }
-
     /**
      * Recursively calculates the conditional probability distribution for this node from the data.
-     * @param {object} dataframe - a Danfo.js dataframe containing the data
-     * @param {object} possibleParentValues - a dictionary of lists of possible values for parent nodes
-     * @param {number} depth - depth of the recursive call
-     * @private
+     * @param dataframe A Danfo.js dataframe containing the data.
+     * @param possibleParentValues A dictionary of lists of possible values for parent nodes.
+     * @param depth Depth of the current recursive call.
      */
-    _recursivelyCalculateConditionalProbabilitiesAccordingToData(dataframe, possibleParentValues, depth) {
+    recursivelyCalculateConditionalProbabilitiesAccordingToData(dataframe, possibleParentValues, depth) {
         let probabilities = {
             deeper: {},
         };
-
         if (depth < this.parentNames.length) {
             const currentParentName = this.parentNames[depth];
             for (const possibleValue of possibleParentValues[currentParentName]) {
                 const skip = !dataframe[currentParentName].unique().values.includes(possibleValue);
                 let filteredDataframe = dataframe;
                 if (!skip) {
-                    filteredDataframe = dataframe.query({
-                        column: currentParentName,
-                        is: '==',
-                        to: possibleValue,
-                    });
+                    filteredDataframe = dataframe.query(dataframe[currentParentName].eq(possibleValue));
                 }
-                const nextLevel = this._recursivelyCalculateConditionalProbabilitiesAccordingToData(
-                    filteredDataframe,
-                    possibleParentValues,
-                    depth + 1,
-                );
-
+                const nextLevel = this.recursivelyCalculateConditionalProbabilitiesAccordingToData(filteredDataframe, possibleParentValues, depth + 1);
                 if (!skip) {
                     probabilities.deeper[possibleValue] = nextLevel;
-                } else {
+                }
+                else {
                     probabilities.skip = nextLevel;
                 }
             }
-        } else {
+        }
+        else {
             probabilities = getRelativeFrequencies(dataframe, this.name);
         }
-
         return probabilities;
     }
-
     get name() {
         return this.nodeDefinition.name;
     }
-
     get parentNames() {
         return this.nodeDefinition.parentNames;
     }
-
     get possibleValues() {
         return this.nodeDefinition.possibleValues;
     }
 }
-
-module.exports = {
-    BayesianNode,
-};
+exports.BayesianNode = BayesianNode;
+//# sourceMappingURL=bayesian-node.js.map

package/bayesian-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian-node.js","sourceRoot":"","sources":["../src/bayesian-node.ts"],"names":[],"mappings":";;;AAEA;;;;EAIE;AACF,SAAS,sBAAsB,CAAC,SAAoB,EAAE,aAAqB;IACvE,MAAM,WAAW,GAA4B,EAAE,CAAC;IAChD,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,WAAW,GAAI,SAAS,CAAC,aAAa,CAAY,CAAC,WAAW,EAAE,CAAC;IAEvE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAC3D,WAAW,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAY,GAAG,UAAU,CAAC;KAC9F;IAED,OAAO,WAAW,CAAC;AACvB,CAAC;AAwBD;;GAEG;AACH,MAAa,YAAY;IAGrB;;OAEG;IACH,YAAY,cAA8B;QAL1C;;;;;WAAuC;QAMnC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACzC,CAAC;IAED,MAAM;QACF,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACK,gCAAgC,CAAC,eAAuC,EAAE;QAC9E,IAAI,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,wBAAwB,CAAC;QAEjE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;YACvC,MAAM,WAAW,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;YAC7C,IAAI,WAAW,IAAI,aAAa,CAAC,MAAM,EAAE;gBACrC,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;aACrD;iBAAM;gBACH,aAAa,GAAG,aAAa,CAAC,IAAI,CAAC;aACtC;SACJ;QACD,OAAO,aAAa,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACK,kCAAkC,CAAC,cAAwB,EAAE,gCAAwC,EAAE,aAAqC;QAChJ,IAAI,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,gCAAgC,CAAC;QAChE,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE;YACxC,qBAAqB,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;YACtD,IAAI,qBAAqB,GAAG,MAAM,EAAE;gBAChC,WAAW,GAAG,aAAa,CAAC;gBAC5B,MAAM;aACT;SACJ;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,YAAY,GAAG,EAAE;QACpB,MAAM,aAAa,GAAG,IAAI,CAAC,gCAAgC,CAAC,YAAY,CAAC,CAAC;QAC1E,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAElD,OAAO,IAAI,CAAC,kCAAkC,CAAC,cAAc,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IACvF,CAAC;IAED;;;;;;OAMG;IACH,6BAA6B,CAAC,YAAoC,EAAE,kBAA4B,EAAE,YAAsB;QACpH,MAAM,aAAa,GAAG,IAAI,CAAC,gCAAgC,CAAC,YAAY,CAAC,CAAC;QAC1E,IAAI,gBAAgB,GAAG,GAAG,CAAC;QAC3B,MAAM,WAAW,GAAG,EAAE,CAAC;QACvB,MAAM,oBAAoB,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACxD,MAAM,cAAc,GAAG,kBAAkB,IAAI,oBAAoB,CAAC;QAClE,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;YAChC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,oBAAoB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBACvE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxB,gBAAgB,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC;aAC5C;SACJ;QAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,OAAO,IAAI,CAAC,kCAAkC,CAAC,WAAW,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACjG,CAAC;IAED;;;;OAIG;IACH,+BAA+B,CAAC,SAAoB,EAAE,uBAAiD,EAAE;QACrG,IAAI,CAAC,cAAc,CAAC,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;QAC1E,IAAI,CAAC,cAAc,CAAC,wBAAwB,GAAG,IAAI,CAAC,2DAA2D,CAC3G,SAAS,EACT,oBAAoB,EACpB,CAAC,CACJ,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,2DAA2D,CAAC,SAAoB,EAAE,oBAA8C,EAAE,KAAa;QACnJ,IAAI,aAAa,GAAG;YAChB,MAAM,EAAE,EAAE;SACN,CAAC;QAET,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;YACjC,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAClD,KAAK,MAAM,aAAa,IAAI,oBAAoB,CAAC,iBAAiB,CAAC,EAAE;gBACjE,MAAM,IAAI,GAAG,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;gBACnF,IAAI,iBAAiB,GAAG,SAAS,CAAC;gBAClC,IAAI,CAAC,IAAI,EAAE;oBACP,iBAAiB,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAc,CAAC;iBACpG;gBACD,MAAM,SAAS,GAAG,IAAI,CAAC,2DAA2D,CAC9E,iBAAiB,EACjB,oBAAoB,EACpB,KAAK,GAAG,CAAC,CACZ,CAAC;gBAEF,IAAI,CAAC,IAAI,EAAE;oBACP,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,SAAS,CAAC;iBACnD;qBAAM;oBACH,aAAa,CAAC,IAAI,GAAG,SAAS,CAAC;iBAClC;aACJ;SACJ;aAAM;YACH,aAAa,GAAG,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;SAChE;QAED,OAAO,aAAa,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;IACpC,CAAC;IAED,IAAI,WAAW;QACX,OAAO,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC;IAC3C,CAAC;IAED,IAAI,cAAc;QACd,OAAO,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC;IAC9C,CAAC;CACJ;AAvJD,oCAuJC"}

package/index.d.ts

@@ -0,0 +1,2 @@
+export { BayesianNetwork } from './bayesian-network';
+//# sourceMappingURL=index.d.ts.map

package/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC"}

package/index.js

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BayesianNetwork = void 0;
+var bayesian_network_1 = require("./bayesian-network");
+Object.defineProperty(exports, "BayesianNetwork", { enumerable: true, get: function () { return bayesian_network_1.BayesianNetwork; } });
+//# sourceMappingURL=index.js.map

package/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,uDAAqD;AAA5C,mHAAA,eAAe,OAAA"}

package/index.mjs

@@ -0,0 +1,4 @@
+import mod from "./index.js";
+
+export default mod;
+export const BayesianNetwork = mod.BayesianNetwork;

package/package.json

@@ -1,41 +1,37 @@
 {
-  "author": {
-    "name": "Apify"
-  },
-  "files": [
-    "src"
-  ],
-  "bugs": {
-    "url": "https://github.com/apify/generative-bayesian-network/issues"
-  },
-  "dependencies": {
-    "ow": "^0.23.0"
-  },
-  "description": "An implementation of a bayesian network usable for .",
-  "devDependencies": {
-    "@apify/eslint-config": "^0.1.3",
-    "eslint": "^7.19.0",
-    "fs-extra": "^9.1.0",
-    "jest": "^26.6.3",
-    "jsdoc-to-markdown": "^7.0.0",
-    "markdown-toc": "^1.2.0",
-    "jest-os-detection": "^1.3.1",
-    "danfojs-node": "^0.2.2"
-  },
-  "homepage": "https://github.com/apify/generative-bayesian-network#readme",
-  "license": "Apache-2.0",
-  "main": "src/main.js",
-  "name": "generative-bayesian-network",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/apify/generative-bayesian-network.git"
-  },
-  "scripts": {
-    "build-docs": "npm run build-toc && node docs/build-docs.js",
-    "build-toc": "markdown-toc docs/README.md -i",
-    "lint": "eslint ./src --ext .js,.jsx",
-    "lint:fix": "eslint ./src --ext .js,.jsx --fix",
-    "test": "jest --maxWorkers=3 --forceExit"
-  },
-  "version": "0.1.0-beta.3"
+    "name": "generative-bayesian-network",
+    "version": "2.0.0-dev.2",
+    "author": {
+        "name": "Apify"
+    },
+    "main": "index.js",
+    "module": "index.mjs",
+    "types": "index.d.ts",
+    "exports": {
+        ".": {
+            "import": "./index.mjs",
+            "require": "./index.js"
+        }
+    },
+    "bugs": {
+        "url": "https://github.com/apify/generative-bayesian-network/issues"
+    },
+    "dependencies": {
+        "adm-zip": "^0.5.9",
+        "danfojs-node": "^1.1.1"
+    },
+    "description": "An implementation of a bayesian network usable for .",
+    "homepage": "https://github.com/apify/generative-bayesian-network#readme",
+    "license": "Apache-2.0",
+    "repository": {
+        "type": "git",
+        "url": "git+https://github.com/apify/generative-bayesian-network.git"
+    },
+    "scripts": {
+        "build": "npm run clean && npm run compile",
+        "clean": "rimraf ./dist",
+        "compile": "tsc -p tsconfig.build.json && gen-esm-wrapper ./index.js ./index.mjs",
+        "copy": "ts-node -T ../../scripts/copy.ts"
+    },
+    "gitHead": "fcabade6175f3098cf3e314dd5c3542972956652"
 }

package/tsconfig.build.tsbuildinfo

@@ -0,0 +1 @@
+{"program":{"fileNames":["../../../node_modules/typescript/lib/lib.es5.d.ts","../../../node_modules/typescript/lib/lib.es2015.d.ts","../../../node_modules/typescript/lib/lib.es2016.d.ts","../../../node_modules/typescript/lib/lib.es2017.d.ts","../../../node_modules/typescript/lib/lib.es2018.d.ts","../../../node_modules/typescript/lib/lib.es2019.d.ts","../../../node_modules/typescript/lib/lib.es2020.d.ts","../../../node_modules/typescript/lib/lib.es2021.d.ts","../../../node_modules/typescript/lib/lib.es2022.d.ts","../../../node_modules/typescript/lib/lib.esnext.d.ts","../../../node_modules/typescript/lib/lib.dom.d.ts","../../../node_modules/typescript/lib/lib.es2015.core.d.ts","../../../node_modules/typescript/lib/lib.es2015.collection.d.ts","../../../node_modules/typescript/lib/lib.es2015.generator.d.ts","../../../node_modules/typescript/lib/lib.es2015.iterable.d.ts","../../../node_modules/typescript/lib/lib.es2015.promise.d.ts","../../../node_modules/typescript/lib/lib.es2015.proxy.d.ts","../../../node_modules/typescript/lib/lib.es2015.reflect.d.ts","../../../node_modules/typescript/lib/lib.es2015.symbol.d.ts","../../../node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts","../../../node_modules/typescript/lib/lib.es2016.array.include.d.ts","../../../node_modules/typescript/lib/lib.es2017.object.d.ts","../../../node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts","../../../node_modules/typescript/lib/lib.es2017.string.d.ts","../../../node_modules/typescript/lib/lib.es2017.intl.d.ts","../../../node_modules/typescript/lib/lib.es2017.typedarrays.d.ts","../../../node_modules/typescript/lib/lib.es2018.asyncgenerator.d.ts","../../../node_modules/typescript/lib/lib.es2018.asynciterable.d.ts","../../../node_modules/typescript/lib/lib.es2018.intl.d.ts","../../../node_modules/typescript/lib/lib.es2018.promise.d.ts","../../../node_modules/typescript/lib/lib.es2018.regexp.d.ts","../../../node_modules/typescript/lib/lib.es2019.array.d.ts","../../../node_modules/typescript/lib/lib.es2019.object.d.ts","../../../node_modules/typescript/lib/lib.es2019.string.d.ts","../../../node_modules/typescript/lib/lib.es2019.symbol.d.ts","../../../node_modules/typescript/lib/lib.es2020.bigint.d.ts","../../../node_modules/typescript/lib/lib.es2020.date.d.ts","../../../node_modules/typescript/lib/lib.es2020.promise.d.ts","../../../node_modules/typescript/lib/lib.es2020.sharedmemory.d.ts","../../../node_modules/typescript/lib/lib.es2020.string.d.ts","../../../node_modules/typescript/lib/lib.es2020.symbol.wellknown.d.ts","../../../node_modules/typescript/lib/lib.es2020.intl.d.ts","../../../node_modules/typescript/lib/lib.es2020.number.d.ts","../../../node_modules/typescript/lib/lib.es2021.promise.d.ts","../../../node_modules/typescript/lib/lib.es2021.string.d.ts","../../../node_modules/typescript/lib/lib.es2021.weakref.d.ts","../../../node_modules/typescript/lib/lib.es2021.intl.d.ts","../../../node_modules/typescript/lib/lib.es2022.array.d.ts","../../../node_modules/typescript/lib/lib.es2022.error.d.ts","../../../node_modules/typescript/lib/lib.es2022.intl.d.ts","../../../node_modules/typescript/lib/lib.es2022.object.d.ts","../../../node_modules/typescript/lib/lib.es2022.string.d.ts","../../../node_modules/typescript/lib/lib.esnext.intl.d.ts","../../../node_modules/tslib/tslib.d.ts","../../../node_modules/table/dist/types/api.d.ts","../../../node_modules/table/dist/createStream.d.ts","../../../node_modules/table/dist/getBorderCharacters.d.ts","../../../node_modules/table/dist/table.d.ts","../../../node_modules/table/dist/index.d.ts","../../../node_modules/@types/node/assert.d.ts","../../../node_modules/@types/node/assert/strict.d.ts","../../../node_modules/@types/node/globals.d.ts","../../../node_modules/@types/node/async_hooks.d.ts","../../../node_modules/@types/node/buffer.d.ts","../../../node_modules/@types/node/child_process.d.ts","../../../node_modules/@types/node/cluster.d.ts","../../../node_modules/@types/node/console.d.ts","../../../node_modules/@types/node/constants.d.ts","../../../node_modules/@types/node/crypto.d.ts","../../../node_modules/@types/node/dgram.d.ts","../../../node_modules/@types/node/diagnostics_channel.d.ts","../../../node_modules/@types/node/dns.d.ts","../../../node_modules/@types/node/dns/promises.d.ts","../../../node_modules/@types/node/domain.d.ts","../../../node_modules/@types/node/events.d.ts","../../../node_modules/@types/node/fs.d.ts","../../../node_modules/@types/node/fs/promises.d.ts","../../../node_modules/@types/node/http.d.ts","../../../node_modules/@types/node/http2.d.ts","../../../node_modules/@types/node/https.d.ts","../../../node_modules/@types/node/inspector.d.ts","../../../node_modules/@types/node/module.d.ts","../../../node_modules/@types/node/net.d.ts","../../../node_modules/@types/node/os.d.ts","../../../node_modules/@types/node/path.d.ts","../../../node_modules/@types/node/perf_hooks.d.ts","../../../node_modules/@types/node/process.d.ts","../../../node_modules/@types/node/punycode.d.ts","../../../node_modules/@types/node/querystring.d.ts","../../../node_modules/@types/node/readline.d.ts","../../../node_modules/@types/node/repl.d.ts","../../../node_modules/@types/node/stream.d.ts","../../../node_modules/@types/node/stream/promises.d.ts","../../../node_modules/@types/node/stream/consumers.d.ts","../../../node_modules/@types/node/stream/web.d.ts","../../../node_modules/@types/node/string_decoder.d.ts","../../../node_modules/@types/node/timers.d.ts","../../../node_modules/@types/node/timers/promises.d.ts","../../../node_modules/@types/node/tls.d.ts","../../../node_modules/@types/node/trace_events.d.ts","../../../node_modules/@types/node/tty.d.ts","../../../node_modules/@types/node/url.d.ts","../../../node_modules/@types/node/util.d.ts","../../../node_modules/@types/node/v8.d.ts","../../../node_modules/@types/node/vm.d.ts","../../../node_modules/@types/node/wasi.d.ts","../../../node_modules/@types/node/worker_threads.d.ts","../../../node_modules/@types/node/zlib.d.ts","../../../node_modules/@types/node/globals.global.d.ts","../../../node_modules/@types/node/index.d.ts","../../../node_modules/form-data/index.d.ts","../../../node_modules/@types/node-fetch/externals.d.ts","../../../node_modules/@types/node-fetch/index.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/strings.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/datetime.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/series.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/frame.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/aggregators/groupby.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/shared/types.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/shared/config.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/generic.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/shared/utils.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/shared/tensorflowlib.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/scalers/min.max.scaler.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/scalers/standard.scaler.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/encoders/label.encoder.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/encoders/one.hot.encoder.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/encoders/dummy.encoder.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/concat.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/transformers/merge.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/core/daterange.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/index.d.ts","../../../node_modules/danfojs-node/dist/danfojs-node/src/core/frame.d.ts","../../../node_modules/danfojs-node/dist/danfojs-node/src/streams/csv.stream.transformer.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/io/node/io.csv.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/io/node/io.json.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/io/node/io.excel.d.ts","../../../node_modules/danfojs-node/dist/danfojs-base/io/node/index.d.ts","../../../node_modules/danfojs-node/dist/danfojs-node/src/core/series.d.ts","../../../node_modules/danfojs-node/dist/danfojs-node/src/index.d.ts","../../../node_modules/@types/adm-zip/util.d.ts","../../../node_modules/@types/adm-zip/index.d.ts","../src/bayesian-node.ts","../src/bayesian-network.ts","../src/index.ts","../../../node_modules/@babel/types/lib/index.d.ts","../../../node_modules/@types/babel__generator/index.d.ts","../../../node_modules/@babel/parser/typings/babel-parser.d.ts","../../../node_modules/@types/babel__template/index.d.ts","../../../node_modules/@types/babel__traverse/index.d.ts","../../../node_modules/@types/babel__core/index.d.ts","../../../node_modules/@types/graceful-fs/index.d.ts","../../../node_modules/@types/istanbul-lib-coverage/index.d.ts","../../../node_modules/@types/istanbul-lib-report/index.d.ts","../../../node_modules/@types/istanbul-reports/index.d.ts","../../../node_modules/chalk/index.d.ts","../../../node_modules/jest-diff/build/cleanupSemantic.d.ts","../../../node_modules/pretty-format/build/types.d.ts","../../../node_modules/pretty-format/build/index.d.ts","../../../node_modules/jest-diff/build/types.d.ts","../../../node_modules/jest-diff/build/diffLines.d.ts","../../../node_modules/jest-diff/build/printDiffs.d.ts","../../../node_modules/jest-diff/build/index.d.ts","../../../node_modules/jest-matcher-utils/build/index.d.ts","../../../node_modules/@types/jest/index.d.ts","../../../node_modules/@types/json-schema/index.d.ts","../../../node_modules/@types/json5/index.d.ts","../../../node_modules/@types/long/index.d.ts","../../../node_modules/@types/minimatch/index.d.ts","../../../node_modules/@types/minimist/index.d.ts","../../../node_modules/@types/normalize-package-data/index.d.ts","../../../node_modules/@types/offscreencanvas/index.d.ts","../../../node_modules/@types/parse-json/index.d.ts","../../../node_modules/@types/prettier/index.d.ts","../../../node_modules/@types/puppeteer/index.d.ts","../../../node_modules/@types/seedrandom/index.d.ts","../../../node_modules/@types/stack-utils/index.d.ts","../../../node_modules/@types/useragent/index.d.ts","../../../node_modules/@types/webgl-ext/index.d.ts","../../../node_modules/@types/webgl2/index.d.ts","../../../node_modules/@types/yargs-parser/index.d.ts","../../../node_modules/@types/yargs/index.d.ts","../../../node_modules/@types/yauzl/index.d.ts"],"fileInfos":[{"version":"f5c28122bee592cfaf5c72ed7bcc47f453b79778ffa6e301f45d21a0970719d4","affectsGlobalScope":true},"dc47c4fa66b9b9890cf076304de2a9c5201e94b740cffdf09f87296d877d71f6","7a387c58583dfca701b6c85e0adaf43fb17d590fb16d5b2dc0a2fbd89f35c467","8a12173c586e95f4433e0c6dc446bc88346be73ffe9ca6eec7aa63c8f3dca7f9","5f4e733ced4e129482ae2186aae29fde948ab7182844c3a5a51dd346182c7b06","e6b724280c694a9f588847f754198fb96c43d805f065c3a5b28bbc9594541c84","1fc5ab7a764205c68fa10d381b08417795fc73111d6dd16b5b1ed36badb743d9","746d62152361558ea6d6115cf0da4dd10ede041d14882ede3568bce5dc4b4f1f","3eb679a56cab01203a1ba7edeade937f6a2a4c718513b2cd930b579807fa9359","aea179452def8a6152f98f63b191b84e7cbd69b0e248c91e61fb2e52328abe8c",{"version":"3f149f903dd20dfeb7c80e228b659f0e436532de772469980dbd00702cc05cc1","affectsGlobalScope":true},{"version":"adb996790133eb33b33aadb9c09f15c2c575e71fb57a62de8bf74dbf59ec7dfb","affectsGlobalScope":true},{"version":"43fb1d932e4966a39a41b464a12a81899d9ae5f2c829063f5571b6b87e6d2f9c","affectsGlobalScope":true},{"version":"cdccba9a388c2ee3fd6ad4018c640a471a6c060e96f1232062223063b0a5ac6a","affectsGlobalScope":true},{"version":"c5c05907c02476e4bde6b7e76a79ffcd948aedd14b6a8f56e4674221b0417398","affectsGlobalScope":true},{"version":"0d5f52b3174bee6edb81260ebcd792692c32c81fd55499d69531496f3f2b25e7","affectsGlobalScope":true},{"version":"810627a82ac06fb5166da5ada4159c4ec11978dfbb0805fe804c86406dab8357","affectsGlobalScope":true},{"version":"181f1784c6c10b751631b24ce60c7f78b20665db4550b335be179217bacc0d5f","affectsGlobalScope":true},{"version":"3013574108c36fd3aaca79764002b3717da09725a36a6fc02eac386593110f93","affectsGlobalScope":true},{"version":"75ec0bdd727d887f1b79ed6619412ea72ba3c81d92d0787ccb64bab18d261f14","affectsGlobalScope":true},{"version":"3be5a1453daa63e031d266bf342f3943603873d890ab8b9ada95e22389389006","affectsGlobalScope":true},{"version":"17bb1fc99591b00515502d264fa55dc8370c45c5298f4a5c2083557dccba5a2a","affectsGlobalScope":true},{"version":"7ce9f0bde3307ca1f944119f6365f2d776d281a393b576a18a2f2893a2d75c98","affectsGlobalScope":true},{"version":"6a6b173e739a6a99629a8594bfb294cc7329bfb7b227f12e1f7c11bc163b8577","affectsGlobalScope":true},{"version":"12a310447c5d23c7d0d5ca2af606e3bd08afda69100166730ab92c62999ebb9d","affectsGlobalScope":true},{"version":"b0124885ef82641903d232172577f2ceb5d3e60aed4da1153bab4221e1f6dd4e","affectsGlobalScope":true},{"version":"0eb85d6c590b0d577919a79e0084fa1744c1beba6fd0d4e951432fa1ede5510a","affectsGlobalScope":true},{"version":"da233fc1c8a377ba9e0bed690a73c290d843c2c3d23a7bd7ec5cd3d7d73ba1e0","affectsGlobalScope":true},{"version":"d154ea5bb7f7f9001ed9153e876b2d5b8f5c2bb9ec02b3ae0d239ec769f1f2ae","affectsGlobalScope":true},{"version":"bb2d3fb05a1d2ffbca947cc7cbc95d23e1d053d6595391bd325deb265a18d36c","affectsGlobalScope":true},{"version":"c80df75850fea5caa2afe43b9949338ce4e2de086f91713e9af1a06f973872b8","affectsGlobalScope":true},{"version":"9d57b2b5d15838ed094aa9ff1299eecef40b190722eb619bac4616657a05f951","affectsGlobalScope":true},{"version":"6c51b5dd26a2c31dbf37f00cfc32b2aa6a92e19c995aefb5b97a3a64f1ac99de","affectsGlobalScope":true},{"version":"6e7997ef61de3132e4d4b2250e75343f487903ddf5370e7ce33cf1b9db9a63ed","affectsGlobalScope":true},{"version":"2ad234885a4240522efccd77de6c7d99eecf9b4de0914adb9a35c0c22433f993","affectsGlobalScope":true},{"version":"09aa50414b80c023553090e2f53827f007a301bc34b0495bfb2c3c08ab9ad1eb","affectsGlobalScope":true},{"version":"d7f680a43f8cd12a6b6122c07c54ba40952b0c8aa140dcfcf32eb9e6cb028596","affectsGlobalScope":true},{"version":"3787b83e297de7c315d55d4a7c546ae28e5f6c0a361b7a1dcec1f1f50a54ef11","affectsGlobalScope":true},{"version":"e7e8e1d368290e9295ef18ca23f405cf40d5456fa9f20db6373a61ca45f75f40","affectsGlobalScope":true},{"version":"faf0221ae0465363c842ce6aa8a0cbda5d9296940a8e26c86e04cc4081eea21e","affectsGlobalScope":true},{"version":"06393d13ea207a1bfe08ec8d7be562549c5e2da8983f2ee074e00002629d1871","affectsGlobalScope":true},{"version":"cd483c056da900716879771893a3c9772b66c3c88f8943b4205aec738a94b1d0","affectsGlobalScope":true},{"version":"b248e32ca52e8f5571390a4142558ae4f203ae2f94d5bac38a3084d529ef4e58","affectsGlobalScope":true},{"version":"6c55633c733c8378db65ac3da7a767c3cf2cf3057f0565a9124a16a3a2019e87","affectsGlobalScope":true},{"version":"fb4416144c1bf0323ccbc9afb0ab289c07312214e8820ad17d709498c865a3fe","affectsGlobalScope":true},{"version":"5b0ca94ec819d68d33da516306c15297acec88efeb0ae9e2b39f71dbd9685ef7","affectsGlobalScope":true},{"version":"ff667ee99e5a28c3dc5063a3cfd4d3436699e3fb035d4451037da7f567da542a","affectsGlobalScope":true},{"version":"34478567f8a80171f88f2f30808beb7da15eac0538ae91282dd33dce928d98ed","affectsGlobalScope":true},{"version":"6ea9ab679ea030cf46c16a711a316078e9e02619ebaf07a7fcd16964aba88f2d","affectsGlobalScope":true},{"version":"6bda95ea27a59a276e46043b7065b55bd4b316c25e70e29b572958fa77565d43","affectsGlobalScope":true},{"version":"aedb8de1abb2ff1095c153854a6df7deae4a5709c37297f9d6e9948b6806fa66","affectsGlobalScope":true},{"version":"11ffe3c281f375fff9ffdde8bbec7669b4dd671905509079f866f2354a788064","affectsGlobalScope":true},{"version":"c37f8a49593a0030eecb51bbfa270e709bec9d79a6cc3bb851ef348d4e6b26f8","affectsGlobalScope":true},"4576b4e61049f5ffd7c9e935cf88832e089265bdb15ffc35077310042cbbbeea","db9694641f29e0f111295746a163919a65a6888134f3371a1ae8d3b0cf0bc4a9","90747c589a64ccb08d72aed5dc235de9aeb725a85c5982514f2c7fb807bcdb42","0f795f93a2af6dc07587a92c1b4e6a9c0cf75d42274c30964a9c12e5d34fe739","e4badf9107d538cf7d598d76c7f1250cec594e31dda987c1c0570e09f52206d0","da246e9a2cedd122d5ba2bbfad53ce2aee3c8666c3c647b6bc2d38b1218ce701","0cba3a5d7b81356222594442753cf90dd2892e5ccfe1d262aaca6896ba6c1380","a69c09dbea52352f479d3e7ac949fde3d17b195abe90b045d619f747b38d6d1a",{"version":"77f0b5c6a193a699c9f7d7fb0578e64e562d271afa740783665d2a827104a873","affectsGlobalScope":true},"e5979905796fe2740d85fbaf4f11f42b7ee1851421afe750823220813421b1af",{"version":"fcdcb42da18dd98dc286b1876dd425791772036012ae61263c011a76b13a190f","affectsGlobalScope":true},"1dab5ab6bcf11de47ab9db295df8c4f1d92ffa750e8f095e88c71ce4c3299628","f71f46ccd5a90566f0a37b25b23bc4684381ab2180bdf6733f4e6624474e1894",{"version":"54e65985a3ee3cec182e6a555e20974ea936fc8b8d1738c14e8ed8a42bd921d4","affectsGlobalScope":true},"82408ed3e959ddc60d3e9904481b5a8dc16469928257af22a3f7d1a3bc7fd8c4","5b30f550565fd0a7524282c81c27fe8534099e2cd26170ca80852308f07ae68d","34e5de87d983bc6aefef8b17658556e3157003e8d9555d3cb098c6bef0b5fbc8","d97cd8a4a42f557fc62271369ed0461c8e50d47b7f9c8ad0b5462f53306f6060","f27371653aded82b2b160f7a7033fb4a5b1534b6f6081ef7be1468f0f15327d3","c762cd6754b13a461c54b59d0ae0ab7aeef3c292c6cf889873f786ee4d8e75c9","f4ea7d5df644785bd9fbf419930cbaec118f0d8b4160037d2339b8e23c059e79",{"version":"bfea28e6162ed21a0aeed181b623dcf250aa79abf49e24a6b7e012655af36d81","affectsGlobalScope":true},"b8aca9d0c81abb02bec9b7621983ae65bde71da6727580070602bd2500a9ce2a","ae97e20f2e10dbeec193d6a2f9cd9a367a1e293e7d6b33b68bacea166afd7792","10d4796a130577d57003a77b95d8723530bbec84718e364aa2129fa8ffba0378","063f53ff674228c190efa19dd9448bcbd540acdbb48a928f4cf3a1b9f9478e43","bf73c576885408d4a176f44a9035d798827cc5020d58284cb18d7573430d9022","7ae078ca42a670445ae0c6a97c029cb83d143d62abd1730efb33f68f0b2c0e82",{"version":"e8b18c6385ff784228a6f369694fcf1a6b475355ba89090a88de13587a9391d5","affectsGlobalScope":true},"963fe86b2ebd07a34b92b52c6532ab45ec5ccda218a6c477de354fcad2aae0cb","12eea70b5e11e924bb0543aea5eadc16ced318aa26001b453b0d561c2fd0bd1e","08777cd9318d294646b121838574e1dd7acbb22c21a03df84e1f2c87b1ad47f2","08a90bcdc717df3d50a2ce178d966a8c353fd23e5c392fd3594a6e39d9bb6304",{"version":"9f8dd3922db205bc8a362a6b18078708fd699185b11648522159cbf3743561b5","affectsGlobalScope":true},"2a12d2da5ac4c4979401a3f6eaafa874747a37c365e4bc18aa2b171ae134d21b","002b837927b53f3714308ecd96f72ee8a053b8aeb28213d8ec6de23ed1608b66","1dc9c847473bb47279e398b22c740c83ea37a5c88bf66629666e3cf4c5b9f99c","a9e4a5a24bf2c44de4c98274975a1a705a0abbaad04df3557c2d3cd8b1727949","821dcb2b571bf698841d8ec25fde9d5f615ef3958957227962602f9dbfa8d800","1b952304137851e45bc009785de89ada562d9376177c97e37702e39e60c2f1ff",{"version":"806ef4cac3b3d9fa4a48d849c8e084d7c72fcd7b16d76e06049a9ed742ff79c0","affectsGlobalScope":true},"44b8b584a338b190a59f4f6929d072431950c7bd92ec2694821c11bce180c8a5","5f0ed51db151c2cdc4fa3bb0f44ce6066912ad001b607a34e65a96c52eb76248",{"version":"af9771b066ec35ffa1c7db391b018d2469d55e51b98ae95e62b6cbef1b0169ca","affectsGlobalScope":true},"664d8f2d59164f2e08c543981453893bc7e003e4dfd29651ce09db13e9457980","103d70bfbeb3cd3a3f26d1705bf986322d8738c2c143f38ebb743b1e228d7444","f52fbf64c7e480271a9096763c4882d356b05cab05bf56a64e68a95313cd2ce2","59bdb65f28d7ce52ccfc906e9aaf422f8b8534b2d21c32a27d7819be5ad81df7",{"version":"3a2da34079a2567161c1359316a32e712404b56566c45332ac9dcee015ecce9f","affectsGlobalScope":true},"28a2e7383fd898c386ffdcacedf0ec0845e5d1a86b5a43f25b86bc315f556b79","3aff9c8c36192e46a84afe7b926136d520487155154ab9ba982a8b544ea8fc95","a880cf8d85af2e4189c709b0fea613741649c0e40fffb4360ec70762563d5de0","85bbf436a15bbeda4db888be3062d47f99c66fd05d7c50f0f6473a9151b6a070","9f9c49c95ecd25e0cb2587751925976cf64fd184714cb11e213749c80cf0f927","f0c75c08a71f9212c93a719a25fb0320d53f2e50ca89a812640e08f8ad8c408c",{"version":"ab9b9a36e5284fd8d3bf2f7d5fcbc60052f25f27e4d20954782099282c60d23e","affectsGlobalScope":true},"aee3379fb20741a337a779530cc3e608aba5f34776511033d1d2db7ca45c4193","736097ddbb2903bef918bb3b5811ef1c9c5656f2a73bd39b22a91b9cc2525e50","208bb742e0f201470da121bc73847c74b62cff4172f38ae5949ae77d6c9c6b71","3663d1b50f356656a314e5df169bb51cb9d5fd75905fa703f75db6bb32030568","3dc3b72a8f4c563df5c7458e537b6ea6c66187bf9fa4861619b5cb30a3cb2b1c","0586cfb5a4056ee62c60f727d58a73367e4bbc9c22edd35290784fe92ad18d91","ae6ebb482f2d155b54aea394e8dfc54f12b1f51a298c4dfc7c7a066ef75a2db8","e61f756f59161bc73fb0a0c8349a307eb1d972f5a68bbd74f62a766d4e6fff15","7f82006a244abf1c1889ce5102f08528d99accc4af41fc7e00d8eaba9f1632ec","fe2a2227dc41dedfa3cfb4cd3b3082ec0abb8f3315fdf6a735d8a4949575b448","42e7c25f7ed40d124f52ddba93f616756e0af28a546f70a115b629b840788290","5c82939ee86589dc0f0ee179819cc000b0f82b29111eb4aaa3272565622aa87a","38ef6b9e6fde966d12b4767b5953d8cd2d91d91a41f17d4d6e301d7e5e10a4d4","eb13213caa0daec7883dfd5410703e6bff59a6e25610922444b4b56e3ba01c73","a31ef24d5572c3b810a9d83e2e3ff0844aa5ae8379aa35da3fec07886734bd1e","38238f5148c3e5fd6774049587b1be427f56a33858fe15bac1a1226d5ef73659","0412823b628aba36d768befa95dc87a5459cf555e0c582148b003f37cf8df112","8f3661f770c998f4daccbd391e1bf8ca2281c38626ed5f4aa872e39f192690fd","26394f8ec0157a4272a5f5e25126802dc5602a3a6b13e53420beef863f07adbc","e38579df34197fed1360f8a0c9f45a53de798bd27d93b24b1cf9ac3aeb6946a6","b67a32c2c005699808d916010028a339d3e8f04744ed5fe3be44167ea673d2da","467454238252d6091a9b51744bb89a35897fe9e6ffdfcd0c831b00d1214fb6e4","b019dafd084284e011f997aa4f7ec815028bcc13d13ee3f4880a908059901e9c","abc4a6548691f1c5d80baf1284b951694017f9a3e04b4146aa26d41a904c49c0","060844490d30b34e0bb4e35947194ac0c7bc7238decfe09771620224bbd16ca2","73d606873b27cac730ed51ec493bc0a8f88cb4d31a71384718bd63917671f035","7eb124b879b9cd042a88f6664cea1d23c1c498d660d222e0d0c517e38d189b93","4ac1de6afc5f0ceebcf5062e2769ad84a7061287d56b1396990c0531314e84a5","3b95d3f9f41601e1241f081074e9e710ccd9e290d09af94b5f2b8ab030c827bc","1d4e8370bfca7933a8990ae7fbeb3d973cae8eab52ab8504e07602393b0f5a8e","6f68103a4b7ee58ade1e1394adb7f3b4befb975657889d0ab8b734f0a4f4fbfa","0e0b0baaf6e3845418c2741c9b47478cf6fc086ef8dd5ad4b9ab91499e51de28","ca6e8a62a3e4f5cc3fea6ab45c2e5e128db4d90d81d70547a65047e3f13996f1",{"version":"29e3580b6b483054f690e6447a0e63fb4bd292dc50175abb5ac4b2a26f15e2a9","signature":"3fcb1d1dda1c7db768ba67903b685757c01b68e061f609989d27de383fc01f5b"},{"version":"fa79e8211fca3c20583742e6fb41de3b611df8e8756cc49f30c5d56c181941bb","signature":"98e952c28558e6c57598e0ad2f7a5f9271c87f8f6875a7daed7acbfcd57b0a3d"},"b36fed136ab154cc5f53c60b33b1b0a8615d2ff5ea2a57d806fe2be858e4fb97","e432b56911b58550616fc4d54c1606f65fe98c74875b81d74601f5f965767c60","cc957354aa3c94c9961ebf46282cfde1e81d107fc5785a61f62c67f1dd3ac2eb","a46a2e69d12afe63876ec1e58d70e5dbee6d3e74132f4468f570c3d69f809f1c","93de1c6dab503f053efe8d304cb522bb3a89feab8c98f307a674a4fae04773e9","fc72135da24040641388fb5f2c2a7a99aa5b962c0fa125bd96fabeec63dd2e63","5426e62886b7be7806312d31a00e8f7dccd6fe63ba9bbefe99ee2eab29cc48a3","3ebae8c00411116a66fca65b08228ea0cf0b72724701f9b854442100aab55aba","8b06ac3faeacb8484d84ddb44571d8f410697f98d7bfa86c0fda60373a9f5215","7eb06594824ada538b1d8b48c3925a83e7db792f47a081a62cf3e5c4e23cf0ee","f5638f7c2f12a9a1a57b5c41b3c1ea7db3876c003bab68e6a57afd6bcc169af0","0d14fa22c41fdc7277e6f71473b20ebc07f40f00e38875142335d5b63cdfc9d2","d8aab31ba8e618cc3eea10b0945de81cb93b7e8150a013a482332263b9305322","462bccdf75fcafc1ae8c30400c9425e1a4681db5d605d1a0edb4f990a54d8094","5923d8facbac6ecf7c84739a5c701a57af94a6f6648d6229a6c768cf28f0f8cb","7adecb2c3238794c378d336a8182d4c3dd2c4fa6fa1785e2797a3db550edea62","dc12dc0e5aa06f4e1a7692149b78f89116af823b9e1f1e4eae140cd3e0e674e6","1bfc6565b90c8771615cd8cfcf9b36efc0275e5e83ac7d9181307e96eb495161","8a8a96898906f065f296665e411f51010b51372fa260d5373bf9f64356703190","7f82ef88bdb67d9a850dd1c7cd2d690f33e0f0acd208e3c9eba086f3670d4f73",{"version":"4564f780fd20582c57ae218a4cd017717181ab0e228639d905ef054288655b5e","affectsGlobalScope":true},"f3e604694b624fa3f83f6684185452992088f5efb2cf136b62474aa106d6f1b6","96d14f21b7652903852eef49379d04dbda28c16ed36468f8c9fa08f7c14c9538","0e60e0cbf2283adfd5a15430ae548cd2f662d581b5da6ecd98220203e7067c70","8841e2aa774b89bd23302dede20663306dc1b9902431ac64b24be8b8d0e3f649","209e814e8e71aec74f69686a9506dd7610b97ab59dcee9446266446f72a76d05","6fa0008bf91a4cc9c8963bace4bba0bd6865cbfa29c3e3ccc461155660fb113a",{"version":"fc35a74dd14f55d6fea9e5a4804ae812d559519352fa3836eb5f5555a64dd0ac","affectsGlobalScope":true},"2b8264b2fefd7367e0f20e2c04eed5d3038831fe00f5efbc110ff0131aab899b","f1d8b21cdf08726021c8cce0cd6159486236cf1d633eeabbc435b5b2e5869c2e","dd432baba70577d8ef35db945b4e5e536013d73e3e8595683aafc277bf226f75","1268e311431a3b23db043921bb743be87f3ec0acb2d675564d7961620f4569e0","b0d10e46cfe3f6c476b69af02eaa38e4ccc7430221ce3109ae84bb9fb8282298","48220b3395376205a0938f3f23c363a1084e86534caaec82b885efb1e0407408",{"version":"49febed15cc962e5823a8b0781f0fcd8f5f63f6bcadcdda5e30e4d173ce738d4","affectsGlobalScope":true},{"version":"6e0d9ddfdf1488763a9f32c960ddf6de227421099266c6e2a3c580a7478547be","affectsGlobalScope":true},"70e9a18da08294f75bf23e46c7d69e67634c0765d355887b9b41f0d959e1426e","105b9a2234dcb06ae922f2cd8297201136d416503ff7d16c72bfc8791e9895c1","65dfa4bc49ccd1355789abb6ae215b302a5b050fdee9651124fe7e826f33113c"],"options":{"allowSyntheticDefaultImports":true,"declaration":true,"declarationMap":true,"emitDecoratorMetadata":true,"esModuleInterop":true,"experimentalDecorators":true,"importHelpers":true,"importsNotUsedAsValues":0,"module":1,"newLine":1,"noEmitHelpers":true,"noFallthroughCasesInSwitch":true,"noImplicitOverride":true,"noImplicitReturns":true,"noUnusedLocals":true,"noUnusedParameters":true,"outDir":"./","preserveConstEnums":true,"removeComments":false,"skipLibCheck":true,"sourceMap":true,"strict":true,"target":7,"useDefineForClassFields":true},"fileIdsList":[[103,146],[103],[76,103,110,141],[103,146,147,148,149,150],[103,146,148],[76,103,110],[103,153],[103,154],[103,159,164],[78,102,103,110,111,112],[60,103],[63,103],[64,69,103],[65,75,76,83,92,102,103],[65,66,75,83,103],[67,103],[68,69,76,84,103],[69,92,99,103],[70,72,75,83,103],[71,103],[72,73,103],[74,75,103],[75,103],[75,76,77,92,102,103],[75,76,77,92,103],[103,107],[78,83,92,102,103],[75,76,78,79,83,92,99,102,103],[78,80,92,99,102,103],[60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109],[75,81,103],[82,102,103],[72,75,83,92,103],[84,103],[85,103],[63,86,103],[87,101,103,107],[88,103],[89,103],[75,90,103],[90,91,103,105],[75,92,93,94,103],[92,94,103],[92,93,103],[95,103],[96,103],[75,97,98,103],[97,98,103],[69,83,92,99,103],[100,103],[83,101,103],[64,78,89,102,103],[69,103],[92,103,104],[103,105],[103,106],[64,69,75,77,86,92,102,103,105,107],[92,103,108],[65,103,110],[103,181],[75,92,103,110],[103,116,117,119],[103,116,119],[103,116,118,119,121],[103,119,120],[103,114,115,117,119,121],[103,116],[103,114,115,116,117,120,121,122,123,124,125,126,127,128,129,130,131],[103,135,136,137],[92,103,110,119,132],[103,119,132],[59,103,119],[59,103,113,114,115,116,117,118],[103,116,117],[103,116,123],[103,116,117,123],[103,117],[103,117,119],[103,132,133,134,138,139],[92,103,110,119,133],[78,92,103,110],[103,157,160],[103,157,160,161,162],[103,159],[103,156,163],[103,158],[55,103],[55,56,57,58,103],[54,103,140,142,143],[54,103,140],[54,103,144],[140]],"referencedMap":[[148,1],[146,2],[142,3],[141,2],[151,4],[147,1],[149,5],[150,1],[152,6],[153,2],[154,7],[155,8],[165,9],[166,2],[167,2],[168,2],[169,2],[170,2],[112,2],[113,10],[60,11],[61,11],[63,12],[64,13],[65,14],[66,15],[67,16],[68,17],[69,18],[70,19],[71,20],[72,21],[73,21],[74,22],[75,23],[76,24],[77,25],[62,26],[109,2],[78,27],[79,28],[80,29],[110,30],[81,31],[82,32],[83,33],[84,34],[85,35],[86,36],[87,37],[88,38],[89,39],[90,40],[91,41],[92,42],[94,43],[93,44],[95,45],[96,46],[97,47],[98,48],[99,49],[100,50],[101,51],[102,52],[103,53],[104,54],[105,55],[106,56],[107,57],[108,58],[171,2],[172,2],[173,2],[174,2],[175,59],[176,2],[177,2],[178,2],[179,2],[180,2],[181,2],[182,60],[183,61],[156,2],[118,62],[131,2],[115,63],[117,64],[121,65],[116,66],[114,67],[132,68],[138,69],[135,70],[137,71],[136,71],[120,72],[123,2],[119,73],[122,71],[129,74],[128,74],[126,75],[127,76],[130,77],[124,76],[125,76],[133,78],[139,63],[140,79],[134,80],[111,81],[157,2],[161,82],[163,83],[162,82],[160,84],[164,85],[159,86],[158,2],[56,87],[57,87],[59,88],[58,87],[55,2],[54,2],[11,2],[13,2],[12,2],[2,2],[14,2],[15,2],[16,2],[17,2],[18,2],[19,2],[20,2],[21,2],[3,2],[4,2],[25,2],[22,2],[23,2],[24,2],[26,2],[27,2],[28,2],[5,2],[29,2],[30,2],[31,2],[32,2],[6,2],[33,2],[34,2],[35,2],[36,2],[7,2],[37,2],[42,2],[43,2],[38,2],[39,2],[40,2],[41,2],[8,2],[47,2],[44,2],[45,2],[46,2],[48,2],[9,2],[49,2],[50,2],[51,2],[52,2],[1,2],[10,2],[53,2],[144,89],[143,90],[145,91]],"exportedModulesMap":[[148,1],[146,2],[142,3],[141,2],[151,4],[147,1],[149,5],[150,1],[152,6],[153,2],[154,7],[155,8],[165,9],[166,2],[167,2],[168,2],[169,2],[170,2],[112,2],[113,10],[60,11],[61,11],[63,12],[64,13],[65,14],[66,15],[67,16],[68,17],[69,18],[70,19],[71,20],[72,21],[73,21],[74,22],[75,23],[76,24],[77,25],[62,26],[109,2],[78,27],[79,28],[80,29],[110,30],[81,31],[82,32],[83,33],[84,34],[85,35],[86,36],[87,37],[88,38],[89,39],[90,40],[91,41],[92,42],[94,43],[93,44],[95,45],[96,46],[97,47],[98,48],[99,49],[100,50],[101,51],[102,52],[103,53],[104,54],[105,55],[106,56],[107,57],[108,58],[171,2],[172,2],[173,2],[174,2],[175,59],[176,2],[177,2],[178,2],[179,2],[180,2],[181,2],[182,60],[183,61],[156,2],[118,62],[131,2],[115,63],[117,64],[121,65],[116,66],[114,67],[132,68],[138,69],[135,70],[137,71],[136,71],[120,72],[123,2],[119,73],[122,71],[129,74],[128,74],[126,75],[127,76],[130,77],[124,76],[125,76],[133,78],[139,63],[140,79],[134,80],[111,81],[157,2],[161,82],[163,83],[162,82],[160,84],[164,85],[159,86],[158,2],[56,87],[57,87],[59,88],[58,87],[55,2],[54,2],[11,2],[13,2],[12,2],[2,2],[14,2],[15,2],[16,2],[17,2],[18,2],[19,2],[20,2],[21,2],[3,2],[4,2],[25,2],[22,2],[23,2],[24,2],[26,2],[27,2],[28,2],[5,2],[29,2],[30,2],[31,2],[32,2],[6,2],[33,2],[34,2],[35,2],[36,2],[7,2],[37,2],[42,2],[43,2],[38,2],[39,2],[40,2],[41,2],[8,2],[47,2],[44,2],[45,2],[46,2],[48,2],[9,2],[49,2],[50,2],[51,2],[52,2],[1,2],[10,2],[53,2],[144,92],[143,92],[145,91]],"semanticDiagnosticsPerFile":[148,146,142,141,151,147,149,150,152,153,154,155,165,166,167,168,169,170,112,113,60,61,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,62,109,78,79,80,110,81,82,83,84,85,86,87,88,89,90,91,92,94,93,95,96,97,98,99,100,101,102,103,104,105,106,107,108,171,172,173,174,175,176,177,178,179,180,181,182,183,156,118,131,115,117,121,116,114,132,138,135,137,136,120,123,119,122,129,128,126,127,130,124,125,133,139,140,134,111,157,161,163,162,160,164,159,158,56,57,59,58,55,54,11,13,12,2,14,15,16,17,18,19,20,21,3,4,25,22,23,24,26,27,28,5,29,30,31,32,6,33,34,35,36,7,37,42,43,38,39,40,41,8,47,44,45,46,48,9,49,50,51,52,1,10,53,144,143,145]},"version":"4.7.2"}

package/src/bayesian-network.js

@@ -1,112 +0,0 @@
-const fs = require('fs');
-
-const { BayesianNode } = require('./bayesian-node');
-
-/**
- * BayesianNetwork is an implementation of a bayesian network capable of randomly sampling from the distribution
- * represented by the network.
- */
-class BayesianNetwork {
-    /**
-     * @param {object} networkDefinition - object defining the network structure and distributions
-     */
-    constructor(networkDefinition) {
-        this.nodesInSamplingOrder = networkDefinition.nodes.map((nodeDefinition) => new BayesianNode(nodeDefinition));
-        this.nodesByName = {};
-        for (const node of this.nodesInSamplingOrder) {
-            this.nodesByName[node.name] = node;
-        }
-    }
-
-    /**
-     * Randomly samples from the distribution represented by the bayesian network.
-     * @param {object} inputValues - node values that are known already
-     */
-    generateSample(inputValues = {}) {
-        const sample = inputValues;
-        for (const node of this.nodesInSamplingOrder) {
-            if (!(node.name in sample)) {
-                sample[node.name] = node.sample(sample);
-            }
-        }
-
-        return sample;
-    }
-
-    /**
-     * Randomly samples from the distribution represented by the bayesian network,
-     * making sure the sample is consistent with the provided restrictions on value possibilities.
-     * Returns false if no such sample can be generated.
-     * @param {object} valuePossibilities - a dictionary of lists of possible values for nodes
-     *                                      (if a node isn't present in the dictionary, all values are possible)
-     */
-    generateConsistentSampleWhenPossible(valuePossibilities) {
-        return this._recursivelyGenerateConsistentSampleWhenPossible({}, valuePossibilities, 0);
-    }
-
-    /**
-     * Recursively generates a random sample consistent with the given restrictions on possible values.
-     * @param {object} sampleSoFar - node values that are known already
-     * @param {object} valuePossibilities - a dictionary of lists of possible values for nodes
-     *                                      (if a node isn't present in the dictionary, all values are possible)
-     * @param {number} depth - in what depth of the recursion this function call is,
-     *                         specifies what node this function call is sampling
-     * @private
-     */
-    _recursivelyGenerateConsistentSampleWhenPossible(sampleSoFar, valuePossibilities, depth) {
-        const bannedValues = [];
-        const node = this.nodesInSamplingOrder[depth];
-
-        let sampleValue;
-        do {
-            sampleValue = node.sampleAccordingToRestrictions(sampleSoFar, valuePossibilities[node.name], bannedValues);
-
-            if (!sampleValue) break;
-
-            sampleSoFar[node.name] = sampleValue;
-
-            if (depth + 1 < this.nodesInSamplingOrder.length) {
-                const sample = this._recursivelyGenerateConsistentSampleWhenPossible(sampleSoFar, valuePossibilities, depth + 1);
-                if (sample) {
-                    return sample;
-                }
-            } else {
-                return sampleSoFar;
-            }
-
-            bannedValues.push(sampleValue);
-        } while (sampleValue);
-
-        return false;
-    }
-
-    /**
-     * Sets the conditional probability distributions of this network's nodes to match the given data.
-     * @param {object} dataframe - a Danfo.js dataframe containing the data
-     */
-    setProbabilitiesAccordingToData(dataframe) {
-        this.nodesInSamplingOrder.forEach((node) => {
-            const possibleParentValues = {};
-            for (const parentName of node.parentNames) {
-                possibleParentValues[parentName] = this.nodesByName[parentName].possibleValues;
-            }
-            node.setProbabilitiesAccordingToData(dataframe, possibleParentValues);
-        });
-    }
-
-    /**
-     * Saves the network definition to the specified file path to be used later.
-     * @param {string} networkDefinitionFilePath - a file path where the network definition should be saved
-     */
-    saveNetworkDefinition(networkDefinitionFilePath) {
-        const network = {
-            nodes: this.nodesInSamplingOrder.map((node) => node.nodeDefinition),
-        };
-
-        fs.writeFileSync(networkDefinitionFilePath, JSON.stringify(network));
-    }
-}
-
-module.exports = {
-    BayesianNetwork,
-};

package/src/main.js

@@ -1,3 +0,0 @@
-const BayesianNetwork = require('./bayesian-network');
-
-module.exports = BayesianNetwork;