binary-decision-diagram 1.4.0 → 2.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.github/workflows/main.yml +2 -2
- package/dist/es/abstract-node.js +45 -51
- package/dist/es/abstract-node.js.map +1 -1
- package/dist/es/branches.js +20 -22
- package/dist/es/branches.js.map +1 -1
- package/dist/es/create-bdd-from-truth-table.js +19 -57
- package/dist/es/create-bdd-from-truth-table.js.map +1 -1
- package/dist/es/ensure-correct-bdd.js +26 -27
- package/dist/es/ensure-correct-bdd.js.map +1 -1
- package/dist/es/fill-truth-table.js +3 -3
- package/dist/es/fill-truth-table.js.map +1 -1
- package/dist/es/find-similar-node.js +3 -3
- package/dist/es/find-similar-node.js.map +1 -1
- package/dist/es/internal-node.js +15 -35
- package/dist/es/internal-node.js.map +1 -1
- package/dist/es/leaf-node.js +14 -34
- package/dist/es/leaf-node.js.map +1 -1
- package/dist/es/minimal-string/bdd-to-minimal-string.js +15 -15
- package/dist/es/minimal-string/bdd-to-minimal-string.js.map +1 -1
- package/dist/es/minimal-string/bdd-to-simple-bdd.js +2 -2
- package/dist/es/minimal-string/bdd-to-simple-bdd.js.map +1 -1
- package/dist/es/minimal-string/minimal-string-to-simple-bdd.js +27 -27
- package/dist/es/minimal-string/minimal-string-to-simple-bdd.js.map +1 -1
- package/dist/es/minimal-string/resolve-with-simple-bdd.js +4 -4
- package/dist/es/minimal-string/resolve-with-simple-bdd.js.map +1 -1
- package/dist/es/minimal-string/string-format.js +7 -7
- package/dist/es/minimal-string/string-format.js.map +1 -1
- package/dist/es/optimize-brute-force.d.ts +4 -4
- package/dist/es/optimize-brute-force.js +88 -186
- package/dist/es/optimize-brute-force.js.map +1 -1
- package/dist/es/parents.js +19 -47
- package/dist/es/parents.js.map +1 -1
- package/dist/es/root-node.js +79 -133
- package/dist/es/root-node.js.map +1 -1
- package/dist/es/types.d.ts +9 -9
- package/dist/es/util.js +21 -39
- package/dist/es/util.js.map +1 -1
- package/dist/lib/abstract-node.js +48 -57
- package/dist/lib/abstract-node.js.map +1 -1
- package/dist/lib/branches.js +21 -27
- package/dist/lib/branches.js.map +1 -1
- package/dist/lib/create-bdd-from-truth-table.js +24 -66
- package/dist/lib/create-bdd-from-truth-table.js.map +1 -1
- package/dist/lib/ensure-correct-bdd.js +27 -33
- package/dist/lib/ensure-correct-bdd.js.map +1 -1
- package/dist/lib/fill-truth-table.js +6 -10
- package/dist/lib/fill-truth-table.js.map +1 -1
- package/dist/lib/find-similar-node.js +4 -8
- package/dist/lib/find-similar-node.js.map +1 -1
- package/dist/lib/index.js +13 -25
- package/dist/lib/index.js.map +1 -1
- package/dist/lib/internal-node.js +18 -41
- package/dist/lib/internal-node.js.map +1 -1
- package/dist/lib/leaf-node.js +17 -40
- package/dist/lib/leaf-node.js.map +1 -1
- package/dist/lib/minimal-string/bdd-to-minimal-string.js +21 -26
- package/dist/lib/minimal-string/bdd-to-minimal-string.js.map +1 -1
- package/dist/lib/minimal-string/bdd-to-simple-bdd.js +4 -9
- package/dist/lib/minimal-string/bdd-to-simple-bdd.js.map +1 -1
- package/dist/lib/minimal-string/index.js +5 -17
- package/dist/lib/minimal-string/index.js.map +1 -1
- package/dist/lib/minimal-string/minimal-string-to-simple-bdd.js +30 -34
- package/dist/lib/minimal-string/minimal-string-to-simple-bdd.js.map +1 -1
- package/dist/lib/minimal-string/resolve-with-simple-bdd.js +6 -10
- package/dist/lib/minimal-string/resolve-with-simple-bdd.js.map +1 -1
- package/dist/lib/minimal-string/string-format.js +12 -19
- package/dist/lib/minimal-string/string-format.js.map +1 -1
- package/dist/lib/optimize-brute-force.d.ts +4 -4
- package/dist/lib/optimize-brute-force.js +93 -199
- package/dist/lib/optimize-brute-force.js.map +1 -1
- package/dist/lib/parents.js +19 -50
- package/dist/lib/parents.js.map +1 -1
- package/dist/lib/root-node.js +84 -141
- package/dist/lib/root-node.js.map +1 -1
- package/dist/lib/types.d.ts +9 -9
- package/dist/lib/types.js +1 -2
- package/dist/lib/util.js +36 -72
- package/dist/lib/util.js.map +1 -1
- package/package.json +8 -8
- package/tsconfig.json +2 -2
|
@@ -1,12 +1,9 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
var find_similar_node_1 = require("./find-similar-node");
|
|
6
|
-
var AbstractNode = /** @class */ (function () {
|
|
7
|
-
function AbstractNode(level, rootNode, type) {
|
|
1
|
+
import { nextNodeId } from './util';
|
|
2
|
+
import { findSimilarNode } from './find-similar-node';
|
|
3
|
+
export class AbstractNode {
|
|
4
|
+
constructor(level, rootNode, type) {
|
|
8
5
|
this.level = level;
|
|
9
|
-
this.id =
|
|
6
|
+
this.id = nextNodeId();
|
|
10
7
|
this.deleted = false;
|
|
11
8
|
this.type = type;
|
|
12
9
|
this.rootNode = rootNode;
|
|
@@ -14,26 +11,25 @@ var AbstractNode = /** @class */ (function () {
|
|
|
14
11
|
this.rootNode.addNode(this);
|
|
15
12
|
}
|
|
16
13
|
}
|
|
17
|
-
|
|
14
|
+
isEqualToOtherNode(otherNode,
|
|
18
15
|
// optimisation shortcut, is faster if own string already known
|
|
19
|
-
ownString) {
|
|
20
|
-
|
|
21
|
-
var ret = ownString === otherNode.toString();
|
|
16
|
+
ownString = this.toString()) {
|
|
17
|
+
const ret = ownString === otherNode.toString();
|
|
22
18
|
return ret;
|
|
23
|
-
}
|
|
19
|
+
}
|
|
24
20
|
// deletes the whole node
|
|
25
|
-
|
|
21
|
+
remove() {
|
|
26
22
|
this.ensureNotDeleted('remove');
|
|
27
23
|
// console.log('AbstractNode().remove() node: ' + this.id);
|
|
28
24
|
// console.log(this.toJSON(true));
|
|
29
25
|
if (this.isInternalNode()) {
|
|
30
|
-
|
|
26
|
+
const useNode = this;
|
|
31
27
|
if (useNode.parents.size > 0) {
|
|
32
28
|
throw new Error('cannot remove node with parents ' + this.id);
|
|
33
29
|
}
|
|
34
30
|
}
|
|
35
31
|
if (this.branches) {
|
|
36
|
-
|
|
32
|
+
const useNode = this;
|
|
37
33
|
if (useNode.branches.areBranchesStrictEqual()) {
|
|
38
34
|
useNode.branches.getBranch('0').parents.remove(useNode);
|
|
39
35
|
}
|
|
@@ -44,10 +40,9 @@ var AbstractNode = /** @class */ (function () {
|
|
|
44
40
|
}
|
|
45
41
|
this.deleted = true;
|
|
46
42
|
this.rootNode.removeNode(this);
|
|
47
|
-
}
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
var ret = {
|
|
43
|
+
}
|
|
44
|
+
toJSON(withId = false) {
|
|
45
|
+
const ret = {
|
|
51
46
|
id: withId ? this.id : undefined,
|
|
52
47
|
deleted: withId ? this.deleted : undefined,
|
|
53
48
|
type: this.type,
|
|
@@ -60,22 +55,22 @@ var AbstractNode = /** @class */ (function () {
|
|
|
60
55
|
ret.value = this.asLeafNode().value;
|
|
61
56
|
}
|
|
62
57
|
if (this.branches && !this.branches.deleted) {
|
|
63
|
-
|
|
58
|
+
const branches = this.branches;
|
|
64
59
|
ret.branches = {
|
|
65
60
|
'0': branches.getBranch('0').toJSON(withId),
|
|
66
61
|
'1': branches.getBranch('1').toJSON(withId)
|
|
67
62
|
};
|
|
68
63
|
}
|
|
69
64
|
return ret;
|
|
70
|
-
}
|
|
65
|
+
}
|
|
71
66
|
// a strange string-representation
|
|
72
67
|
// to make an equal check between nodes
|
|
73
|
-
|
|
74
|
-
|
|
68
|
+
toString() {
|
|
69
|
+
let ret = '' +
|
|
75
70
|
'<' +
|
|
76
71
|
this.type + ':' + this.level;
|
|
77
72
|
if (this.branches) {
|
|
78
|
-
|
|
73
|
+
const branches = this.branches;
|
|
79
74
|
ret += '|0:' + branches.getBranch('0');
|
|
80
75
|
ret += '|1:' + branches.getBranch('1');
|
|
81
76
|
}
|
|
@@ -84,43 +79,42 @@ var AbstractNode = /** @class */ (function () {
|
|
|
84
79
|
}
|
|
85
80
|
ret += '>';
|
|
86
81
|
return ret;
|
|
87
|
-
}
|
|
88
|
-
|
|
82
|
+
}
|
|
83
|
+
isRootNode() {
|
|
89
84
|
return this.type === 'RootNode';
|
|
90
|
-
}
|
|
91
|
-
|
|
85
|
+
}
|
|
86
|
+
isInternalNode() {
|
|
92
87
|
return this.type === 'InternalNode';
|
|
93
|
-
}
|
|
94
|
-
|
|
88
|
+
}
|
|
89
|
+
isLeafNode() {
|
|
95
90
|
return this.type === 'LeafNode';
|
|
96
|
-
}
|
|
97
|
-
|
|
91
|
+
}
|
|
92
|
+
asRootNode() {
|
|
98
93
|
if (!this.isRootNode()) {
|
|
99
94
|
throw new Error('ouch');
|
|
100
95
|
}
|
|
101
96
|
return this;
|
|
102
|
-
}
|
|
103
|
-
|
|
97
|
+
}
|
|
98
|
+
asInternalNode() {
|
|
104
99
|
if (!this.isInternalNode()) {
|
|
105
100
|
throw new Error('ouch');
|
|
106
101
|
}
|
|
107
102
|
return this;
|
|
108
|
-
}
|
|
109
|
-
|
|
103
|
+
}
|
|
104
|
+
asLeafNode() {
|
|
110
105
|
if (!this.isLeafNode()) {
|
|
111
106
|
throw new Error('ouch');
|
|
112
107
|
}
|
|
113
108
|
return this;
|
|
114
|
-
}
|
|
115
|
-
|
|
116
|
-
if (op === void 0) { op = 'unknown'; }
|
|
109
|
+
}
|
|
110
|
+
ensureNotDeleted(op = 'unknown') {
|
|
117
111
|
if (this.deleted) {
|
|
118
112
|
throw new Error('forbidden operation ' + op + ' on deleted node ' + this.id);
|
|
119
113
|
}
|
|
120
|
-
}
|
|
121
|
-
|
|
114
|
+
}
|
|
115
|
+
log() {
|
|
122
116
|
console.log(JSON.stringify(this.toJSON(true), null, 2));
|
|
123
|
-
}
|
|
117
|
+
}
|
|
124
118
|
/**
|
|
125
119
|
* by the elimination-rule of bdd,
|
|
126
120
|
* if two branches of the same level are equal,
|
|
@@ -129,35 +123,34 @@ var AbstractNode = /** @class */ (function () {
|
|
|
129
123
|
* See page 21 at:
|
|
130
124
|
* @link https://people.eecs.berkeley.edu/~sseshia/219c/lectures/BinaryDecisionDiagrams.pdf
|
|
131
125
|
*/
|
|
132
|
-
|
|
126
|
+
applyEliminationRule(
|
|
133
127
|
// can be provided for better performance
|
|
134
128
|
nodesOfSameLevel) {
|
|
135
|
-
var _this = this;
|
|
136
129
|
this.ensureNotDeleted('applyEliminationRule');
|
|
137
130
|
if (!nodesOfSameLevel) {
|
|
138
131
|
nodesOfSameLevel = this.rootNode.getNodesOfLevel(this.level);
|
|
139
132
|
}
|
|
140
|
-
|
|
133
|
+
const other = findSimilarNode(this, nodesOfSameLevel);
|
|
141
134
|
if (other) {
|
|
142
135
|
// console.log('applyEliminationRule() remove:' + this.id + '; other: ' + other.id);
|
|
143
136
|
// keep 'other', remove 'this'
|
|
144
137
|
// move own parents to other
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
ownParents.forEach(
|
|
138
|
+
const ownParents = this.parents.getAll();
|
|
139
|
+
const parentsWithStrictEqualBranches = [];
|
|
140
|
+
ownParents.forEach((parent) => {
|
|
148
141
|
// console.log('ownParent: ' + parent.id);
|
|
149
|
-
|
|
142
|
+
const branchKey = parent.branches.getKeyOfNode(this);
|
|
150
143
|
// console.log('branchKey: ' + branchKey);
|
|
151
144
|
parent.branches.setBranch(branchKey, other);
|
|
152
145
|
if (parent.branches.areBranchesStrictEqual()) {
|
|
153
|
-
|
|
146
|
+
parentsWithStrictEqualBranches.push(parent);
|
|
154
147
|
}
|
|
155
148
|
// remove parents from own list
|
|
156
149
|
// this will auto-remove the connection to the other '1'-branch
|
|
157
|
-
|
|
150
|
+
this.parents.remove(parent);
|
|
158
151
|
});
|
|
159
152
|
// parents that now have equal branches, must be removed again
|
|
160
|
-
|
|
153
|
+
parentsWithStrictEqualBranches.forEach(node => {
|
|
161
154
|
if (node.isInternalNode()) {
|
|
162
155
|
// console.log('trigger applyReductionRule from applyEliminationRule');
|
|
163
156
|
node.applyReductionRule();
|
|
@@ -168,8 +161,6 @@ var AbstractNode = /** @class */ (function () {
|
|
|
168
161
|
else {
|
|
169
162
|
return false;
|
|
170
163
|
}
|
|
171
|
-
}
|
|
172
|
-
|
|
173
|
-
}());
|
|
174
|
-
exports.AbstractNode = AbstractNode;
|
|
164
|
+
}
|
|
165
|
+
}
|
|
175
166
|
//# sourceMappingURL=abstract-node.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"abstract-node.js","sourceRoot":"","sources":["../../src/abstract-node.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"abstract-node.js","sourceRoot":"","sources":["../../src/abstract-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAMpC,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAEtD,MAAM,OAAO,YAAY;IAMrB,YACW,KAAa,EACpB,QAAyB,EACzB,IAAc;QAFP,UAAK,GAAL,KAAK,CAAQ;QANf,OAAE,GAAW,UAAU,EAAE,CAAC;QAC5B,YAAO,GAAY,KAAK,CAAC;QAS5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEjB,IAAI,CAAC,QAAQ,GAAG,QAAoB,CAAC;QACrC,IAAI,QAAQ,EAAE;YACV,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAW,CAAC,CAAC;SACtC;IACL,CAAC;IAED,kBAAkB,CACd,SAAiC;IACjC,+DAA+D;IAC/D,YAAoB,IAAI,CAAC,QAAQ,EAAE;QAEnC,MAAM,GAAG,GAAG,SAAS,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;QAC/C,OAAO,GAAG,CAAC;IACf,CAAC;IAED,yBAAyB;IAClB,MAAM;QACT,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEhC,2DAA2D;QAC3D,kCAAkC;QAElC,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;YACvB,MAAM,OAAO,GAAiB,IAAW,CAAC;YAC1C,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE;gBAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;aACjE;SACJ;QAED,IAAK,IAAY,CAAC,QAAQ,EAAE;YACxB,MAAM,OAAO,GAAgB,IAAW,CAAC;YACzC,IAAI,OAAO,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;gBAC3C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC3D;iBAAM;gBACH,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACxD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC3D;SACJ;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAW,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,SAAkB,KAAK;QAC1B,MAAM,GAAG,GAAQ;YACb,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;YAChC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;YAC1C,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;SACpB,CAAC;QAEF,IAAI,MAAM,IAAK,IAAY,CAAC,OAAO,EAAE;YACjC,GAAG,CAAC,OAAO,GAAI,IAAY,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;SAClD;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;SACvC;QACD,IAAK,IAAY,CAAC,QAAQ,IAAI,CAAE,IAAY,CAAC,QAAQ,CAAC,OAAO,EAAE;YAC3D,MAAM,QAAQ,GAAc,IAAY,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,QAAQ,GAAG;gBACX,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;gBAC3C,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;aAC9C,CAAC;SACL;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAGD,kCAAkC;IAClC,uCAAuC;IACvC,QAAQ;QACJ,IAAI,GAAG,GAAG,EAAE;YACR,GAAG;YACH,IAAI,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QAEjC,IAAK,IAAY,CAAC,QAAQ,EAAE;YACxB,MAAM,QAAQ,GAAc,IAAY,CAAC,QAAQ,CAAC;YAClD,GAAG,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACvC,GAAG,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;SAC1C;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,GAAG,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC;SAC1C;QACD,GAAG,IAAI,GAAG,CAAC;QACX,OAAO,GAAG,CAAC;IACf,CAAC;IAGD,UAAU;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;IACpC,CAAC;IACD,cAAc;QACV,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,CAAC;IACxC,CAAC;IACD,UAAU;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;IACpC,CAAC;IAED,UAAU;QACN,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;YACpB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IACD,cAAc;QACV,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE;YACxB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IACD,UAAU;QACN,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;YACpB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;SAC3B;QACD,OAAO,IAAW,CAAC;IACvB,CAAC;IAED,gBAAgB,CAAC,KAAa,SAAS;QACnC,IAAI,IAAI,CAAC,OAAO,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,EAAE,GAAG,mBAAmB,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;SAChF;IACL,CAAC;IAEM,GAAG;QACN,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;;;GAOD;IACC,oBAAoB;IAChB,yCAAyC;IACzC,gBAAsB;QAEtB,IAAI,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC;QAC9C,IAAI,CAAC,gBAAgB,EAAE;YACnB,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAU,CAAC;SACzE;QAED,MAAM,KAAK,GAAG,eAAe,CACzB,IAAI,EACJ,gBAAyB,CAC5B,CAAC;QACF,IAAI,KAAK,EAAE;YACP,oFAAoF;YAEpF,8BAA8B;YAE9B,4BAA4B;YAC5B,MAAM,UAAU,GAAI,IAAY,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,8BAA8B,GAAkB,EAAE,CAAC;YACzD,UAAU,CAAC,OAAO,CAAC,CAAC,MAAoB,EAAE,EAAE;gBACxC,0CAA0C;gBAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAW,CAAC,CAAC;gBAC5D,0CAA0C;gBAC1C,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAE5C,IAAI,MAAM,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;oBAC1C,8BAA8B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC/C;gBACD,+BAA+B;gBAC/B,+DAA+D;gBAC9D,IAAY,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,8DAA8D;YAC9D,8BAA8B,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC1C,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE;oBACvB,uEAAuE;oBACtE,IAAqB,CAAC,kBAAkB,EAAE,CAAC;iBAC/C;YACL,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;CACJ"}
|
package/dist/lib/branches.js
CHANGED
|
@@ -1,25 +1,22 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.ensureNodesNotStrictEqual = exports.Branches = void 0;
|
|
4
1
|
/**
|
|
5
2
|
* represents the branches of a single node
|
|
6
3
|
*/
|
|
7
|
-
|
|
8
|
-
|
|
4
|
+
export class Branches {
|
|
5
|
+
constructor(node) {
|
|
9
6
|
this.node = node;
|
|
10
7
|
this.deleted = false;
|
|
11
8
|
this.branches = {};
|
|
12
9
|
}
|
|
13
|
-
|
|
14
|
-
|
|
10
|
+
setBranch(which, branchNode) {
|
|
11
|
+
const previous = this.branches[which];
|
|
15
12
|
if (previous === branchNode) {
|
|
16
13
|
return;
|
|
17
14
|
}
|
|
18
15
|
// set new branch
|
|
19
16
|
this.branches[which] = branchNode;
|
|
20
17
|
branchNode.parents.add(this.node);
|
|
21
|
-
}
|
|
22
|
-
|
|
18
|
+
}
|
|
19
|
+
getKeyOfNode(node) {
|
|
23
20
|
if (this.getBranch('0') === node) {
|
|
24
21
|
return '0';
|
|
25
22
|
}
|
|
@@ -29,17 +26,17 @@ var Branches = /** @class */ (function () {
|
|
|
29
26
|
else {
|
|
30
27
|
throw new Error('none matched');
|
|
31
28
|
}
|
|
32
|
-
}
|
|
33
|
-
|
|
29
|
+
}
|
|
30
|
+
getBranch(which) {
|
|
34
31
|
return this.branches[which];
|
|
35
|
-
}
|
|
36
|
-
|
|
32
|
+
}
|
|
33
|
+
getBothBranches() {
|
|
37
34
|
return [
|
|
38
35
|
this.getBranch('0'),
|
|
39
36
|
this.getBranch('1')
|
|
40
37
|
];
|
|
41
|
-
}
|
|
42
|
-
|
|
38
|
+
}
|
|
39
|
+
hasBranchAsNode(node) {
|
|
43
40
|
if (this.getBranch('0') === node ||
|
|
44
41
|
this.getBranch('1') === node) {
|
|
45
42
|
return true;
|
|
@@ -47,8 +44,8 @@ var Branches = /** @class */ (function () {
|
|
|
47
44
|
else {
|
|
48
45
|
return false;
|
|
49
46
|
}
|
|
50
|
-
}
|
|
51
|
-
|
|
47
|
+
}
|
|
48
|
+
hasNodeIdAsBranch(id) {
|
|
52
49
|
if (this.getBranch('0').id === id ||
|
|
53
50
|
this.getBranch('1').id === id) {
|
|
54
51
|
return true;
|
|
@@ -56,21 +53,18 @@ var Branches = /** @class */ (function () {
|
|
|
56
53
|
else {
|
|
57
54
|
return false;
|
|
58
55
|
}
|
|
59
|
-
}
|
|
60
|
-
|
|
56
|
+
}
|
|
57
|
+
areBranchesStrictEqual() {
|
|
61
58
|
return this.branches['0'] === this.branches['1'];
|
|
62
|
-
}
|
|
63
|
-
|
|
59
|
+
}
|
|
60
|
+
hasEqualBranches() {
|
|
64
61
|
return JSON.stringify(this.branches['0']) ===
|
|
65
62
|
JSON.stringify(this.branches['1']);
|
|
66
|
-
}
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
exports.Branches = Branches;
|
|
70
|
-
function ensureNodesNotStrictEqual(node1, node2) {
|
|
63
|
+
}
|
|
64
|
+
}
|
|
65
|
+
export function ensureNodesNotStrictEqual(node1, node2) {
|
|
71
66
|
if (node1 === node2) {
|
|
72
67
|
throw new Error('cannot have two strict equal branches');
|
|
73
68
|
}
|
|
74
69
|
}
|
|
75
|
-
exports.ensureNodesNotStrictEqual = ensureNodesNotStrictEqual;
|
|
76
70
|
//# sourceMappingURL=branches.js.map
|
package/dist/lib/branches.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"branches.js","sourceRoot":"","sources":["../../src/branches.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"branches.js","sourceRoot":"","sources":["../../src/branches.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,OAAO,QAAQ;IAMjB,YACY,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QANtB,YAAO,GAAY,KAAK,CAAC;QACxB,aAAQ,GAEZ,EAAS,CAAC;IAIV,CAAC;IAEE,SAAS,CAAC,KAAoB,EAAE,UAAuB;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,QAAQ,KAAK,UAAU,EAAE;YACzB,OAAO;SACV;QAED,iBAAiB;QACjB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;QAClC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEM,YAAY,CAAC,IAAiB;QACjC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;YAC9B,OAAO,GAAG,CAAC;SACd;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;YACrC,OAAO,GAAG,CAAC;SACd;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACnC;IACL,CAAC;IAEM,SAAS,CAAC,KAAoB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAEM,eAAe;QAClB,OAAO;YACH,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;SACtB,CAAC;IACN,CAAC;IAEM,eAAe,CAAC,IAAkB;QACrC,IACI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI;YAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,EAC9B;YACE,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;IAEM,iBAAiB,CAAC,EAAU;QAC/B,IACI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE;YAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,EAC/B;YACE,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,KAAK,CAAC;SAChB;IACL,CAAC;IAEM,sBAAsB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAEM,gBAAgB;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;CACJ;AAED,MAAM,UAAU,yBAAyB,CACrC,KAAkB,EAClB,KAAkB;IAElB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;KAC5D;AACL,CAAC"}
|
|
@@ -1,76 +1,34 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
};
|
|
11
|
-
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
12
|
-
};
|
|
13
|
-
var __read = (this && this.__read) || function (o, n) {
|
|
14
|
-
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
15
|
-
if (!m) return o;
|
|
16
|
-
var i = m.call(o), r, ar = [], e;
|
|
17
|
-
try {
|
|
18
|
-
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
19
|
-
}
|
|
20
|
-
catch (error) { e = { error: error }; }
|
|
21
|
-
finally {
|
|
22
|
-
try {
|
|
23
|
-
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
24
|
-
}
|
|
25
|
-
finally { if (e) throw e.error; }
|
|
26
|
-
}
|
|
27
|
-
return ar;
|
|
28
|
-
};
|
|
29
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
30
|
-
exports.createBddFromTruthTable = void 0;
|
|
31
|
-
var root_node_1 = require("./root-node");
|
|
32
|
-
var util_1 = require("./util");
|
|
33
|
-
var internal_node_1 = require("./internal-node");
|
|
34
|
-
var leaf_node_1 = require("./leaf-node");
|
|
35
|
-
function createBddFromTruthTable(truthTable) {
|
|
36
|
-
var e_1, _a;
|
|
37
|
-
var root = new root_node_1.RootNode();
|
|
38
|
-
var firstKey = truthTable.keys().next().value;
|
|
39
|
-
var keyLength = firstKey.length;
|
|
40
|
-
var mustBeSize = Math.pow(2, keyLength);
|
|
1
|
+
import { RootNode } from './root-node';
|
|
2
|
+
import { lastChar } from './util';
|
|
3
|
+
import { InternalNode } from './internal-node';
|
|
4
|
+
import { LeafNode } from './leaf-node';
|
|
5
|
+
export function createBddFromTruthTable(truthTable) {
|
|
6
|
+
const root = new RootNode();
|
|
7
|
+
const firstKey = truthTable.keys().next().value;
|
|
8
|
+
const keyLength = firstKey.length;
|
|
9
|
+
const mustBeSize = Math.pow(2, keyLength);
|
|
41
10
|
if (truthTable.size !== mustBeSize) {
|
|
42
11
|
throw new Error('truth table has missing entries');
|
|
43
12
|
}
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
if (!lastNode.branches.getBranch(state)) {
|
|
54
|
-
lastNode.branches.setBranch(state, new internal_node_1.InternalNode(level, root, lastNode));
|
|
55
|
-
}
|
|
56
|
-
lastNode = lastNode.branches.getBranch(state);
|
|
57
|
-
}
|
|
58
|
-
// last node is leaf-node
|
|
59
|
-
var lastState = (0, util_1.lastChar)(stateSet);
|
|
60
|
-
if (lastNode.branches.getBranch(lastState)) {
|
|
61
|
-
throw new Error('leafNode already exists, this should not happen');
|
|
13
|
+
for (const [stateSet, value] of truthTable) {
|
|
14
|
+
let lastNode = root;
|
|
15
|
+
// itterate over each char of the state
|
|
16
|
+
for (let i = 0; i < (stateSet.length - 1); i++) {
|
|
17
|
+
const level = i + 1;
|
|
18
|
+
const state = stateSet.charAt(i);
|
|
19
|
+
// if node for this state-char not exists, add new one
|
|
20
|
+
if (!lastNode.branches.getBranch(state)) {
|
|
21
|
+
lastNode.branches.setBranch(state, new InternalNode(level, root, lastNode));
|
|
62
22
|
}
|
|
63
|
-
lastNode.branches.
|
|
23
|
+
lastNode = lastNode.branches.getBranch(state);
|
|
64
24
|
}
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
if (truthTable_1_1 && !truthTable_1_1.done && (_a = truthTable_1.return)) _a.call(truthTable_1);
|
|
25
|
+
// last node is leaf-node
|
|
26
|
+
const lastState = lastChar(stateSet);
|
|
27
|
+
if (lastNode.branches.getBranch(lastState)) {
|
|
28
|
+
throw new Error('leafNode already exists, this should not happen');
|
|
70
29
|
}
|
|
71
|
-
|
|
30
|
+
lastNode.branches.setBranch(lastState, new LeafNode(stateSet.length, root, value, lastNode));
|
|
72
31
|
}
|
|
73
32
|
return root;
|
|
74
33
|
}
|
|
75
|
-
exports.createBddFromTruthTable = createBddFromTruthTable;
|
|
76
34
|
//# sourceMappingURL=create-bdd-from-truth-table.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"create-bdd-from-truth-table.js","sourceRoot":"","sources":["../../src/create-bdd-from-truth-table.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"create-bdd-from-truth-table.js","sourceRoot":"","sources":["../../src/create-bdd-from-truth-table.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,MAAM,UAAU,uBAAuB,CACnC,UAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAE,CAAC;IAE5B,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;IAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1C,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE;QAChC,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;KACtD;IAGD,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE;QACxC,IAAI,QAAQ,GAAgB,IAAI,CAAC;QAEjC,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,KAAK,GAAkB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAkB,CAAC;YAEjE,sDAAsD;YACtD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;gBACrC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CACvB,KAAK,EACL,IAAI,YAAY,CACZ,KAAK,EACL,IAAI,EACJ,QAAQ,CACX,CACJ,CAAC;aACL;YACD,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAgB,CAAC;SAChE;QAED,yBAAyB;QACzB,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAkB,CAAC;QACtD,IAAI,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;YACxC,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;SACtE;QACD,QAAQ,CAAC,QAAQ,CAAC,SAAS,CACvB,SAAS,EACT,IAAI,QAAQ,CACR,QAAQ,CAAC,MAAM,EACf,IAAI,EACJ,KAAK,EACL,QAAQ,CACX,CACJ,CAAC;KACL;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}
|
|
@@ -1,33 +1,30 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.getNodesRecursive = exports.ensureCorrectBdd = void 0;
|
|
4
1
|
/**
|
|
5
2
|
* run some tests on the bdd
|
|
6
3
|
* to ensure everything is correct
|
|
7
4
|
*/
|
|
8
|
-
function ensureCorrectBdd(bdd) {
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
bdd.getLevels().forEach(
|
|
13
|
-
|
|
14
|
-
levelNodes.forEach(
|
|
5
|
+
export function ensureCorrectBdd(bdd) {
|
|
6
|
+
const jsonString = JSON.stringify(bdd.toJSON(true));
|
|
7
|
+
let allNodes = [];
|
|
8
|
+
const nodesById = new Map();
|
|
9
|
+
bdd.getLevels().forEach(level => {
|
|
10
|
+
const levelNodes = bdd.getNodesOfLevel(level);
|
|
11
|
+
levelNodes.forEach(node => {
|
|
15
12
|
nodesById.set(node.id, node);
|
|
16
13
|
});
|
|
17
14
|
allNodes = allNodes.concat(levelNodes);
|
|
18
15
|
});
|
|
19
|
-
|
|
16
|
+
const recursiveNodes = getNodesRecursive(bdd);
|
|
20
17
|
if (allNodes.length !== recursiveNodes.size) {
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
18
|
+
const allNodesIds = allNodes.map(n => n.id).sort();
|
|
19
|
+
const recursiveNodesIds = Array.from(recursiveNodes).map(n => n.id).sort();
|
|
20
|
+
const nodesOnlyInRecursive = recursiveNodesIds.filter(id => !allNodesIds.includes(id));
|
|
24
21
|
// console.log(JSON.stringify(allNodes.map(n => n.id).sort(), null, 2));
|
|
25
22
|
// console.log(JSON.stringify(Array.from(recursiveNodes).map(n => n.id).sort(), null, 2));
|
|
26
23
|
if (recursiveNodes.size > allNodes.length) {
|
|
27
|
-
|
|
28
|
-
|
|
24
|
+
const firstId = nodesOnlyInRecursive[0];
|
|
25
|
+
const referenceToFirst = allNodes.find(n => {
|
|
29
26
|
if (n.isInternalNode()) {
|
|
30
|
-
return n.branches.hasNodeIdAsBranch(
|
|
27
|
+
return n.branches.hasNodeIdAsBranch(firstId);
|
|
31
28
|
}
|
|
32
29
|
return false;
|
|
33
30
|
});
|
|
@@ -40,11 +37,11 @@ function ensureCorrectBdd(bdd) {
|
|
|
40
37
|
'recursiveNodes: ' + recursiveNodes.size + ' ' +
|
|
41
38
|
'nodesOnlyInRecursive: ' + nodesOnlyInRecursive.join(', ') + ' ');
|
|
42
39
|
}
|
|
43
|
-
allNodes.forEach(
|
|
40
|
+
allNodes.forEach(node => {
|
|
44
41
|
if (node.isRootNode()) {
|
|
45
42
|
return;
|
|
46
43
|
}
|
|
47
|
-
|
|
44
|
+
const useNode = node;
|
|
48
45
|
if (node.deleted) {
|
|
49
46
|
throw new Error('ensureCorrectBdd() ' +
|
|
50
47
|
'bdd includes a deleted node');
|
|
@@ -55,24 +52,24 @@ function ensureCorrectBdd(bdd) {
|
|
|
55
52
|
'node has no parent ' + useNode.id);
|
|
56
53
|
}
|
|
57
54
|
if (useNode.isInternalNode()) {
|
|
58
|
-
|
|
59
|
-
|
|
55
|
+
const internalNode = useNode;
|
|
56
|
+
const bothBranches = internalNode.branches.getBothBranches();
|
|
60
57
|
// a node should not have 2 equal branches
|
|
61
|
-
if (
|
|
58
|
+
if (internalNode.branches.areBranchesStrictEqual()) {
|
|
62
59
|
throw new Error('ensureCorrectBdd() ' +
|
|
63
60
|
'node has two equal branches: ' +
|
|
64
|
-
bothBranches.map(
|
|
61
|
+
bothBranches.map(n => n.id).join(', '));
|
|
65
62
|
}
|
|
66
63
|
// each branch should have the node as parent
|
|
67
|
-
bothBranches.forEach(
|
|
68
|
-
if (!branch.parents.has(
|
|
64
|
+
bothBranches.forEach(branch => {
|
|
65
|
+
if (!branch.parents.has(internalNode)) {
|
|
69
66
|
throw new Error('ensureCorrectBdd() ' +
|
|
70
67
|
'branch must have the node as parent');
|
|
71
68
|
}
|
|
72
69
|
});
|
|
73
70
|
}
|
|
74
71
|
// each parent should have the child as branch
|
|
75
|
-
useNode.parents.getAll().forEach(
|
|
72
|
+
useNode.parents.getAll().forEach(parent => {
|
|
76
73
|
if (!parent.branches.hasBranchAsNode(useNode)) {
|
|
77
74
|
throw new Error('ensureCorrectBdd() ' +
|
|
78
75
|
'parent node does not have child as branch');
|
|
@@ -84,20 +81,17 @@ function ensureCorrectBdd(bdd) {
|
|
|
84
81
|
'bdd includes a deleted node');
|
|
85
82
|
}
|
|
86
83
|
}
|
|
87
|
-
|
|
88
|
-
function getNodesRecursive(node, set) {
|
|
89
|
-
if (set === void 0) { set = new Set(); }
|
|
84
|
+
export function getNodesRecursive(node, set = new Set()) {
|
|
90
85
|
set.add(node);
|
|
91
86
|
if (!node.isLeafNode()) {
|
|
92
|
-
|
|
93
|
-
|
|
87
|
+
const useNode = node;
|
|
88
|
+
const branch1 = useNode.branches.getBranch('0');
|
|
94
89
|
set.add(branch1);
|
|
95
90
|
getNodesRecursive(branch1, set);
|
|
96
|
-
|
|
91
|
+
const branch2 = useNode.branches.getBranch('1');
|
|
97
92
|
set.add(branch2);
|
|
98
93
|
getNodesRecursive(branch2, set);
|
|
99
94
|
}
|
|
100
95
|
return set;
|
|
101
96
|
}
|
|
102
|
-
exports.getNodesRecursive = getNodesRecursive;
|
|
103
97
|
//# sourceMappingURL=ensure-correct-bdd.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"ensure-correct-bdd.js","sourceRoot":"","sources":["../../src/ensure-correct-bdd.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"ensure-correct-bdd.js","sourceRoot":"","sources":["../../src/ensure-correct-bdd.ts"],"names":[],"mappings":"AAKA;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAa;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAGpD,IAAI,QAAQ,GAAmB,EAAE,CAAC;IAClC,MAAM,SAAS,GAA8B,IAAI,GAAG,EAAE,CAAC;IACvD,GAAG,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9C,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACtB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QACH,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAGH,MAAM,cAAc,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAE9C,IAAI,QAAQ,CAAC,MAAM,KAAK,cAAc,CAAC,IAAI,EAAE;QAEzC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3E,MAAM,oBAAoB,GAAa,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjG,+EAA+E;QAC/E,+FAA+F;QAE/F,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE;YACvC,MAAM,OAAO,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACvC,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBACpB,OAAQ,CAAkB,CAAC,QAAQ,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;iBAClE;gBACD,OAAO,KAAK,CAAC;YACjB,CAAC,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;YACjC,gBAAgB,aAAhB,gBAAgB,uBAAhB,gBAAgB,CAAE,GAAG,EAAE,CAAC;SAC3B;QAED,MAAM,IAAI,KAAK,CACX,qBAAqB;YACrB,kDAAkD;YAClD,YAAY,GAAG,QAAQ,CAAC,MAAM,GAAG,GAAG;YACpC,kBAAkB,GAAG,cAAc,CAAC,IAAI,GAAG,GAAG;YAC9C,wBAAwB,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CACnE,CAAC;KACL;IAED,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACpB,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACnB,OAAO;SACV;QACD,MAAM,OAAO,GAAG,IAAmB,CAAC;QAEpC,IAAI,IAAI,CAAC,OAAO,EAAE;YACd,MAAM,IAAI,KAAK,CACX,qBAAqB;gBACrB,6BAA6B,CAChC,CAAC;SACL;QAED,iCAAiC;QACjC,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CACX,qBAAqB;gBACrB,qBAAqB,GAAG,OAAO,CAAC,EAAE,CACrC,CAAC;SACL;QAED,IAAI,OAAO,CAAC,cAAc,EAAE,EAAE;YAC1B,MAAM,YAAY,GAAiB,OAAc,CAAC;YAClD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC;YAE7D,0CAA0C;YAC1C,IAAI,YAAY,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE;gBAChD,MAAM,IAAI,KAAK,CACX,qBAAqB;oBACrB,+BAA+B;oBAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACzC,CAAC;aACL;YAED,6CAA6C;YAC7C,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBAC1B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;oBACnC,MAAM,IAAI,KAAK,CACX,qBAAqB;wBACrB,qCAAqC,CACxC,CAAC;iBACL;YACL,CAAC,CAAC,CAAC;SACN;QAED,8CAA8C;QAC9C,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE;gBAC3C,MAAM,IAAI,KAAK,CACX,qBAAqB;oBACrB,2CAA2C,CAC9C,CAAC;aACL;QACL,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAGH,IAAI,UAAU,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;QACvC,MAAM,IAAI,KAAK,CACX,qBAAqB;YACrB,6BAA6B,CAChC,CAAC;KACL;AACL,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC7B,IAAkB,EAClB,MAAyB,IAAI,GAAG,EAAE;IAElC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACd,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;QACpB,MAAM,OAAO,GAAG,IAAmB,CAAC;QAEpC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAChD,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjB,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEhC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAChD,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjB,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;KACnC;IAED,OAAO,GAAG,CAAC;AACf,CAAC"}
|
|
@@ -1,15 +1,12 @@
|
|
|
1
|
-
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.fillTruthTable = void 0;
|
|
4
|
-
var util_1 = require("./util");
|
|
1
|
+
import { minBinaryWithLength, maxBinaryWithLength, getNextStateSet } from './util';
|
|
5
2
|
/**
|
|
6
3
|
* fills each missing row of a table
|
|
7
4
|
* with the given value
|
|
8
5
|
*/
|
|
9
|
-
function fillTruthTable(truthTable, inputLength, value) {
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
6
|
+
export function fillTruthTable(truthTable, inputLength, value) {
|
|
7
|
+
const endInput = maxBinaryWithLength(inputLength);
|
|
8
|
+
let currentInput = minBinaryWithLength(inputLength);
|
|
9
|
+
let done = false;
|
|
13
10
|
while (!done) {
|
|
14
11
|
if (!truthTable.has(currentInput)) {
|
|
15
12
|
truthTable.set(currentInput, value);
|
|
@@ -18,9 +15,8 @@ function fillTruthTable(truthTable, inputLength, value) {
|
|
|
18
15
|
done = true;
|
|
19
16
|
}
|
|
20
17
|
else {
|
|
21
|
-
currentInput =
|
|
18
|
+
currentInput = getNextStateSet(currentInput);
|
|
22
19
|
}
|
|
23
20
|
}
|
|
24
21
|
}
|
|
25
|
-
exports.fillTruthTable = fillTruthTable;
|
|
26
22
|
//# sourceMappingURL=fill-truth-table.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"fill-truth-table.js","sourceRoot":"","sources":["../../src/fill-truth-table.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"fill-truth-table.js","sourceRoot":"","sources":["../../src/fill-truth-table.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,mBAAmB,EACnB,mBAAmB,EACnB,eAAe,EAClB,MAAM,QAAQ,CAAC;AAGhB;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC1B,UAAsB,EACtB,WAAmB,EACnB,KAAa;IAEb,MAAM,QAAQ,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;IAClD,IAAI,YAAY,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;IACpD,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,OAAO,CAAC,IAAI,EAAE;QACV,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;YAC/B,UAAU,CAAC,GAAG,CACV,YAAY,EACZ,KAAK,CACR,CAAC;SACL;QACD,IAAI,YAAY,KAAK,QAAQ,EAAE;YAC3B,IAAI,GAAG,IAAI,CAAC;SACf;aAAM;YACH,YAAY,GAAG,eAAe,CAC1B,YAAY,CACf,CAAC;SACL;KACJ;AACL,CAAC"}
|