@_linked/rdf-mem-store 0.0.1

package/lib/cjs/collections/NodeMap.js

@@ -0,0 +1,244 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeMap = void 0;
+/*
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/.
+ */
+const CoreMap_1 = require("@_linked/core/collections/CoreMap");
+const QuadSet_js_1 = require("./QuadSet.js");
+const QuadArray_js_1 = require("./QuadArray.js");
+const NodeSet_js_1 = require("./NodeSet.js");
+class NodeMap extends CoreMap_1.CoreMap {
+    constructor(iterable) {
+        super(iterable);
+    }
+    getQuads(property) {
+        var res = new QuadSet_js_1.QuadSet();
+        for (var [key, node] of this) {
+            for (var quad of node.getQuads(property)) {
+                res.add(quad);
+            }
+        }
+        return res;
+    }
+    getInverseQuads(property) {
+        var res = new QuadSet_js_1.QuadSet();
+        for (var [key, node] of this) {
+            for (var quad of node.getInverseQuads(property)) {
+                res.add(quad);
+            }
+        }
+        return res;
+    }
+    getAll(property) {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            res = res.concat(node.getAll(property));
+        }
+        return res;
+    }
+    getAllInverse(property) {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            res = res.concat(node.getAllInverse(property));
+        }
+        return res;
+    }
+    getMultipleInverse(properties) {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            for (var property of properties) {
+                res = res.concat(node.getAllInverse(property));
+            }
+        }
+        return res;
+    }
+    getMultiple(properties) {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            for (var property of properties) {
+                res = res.concat(node.getAll(property));
+            }
+        }
+        return res;
+    }
+    getDeep(property, maxDepth = Infinity) {
+        var result = new NodeSet_js_1.NodeSet();
+        var stack = new NodeSet_js_1.NodeSet(this.values());
+        while (stack.size > 0 && maxDepth > 0) {
+            var nextLevelStack = new NodeSet_js_1.NodeSet();
+            for (let node of stack) {
+                for (var value of node.getAll(property)) {
+                    if (!result.has(value)) {
+                        result.add(value);
+                        nextLevelStack.add(value);
+                    }
+                }
+            }
+            stack = nextLevelStack;
+            maxDepth--;
+        }
+        return result;
+    }
+    getOneFromPath(...properties) {
+        //NOTE: same implementation as in NamedNode
+        //we just need one, so we do a depth-first algorithm which will be more performant, so:
+        //take first property
+        var property = properties.shift();
+        //if more properties left
+        if (properties.length > 0) {
+            var res;
+            //check if any of the values of that property for this node
+            //has a path to the rest of the properties, and if so return the found value
+            for (var value of this.getAll(property)) {
+                if ((res = value.getOneFromPath(...properties))) {
+                    return res;
+                }
+            }
+        }
+        else {
+            //return the first value possible
+            return this.getOne(property);
+        }
+    }
+    getAllFromPath(...properties) {
+        //we just need all paths, so we can do a breadth first implementation
+        //take first property
+        var property = properties.shift();
+        if (properties.length > 0) {
+            //and ask the whole set of values to return all values of the rest of the path
+            return this.getAll(property).getAllFromPath(...properties);
+        }
+        else {
+            return this.getAll(property);
+        }
+    }
+    getProperties(includeFromIncomingArcs = false) {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            res = res.concat(node.getProperties(includeFromIncomingArcs));
+        }
+        return res;
+    }
+    getInverseProperties() {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var [key, node] of this) {
+            res = res.concat(node.getInverseProperties());
+        }
+        return res;
+    }
+    getOne(property) {
+        for (var [key, node] of this) {
+            if (node.hasProperty(property)) {
+                return node.getOne(property);
+            }
+        }
+    }
+    getOneInverse(property) {
+        for (var [key, node] of this) {
+            if (node.hasInverseProperty(property)) {
+                return node.getOneInverse(property);
+            }
+        }
+    }
+    getAllQuads(includeAsObject = false, includeImplicit = false) {
+        var res = new QuadArray_js_1.QuadArray();
+        for (var [key, node] of this) {
+            for (var item of node.getAllQuads(includeAsObject, includeImplicit)) {
+                if (res.indexOf(item) === -1) {
+                    res.push(item);
+                }
+            }
+        }
+        return res;
+    }
+    getAllInverseQuads(includeImplicit) {
+        var res = new QuadArray_js_1.QuadArray();
+        for (var [key, node] of this) {
+            for (var item of node.getAllInverseQuads(includeImplicit)) {
+                if (res.indexOf(item) === -1) {
+                    res.push(item);
+                }
+            }
+        }
+        return res;
+    }
+    where(property, value) {
+        //TODO: test performance with
+        //return this.filter(r => r.has(property,value));
+        var res = this.createNew();
+        for (var [key, node] of this) {
+            if (node.has(property, value)) {
+                //as any apparently needed, strange that NamedNode is not seen as matching to R?
+                res.set(key, node);
+            }
+        }
+        return res;
+    }
+    getWhere(property, value) {
+        for (var [key, node] of this) {
+            if (node.has(property, value)) {
+                return node;
+            }
+        }
+        return undefined;
+    }
+    setEach(property, value) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.set(property, value) && res;
+        }
+        return res;
+    }
+    msetEach(property, values) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.mset(property, values) && res;
+        }
+        return res;
+    }
+    updateEach(property, value) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.overwrite(property, value) && res;
+        }
+        return res;
+    }
+    mupdateEach(property, values) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.moverwrite(property, values) && res;
+        }
+        return res;
+    }
+    unsetEach(property, value) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.unset(property, value) && res;
+        }
+        return res;
+    }
+    unsetAllEach(property) {
+        let res = false;
+        for (var [key, node] of this) {
+            res = node.unsetAll(property) && res;
+        }
+        return res;
+    }
+    promiseLoaded(loadInverseProperties = false) {
+        return Promise.all([...this.values()].map((node) => node.promiseLoaded(loadInverseProperties)))
+            .then((res) => {
+            return res.every((result) => result === true);
+        })
+            .catch(() => {
+            return false;
+        });
+    }
+    isLoaded(includingInverseProperties = false) {
+        return [...this.values()].every((value) => value.isLoaded(includingInverseProperties));
+    }
+}
+exports.NodeMap = NodeMap;
+//# sourceMappingURL=NodeMap.js.map

package/lib/cjs/collections/NodeMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeMap.js","sourceRoot":"","sources":["../../../src/collections/NodeMap.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACH,+DAA0D;AAG1D,6CAAqC;AACrC,iDAAyC;AACzC,6CAAqC;AAGrC,MAAa,OACX,SAAQ,iBAAkB;IAG1B,YAAY,QAAgC;QAC1C,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,QAAmB;QAC1B,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,eAAe,CAAC,QAAmB;QACjC,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,QAAmB;QACxB,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,aAAa,CAAC,QAAmB;QAC/B,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAa,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kBAAkB,CAAC,UAAoC;QACrD,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;gBAChC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CAAC,UAAoC;QAC9C,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;gBAChC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,CAAC,QAAmB,EAAE,WAAmB,QAAQ;QACtD,IAAI,MAAM,GAAG,IAAI,oBAAO,EAAE,CAAC;QAC3B,IAAI,KAAK,GAAY,IAAI,oBAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAChD,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACtC,IAAI,cAAc,GAAG,IAAI,oBAAO,EAAE,CAAC;YACnC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBAClB,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC5B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,cAAc,CAAC;YACvB,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,cAAc,CAAC,GAAG,UAAuB;QACvC,2CAA2C;QAE3C,uFAAuF;QACvF,qBAAqB;QACrB,IAAI,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAElC,yBAAyB;QACzB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,GAAG,CAAC;YACR,2DAA2D;YAC3D,4EAA4E;YAC5E,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC;oBAChD,OAAO,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,iCAAiC;YACjC,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,cAAc,CAAC,GAAG,UAAuB;QACvC,qEAAqE;QACrE,qBAAqB;QACrB,IAAI,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAElC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,8EAA8E;YAC9E,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,cAAc,CAAC,GAAG,UAAU,CAAC,CAAC;QAC7D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,aAAa,CAAC,0BAAmC,KAAK;QACpD,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAa,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,uBAAuB,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,oBAAoB;QAClB,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAa,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,QAAmB;QACxB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,aAAa,CAAC,QAAmB;QAC/B,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,WAAW,CACT,kBAA2B,KAAK,EAChC,kBAA2B,KAAK;QAEhC,IAAI,GAAG,GAAG,IAAI,wBAAS,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,eAAe,EAAE,eAAe,CAAC,EAAE,CAAC;gBACpE,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kBAAkB,CAAC,eAAyB;QAC1C,IAAI,GAAG,GAAG,IAAI,wBAAS,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,EAAE,CAAC;gBAC1D,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,QAAmB,EAAE,KAAW;QACpC,6BAA6B;QAC7B,iDAAiD;QACjD,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9B,gFAAgF;gBAChF,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,CAAC,QAAmB,EAAE,KAAW;QACvC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,QAAmB,EAAE,KAAW;QACtC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,CAAC,QAAmB,EAAE,MAA2B;QACvD,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,UAAU,CAAC,QAAmB,EAAE,KAAW;QACzC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CAAC,QAAmB,EAAE,MAA2B;QAC1D,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,CAAC,QAAmB,EAAE,KAAW;QACxC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,YAAY,CAAC,QAAmB;QAC9B,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;QACvC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,aAAa,CAAC,wBAAiC,KAAK;QAClD,OAAO,OAAO,CAAC,GAAG,CAChB,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC9B,IAAI,CAAC,aAAa,CAAC,qBAAqB,CAAC,CAC1C,CACF;aACE,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;YACZ,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC;aACD,KAAK,CAAC,GAAG,EAAE;YACV,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACP,CAAC;IAED,QAAQ,CAAC,6BAAsC,KAAK;QAClD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CACxC,KAAK,CAAC,QAAQ,CAAC,0BAA0B,CAAC,CAC3C,CAAC;IACJ,CAAC;CACF;AA3QD,0BA2QC"}

package/lib/cjs/collections/NodeSet.d.ts

@@ -0,0 +1,55 @@
+import { CoreSet } from '@_linked/core/collections/CoreSet';
+import { NamedNode, Node } from '../models.js';
+import { IGraphObjectSet } from '../interfaces/IGraphObjectSet.js';
+import { QuadSet } from './QuadSet.js';
+import { QuadArray } from './QuadArray.js';
+import { ICoreIterable } from '@_linked/core/interfaces/ICoreIterable';
+export declare class NodeSet<R extends Node = Node> extends CoreSet<R> implements IGraphObjectSet<Node> {
+    constructor(iterable?: Iterable<R>);
+    static fromValues<T extends Node = Node>(strings: string[]): NodeSet<T>;
+    getProperties(includeFromIncomingArcs?: boolean): NodeSet<NamedNode>;
+    getInverseProperties(): NodeSet<NamedNode>;
+    getOne(property: NamedNode): Node | undefined;
+    /**
+     * Returns a NodeSet containing the merged results of node.get(property) for each node in this set
+     * @param property
+     * @returns {NodeSet}
+     */
+    getAll(property: NamedNode): NodeSet;
+    getValues(property: NamedNode): string[];
+    /**
+     * Returns an array of the URI's or literal values (for Literals) of the nodes in this set
+     */
+    getNodeValues(): string[];
+    getOneFromPath(...properties: NamedNode[]): Node | undefined;
+    getAllFromPath(...properties: NamedNode[]): NodeSet;
+    getOneInverse(property: NamedNode): NamedNode | undefined;
+    getAllInverse(property: NamedNode): NodeSet<NamedNode>;
+    getMultipleInverse(properties: ICoreIterable<NamedNode>): NodeSet;
+    getMultiple(properties: ICoreIterable<NamedNode>): NodeSet;
+    getDeep(property: NamedNode, maxDepth?: number): NodeSet;
+    getQuads(property: NamedNode): QuadSet;
+    getInverseQuads(property: NamedNode): QuadSet | any;
+    getAllQuads(includeAsObject?: boolean, includeImplicit?: boolean): QuadArray;
+    getAllInverseQuads(includeImplicit?: boolean): QuadArray;
+    where(property: NamedNode, value: Node): this;
+    getWhere(property: NamedNode, value: Node): Node | undefined;
+    setEach(property: NamedNode, value: Node): boolean;
+    msetEach(property: NamedNode, values: ICoreIterable<Node>): boolean;
+    updateEach(property: NamedNode, value: Node): boolean;
+    mupdateEach(property: NamedNode, values: ICoreIterable<Node>): boolean;
+    unsetEach(property: NamedNode, value: Node): boolean;
+    unsetAllEach(property: NamedNode): boolean;
+    /**
+     * @deprecated
+     * @param loadInverseProperties
+     */
+    promiseLoaded(loadInverseProperties?: boolean): Promise<boolean>;
+    /**
+     * @deprecated
+     * @param includingInverseProperties
+     */
+    isLoaded(includingInverseProperties?: boolean): boolean;
+    toString(): string;
+    print(includeIncomingProperties?: boolean): string;
+}

package/lib/cjs/collections/NodeSet.js

@@ -0,0 +1,296 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeSet = void 0;
+/*
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/.
+ */
+const CoreSet_1 = require("@_linked/core/collections/CoreSet");
+const models_js_1 = require("../models.js");
+const QuadSet_js_1 = require("./QuadSet.js");
+const QuadArray_js_1 = require("./QuadArray.js");
+const Debug_js_1 = require("../utils/Debug.js");
+const URI_js_1 = require("../utils/URI.js");
+class NodeSet extends CoreSet_1.CoreSet {
+    constructor(iterable) {
+        super(iterable);
+    }
+    static fromValues(strings) {
+        return new NodeSet(strings.map((s) => (URI_js_1.URI.isURI(s)
+            ? models_js_1.NamedNode.getOrCreate(s)
+            : new models_js_1.Literal(s))));
+    }
+    //we cannot use NamedNodeSet here because of requirement loops
+    getProperties(includeFromIncomingArcs = false) {
+        var res = new NodeSet();
+        for (var node of this) {
+            res = res.concat(node.getProperties(includeFromIncomingArcs));
+        }
+        return res;
+    }
+    getInverseProperties() {
+        var res = new NodeSet();
+        for (var node of this) {
+            res = res.concat(node.getInverseProperties());
+        }
+        return res;
+    }
+    getOne(property) {
+        for (var node of this) {
+            if (node.hasProperty(property)) {
+                return node.getOne(property);
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Returns a NodeSet containing the merged results of node.get(property) for each node in this set
+     * @param property
+     * @returns {NodeSet}
+     */
+    getAll(property) {
+        var res = new NodeSet();
+        for (var node of this) {
+            res = res.concat(node.getAll(property));
+        }
+        return res;
+    }
+    getValues(property) {
+        var res = [];
+        for (var node of this) {
+            res.push(node.getValue(property));
+        }
+        return res;
+    }
+    /**
+     * Returns an array of the URI's or literal values (for Literals) of the nodes in this set
+     */
+    getNodeValues() {
+        var res = [];
+        for (var node of this) {
+            res.push(node.value);
+        }
+        return res;
+    }
+    getOneFromPath(...properties) {
+        //NOTE: same implementation as in NamedNode
+        //we just need one, so we do a depth-first algorithm which will be more performant, so:
+        //take first property
+        var property = properties.shift();
+        //if more properties left
+        if (properties.length > 0) {
+            var res;
+            //check if any of the values of that property for this node
+            //has a path to the rest of the properties, and if so return the found value
+            for (var value of this.getAll(property)) {
+                if ((res = value.getOneFromPath(...properties))) {
+                    return res;
+                }
+            }
+        }
+        else {
+            //return the first value possible
+            return this.getOne(property);
+        }
+    }
+    getAllFromPath(...properties) {
+        //we just need all paths, so we can do a breadth first implementation
+        //take first property
+        var property = properties.shift();
+        if (properties.length > 0) {
+            //and ask the whole set of values to return all values of the rest of the path
+            return this.getAll(property).getAllFromPath(...properties);
+        }
+        else {
+            return this.getAll(property);
+        }
+    }
+    getOneInverse(property) {
+        for (var node of this) {
+            if (node.hasInverseProperty(property)) {
+                return node.getOneInverse(property);
+            }
+        }
+        return undefined;
+    }
+    getAllInverse(property) {
+        var res = new NodeSet();
+        for (var node of this) {
+            res = res.concat(node.getAllInverse(property));
+        }
+        return res;
+    }
+    getMultipleInverse(properties) {
+        var res = new NodeSet();
+        for (var instance of this) {
+            for (var property of properties) {
+                res = res.concat(instance.getAllInverse(property));
+            }
+        }
+        return res;
+    }
+    getMultiple(properties) {
+        var res = new NodeSet();
+        for (var node of this) {
+            for (var property of properties) {
+                res = res.concat(node.getAll(property));
+            }
+        }
+        return res;
+    }
+    getDeep(property, maxDepth = Infinity) {
+        var result = new NodeSet();
+        var stack = this;
+        while (stack.size > 0 && maxDepth > 0) {
+            var nextLevelStack = new NodeSet();
+            for (let node of stack) {
+                for (var value of node.getAll(property)) {
+                    if (!result.has(value)) {
+                        result.add(value);
+                        nextLevelStack.add(value);
+                    }
+                }
+            }
+            stack = nextLevelStack;
+            maxDepth--;
+        }
+        return result;
+    }
+    getQuads(property) {
+        var res = new QuadSet_js_1.QuadSet();
+        for (var node of this) {
+            for (var quad of node.getQuads(property)) {
+                res.add(quad);
+            }
+        }
+        return res;
+    }
+    getInverseQuads(property) {
+        var res = new QuadSet_js_1.QuadSet();
+        for (var node of this) {
+            for (var quad of node.getInverseQuads(property)) {
+                res.add(quad);
+            }
+        }
+        return res;
+    }
+    getAllQuads(includeAsObject, includeImplicit = false) {
+        var res = new QuadArray_js_1.QuadArray();
+        for (var node of this) {
+            for (var item of node.getAllQuads(includeAsObject, includeImplicit)) {
+                if (res.indexOf(item) === -1) {
+                    res.push(item);
+                }
+            }
+            //res = res.concat(node.getAllQuads(includeAsObject));
+        }
+        return res;
+    }
+    getAllInverseQuads(includeImplicit) {
+        var res = new QuadArray_js_1.QuadArray();
+        for (var node of this) {
+            for (var item of node.getAllInverseQuads(includeImplicit)) {
+                if (res.indexOf(item) === -1) {
+                    res.push(item);
+                }
+            }
+        }
+        return res;
+    }
+    where(property, value) {
+        //TODO: test performance with
+        //return this.filter(r => r.has(property,value));
+        var res = this.createNew();
+        for (var node of this) {
+            if (node.has(property, value)) {
+                //as any apparently needed, strange that NamedNode is not seen as matching to R?
+                res.add(node);
+            }
+        }
+        return res;
+    }
+    getWhere(property, value) {
+        for (var node of this) {
+            if (node.has(property, value)) {
+                return node;
+            }
+        }
+        return undefined;
+    }
+    setEach(property, value) {
+        let res = false;
+        for (var node of this) {
+            res = node.set(property, value) && res;
+        }
+        return res;
+    }
+    msetEach(property, values) {
+        let res = false;
+        for (var node of this) {
+            res = node.mset(property, values) && res;
+        }
+        return res;
+    }
+    updateEach(property, value) {
+        let res = false;
+        for (var node of this) {
+            res = node.overwrite(property, value) && res;
+        }
+        return res;
+    }
+    mupdateEach(property, values) {
+        let res = false;
+        for (var node of this) {
+            res = node.moverwrite(property, values) && res;
+        }
+        return res;
+    }
+    unsetEach(property, value) {
+        let res = false;
+        for (var node of this) {
+            res = node.unset(property, value) && res;
+        }
+        return res;
+    }
+    unsetAllEach(property) {
+        let res = false;
+        for (var node of this) {
+            res = node.unsetAll(property) && res;
+        }
+        return res;
+    }
+    //@TODO: remove generic isLoaded now that we have Shape loading functionality?
+    //@TODO: remove promiseLoaded now that we have Shape loading functionality?
+    /**
+     * @deprecated
+     * @param loadInverseProperties
+     */
+    promiseLoaded(loadInverseProperties = false) {
+        return Promise.all(this.map((node) => node.promiseLoaded(loadInverseProperties)))
+            .then((res) => {
+            return res.every((result) => result === true);
+        })
+            .catch(() => {
+            return false;
+        });
+    }
+    // perhaps we need to add a new shapeIsLoaded() method?
+    /**
+     * @deprecated
+     * @param includingInverseProperties
+     */
+    isLoaded(includingInverseProperties = false) {
+        return this.every((node) => node.isLoaded(includingInverseProperties));
+    }
+    toString() {
+        return ('NodeSet {\n' +
+            [...this].map((node) => '\t' + node.toString()).join(',\n') +
+            '\n}');
+    }
+    print(includeIncomingProperties = true) {
+        return Debug_js_1.Debug.print(this, includeIncomingProperties);
+    }
+}
+exports.NodeSet = NodeSet;
+//# sourceMappingURL=NodeSet.js.map

package/lib/cjs/collections/NodeSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeSet.js","sourceRoot":"","sources":["../../../src/collections/NodeSet.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACH,+DAA0D;AAC1D,4CAAoD;AAEpD,6CAAqC;AACrC,iDAAyC;AAEzC,gDAAwC;AACxC,4CAAoC;AAEpC,MAAa,OACX,SAAQ,iBAAU;IAGlB,YAAY,QAAsB;QAChC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,UAAU,CAAwB,OAAiB;QACxD,OAAO,IAAI,OAAO,CAChB,OAAO,CAAC,GAAG,CACT,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,YAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YACX,CAAC,CAAC,qBAAS,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1B,CAAC,CAAC,IAAI,mBAAO,CAAC,CAAC,CAAC,CAAa,CAClC,CACF,CAAC;IACJ,CAAC;IAED,8DAA8D;IAC9D,aAAa,CAAC,0BAAmC,KAAK;QACpD,IAAI,GAAG,GAAG,IAAI,OAAO,EAAa,CAAC;QACnC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,uBAAuB,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,oBAAoB;QAClB,IAAI,GAAG,GAAG,IAAI,OAAO,EAAa,CAAC;QACnC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,QAAmB;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,QAAmB;QACxB,IAAI,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,CAAC,QAAmB;QAC3B,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,aAAa;QACX,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,cAAc,CAAC,GAAG,UAAuB;QACvC,2CAA2C;QAE3C,uFAAuF;QACvF,qBAAqB;QACrB,IAAI,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAElC,yBAAyB;QACzB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,GAAG,CAAC;YACR,2DAA2D;YAC3D,4EAA4E;YAC5E,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC;oBAChD,OAAO,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,iCAAiC;YACjC,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,cAAc,CAAC,GAAG,UAAuB;QACvC,qEAAqE;QACrE,qBAAqB;QACrB,IAAI,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAElC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,8EAA8E;YAC9E,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,cAAc,CAAC,GAAG,UAAU,CAAC,CAAC;QAC7D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,aAAa,CAAC,QAAmB;QAC/B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,aAAa,CAAC,QAAmB;QAC/B,IAAI,GAAG,GAAG,IAAI,OAAO,EAAa,CAAC;QACnC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kBAAkB,CAAC,UAAoC;QACrD,IAAI,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YAC1B,KAAK,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;gBAChC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CAAC,UAAoC;QAC9C,IAAI,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;gBAChC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,CAAC,QAAmB,EAAE,WAAmB,QAAQ;QACtD,IAAI,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,KAAK,GAAY,IAAI,CAAC;QAC1B,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACtC,IAAI,cAAc,GAAG,IAAI,OAAO,EAAE,CAAC;YACnC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBAClB,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC5B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,cAAc,CAAC;YACvB,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,QAAQ,CAAC,QAAmB;QAC1B,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,eAAe,CAAC,QAAmB;QACjC,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CACT,eAAyB,EACzB,kBAA2B,KAAK;QAEhC,IAAI,GAAG,GAAG,IAAI,wBAAS,EAAE,CAAC;QAC1B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,eAAe,EAAE,eAAe,CAAC,EAAE,CAAC;gBACpE,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,sDAAsD;QACxD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kBAAkB,CAAC,eAAyB;QAC1C,IAAI,GAAG,GAAG,IAAI,wBAAS,EAAE,CAAC;QAC1B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,EAAE,CAAC;gBAC1D,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,QAAmB,EAAE,KAAW;QACpC,6BAA6B;QAC7B,iDAAiD;QACjD,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC3B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9B,gFAAgF;gBAChF,GAAG,CAAC,GAAG,CAAC,IAAW,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,CAAC,QAAmB,EAAE,KAAW;QACvC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,QAAmB,EAAE,KAAW;QACtC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ,CAAC,QAAmB,EAAE,MAA2B;QACvD,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,UAAU,CAAC,QAAmB,EAAE,KAAW;QACzC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CAAC,QAAmB,EAAE,MAA2B;QAC1D,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC;QACjD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,CAAC,QAAmB,EAAE,KAAW;QACxC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,YAAY,CAAC,QAAmB;QAC9B,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;QACvC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8EAA8E;IAE9E,2EAA2E;IAC3E;;;OAGG;IACH,aAAa,CAAC,wBAAiC,KAAK;QAClD,OAAO,OAAO,CAAC,GAAG,CAChB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,qBAAqB,CAAC,CAAC,CAC9D;aACE,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;YACZ,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC;aACD,KAAK,CAAC,GAAG,EAAE;YACV,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACP,CAAC;IAED,uDAAuD;IACvD;;;OAGG;IACH,QAAQ,CAAC,6BAAsC,KAAK;QAClD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,0BAA0B,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,QAAQ;QACN,OAAO,CACL,aAAa;YACb,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC3D,KAAK,CACN,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,4BAAqC,IAAI;QAC7C,OAAO,gBAAK,CAAC,KAAK,CAAC,IAAI,EAAE,yBAAyB,CAAC,CAAC;IACtD,CAAC;CACF;AAtUD,0BAsUC"}

package/lib/cjs/collections/NodeURIMappings.d.ts

@@ -0,0 +1,20 @@
+import { BlankNode, NamedNode } from '../models.js';
+import { NodeMap } from './NodeMap.js';
+import { NodeSet } from './NodeSet.js';
+export declare class NodeURIMappings extends NodeMap<NamedNode> {
+    originalUris: Map<string, string>;
+    /**
+     * Will create a blanknode the first time you give a certain URI
+     * and return the same blanknode when you request it again.
+     * Note that the blanknode itself will have its own local URI regardless of the give URI
+     * this method allows you to parse a set of data that
+     * uses a certain identifier for a certain blanknode across several places
+     * and convert it to a local blanknode
+     * @param {string} givenUri
+     * @returns {BlankNode}
+     */
+    getOrCreateBlankNode(givenUri: string): BlankNode;
+    getBlankNodes(): NodeSet<BlankNode>;
+    getOrCreateNamedNode(uri: string): NamedNode;
+    getOriginalUri(localUri: string): string;
+}