@lblod/graph-rdfa-processor 2.1.0

package/.woodpecker/release.yml

@@ -0,0 +1,16 @@
+steps:
+  install:
+    image: codeberg.org/woodpecker-plugins/node-pm
+    settings:
+      run:
+        - prepare
+      with: npm
+  release:
+    image: plugins/npm
+    settings:
+      token:
+        from_secret: npm_access_token
+      access: public
+when:
+  event: tag
+  ref: refs/tags/v*

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,34 @@
+# graph-rdfa-processor
+
+[![CircleCI](https://circleci.com/gh/science-periodicals/graph-rdfa-processor.svg?style=svg)](https://circleci.com/gh/science-periodicals/graph-rdfa-processor)
+
+Note: this module is auto published to npm on CircleCI. Only run `npm version
+patch|minor|major` and let CI do the rest.
+
+Green turtle GraphRdfaProcessor extracted and available as a
+standalone commonJS / ES2015 module.
+
+All credits are due to Alex Milowski for
+[green-turtle](https://github.com/alexmilowski/green-turtle).
+
+Aside from the adaptation to ES2015, some little changes were made to
+make it compatible with [jsdom](https://github.com/tmpvar/jsdom). Also
+proper Errors are now thrown instead of plain strings.
+
+For convenience, a high level API has been added:
+
+```js
+import getRdfaGraph from graph-rdfa-processor;
+
+let opts = {baseURI: 'http://example.com'};
+let graph = getRdfaGraph(documentOrNode, opts);
+console.log(graph.toString());
+```
+
+See the tests for a full example.
+
+## RDFa to JSON-LD
+
+see
+[jsonld-rdfa-parser](https://github.com/science-periodicals/jsonld-rdfa-parser)
+(using this module to extract the RDFa graph.

package/dist/graph-rdfa-processor.js

@@ -0,0 +1,256 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _rdfaProcessor = _interopRequireDefault(require("./rdfa-processor"));
+
+var _rdfaGraph = require("./rdfa-graph");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
+
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }
+
+function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); }
+
+function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
+
+function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }
+
+function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }
+
+function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }
+
+var GraphRDFaProcessor =
+/*#__PURE__*/
+function (_RDFaProcessor) {
+  _inherits(GraphRDFaProcessor, _RDFaProcessor);
+
+  function GraphRDFaProcessor(target) {
+    _classCallCheck(this, GraphRDFaProcessor);
+
+    return _possibleConstructorReturn(this, _getPrototypeOf(GraphRDFaProcessor).call(this, target));
+  }
+
+  _createClass(GraphRDFaProcessor, [{
+    key: "getObjectSize",
+    value: function getObjectSize(obj) {
+      var size = 0;
+
+      for (var key in obj) {
+        if (obj.hasOwnProperty(key)) {
+          size++;
+        }
+      }
+
+      return size;
+    }
+  }, {
+    key: "init",
+    value: function init() {
+      var thisObj = this;
+      this.finishedHandlers.push(function (node) {
+        for (var subject in thisObj.target.graph.subjects) {
+          var snode = thisObj.target.graph.subjects[subject];
+
+          if (thisObj.getObjectSize(snode.predicates) == 0) {
+            delete thisObj.target.graph.subjects[subject];
+          }
+        }
+      });
+    }
+  }, {
+    key: "newBlankNode",
+    value: function newBlankNode() {
+      return this.target.graph.newBlankNode();
+    }
+  }, {
+    key: "newSubjectOrigin",
+    value: function newSubjectOrigin(origin, subject) {
+      var snode = this.newSubject(null, subject);
+
+      for (var i = 0; i < snode.origins.length; i++) {
+        if (snode.origins[i] === origin) {
+          return;
+        }
+      }
+
+      snode.origins.push(origin);
+
+      if (!origin.data) {
+        Object.defineProperty(origin, "data", {
+          value: snode,
+          writable: false,
+          configurable: true,
+          enumerable: true
+        });
+      }
+    }
+  }, {
+    key: "newSubject",
+    value: function newSubject(origin, subject) {
+      var snode = this.target.graph.subjects[subject];
+
+      if (!snode) {
+        snode = new _rdfaGraph.RDFaSubject(this.target.graph, subject);
+        this.target.graph.subjects[subject] = snode;
+      }
+
+      return snode;
+    }
+  }, {
+    key: "addTriple",
+    value: function addTriple(origin, subject, predicate, object) {
+      var snode = this.newSubject(origin, subject);
+      var pnode = snode.predicates[predicate];
+
+      if (!pnode) {
+        pnode = new _rdfaGraph.RDFaPredicate(predicate);
+        snode.predicates[predicate] = pnode;
+      }
+
+      for (var i = 0; i < pnode.objects.length; i++) {
+        if (pnode.objects[i].type == object.type && pnode.objects[i].value == object.value) {
+          if (pnode.objects[i].origin !== origin) {
+            if (!Array.isArray(pnode.objects[i].origin)) {
+              var origins = [];
+              origins.push(pnode.objects[i].origin);
+              pnode.objects[i].origin = origins;
+            }
+
+            pnode.objects[i].origin.push(origin);
+          }
+
+          return;
+        }
+      }
+
+      pnode.objects.push(object);
+      object.origin = origin;
+
+      if (predicate == _rdfaProcessor.default.typeURI) {
+        snode.types.push(object.value);
+      }
+    }
+  }, {
+    key: "copyProperties",
+    value: function copyProperties() {
+      var copySubjects = [];
+      var patternSubjects = {};
+
+      for (var subject in this.target.graph.subjects) {
+        var snode = this.target.graph.subjects[subject];
+        var pnode = snode.predicates[GraphRDFaProcessor.rdfaCopyPredicate];
+
+        if (!pnode) {
+          continue;
+        }
+
+        copySubjects.push(subject);
+
+        for (var i = 0; i < pnode.objects.length; i++) {
+          if (pnode.objects[i].type != _rdfaProcessor.default.objectURI) {
+            continue;
+          }
+
+          var target = pnode.objects[i].value;
+          var patternSubjectNode = this.target.graph.subjects[target];
+
+          if (!patternSubjectNode) {
+            continue;
+          }
+
+          var patternTypes = patternSubjectNode.predicates[_rdfaProcessor.default.typeURI];
+
+          if (!patternTypes) {
+            continue;
+          }
+
+          var isPattern = false;
+
+          for (var j = 0; j < patternTypes.objects.length && !isPattern; j++) {
+            if (patternTypes.objects[j].value == GraphRDFaProcessor.rdfaPatternType && patternTypes.objects[j].type == _rdfaProcessor.default.objectURI) {
+              isPattern = true;
+            }
+          }
+
+          if (!isPattern) {
+            continue;
+          }
+
+          patternSubjects[target] = true;
+
+          for (var predicate in patternSubjectNode.predicates) {
+            var targetPNode = patternSubjectNode.predicates[predicate];
+
+            if (predicate == _rdfaProcessor.default.typeURI) {
+              if (targetPNode.objects.length == 1) {
+                continue;
+              }
+
+              for (var j = 0; j < targetPNode.objects.length; j++) {
+                if (targetPNode.objects[j].value != GraphRDFaProcessor.rdfaPatternType) {
+                  var subjectPNode = snode.predicates[predicate];
+
+                  if (!subjectPNode) {
+                    subjectPNode = new _rdfaGraph.RDFaPredicate(predicate);
+                    snode.predicates[predicate] = subjectPNode;
+                  }
+
+                  subjectPNode.objects.push({
+                    type: targetPNode.objects[j].type,
+                    value: targetPNode.objects[j].value,
+                    language: targetPNode.objects[j].language,
+                    origin: targetPNode.objects[j].origin
+                  });
+                  snode.types.push(targetPNode.objects[j].value);
+                }
+              }
+            } else {
+              var subjectPNode = snode.predicates[predicate];
+
+              if (!subjectPNode) {
+                subjectPNode = new _rdfaGraph.RDFaPredicate(predicate);
+                snode.predicates[predicate] = subjectPNode;
+              }
+
+              for (var j = 0; j < targetPNode.objects.length; j++) {
+                subjectPNode.objects.push({
+                  type: targetPNode.objects[j].type,
+                  value: targetPNode.objects[j].value,
+                  language: targetPNode.objects[j].language,
+                  origin: targetPNode.objects[j].origin
+                });
+              }
+            }
+          }
+        }
+      }
+
+      for (var i = 0; i < copySubjects.length; i++) {
+        var snode = this.target.graph.subjects[copySubjects[i]];
+        delete snode.predicates[GraphRDFaProcessor.rdfaCopyPredicate];
+      }
+
+      for (var subject in patternSubjects) {
+        delete this.target.graph.subjects[subject];
+      }
+    }
+  }]);
+
+  return GraphRDFaProcessor;
+}(_rdfaProcessor.default);
+
+exports.default = GraphRDFaProcessor;
+;
+GraphRDFaProcessor.rdfaCopyPredicate = "http://www.w3.org/ns/rdfa#copy";
+GraphRDFaProcessor.rdfaPatternType = "http://www.w3.org/ns/rdfa#Pattern";
+module.exports = exports.default;

package/dist/index.js

@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+
+var _uriResolver = _interopRequireDefault(require("./uri-resolver"));
+
+var _graphRdfaProcessor = _interopRequireDefault(require("./graph-rdfa-processor"));
+
+var _rdfaGraph = require("./rdfa-graph");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+function _default(document) {
+  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  var node = document.documentElement || document;
+  var baseURI = options.baseURI ? options.baseURI : node.baseURI;
+  var specialHtmlPredicates = options.specialHtmlPredicates || [];
+  var graph = new _rdfaGraph.RDFaGraph();
+  var target = {
+    graph: graph,
+    baseURI: new _uriResolver.default().parseURI(baseURI),
+    specialHtmlPredicates: specialHtmlPredicates
+  };
+  var processor = new _graphRdfaProcessor.default(target);
+  processor.process(node, options);
+  return target.graph;
+}
+
+module.exports = exports.default;

package/dist/node.js

@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var Node = {
+  ELEMENT_NODE: 1,
+  ATTRIBUTE_NODE: 2,
+  TEXT_NODE: 3,
+  CDATA_SECTION_NODE: 4,
+  ENTITY_REFERENCE_NODE: 5,
+  ENTITY_NODE: 6,
+  PROCESSING_INSTRUCTION_NODE: 7,
+  COMMENT_NODE: 8,
+  DOCUMENT_NODE: 9,
+  DOCUMENT_TYPE_NODE: 10,
+  DOCUMENT_FRAGMENT_NODE: 11,
+  NOTATION_NODE: 12
+};
+var _default = Node;
+exports.default = _default;
+module.exports = exports.default;