nlptoolkit-classification 1.0.0

package/dist/InstanceList/Partition.js

@@ -0,0 +1,143 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "./InstanceList", "./InstanceListOfSameClass"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.Partition = void 0;
+    const InstanceList_1 = require("./InstanceList");
+    const InstanceListOfSameClass_1 = require("./InstanceListOfSameClass");
+    class Partition {
+        constructor(instanceList, attributeIndex, stratifiedOrValue) {
+            this.multiList = new Array();
+            if (instanceList != undefined) {
+                if (attributeIndex == undefined) {
+                    let classLabels = instanceList.getDistinctClassLabels();
+                    for (let classLabel of classLabels) {
+                        this.add(new InstanceListOfSameClass_1.InstanceListOfSameClass(classLabel));
+                    }
+                    for (let instance of instanceList.getInstances()) {
+                        this.get(classLabels.indexOf(instance.getClassLabel())).add(instance);
+                    }
+                }
+                else {
+                    if (stratifiedOrValue == undefined) {
+                        let valueList = instanceList.getAttributeValueList(attributeIndex);
+                        for (let value of valueList) {
+                            this.add(new InstanceList_1.InstanceList());
+                        }
+                        for (let instance of instanceList.getInstances()) {
+                            this.get(valueList.indexOf(instance.getAttribute(attributeIndex).getValue())).add(instance);
+                        }
+                    }
+                    else {
+                        if (typeof stratifiedOrValue == "boolean") {
+                            this.add(new InstanceList_1.InstanceList());
+                            this.add(new InstanceList_1.InstanceList());
+                            if (stratifiedOrValue) {
+                                let distribution = instanceList.classDistribution();
+                                let counts = new Array(distribution.size).fill(0);
+                                let randomArray = new Array();
+                                for (let i = 0; i < instanceList.size(); i++) {
+                                    randomArray.push(i);
+                                }
+                                for (let i = 0; i < instanceList.size(); i++) {
+                                    let instance = instanceList.get(randomArray[i]);
+                                    let classIndex = distribution.getIndex(instance.getClassLabel());
+                                    let ratio = attributeIndex;
+                                    if (counts[classIndex] < instanceList.size() * ratio * distribution.getProbability(instance.getClassLabel())) {
+                                        this.get(0).add(instance);
+                                    }
+                                    else {
+                                        this.get(1).add(instance);
+                                    }
+                                    counts[classIndex]++;
+                                }
+                            }
+                            else {
+                                for (let i = 0; i < instanceList.size(); i++) {
+                                    let instance = instanceList.get(i);
+                                    let ratio = attributeIndex;
+                                    if (i < instanceList.size() * ratio) {
+                                        this.get(0).add(instance);
+                                    }
+                                    else {
+                                        this.get(1).add(instance);
+                                    }
+                                }
+                            }
+                        }
+                        else {
+                            this.add(new InstanceList_1.InstanceList());
+                            this.add(new InstanceList_1.InstanceList());
+                            if (Number.isInteger(stratifiedOrValue)) {
+                                for (let instance of instanceList.getInstances()) {
+                                    if (instance.getAttribute(attributeIndex).getIndex() == stratifiedOrValue) {
+                                        this.get(0).add(instance);
+                                    }
+                                    else {
+                                        this.get(1).add(instance);
+                                    }
+                                }
+                            }
+                            else {
+                                for (let instance of instanceList.getInstances()) {
+                                    if (instance.getAttribute(attributeIndex).getValue() <= stratifiedOrValue) {
+                                        this.get(0).add(instance);
+                                    }
+                                    else {
+                                        this.get(1).add(instance);
+                                    }
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        /**
+         * Adds given instance list to the list of instance lists.
+         *
+         * @param list Instance list to add.
+         */
+        add(list) {
+            this.multiList.push(list);
+        }
+        /**
+         * Returns the size of the list of instance lists.
+         *
+         * @return The size of the list of instance lists.
+         */
+        size() {
+            return this.multiList.length;
+        }
+        /**
+         * Returns the corresponding instance list at given index of list of instance lists.
+         *
+         * @param index Index of the instance list.
+         * @return Instance list at given index of list of instance lists.
+         */
+        get(index) {
+            return this.multiList[index];
+        }
+        /**
+         * Returns the instances of the items at the list of instance lists.
+         *
+         * @return Instances of the items at the list of instance lists.
+         */
+        getLists() {
+            let result = new Array(this.multiList.length);
+            for (let i = 0; i < this.multiList.length; i++) {
+                result.push(this.multiList[i].getInstances());
+            }
+            return result;
+        }
+    }
+    exports.Partition = Partition;
+});
+//# sourceMappingURL=Partition.js.map

package/dist/InstanceList/Partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../source/InstanceList/Partition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,iDAA4C;IAC5C,uEAAkE;IAMlE,MAAa,SAAS;QAIlB,YAAY,YAA2B,EAAE,cAAuB,EAAE,iBAAuB;YAFjF,cAAS,GAAwB,IAAI,KAAK,EAAgB,CAAA;YAG9D,IAAI,YAAY,IAAI,SAAS,EAAC;gBAC1B,IAAI,cAAc,IAAI,SAAS,EAAC;oBAC5B,IAAI,WAAW,GAAG,YAAY,CAAC,sBAAsB,EAAE,CAAC;oBACxD,KAAK,IAAI,UAAU,IAAI,WAAW,EAAC;wBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,iDAAuB,CAAC,UAAU,CAAC,CAAC,CAAC;qBACrD;oBACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;wBAC9C,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBACzE;iBACJ;qBAAM;oBACH,IAAI,iBAAiB,IAAI,SAAS,EAAC;wBAC/B,IAAI,SAAS,GAAG,YAAY,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;wBACnE,KAAK,IAAI,KAAK,IAAI,SAAS,EAAE;4BACzB,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;yBAChC;wBACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;4BAC9C,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;yBACrH;qBACJ;yBAAM;wBACH,IAAI,OAAO,iBAAiB,IAAI,SAAS,EAAC;4BACtC,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,iBAAiB,EAAC;gCAClB,IAAI,YAAY,GAAG,YAAY,CAAC,iBAAiB,EAAE,CAAC;gCACpD,IAAI,MAAM,GAAG,IAAI,KAAK,CAAS,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gCACzD,IAAI,WAAW,GAAG,IAAI,KAAK,EAAU,CAAC;gCACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAC;oCACzC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iCACvB;gCACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oCAChD,IAAI,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;oCACjE,IAAI,KAAK,GAAG,cAAc,CAAA;oCAC1B,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,YAAY,CAAC,cAAc,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE;wCAC1G,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;oCACD,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;iCACxB;6BACJ;iCAAM;gCACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oCACnC,IAAI,KAAK,GAAG,cAAc,CAAA;oCAC1B,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,EAAE;wCACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;yBACJ;6BAAM;4BACH,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,EAAC;gCACpC,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;oCAC9C,IAAgC,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,iBAAiB,EAAE;wCACpG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;iCAAM;gCACH,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;oCAC9C,IAA2B,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,iBAAiB,EAAE;wCAC/F,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;QACL,CAAC;QAED;;;;WAIG;QACH,GAAG,CAAC,IAAkB;YAClB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;QAED;;;;WAIG;QACH,IAAI;YACA,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAA;QAChC,CAAC;QAED;;;;;WAKG;QACH,GAAG,CAAC,KAAa;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAChC,CAAC;QAED;;;;WAIG;QACH,QAAQ;YACJ,IAAI,MAAM,GAAG,IAAI,KAAK,CAAkB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;aACjD;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;KAEJ;IA3HD,8BA2HC"}

package/dist/Model/DecisionTree/DecisionCondition.d.ts

@@ -0,0 +1,34 @@
+import { Attribute } from "../../Attribute/Attribute";
+import { Instance } from "../../Instance/Instance";
+export declare class DecisionCondition {
+    private attributeIndex;
+    private comparison;
+    private value;
+    /**
+     * A constructor that sets attributeIndex, comparison and {@link Attribute} value.
+     *
+     * @param attributeIndex Integer number that shows attribute index.
+     * @param value          The value of the {@link Attribute}.
+     * @param comparison     Comparison character.
+     */
+    constructor(attributeIndex: number, value: Attribute, comparison?: string);
+    getAttributeIndex(): number;
+    getValue(): Attribute;
+    /**
+     * The satisfy method takes an {@link Instance} as an input.
+     * <p>
+     * If defined {@link Attribute} value is a {@link DiscreteIndexedAttribute} it compares the index of {@link Attribute} of instance at the
+     * attributeIndex and the index of {@link Attribute} value and returns the result.
+     * <p>
+     * If defined {@link Attribute} value is a {@link DiscreteAttribute} it compares the value of {@link Attribute} of instance at the
+     * attributeIndex and the value of {@link Attribute} value and returns the result.
+     * <p>
+     * If defined {@link Attribute} value is a {@link ContinuousAttribute} it compares the value of {@link Attribute} of instance at the
+     * attributeIndex and the value of {@link Attribute} value and returns the result according to the comparison character whether it is
+     * less than or greater than signs.
+     *
+     * @param instance Instance to compare.
+     * @return True if gicen instance satisfies the conditions.
+     */
+    satisfy(instance: Instance): boolean;
+}

package/dist/Model/DecisionTree/DecisionCondition.js

@@ -0,0 +1,84 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "../../Attribute/DiscreteIndexedAttribute", "../../Attribute/DiscreteAttribute", "../../Attribute/ContinuousAttribute"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.DecisionCondition = void 0;
+    const DiscreteIndexedAttribute_1 = require("../../Attribute/DiscreteIndexedAttribute");
+    const DiscreteAttribute_1 = require("../../Attribute/DiscreteAttribute");
+    const ContinuousAttribute_1 = require("../../Attribute/ContinuousAttribute");
+    class DecisionCondition {
+        /**
+         * A constructor that sets attributeIndex, comparison and {@link Attribute} value.
+         *
+         * @param attributeIndex Integer number that shows attribute index.
+         * @param value          The value of the {@link Attribute}.
+         * @param comparison     Comparison character.
+         */
+        constructor(attributeIndex, value, comparison) {
+            this.attributeIndex = -1;
+            this.comparison = undefined;
+            this.attributeIndex = attributeIndex;
+            this.comparison = comparison;
+            this.value = value;
+        }
+        getAttributeIndex() {
+            return this.attributeIndex;
+        }
+        getValue() {
+            return this.value;
+        }
+        /**
+         * The satisfy method takes an {@link Instance} as an input.
+         * <p>
+         * If defined {@link Attribute} value is a {@link DiscreteIndexedAttribute} it compares the index of {@link Attribute} of instance at the
+         * attributeIndex and the index of {@link Attribute} value and returns the result.
+         * <p>
+         * If defined {@link Attribute} value is a {@link DiscreteAttribute} it compares the value of {@link Attribute} of instance at the
+         * attributeIndex and the value of {@link Attribute} value and returns the result.
+         * <p>
+         * If defined {@link Attribute} value is a {@link ContinuousAttribute} it compares the value of {@link Attribute} of instance at the
+         * attributeIndex and the value of {@link Attribute} value and returns the result according to the comparison character whether it is
+         * less than or greater than signs.
+         *
+         * @param instance Instance to compare.
+         * @return True if gicen instance satisfies the conditions.
+         */
+        satisfy(instance) {
+            if (this.value instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute) {
+                if (this.value.getIndex() != -1) {
+                    return instance.getAttribute(this.attributeIndex).getIndex() == this.value.getIndex();
+                }
+                else {
+                    return true;
+                }
+            }
+            else {
+                if (this.value instanceof DiscreteAttribute_1.DiscreteAttribute) {
+                    return (instance.getAttribute(this.attributeIndex).getValue() == this.value.getValue());
+                }
+                else {
+                    if (this.value instanceof ContinuousAttribute_1.ContinuousAttribute) {
+                        if (this.comparison == "<") {
+                            return instance.getAttribute(this.attributeIndex).getValue() <= this.value.getValue();
+                        }
+                        else {
+                            if (this.comparison == ">") {
+                                return instance.getAttribute(this.attributeIndex).getValue() > this.value.getValue();
+                            }
+                        }
+                    }
+                }
+            }
+            return false;
+        }
+    }
+    exports.DecisionCondition = DecisionCondition;
+});
+//# sourceMappingURL=DecisionCondition.js.map

package/dist/Model/DecisionTree/DecisionCondition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionCondition.js","sourceRoot":"","sources":["../../../source/Model/DecisionTree/DecisionCondition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAEA,uFAAkF;IAClF,yEAAoE;IACpE,6EAAwE;IAExE,MAAa,iBAAiB;QAM1B;;;;;;WAMG;QACH,YAAY,cAAsB,EAAE,KAAgB,EAAE,UAAmB;YAXjE,mBAAc,GAAW,CAAC,CAAC,CAAA;YAC3B,eAAU,GAAW,SAAS,CAAA;YAWlC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,iBAAiB;YACb,OAAO,IAAI,CAAC,cAAc,CAAA;QAC9B,CAAC;QAED,QAAQ;YACJ,OAAO,IAAI,CAAC,KAAK,CAAA;QACrB,CAAC;QAED;;;;;;;;;;;;;;;WAeG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,IAAI,CAAC,KAAK,YAAY,mDAAwB,EAAE;gBAChD,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE;oBAC1D,OAAmC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;iBACnJ;qBAAM;oBACH,OAAO,IAAI,CAAC;iBACf;aACJ;iBAAM;gBACH,IAAI,IAAI,CAAC,KAAK,YAAY,qCAAiB,EAAE;oBACzC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAyB,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;iBACvI;qBAAM;oBACH,IAAI,IAAI,CAAC,KAAK,YAAY,yCAAmB,EAAE;wBAC3C,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;4BACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAA2B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;yBACzI;6BAAM;4BACH,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;gCACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,GAA0B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;6BACxI;yBACJ;qBACJ;iBACJ;aACJ;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;KACJ;IAnED,8CAmEC"}

package/dist/Model/DecisionTree/DecisionNode.d.ts

@@ -0,0 +1,82 @@
+import { InstanceList } from "../../InstanceList/InstanceList";
+import { DecisionCondition } from "./DecisionCondition";
+import { RandomForestParameter } from "../../Parameter/RandomForestParameter";
+import { Instance } from "../../Instance/Instance";
+export declare class DecisionNode {
+    children: Array<DecisionNode>;
+    private EPSILON;
+    private readonly data;
+    private readonly classLabel;
+    leaf: boolean;
+    private condition;
+    /**
+     * The DecisionNode method takes {@link InstanceList} data as input, and then it sets the class label parameter by finding
+     * the most occurred class label of given data, it then gets distinct class labels as class labels ArrayList. Later, it adds ordered
+     * indices to the indexList and shuffles them randomly. Then, it gets the class distribution of given data and finds the best entropy value
+     * of these class distribution.
+     * <p>
+     * If an attribute of given data is {@link DiscreteIndexedAttribute}, it creates a Distribution according to discrete indexed attribute class distribution
+     * and finds the entropy. If it is better than the last best entropy it reassigns the best entropy, best attribute and best split value according to
+     * the newly founded best entropy's index. At the end, it also adds new distribution to the class distribution .
+     * <p>
+     * If an attribute of given data is {@link DiscreteAttribute}, it directly finds the entropy. If it is better than the last best entropy it
+     * reassigns the best entropy, best attribute and best split value according to the newly founded best entropy's index.
+     * <p>
+     * If an attribute of given data is {@link ContinuousAttribute}, it creates two distributions; left and right according to class distribution
+     * and discrete distribution respectively, and finds the entropy. If it is better than the last best entropy it reassigns the best entropy,
+     * best attribute and best split value according to the newly founded best entropy's index. At the end, it also adds new distribution to
+     * the right distribution and removes from left distribution .
+     *
+     * @param data      {@link InstanceList} input.
+     * @param condition {@link DecisionCondition} to check.
+     * @param parameter RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+     * @param isStump   Refers to decision trees with only 1 splitting rule.
+     */
+    constructor(data: InstanceList, condition: DecisionCondition, parameter: RandomForestParameter, isStump: boolean);
+    /**
+     * The entropyForDiscreteAttribute method takes an attributeIndex and creates an ArrayList of DiscreteDistribution.
+     * Then loops through the distributions and calculates the total entropy.
+     *
+     * @param attributeIndex Index of the attribute.
+     * @return Total entropy for the discrete attribute.
+     */
+    private entropyForDiscreteAttribute;
+    /**
+     * The createChildrenForDiscreteIndexed method creates an ArrayList of DecisionNodes as children and a partition with respect to
+     * indexed attribute.
+     *
+     * @param attributeIndex Index of the attribute.
+     * @param attributeValue Value of the attribute.
+     * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+     * @param isStump        Refers to decision trees with only 1 splitting rule.
+     */
+    private createChildrenForDiscreteIndexed;
+    /**
+     * The createChildrenForDiscrete method creates an ArrayList of values, a partition with respect to attributes and an ArrayList
+     * of DecisionNodes as children.
+     *
+     * @param attributeIndex Index of the attribute.
+     * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+     * @param isStump        Refers to decision trees with only 1 splitting rule.
+     */
+    private createChildrenForDiscrete;
+    /**
+     * The createChildrenForContinuous method creates an ArrayList of DecisionNodes as children and a partition with respect to
+     * continuous attribute and the given split value.
+     *
+     * @param attributeIndex Index of the attribute.
+     * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+     * @param isStump        Refers to decision trees with only 1 splitting rule.
+     * @param splitValue     Split value is used for partitioning.
+     */
+    private createChildrenForContinuous;
+    /**
+     * The predict method takes an {@link Instance} as input and performs prediction on the DecisionNodes and returns the prediction
+     * for that instance.
+     *
+     * @param instance Instance to make prediction.
+     * @return The prediction for given instance.
+     */
+    predict(instance: Instance): string;
+    predictProbabilityDistribution(instance: Instance): Map<string, number>;
+}

package/dist/Model/DecisionTree/DecisionNode.js

@@ -0,0 +1,271 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "./DecisionCondition", "../Model", "../../Attribute/DiscreteIndexedAttribute", "../../Attribute/DiscreteAttribute", "../../Attribute/ContinuousAttribute", "nlptoolkit-math/dist/DiscreteDistribution", "../../InstanceList/Partition", "../../Instance/CompositeInstance"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.DecisionNode = void 0;
+    const DecisionCondition_1 = require("./DecisionCondition");
+    const Model_1 = require("../Model");
+    const DiscreteIndexedAttribute_1 = require("../../Attribute/DiscreteIndexedAttribute");
+    const DiscreteAttribute_1 = require("../../Attribute/DiscreteAttribute");
+    const ContinuousAttribute_1 = require("../../Attribute/ContinuousAttribute");
+    const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
+    const Partition_1 = require("../../InstanceList/Partition");
+    const CompositeInstance_1 = require("../../Instance/CompositeInstance");
+    class DecisionNode {
+        /**
+         * The DecisionNode method takes {@link InstanceList} data as input, and then it sets the class label parameter by finding
+         * the most occurred class label of given data, it then gets distinct class labels as class labels ArrayList. Later, it adds ordered
+         * indices to the indexList and shuffles them randomly. Then, it gets the class distribution of given data and finds the best entropy value
+         * of these class distribution.
+         * <p>
+         * If an attribute of given data is {@link DiscreteIndexedAttribute}, it creates a Distribution according to discrete indexed attribute class distribution
+         * and finds the entropy. If it is better than the last best entropy it reassigns the best entropy, best attribute and best split value according to
+         * the newly founded best entropy's index. At the end, it also adds new distribution to the class distribution .
+         * <p>
+         * If an attribute of given data is {@link DiscreteAttribute}, it directly finds the entropy. If it is better than the last best entropy it
+         * reassigns the best entropy, best attribute and best split value according to the newly founded best entropy's index.
+         * <p>
+         * If an attribute of given data is {@link ContinuousAttribute}, it creates two distributions; left and right according to class distribution
+         * and discrete distribution respectively, and finds the entropy. If it is better than the last best entropy it reassigns the best entropy,
+         * best attribute and best split value according to the newly founded best entropy's index. At the end, it also adds new distribution to
+         * the right distribution and removes from left distribution .
+         *
+         * @param data      {@link InstanceList} input.
+         * @param condition {@link DecisionCondition} to check.
+         * @param parameter RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+         * @param isStump   Refers to decision trees with only 1 splitting rule.
+         */
+        constructor(data, condition, parameter, isStump) {
+            this.children = undefined;
+            this.EPSILON = 0.0000000001;
+            this.data = undefined;
+            this.classLabel = undefined;
+            this.leaf = false;
+            this.condition = undefined;
+            let bestAttribute = -1;
+            let bestSplitValue = 0;
+            this.condition = condition;
+            this.data = data;
+            this.classLabel = Model_1.Model.getMaximum(data.getClassLabels());
+            this.leaf = true;
+            let classLabels = data.getDistinctClassLabels();
+            if (classLabels.length == 1) {
+                return;
+            }
+            if (isStump && condition != null) {
+                return;
+            }
+            let indexList = new Array();
+            for (let i = 0; i < data.get(0).attributeSize(); i++) {
+                indexList.push(i);
+            }
+            let size;
+            if (parameter != undefined && parameter.getAttributeSubsetSize() < data.get(0).attributeSize()) {
+                size = parameter.getAttributeSubsetSize();
+            }
+            else {
+                size = data.get(0).attributeSize();
+            }
+            let classDistribution = data.classDistribution();
+            let bestEntropy = data.classDistribution().entropy();
+            for (let j = 0; j < size; j++) {
+                let index = indexList[j];
+                if (data.get(0).getAttribute(index) instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute) {
+                    for (let k = 0; k < data.get(0).getAttribute(index).getMaxIndex(); k++) {
+                        let distribution = data.discreteIndexedAttributeClassDistribution(index, k);
+                        if (distribution.getSum() > 0) {
+                            classDistribution.removeDistribution(distribution);
+                            let entropy = (classDistribution.entropy() * classDistribution.getSum() + distribution.entropy() * distribution.getSum()) / data.size();
+                            if (entropy + this.EPSILON < bestEntropy) {
+                                bestEntropy = entropy;
+                                bestAttribute = index;
+                                bestSplitValue = k;
+                            }
+                            classDistribution.addDistribution(distribution);
+                        }
+                    }
+                }
+                else {
+                    if (data.get(0).getAttribute(index) instanceof DiscreteAttribute_1.DiscreteAttribute) {
+                        let entropy = this.entropyForDiscreteAttribute(index);
+                        if (entropy + this.EPSILON < bestEntropy) {
+                            bestEntropy = entropy;
+                            bestAttribute = index;
+                        }
+                    }
+                    else {
+                        if (data.get(0).getAttribute(index) instanceof ContinuousAttribute_1.ContinuousAttribute) {
+                            data.sort(index);
+                            let previousValue = Number.NEGATIVE_INFINITY;
+                            let leftDistribution = data.classDistribution();
+                            let rightDistribution = new DiscreteDistribution_1.DiscreteDistribution();
+                            for (let k = 0; k < data.size(); k++) {
+                                let instance = data.get(k);
+                                if (k == 0) {
+                                    previousValue = instance.getAttribute(index).getValue();
+                                }
+                                else {
+                                    if (instance.getAttribute(index).getValue() != previousValue) {
+                                        let splitValue = (previousValue + instance.getAttribute(index).getValue()) / 2;
+                                        previousValue = instance.getAttribute(index).getValue();
+                                        let entropy = (leftDistribution.getSum() / data.size()) * leftDistribution.entropy() + (rightDistribution.getSum() / data.size()) * rightDistribution.entropy();
+                                        if (entropy + this.EPSILON < bestEntropy) {
+                                            bestEntropy = entropy;
+                                            bestSplitValue = splitValue;
+                                            bestAttribute = index;
+                                        }
+                                    }
+                                }
+                                leftDistribution.removeItem(instance.getClassLabel());
+                                rightDistribution.addItem(instance.getClassLabel());
+                            }
+                        }
+                    }
+                }
+            }
+            if (bestAttribute != -1) {
+                this.leaf = false;
+                if (data.get(0).getAttribute(bestAttribute) instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute) {
+                    this.createChildrenForDiscreteIndexed(bestAttribute, bestSplitValue, parameter, isStump);
+                }
+                else {
+                    if (data.get(0).getAttribute(bestAttribute) instanceof DiscreteAttribute_1.DiscreteAttribute) {
+                        this.createChildrenForDiscrete(bestAttribute, parameter, isStump);
+                    }
+                    else {
+                        if (data.get(0).getAttribute(bestAttribute) instanceof ContinuousAttribute_1.ContinuousAttribute) {
+                            this.createChildrenForContinuous(bestAttribute, bestSplitValue, parameter, isStump);
+                        }
+                    }
+                }
+            }
+        }
+        /**
+         * The entropyForDiscreteAttribute method takes an attributeIndex and creates an ArrayList of DiscreteDistribution.
+         * Then loops through the distributions and calculates the total entropy.
+         *
+         * @param attributeIndex Index of the attribute.
+         * @return Total entropy for the discrete attribute.
+         */
+        entropyForDiscreteAttribute(attributeIndex) {
+            let sum = 0.0;
+            let distributions = this.data.attributeClassDistribution(attributeIndex);
+            for (let distribution of distributions) {
+                sum += (distribution.getSum() / this.data.size()) * distribution.entropy();
+            }
+            return sum;
+        }
+        /**
+         * The createChildrenForDiscreteIndexed method creates an ArrayList of DecisionNodes as children and a partition with respect to
+         * indexed attribute.
+         *
+         * @param attributeIndex Index of the attribute.
+         * @param attributeValue Value of the attribute.
+         * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+         * @param isStump        Refers to decision trees with only 1 splitting rule.
+         */
+        createChildrenForDiscreteIndexed(attributeIndex, attributeValue, parameter, isStump) {
+            let childrenData = new Partition_1.Partition(this.data, attributeIndex, attributeValue);
+            this.children = new Array();
+            this.children.push(new DecisionNode(childrenData.get(0), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", attributeValue, this.data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
+            this.children.push(new DecisionNode(childrenData.get(1), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", -1, this.data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
+        }
+        /**
+         * The createChildrenForDiscrete method creates an ArrayList of values, a partition with respect to attributes and an ArrayList
+         * of DecisionNodes as children.
+         *
+         * @param attributeIndex Index of the attribute.
+         * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+         * @param isStump        Refers to decision trees with only 1 splitting rule.
+         */
+        createChildrenForDiscrete(attributeIndex, parameter, isStump) {
+            let valueList = this.data.getAttributeValueList(attributeIndex);
+            let childrenData = new Partition_1.Partition(this.data, attributeIndex);
+            this.children = new Array();
+            for (let i = 0; i < valueList.length; i++) {
+                this.children.push(new DecisionNode(childrenData.get(i), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteAttribute_1.DiscreteAttribute(valueList[i])), parameter, isStump));
+            }
+        }
+        /**
+         * The createChildrenForContinuous method creates an ArrayList of DecisionNodes as children and a partition with respect to
+         * continuous attribute and the given split value.
+         *
+         * @param attributeIndex Index of the attribute.
+         * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+         * @param isStump        Refers to decision trees with only 1 splitting rule.
+         * @param splitValue     Split value is used for partitioning.
+         */
+        createChildrenForContinuous(attributeIndex, splitValue, parameter, isStump) {
+            let childrenData = new Partition_1.Partition(this.data, attributeIndex, splitValue);
+            this.children = new Array();
+            this.children.push(new DecisionNode(childrenData.get(0), new DecisionCondition_1.DecisionCondition(attributeIndex, new ContinuousAttribute_1.ContinuousAttribute(splitValue), "<"), parameter, isStump));
+            this.children.push(new DecisionNode(childrenData.get(1), new DecisionCondition_1.DecisionCondition(attributeIndex, new ContinuousAttribute_1.ContinuousAttribute(splitValue), ">"), parameter, isStump));
+        }
+        /**
+         * The predict method takes an {@link Instance} as input and performs prediction on the DecisionNodes and returns the prediction
+         * for that instance.
+         *
+         * @param instance Instance to make prediction.
+         * @return The prediction for given instance.
+         */
+        predict(instance) {
+            if (instance instanceof CompositeInstance_1.CompositeInstance) {
+                let possibleClassLabels = instance.getPossibleClassLabels();
+                let distribution = this.data.classDistribution();
+                let predictedClass = distribution.getMaxItem(possibleClassLabels);
+                if (this.leaf) {
+                    return predictedClass;
+                }
+                else {
+                    for (let node of this.children) {
+                        if (node.condition.satisfy(instance)) {
+                            let childPrediction = node.predict(instance);
+                            if (childPrediction != undefined) {
+                                return childPrediction;
+                            }
+                            else {
+                                return predictedClass;
+                            }
+                        }
+                    }
+                    return predictedClass;
+                }
+            }
+            else {
+                if (this.leaf) {
+                    return this.classLabel;
+                }
+                else {
+                    for (let node of this.children) {
+                        if (node.condition.satisfy(instance)) {
+                            return node.predict(instance);
+                        }
+                    }
+                    return this.classLabel;
+                }
+            }
+        }
+        predictProbabilityDistribution(instance) {
+            if (this.leaf) {
+                return this.data.classDistribution().getProbabilityDistribution();
+            }
+            else {
+                for (let node of this.children) {
+                    if (node.condition.satisfy(instance)) {
+                        return node.predictProbabilityDistribution(instance);
+                    }
+                }
+                return this.data.classDistribution().getProbabilityDistribution();
+            }
+        }
+    }
+    exports.DecisionNode = DecisionNode;
+});
+//# sourceMappingURL=DecisionNode.js.map

package/dist/Model/DecisionTree/DecisionNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionNode.js","sourceRoot":"","sources":["../../../source/Model/DecisionTree/DecisionNode.ts"],"names":[],"mappings":";;;;;;;;;;;;IACA,2DAAsD;IAEtD,oCAA+B;IAC/B,uFAAkF;IAClF,yEAAoE;IACpE,6EAAwE;IACxE,oFAA+E;IAC/E,4DAAuD;IAEvD,wEAAmE;IAEnE,MAAa,YAAY;QASrB;;;;;;;;;;;;;;;;;;;;;;WAsBG;QACH,YAAY,IAAkB,EAAE,SAA4B,EAAE,SAAgC,EAAE,OAAgB;YA9BhH,aAAQ,GAAwB,SAAS,CAAA;YACjC,YAAO,GAAW,YAAY,CAAC;YACtB,SAAI,GAAkB,SAAS,CAAA;YAC/B,eAAU,GAAY,SAAS,CAAA;YAChD,SAAI,GAAY,KAAK,CAAA;YACb,cAAS,GAAsB,SAAS,CAAA;YA0B5C,IAAI,aAAa,GAAG,CAAC,CAAC,CAAA;YACtB,IAAI,cAAc,GAAG,CAAC,CAAA;YACtB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,UAAU,GAAG,aAAK,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,WAAW,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAChD,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE;gBACzB,OAAO;aACV;YACD,IAAI,OAAO,IAAI,SAAS,IAAI,IAAI,EAAE;gBAC9B,OAAO;aACV;YACD,IAAI,SAAS,GAAG,IAAI,KAAK,EAAU,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE;gBAClD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACrB;YACD,IAAI,IAAI,CAAA;YACR,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,CAAC,sBAAsB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE;gBAC5F,IAAI,GAAG,SAAS,CAAC,sBAAsB,EAAE,CAAC;aAC7C;iBAAM;gBACH,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;aACtC;YACD,IAAI,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACjD,IAAI,WAAW,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,YAAY,mDAAwB,EAAE;oBACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAA8B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAE,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChG,IAAI,YAAY,GAAG,IAAI,CAAC,yCAAyC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;wBAC5E,IAAI,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;4BAC3B,iBAAiB,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;4BACnD,IAAI,OAAO,GAAG,CAAC,iBAAiB,CAAC,OAAO,EAAE,GAAG,iBAAiB,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;4BACxI,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,WAAW,EAAE;gCACtC,WAAW,GAAG,OAAO,CAAC;gCACtB,aAAa,GAAG,KAAK,CAAC;gCACtB,cAAc,GAAG,CAAC,CAAC;6BACtB;4BACD,iBAAiB,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;yBACnD;qBACJ;iBACJ;qBAAM;oBACH,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,YAAY,qCAAiB,EAAE;wBAC9D,IAAI,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,CAAC;wBACtD,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,WAAW,EAAE;4BACtC,WAAW,GAAG,OAAO,CAAC;4BACtB,aAAa,GAAG,KAAK,CAAC;yBACzB;qBACJ;yBAAM;wBACH,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,YAAY,yCAAmB,EAAE;4BAChE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;4BACjB,IAAI,aAAa,GAAG,MAAM,CAAC,iBAAiB,CAAC;4BAC7C,IAAI,gBAAgB,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;4BAChD,IAAI,iBAAiB,GAAG,IAAI,2CAAoB,EAAE,CAAC;4BACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gCAClC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gCAC3B,IAAI,CAAC,IAAI,CAAC,EAAE;oCACR,aAAa,GAAyB,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAE,CAAC,QAAQ,EAAE,CAAC;iCAClF;qCAAM;oCACH,IAA0B,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAE,CAAC,QAAQ,EAAE,IAAI,aAAa,EAAE;wCACjF,IAAI,UAAU,GAAG,CAAC,aAAa,GAAyB,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;wCACtG,aAAa,GAAyB,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAE,CAAC,QAAQ,EAAE,CAAC;wCAC/E,IAAI,OAAO,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,GAAG,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,OAAO,EAAE,CAAC;wCAChK,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,WAAW,EAAE;4CACtC,WAAW,GAAG,OAAO,CAAC;4CACtB,cAAc,GAAG,UAAU,CAAC;4CAC5B,aAAa,GAAG,KAAK,CAAC;yCACzB;qCACJ;iCACJ;gCACD,gBAAgB,CAAC,UAAU,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;gCACtD,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;6BACvD;yBACJ;qBACJ;iBACJ;aACJ;YACD,IAAI,aAAa,IAAI,CAAC,CAAC,EAAE;gBACrB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;gBAClB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,YAAY,mDAAwB,EAAE;oBAC7E,IAAI,CAAC,gCAAgC,CAAC,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;iBAC5F;qBAAM;oBACH,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,YAAY,qCAAiB,EAAE;wBACtE,IAAI,CAAC,yBAAyB,CAAC,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;qBACrE;yBAAM;wBACH,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,YAAY,yCAAmB,EAAE;4BACxE,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;yBACvF;qBACJ;iBACJ;aACJ;QACL,CAAC;QAED;;;;;;WAMG;QACK,2BAA2B,CAAC,cAAsB;YACtD,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;YACzE,KAAK,IAAI,YAAY,IAAI,aAAa,EAAE;gBACpC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;aAC9E;YACD,OAAO,GAAG,CAAC;QACf,CAAC;QAED;;;;;;;;WAQG;QACK,gCAAgC,CAAC,cAAsB,EAAE,cAAsB,EAAE,SAAgC,EAAE,OAAgB;YACvI,IAAI,YAAY,GAAG,IAAI,qBAAS,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC5E,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,EAAgB,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,qCAAiB,CAAC,cAAc,EAAE,IAAI,mDAAwB,CAAC,EAAE,EAAE,cAAc,EAA8B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YACjQ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,qCAAiB,CAAC,cAAc,EAAE,IAAI,mDAAwB,CAAC,EAAE,EAAE,CAAC,CAAC,EAA8B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;QACzP,CAAC;QAED;;;;;;;WAOG;QACK,yBAAyB,CAAC,cAAsB,EAAE,SAAgC,EAAE,OAAgB;YACxG,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;YAChE,IAAI,YAAY,GAAG,IAAI,qBAAS,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,EAAgB,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,qCAAiB,CAAC,cAAc,EAAE,IAAI,qCAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;aAC7J;QACL,CAAC;QAED;;;;;;;;WAQG;QACK,2BAA2B,CAAC,cAAsB,EAAE,UAAkB,EAAE,SAAgC,EAAE,OAAgB;YAC9H,IAAI,YAAY,GAAG,IAAI,qBAAS,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;YACxE,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,EAAgB,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,qCAAiB,CAAC,cAAc,EAAE,IAAI,yCAAmB,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YAC/J,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,qCAAiB,CAAC,cAAc,EAAE,IAAI,yCAAmB,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;QACnK,CAAC;QAED;;;;;;WAMG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,QAAQ,YAAY,qCAAiB,EAAE;gBACvC,IAAI,mBAAmB,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC;gBAClF,IAAI,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACjD,IAAI,cAAc,GAAG,YAAY,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;gBAClE,IAAI,IAAI,CAAC,IAAI,EAAE;oBACX,OAAO,cAAc,CAAC;iBACzB;qBAAM;oBACH,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;wBAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;4BAClC,IAAI,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;4BAC7C,IAAI,eAAe,IAAI,SAAS,EAAE;gCAC9B,OAAO,eAAe,CAAC;6BAC1B;iCAAM;gCACH,OAAO,cAAc,CAAC;6BACzB;yBACJ;qBACJ;oBACD,OAAO,cAAc,CAAC;iBACzB;aACJ;iBAAM;gBACH,IAAI,IAAI,CAAC,IAAI,EAAE;oBACX,OAAO,IAAI,CAAC,UAAU,CAAC;iBAC1B;qBAAM;oBACH,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;wBAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;4BAClC,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;yBACjC;qBACJ;oBACD,OAAO,IAAI,CAAC,UAAU,CAAC;iBAC1B;aACJ;QACL,CAAC;QAED,8BAA8B,CAAC,QAAkB;YAC7C,IAAI,IAAI,CAAC,IAAI,EAAE;gBACX,OAAO,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,0BAA0B,EAAE,CAAC;aACrE;iBAAM;gBACH,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;oBAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;wBAClC,OAAO,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;qBACxD;iBACJ;gBACD,OAAO,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,0BAA0B,EAAE,CAAC;aACrE;QACL,CAAC;KACJ;IApPD,oCAoPC"}