@faubulous/mentor-rdf-serializers 1.0.0

package/dist/ntriples/serializer.js

@@ -0,0 +1,79 @@
+import { RdfSyntax } from '../types.js';
+import { BaseSerializer } from '../base-serializer.js';
+import { sortQuads } from '../utils.js';
+/**
+ * Serializer for N-Triples format (RDF 1.2 compatible).
+ *
+ * N-Triples is a line-based, plain text format for encoding RDF graphs.
+ * Each line contains a single triple: subject predicate object .
+ *
+ * RDF 1.2 adds support for triple terms (quoted triples) as subjects or objects.
+ *
+ * @see https://www.w3.org/TR/rdf12-n-triples/
+ */
+export class NTriplesSerializer extends BaseSerializer {
+    syntax = RdfSyntax.NTriples;
+    constructor() {
+        super();
+        // N-Triples does not support prefixes or shortcuts
+        this.supportsPrefixes = false;
+        this.supportsRdfTypeShorthand = false;
+        // N-Triples 1.2 supports triple terms
+        this.supportsRdf12 = true;
+    }
+    /**
+     * Serializes a single quad/triple to N-Triples format.
+     *
+     * @param quad The quad to serialize.
+     * @param options Serialization options.
+     * @returns The serialized N-Triple string.
+     */
+    serializeQuad(quad, options) {
+        const opts = this.getOptions(options);
+        const subject = this.serializeTerm(quad.subject, opts);
+        const predicate = this.serializeTerm(quad.predicate, opts);
+        const object = this.serializeTerm(quad.object, opts);
+        return `${subject} ${predicate} ${object} .`;
+    }
+    /**
+     * Serializes multiple quads/triples to N-Triples format.
+     *
+     * @param quads The quads to serialize.
+     * @param options Serialization options.
+     * @returns The serialized N-Triples string.
+     */
+    serialize(quads, options) {
+        const opts = this.getOptions(options);
+        const quadArray = Array.from(quads);
+        // Sort if requested
+        const sortedQuads = opts.sort ? sortQuads(quadArray) : quadArray;
+        const lines = [];
+        for (const quad of sortedQuads) {
+            // Skip quads with graph (N-Triples doesn't support named graphs)
+            if (quad.graph && quad.graph.termType !== 'DefaultGraph') {
+                continue;
+            }
+            lines.push(this.serializeQuad(quad, opts));
+        }
+        return lines.join(opts.lineEnd) + (lines.length > 0 ? opts.lineEnd : '');
+    }
+    /**
+     * Formats quads with detailed result information.
+     */
+    format(quads, options) {
+        const warnings = [];
+        const quadArray = Array.from(quads);
+        // Check for unsupported features and add warnings
+        for (const quad of quadArray) {
+            if (quad.graph && quad.graph.termType !== 'DefaultGraph') {
+                warnings.push(`Named graph ignored: N-Triples does not support named graphs.`);
+                break;
+            }
+        }
+        return {
+            output: this.serialize(quads, options),
+            warnings: warnings.length > 0 ? warnings : undefined
+        };
+    }
+}
+//# sourceMappingURL=serializer.js.map

package/dist/ntriples/serializer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serializer.js","sourceRoot":"","sources":["../../src/ntriples/serializer.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;;;;;;;;GASG;AACH,MAAM,OAAO,kBAAmB,SAAQ,cAAc;IACzC,MAAM,GAAkB,SAAS,CAAC,QAAQ,CAAC;IAEpD;QACI,KAAK,EAAE,CAAC;QACR,mDAAmD;QACnD,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,wBAAwB,GAAG,KAAK,CAAC;QACtC,sCAAsC;QACtC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,IAAsB,EAAE,OAA2B;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAEtC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAErD,OAAO,GAAG,OAAO,IAAI,SAAS,IAAI,MAAM,IAAI,CAAC;IACjD,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,KAAiC,EAAE,OAA2B;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEpC,oBAAoB;QACpB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEjE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC7B,iEAAiE;YACjE,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,cAAc,EAAE,CAAC;gBACvD,SAAS;YACb,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED;;OAEG;IACM,MAAM,CAAC,KAAiC,EAAE,OAA2B;QAC1E,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEpC,kDAAkD;QAClD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,cAAc,EAAE,CAAC;gBACvD,QAAQ,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;gBAC/E,MAAM;YACV,CAAC;QACL,CAAC;QAED,OAAO;YACH,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC;YACtC,QAAQ,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;SACvD,CAAC;IACN,CAAC;CACJ"}

package/dist/sorting/index.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Sorting module for RDF quads.
+ */
+export { alphabeticalStrategy, createByTypeStrategy, createSemanticStrategy, createPriorityStrategy, applySortingStrategy } from './strategies.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/sorting/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/sorting/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACH,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,sBAAsB,EACtB,oBAAoB,EACvB,MAAM,iBAAiB,CAAC"}

package/dist/sorting/index.js

@@ -0,0 +1,5 @@
+/**
+ * Sorting module for RDF quads.
+ */
+export { alphabeticalStrategy, createByTypeStrategy, createSemanticStrategy, createPriorityStrategy, applySortingStrategy } from './strategies.js';
+//# sourceMappingURL=index.js.map

package/dist/sorting/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/sorting/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACH,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,sBAAsB,EACtB,oBAAoB,EACvB,MAAM,iBAAiB,CAAC"}

package/dist/sorting/strategies.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Sorting strategies for RDF quads.
+ *
+ * These strategies allow customizing the order of quads in serialized output,
+ * supporting use cases like grouping by type, semantic ordering (dependencies first),
+ * and custom priority ordering.
+ */
+import type { Quad } from '@rdfjs/types';
+import type { Rdf12Quad, QuadComparator, SortingStrategy, PriorityStrategyConfig } from '../types.js';
+/**
+ * Alphabetical sorting by subject, predicate, object.
+ * This is the default sorting strategy.
+ */
+export declare const alphabeticalStrategy: SortingStrategy;
+/**
+ * Strategy that groups quads by their rdf:type, then sorts alphabetically within each type.
+ * Resources without a type are placed according to unmatchedPosition.
+ */
+export declare function createByTypeStrategy(config?: {
+    /** Where to place resources without rdf:type */
+    unmatchedPosition?: 'start' | 'end';
+    /** How to sort within each type group */
+    secondarySort?: 'alphabetical' | 'none';
+}): SortingStrategy;
+/**
+ * Semantic ordering: resources that are referenced by others come before their referents.
+ * Uses topological sort to ensure dependencies are defined before they are used.
+ */
+export declare function createSemanticStrategy(config?: {
+    /** Where to place resources that form cycles (can't be fully ordered) */
+    cyclesPosition?: 'start' | 'end';
+}): SortingStrategy;
+/**
+ * Priority-based sorting: order resources by their type according to a priority list.
+ * Types earlier in the list appear first. Unmatched resources are placed according to config.
+ */
+export declare function createPriorityStrategy(config: PriorityStrategyConfig): SortingStrategy;
+/**
+ * Applies a sorting strategy to an array of quads.
+ *
+ * @param quads The quads to sort
+ * @param strategy The sorting strategy (strategy object, comparator function, or true for alphabetical)
+ * @returns A new sorted array of quads
+ */
+export declare function applySortingStrategy(quads: Array<Quad | Rdf12Quad>, strategy: boolean | SortingStrategy | QuadComparator): Array<Quad | Rdf12Quad>;
+//# sourceMappingURL=strategies.d.ts.map

package/dist/sorting/strategies.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strategies.d.ts","sourceRoot":"","sources":["../../src/sorting/strategies.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,KAAK,EAAE,SAAS,EAAE,cAAc,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAGtG;;;GAGG;AACH,eAAO,MAAM,oBAAoB,EAAE,eAWlC,CAAC;AAEF;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,CAAC,EAAE;IAC1C,gDAAgD;IAChD,iBAAiB,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;IACpC,yCAAyC;IACzC,aAAa,CAAC,EAAE,cAAc,GAAG,MAAM,CAAC;CAC3C,GAAG,eAAe,CAgElB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,CAAC,EAAE;IAC5C,yEAAyE;IACzE,cAAc,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;CACpC,GAAG,eAAe,CAsGlB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,sBAAsB,GAAG,eAAe,CAyEtF;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC,EAC9B,QAAQ,EAAE,OAAO,GAAG,eAAe,GAAG,cAAc,GACrD,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC,CAoBzB"}

package/dist/sorting/strategies.js

@@ -0,0 +1,259 @@
+/**
+ * Sorting strategies for RDF quads.
+ *
+ * These strategies allow customizing the order of quads in serialized output,
+ * supporting use cases like grouping by type, semantic ordering (dependencies first),
+ * and custom priority ordering.
+ */
+import { termToString, RDF_TYPE } from '../utils.js';
+/**
+ * Alphabetical sorting by subject, predicate, object.
+ * This is the default sorting strategy.
+ */
+export const alphabeticalStrategy = {
+    name: 'alphabetical',
+    compare(a, b) {
+        const subjectCompare = termToString(a.subject).localeCompare(termToString(b.subject));
+        if (subjectCompare !== 0)
+            return subjectCompare;
+        const predicateCompare = termToString(a.predicate).localeCompare(termToString(b.predicate));
+        if (predicateCompare !== 0)
+            return predicateCompare;
+        return termToString(a.object).localeCompare(termToString(b.object));
+    }
+};
+/**
+ * Strategy that groups quads by their rdf:type, then sorts alphabetically within each type.
+ * Resources without a type are placed according to unmatchedPosition.
+ */
+export function createByTypeStrategy(config) {
+    const unmatchedPosition = config?.unmatchedPosition ?? 'end';
+    const secondarySort = config?.secondarySort ?? 'alphabetical';
+    return {
+        name: 'byType',
+        _typeIndex: new Map(),
+        _allTypes: new Set(),
+        prepare(quads) {
+            this._typeIndex.clear();
+            this._allTypes.clear();
+            for (const q of quads) {
+                if (q.predicate.value === RDF_TYPE && q.object.termType === 'NamedNode') {
+                    const subj = termToString(q.subject);
+                    const typeIri = q.object.value;
+                    this._typeIndex.set(subj, typeIri);
+                    this._allTypes.add(typeIri);
+                }
+            }
+        },
+        compare(a, b) {
+            const typeIndex = this._typeIndex;
+            const allTypes = Array.from(this._allTypes).sort();
+            const subjA = termToString(a.subject);
+            const subjB = termToString(b.subject);
+            const typeA = typeIndex.get(subjA);
+            const typeB = typeIndex.get(subjB);
+            // Handle unmatched (no type)
+            const hasTypeA = typeA !== undefined;
+            const hasTypeB = typeB !== undefined;
+            if (!hasTypeA && hasTypeB) {
+                return unmatchedPosition === 'start' ? -1 : 1;
+            }
+            if (hasTypeA && !hasTypeB) {
+                return unmatchedPosition === 'start' ? 1 : -1;
+            }
+            // Both have types or both don't
+            if (hasTypeA && hasTypeB) {
+                const typeCompare = allTypes.indexOf(typeA).toString().localeCompare(allTypes.indexOf(typeB).toString());
+                if (typeCompare !== 0) {
+                    return typeA.localeCompare(typeB);
+                }
+            }
+            // Secondary sort
+            if (secondarySort === 'alphabetical') {
+                return subjA.localeCompare(subjB)
+                    || termToString(a.predicate).localeCompare(termToString(b.predicate))
+                    || termToString(a.object).localeCompare(termToString(b.object));
+            }
+            return 0;
+        }
+    };
+}
+/**
+ * Semantic ordering: resources that are referenced by others come before their referents.
+ * Uses topological sort to ensure dependencies are defined before they are used.
+ */
+export function createSemanticStrategy(config) {
+    const cyclesPosition = config?.cyclesPosition ?? 'end';
+    return {
+        name: 'semantic',
+        _subjectOrder: new Map(),
+        prepare(quads) {
+            const subjectOrder = this._subjectOrder;
+            subjectOrder.clear();
+            // Build dependency graph
+            const subjects = new Set();
+            const dependencies = new Map(); // subject → subjects it depends on
+            for (const q of quads) {
+                const subj = termToString(q.subject);
+                subjects.add(subj);
+                // If object is a resource that's also a subject, it's a dependency
+                if (q.object.termType === 'NamedNode' || q.object.termType === 'BlankNode') {
+                    const obj = termToString(q.object);
+                    if (!dependencies.has(subj)) {
+                        dependencies.set(subj, new Set());
+                    }
+                    dependencies.get(subj).add(obj);
+                }
+            }
+            // Topological sort using Kahn's algorithm
+            const inDegree = new Map();
+            const outEdges = new Map(); // points to dependents
+            for (const subj of subjects) {
+                inDegree.set(subj, 0);
+                outEdges.set(subj, new Set());
+            }
+            // Build in-degree counts and reverse edges
+            for (const [subj, deps] of dependencies) {
+                for (const dep of deps) {
+                    if (subjects.has(dep)) {
+                        inDegree.set(subj, (inDegree.get(subj) ?? 0) + 1);
+                        outEdges.get(dep).add(subj);
+                    }
+                }
+            }
+            // Process nodes with no dependencies first
+            const queue = [];
+            for (const [subj, degree] of inDegree) {
+                if (degree === 0) {
+                    queue.push(subj);
+                }
+            }
+            queue.sort(); // Alphabetical within same level
+            let order = 0;
+            const ordered = [];
+            while (queue.length > 0) {
+                const current = queue.shift();
+                subjectOrder.set(current, order++);
+                ordered.push(current);
+                const dependents = Array.from(outEdges.get(current) ?? []).sort();
+                for (const dep of dependents) {
+                    const newDegree = (inDegree.get(dep) ?? 1) - 1;
+                    inDegree.set(dep, newDegree);
+                    if (newDegree === 0) {
+                        queue.push(dep);
+                        queue.sort();
+                    }
+                }
+            }
+            // Handle cycles - remaining subjects not in ordered list
+            const cycleOrder = cyclesPosition === 'start' ? -1 : order;
+            for (const subj of subjects) {
+                if (!subjectOrder.has(subj)) {
+                    subjectOrder.set(subj, cycleOrder);
+                }
+            }
+        },
+        compare(a, b) {
+            const subjectOrder = this._subjectOrder;
+            const subjA = termToString(a.subject);
+            const subjB = termToString(b.subject);
+            const orderA = subjectOrder.get(subjA) ?? Infinity;
+            const orderB = subjectOrder.get(subjB) ?? Infinity;
+            if (orderA !== orderB) {
+                return orderA - orderB;
+            }
+            // Within same subject, sort by predicate then object
+            return termToString(a.predicate).localeCompare(termToString(b.predicate))
+                || termToString(a.object).localeCompare(termToString(b.object));
+        }
+    };
+}
+/**
+ * Priority-based sorting: order resources by their type according to a priority list.
+ * Types earlier in the list appear first. Unmatched resources are placed according to config.
+ */
+export function createPriorityStrategy(config) {
+    const { typeOrder = [], predicateOrder = [], unmatchedPosition = 'end', unmatchedSort = 'alphabetical' } = config;
+    const typeRank = new Map(typeOrder.map((t, i) => [t, i]));
+    const predicateRank = new Map(predicateOrder.map((p, i) => [p, i]));
+    const unmatchedRank = unmatchedPosition === 'start' ? -1 : typeOrder.length;
+    return {
+        name: 'priority',
+        _typeIndex: new Map(),
+        prepare(quads) {
+            const typeIndex = this._typeIndex;
+            typeIndex.clear();
+            for (const q of quads) {
+                if (q.predicate.value === RDF_TYPE && q.object.termType === 'NamedNode') {
+                    const subj = termToString(q.subject);
+                    const rank = typeRank.get(q.object.value);
+                    if (rank !== undefined) {
+                        // Use lowest rank if subject has multiple types
+                        const existing = typeIndex.get(subj);
+                        if (existing === undefined || rank < existing) {
+                            typeIndex.set(subj, rank);
+                        }
+                    }
+                }
+            }
+        },
+        compare(a, b) {
+            const typeIndex = this._typeIndex;
+            const subjA = termToString(a.subject);
+            const subjB = termToString(b.subject);
+            const rankA = typeIndex.get(subjA) ?? unmatchedRank;
+            const rankB = typeIndex.get(subjB) ?? unmatchedRank;
+            // Primary: by type rank
+            if (rankA !== rankB) {
+                return rankA - rankB;
+            }
+            // Secondary: by subject
+            const subjCompare = subjA.localeCompare(subjB);
+            if (subjCompare !== 0) {
+                return subjCompare;
+            }
+            // Tertiary: by predicate rank if configured
+            if (predicateOrder.length > 0) {
+                const predRankA = predicateRank.get(a.predicate.value) ?? predicateOrder.length;
+                const predRankB = predicateRank.get(b.predicate.value) ?? predicateOrder.length;
+                if (predRankA !== predRankB) {
+                    return predRankA - predRankB;
+                }
+            }
+            // Final: alphabetical within same rank
+            if (unmatchedSort === 'alphabetical') {
+                return termToString(a.predicate).localeCompare(termToString(b.predicate))
+                    || termToString(a.object).localeCompare(termToString(b.object));
+            }
+            return 0;
+        }
+    };
+}
+/**
+ * Applies a sorting strategy to an array of quads.
+ *
+ * @param quads The quads to sort
+ * @param strategy The sorting strategy (strategy object, comparator function, or true for alphabetical)
+ * @returns A new sorted array of quads
+ */
+export function applySortingStrategy(quads, strategy) {
+    if (strategy === false) {
+        return quads;
+    }
+    const sorted = [...quads];
+    if (strategy === true) {
+        // Default alphabetical
+        sorted.sort(alphabeticalStrategy.compare.bind(alphabeticalStrategy));
+    }
+    else if (typeof strategy === 'function') {
+        // Custom comparator function
+        sorted.sort(strategy);
+    }
+    else {
+        // Strategy object
+        strategy.prepare?.(sorted);
+        sorted.sort(strategy.compare.bind(strategy));
+    }
+    return sorted;
+}
+//# sourceMappingURL=strategies.js.map

package/dist/sorting/strategies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strategies.js","sourceRoot":"","sources":["../../src/sorting/strategies.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAErD;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAoB;IACjD,IAAI,EAAE,cAAc;IACpB,OAAO,CAAC,CAAmB,EAAE,CAAmB;QAC5C,MAAM,cAAc,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACtF,IAAI,cAAc,KAAK,CAAC;YAAE,OAAO,cAAc,CAAC;QAEhD,MAAM,gBAAgB,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5F,IAAI,gBAAgB,KAAK,CAAC;YAAE,OAAO,gBAAgB,CAAC;QAEpD,OAAO,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,CAAC;CACJ,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAKpC;IACG,MAAM,iBAAiB,GAAG,MAAM,EAAE,iBAAiB,IAAI,KAAK,CAAC;IAC7D,MAAM,aAAa,GAAG,MAAM,EAAE,aAAa,IAAI,cAAc,CAAC;IAE9D,OAAO;QACH,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE,IAAI,GAAG,EAAkB;QACrC,SAAS,EAAE,IAAI,GAAG,EAAU;QAE5B,OAAO,CAAC,KAA8B;YACjC,IAAI,CAAC,UAAkC,CAAC,KAAK,EAAE,CAAC;YAChD,IAAI,CAAC,SAAyB,CAAC,KAAK,EAAE,CAAC;YAExC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;oBACtE,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACrC,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;oBAC9B,IAAI,CAAC,UAAkC,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBAC3D,IAAI,CAAC,SAAyB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,CAAC,CAAmB,EAAE,CAAmB;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAiC,CAAC;YACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAwB,CAAC,CAAC,IAAI,EAAE,CAAC;YAElE,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAEtC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEnC,6BAA6B;YAC7B,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,CAAC;YACrC,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,CAAC;YAErC,IAAI,CAAC,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBACxB,OAAO,iBAAiB,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,IAAI,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACxB,OAAO,iBAAiB,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YAED,gCAAgC;YAChC,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBACvB,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,aAAa,CAChE,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CACrC,CAAC;gBACF,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;oBACpB,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACtC,CAAC;YACL,CAAC;YAED,iBAAiB;YACjB,IAAI,aAAa,KAAK,cAAc,EAAE,CAAC;gBACnC,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC;uBAC1B,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;uBAClE,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,CAAC;YAED,OAAO,CAAC,CAAC;QACb,CAAC;KACJ,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAGtC;IACG,MAAM,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,KAAK,CAAC;IAEvD,OAAO;QACH,IAAI,EAAE,UAAU;QAChB,aAAa,EAAE,IAAI,GAAG,EAAkB;QAExC,OAAO,CAAC,KAA8B;YAClC,MAAM,YAAY,GAAG,IAAI,CAAC,aAAoC,CAAC;YAC/D,YAAY,CAAC,KAAK,EAAE,CAAC;YAErB,yBAAyB;YACzB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YACnC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,mCAAmC;YAExF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBACrC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAEnB,mEAAmE;gBACnE,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;oBACzE,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC1B,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACtC,CAAC;oBACD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,CAAC;YACL,CAAC;YAED,0CAA0C;YAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,uBAAuB;YAExE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAClC,CAAC;YAED,2CAA2C;YAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;gBACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACrB,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACpB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAClD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACjC,CAAC;gBACL,CAAC;YACL,CAAC;YAED,2CAA2C;YAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC;YACL,CAAC;YACD,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,iCAAiC;YAE/C,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,OAAO,GAAa,EAAE,CAAC;YAE7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAC/B,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gBACnC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAEtB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;gBAClE,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC/C,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;oBAC7B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBAChB,KAAK,CAAC,IAAI,EAAE,CAAC;oBACjB,CAAC;gBACL,CAAC;YACL,CAAC;YAED,yDAAyD;YACzD,MAAM,UAAU,GAAG,cAAc,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC3D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;gBACvC,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,CAAC,CAAmB,EAAE,CAAmB;YAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAoC,CAAC;YAC/D,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAEtC,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;YACnD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;YAEnD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;gBACpB,OAAO,MAAM,GAAG,MAAM,CAAC;YAC3B,CAAC;YAED,qDAAqD;YACrD,OAAO,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;mBAClE,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACxE,CAAC;KACJ,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAA8B;IACjE,MAAM,EACF,SAAS,GAAG,EAAE,EACd,cAAc,GAAG,EAAE,EACnB,iBAAiB,GAAG,KAAK,EACzB,aAAa,GAAG,cAAc,EACjC,GAAG,MAAM,CAAC;IAEX,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,aAAa,GAAG,iBAAiB,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;IAE5E,OAAO;QACH,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE,IAAI,GAAG,EAAkB;QAErC,OAAO,CAAC,KAA8B;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAiC,CAAC;YACzD,SAAS,CAAC,KAAK,EAAE,CAAC;YAElB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;oBACtE,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACrC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAE1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACrB,gDAAgD;wBAChD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACrC,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;4BAC5C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;wBAC9B,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,CAAC,CAAmB,EAAE,CAAmB;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAiC,CAAC;YACzD,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAEtC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC;YACpD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC;YAEpD,wBAAwB;YACxB,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;gBAClB,OAAO,KAAK,GAAG,KAAK,CAAC;YACzB,CAAC;YAED,wBAAwB;YACxB,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;gBACpB,OAAO,WAAW,CAAC;YACvB,CAAC;YAED,4CAA4C;YAC5C,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC;gBAChF,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC;gBAChF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;oBAC1B,OAAO,SAAS,GAAG,SAAS,CAAC;gBACjC,CAAC;YACL,CAAC;YAED,uCAAuC;YACvC,IAAI,aAAa,KAAK,cAAc,EAAE,CAAC;gBACnC,OAAO,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;uBAClE,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,CAAC;YAED,OAAO,CAAC,CAAC;QACb,CAAC;KACJ,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAChC,KAA8B,EAC9B,QAAoD;IAEpD,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAE1B,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACpB,uBAAuB;QACvB,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC;IACzE,CAAC;SAAM,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE,CAAC;QACxC,6BAA6B;QAC7B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1B,CAAC;SAAM,CAAC;QACJ,kBAAkB;QAClB,QAAQ,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/sparql/formatter.d.ts

@@ -0,0 +1,103 @@
+import type { IToken } from 'chevrotain';
+import type { ISparqlFormatter, SerializationResult, TokenSerializerOptions } from '../types.js';
+import { BaseTokenFormatter, type BaseFormatterContext, type BaseFormatterOptions } from '../base-token-formatter.js';
+/**
+ * SPARQL-specific formatting options.
+ */
+export interface SparqlFormatterOptions extends BaseFormatterOptions {
+    /**
+     * Whether to uppercase SPARQL keywords (SELECT, WHERE, etc.).
+     * Default: true
+     */
+    uppercaseKeywords?: boolean;
+    /**
+     * Whether to lowercase SPARQL keywords.
+     * Default: false (takes precedence if both are true)
+     */
+    lowercaseKeywords?: boolean;
+    /**
+     * Whether to align WHERE clause patterns.
+     * When true, triple patterns within blocks are aligned.
+     * Default: true
+     */
+    alignPatterns?: boolean;
+    /**
+     * Whether to put opening braces on the same line as keywords.
+     * Default: true
+     */
+    sameBraceLine?: boolean;
+    /**
+     * Whether to insert blank lines between major clauses.
+     * Default: true
+     */
+    separateClauses?: boolean;
+}
+/**
+ * Internal formatting context that tracks state during token processing.
+ */
+interface SparqlFormatterContext extends BaseFormatterContext {
+    opts: Required<SparqlFormatterOptions>;
+    justEndedPrefix: boolean;
+    inWhereBlock: boolean;
+    functionCallDepth: number;
+    hasFromClause: boolean;
+    isAskQuery: boolean;
+    /** Tracks if we just closed an inline block */
+    lastWasInlineBlock: boolean;
+    /** Index in parts[] where the last comment block started (for blank-line repositioning). */
+    lastCommentPartIndex: number;
+    /** Whether the last comment block already consumed a blank line (from source or clause separation). */
+    lastCommentHadBlankLine: boolean;
+    /** Whether we are inside a VALUES clause (between VALUES keyword and matching close brace). */
+    inValuesClause: boolean;
+    /** Depth of the VALUES scope (to match the correct closing brace). */
+    valuesDepth: number;
+}
+/**
+ * Formatter for SPARQL queries and updates.
+ *
+ * Uses the W3C-compliant SparqlLexer from mentor-rdf-parsers for tokenization.
+ *
+ * This formatter can:
+ * - Format SPARQL 1.1/1.2 queries and updates
+ * - Normalize keyword casing
+ * - Apply consistent indentation
+ * - Align triple patterns
+ * - Preserve comments
+ * - Preserve source newlines and blank lines
+ *
+ * @see https://www.w3.org/TR/sparql12-query/
+ */
+export declare class SparqlFormatter extends BaseTokenFormatter<SparqlFormatterContext, SparqlFormatterOptions> implements ISparqlFormatter {
+    private lexer;
+    formatFromText(query: string, options?: SparqlFormatterOptions): SerializationResult;
+    formatFromTokens(tokens: IToken[], options?: SparqlFormatterOptions & TokenSerializerOptions): SerializationResult;
+    protected getOptions(options?: SparqlFormatterOptions): Required<SparqlFormatterOptions>;
+    protected createContext(opts: Required<SparqlFormatterOptions>): SparqlFormatterContext;
+    protected formatTokenValue(token: IToken, opts: Required<SparqlFormatterOptions>): string;
+    /**
+     * Calculates the length of a block's content (from { to matching }).
+     * Returns -1 if the block should use multi-line formatting.
+     */
+    private calculateBlockLength;
+    private shouldBlockBeInline;
+    private handleOpenBrace;
+    private handleCloseBrace;
+    private handleSparqlPeriod;
+    private handleSparqlSemicolon;
+    private handleSparqlComma;
+    private handleSparqlOpenParen;
+    private handleSparqlCloseParen;
+    private handleGroupComment;
+    private handleInlineComment;
+    private updateClauseState;
+    private handleClauseSeparation;
+    private handleTriplePosition;
+    private handleLineWrapping;
+    private handleSparqlTokenSpacing;
+    private detectBlankLines;
+    private handleSparqlPrefixIri;
+    private formatTokenStream;
+}
+export {};
+//# sourceMappingURL=formatter.d.ts.map

package/dist/sparql/formatter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatter.d.ts","sourceRoot":"","sources":["../../src/sparql/formatter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAa,MAAM,YAAY,CAAC;AAEpD,OAAO,KAAK,EACR,gBAAgB,EAChB,mBAAmB,EACnB,sBAAsB,EACzB,MAAM,aAAa,CAAC;AACrB,OAAO,EACH,kBAAkB,EAClB,KAAK,oBAAoB,EACzB,KAAK,oBAAoB,EAC5B,MAAM,4BAA4B,CAAC;AAEpC;;GAEG;AACH,MAAM,WAAW,sBAAuB,SAAQ,oBAAoB;IAChE;;;OAGG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAE5B;;;OAGG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAE5B;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;OAGG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED;;GAEG;AACH,UAAU,sBAAuB,SAAQ,oBAAoB;IACzD,IAAI,EAAE,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACvC,eAAe,EAAE,OAAO,CAAC;IACzB,YAAY,EAAE,OAAO,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,+CAA+C;IAC/C,kBAAkB,EAAE,OAAO,CAAC;IAC5B,4FAA4F;IAC5F,oBAAoB,EAAE,MAAM,CAAC;IAC7B,uGAAuG;IACvG,uBAAuB,EAAE,OAAO,CAAC;IACjC,+FAA+F;IAC/F,cAAc,EAAE,OAAO,CAAC;IACxB,sEAAsE;IACtE,WAAW,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,eACT,SAAQ,kBAAkB,CAAC,sBAAsB,EAAE,sBAAsB,CACzE,YAAW,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAqB;IAMlC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,sBAAsB,GAAG,mBAAmB;IAWpF,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,sBAAsB,GAAG,sBAAsB,GAAG,mBAAmB;IAUlH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,sBAAsB,GAAG,QAAQ,CAAC,sBAAsB,CAAC;IAmBxF,SAAS,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,sBAAsB,CAAC,GAAG,sBAAsB;IAiBvF,SAAS,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,sBAAsB,CAAC,GAAG,MAAM;IAezF;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IAoG5B,OAAO,CAAC,mBAAmB;IAW3B,OAAO,CAAC,eAAe;IAoDvB,OAAO,CAAC,gBAAgB;IAsCxB,OAAO,CAAC,kBAAkB;IAyB1B,OAAO,CAAC,qBAAqB;IA0C7B,OAAO,CAAC,iBAAiB;IAoBzB,OAAO,CAAC,qBAAqB;IAsC7B,OAAO,CAAC,sBAAsB;IAwD9B,OAAO,CAAC,kBAAkB;IA2B1B,OAAO,CAAC,mBAAmB;IAiC3B,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,sBAAsB;IAoC9B,OAAO,CAAC,oBAAoB;IAqC5B,OAAO,CAAC,kBAAkB;IAkB1B,OAAO,CAAC,wBAAwB;IA+ChC,OAAO,CAAC,gBAAgB;IAexB,OAAO,CAAC,qBAAqB;IAuB7B,OAAO,CAAC,iBAAiB;CAmG5B"}