rdflib 2.2.34 → 2.2.35-2bb9ed0b

package/lib/formula.js

@@ -5,12 +5,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-var _assertThisInitialized2 = _interopRequireDefault(require("@babel/runtime/helpers/assertThisInitialized"));
-var _inherits2 = _interopRequireDefault(require("@babel/runtime/helpers/inherits"));
-var _possibleConstructorReturn2 = _interopRequireDefault(require("@babel/runtime/helpers/possibleConstructorReturn"));
-var _getPrototypeOf2 = _interopRequireDefault(require("@babel/runtime/helpers/getPrototypeOf"));
 var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
 var _classOrder = _interopRequireDefault(require("./class-order"));
 var _collection = _interopRequireDefault(require("./collection"));
@@ -18,23 +12,16 @@ var _canonicalDataFactory = _interopRequireDefault(require("./factories/canonica
 var _log = _interopRequireDefault(require("./log"));
 var _namespace = _interopRequireDefault(require("./namespace"));
 var _nodeInternal = _interopRequireDefault(require("./node-internal"));
-var _serialize2 = _interopRequireDefault(require("./serialize"));
+var _serialize = _interopRequireDefault(require("./serialize"));
 var _types = require("./types");
 var _terms = require("./utils/terms");
 var _variable = _interopRequireDefault(require("./variable"));
 var _utils = require("./utils");
 var _namedNode = _interopRequireDefault(require("./named-node"));
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2.default)(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2.default)(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2.default)(this, result); }; }
-function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
 /**
  * A formula, or store of RDF statements
  */
-var Formula = /*#__PURE__*/function (_Node) {
-  (0, _inherits2.default)(Formula, _Node);
-  var _super = _createSuper(Formula);
+class Formula extends _nodeInternal.default {
   /**
    * Initializes this formula
    * @constructor
@@ -45,56 +32,42 @@ var Formula = /*#__PURE__*/function (_Node) {
    * @param opts
    * @param opts.rdfFactory - The rdf factory that should be used by the store
   */
-  function Formula() {
+  constructor() {
     var _this;
-    var statements = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-    var constraints = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
-    var initBindings = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-    var optional = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
-    var opts = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : {};
-    (0, _classCallCheck2.default)(this, Formula);
-    _this = _super.call(this, '');
-    _this.statements = statements;
-    _this.constraints = constraints;
-    _this.initBindings = initBindings;
-    _this.optional = optional;
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "termType", _types.GraphTermType);
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "classOrder", _classOrder.default.Graph);
+    let statements = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
+    let constraints = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+    let initBindings = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+    let optional = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
+    let opts = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : {};
+    super('');
+    _this = this;
+    this.statements = statements;
+    this.constraints = constraints;
+    this.initBindings = initBindings;
+    this.optional = optional;
+    (0, _defineProperty2.default)(this, "termType", _types.GraphTermType);
+    (0, _defineProperty2.default)(this, "classOrder", _classOrder.default.Graph);
     /**
      * The accompanying fetcher instance.
      *
      * Is set by the fetcher when initialized.
      */
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "fetcher", void 0);
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "isVar", 0);
+    (0, _defineProperty2.default)(this, "fetcher", void 0);
+    (0, _defineProperty2.default)(this, "isVar", 0);
     /**
      * A namespace for the specified namespace's URI
      * @param nsuri The URI for the namespace
      */
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "ns", _namespace.default);
+    (0, _defineProperty2.default)(this, "ns", _namespace.default);
     /** The factory used to generate statements and terms */
-    (0, _defineProperty2.default)((0, _assertThisInitialized2.default)(_this), "rdfFactory", void 0);
-    _this.rdfFactory = opts && opts.rdfFactory || _canonicalDataFactory.default;
+    (0, _defineProperty2.default)(this, "rdfFactory", void 0);
+    this.rdfFactory = opts && opts.rdfFactory || _canonicalDataFactory.default;
     // Enable default factory methods on this while preserving factory context.
-    var _iterator = _createForOfIteratorHelper(_utils.appliedFactoryMethods),
-      _step;
-    try {
-      var _loop = function _loop() {
-        var factoryMethod = _step.value;
-        _this[factoryMethod] = function () {
-          var _this$rdfFactory;
-          return (_this$rdfFactory = _this.rdfFactory)[factoryMethod].apply(_this$rdfFactory, arguments);
-        };
+    for (const factoryMethod of _utils.appliedFactoryMethods) {
+      this[factoryMethod] = function () {
+        return _this.rdfFactory[factoryMethod](...arguments);
       };
-      for (_iterator.s(); !(_step = _iterator.n()).done;) {
-        _loop();
-      }
-    } catch (err) {
-      _iterator.e(err);
-    } finally {
-      _iterator.f();
     }
-    return _this;
   }
 
   /** Add a statement from its parts
@@ -103,764 +76,684 @@ var Formula = /*#__PURE__*/function (_Node) {
    * @param object - the third part of the statement
    * @param graph - the last part of the statement
    */
-  (0, _createClass2.default)(Formula, [{
-    key: "add",
-    value: function add(subject, predicate, object, graph) {
-      var _this2 = this;
-      if (arguments.length === 1) {
-        subject.forEach(function (st) {
-          return _this2.add(st.subject, st.predicate, st.object, st.graph);
-        });
-      }
-      return this.statements.push(this.rdfFactory.quad(subject, predicate, object, graph));
+  add(subject, predicate, object, graph) {
+    if (arguments.length === 1) {
+      subject.forEach(st => this.add(st.subject, st.predicate, st.object, st.graph));
     }
+    return this.statements.push(this.rdfFactory.quad(subject, predicate, object, graph));
+  }
 
-    /** Add a statment object
-     * @param {Statement} statement - An existing constructed statement to add
-     */
-  }, {
-    key: "addStatement",
-    value: function addStatement(statement) {
-      return this.add(statement);
-    }
+  /** Add a statment object
+   * @param {Statement} statement - An existing constructed statement to add
+   */
+  addStatement(statement) {
+    return this.add(statement);
+  }
 
-    /**
-     * Shortcut for adding blankNodes
-     * @param [id]
-     */
-  }, {
-    key: "bnode",
-    value: function bnode(id) {
-      return this.rdfFactory.blankNode(id);
-    }
+  /**
+   * Shortcut for adding blankNodes
+   * @param [id]
+   */
+  bnode(id) {
+    return this.rdfFactory.blankNode(id);
+  }
 
-    /**
-     * Adds all the statements to this formula
-     * @param statements - A collection of statements
-     */
-  }, {
-    key: "addAll",
-    value: function addAll(statements) {
-      var _this3 = this;
-      statements.forEach(function (quad) {
-        _this3.add(quad.subject, quad.predicate, quad.object, quad.graph);
-      });
-    }
+  /**
+   * Adds all the statements to this formula
+   * @param statements - A collection of statements
+   */
+  addAll(statements) {
+    statements.forEach(quad => {
+      this.add(quad.subject, quad.predicate, quad.object, quad.graph);
+    });
+  }
 
-    /** Follow link from one node, using one wildcard, looking for one
-    *
-    * For example, any(me, knows, null, profile)  - a person I know accoring to my profile .
-    * any(me, knows, null, null)  - a person I know accoring to anything in store .
-    * any(null, knows, me, null)  - a person who know me accoring to anything in store .
-    *
-    * @param s - A node to search for as subject, or if null, a wildcard
-    * @param p - A node to search for as predicate, or if null, a wildcard
-    * @param o - A node to search for as object, or if null, a wildcard
-    * @param g - A node to search for as graph, or if null, a wildcard
-    * @returns A node which match the wildcard position, or null
-    */
-  }, {
-    key: "any",
-    value: function any(s, p, o, g) {
-      var st = this.anyStatementMatching(s, p, o, g);
-      if (st == null) {
-        return null;
-      } else if (s == null) {
-        return st.subject;
-      } else if (p == null) {
-        return st.predicate;
-      } else if (o == null) {
-        return st.object;
-      }
+  /** Follow link from one node, using one wildcard, looking for one
+  *
+  * For example, any(me, knows, null, profile)  - a person I know accoring to my profile .
+  * any(me, knows, null, null)  - a person I know accoring to anything in store .
+  * any(null, knows, me, null)  - a person who know me accoring to anything in store .
+  *
+  * @param s - A node to search for as subject, or if null, a wildcard
+  * @param p - A node to search for as predicate, or if null, a wildcard
+  * @param o - A node to search for as object, or if null, a wildcard
+  * @param g - A node to search for as graph, or if null, a wildcard
+  * @returns A node which match the wildcard position, or null
+  */
+  any(s, p, o, g) {
+    const st = this.anyStatementMatching(s, p, o, g);
+    if (st == null) {
       return null;
-    }
+    } else if (s == null) {
+      return st.subject;
+    } else if (p == null) {
+      return st.predicate;
+    } else if (o == null) {
+      return st.object;
+    }
+    return null;
+  }
 
-    /**
-     * Gets the value of a node that matches the specified pattern
-     * @param s The subject
-     * @param p The predicate
-     * @param o The object
-     * @param g The graph that contains the statement
-     */
-  }, {
-    key: "anyValue",
-    value: function anyValue(s, p, o, g) {
-      var y = this.any(s, p, o, g);
-      return y ? y.value : void 0;
-    }
+  /**
+   * Gets the value of a node that matches the specified pattern
+   * @param s The subject
+   * @param p The predicate
+   * @param o The object
+   * @param g The graph that contains the statement
+   */
+  anyValue(s, p, o, g) {
+    const y = this.any(s, p, o, g);
+    return y ? y.value : void 0;
+  }
 
-    /**
-     * Gets the first JavaScript object equivalent to a node based on the specified pattern
-     * @param s The subject
-     * @param p The predicate
-     * @param o The object
-     * @param g The graph that contains the statement
-     */
-  }, {
-    key: "anyJS",
-    value: function anyJS(s, p, o, g) {
-      var y = this.any(s, p, o, g);
-      return y ? _nodeInternal.default.toJS(y) : void 0;
-    }
+  /**
+   * Gets the first JavaScript object equivalent to a node based on the specified pattern
+   * @param s The subject
+   * @param p The predicate
+   * @param o The object
+   * @param g The graph that contains the statement
+   */
+  anyJS(s, p, o, g) {
+    const y = this.any(s, p, o, g);
+    return y ? _nodeInternal.default.toJS(y) : void 0;
+  }
 
-    /**
-     * Gets the first statement that matches the specified pattern
-     */
-  }, {
-    key: "anyStatementMatching",
-    value: function anyStatementMatching(s, p, o, g) {
-      var x = this.statementsMatching(s, p, o, g, true);
-      if (!x || x.length === 0) {
-        return undefined;
-      }
-      return x[0];
+  /**
+   * Gets the first statement that matches the specified pattern
+   */
+  anyStatementMatching(s, p, o, g) {
+    let x = this.statementsMatching(s, p, o, g, true);
+    if (!x || x.length === 0) {
+      return undefined;
     }
+    return x[0];
+  }
 
-    /**
-     * Returns a unique index-safe identifier for the given term.
-     *
-     * Falls back to the rdflib hashString implementation if the given factory doesn't support id.
-     */
-  }, {
-    key: "id",
-    value: function id(term) {
-      return this.rdfFactory.id(term);
-    }
+  /**
+   * Returns a unique index-safe identifier for the given term.
+   *
+   * Falls back to the rdflib hashString implementation if the given factory doesn't support id.
+   */
+  id(term) {
+    return this.rdfFactory.id(term);
+  }
 
-    /**
-     * Search the Store
-     * This is really a teaching method as to do this properly you would use IndexedFormula
-     *
-     * @param s - A node to search for as subject, or if null, a wildcard
-     * @param p - A node to search for as predicate, or if null, a wildcard
-     * @param o - A node to search for as object, or if null, a wildcard
-     * @param g - A node to search for as graph, or if null, a wildcard
-     * @param justOne - flag - stop when found one rather than get all of them?
-     * @returns {Array<Node>} - An array of nodes which match the wildcard position
-     */
-  }, {
-    key: "statementsMatching",
-    value: function statementsMatching(s, p, o, g, justOne) {
-      var sts = this.statements.filter(function (st) {
-        return (!s || s.equals(st.subject)) && (!p || p.equals(st.predicate)) && (!o || o.equals(st.object)) && (!g || g.equals(st.graph));
-      });
-      if (justOne) {
-        return sts.length === 0 ? [] : [sts[0]];
-      }
-      return sts;
+  /**
+   * Search the Store
+   * This is really a teaching method as to do this properly you would use IndexedFormula
+   *
+   * @param s - A node to search for as subject, or if null, a wildcard
+   * @param p - A node to search for as predicate, or if null, a wildcard
+   * @param o - A node to search for as object, or if null, a wildcard
+   * @param g - A node to search for as graph, or if null, a wildcard
+   * @param justOne - flag - stop when found one rather than get all of them?
+   * @returns {Array<Node>} - An array of nodes which match the wildcard position
+   */
+  statementsMatching(s, p, o, g, justOne) {
+    const sts = this.statements.filter(st => (!s || s.equals(st.subject)) && (!p || p.equals(st.predicate)) && (!o || o.equals(st.object)) && (!g || g.equals(st.graph)));
+    if (justOne) {
+      return sts.length === 0 ? [] : [sts[0]];
     }
+    return sts;
+  }
 
-    /**
-     * Finds the types in the list which have no *stored* subtypes
-     * These are a set of classes which provide by themselves complete
-     * information -- the other classes are redundant for those who
-     * know the class DAG.
-     * @param types A map of the types
-     */
-  }, {
-    key: "bottomTypeURIs",
-    value: function bottomTypeURIs(types) {
-      var bots;
-      var bottom;
-      var elt;
-      var i;
-      var len;
-      var ref;
-      var subs;
-      var v;
-      bots = [];
-      for (var _k in types) {
-        if (!types.hasOwnProperty(_k)) continue;
-        v = types[_k];
-        subs = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), this.rdfFactory.namedNode(_k));
-        bottom = true;
-        i = 0;
-        for (len = subs.length; i < len; i++) {
-          elt = subs[i];
-          ref = elt.uri;
-          if (ref in types) {
-            // the subclass is one we know
-            bottom = false;
-            break;
-          }
-        }
-        if (bottom) {
-          bots[_k] = v;
+  /**
+   * Finds the types in the list which have no *stored* subtypes
+   * These are a set of classes which provide by themselves complete
+   * information -- the other classes are redundant for those who
+   * know the class DAG.
+   * @param types A map of the types
+   */
+  bottomTypeURIs(types) {
+    let bots;
+    let bottom;
+    let elt;
+    let i;
+    let len;
+    let ref;
+    let subs;
+    let v;
+    bots = [];
+    for (let k in types) {
+      if (!types.hasOwnProperty(k)) continue;
+      v = types[k];
+      subs = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), this.rdfFactory.namedNode(k));
+      bottom = true;
+      i = 0;
+      for (len = subs.length; i < len; i++) {
+        elt = subs[i];
+        ref = elt.uri;
+        if (ref in types) {
+          // the subclass is one we know
+          bottom = false;
+          break;
         }
       }
-      return bots;
+      if (bottom) {
+        bots[k] = v;
+      }
     }
+    return bots;
+  }
 
-    /** Creates a new collection */
-  }, {
-    key: "collection",
-    value: function collection() {
-      return new _collection.default();
-    }
+  /** Creates a new collection */
+  collection() {
+    return new _collection.default();
+  }
 
-    /** Follow links from one node, using one wildcard.
-    *
-    * For example, each(me, knows, null, profile)  - people I know accoring to my profile .
-    * each(me, knows, null, null)  - people I know accoring to anything in store .
-    * each(null, knows, me, null)  - people who know me accoring to anything in store .
-    *
-    * @param s - A node to search for as subject, or if null, a wildcard
-    * @param p - A node to search for as predicate, or if null, a wildcard
-    * @param o - A node to search for as object, or if null, a wildcard
-    * @param g - A node to search for as graph, or if null, a wildcard
-    * @returns {Array<Node>} - An array of nodes which match the wildcard position
-    */
-  }, {
-    key: "each",
-    value: function each(s, p, o, g) {
-      var results = [];
-      var sts = this.statementsMatching(s, p, o, g, false);
-      if (s == null) {
-        for (var i = 0, len = sts.length; i < len; i++) {
-          results.push(sts[i].subject);
-        }
-      } else if (p == null) {
-        for (var l = 0, len1 = sts.length; l < len1; l++) {
-          results.push(sts[l].predicate);
-        }
-      } else if (o == null) {
-        for (var m = 0, len2 = sts.length; m < len2; m++) {
-          results.push(sts[m].object);
-        }
-      } else if (g == null) {
-        for (var _q = 0, len3 = sts.length; _q < len3; _q++) {
-          results.push(new _namedNode.default(sts[_q].graph.value));
-        }
+  /** Follow links from one node, using one wildcard.
+  *
+  * For example, each(me, knows, null, profile)  - people I know accoring to my profile .
+  * each(me, knows, null, null)  - people I know accoring to anything in store .
+  * each(null, knows, me, null)  - people who know me accoring to anything in store .
+  *
+  * @param s - A node to search for as subject, or if null, a wildcard
+  * @param p - A node to search for as predicate, or if null, a wildcard
+  * @param o - A node to search for as object, or if null, a wildcard
+  * @param g - A node to search for as graph, or if null, a wildcard
+  * @returns {Array<Node>} - An array of nodes which match the wildcard position
+  */
+  each(s, p, o, g) {
+    const results = [];
+    let sts = this.statementsMatching(s, p, o, g, false);
+    if (s == null) {
+      for (let i = 0, len = sts.length; i < len; i++) {
+        results.push(sts[i].subject);
+      }
+    } else if (p == null) {
+      for (let l = 0, len1 = sts.length; l < len1; l++) {
+        results.push(sts[l].predicate);
+      }
+    } else if (o == null) {
+      for (let m = 0, len2 = sts.length; m < len2; m++) {
+        results.push(sts[m].object);
+      }
+    } else if (g == null) {
+      for (let q = 0, len3 = sts.length; q < len3; q++) {
+        results.push(new _namedNode.default(sts[q].graph.value));
       }
-      return results;
     }
+    return results;
+  }
 
-    /**
-     * Test whether this formula is equals to {other}
-     * @param other - The other formula
-     */
-  }, {
-    key: "equals",
-    value: function equals(other) {
-      if (!other) {
-        return false;
-      }
-      return this.hashString() === other.hashString();
+  /**
+   * Test whether this formula is equals to {other}
+   * @param other - The other formula
+   */
+  equals(other) {
+    if (!other) {
+      return false;
     }
+    return this.hashString() === other.hashString();
+  }
 
-    /**
-     * For thisClass or any subclass, anything which has it is its type
-     * or is the object of something which has the type as its range, or subject
-     * of something which has the type as its domain
-     * We don't bother doing subproperty (yet?)as it doesn't seeem to be used
-     * much.
-     * Get all the Classes of which we can RDFS-infer the subject is a member
-     * @return a hash of URIs
-     */
-  }, {
-    key: "findMembersNT",
-    value: function findMembersNT(thisClass) {
-      var len2;
-      var len4;
-      var m;
-      var members;
-      var pred;
-      var ref;
-      var ref1;
-      var ref2;
-      var ref3;
-      var ref4;
-      var ref5;
-      var seeds;
-      var st;
-      var u;
-      seeds = {};
-      seeds[thisClass.toNT()] = true;
-      members = {};
-      ref = this.transitiveClosure(seeds, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), true);
-      for (var t in ref) {
-        if (!ref.hasOwnProperty(t)) continue;
-        ref1 = this.statementsMatching(void 0, this.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'), this.fromNT(t));
-        for (var i = 0, len = ref1.length; i < len; i++) {
-          st = ref1[i];
+  /**
+   * For thisClass or any subclass, anything which has it is its type
+   * or is the object of something which has the type as its range, or subject
+   * of something which has the type as its domain
+   * We don't bother doing subproperty (yet?)as it doesn't seeem to be used
+   * much.
+   * Get all the Classes of which we can RDFS-infer the subject is a member
+   * @return a hash of URIs
+   */
+  findMembersNT(thisClass) {
+    let len2;
+    let len4;
+    let m;
+    let members;
+    let pred;
+    let ref;
+    let ref1;
+    let ref2;
+    let ref3;
+    let ref4;
+    let ref5;
+    let seeds;
+    let st;
+    let u;
+    seeds = {};
+    seeds[thisClass.toNT()] = true;
+    members = {};
+    ref = this.transitiveClosure(seeds, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), true);
+    for (let t in ref) {
+      if (!ref.hasOwnProperty(t)) continue;
+      ref1 = this.statementsMatching(void 0, this.rdfFactory.namedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'), this.fromNT(t));
+      for (let i = 0, len = ref1.length; i < len; i++) {
+        st = ref1[i];
+        members[st.subject.toNT()] = st;
+      }
+      ref2 = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain'), this.fromNT(t));
+      for (let l = 0, len1 = ref2.length; l < len1; l++) {
+        pred = ref2[l];
+        ref3 = this.statementsMatching(void 0, pred);
+        for (m = 0, len2 = ref3.length; m < len2; m++) {
+          st = ref3[m];
           members[st.subject.toNT()] = st;
         }
-        ref2 = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain'), this.fromNT(t));
-        for (var l = 0, len1 = ref2.length; l < len1; l++) {
-          pred = ref2[l];
-          ref3 = this.statementsMatching(void 0, pred);
-          for (m = 0, len2 = ref3.length; m < len2; m++) {
-            st = ref3[m];
-            members[st.subject.toNT()] = st;
-          }
-        }
-        ref4 = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range'), this.fromNT(t));
-        for (var _q2 = 0, len3 = ref4.length; _q2 < len3; _q2++) {
-          pred = ref4[_q2];
-          ref5 = this.statementsMatching(void 0, pred);
-          for (u = 0, len4 = ref5.length; u < len4; u++) {
-            st = ref5[u];
-            members[st.object.toNT()] = st;
-          }
+      }
+      ref4 = this.each(void 0, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range'), this.fromNT(t));
+      for (let q = 0, len3 = ref4.length; q < len3; q++) {
+        pred = ref4[q];
+        ref5 = this.statementsMatching(void 0, pred);
+        for (u = 0, len4 = ref5.length; u < len4; u++) {
+          st = ref5[u];
+          members[st.object.toNT()] = st;
         }
       }
-      return members;
     }
+    return members;
+  }
 
-    /**
-     * For thisClass or any subclass, anything which has it is its type
-     * or is the object of something which has the type as its range, or subject
-     * of something which has the type as its domain
-     * We don't bother doing subproperty (yet?)as it doesn't seeem to be used
-     * much.
-     * Get all the Classes of which we can RDFS-infer the subject is a member
-     * @param subject - A named node
-     */
-  }, {
-    key: "findMemberURIs",
-    value: function findMemberURIs(subject) {
-      return this.NTtoURI(this.findMembersNT(subject));
-    }
+  /**
+   * For thisClass or any subclass, anything which has it is its type
+   * or is the object of something which has the type as its range, or subject
+   * of something which has the type as its domain
+   * We don't bother doing subproperty (yet?)as it doesn't seeem to be used
+   * much.
+   * Get all the Classes of which we can RDFS-infer the subject is a member
+   * @param subject - A named node
+   */
+  findMemberURIs(subject) {
+    return this.NTtoURI(this.findMembersNT(subject));
+  }
 
-    /**
-     * Get all the Classes of which we can RDFS-infer the subject is a superclass
-     * Returns a hash table where key is NT of type and value is statement why we
-     * think so.
-     * Does NOT return terms, returns URI strings.
-     * We use NT representations in this version because they handle blank nodes.
-     */
-  }, {
-    key: "findSubClassesNT",
-    value: function findSubClassesNT(subject) {
-      var types = {};
-      types[subject.toNT()] = true;
-      return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), true);
-    }
+  /**
+   * Get all the Classes of which we can RDFS-infer the subject is a superclass
+   * Returns a hash table where key is NT of type and value is statement why we
+   * think so.
+   * Does NOT return terms, returns URI strings.
+   * We use NT representations in this version because they handle blank nodes.
+   */
+  findSubClassesNT(subject) {
+    let types = {};
+    types[subject.toNT()] = true;
+    return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), true);
+  }
 
-    /**
-     * Get all the Classes of which we can RDFS-infer the subject is a subclass
-     * @param {RDFlibNamedNode} subject - The thing whose classes are to be found
-     * @returns a hash table where key is NT of type and value is statement why we
-     * think so.
-     * Does NOT return terms, returns URI strings.
-     * We use NT representations in this version because they handle blank nodes.
-     */
-  }, {
-    key: "findSuperClassesNT",
-    value: function findSuperClassesNT(subject) {
-      var types = {};
-      types[subject.toNT()] = true;
-      return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), false);
-    }
+  /**
+   * Get all the Classes of which we can RDFS-infer the subject is a subclass
+   * @param {RDFlibNamedNode} subject - The thing whose classes are to be found
+   * @returns a hash table where key is NT of type and value is statement why we
+   * think so.
+   * Does NOT return terms, returns URI strings.
+   * We use NT representations in this version because they handle blank nodes.
+   */
+  findSuperClassesNT(subject) {
+    let types = {};
+    types[subject.toNT()] = true;
+    return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), false);
+  }
 
-    /**
-     * Get all the Classes of which we can RDFS-infer the subject is a member
-     * todo: This will loop is there is a class subclass loop (Sublass loops are
-     * not illegal)
-     * @param {RDFlibNamedNode} subject - The thing whose classes are to be found
-     * @returns a hash table where key is NT of type and value is statement why we think so.
-     * Does NOT return terms, returns URI strings.
-     * We use NT representations in this version because they handle blank nodes.
-     */
-  }, {
-    key: "findTypesNT",
-    value: function findTypesNT(subject) {
-      var domain;
-      var range;
-      var rdftype;
-      var ref;
-      var ref1;
-      var ref2;
-      var ref3;
-      var st;
-      var types;
-      rdftype = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type';
-      types = [];
-      ref = this.statementsMatching(subject, void 0, void 0);
-      for (var i = 0, len = ref.length; i < len; i++) {
-        st = ref[i];
-        if (st.predicate.uri === rdftype) {
-          types[st.object.toNT()] = st;
-        } else {
-          ref1 = this.each(st.predicate, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain'));
-          for (var l = 0, len1 = ref1.length; l < len1; l++) {
-            range = ref1[l];
-            types[range.toNT()] = st;
-          }
+  /**
+   * Get all the Classes of which we can RDFS-infer the subject is a member
+   * todo: This will loop is there is a class subclass loop (Sublass loops are
+   * not illegal)
+   * @param {RDFlibNamedNode} subject - The thing whose classes are to be found
+   * @returns a hash table where key is NT of type and value is statement why we think so.
+   * Does NOT return terms, returns URI strings.
+   * We use NT representations in this version because they handle blank nodes.
+   */
+  findTypesNT(subject) {
+    let domain;
+    let range;
+    let rdftype;
+    let ref;
+    let ref1;
+    let ref2;
+    let ref3;
+    let st;
+    let types;
+    rdftype = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type';
+    types = [];
+    ref = this.statementsMatching(subject, void 0, void 0);
+    for (let i = 0, len = ref.length; i < len; i++) {
+      st = ref[i];
+      if (st.predicate.uri === rdftype) {
+        types[st.object.toNT()] = st;
+      } else {
+        ref1 = this.each(st.predicate, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#domain'));
+        for (let l = 0, len1 = ref1.length; l < len1; l++) {
+          range = ref1[l];
+          types[range.toNT()] = st;
         }
       }
-      ref2 = this.statementsMatching(void 0, void 0, subject);
-      for (var m = 0, len2 = ref2.length; m < len2; m++) {
-        st = ref2[m];
-        ref3 = this.each(st.predicate, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range'));
-        for (var _q3 = 0, len3 = ref3.length; _q3 < len3; _q3++) {
-          domain = ref3[_q3];
-          types[domain.toNT()] = st;
-        }
+    }
+    ref2 = this.statementsMatching(void 0, void 0, subject);
+    for (let m = 0, len2 = ref2.length; m < len2; m++) {
+      st = ref2[m];
+      ref3 = this.each(st.predicate, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#range'));
+      for (let q = 0, len3 = ref3.length; q < len3; q++) {
+        domain = ref3[q];
+        types[domain.toNT()] = st;
       }
-      return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), false);
     }
+    return this.transitiveClosure(types, this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'), false);
+  }
 
-    /**
-     * Get all the Classes of which we can RDFS-infer the subject is a member
-     * todo: This will loop is there is a class subclass loop (Sublass loops are
-     * not illegal)
-     * Returns a hash table where key is NT of type and value is statement why we
-     * think so.
-     * Does NOT return terms, returns URI strings.
-     * We use NT representations in this version because they handle blank nodes.
-     * @param subject - A subject node
-     */
-  }, {
-    key: "findTypeURIs",
-    value: function findTypeURIs(subject) {
-      return this.NTtoURI(this.findTypesNT(subject));
-    }
+  /**
+   * Get all the Classes of which we can RDFS-infer the subject is a member
+   * todo: This will loop is there is a class subclass loop (Sublass loops are
+   * not illegal)
+   * Returns a hash table where key is NT of type and value is statement why we
+   * think so.
+   * Does NOT return terms, returns URI strings.
+   * We use NT representations in this version because they handle blank nodes.
+   * @param subject - A subject node
+   */
+  findTypeURIs(subject) {
+    return this.NTtoURI(this.findTypesNT(subject));
+  }
 
-    /** Trace statements which connect directly, or through bnodes
-     *
-     * @param subject - The node to start looking for statments
-     * @param doc - The document to be searched, or null to search all documents
-     * @returns an array of statements, duplicate statements are suppresssed.
-     */
-  }, {
-    key: "connectedStatements",
-    value: function connectedStatements(subject, doc, excludePredicateURIs) {
-      excludePredicateURIs = excludePredicateURIs || [];
-      var todo = [subject];
-      var done = {};
-      var doneArcs = {};
-      var result = [];
-      var self = this;
-      var follow = function follow(x) {
-        var queue = function queue(x) {
-          if (x.termType === 'BlankNode' && !done[x.value]) {
-            done[x.value] = true;
-            todo.push(x);
-          }
-        };
-        var sts = self.statementsMatching(null, null, x, doc).concat(self.statementsMatching(x, null, null, doc));
-        sts = sts.filter(function (st) {
-          if (excludePredicateURIs[st.predicate.value]) return false;
-          var hash = st.toNT();
-          if (doneArcs[hash]) return false;
-          doneArcs[hash] = true;
-          return true;
-        });
-        sts.forEach(function (st) {
-          queue(st.subject);
-          queue(st.object);
-        });
-        result = result.concat(sts);
+  /** Trace statements which connect directly, or through bnodes
+   *
+   * @param subject - The node to start looking for statments
+   * @param doc - The document to be searched, or null to search all documents
+   * @returns an array of statements, duplicate statements are suppresssed.
+   */
+  connectedStatements(subject, doc, excludePredicateURIs) {
+    excludePredicateURIs = excludePredicateURIs || [];
+    let todo = [subject];
+    let done = {};
+    let doneArcs = {};
+    let result = [];
+    let self = this;
+    let follow = function (x) {
+      let queue = function (x) {
+        if (x.termType === 'BlankNode' && !done[x.value]) {
+          done[x.value] = true;
+          todo.push(x);
+        }
       };
-      while (todo.length) {
-        follow(todo.shift());
-      }
-      return result;
+      let sts = self.statementsMatching(null, null, x, doc).concat(self.statementsMatching(x, null, null, doc));
+      sts = sts.filter(function (st) {
+        if (excludePredicateURIs[st.predicate.value]) return false;
+        let hash = st.toNT();
+        if (doneArcs[hash]) return false;
+        doneArcs[hash] = true;
+        return true;
+      });
+      sts.forEach(function (st) {
+        queue(st.subject);
+        queue(st.object);
+      });
+      result = result.concat(sts);
+    };
+    while (todo.length) {
+      follow(todo.shift());
     }
+    return result;
+  }
 
-    /**
-     * Creates a new empty formula
-     *
-     * @param _features - Not applicable, but necessary for typing to pass
-     */
-  }, {
-    key: "formula",
-    value: function formula(_features) {
-      return new Formula();
-    }
+  /**
+   * Creates a new empty formula
+   *
+   * @param _features - Not applicable, but necessary for typing to pass
+   */
+  formula(_features) {
+    return new Formula();
+  }
 
-    /**
-     * Transforms an NTriples string format into a Node.
-     * The blank node bit should not be used on program-external values; designed
-     * for internal work such as storing a blank node id in an HTML attribute.
-     * This will only parse the strings generated by the various toNT() methods.
-     */
-  }, {
-    key: "fromNT",
-    value: function fromNT(str) {
-      var dt, k, lang;
-      switch (str[0]) {
-        case '<':
-          return this.sym(str.slice(1, -1));
-        case '"':
-          lang = void 0;
-          dt = void 0;
-          k = str.lastIndexOf('"');
-          if (k < str.length - 1) {
-            if (str[k + 1] === '@') {
-              lang = str.slice(k + 2);
-            } else if (str.slice(k + 1, k + 3) === '^^') {
-              dt = this.fromNT(str.slice(k + 3));
-            } else {
-              throw new Error("Can't convert string from NT: " + str);
-            }
+  /**
+   * Transforms an NTriples string format into a Node.
+   * The blank node bit should not be used on program-external values; designed
+   * for internal work such as storing a blank node id in an HTML attribute.
+   * This will only parse the strings generated by the various toNT() methods.
+   */
+  fromNT(str) {
+    let dt, k, lang;
+    switch (str[0]) {
+      case '<':
+        return this.sym(str.slice(1, -1));
+      case '"':
+        lang = void 0;
+        dt = void 0;
+        k = str.lastIndexOf('"');
+        if (k < str.length - 1) {
+          if (str[k + 1] === '@') {
+            lang = str.slice(k + 2);
+          } else if (str.slice(k + 1, k + 3) === '^^') {
+            dt = this.fromNT(str.slice(k + 3));
+          } else {
+            throw new Error("Can't convert string from NT: " + str);
           }
-          str = str.slice(1, k);
-          str = str.replace(/\\"/g, '"');
-          str = str.replace(/\\n/g, '\n');
-          str = str.replace(/\\\\/g, '\\');
-          return this.rdfFactory.literal(str, lang || dt);
-        case '_':
-          return this.rdfFactory.blankNode(str.slice(2));
-        case '?':
-          return new _variable.default(str.slice(1));
-      }
-      throw new Error("Can't convert from NT: " + str);
-    }
-
-    /** Returns true if this formula holds the specified statement(s) */
-  }, {
-    key: "holds",
-    value: function holds(s, p, o, g) {
-      var i;
-      if (arguments.length === 1) {
-        if (!s) {
-          return true;
         }
-        if (s instanceof Array) {
-          for (i = 0; i < s.length; i++) {
-            if (!this.holds(s[i])) {
-              return false;
-            }
+        str = str.slice(1, k);
+        str = str.replace(/\\"/g, '"');
+        str = str.replace(/\\n/g, '\n');
+        str = str.replace(/\\\\/g, '\\');
+        return this.rdfFactory.literal(str, lang || dt);
+      case '_':
+        return this.rdfFactory.blankNode(str.slice(2));
+      case '?':
+        return new _variable.default(str.slice(1));
+    }
+    throw new Error("Can't convert from NT: " + str);
+  }
+
+  /** Returns true if this formula holds the specified statement(s) */
+  holds(s, p, o, g) {
+    let i;
+    if (arguments.length === 1) {
+      if (!s) {
+        return true;
+      }
+      if (s instanceof Array) {
+        for (i = 0; i < s.length; i++) {
+          if (!this.holds(s[i])) {
+            return false;
           }
-          return true;
-        } else if ((0, _terms.isStatement)(s)) {
-          return this.holds(s.subject, s.predicate, s.object, s.graph);
-        } else if (s.statements) {
-          return this.holds(s.statements);
         }
+        return true;
+      } else if ((0, _terms.isStatement)(s)) {
+        return this.holds(s.subject, s.predicate, s.object, s.graph);
+      } else if (s.statements) {
+        return this.holds(s.statements);
       }
-      var st = this.anyStatementMatching(s, p, o, g);
-      return st != null;
     }
+    let st = this.anyStatementMatching(s, p, o, g);
+    return st != null;
+  }
 
-    /**
-     * Returns true if this formula holds the specified {statement}
-     */
-  }, {
-    key: "holdsStatement",
-    value: function holdsStatement(statement) {
-      return this.holds(statement.subject, statement.predicate, statement.object, statement.graph);
-    }
+  /**
+   * Returns true if this formula holds the specified {statement}
+   */
+  holdsStatement(statement) {
+    return this.holds(statement.subject, statement.predicate, statement.object, statement.graph);
+  }
 
-    /**
-     * Used by the n3parser to generate list elements
-     * @param values - The values of the collection
-     * @param context - The store
-     * @return {BlankNode|Collection} - The term for the statement
-     */
-  }, {
-    key: "list",
-    value: function list(values, context) {
-      if (context.rdfFactory.supports["COLLECTIONS"]) {
-        var collection = context.rdfFactory.collection();
-        values.forEach(function (val) {
-          collection.append(val);
-        });
-        return collection;
-      } else {
-        var node = context.rdfFactory.blankNode();
-        var statements = (0, _utils.arrayToStatements)(context.rdfFactory, node, values);
-        context.addAll(statements);
-        return node;
-      }
+  /**
+   * Used by the n3parser to generate list elements
+   * @param values - The values of the collection
+   * @param context - The store
+   * @return {BlankNode|Collection} - The term for the statement
+   */
+  list(values, context) {
+    if (context.rdfFactory.supports["COLLECTIONS"]) {
+      const collection = context.rdfFactory.collection();
+      values.forEach(function (val) {
+        collection.append(val);
+      });
+      return collection;
+    } else {
+      const node = context.rdfFactory.blankNode();
+      const statements = (0, _utils.arrayToStatements)(context.rdfFactory, node, values);
+      context.addAll(statements);
+      return node;
     }
+  }
 
-    /**
-     * Transform a collection of NTriple URIs into their URI strings
-     * @param t - Some iterable collection of NTriple URI strings
-     * @return A collection of the URIs as strings
-     * todo: explain why it is important to go through NT
-     */
-  }, {
-    key: "NTtoURI",
-    value: function NTtoURI(t) {
-      var k, v;
-      var uris = {};
-      for (k in t) {
-        if (!t.hasOwnProperty(k)) continue;
-        v = t[k];
-        if (k[0] === '<') {
-          uris[k.slice(1, -1)] = v;
-        }
+  /**
+   * Transform a collection of NTriple URIs into their URI strings
+   * @param t - Some iterable collection of NTriple URI strings
+   * @return A collection of the URIs as strings
+   * todo: explain why it is important to go through NT
+   */
+  NTtoURI(t) {
+    let k, v;
+    let uris = {};
+    for (k in t) {
+      if (!t.hasOwnProperty(k)) continue;
+      v = t[k];
+      if (k[0] === '<') {
+        uris[k.slice(1, -1)] = v;
       }
-      return uris;
     }
+    return uris;
+  }
 
-    /**
-     * Serializes this formula
-     * @param base - The base string
-     * @param contentType - The content type of the syntax to use
-     * @param provenance - The provenance URI
-     * @param options  - options to pass to the serializer, as defined in serialize method
-     */
-  }, {
-    key: "serialize",
-    value: function serialize(base, contentType, provenance, options) {
-      // delegate the graph serialization to the implementation in ./serialize
-      return (0, _serialize2.default)(provenance, this, base, contentType, undefined, options);
-    }
+  /**
+   * Serializes this formula
+   * @param base - The base string
+   * @param contentType - The content type of the syntax to use
+   * @param provenance - The provenance URI
+   * @param options  - options to pass to the serializer, as defined in serialize method
+   */
+  serialize(base, contentType, provenance, options) {
+    // delegate the graph serialization to the implementation in ./serialize
+    return (0, _serialize.default)(provenance, this, base, contentType, undefined, options);
+  }
 
-    /**
-     * Creates a new formula with the substituting bindings applied
-     * @param bindings - The bindings to substitute
-     */
-  }, {
-    key: "substitute",
-    value: function substitute(bindings) {
-      var statementsCopy = this.statements.map(function (ea) {
-        return ea.substitute(bindings);
-      });
-      // console.log('Formula subs statmnts:' + statementsCopy)
-      var y = new Formula();
-      y.addAll(statementsCopy);
-      // console.log('indexed-form subs formula:' + y)
-      return y;
-    }
-  }, {
-    key: "sym",
-    value: function sym(uri, name) {
-      if (name) {
-        throw new Error('This feature (kb.sym with 2 args) is removed. Do not assume prefix mappings.');
-      }
-      return this.rdfFactory.namedNode(uri);
+  /**
+   * Creates a new formula with the substituting bindings applied
+   * @param bindings - The bindings to substitute
+   */
+  substitute(bindings) {
+    let statementsCopy = this.statements.map(function (ea) {
+      return ea.substitute(bindings);
+    });
+    // console.log('Formula subs statmnts:' + statementsCopy)
+    const y = new Formula();
+    y.addAll(statementsCopy);
+    // console.log('indexed-form subs formula:' + y)
+    return y;
+  }
+  sym(uri, name) {
+    if (name) {
+      throw new Error('This feature (kb.sym with 2 args) is removed. Do not assume prefix mappings.');
     }
+    return this.rdfFactory.namedNode(uri);
+  }
 
-    /**
-     * Gets the node matching the specified pattern. Throws when no match could be made.
-     * @param s - The subject
-     * @param p - The predicate
-     * @param o - The object
-     * @param g - The graph that contains the statement
-     */
-  }, {
-    key: "the",
-    value: function the(s, p, o, g) {
-      var x = this.any(s, p, o, g);
-      if (x == null) {
-        _log.default.error('No value found for the() {' + s + ' ' + p + ' ' + o + '}.');
-      }
-      return x;
+  /**
+   * Gets the node matching the specified pattern. Throws when no match could be made.
+   * @param s - The subject
+   * @param p - The predicate
+   * @param o - The object
+   * @param g - The graph that contains the statement
+   */
+  the(s, p, o, g) {
+    let x = this.any(s, p, o, g);
+    if (x == null) {
+      _log.default.error('No value found for the() {' + s + ' ' + p + ' ' + o + '}.');
     }
+    return x;
+  }
 
-    /**
-     * RDFS Inference
-     * These are hand-written implementations of a backward-chaining reasoner
-     * over the RDFS axioms.
-     * @param seeds - A hash of NTs of classes to start with
-     * @param predicate - The property to trace though
-     * @param inverse - Trace inverse direction
-     */
-  }, {
-    key: "transitiveClosure",
-    value: function transitiveClosure(seeds, predicate, inverse) {
-      var elt, i, len, s, sups, t;
-      var agenda = {};
-      Object.assign(agenda, seeds); // make a copy
-      var done = {}; // classes we have looked up
-      while (true) {
-        t = function () {
-          for (var p in agenda) {
-            if (!agenda.hasOwnProperty(p)) continue;
-            return p;
-          }
-        }();
-        if (t == null) {
-          return done;
+  /**
+   * RDFS Inference
+   * These are hand-written implementations of a backward-chaining reasoner
+   * over the RDFS axioms.
+   * @param seeds - A hash of NTs of classes to start with
+   * @param predicate - The property to trace though
+   * @param inverse - Trace inverse direction
+   */
+  transitiveClosure(seeds, predicate, inverse) {
+    let elt, i, len, s, sups, t;
+    let agenda = {};
+    Object.assign(agenda, seeds); // make a copy
+    let done = {}; // classes we have looked up
+    while (true) {
+      t = function () {
+        for (let p in agenda) {
+          if (!agenda.hasOwnProperty(p)) continue;
+          return p;
         }
-        sups = inverse ? this.each(void 0, predicate, this.fromNT(t)) : this.each(this.fromNT(t), predicate);
-        for (i = 0, len = sups.length; i < len; i++) {
-          elt = sups[i];
-          s = elt.toNT();
-          if (s in done) {
-            continue;
-          }
-          if (s in agenda) {
-            continue;
-          }
-          agenda[s] = agenda[t];
+      }();
+      if (t == null) {
+        return done;
+      }
+      sups = inverse ? this.each(void 0, predicate, this.fromNT(t)) : this.each(this.fromNT(t), predicate);
+      for (i = 0, len = sups.length; i < len; i++) {
+        elt = sups[i];
+        s = elt.toNT();
+        if (s in done) {
+          continue;
+        }
+        if (s in agenda) {
+          continue;
         }
-        done[t] = agenda[t];
-        delete agenda[t];
+        agenda[s] = agenda[t];
       }
+      done[t] = agenda[t];
+      delete agenda[t];
     }
+  }
 
-    /**
-     * Finds the types in the list which have no *stored* supertypes
-     * We exclude the universal class, owl:Things and rdf:Resource, as it is
-     * information-free.
-     * @param types - The types
-     */
-  }, {
-    key: "topTypeURIs",
-    value: function topTypeURIs(types) {
-      var i;
-      var j;
-      var k;
-      var len;
-      var n;
-      var ref;
-      var tops;
-      var v;
-      tops = [];
-      for (k in types) {
-        if (!types.hasOwnProperty(k)) continue;
-        v = types[k];
-        n = 0;
-        ref = this.each(this.rdfFactory.namedNode(k), this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'));
-        for (i = 0, len = ref.length; i < len; i++) {
-          j = ref[i];
-          if (j.uri !== 'http://www.w3.org/2000/01/rdf-schema#Resource') {
-            n++;
-            break;
-          }
-        }
-        if (!n) {
-          tops[k] = v;
+  /**
+   * Finds the types in the list which have no *stored* supertypes
+   * We exclude the universal class, owl:Things and rdf:Resource, as it is
+   * information-free.
+   * @param types - The types
+   */
+  topTypeURIs(types) {
+    let i;
+    let j;
+    let k;
+    let len;
+    let n;
+    let ref;
+    let tops;
+    let v;
+    tops = [];
+    for (k in types) {
+      if (!types.hasOwnProperty(k)) continue;
+      v = types[k];
+      n = 0;
+      ref = this.each(this.rdfFactory.namedNode(k), this.rdfFactory.namedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'));
+      for (i = 0, len = ref.length; i < len; i++) {
+        j = ref[i];
+        if (j.uri !== 'http://www.w3.org/2000/01/rdf-schema#Resource') {
+          n++;
+          break;
         }
       }
-      if (tops['http://www.w3.org/2000/01/rdf-schema#Resource']) {
-        delete tops['http://www.w3.org/2000/01/rdf-schema#Resource'];
-      }
-      if (tops['http://www.w3.org/2002/07/owl#Thing']) {
-        delete tops['http://www.w3.org/2002/07/owl#Thing'];
+      if (!n) {
+        tops[k] = v;
       }
-      return tops;
     }
-
-    /**
-     * Serializes this formula to a string
-     */
-  }, {
-    key: "toString",
-    value: function toString() {
-      return '{' + this.statements.join('\n') + '}';
+    if (tops['http://www.w3.org/2000/01/rdf-schema#Resource']) {
+      delete tops['http://www.w3.org/2000/01/rdf-schema#Resource'];
     }
-
-    /**
-     * Gets a new variable
-     * @param name - The variable's name
-     */
-  }, {
-    key: "variable",
-    value: function variable(name) {
-      return new _variable.default(name);
+    if (tops['http://www.w3.org/2002/07/owl#Thing']) {
+      delete tops['http://www.w3.org/2002/07/owl#Thing'];
     }
+    return tops;
+  }
 
-    /**
-     * Gets the number of statements in this formula that matches the specified pattern
-     * @param s - The subject
-     * @param p - The predicate
-     * @param o - The object
-     * @param g - The graph that contains the statement
-     */
-  }, {
-    key: "whether",
-    value: function whether(s, p, o, g) {
-      return this.statementsMatching(s, p, o, g, false).length;
-    }
-  }]);
-  return Formula;
-}(_nodeInternal.default);
+  /**
+   * Serializes this formula to a string
+   */
+  toString() {
+    return '{' + this.statements.join('\n') + '}';
+  }
+
+  /**
+   * Gets a new variable
+   * @param name - The variable's name
+   */
+  variable(name) {
+    return new _variable.default(name);
+  }
+
+  /**
+   * Gets the number of statements in this formula that matches the specified pattern
+   * @param s - The subject
+   * @param p - The predicate
+   * @param o - The object
+   * @param g - The graph that contains the statement
+   */
+  whether(s, p, o, g) {
+    return this.statementsMatching(s, p, o, g, false).length;
+  }
+}
 exports.default = Formula;