@_linked/rdf-mem-store 0.0.1

package/lib/cjs/collections/NodeURIMappings.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeURIMappings = 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 models_js_1 = require("../models.js");
+const NodeMap_js_1 = require("./NodeMap.js");
+const NodeSet_js_1 = require("./NodeSet.js");
+//TODO: rename to something more fitting now that it also handles TMP NamedNodes
+class NodeURIMappings extends NodeMap_js_1.NodeMap {
+    constructor() {
+        super(...arguments);
+        this.originalUris = new Map();
+    }
+    /**
+     * 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) {
+        //TODO: rename this method to getOrCreateBlankNode
+        if (this.has(givenUri)) {
+            return this.get(givenUri);
+        }
+        else {
+            var blankNode = new models_js_1.BlankNode();
+            this.set(givenUri, blankNode);
+            this.originalUris.set(blankNode.uri, givenUri);
+            return blankNode;
+        }
+    }
+    getBlankNodes() {
+        return new NodeSet_js_1.NodeSet(this.filter((n) => n instanceof models_js_1.BlankNode).values());
+    }
+    getOrCreateNamedNode(uri) {
+        //the temp URI's in one environment may already be used in another environment
+        //so we need to check for temporary URI's and convert them to a local temporary URI
+        if (uri.substring(0, models_js_1.NamedNode.TEMP_URI_BASE.length) ==
+            models_js_1.NamedNode.TEMP_URI_BASE) {
+            if (!this.has(uri)) {
+                //create a new temp node that has a LOCAL temp URI
+                var tmpResource = models_js_1.NamedNode.create();
+                this.set(uri, tmpResource);
+                this.originalUris.set(tmpResource.uri, uri);
+                return tmpResource;
+            }
+            return this.get(uri);
+        }
+        return models_js_1.NamedNode.getOrCreate(uri);
+    }
+    getOriginalUri(localUri) {
+        //return the original uri, and if we dont have a mapping it will not have changed
+        return this.originalUris.get(localUri) || localUri;
+    }
+}
+exports.NodeURIMappings = NodeURIMappings;
+//# sourceMappingURL=NodeURIMappings.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"NodeURIMappings.js","sourceRoot":"","sources":["../../../src/collections/NodeURIMappings.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACH,4CAAiD;AACjD,6CAAqC;AACrC,6CAAqC;AAErC,gFAAgF;AAChF,MAAa,eAAgB,SAAQ,oBAAkB;IAAvD;;QACE,iBAAY,GAAwB,IAAI,GAAG,EAAE,CAAC;IAmDhD,CAAC;IAjDC;;;;;;;;;OASG;IACH,oBAAoB,CAAC,QAAgB;QACnC,kDAAkD;QAClD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,IAAI,SAAS,GAAc,IAAI,qBAAS,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC9B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC/C,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED,aAAa;QACX,OAAO,IAAI,oBAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,qBAAS,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,oBAAoB,CAAC,GAAW;QAC9B,8EAA8E;QAC9E,mFAAmF;QACnF,IACE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,qBAAS,CAAC,aAAa,CAAC,MAAM,CAAC;YAChD,qBAAS,CAAC,aAAa,EACvB,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,kDAAkD;gBAClD,IAAI,WAAW,GAAc,qBAAS,CAAC,MAAM,EAAE,CAAC;gBAChD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;gBAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC5C,OAAO,WAAW,CAAC;YACrB,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,qBAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,cAAc,CAAC,QAAgB;QAC7B,iFAAiF;QACjF,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;IACrD,CAAC;CACF;AApDD,0CAoDC"}

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

@@ -0,0 +1,63 @@
+import { NodeSet } from './NodeSet.js';
+import { NamedNode, Node } from '../models.js';
+import { QuadSet } from './QuadSet.js';
+export declare class NodeValuesSet extends NodeSet {
+    private _subject;
+    private _property;
+    constructor(_subject: Node, _property: NamedNode, iterable?: Iterable<Node>);
+    get subject(): Node;
+    get property(): NamedNode;
+    /**
+     * Listen to any changes in the valueset for this subject + property combination
+     * If you provide context (usually 'this'), removing the onChange listener will remove all listeners for this property & context, regardless of what callback you provide. (this is helpful if you dont have access to the excact same callback function)
+     * @param callback
+     * @param context
+     */
+    onChange(callback: (quads?: QuadSet, property?: NamedNode) => void, context?: any): void;
+    /**
+     * Remove listener for changes in the valueset for this subject + property combination
+     * If you provide context (usually 'this'), removing the onChange listener will remove all listeners for this property & context, regardless of what callback you provide. (this is helpful if you dont have access to the excact same callback function)
+     * @param callback
+     * @param context
+     */
+    removeOnChange(callback: (quads?: QuadSet, property?: NamedNode) => void, context?: any): void;
+    /**
+     * When cloned we switch to a NodeSet of all the values
+     * And detach from the magic of PropertyValueSets, which are only meant to be used internally in the NamedNode model
+     * @param args
+     */
+    createNew(...args: any[]): any;
+    /**
+     * Add a new node to this set of values.
+     * This creates a new quad in the local graph.
+     * This is equivalent to manually adding a new property value using `subject.set(predicate,object)`
+     * @param value the node to add
+     */
+    add(value: Node): this;
+    /**
+     * Remove a node from this set of values.
+     * This removes a quad in the local graph (if the node was an existing value)
+     * This is equivalent to manually removing a property value using `subject.unset(predicate,object)`
+     * @param value the node to remove
+     */
+    delete(value: Node): boolean;
+    /**
+     * Actually removes a node from this value set. Does not remove any quads in the local graph
+     * DO NOT use this method.
+     * Use subject.getAll(predicate).remove(object) or subject.unset(predicate,object) instead
+     * @internal
+     * @param v
+     */
+    __delete(v: any): boolean;
+    /**
+     * Adds a value directly to this value set. Does not create new quads in the local graph
+     * DO NOT USE this method.
+     * Use subject.getAll(predicate).add(object) or subject.set(predicate,object) instead.
+     * @internal
+     * @param v
+     */
+    __add(v: any): this;
+    sort(compareFn?: any, thisArg?: any): NodeSet | any;
+    concat(...sets: any[]): NodeSet | any;
+    filter(fn: any): this;
+}

package/lib/cjs/collections/NodeValuesSet.js

@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeValuesSet = 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 NodeSet_js_1 = require("./NodeSet.js");
+class NodeValuesSet extends NodeSet_js_1.NodeSet {
+    constructor(_subject, _property, iterable) {
+        super(iterable);
+        this._subject = _subject;
+        this._property = _property;
+    }
+    get subject() {
+        return this._subject;
+    }
+    get property() {
+        return this._property;
+    }
+    /**
+     * Listen to any changes in the valueset for this subject + property combination
+     * If you provide context (usually 'this'), removing the onChange listener will remove all listeners for this property & context, regardless of what callback you provide. (this is helpful if you dont have access to the excact same callback function)
+     * @param callback
+     * @param context
+     */
+    onChange(callback, context) {
+        this._subject.onChange(this._property, callback, context);
+    }
+    /**
+     * Remove listener for changes in the valueset for this subject + property combination
+     * If you provide context (usually 'this'), removing the onChange listener will remove all listeners for this property & context, regardless of what callback you provide. (this is helpful if you dont have access to the excact same callback function)
+     * @param callback
+     * @param context
+     */
+    removeOnChange(callback, context) {
+        this._subject.removeOnChange(this._property, callback, context);
+    }
+    /**
+     * When cloned we switch to a NodeSet of all the values
+     * And detach from the magic of PropertyValueSets, which are only meant to be used internally in the NamedNode model
+     * @param args
+     */
+    createNew(...args) {
+        return new NodeSet_js_1.NodeSet(...args);
+    }
+    /**
+     * Add a new node to this set of values.
+     * This creates a new quad in the local graph.
+     * This is equivalent to manually adding a new property value using `subject.set(predicate,object)`
+     * @param value the node to add
+     */
+    add(value) {
+        this._subject.set(this._property, value);
+        return this;
+    }
+    /**
+     * Remove a node from this set of values.
+     * This removes a quad in the local graph (if the node was an existing value)
+     * This is equivalent to manually removing a property value using `subject.unset(predicate,object)`
+     * @param value the node to remove
+     */
+    delete(value) {
+        return this._subject.unset(this._property, value);
+    }
+    /**
+     * Actually removes a node from this value set. Does not remove any quads in the local graph
+     * DO NOT use this method.
+     * Use subject.getAll(predicate).remove(object) or subject.unset(predicate,object) instead
+     * @internal
+     * @param v
+     */
+    __delete(v) {
+        return super.delete(v);
+    }
+    /**
+     * Adds a value directly to this value set. Does not create new quads in the local graph
+     * DO NOT USE this method.
+     * Use subject.getAll(predicate).add(object) or subject.set(predicate,object) instead.
+     * @internal
+     * @param v
+     */
+    __add(v) {
+        return super.add(v);
+    }
+    //here we overload the type definitions to indicate its a NodeSet that will be returned
+    //HOWEVER, without '|any' this will not be expected by Typescript unless we find a really intricate way of rewriting all methods of CoreSet / CoreIterable that return this into methods that return ...?
+    sort(compareFn, thisArg) {
+        return super.sort(compareFn, thisArg);
+    }
+    concat(...sets) {
+        return super.concat(...sets);
+    }
+    filter(fn) {
+        return super.filter(fn);
+    }
+}
+exports.NodeValuesSet = NodeValuesSet;
+//# sourceMappingURL=NodeValuesSet.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"NodeValuesSet.js","sourceRoot":"","sources":["../../../src/collections/NodeValuesSet.ts"],"names":[],"mappings":";;;AAAA;;;;GAIG;AACH,6CAAqC;AAIrC,MAAa,aAAc,SAAQ,oBAAO;IACxC,YACU,QAAc,EACd,SAAoB,EAC5B,QAAyB;QAEzB,KAAK,CAAC,QAAQ,CAAC,CAAC;QAJR,aAAQ,GAAR,QAAQ,CAAM;QACd,cAAS,GAAT,SAAS,CAAW;IAI9B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CACN,QAAyD,EACzD,OAAQ;QAEP,IAAI,CAAC,QAAsB,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC3E,CAAC;IAED;;;;;OAKG;IACH,cAAc,CACZ,QAAyD,EACzD,OAAQ;QAEP,IAAI,CAAC,QAAsB,CAAC,cAAc,CACzC,IAAI,CAAC,SAAS,EACd,QAAQ,EACR,OAAO,CACR,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAG,IAAI;QACf,OAAO,IAAI,oBAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAW;QACb,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,CAAC;QACR,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,CAAC;QACL,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,uFAAuF;IACvF,yMAAyM;IACzM,IAAI,CAAC,SAAU,EAAE,OAAQ;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAY,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,GAAG,IAAI;QACZ,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAY,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,EAAE;QACP,OAAO,KAAK,CAAC,MAAM,CAAC,EAAE,CAAkB,CAAC;IAC3C,CAAC;CACF;AAhHD,sCAgHC"}

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

@@ -0,0 +1,17 @@
+import { Graph, NamedNode, Quad } from '../models.js';
+import { NodeSet } from './NodeSet.js';
+export declare class QuadArray extends Array<Quad> {
+    removeAll(alteration?: boolean): void;
+    moveTo(graph: Graph, alteration?: boolean): QuadArray;
+    makeExplicit(): void;
+    getSubjects(): NodeSet<NamedNode>;
+    getPredicates(): NodeSet<NamedNode>;
+    getObjects(): NodeSet;
+    map<S>(callbackfn: (value: Quad, index: number, array: Quad[]) => S): S[];
+    getExplicit(): Quad[];
+    getImplicit(): Quad[];
+    turnOn(): void;
+    turnOff(): void;
+    toString(): string;
+    print(): void;
+}

package/lib/cjs/collections/QuadArray.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QuadArray = void 0;
+const NodeSet_js_1 = require("./NodeSet.js");
+//TODO: test performance of QuadArray vs QuadSet and probably remove QuadArray
+class QuadArray extends Array {
+    removeAll(alteration = false) {
+        this.forEach((quad) => quad.remove(alteration));
+    }
+    moveTo(graph, alteration = true) {
+        let result = new QuadArray();
+        this.forEach((quad) => {
+            result.push(quad.moveToGraph(graph, alteration));
+        });
+        return result;
+    }
+    makeExplicit() {
+        this.forEach((quad) => quad.makeExplicit());
+    }
+    getSubjects() {
+        //return new NamedNodeSet(this.map(quad => quad.subject).values());
+        //that's short, but probably this is faster:
+        var res = new NodeSet_js_1.NodeSet();
+        for (var quad of this) {
+            res.add(quad.subject);
+        }
+        return res;
+    }
+    getPredicates() {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var quad of this) {
+            res.add(quad.predicate);
+        }
+        return res;
+    }
+    getObjects() {
+        var res = new NodeSet_js_1.NodeSet();
+        for (var quad of this) {
+            res.add(quad.object);
+        }
+        return res;
+    }
+    map(callbackfn) {
+        return super.map(callbackfn);
+    }
+    getExplicit() {
+        return this.filter((quad) => !quad.implicit);
+    }
+    getImplicit() {
+        return this.filter((quad) => quad.implicit);
+    }
+    turnOn() {
+        this.forEach((quad) => quad.turnOn());
+    }
+    turnOff() {
+        this.forEach((quad) => quad.turnOff());
+    }
+    toString() {
+        //without this the toString() would print 3 URI's for each quad followed by a ',' which looks messy and unclear
+        return this.join('\n');
+    }
+    print() {
+        console.log(this.toString());
+    }
+}
+exports.QuadArray = QuadArray;
+//# sourceMappingURL=QuadArray.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"QuadArray.js","sourceRoot":"","sources":["../../../src/collections/QuadArray.ts"],"names":[],"mappings":";;;AAMA,6CAAqC;AAErC,8EAA8E;AAC9E,MAAa,SAAU,SAAQ,KAAW;IACxC,SAAS,CAAC,aAAsB,KAAK;QACnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,CAAC,KAAY,EAAE,aAAsB,IAAI;QAC7C,IAAI,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,YAAY;QACV,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,WAAW;QACT,mEAAmE;QACnE,4CAA4C;QAC5C,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAa,CAAC;QACnC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,aAAa;QACX,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAa,CAAC;QACnC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,UAAU;QACR,IAAI,GAAG,GAAG,IAAI,oBAAO,EAAE,CAAC;QACxB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,GAAG,CAAI,UAA4D;QACjE,OAAO,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC/B,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM;QACJ,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACL,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,QAAQ;QACN,+GAA+G;QAC/G,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC;CACF;AAvED,8BAuEC"}

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

@@ -0,0 +1,64 @@
+import { NamedNode, Node, Quad } from '../models.js';
+import { NodeSet } from './NodeSet.js';
+import { QuadSet } from './QuadSet.js';
+import { CoreSet } from '@_linked/core/collections/CoreSet';
+import { ICoreIterable } from '@_linked/core/interfaces/ICoreIterable';
+/**
+ * A map who's values are sets
+ * When you iterate over this map with methods like map and forEach you'll iterate over the values of the sets
+ */
+declare class CoreMapToSet<K, S extends CoreSet<V>, V> extends Map<K, S> implements ICoreIterable<V> {
+    /**
+     * Determines whether all the members of an array satisfy the specified test.
+     * @param callbackfn A function that accepts up to three arguments. The every method calls the callbackfn function for each element in array1 until the callbackfn returns false, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    every(callbackfn: (value: V, key: K, map: CoreMapToSet<K, S, V>) => boolean, thisArg?: any): boolean;
+    /**
+     * This object is a Map whos values are sets.
+     * This forEach method calls the callback-function for each items in each of those sets.
+     * The first parameter has the type of the items in the sets
+     * The second parameter is the key
+     * The type information can unfortunately not be defined as they would conflict with the usual forEach method
+     * @param callbackfn
+     * @param thisArg
+     */
+    forEach(callbackfn: (value: any, key: any, map: any) => void, thisArg?: any): void;
+    /**
+     * Determines whether the specified callback function returns true for any element of an array.
+     * @param callbackfn A function that accepts up to three arguments. The some method calls the callbackfn function for each element in array1 until the callbackfn returns true, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    some(callbackfn: (value: V, key: K, set: S, map: this) => boolean, thisArg?: any): boolean;
+    /**
+     * Maps all values contained in this map of set into a new single set
+     * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    map<R extends CoreSet<any>>(callbackfn: (value: V, key: K, set: S, map: this) => any, resultType?: typeof CoreSet, thisArg?: any): R;
+    /**
+     * Returns the end values in the map that meet the condition specified in a callback function.
+     * The result will be a single set of values
+     * @param callbackfn A function that accepts up to three arguments. The filter method calls the callbackfn function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    filter<R extends CoreSet<any>>(callbackfn: (value: V, key: K, set: S, map: this) => any, resultType?: typeof CoreSet, thisArg?: any): R;
+    first(): V | null;
+    /**
+     * Returns the value of the first element in the Set where predicate is true, and undefined
+     * otherwise.
+     */
+    find(predicate: (value: V, index: K, set: S) => boolean, thisArg?: any): V | undefined;
+    toString(): string;
+}
+export declare class QuadMap extends CoreMapToSet<Node, QuadSet, Quad> {
+    removeAll(alteration?: boolean): void;
+    getSubjects(): NodeSet<NamedNode>;
+    getPredicates(): NodeSet<NamedNode>;
+    getObjects(): NodeSet;
+    getQuadSet(): QuadSet;
+    delete(v: any): boolean;
+    __delete(v: any): boolean;
+    __set(k: Node, v: Quad): void;
+}
+export {};

package/lib/cjs/collections/QuadMap.js

@@ -0,0 +1,155 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QuadMap = void 0;
+const NodeSet_js_1 = require("./NodeSet.js");
+const QuadSet_js_1 = require("./QuadSet.js");
+const CoreSet_1 = require("@_linked/core/collections/CoreSet");
+/**
+ * A map who's values are sets
+ * When you iterate over this map with methods like map and forEach you'll iterate over the values of the sets
+ */
+class CoreMapToSet extends Map {
+    /**
+     * Determines whether all the members of an array satisfy the specified test.
+     * @param callbackfn A function that accepts up to three arguments. The every method calls the callbackfn function for each element in array1 until the callbackfn returns false, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    every(callbackfn, thisArg) {
+        for (let [key, set] of this) {
+            for (let value of set) {
+                if (!callbackfn.apply(thisArg, [value, key, this])) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+    /**
+     * This object is a Map whos values are sets.
+     * This forEach method calls the callback-function for each items in each of those sets.
+     * The first parameter has the type of the items in the sets
+     * The second parameter is the key
+     * The type information can unfortunately not be defined as they would conflict with the usual forEach method
+     * @param callbackfn
+     * @param thisArg
+     */
+    forEach(callbackfn, thisArg) {
+        for (let [key, set] of this) {
+            for (let value of set) {
+                callbackfn.apply(thisArg, [value, key, this]);
+            }
+        }
+    }
+    /**
+     * Determines whether the specified callback function returns true for any element of an array.
+     * @param callbackfn A function that accepts up to three arguments. The some method calls the callbackfn function for each element in array1 until the callbackfn returns true, or until the end of the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    some(callbackfn, thisArg) {
+        for (let [key, set] of this) {
+            for (let value of set) {
+                if (callbackfn.apply(thisArg, [value, key, set, this])) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Maps all values contained in this map of set into a new single set
+     * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    map(callbackfn, resultType = CoreSet_1.CoreSet, thisArg) {
+        //create the result map, whos values will be 'mapped' into new values from the current values of this map
+        //whilst maintaining set organisation
+        var resultSet = new resultType();
+        for (let [key, set] of this) {
+            for (let value of set) {
+                //get the right set and add the mapped value to it
+                resultSet.add(callbackfn.apply(thisArg, [value, key, set, this]));
+            }
+        }
+        return resultSet;
+    }
+    /**
+     * Returns the end values in the map that meet the condition specified in a callback function.
+     * The result will be a single set of values
+     * @param callbackfn A function that accepts up to three arguments. The filter method calls the callbackfn function one time for each element in the array.
+     * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
+     */
+    filter(callbackfn, resultType = CoreSet_1.CoreSet, thisArg) {
+        //create the result map, whos values will be 'mapped' into new values from the current values of this map
+        //whilst maintaining set organisation
+        var resultSet = new resultType();
+        for (let [key, set] of this) {
+            //use the type of the first set to determine the result type
+            for (let value of set) {
+                //if the filter function returns true-ish
+                if (callbackfn.apply(thisArg, [value, key, set, this])) {
+                    //add to result set
+                    resultSet.add(value);
+                }
+            }
+        }
+        return resultSet;
+    }
+    first() {
+        return this.values().next().value.first();
+    }
+    /**
+     * Returns the value of the first element in the Set where predicate is true, and undefined
+     * otherwise.
+     */
+    find(predicate, thisArg) {
+        for (let [key, set] of this) {
+            for (let value of set) {
+                if (predicate.apply(thisArg, [value, key, this])) {
+                    return value;
+                }
+            }
+        }
+        return undefined;
+    }
+    toString() {
+        let res = 'MapToSets:\n';
+        for (let [key, set] of this) {
+            res += '\t[' + key.toString() + '] => ' + set.toString() + '\n';
+        }
+        return res;
+    }
+}
+class QuadMap extends CoreMapToSet {
+    removeAll(alteration = false) {
+        this.forEach((quad) => quad.remove(alteration));
+    }
+    getSubjects() {
+        return this.map((quad) => quad.subject, NodeSet_js_1.NodeSet);
+    }
+    getPredicates() {
+        return this.map((quad) => quad.predicate, NodeSet_js_1.NodeSet);
+    }
+    getObjects() {
+        return this.map((quad) => quad.predicate, NodeSet_js_1.NodeSet);
+    }
+    getQuadSet() {
+        return this.map((q) => q, QuadSet_js_1.QuadSet);
+    }
+    delete(v) {
+        throw new Error('Do not delete values directly from a QuadMap. Either create a new set of all values with getQuadSet() or use methods like map() and filter() which also return a new set.');
+        return false;
+    }
+    __delete(v) {
+        return super.delete(v);
+    }
+    __set(k, v) {
+        //make sure we have a QuadSet ready for that key
+        if (!this.has(k)) {
+            this.set(k, new QuadSet_js_1.QuadSet());
+        }
+        //then add this quad to that set
+        this.get(k).add(v);
+    }
+}
+exports.QuadMap = QuadMap;
+//# sourceMappingURL=QuadMap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"QuadMap.js","sourceRoot":"","sources":["../../../src/collections/QuadMap.ts"],"names":[],"mappings":";;;AAMA,6CAAqC;AACrC,6CAAqC;AACrC,+DAA0D;AAG1D;;;GAGG;AACH,MAAM,YACJ,SAAQ,GAAS;IAGjB;;;;OAIG;IACH,KAAK,CACH,UAAqE,EACrE,OAAa;QAEb,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBACnD,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CACL,UAAoD,EACpD,OAAa;QAEb,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,IAAI,CACF,UAA4D,EAC5D,OAAa;QAEb,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,GAAG,CACD,UAAwD,EACxD,aAA6B,iBAAO,EACpC,OAAa;QAEb,yGAAyG;QACzG,qCAAqC;QACrC,IAAI,SAAS,GAAiB,IAAI,UAAU,EAAE,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,kDAAkD;gBAClD,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QACD,OAAO,SAAc,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CACJ,UAAwD,EACxD,aAA6B,iBAAO,EACpC,OAAa;QAEb,yGAAyG;QACzG,qCAAqC;QACrC,IAAI,SAAS,GAAiB,IAAI,UAAU,EAAE,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,4DAA4D;YAC5D,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,yCAAyC;gBACzC,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBACvD,mBAAmB;oBACnB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAc,CAAC;IACxB,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACH,IAAI,CACF,SAAkD,EAClD,OAAa;QAEb,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACtB,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBACjD,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,QAAQ;QACN,IAAI,GAAG,GAAG,cAAc,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,GAAG,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,GAAG,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC;QAClE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED,MAAa,OAAQ,SAAQ,YAAiC;IAC5D,SAAS,CAAC,aAAsB,KAAK;QACnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,oBAAO,CAAuB,CAAC;IACzE,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAO,CAAuB,CAAC;IAC3E,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAO,CAAC,CAAC;IACrD,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,oBAAO,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,CAAC;QACN,MAAM,IAAI,KAAK,CACb,2KAA2K,CAC5K,CAAC;QACF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ,CAAC,CAAC;QACR,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,CAAO,EAAE,CAAO;QACpB,gDAAgD;QAChD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,oBAAO,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,gCAAgC;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;CACF;AAxCD,0BAwCC"}

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

@@ -0,0 +1,22 @@
+import { Graph, NamedNode, Node, Quad } from '../models.js';
+import { CoreSet } from '@_linked/core/collections/CoreSet';
+import { NodeSet } from './NodeSet.js';
+export declare class QuadSet extends CoreSet<Quad> {
+    removeAll(alteration?: boolean): void;
+    moveTo(graph: Graph, alteration?: boolean): QuadSet;
+    makeExplicit(): void;
+    getSubjects(): NodeSet<NamedNode>;
+    getPredicates(): NodeSet<NamedNode>;
+    getObjects(): NodeSet;
+    getNamedNodeObjects(): NodeSet<NamedNode>;
+    getLiteralObjects(): NodeSet;
+    getLike(subject?: NamedNode, predicate?: NamedNode, object?: Node): this;
+    getNamedNodes(): NodeSet<NamedNode>;
+    getNodes(): NodeSet;
+    hasNode(node: Node): boolean;
+    getExplicit(): this;
+    getImplicit(): this;
+    turnOn(): void;
+    turnOff(): void;
+    toString(): string;
+}