@ldo/jsonld-dataset-proxy 1.0.0-alpha.43 → 1.0.0-alpha.45
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/ProxyContext.mjs.map +1 -1
- package/dist/language/languageSet.cjs +4 -5
- package/dist/language/languageSet.mjs +4 -5
- package/dist/language/languageSet.mjs.map +1 -1
- package/dist/setProxy/SetProxy.cjs +5 -2
- package/dist/setProxy/SetProxy.mjs +5 -2
- package/dist/setProxy/SetProxy.mjs.map +1 -1
- package/dist/setProxy/ldSet/BasicLdSet.cjs +5 -2
- package/dist/setProxy/ldSet/BasicLdSet.mjs +5 -2
- package/dist/setProxy/ldSet/BasicLdSet.mjs.map +1 -1
- package/dist/util/NodeSet.mjs.map +1 -1
- package/package.json +5 -5
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"ProxyContext.mjs","names":[],"sources":["../src/ProxyContext.ts"],"sourcesContent":["import type { GraphNode, QuadMatch, SubjectNode } from \"@ldo/rdf-utils\";\nimport type { BlankNode, Dataset, NamedNode } from \"@rdfjs/types\";\nimport { createSubjectHandler } from \"./subjectProxy/createSubjectHandler\";\nimport type { SubjectProxy } from \"./subjectProxy/SubjectProxy\";\nimport type { SetProxy } from \"./setProxy/SetProxy\";\nimport type { ContextUtil } from \"./ContextUtil\";\nimport type { LanguageOrdering } from \"./language/languageTypes\";\nimport { namedNode } from \"@ldo/rdf-utils\";\nimport type { RawValue } from \"./util/RawObject\";\nimport { createNewSetProxy } from \"./setProxy/createNewSetProxy\";\n\nexport interface ProxyContextOptions {\n dataset: Dataset;\n contextUtil: ContextUtil;\n writeGraphs: GraphNode[];\n languageOrdering: LanguageOrdering;\n state?: Record<string, unknown>;\n}\n\nconst rdfType = namedNode(\"http://www.w3.org/1999/02/22-rdf-syntax-ns#type\");\n\n/**\n * This file keeps track of the target objects used in the proxies.\n * The reason is so that JSON.stringify does not recurse inifinitely\n * when it encounters a circular object.\n */\nexport class ProxyContext {\n private subjectMap: Map<string, SubjectProxy> = new Map();\n private setMap: Map<string, SetProxy<NonNullable<RawValue>>> = new Map();\n\n readonly dataset: Dataset;\n readonly contextUtil: ContextUtil;\n readonly writeGraphs: GraphNode[];\n readonly languageOrdering: LanguageOrdering;\n public state: Record<string, unknown>;\n\n constructor(options: ProxyContextOptions) {\n this.dataset = options.dataset;\n this.contextUtil = options.contextUtil;\n this.writeGraphs = options.writeGraphs;\n this.languageOrdering = options.languageOrdering;\n this.state = options.state || {};\n }\n\n public createSubjectProxy(node: NamedNode | BlankNode): SubjectProxy {\n if (!this.subjectMap.has(node.value)) {\n const proxy = this.createNewSubjectProxy(node);\n this.subjectMap.set(node.value, proxy);\n }\n return this.subjectMap.get(node.value) as SubjectProxy;\n }\n\n protected createNewSubjectProxy(node: NamedNode | BlankNode): SubjectProxy {\n return new Proxy(\n { \"@id\": node },\n createSubjectHandler(this),\n ) as unknown as SubjectProxy;\n }\n\n private getSetKey(...quadMatch: QuadMatch) {\n return `${quadMatch[0]?.value || \"undefined\"}|${\n quadMatch[1]?.value || \"undefined\"\n }|${quadMatch[2]?.value || \"undefined\"}|${\n quadMatch[3]?.value || \"undefined\"\n }`;\n }\n\n public createSetProxy(\n quadMatch: QuadMatch,\n isSubjectOriented?: boolean,\n isLangStringSet?: boolean,\n ): SetProxy {\n const key = this.getSetKey(...quadMatch);\n if (!this.setMap.has(key)) {\n const proxy = this.createNewSetProxy(\n quadMatch,\n isSubjectOriented,\n isLangStringSet,\n );\n this.setMap.set(key, proxy);\n }\n return this.setMap.get(key)!;\n }\n\n protected createNewSetProxy(\n quadMatch: QuadMatch,\n isSubjectOriented?: boolean,\n isLangStringSet?: boolean,\n ) {\n return createNewSetProxy(\n quadMatch,\n isSubjectOriented ?? false,\n this,\n isLangStringSet,\n );\n }\n\n public duplicate(alternativeOptions: Partial<ProxyContextOptions>) {\n const fullOptions: ProxyContextOptions = {\n ...{\n dataset: this.dataset,\n contextUtil: this.contextUtil,\n writeGraphs: this.writeGraphs,\n languageOrdering: this.languageOrdering,\n },\n ...alternativeOptions,\n };\n return new ProxyContext(fullOptions);\n }\n\n public getRdfType(subjectNode: SubjectNode): NamedNode[] {\n return this.dataset\n .match(subjectNode, rdfType)\n .toArray()\n .map((quad) => quad.object)\n .filter((object): object is NamedNode => object.termType === \"NamedNode\");\n }\n}\n"],"mappings":";;;;AAmBA,MAAM,UAAU,UAAU,kDAAkD;;;;;;AAO5E,IAAa,eAAb,MAAa,aAAa;CAUxB,YAAY,SAA8B;
|
|
1
|
+
{"version":3,"file":"ProxyContext.mjs","names":[],"sources":["../src/ProxyContext.ts"],"sourcesContent":["import type { GraphNode, QuadMatch, SubjectNode } from \"@ldo/rdf-utils\";\nimport type { BlankNode, Dataset, NamedNode } from \"@rdfjs/types\";\nimport { createSubjectHandler } from \"./subjectProxy/createSubjectHandler\";\nimport type { SubjectProxy } from \"./subjectProxy/SubjectProxy\";\nimport type { SetProxy } from \"./setProxy/SetProxy\";\nimport type { ContextUtil } from \"./ContextUtil\";\nimport type { LanguageOrdering } from \"./language/languageTypes\";\nimport { namedNode } from \"@ldo/rdf-utils\";\nimport type { RawValue } from \"./util/RawObject\";\nimport { createNewSetProxy } from \"./setProxy/createNewSetProxy\";\n\nexport interface ProxyContextOptions {\n dataset: Dataset;\n contextUtil: ContextUtil;\n writeGraphs: GraphNode[];\n languageOrdering: LanguageOrdering;\n state?: Record<string, unknown>;\n}\n\nconst rdfType = namedNode(\"http://www.w3.org/1999/02/22-rdf-syntax-ns#type\");\n\n/**\n * This file keeps track of the target objects used in the proxies.\n * The reason is so that JSON.stringify does not recurse inifinitely\n * when it encounters a circular object.\n */\nexport class ProxyContext {\n private subjectMap: Map<string, SubjectProxy> = new Map();\n private setMap: Map<string, SetProxy<NonNullable<RawValue>>> = new Map();\n\n readonly dataset: Dataset;\n readonly contextUtil: ContextUtil;\n readonly writeGraphs: GraphNode[];\n readonly languageOrdering: LanguageOrdering;\n public state: Record<string, unknown>;\n\n constructor(options: ProxyContextOptions) {\n this.dataset = options.dataset;\n this.contextUtil = options.contextUtil;\n this.writeGraphs = options.writeGraphs;\n this.languageOrdering = options.languageOrdering;\n this.state = options.state || {};\n }\n\n public createSubjectProxy(node: NamedNode | BlankNode): SubjectProxy {\n if (!this.subjectMap.has(node.value)) {\n const proxy = this.createNewSubjectProxy(node);\n this.subjectMap.set(node.value, proxy);\n }\n return this.subjectMap.get(node.value) as SubjectProxy;\n }\n\n protected createNewSubjectProxy(node: NamedNode | BlankNode): SubjectProxy {\n return new Proxy(\n { \"@id\": node },\n createSubjectHandler(this),\n ) as unknown as SubjectProxy;\n }\n\n private getSetKey(...quadMatch: QuadMatch) {\n return `${quadMatch[0]?.value || \"undefined\"}|${\n quadMatch[1]?.value || \"undefined\"\n }|${quadMatch[2]?.value || \"undefined\"}|${\n quadMatch[3]?.value || \"undefined\"\n }`;\n }\n\n public createSetProxy(\n quadMatch: QuadMatch,\n isSubjectOriented?: boolean,\n isLangStringSet?: boolean,\n ): SetProxy {\n const key = this.getSetKey(...quadMatch);\n if (!this.setMap.has(key)) {\n const proxy = this.createNewSetProxy(\n quadMatch,\n isSubjectOriented,\n isLangStringSet,\n );\n this.setMap.set(key, proxy);\n }\n return this.setMap.get(key)!;\n }\n\n protected createNewSetProxy(\n quadMatch: QuadMatch,\n isSubjectOriented?: boolean,\n isLangStringSet?: boolean,\n ) {\n return createNewSetProxy(\n quadMatch,\n isSubjectOriented ?? false,\n this,\n isLangStringSet,\n );\n }\n\n public duplicate(alternativeOptions: Partial<ProxyContextOptions>) {\n const fullOptions: ProxyContextOptions = {\n ...{\n dataset: this.dataset,\n contextUtil: this.contextUtil,\n writeGraphs: this.writeGraphs,\n languageOrdering: this.languageOrdering,\n },\n ...alternativeOptions,\n };\n return new ProxyContext(fullOptions);\n }\n\n public getRdfType(subjectNode: SubjectNode): NamedNode[] {\n return this.dataset\n .match(subjectNode, rdfType)\n .toArray()\n .map((quad) => quad.object)\n .filter((object): object is NamedNode => object.termType === \"NamedNode\");\n }\n}\n"],"mappings":";;;;AAmBA,MAAM,UAAU,UAAU,kDAAkD;;;;;;AAO5E,IAAa,eAAb,MAAa,aAAa;CAUxB,YAAY,SAA8B;AAT1C,OAAQ,6BAAwC,IAAI,KAAK;AACzD,OAAQ,yBAAuD,IAAI,KAAK;AAStE,OAAK,UAAU,QAAQ;AACvB,OAAK,cAAc,QAAQ;AAC3B,OAAK,cAAc,QAAQ;AAC3B,OAAK,mBAAmB,QAAQ;AAChC,OAAK,QAAQ,QAAQ,SAAS,EAAE;;CAGlC,mBAA0B,MAA2C;AACnE,MAAI,CAAC,KAAK,WAAW,IAAI,KAAK,MAAM,EAAE;GACpC,MAAM,QAAQ,KAAK,sBAAsB,KAAK;AAC9C,QAAK,WAAW,IAAI,KAAK,OAAO,MAAM;;AAExC,SAAO,KAAK,WAAW,IAAI,KAAK,MAAM;;CAGxC,sBAAgC,MAA2C;AACzE,SAAO,IAAI,MACT,EAAE,OAAO,MAAM,EACf,qBAAqB,KAAK,CAC3B;;CAGH,UAAkB,GAAG,WAAsB;AACzC,SAAO,GAAG,UAAU,IAAI,SAAS,YAAY,GAC3C,UAAU,IAAI,SAAS,YACxB,GAAG,UAAU,IAAI,SAAS,YAAY,GACrC,UAAU,IAAI,SAAS;;CAI3B,eACE,WACA,mBACA,iBACU;EACV,MAAM,MAAM,KAAK,UAAU,GAAG,UAAU;AACxC,MAAI,CAAC,KAAK,OAAO,IAAI,IAAI,EAAE;GACzB,MAAM,QAAQ,KAAK,kBACjB,WACA,mBACA,gBACD;AACD,QAAK,OAAO,IAAI,KAAK,MAAM;;AAE7B,SAAO,KAAK,OAAO,IAAI,IAAI;;CAG7B,kBACE,WACA,mBACA,iBACA;AACA,SAAO,kBACL,WACA,qBAAqB,OACrB,MACA,gBACD;;CAGH,UAAiB,oBAAkD;AAUjE,SAAO,IAAI,aAT8B;GAErC,SAAS,KAAK;GACd,aAAa,KAAK;GAClB,aAAa,KAAK;GAClB,kBAAkB,KAAK;GAEzB,GAAG;GACJ,CACmC;;CAGtC,WAAkB,aAAuC;AACvD,SAAO,KAAK,QACT,MAAM,aAAa,QAAQ,CAC3B,SAAS,CACT,KAAK,SAAS,KAAK,OAAO,CAC1B,QAAQ,WAAgC,OAAO,aAAa,YAAY"}
|
|
@@ -1,11 +1,10 @@
|
|
|
1
1
|
const require_languageUtils = require("./languageUtils.cjs");
|
|
2
2
|
let _ldo_rdf_utils = require("@ldo/rdf-utils");
|
|
3
3
|
//#region src/language/languageSet.ts
|
|
4
|
-
let _Symbol$toStringTag;
|
|
4
|
+
let _Symbol$toStringTag, _Symbol$iterator;
|
|
5
|
+
_Symbol$iterator = Symbol.iterator;
|
|
6
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
5
7
|
var LanguageSet = class {
|
|
6
|
-
static {
|
|
7
|
-
_Symbol$toStringTag = Symbol.toStringTag;
|
|
8
|
-
}
|
|
9
8
|
constructor(subject, predicate, languageKey, proxyContext) {
|
|
10
9
|
this[_Symbol$toStringTag] = "LanguageSet";
|
|
11
10
|
this.subject = subject;
|
|
@@ -56,7 +55,7 @@ var LanguageSet = class {
|
|
|
56
55
|
const quads = this.matchThis();
|
|
57
56
|
for (const curQuad of quads) yield curQuad.object.value;
|
|
58
57
|
}
|
|
59
|
-
*[
|
|
58
|
+
*[_Symbol$iterator]() {
|
|
60
59
|
const quads = this.matchThis();
|
|
61
60
|
for (const curQuad of quads) yield curQuad.object.value;
|
|
62
61
|
}
|
|
@@ -1,11 +1,10 @@
|
|
|
1
1
|
import { languageDeleteMatch, languageMatch } from "./languageUtils.mjs";
|
|
2
2
|
import { literal, quad } from "@ldo/rdf-utils";
|
|
3
3
|
//#region src/language/languageSet.ts
|
|
4
|
-
let _Symbol$toStringTag;
|
|
4
|
+
let _Symbol$toStringTag, _Symbol$iterator;
|
|
5
|
+
_Symbol$iterator = Symbol.iterator;
|
|
6
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
5
7
|
var LanguageSet = class {
|
|
6
|
-
static {
|
|
7
|
-
_Symbol$toStringTag = Symbol.toStringTag;
|
|
8
|
-
}
|
|
9
8
|
constructor(subject, predicate, languageKey, proxyContext) {
|
|
10
9
|
this[_Symbol$toStringTag] = "LanguageSet";
|
|
11
10
|
this.subject = subject;
|
|
@@ -56,7 +55,7 @@ var LanguageSet = class {
|
|
|
56
55
|
const quads = this.matchThis();
|
|
57
56
|
for (const curQuad of quads) yield curQuad.object.value;
|
|
58
57
|
}
|
|
59
|
-
*[
|
|
58
|
+
*[_Symbol$iterator]() {
|
|
60
59
|
const quads = this.matchThis();
|
|
61
60
|
for (const curQuad of quads) yield curQuad.object.value;
|
|
62
61
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"languageSet.mjs","names":[],"sources":["../../src/language/languageSet.ts"],"sourcesContent":["import { literal, quad } from \"@ldo/rdf-utils\";\nimport type { PredicateNode, SubjectNode } from \"@ldo/rdf-utils\";\nimport type { Dataset, Literal } from \"@rdfjs/types\";\nimport type { LanguageKey } from \"./languageTypes\";\nimport type { LiteralObjectQuad } from \"./languageUtils\";\nimport { languageDeleteMatch, languageMatch } from \"./languageUtils\";\nimport type { ProxyContext } from \"../ProxyContext\";\n\nexport default class LanguageSet implements Set<string> {\n private subject: SubjectNode;\n private predicate: PredicateNode;\n private languageKey: LanguageKey;\n private proxyContext: ProxyContext;\n\n constructor(\n subject: SubjectNode,\n predicate: PredicateNode,\n languageKey: LanguageKey,\n proxyContext: ProxyContext,\n ) {\n this.subject = subject;\n this.predicate = predicate;\n this.languageKey = languageKey;\n this.proxyContext = proxyContext;\n }\n\n private matchThis(): Dataset<LiteralObjectQuad> {\n return languageMatch(\n this.proxyContext.dataset,\n this.subject,\n this.predicate,\n this.languageKey,\n );\n }\n\n private getLiteral(value: string): Literal {\n return this.languageKey === \"@none\"\n ? literal(value)\n : literal(value, this.languageKey);\n }\n\n public get size(): number {\n return this.matchThis().size;\n }\n\n add(value: string): this {\n this.proxyContext.writeGraphs.forEach((graph) => {\n this.proxyContext.dataset.add(\n quad(\n this.subject,\n this.predicate,\n literal(value, this.languageKey),\n graph,\n ),\n );\n });\n return this;\n }\n\n clear(): void {\n languageDeleteMatch(\n this.proxyContext.dataset,\n this.subject,\n this.predicate,\n this.languageKey,\n );\n }\n\n delete(value: string): boolean {\n const hadValue = this.has(value);\n this.proxyContext.dataset.deleteMatches(\n this.subject,\n this.predicate,\n this.getLiteral(value),\n );\n return hadValue;\n }\n\n forEach(\n callbackfn: (value: string, value2: string, set: Set<string>) => void,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n const quads = this.matchThis();\n quads.forEach((curQuad) => {\n callbackfn(curQuad.object.value, curQuad.object.value, thisArg || this);\n });\n }\n\n has(item: string): boolean {\n return (\n this.proxyContext.dataset.match(\n this.subject,\n this.predicate,\n this.getLiteral(item),\n ).size > 0\n );\n }\n\n *entries(): IterableIterator<[string, string]> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield [curQuad.object.value, curQuad.object.value];\n }\n }\n\n *keys(): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n *values(): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n *[Symbol.iterator](): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n [Symbol.toStringTag] = \"LanguageSet\";\n}\n"],"mappings":";;;;
|
|
1
|
+
{"version":3,"file":"languageSet.mjs","names":[],"sources":["../../src/language/languageSet.ts"],"sourcesContent":["import { literal, quad } from \"@ldo/rdf-utils\";\nimport type { PredicateNode, SubjectNode } from \"@ldo/rdf-utils\";\nimport type { Dataset, Literal } from \"@rdfjs/types\";\nimport type { LanguageKey } from \"./languageTypes\";\nimport type { LiteralObjectQuad } from \"./languageUtils\";\nimport { languageDeleteMatch, languageMatch } from \"./languageUtils\";\nimport type { ProxyContext } from \"../ProxyContext\";\n\nexport default class LanguageSet implements Set<string> {\n private subject: SubjectNode;\n private predicate: PredicateNode;\n private languageKey: LanguageKey;\n private proxyContext: ProxyContext;\n\n constructor(\n subject: SubjectNode,\n predicate: PredicateNode,\n languageKey: LanguageKey,\n proxyContext: ProxyContext,\n ) {\n this.subject = subject;\n this.predicate = predicate;\n this.languageKey = languageKey;\n this.proxyContext = proxyContext;\n }\n\n private matchThis(): Dataset<LiteralObjectQuad> {\n return languageMatch(\n this.proxyContext.dataset,\n this.subject,\n this.predicate,\n this.languageKey,\n );\n }\n\n private getLiteral(value: string): Literal {\n return this.languageKey === \"@none\"\n ? literal(value)\n : literal(value, this.languageKey);\n }\n\n public get size(): number {\n return this.matchThis().size;\n }\n\n add(value: string): this {\n this.proxyContext.writeGraphs.forEach((graph) => {\n this.proxyContext.dataset.add(\n quad(\n this.subject,\n this.predicate,\n literal(value, this.languageKey),\n graph,\n ),\n );\n });\n return this;\n }\n\n clear(): void {\n languageDeleteMatch(\n this.proxyContext.dataset,\n this.subject,\n this.predicate,\n this.languageKey,\n );\n }\n\n delete(value: string): boolean {\n const hadValue = this.has(value);\n this.proxyContext.dataset.deleteMatches(\n this.subject,\n this.predicate,\n this.getLiteral(value),\n );\n return hadValue;\n }\n\n forEach(\n callbackfn: (value: string, value2: string, set: Set<string>) => void,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n const quads = this.matchThis();\n quads.forEach((curQuad) => {\n callbackfn(curQuad.object.value, curQuad.object.value, thisArg || this);\n });\n }\n\n has(item: string): boolean {\n return (\n this.proxyContext.dataset.match(\n this.subject,\n this.predicate,\n this.getLiteral(item),\n ).size > 0\n );\n }\n\n *entries(): IterableIterator<[string, string]> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield [curQuad.object.value, curQuad.object.value];\n }\n }\n\n *keys(): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n *values(): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n *[Symbol.iterator](): IterableIterator<string> {\n const quads = this.matchThis();\n for (const curQuad of quads) {\n yield curQuad.object.value;\n }\n }\n\n [Symbol.toStringTag] = \"LanguageSet\";\n}\n"],"mappings":";;;;mBAwHI,OAAO;sBAOR,OAAO;AAvHV,IAAqB,cAArB,MAAwD;CAMtD,YACE,SACA,WACA,aACA,cACA;AA4GF,OAAA,uBAAuB;AA3GrB,OAAK,UAAU;AACf,OAAK,YAAY;AACjB,OAAK,cAAc;AACnB,OAAK,eAAe;;CAGtB,YAAgD;AAC9C,SAAO,cACL,KAAK,aAAa,SAClB,KAAK,SACL,KAAK,WACL,KAAK,YACN;;CAGH,WAAmB,OAAwB;AACzC,SAAO,KAAK,gBAAgB,UACxB,QAAQ,MAAM,GACd,QAAQ,OAAO,KAAK,YAAY;;CAGtC,IAAW,OAAe;AACxB,SAAO,KAAK,WAAW,CAAC;;CAG1B,IAAI,OAAqB;AACvB,OAAK,aAAa,YAAY,SAAS,UAAU;AAC/C,QAAK,aAAa,QAAQ,IACxB,KACE,KAAK,SACL,KAAK,WACL,QAAQ,OAAO,KAAK,YAAY,EAChC,MACD,CACF;IACD;AACF,SAAO;;CAGT,QAAc;AACZ,sBACE,KAAK,aAAa,SAClB,KAAK,SACL,KAAK,WACL,KAAK,YACN;;CAGH,OAAO,OAAwB;EAC7B,MAAM,WAAW,KAAK,IAAI,MAAM;AAChC,OAAK,aAAa,QAAQ,cACxB,KAAK,SACL,KAAK,WACL,KAAK,WAAW,MAAM,CACvB;AACD,SAAO;;CAGT,QACE,YAEA,SACM;AACQ,OAAK,WAAW,CACxB,SAAS,YAAY;AACzB,cAAW,QAAQ,OAAO,OAAO,QAAQ,OAAO,OAAO,WAAW,KAAK;IACvE;;CAGJ,IAAI,MAAuB;AACzB,SACE,KAAK,aAAa,QAAQ,MACxB,KAAK,SACL,KAAK,WACL,KAAK,WAAW,KAAK,CACtB,CAAC,OAAO;;CAIb,CAAC,UAA8C;EAC7C,MAAM,QAAQ,KAAK,WAAW;AAC9B,OAAK,MAAM,WAAW,MACpB,OAAM,CAAC,QAAQ,OAAO,OAAO,QAAQ,OAAO,MAAM;;CAItD,CAAC,OAAiC;EAChC,MAAM,QAAQ,KAAK,WAAW;AAC9B,OAAK,MAAM,WAAW,MACpB,OAAM,QAAQ,OAAO;;CAIzB,CAAC,SAAmC;EAClC,MAAM,QAAQ,KAAK,WAAW;AAC9B,OAAK,MAAM,WAAW,MACpB,OAAM,QAAQ,OAAO;;CAIzB,EAAA,oBAA+C;EAC7C,MAAM,QAAQ,KAAK,WAAW;AAC9B,OAAK,MAAM,WAAW,MACpB,OAAM,QAAQ,OAAO"}
|
|
@@ -2,6 +2,9 @@ const require_types = require("../types.cjs");
|
|
|
2
2
|
const require_BasicLdSet = require("./ldSet/BasicLdSet.cjs");
|
|
3
3
|
const require_nodeToJsonldRepresentation = require("../util/nodeToJsonldRepresentation.cjs");
|
|
4
4
|
//#region src/setProxy/SetProxy.ts
|
|
5
|
+
let _Symbol$iterator, _Symbol$toStringTag;
|
|
6
|
+
_Symbol$iterator = Symbol.iterator;
|
|
7
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
5
8
|
/**
|
|
6
9
|
* A Set Proxy represents a set of items in a dataset and is a proxy for
|
|
7
10
|
* accessing those items in the dataset.
|
|
@@ -52,13 +55,13 @@ var SetProxy = class extends require_BasicLdSet.BasicLdSet {
|
|
|
52
55
|
values() {
|
|
53
56
|
return this[Symbol.iterator]();
|
|
54
57
|
}
|
|
55
|
-
[
|
|
58
|
+
[_Symbol$iterator]() {
|
|
56
59
|
const collection = this.getQuads().toArray().map((quad) => {
|
|
57
60
|
return require_nodeToJsonldRepresentation.nodeToJsonldRepresentation(this.getNodeOfFocus(quad), this.context);
|
|
58
61
|
});
|
|
59
62
|
return new Set(collection)[Symbol.iterator]();
|
|
60
63
|
}
|
|
61
|
-
get [
|
|
64
|
+
get [_Symbol$toStringTag]() {
|
|
62
65
|
return "LdSet";
|
|
63
66
|
}
|
|
64
67
|
get [require_types._getUnderlyingDataset]() {
|
|
@@ -2,6 +2,9 @@ import { _getUnderlyingDataset, _getUnderlyingMatch, _proxyContext, _writeGraphs
|
|
|
2
2
|
import { BasicLdSet } from "./ldSet/BasicLdSet.mjs";
|
|
3
3
|
import { nodeToJsonldRepresentation } from "../util/nodeToJsonldRepresentation.mjs";
|
|
4
4
|
//#region src/setProxy/SetProxy.ts
|
|
5
|
+
let _Symbol$iterator, _Symbol$toStringTag;
|
|
6
|
+
_Symbol$iterator = Symbol.iterator;
|
|
7
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
5
8
|
/**
|
|
6
9
|
* A Set Proxy represents a set of items in a dataset and is a proxy for
|
|
7
10
|
* accessing those items in the dataset.
|
|
@@ -52,13 +55,13 @@ var SetProxy = class extends BasicLdSet {
|
|
|
52
55
|
values() {
|
|
53
56
|
return this[Symbol.iterator]();
|
|
54
57
|
}
|
|
55
|
-
[
|
|
58
|
+
[_Symbol$iterator]() {
|
|
56
59
|
const collection = this.getQuads().toArray().map((quad) => {
|
|
57
60
|
return nodeToJsonldRepresentation(this.getNodeOfFocus(quad), this.context);
|
|
58
61
|
});
|
|
59
62
|
return new Set(collection)[Symbol.iterator]();
|
|
60
63
|
}
|
|
61
|
-
get [
|
|
64
|
+
get [_Symbol$toStringTag]() {
|
|
62
65
|
return "LdSet";
|
|
63
66
|
}
|
|
64
67
|
get [_getUnderlyingDataset]() {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"SetProxy.mjs","names":[],"sources":["../../src/setProxy/SetProxy.ts"],"sourcesContent":["/**\n * This file handles the underlying functionality of a set, including hidden\n * helper methods\n */\nimport type { Dataset, Quad } from \"@rdfjs/types\";\nimport type {\n GraphNode,\n ObjectNode,\n QuadMatch,\n SubjectNode,\n} from \"@ldo/rdf-utils\";\nimport {\n _isSubjectOriented,\n _getUnderlyingDataset,\n _proxyContext,\n _isLangString,\n _getUnderlyingMatch,\n _getUnderlyingNode,\n _writeGraphs,\n} from \"../types\";\nimport type { ProxyContext } from \"../ProxyContext\";\nimport type { RawValue } from \"../util/RawObject\";\nimport { nodeToJsonldRepresentation } from \"../util/nodeToJsonldRepresentation\";\nimport { BasicLdSet } from \"./ldSet/BasicLdSet\";\n\n/**\n * A Set Proxy represents a set of items in a dataset and is a proxy for\n * accessing those items in the dataset.\n */\nexport abstract class SetProxy<\n T extends NonNullable<RawValue> = NonNullable<RawValue>,\n> extends BasicLdSet<T> {\n protected quadMatch: QuadMatch;\n protected context: ProxyContext;\n\n constructor(context: ProxyContext, quadMatch: QuadMatch) {\n super();\n this.context = context;\n this.quadMatch = quadMatch;\n }\n\n /**\n * Gets the subject, predicate and object for this set\n */\n protected abstract getQuads(value?: T): Dataset<Quad, Quad>;\n\n protected abstract getNodeOfFocus(quad: Quad): SubjectNode | ObjectNode;\n\n /**\n * The add method on a wildcard set does nothing.\n * @deprecated You cannot add data to a wildcard set as it is simply a proxy to an underlying dataset\n */\n add(_value: T) {\n console.warn(\n 'You\\'ve attempted to call \"add\" on a wildcard set. You cannot add data to a wildcard set as it is simply a proxy to an underlying dataset',\n );\n return this;\n }\n\n /**\n * The clear method on an abstract set does nothing.\n * @deprecated You cannot clear data from an abstract set as it is simply a proxy to an underlying dataset\n */\n clear(): void {\n console.warn(\n 'You\\'ve attempted to call \"clear\" on an abstract set. You cannot clear data from an abstract set as it is simply a proxy to an underlying dataset',\n );\n return;\n }\n\n /**\n * The delete method on an abstract set does nothing.\n * @deprecated You cannot delete data from an abstract set as it is simply a proxy to an underlying dataset\n */\n delete(_value: T): boolean {\n console.warn(\n 'You\\'ve attempted to call \"clear\" on an abstract set. You cannot delete data from an abstract set as it is simply a proxy to an underlying dataset',\n );\n return false;\n }\n\n has(value: T): boolean {\n return this.getQuads(value).size > 0;\n }\n\n get size() {\n return this.getQuads().size;\n }\n\n entries(): IterableIterator<[T, T]> {\n const iteratorSet = new Set<[T, T]>();\n for (const value of this) {\n iteratorSet.add([value, value]);\n }\n return iteratorSet[Symbol.iterator]();\n }\n\n keys(): IterableIterator<T> {\n return this.values();\n }\n\n values(): IterableIterator<T> {\n return this[Symbol.iterator]();\n }\n\n [Symbol.iterator](): IterableIterator<T> {\n const quads = this.getQuads();\n const collection: T[] = quads.toArray().map((quad) => {\n const quadSubject = this.getNodeOfFocus(quad);\n return nodeToJsonldRepresentation(quadSubject, this.context) as T;\n });\n return new Set(collection)[Symbol.iterator]();\n }\n\n get [Symbol.toStringTag]() {\n // TODO: Change this to be human readable.\n return \"LdSet\";\n }\n\n get [_getUnderlyingDataset](): Dataset {\n return this.context.dataset;\n }\n\n get [_getUnderlyingMatch](): QuadMatch {\n return this.quadMatch;\n }\n\n get [_proxyContext](): ProxyContext {\n return this.context;\n }\n\n set [_proxyContext](newContext: ProxyContext) {\n this.context = newContext;\n }\n\n get [_writeGraphs](): GraphNode[] {\n return this.context.writeGraphs;\n }\n\n abstract get [_isSubjectOriented](): boolean;\n}\n"],"mappings":"
|
|
1
|
+
{"version":3,"file":"SetProxy.mjs","names":[],"sources":["../../src/setProxy/SetProxy.ts"],"sourcesContent":["/**\n * This file handles the underlying functionality of a set, including hidden\n * helper methods\n */\nimport type { Dataset, Quad } from \"@rdfjs/types\";\nimport type {\n GraphNode,\n ObjectNode,\n QuadMatch,\n SubjectNode,\n} from \"@ldo/rdf-utils\";\nimport {\n _isSubjectOriented,\n _getUnderlyingDataset,\n _proxyContext,\n _isLangString,\n _getUnderlyingMatch,\n _getUnderlyingNode,\n _writeGraphs,\n} from \"../types\";\nimport type { ProxyContext } from \"../ProxyContext\";\nimport type { RawValue } from \"../util/RawObject\";\nimport { nodeToJsonldRepresentation } from \"../util/nodeToJsonldRepresentation\";\nimport { BasicLdSet } from \"./ldSet/BasicLdSet\";\n\n/**\n * A Set Proxy represents a set of items in a dataset and is a proxy for\n * accessing those items in the dataset.\n */\nexport abstract class SetProxy<\n T extends NonNullable<RawValue> = NonNullable<RawValue>,\n> extends BasicLdSet<T> {\n protected quadMatch: QuadMatch;\n protected context: ProxyContext;\n\n constructor(context: ProxyContext, quadMatch: QuadMatch) {\n super();\n this.context = context;\n this.quadMatch = quadMatch;\n }\n\n /**\n * Gets the subject, predicate and object for this set\n */\n protected abstract getQuads(value?: T): Dataset<Quad, Quad>;\n\n protected abstract getNodeOfFocus(quad: Quad): SubjectNode | ObjectNode;\n\n /**\n * The add method on a wildcard set does nothing.\n * @deprecated You cannot add data to a wildcard set as it is simply a proxy to an underlying dataset\n */\n add(_value: T) {\n console.warn(\n 'You\\'ve attempted to call \"add\" on a wildcard set. You cannot add data to a wildcard set as it is simply a proxy to an underlying dataset',\n );\n return this;\n }\n\n /**\n * The clear method on an abstract set does nothing.\n * @deprecated You cannot clear data from an abstract set as it is simply a proxy to an underlying dataset\n */\n clear(): void {\n console.warn(\n 'You\\'ve attempted to call \"clear\" on an abstract set. You cannot clear data from an abstract set as it is simply a proxy to an underlying dataset',\n );\n return;\n }\n\n /**\n * The delete method on an abstract set does nothing.\n * @deprecated You cannot delete data from an abstract set as it is simply a proxy to an underlying dataset\n */\n delete(_value: T): boolean {\n console.warn(\n 'You\\'ve attempted to call \"clear\" on an abstract set. You cannot delete data from an abstract set as it is simply a proxy to an underlying dataset',\n );\n return false;\n }\n\n has(value: T): boolean {\n return this.getQuads(value).size > 0;\n }\n\n get size() {\n return this.getQuads().size;\n }\n\n entries(): IterableIterator<[T, T]> {\n const iteratorSet = new Set<[T, T]>();\n for (const value of this) {\n iteratorSet.add([value, value]);\n }\n return iteratorSet[Symbol.iterator]();\n }\n\n keys(): IterableIterator<T> {\n return this.values();\n }\n\n values(): IterableIterator<T> {\n return this[Symbol.iterator]();\n }\n\n [Symbol.iterator](): IterableIterator<T> {\n const quads = this.getQuads();\n const collection: T[] = quads.toArray().map((quad) => {\n const quadSubject = this.getNodeOfFocus(quad);\n return nodeToJsonldRepresentation(quadSubject, this.context) as T;\n });\n return new Set(collection)[Symbol.iterator]();\n }\n\n get [Symbol.toStringTag]() {\n // TODO: Change this to be human readable.\n return \"LdSet\";\n }\n\n get [_getUnderlyingDataset](): Dataset {\n return this.context.dataset;\n }\n\n get [_getUnderlyingMatch](): QuadMatch {\n return this.quadMatch;\n }\n\n get [_proxyContext](): ProxyContext {\n return this.context;\n }\n\n set [_proxyContext](newContext: ProxyContext) {\n this.context = newContext;\n }\n\n get [_writeGraphs](): GraphNode[] {\n return this.context.writeGraphs;\n }\n\n abstract get [_isSubjectOriented](): boolean;\n}\n"],"mappings":";;;;;mBAyGG,OAAO;sBASH,OAAO;;;;;AArFd,IAAsB,WAAtB,cAEU,WAAc;CAItB,YAAY,SAAuB,WAAsB;AACvD,SAAO;AACP,OAAK,UAAU;AACf,OAAK,YAAY;;;;;;CAcnB,IAAI,QAAW;AACb,UAAQ,KACN,6IACD;AACD,SAAO;;;;;;CAOT,QAAc;AACZ,UAAQ,KACN,qJACD;;;;;;CAQH,OAAO,QAAoB;AACzB,UAAQ,KACN,sJACD;AACD,SAAO;;CAGT,IAAI,OAAmB;AACrB,SAAO,KAAK,SAAS,MAAM,CAAC,OAAO;;CAGrC,IAAI,OAAO;AACT,SAAO,KAAK,UAAU,CAAC;;CAGzB,UAAoC;EAClC,MAAM,8BAAc,IAAI,KAAa;AACrC,OAAK,MAAM,SAAS,KAClB,aAAY,IAAI,CAAC,OAAO,MAAM,CAAC;AAEjC,SAAO,YAAY,OAAO,WAAW;;CAGvC,OAA4B;AAC1B,SAAO,KAAK,QAAQ;;CAGtB,SAA8B;AAC5B,SAAO,KAAK,OAAO,WAAW;;CAGhC,CAAA,oBAAyC;EAEvC,MAAM,aADQ,KAAK,UAAU,CACC,SAAS,CAAC,KAAK,SAAS;AAEpD,UAAO,2BADa,KAAK,eAAe,KAAK,EACE,KAAK,QAAQ;IAC5D;AACF,SAAO,IAAI,IAAI,WAAW,CAAC,OAAO,WAAW;;CAG/C,KAAA,uBAA2B;AAEzB,SAAO;;CAGT,KAAK,yBAAkC;AACrC,SAAO,KAAK,QAAQ;;CAGtB,KAAK,uBAAkC;AACrC,SAAO,KAAK;;CAGd,KAAK,iBAA+B;AAClC,SAAO,KAAK;;CAGd,KAAK,eAAe,YAA0B;AAC5C,OAAK,UAAU;;CAGjB,KAAK,gBAA6B;AAChC,SAAO,KAAK,QAAQ"}
|
|
@@ -1,6 +1,9 @@
|
|
|
1
1
|
const require_types = require("../../types.cjs");
|
|
2
2
|
let _ldo_rdf_utils = require("@ldo/rdf-utils");
|
|
3
3
|
//#region src/setProxy/ldSet/BasicLdSet.ts
|
|
4
|
+
let _Symbol$iterator, _Symbol$toStringTag;
|
|
5
|
+
_Symbol$iterator = Symbol.iterator;
|
|
6
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
4
7
|
var BasicLdSet = class BasicLdSet {
|
|
5
8
|
constructor(values) {
|
|
6
9
|
this.hashMap = /* @__PURE__ */ new Map();
|
|
@@ -46,10 +49,10 @@ var BasicLdSet = class BasicLdSet {
|
|
|
46
49
|
values() {
|
|
47
50
|
return this.hashMap.values();
|
|
48
51
|
}
|
|
49
|
-
[
|
|
52
|
+
[_Symbol$iterator]() {
|
|
50
53
|
return this.hashMap.values();
|
|
51
54
|
}
|
|
52
|
-
get [
|
|
55
|
+
get [_Symbol$toStringTag]() {
|
|
53
56
|
return "BasicLdSet";
|
|
54
57
|
}
|
|
55
58
|
every(predicate, thisArg) {
|
|
@@ -1,6 +1,9 @@
|
|
|
1
1
|
import { _getUnderlyingNode } from "../../types.mjs";
|
|
2
2
|
import { blankNode } from "@ldo/rdf-utils";
|
|
3
3
|
//#region src/setProxy/ldSet/BasicLdSet.ts
|
|
4
|
+
let _Symbol$iterator, _Symbol$toStringTag;
|
|
5
|
+
_Symbol$iterator = Symbol.iterator;
|
|
6
|
+
_Symbol$toStringTag = Symbol.toStringTag;
|
|
4
7
|
var BasicLdSet = class BasicLdSet {
|
|
5
8
|
constructor(values) {
|
|
6
9
|
this.hashMap = /* @__PURE__ */ new Map();
|
|
@@ -46,10 +49,10 @@ var BasicLdSet = class BasicLdSet {
|
|
|
46
49
|
values() {
|
|
47
50
|
return this.hashMap.values();
|
|
48
51
|
}
|
|
49
|
-
[
|
|
52
|
+
[_Symbol$iterator]() {
|
|
50
53
|
return this.hashMap.values();
|
|
51
54
|
}
|
|
52
|
-
get [
|
|
55
|
+
get [_Symbol$toStringTag]() {
|
|
53
56
|
return "BasicLdSet";
|
|
54
57
|
}
|
|
55
58
|
every(predicate, thisArg) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"BasicLdSet.mjs","names":[],"sources":["../../../src/setProxy/ldSet/BasicLdSet.ts"],"sourcesContent":["import type { BlankNode, NamedNode } from \"@rdfjs/types\";\nimport { _getUnderlyingNode } from \"../../types\";\nimport type { RawValue } from \"../../util/RawObject\";\nimport type { LdSet } from \"./LdSet\";\nimport { blankNode } from \"@ldo/rdf-utils\";\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\nexport class BasicLdSet<T extends NonNullable<RawValue> = NonNullable<RawValue>>\n implements LdSet<T>\n{\n private hashMap: Map<string, T>;\n\n constructor(values?: Iterable<T> | null) {\n this.hashMap = new Map();\n if (values) {\n for (const value of values) {\n this.add(value);\n }\n }\n }\n\n private hashFn(value: T): string {\n if (typeof value !== \"object\") return value.toString();\n if (value[_getUnderlyingNode]) {\n return (value[_getUnderlyingNode] as NamedNode | BlankNode).value;\n } else if (!value[\"@id\"]) {\n return blankNode().value;\n } else if (typeof value[\"@id\"] === \"string\") {\n return value[\"@id\"];\n } else {\n return value[\"@id\"].value;\n }\n }\n\n /**\n * ===========================================================================\n * Base Set Functions\n * ===========================================================================\n */\n\n add(value: T): this {\n const key = this.hashFn(value);\n if (!this.hashMap.has(key)) {\n this.hashMap.set(key, value);\n }\n return this;\n }\n\n clear(): void {\n this.hashMap.clear();\n }\n\n delete(value: T): boolean {\n const key = this.hashFn(value);\n return this.hashMap.delete(key);\n }\n\n has(value: T): boolean {\n const key = this.hashFn(value);\n return this.hashMap.has(key);\n }\n\n get size(): number {\n return this.hashMap.size;\n }\n\n *entries(): IterableIterator<[T, T]> {\n for (const [, value] of this.hashMap.entries()) {\n yield [value, value];\n }\n }\n\n keys(): IterableIterator<T> {\n return this.hashMap.values();\n }\n\n values(): IterableIterator<T> {\n return this.hashMap.values();\n }\n [Symbol.iterator](): IterableIterator<T> {\n return this.hashMap.values();\n }\n\n get [Symbol.toStringTag]() {\n // TODO: Change this to be human readable.\n return \"BasicLdSet\";\n }\n\n /**\n * ===========================================================================\n * Array Functions\n * ===========================================================================\n */\n\n every<S extends T>(\n predicate: (value: T, set: LdSet<T>) => value is S,\n thisArg?: any,\n ): this is LdSet<S>;\n every(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): boolean;\n every(predicate: (value: T, set: LdSet<T>) => any, thisArg?: any): boolean {\n for (const value of this) {\n if (!predicate.call(thisArg, value, this)) return false;\n }\n return true;\n }\n\n some(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): boolean {\n for (const value of this) {\n if (predicate.call(thisArg, value, this)) return true;\n }\n return false;\n }\n\n forEach(\n callbackfn: (value: T, value2: T, set: LdSet<T>) => void,\n thisArg?: any,\n ): void {\n for (const value of this) {\n callbackfn.call(thisArg, value, value, this);\n }\n }\n\n map<U>(callbackfn: (value: T, set: LdSet<T>) => U, thisArg?: any): U[] {\n const returnValues: U[] = [];\n for (const value of this) {\n returnValues.push(callbackfn.call(thisArg, value, this));\n }\n return returnValues;\n }\n\n filter<S extends T>(\n predicate: (value: T, set: LdSet<T>) => value is S,\n thisArg?: any,\n ): LdSet<S>;\n filter(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): LdSet<T>;\n filter(\n predicate: (value: T, set: LdSet<T>) => any,\n thisArg?: unknown,\n ): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n for (const value of this) {\n if (predicate.call(thisArg, value, this)) newSet.add(value);\n }\n return newSet;\n }\n\n reduce(\n callbackfn: (previousValue: T, currentValue: T, set: LdSet<T>) => T,\n ): T;\n reduce(\n callbackfn: (previousValue: T, currentValue: T, set: LdSet<T>) => T,\n initialValue: T,\n ): T;\n reduce<U>(\n callbackfn: (previousValue: U, currentValue: T, set: LdSet<T>) => U,\n initialValue: U,\n ): U;\n reduce(callbackfn: any, initialValue?: any): any {\n const iterator = this[Symbol.iterator]();\n let accumulator;\n\n if (initialValue === undefined) {\n const first = iterator.next();\n if (first.done) {\n throw new TypeError(\"Reduce of empty collection with no initial value\");\n }\n accumulator = first.value;\n } else {\n accumulator = initialValue;\n }\n\n let result = iterator.next();\n while (!result.done) {\n accumulator = callbackfn(accumulator, result.value, this);\n result = iterator.next();\n }\n\n return accumulator;\n }\n\n toArray(): T[] {\n const arr: T[] = [];\n this.forEach((value) => arr.push(value));\n return arr;\n }\n\n toJSON(): T[] {\n return this.toArray();\n }\n\n /**\n * ===========================================================================\n * Set Methods\n * ===========================================================================\n */\n\n difference(other: Set<T>): LdSet<T> {\n return this.filter((value) => !other.has(value));\n }\n\n intersection(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n const iteratingSet = this.size < other.size ? this : other;\n const comparingSet = this.size < other.size ? other : this;\n for (const value of iteratingSet) {\n if (comparingSet.has(value)) {\n newSet.add(value);\n }\n }\n return newSet;\n }\n\n isDisjointFrom(other: Set<T>): boolean {\n const iteratingSet = this.size < other.size ? this : other;\n const comparingSet = this.size < other.size ? other : this;\n for (const value of iteratingSet) {\n if (comparingSet.has(value)) return false;\n }\n return true;\n }\n\n isSubsetOf(other: Set<T>): boolean {\n if (this.size > other.size) return false;\n for (const value of this) {\n if (!other.has(value)) return false;\n }\n return true;\n }\n\n isSupersetOf(other: Set<T>): boolean {\n if (this.size < other.size) return false;\n for (const value of other) {\n if (!this.has(value)) return false;\n }\n return true;\n }\n\n symmetricDifference(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n this.forEach((value) => newSet.add(value));\n other.forEach((value) => {\n if (newSet.has(value)) {\n newSet.delete(value);\n } else {\n newSet.add(value);\n }\n });\n return newSet;\n }\n\n union(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n this.forEach((value) => newSet.add(value));\n other.forEach((value) => newSet.add(value));\n return newSet;\n }\n}\n"],"mappings":";;;AAOA,IAAa,aAAb,MAAa,WAEb;CAGE,YAAY,QAA6B;AACvC,OAAK,0BAAU,IAAI,KAAK;AACxB,MAAI,OACF,MAAK,MAAM,SAAS,OAClB,MAAK,IAAI,MAAM;;CAKrB,OAAe,OAAkB;AAC/B,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,UAAU;AACtD,MAAI,MAAM,oBACR,QAAQ,MAAM,oBAA8C;WACnD,CAAC,MAAM,OAChB,QAAO,WAAW,CAAC;WACV,OAAO,MAAM,WAAW,SACjC,QAAO,MAAM;MAEb,QAAO,MAAM,OAAO;;;;;;;CAUxB,IAAI,OAAgB;EAClB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,MAAI,CAAC,KAAK,QAAQ,IAAI,IAAI,CACxB,MAAK,QAAQ,IAAI,KAAK,MAAM;AAE9B,SAAO;;CAGT,QAAc;AACZ,OAAK,QAAQ,OAAO;;CAGtB,OAAO,OAAmB;EACxB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,SAAO,KAAK,QAAQ,OAAO,IAAI;;CAGjC,IAAI,OAAmB;EACrB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,SAAO,KAAK,QAAQ,IAAI,IAAI;;CAG9B,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ;;CAGtB,CAAC,UAAoC;AACnC,OAAK,MAAM,GAAG,UAAU,KAAK,QAAQ,SAAS,CAC5C,OAAM,CAAC,OAAO,MAAM;;CAIxB,OAA4B;AAC1B,SAAO,KAAK,QAAQ,QAAQ;;CAG9B,SAA8B;AAC5B,SAAO,KAAK,QAAQ,QAAQ;;CAE9B,CAAC,OAAO,YAAiC;AACvC,SAAO,KAAK,QAAQ,QAAQ;;CAG9B,KAAK,OAAO,eAAe;AAEzB,SAAO;;CAiBT,MAAM,WAA6C,SAAwB;AACzE,OAAK,MAAM,SAAS,KAClB,KAAI,CAAC,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO;AAEpD,SAAO;;CAGT,KACE,WACA,SACS;AACT,OAAK,MAAM,SAAS,KAClB,KAAI,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO;AAEnD,SAAO;;CAGT,QACE,YACA,SACM;AACN,OAAK,MAAM,SAAS,KAClB,YAAW,KAAK,SAAS,OAAO,OAAO,KAAK;;CAIhD,IAAO,YAA4C,SAAoB;EACrE,MAAM,eAAoB,EAAE;AAC5B,OAAK,MAAM,SAAS,KAClB,cAAa,KAAK,WAAW,KAAK,SAAS,OAAO,KAAK,CAAC;AAE1D,SAAO;;CAWT,OACE,WACA,SACU;EACV,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,MAAM,SAAS,KAClB,KAAI,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO,IAAI,MAAM;AAE7D,SAAO;;CAcT,OAAO,YAAiB,cAAyB;EAC/C,MAAM,WAAW,KAAK,OAAO,WAAW;EACxC,IAAI;AAEJ,MAAI,iBAAiB,KAAA,GAAW;GAC9B,MAAM,QAAQ,SAAS,MAAM;AAC7B,OAAI,MAAM,KACR,OAAM,IAAI,UAAU,mDAAmD;AAEzE,iBAAc,MAAM;QAEpB,eAAc;EAGhB,IAAI,SAAS,SAAS,MAAM;AAC5B,SAAO,CAAC,OAAO,MAAM;AACnB,iBAAc,WAAW,aAAa,OAAO,OAAO,KAAK;AACzD,YAAS,SAAS,MAAM;;AAG1B,SAAO;;CAGT,UAAe;EACb,MAAM,MAAW,EAAE;AACnB,OAAK,SAAS,UAAU,IAAI,KAAK,MAAM,CAAC;AACxC,SAAO;;CAGT,SAAc;AACZ,SAAO,KAAK,SAAS;;;;;;;CASvB,WAAW,OAAyB;AAClC,SAAO,KAAK,QAAQ,UAAU,CAAC,MAAM,IAAI,MAAM,CAAC;;CAGlD,aAAa,OAAyB;EACpC,MAAM,SAAS,IAAI,YAAe;EAClC,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,OAAO;EACrD,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,QAAQ;AACtD,OAAK,MAAM,SAAS,aAClB,KAAI,aAAa,IAAI,MAAM,CACzB,QAAO,IAAI,MAAM;AAGrB,SAAO;;CAGT,eAAe,OAAwB;EACrC,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,OAAO;EACrD,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,QAAQ;AACtD,OAAK,MAAM,SAAS,aAClB,KAAI,aAAa,IAAI,MAAM,CAAE,QAAO;AAEtC,SAAO;;CAGT,WAAW,OAAwB;AACjC,MAAI,KAAK,OAAO,MAAM,KAAM,QAAO;AACnC,OAAK,MAAM,SAAS,KAClB,KAAI,CAAC,MAAM,IAAI,MAAM,CAAE,QAAO;AAEhC,SAAO;;CAGT,aAAa,OAAwB;AACnC,MAAI,KAAK,OAAO,MAAM,KAAM,QAAO;AACnC,OAAK,MAAM,SAAS,MAClB,KAAI,CAAC,KAAK,IAAI,MAAM,CAAE,QAAO;AAE/B,SAAO;;CAGT,oBAAoB,OAAyB;EAC3C,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC1C,QAAM,SAAS,UAAU;AACvB,OAAI,OAAO,IAAI,MAAM,CACnB,QAAO,OAAO,MAAM;OAEpB,QAAO,IAAI,MAAM;IAEnB;AACF,SAAO;;CAGT,MAAM,OAAyB;EAC7B,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC1C,QAAM,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC3C,SAAO"}
|
|
1
|
+
{"version":3,"file":"BasicLdSet.mjs","names":[],"sources":["../../../src/setProxy/ldSet/BasicLdSet.ts"],"sourcesContent":["import type { BlankNode, NamedNode } from \"@rdfjs/types\";\nimport { _getUnderlyingNode } from \"../../types\";\nimport type { RawValue } from \"../../util/RawObject\";\nimport type { LdSet } from \"./LdSet\";\nimport { blankNode } from \"@ldo/rdf-utils\";\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\nexport class BasicLdSet<T extends NonNullable<RawValue> = NonNullable<RawValue>>\n implements LdSet<T>\n{\n private hashMap: Map<string, T>;\n\n constructor(values?: Iterable<T> | null) {\n this.hashMap = new Map();\n if (values) {\n for (const value of values) {\n this.add(value);\n }\n }\n }\n\n private hashFn(value: T): string {\n if (typeof value !== \"object\") return value.toString();\n if (value[_getUnderlyingNode]) {\n return (value[_getUnderlyingNode] as NamedNode | BlankNode).value;\n } else if (!value[\"@id\"]) {\n return blankNode().value;\n } else if (typeof value[\"@id\"] === \"string\") {\n return value[\"@id\"];\n } else {\n return value[\"@id\"].value;\n }\n }\n\n /**\n * ===========================================================================\n * Base Set Functions\n * ===========================================================================\n */\n\n add(value: T): this {\n const key = this.hashFn(value);\n if (!this.hashMap.has(key)) {\n this.hashMap.set(key, value);\n }\n return this;\n }\n\n clear(): void {\n this.hashMap.clear();\n }\n\n delete(value: T): boolean {\n const key = this.hashFn(value);\n return this.hashMap.delete(key);\n }\n\n has(value: T): boolean {\n const key = this.hashFn(value);\n return this.hashMap.has(key);\n }\n\n get size(): number {\n return this.hashMap.size;\n }\n\n *entries(): IterableIterator<[T, T]> {\n for (const [, value] of this.hashMap.entries()) {\n yield [value, value];\n }\n }\n\n keys(): IterableIterator<T> {\n return this.hashMap.values();\n }\n\n values(): IterableIterator<T> {\n return this.hashMap.values();\n }\n [Symbol.iterator](): IterableIterator<T> {\n return this.hashMap.values();\n }\n\n get [Symbol.toStringTag]() {\n // TODO: Change this to be human readable.\n return \"BasicLdSet\";\n }\n\n /**\n * ===========================================================================\n * Array Functions\n * ===========================================================================\n */\n\n every<S extends T>(\n predicate: (value: T, set: LdSet<T>) => value is S,\n thisArg?: any,\n ): this is LdSet<S>;\n every(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): boolean;\n every(predicate: (value: T, set: LdSet<T>) => any, thisArg?: any): boolean {\n for (const value of this) {\n if (!predicate.call(thisArg, value, this)) return false;\n }\n return true;\n }\n\n some(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): boolean {\n for (const value of this) {\n if (predicate.call(thisArg, value, this)) return true;\n }\n return false;\n }\n\n forEach(\n callbackfn: (value: T, value2: T, set: LdSet<T>) => void,\n thisArg?: any,\n ): void {\n for (const value of this) {\n callbackfn.call(thisArg, value, value, this);\n }\n }\n\n map<U>(callbackfn: (value: T, set: LdSet<T>) => U, thisArg?: any): U[] {\n const returnValues: U[] = [];\n for (const value of this) {\n returnValues.push(callbackfn.call(thisArg, value, this));\n }\n return returnValues;\n }\n\n filter<S extends T>(\n predicate: (value: T, set: LdSet<T>) => value is S,\n thisArg?: any,\n ): LdSet<S>;\n filter(\n predicate: (value: T, set: LdSet<T>) => unknown,\n thisArg?: any,\n ): LdSet<T>;\n filter(\n predicate: (value: T, set: LdSet<T>) => any,\n thisArg?: unknown,\n ): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n for (const value of this) {\n if (predicate.call(thisArg, value, this)) newSet.add(value);\n }\n return newSet;\n }\n\n reduce(\n callbackfn: (previousValue: T, currentValue: T, set: LdSet<T>) => T,\n ): T;\n reduce(\n callbackfn: (previousValue: T, currentValue: T, set: LdSet<T>) => T,\n initialValue: T,\n ): T;\n reduce<U>(\n callbackfn: (previousValue: U, currentValue: T, set: LdSet<T>) => U,\n initialValue: U,\n ): U;\n reduce(callbackfn: any, initialValue?: any): any {\n const iterator = this[Symbol.iterator]();\n let accumulator;\n\n if (initialValue === undefined) {\n const first = iterator.next();\n if (first.done) {\n throw new TypeError(\"Reduce of empty collection with no initial value\");\n }\n accumulator = first.value;\n } else {\n accumulator = initialValue;\n }\n\n let result = iterator.next();\n while (!result.done) {\n accumulator = callbackfn(accumulator, result.value, this);\n result = iterator.next();\n }\n\n return accumulator;\n }\n\n toArray(): T[] {\n const arr: T[] = [];\n this.forEach((value) => arr.push(value));\n return arr;\n }\n\n toJSON(): T[] {\n return this.toArray();\n }\n\n /**\n * ===========================================================================\n * Set Methods\n * ===========================================================================\n */\n\n difference(other: Set<T>): LdSet<T> {\n return this.filter((value) => !other.has(value));\n }\n\n intersection(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n const iteratingSet = this.size < other.size ? this : other;\n const comparingSet = this.size < other.size ? other : this;\n for (const value of iteratingSet) {\n if (comparingSet.has(value)) {\n newSet.add(value);\n }\n }\n return newSet;\n }\n\n isDisjointFrom(other: Set<T>): boolean {\n const iteratingSet = this.size < other.size ? this : other;\n const comparingSet = this.size < other.size ? other : this;\n for (const value of iteratingSet) {\n if (comparingSet.has(value)) return false;\n }\n return true;\n }\n\n isSubsetOf(other: Set<T>): boolean {\n if (this.size > other.size) return false;\n for (const value of this) {\n if (!other.has(value)) return false;\n }\n return true;\n }\n\n isSupersetOf(other: Set<T>): boolean {\n if (this.size < other.size) return false;\n for (const value of other) {\n if (!this.has(value)) return false;\n }\n return true;\n }\n\n symmetricDifference(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n this.forEach((value) => newSet.add(value));\n other.forEach((value) => {\n if (newSet.has(value)) {\n newSet.delete(value);\n } else {\n newSet.add(value);\n }\n });\n return newSet;\n }\n\n union(other: Set<T>): LdSet<T> {\n const newSet = new BasicLdSet<T>();\n this.forEach((value) => newSet.add(value));\n other.forEach((value) => newSet.add(value));\n return newSet;\n }\n}\n"],"mappings":";;;;mBA+EG,OAAO;sBAIH,OAAO;AA5Ed,IAAa,aAAb,MAAa,WAEb;CAGE,YAAY,QAA6B;AACvC,OAAK,0BAAU,IAAI,KAAK;AACxB,MAAI,OACF,MAAK,MAAM,SAAS,OAClB,MAAK,IAAI,MAAM;;CAKrB,OAAe,OAAkB;AAC/B,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,UAAU;AACtD,MAAI,MAAM,oBACR,QAAQ,MAAM,oBAA8C;WACnD,CAAC,MAAM,OAChB,QAAO,WAAW,CAAC;WACV,OAAO,MAAM,WAAW,SACjC,QAAO,MAAM;MAEb,QAAO,MAAM,OAAO;;;;;;;CAUxB,IAAI,OAAgB;EAClB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,MAAI,CAAC,KAAK,QAAQ,IAAI,IAAI,CACxB,MAAK,QAAQ,IAAI,KAAK,MAAM;AAE9B,SAAO;;CAGT,QAAc;AACZ,OAAK,QAAQ,OAAO;;CAGtB,OAAO,OAAmB;EACxB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,SAAO,KAAK,QAAQ,OAAO,IAAI;;CAGjC,IAAI,OAAmB;EACrB,MAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,SAAO,KAAK,QAAQ,IAAI,IAAI;;CAG9B,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ;;CAGtB,CAAC,UAAoC;AACnC,OAAK,MAAM,GAAG,UAAU,KAAK,QAAQ,SAAS,CAC5C,OAAM,CAAC,OAAO,MAAM;;CAIxB,OAA4B;AAC1B,SAAO,KAAK,QAAQ,QAAQ;;CAG9B,SAA8B;AAC5B,SAAO,KAAK,QAAQ,QAAQ;;CAE9B,CAAA,oBAAyC;AACvC,SAAO,KAAK,QAAQ,QAAQ;;CAG9B,KAAA,uBAA2B;AAEzB,SAAO;;CAiBT,MAAM,WAA6C,SAAwB;AACzE,OAAK,MAAM,SAAS,KAClB,KAAI,CAAC,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO;AAEpD,SAAO;;CAGT,KACE,WACA,SACS;AACT,OAAK,MAAM,SAAS,KAClB,KAAI,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO;AAEnD,SAAO;;CAGT,QACE,YACA,SACM;AACN,OAAK,MAAM,SAAS,KAClB,YAAW,KAAK,SAAS,OAAO,OAAO,KAAK;;CAIhD,IAAO,YAA4C,SAAoB;EACrE,MAAM,eAAoB,EAAE;AAC5B,OAAK,MAAM,SAAS,KAClB,cAAa,KAAK,WAAW,KAAK,SAAS,OAAO,KAAK,CAAC;AAE1D,SAAO;;CAWT,OACE,WACA,SACU;EACV,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,MAAM,SAAS,KAClB,KAAI,UAAU,KAAK,SAAS,OAAO,KAAK,CAAE,QAAO,IAAI,MAAM;AAE7D,SAAO;;CAcT,OAAO,YAAiB,cAAyB;EAC/C,MAAM,WAAW,KAAK,OAAO,WAAW;EACxC,IAAI;AAEJ,MAAI,iBAAiB,KAAA,GAAW;GAC9B,MAAM,QAAQ,SAAS,MAAM;AAC7B,OAAI,MAAM,KACR,OAAM,IAAI,UAAU,mDAAmD;AAEzE,iBAAc,MAAM;QAEpB,eAAc;EAGhB,IAAI,SAAS,SAAS,MAAM;AAC5B,SAAO,CAAC,OAAO,MAAM;AACnB,iBAAc,WAAW,aAAa,OAAO,OAAO,KAAK;AACzD,YAAS,SAAS,MAAM;;AAG1B,SAAO;;CAGT,UAAe;EACb,MAAM,MAAW,EAAE;AACnB,OAAK,SAAS,UAAU,IAAI,KAAK,MAAM,CAAC;AACxC,SAAO;;CAGT,SAAc;AACZ,SAAO,KAAK,SAAS;;;;;;;CASvB,WAAW,OAAyB;AAClC,SAAO,KAAK,QAAQ,UAAU,CAAC,MAAM,IAAI,MAAM,CAAC;;CAGlD,aAAa,OAAyB;EACpC,MAAM,SAAS,IAAI,YAAe;EAClC,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,OAAO;EACrD,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,QAAQ;AACtD,OAAK,MAAM,SAAS,aAClB,KAAI,aAAa,IAAI,MAAM,CACzB,QAAO,IAAI,MAAM;AAGrB,SAAO;;CAGT,eAAe,OAAwB;EACrC,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,OAAO;EACrD,MAAM,eAAe,KAAK,OAAO,MAAM,OAAO,QAAQ;AACtD,OAAK,MAAM,SAAS,aAClB,KAAI,aAAa,IAAI,MAAM,CAAE,QAAO;AAEtC,SAAO;;CAGT,WAAW,OAAwB;AACjC,MAAI,KAAK,OAAO,MAAM,KAAM,QAAO;AACnC,OAAK,MAAM,SAAS,KAClB,KAAI,CAAC,MAAM,IAAI,MAAM,CAAE,QAAO;AAEhC,SAAO;;CAGT,aAAa,OAAwB;AACnC,MAAI,KAAK,OAAO,MAAM,KAAM,QAAO;AACnC,OAAK,MAAM,SAAS,MAClB,KAAI,CAAC,KAAK,IAAI,MAAM,CAAE,QAAO;AAE/B,SAAO;;CAGT,oBAAoB,OAAyB;EAC3C,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC1C,QAAM,SAAS,UAAU;AACvB,OAAI,OAAO,IAAI,MAAM,CACnB,QAAO,OAAO,MAAM;OAEpB,QAAO,IAAI,MAAM;IAEnB;AACF,SAAO;;CAGT,MAAM,OAAyB;EAC7B,MAAM,SAAS,IAAI,YAAe;AAClC,OAAK,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC1C,QAAM,SAAS,UAAU,OAAO,IAAI,MAAM,CAAC;AAC3C,SAAO"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"NodeSet.mjs","names":[],"sources":["../../src/util/NodeSet.ts"],"sourcesContent":["import type { BlankNode, DefaultGraph, Literal, NamedNode } from \"@rdfjs/types\";\nimport type { ObjectNode } from \"@ldo/rdf-utils\";\n\nexport function nodeToString(\n node: NamedNode | BlankNode | DefaultGraph | Literal | null | undefined,\n): string {\n if (node == null) {\n return \"null\";\n }\n switch (node.termType) {\n case \"NamedNode\":\n return `namedNode(${node.value})`;\n case \"BlankNode\":\n return `blankNode(${node.value})`;\n case \"Literal\":\n return `literal(${node.value},${node.datatype.value})`;\n case \"DefaultGraph\":\n return \"defaultGraph()\";\n }\n}\n\nexport class NodeSet {\n private set: Set<string> = new Set();\n private map: Record<string, ObjectNode> = {};\n\n add(node: ObjectNode) {\n const key = nodeToString(node);\n this.set.add(key);\n this.map[key] = node;\n }\n\n has(node: ObjectNode): boolean {\n return this.set.has(nodeToString(node));\n }\n}\n"],"mappings":";AAGA,SAAgB,aACd,MACQ;AACR,KAAI,QAAQ,KACV,QAAO;AAET,SAAQ,KAAK,UAAb;EACE,KAAK,YACH,QAAO,aAAa,KAAK,MAAM;EACjC,KAAK,YACH,QAAO,aAAa,KAAK,MAAM;EACjC,KAAK,UACH,QAAO,WAAW,KAAK,MAAM,GAAG,KAAK,SAAS,MAAM;EACtD,KAAK,eACH,QAAO;;;AAIb,IAAa,UAAb,MAAqB;;
|
|
1
|
+
{"version":3,"file":"NodeSet.mjs","names":[],"sources":["../../src/util/NodeSet.ts"],"sourcesContent":["import type { BlankNode, DefaultGraph, Literal, NamedNode } from \"@rdfjs/types\";\nimport type { ObjectNode } from \"@ldo/rdf-utils\";\n\nexport function nodeToString(\n node: NamedNode | BlankNode | DefaultGraph | Literal | null | undefined,\n): string {\n if (node == null) {\n return \"null\";\n }\n switch (node.termType) {\n case \"NamedNode\":\n return `namedNode(${node.value})`;\n case \"BlankNode\":\n return `blankNode(${node.value})`;\n case \"Literal\":\n return `literal(${node.value},${node.datatype.value})`;\n case \"DefaultGraph\":\n return \"defaultGraph()\";\n }\n}\n\nexport class NodeSet {\n private set: Set<string> = new Set();\n private map: Record<string, ObjectNode> = {};\n\n add(node: ObjectNode) {\n const key = nodeToString(node);\n this.set.add(key);\n this.map[key] = node;\n }\n\n has(node: ObjectNode): boolean {\n return this.set.has(nodeToString(node));\n }\n}\n"],"mappings":";AAGA,SAAgB,aACd,MACQ;AACR,KAAI,QAAQ,KACV,QAAO;AAET,SAAQ,KAAK,UAAb;EACE,KAAK,YACH,QAAO,aAAa,KAAK,MAAM;EACjC,KAAK,YACH,QAAO,aAAa,KAAK,MAAM;EACjC,KAAK,UACH,QAAO,WAAW,KAAK,MAAM,GAAG,KAAK,SAAS,MAAM;EACtD,KAAK,eACH,QAAO;;;AAIb,IAAa,UAAb,MAAqB;;AACnB,OAAQ,sBAAmB,IAAI,KAAK;AACpC,OAAQ,MAAkC,EAAE;;CAE5C,IAAI,MAAkB;EACpB,MAAM,MAAM,aAAa,KAAK;AAC9B,OAAK,IAAI,IAAI,IAAI;AACjB,OAAK,IAAI,OAAO;;CAGlB,IAAI,MAA2B;AAC7B,SAAO,KAAK,IAAI,IAAI,aAAa,KAAK,CAAC"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@ldo/jsonld-dataset-proxy",
|
|
3
|
-
"version": "1.0.0-alpha.
|
|
3
|
+
"version": "1.0.0-alpha.45",
|
|
4
4
|
"description": "",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"main": "./dist/index.cjs",
|
|
@@ -53,14 +53,14 @@
|
|
|
53
53
|
"src"
|
|
54
54
|
],
|
|
55
55
|
"dependencies": {
|
|
56
|
-
"@ldo/dataset": "^1.0.0-alpha.
|
|
57
|
-
"@ldo/rdf-utils": "^1.0.0-alpha.
|
|
58
|
-
"@ldo/subscribable-dataset": "^1.0.0-alpha.
|
|
56
|
+
"@ldo/dataset": "^1.0.0-alpha.45",
|
|
57
|
+
"@ldo/rdf-utils": "^1.0.0-alpha.45",
|
|
58
|
+
"@ldo/subscribable-dataset": "^1.0.0-alpha.45",
|
|
59
59
|
"@rdfjs/types": "^1.1.0",
|
|
60
60
|
"jsonld2graphobject": "^0.0.4"
|
|
61
61
|
},
|
|
62
62
|
"publishConfig": {
|
|
63
63
|
"access": "public"
|
|
64
64
|
},
|
|
65
|
-
"gitHead": "
|
|
65
|
+
"gitHead": "340f7bf3871de6c6916dc83eda6bc689e975a5ad"
|
|
66
66
|
}
|