@compute.ts/boolean/lib/ComputeBooleanNode.js

Provide boolean operators for the computeTS package

"use strict";var __extends=this&&this.__extends||function(){var t=function(r,o){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(r,o){r.__proto__=o}||function(r,o){for(var e in o)o.hasOwnProperty(e)&&(r[e]=o[e])})(r,o)};return function(r,o){function e(){this.constructor=r}t(r,o),r.prototype=null===o?Object.create(o):(e.prototype=o.prototype,new e)}}(),__spreadArrays=this&&this.__spreadArrays||function(){for(var r=0,o=0,e=arguments.length;o<e;o++)r+=arguments[o].length;for(var t=Array(r),n=0,o=0;o<e;o++)for(var a=arguments[o],i=0,p=a.length;i<p;i++,n++)t[n]=a[i];return t};Object.defineProperty(exports,"__esModule",{value:!0}),exports.ComputeBooleanNode=void 0;var core_1=require("@compute.ts/core"),ComputeBooleanLibrary_1=require("./ComputeBooleanLibrary"),ComputeBooleanNode=function(t){function n(r,o,e){e=t.call(this,r=void 0===r?[]:r,o,e)||this;return e.fingerprint=n.fingerprint,e}return __extends(n,t),n.leaf=function(r){return new n([],void 0,r)},n.expression=function(r,o){return new n(r=void 0===r?[]:r,o)},n.nodify=function(r){if("boolean"==typeof r)return n.leaf(r);if(r.fingerprint===n.fingerprint)return r;throw Error("A given value is not a boolean value or a boolean expression")},n.prototype.and=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.and.apply(void 0,__spreadArrays([this],r))},n.prototype.or=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.or.apply(void 0,__spreadArrays([this],r))},n.prototype.xand=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.xand.apply(void 0,__spreadArrays([this],r))},n.prototype.xor=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.xor.apply(void 0,__spreadArrays([this],r))},n.prototype.nand=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.nand.apply(void 0,__spreadArrays([this],r))},n.prototype.nor=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.nor.apply(void 0,__spreadArrays([this],r))},n.prototype.xnand=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.xnand.apply(void 0,__spreadArrays([this],r))},n.prototype.xnor=function(){for(var r=[],o=0;o<arguments.length;o++)r[o]=arguments[o];return ComputeBooleanLibrary_1.xnor.apply(void 0,__spreadArrays([this],r))},n.prototype.implies=function(r){return ComputeBooleanLibrary_1.implies(this,r)},n.prototype.equals=function(r){return ComputeBooleanLibrary_1.equals(this,r)},n.prototype.not=function(){return ComputeBooleanLibrary_1.not(this)},n.prototype.isTrue=function(){return ComputeBooleanLibrary_1.isTrue(this)},n.prototype.isFalse=function(){return ComputeBooleanLibrary_1.isFalse(this)},n.fingerprint="RfUjXn2r",n}(core_1.ComputeApiNode);exports.ComputeBooleanNode=ComputeBooleanNode;