rdflib 2.2.35 → 2.2.36

package/esm/index.js

@@ -1,11 +1,4 @@
-import _createClass from "@babel/runtime/helpers/createClass";
-import _classCallCheck from "@babel/runtime/helpers/classCallCheck";
-import _possibleConstructorReturn from "@babel/runtime/helpers/possibleConstructorReturn";
-import _getPrototypeOf from "@babel/runtime/helpers/getPrototypeOf";
-import _inherits from "@babel/runtime/helpers/inherits";
 import _defineProperty from "@babel/runtime/helpers/defineProperty";
-function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
-function _isNativeReflectConstruct() { try { var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); } catch (t) {} return (_isNativeReflectConstruct = function _isNativeReflectConstruct() { return !!t; })(); }
 import BlankNode from './blank-node';
 import Collection from './collection';
 import Empty from './empty';
@@ -38,30 +31,30 @@ import Variable from './variable';
 import DataFactory from './factories/rdflib-data-factory';
 
 // Prepare bound versions of data factory methods for export
-var boundDataFactory = {};
-for (var name in DataFactory) {
+const boundDataFactory = {};
+for (const name in DataFactory) {
   if (typeof DataFactory[name] === 'function') boundDataFactory[name] = DataFactory[name].bind(DataFactory);
 }
-var fetcher = boundDataFactory.fetcher,
-  graph = boundDataFactory.graph,
-  lit = boundDataFactory.lit,
-  st = boundDataFactory.st,
-  namedNode = boundDataFactory.namedNode,
-  variable = boundDataFactory.variable,
-  blankNode = boundDataFactory.blankNode,
-  defaultGraph = boundDataFactory.defaultGraph,
-  literal = boundDataFactory.literal,
-  quad = boundDataFactory.quad,
-  triple = boundDataFactory.triple;
-var formula = new Formula();
-var fromNT = function fromNT(str) {
-  return formula.fromNT(str);
-};
-var term = Node.fromValue;
+const {
+  fetcher,
+  graph,
+  lit,
+  st,
+  namedNode,
+  variable,
+  blankNode,
+  defaultGraph,
+  literal,
+  quad,
+  triple
+} = boundDataFactory;
+const formula = new Formula();
+const fromNT = str => formula.fromNT(str);
+const term = Node.fromValue;
 
 // TODO: this export is broken;
 // it exports the _current_ value of nextId, which is always 0
-var NextId = BlankNode.nextId;
+const NextId = BlankNode.nextId;
 export * from './utils/terms';
 export { BlankNode, Collection, DataFactory, Empty, Fetcher, Formula, Store, jsonParser, Literal, log, N3Parser, NamedNode, Namespace, Node, parse, Query, queryToSPARQL, RDFaProcessor, RDFParser, serialize, Serializer, SPARQLToQuery, sparqlUpdateParser, Statement, term, UpdateManager, UpdatesSocket, UpdatesVia, uri, Util, Variable, Store as IndexedFormula,
 // Alias
@@ -70,27 +63,17 @@ NextId, fromNT, fetcher, graph, lit, st, namedNode as sym,
 // RDFJS DataFactory interface
 blankNode, defaultGraph, literal, namedNode, quad, triple, variable };
 export { termValue } from './utils/termValue';
-export var ConnectedStore = /*#__PURE__*/function (_Store) {
-  function ConnectedStore(features) {
-    var _this;
-    _classCallCheck(this, ConnectedStore);
-    _this = _callSuper(this, ConnectedStore, [features]);
-    _defineProperty(_this, "fetcher", void 0);
-    _this.fetcher = new Fetcher(_this, {});
-    return _this;
+export class ConnectedStore extends Store {
+  constructor(features) {
+    super(features);
+    _defineProperty(this, "fetcher", void 0);
+    this.fetcher = new Fetcher(this, {});
   }
-  _inherits(ConnectedStore, _Store);
-  return _createClass(ConnectedStore);
-}(Store);
-export var LiveStore = /*#__PURE__*/function (_ConnectedStore2) {
-  function LiveStore(features) {
-    var _this2;
-    _classCallCheck(this, LiveStore);
-    _this2 = _callSuper(this, LiveStore, [features]);
-    _defineProperty(_this2, "updater", void 0);
-    _this2.updater = new UpdateManager(_this2);
-    return _this2;
+}
+export class LiveStore extends ConnectedStore {
+  constructor(features) {
+    super(features);
+    _defineProperty(this, "updater", void 0);
+    this.updater = new UpdateManager(this);
   }
-  _inherits(LiveStore, _ConnectedStore2);
-  return _createClass(LiveStore);
-}(ConnectedStore);
+}

package/esm/jsonldparser.js

@@ -35,11 +35,9 @@ export function jsonldObjectToTerm(kb, obj) {
  * Adds the statements in a json-ld list object to {kb}.
  */
 function listToStatements(kb, obj) {
-  var listId = obj['@id'] ? nodeType(kb, obj) : kb.rdfFactory.blankNode();
-  var items = obj['@list'].map(function (listItem) {
-    return jsonldObjectToTerm(kb, listItem);
-  });
-  var statements = arrayToStatements(kb.rdfFactory, listId, items);
+  const listId = obj['@id'] ? nodeType(kb, obj) : kb.rdfFactory.blankNode();
+  const items = obj['@list'].map(listItem => jsonldObjectToTerm(kb, listItem));
+  const statements = arrayToStatements(kb.rdfFactory, listId, items);
   kb.addAll(statements);
   return listId;
 }
@@ -47,9 +45,7 @@ function listToCollection(kb, obj) {
   if (!Array.isArray(obj)) {
     throw new TypeError("Object must be an array");
   }
-  return kb.rdfFactory.collection(obj.map(function (o) {
-    return jsonldObjectToTerm(kb, o);
-  }));
+  return kb.rdfFactory.collection(obj.map(o => jsonldObjectToTerm(kb, o)));
 }
 
 /**
@@ -58,17 +54,15 @@ function listToCollection(kb, obj) {
  * Ensure that {kb.rdfFactory} is a DataFactory.
  */
 export default function jsonldParser(str, kb, base, callback) {
-  var baseString = base && Object.prototype.hasOwnProperty.call(base, 'termType') ? base.value : base;
-  return import('jsonld').then(function (jsonld) {
+  const baseString = base && Object.prototype.hasOwnProperty.call(base, 'termType') ? base.value : base;
+  return import('jsonld').then(jsonld => {
     return jsonld.flatten(JSON.parse(str), null, {
       base: baseString
     });
-  }).then(function (flattened) {
-    return flattened.reduce(function (store, flatResource) {
-      kb = processResource(kb, base, flatResource);
-      return kb;
-    }, kb);
-  }).then(callback).catch(callback);
+  }).then(flattened => flattened.reduce((store, flatResource) => {
+    kb = processResource(kb, base, flatResource);
+    return kb;
+  }, kb)).then(callback).catch(callback);
 }
 function nodeType(kb, obj) {
   if (obj['@id'].startsWith('_:')) {
@@ -80,27 +74,26 @@ function nodeType(kb, obj) {
   }
 }
 function processResource(kb, base, flatResource) {
-  var id = flatResource['@id'] ? nodeType(kb, flatResource) : kb.rdfFactory.blankNode();
-  for (var _i = 0, _Object$keys = Object.keys(flatResource); _i < _Object$keys.length; _i++) {
-    var property = _Object$keys[_i];
+  const id = flatResource['@id'] ? nodeType(kb, flatResource) : kb.rdfFactory.blankNode();
+  for (const property of Object.keys(flatResource)) {
     if (property === '@id') {
       continue;
     } else if (property == '@graph') {
       // the JSON-LD flattened structure may contain nested graphs
       // the id value for this object is the new base (named graph id) for all nested flat resources
-      var graphId = id;
+      const graphId = id;
       // this is an array of resources
-      var nestedFlatResources = flatResource[property];
+      const nestedFlatResources = flatResource[property];
 
       // recursively process all flat resources in the array, but with the graphId as base.
-      for (var i = 0; i < nestedFlatResources.length; i++) {
+      for (let i = 0; i < nestedFlatResources.length; i++) {
         kb = processResource(kb, graphId, nestedFlatResources[i]);
       }
     }
-    var value = flatResource[property];
+    const value = flatResource[property];
     if (Array.isArray(value)) {
-      for (var _i2 = 0; _i2 < value.length; _i2++) {
-        kb.addStatement(createStatement(kb, id, property, value[_i2], base));
+      for (let i = 0; i < value.length; i++) {
+        kb.addStatement(createStatement(kb, id, property, value[i], base));
       }
     } else {
       kb.addStatement(createStatement(kb, id, property, value, base));
@@ -118,7 +111,7 @@ function processResource(kb, base, flatResource) {
  * @return quad statement
  */
 function createStatement(kb, id, property, value, base) {
-  var predicate, object;
+  let predicate, object;
   if (property === "@type") {
     predicate = kb.rdfFactory.namedNode("http://www.w3.org/1999/02/22-rdf-syntax-ns#type");
     object = kb.rdfFactory.namedNode(value);

package/esm/jsonparser.js

@@ -1,6 +1,6 @@
 export default (function () {
   return {
-    parseJSON: function parseJSON(data, source, store) {
+    parseJSON: function (data, source, store) {
       var subject, predicate, object;
       var bnodes = {};
       var why = store.sym(source);

package/esm/lists.js

@@ -1,6 +1,3 @@
-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; }
 /* Lists form conversion
 */
 
@@ -25,7 +22,7 @@ import Statement from './statement';
 // import { Quad } from './tf-types'
 
 import Namespace from './namespace';
-var RDF = Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#');
+const RDF = Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#');
 
 /* Replace a given node with another node throughout a given document
 *
@@ -33,83 +30,38 @@ var RDF = Namespace('http://www.w3.org/1999/02/22-rdf-syntax-ns#');
 */
 export function substituteInDoc(store, x, y, doc) {
   // console.log(`substituteInDoc put ${x} for ${y} in ${doc}}`)
-  var _iterator = _createForOfIteratorHelper(store.statementsMatching(y, null, null, doc)),
-    _step;
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var quad = _step.value;
-      var newStatement = new Statement(x, quad.predicate, quad.object, doc);
-      store.remove(quad);
-      store.add(newStatement);
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
+  for (const quad of store.statementsMatching(y, null, null, doc)) {
+    const newStatement = new Statement(x, quad.predicate, quad.object, doc);
+    store.remove(quad);
+    store.add(newStatement);
   }
-  var _iterator2 = _createForOfIteratorHelper(store.statementsMatching(null, y, null, doc)),
-    _step2;
-  try {
-    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-      var _quad = _step2.value;
-      store.remove(_quad);
-      // console.log(`  substituteInDoc predicate ${x} in ${quad}}`)
-      store.add(new Statement(_quad.subject, x, _quad.object, doc));
-    }
-  } catch (err) {
-    _iterator2.e(err);
-  } finally {
-    _iterator2.f();
+  for (const quad of store.statementsMatching(null, y, null, doc)) {
+    store.remove(quad);
+    // console.log(`  substituteInDoc predicate ${x} in ${quad}}`)
+    store.add(new Statement(quad.subject, x, quad.object, doc));
   }
-  var _iterator3 = _createForOfIteratorHelper(store.statementsMatching(null, null, y, doc)),
-    _step3;
-  try {
-    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-      var _quad2 = _step3.value;
-      store.remove(_quad2);
-      store.add(new Statement(_quad2.subject, _quad2.predicate, x, doc));
-    }
-  } catch (err) {
-    _iterator3.e(err);
-  } finally {
-    _iterator3.f();
+  for (const quad of store.statementsMatching(null, null, y, doc)) {
+    store.remove(quad);
+    store.add(new Statement(quad.subject, quad.predicate, x, doc));
   }
 }
 
 /* Change all lone rdf:nil nodes into empty Collections
 */
 export function substituteNillsInDoc(store, doc) {
-  var x = RDF('nil');
-  var _iterator4 = _createForOfIteratorHelper(store.statementsMatching(x, null, null, doc)),
-    _step4;
-  try {
-    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-      var quad = _step4.value;
-      store.remove(quad);
-      var y = new Collection();
-      store.add(new Statement(y, quad.predicate, quad.object, doc));
-    }
-  } catch (err) {
-    _iterator4.e(err);
-  } finally {
-    _iterator4.f();
+  const x = RDF('nil');
+  for (const quad of store.statementsMatching(x, null, null, doc)) {
+    store.remove(quad);
+    const y = new Collection();
+    store.add(new Statement(y, quad.predicate, quad.object, doc));
   }
-  var _iterator5 = _createForOfIteratorHelper(store.statementsMatching(null, null, x, doc)),
-    _step5;
-  try {
-    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
-      var _quad3 = _step5.value;
-      if (!_quad3.predicate.sameTerm(RDF('rest'))) {
-        // If not a tail
-        store.remove(_quad3);
-        var _y = new Collection();
-        store.add(new Statement(_quad3.subject, _quad3.predicate, _y, doc));
-      }
+  for (const quad of store.statementsMatching(null, null, x, doc)) {
+    if (!quad.predicate.sameTerm(RDF('rest'))) {
+      // If not a tail
+      store.remove(quad);
+      const y = new Collection();
+      store.add(new Statement(quad.subject, quad.predicate, y, doc));
     }
-  } catch (err) {
-    _iterator5.e(err);
-  } finally {
-    _iterator5.f();
   }
 }
 /**
@@ -124,34 +76,34 @@ export function substituteNillsInDoc(store, doc) {
 export function convertFirstRestNil(store, doc // Do whole store?
 ) {
   function preceding(ele, listSoFar, trash) {
-    var rests = store.statementsMatching(ele, RDF('rest'), null, doc);
-    if (rests.length !== 1) throw new Error("Bad list structure: no rest at ".concat(ele));
-    var firsts = store.statementsMatching(ele, RDF('first'), null, doc);
-    if (firsts.length !== 1) throw new Error("Bad list structure: rest but ".concat(firsts.length, " firsts at ").concat(ele));
-    var value = firsts[0].object;
-    var total = [value].concat(listSoFar);
+    const rests = store.statementsMatching(ele, RDF('rest'), null, doc);
+    if (rests.length !== 1) throw new Error(`Bad list structure: no rest at ${ele}`);
+    const firsts = store.statementsMatching(ele, RDF('first'), null, doc);
+    if (firsts.length !== 1) throw new Error(`Bad list structure: rest but ${firsts.length} firsts at ${ele}`);
+    const value = firsts[0].object;
+    const total = [value].concat(listSoFar);
     // console.log('  List now is: ', total)
-    var totalTrash = trash.concat(rests).concat(firsts);
-    var pres = store.statementsMatching(null, RDF('rest'), ele, doc);
+    const totalTrash = trash.concat(rests).concat(firsts);
+    const pres = store.statementsMatching(null, RDF('rest'), ele, doc);
     if (pres.length === 0) {
       // Head of the list
-      var newList = new Collection(total);
+      const newList = new Collection(total);
       store.remove(totalTrash);
       // Replace old list with new list:
       substituteInDoc(store, newList, ele, doc);
       return;
     }
-    if (pres.length !== 1) throw new Error("Bad list structure: ".concat(pres.length, " pres at ").concat(ele));
-    var pre = pres[0].subject;
-    if (pre.termType !== 'BlankNode') throw new Error("Bad list element node ".concat(pre, " type: ").concat(pre.termType, " "));
+    if (pres.length !== 1) throw new Error(`Bad list structure: ${pres.length} pres at ${ele}`);
+    const pre = pres[0].subject;
+    if (pre.termType !== 'BlankNode') throw new Error(`Bad list element node ${pre} type: ${pre.termType} `);
     preceding(pre, total, totalTrash);
     return;
   }
   substituteNillsInDoc(store, doc); // lone ones only
 
-  var tails = store.statementsMatching(null, RDF('rest'), RDF('nil'), doc);
-  tails.forEach(function (tail) {
-    if (tail.subject.termType !== 'BlankNode') throw new Error("Bad list element node ".concat(tail.subject, " type: ").concat(tail.subject.termType, " "));
+  const tails = store.statementsMatching(null, RDF('rest'), RDF('nil'), doc);
+  tails.forEach(tail => {
+    if (tail.subject.termType !== 'BlankNode') throw new Error(`Bad list element node ${tail.subject} type: ${tail.subject.termType} `);
     preceding(tail.subject, [], []);
   });
 }