@traqula/rules-sparql-1-1 0.0.1-alpha.10

package/lib/grammar/tripleBlock.js

@@ -0,0 +1,357 @@
+import { CommonIRIs } from '../grammar-helpers/utils';
+import * as l from '../lexer';
+import { var_, varOrTerm, verb } from './general';
+import { path, pathGenerator } from './propertyPaths';
+function triplesDotSeperated(triplesSameSubjectSubrule) {
+    return ({ ACTION, AT_LEAST_ONE, SUBRULE, CONSUME, OPTION }) => (C) => {
+        const triples = [];
+        let parsedDot = true;
+        let dotToken;
+        AT_LEAST_ONE({
+            GATE: () => parsedDot,
+            DEF: () => {
+                parsedDot = false;
+                const template = SUBRULE(triplesSameSubjectSubrule, undefined);
+                ACTION(() => {
+                    triples.push(...template);
+                });
+                OPTION(() => {
+                    dotToken = CONSUME(l.symbols.dot);
+                    parsedDot = true;
+                });
+            },
+        });
+        return ACTION(() => C.factory.patternBgp(triples, C.factory.sourceLocation(...triples, dotToken)));
+    };
+}
+/**
+ * [[55]](https://www.w3.org/TR/sparql11-query/#rTriplesBlock)
+ */
+export const triplesBlock = {
+    name: 'triplesBlock',
+    impl: implArgs => C => triplesDotSeperated(triplesSameSubjectPath)(implArgs)(C, undefined),
+    gImpl: ({ SUBRULE, PRINT_WORD, HANDLE_LOC }) => (ast, { factory: F }) => {
+        for (const [index, triple] of ast.triples.entries()) {
+            HANDLE_LOC(triple, () => {
+                const nextTriple = ast.triples.at(index);
+                if (F.isTripleCollection(triple)) {
+                    SUBRULE(graphNodePath, triple, undefined);
+                    // A top level tripleCollection block means that it is not used in a triple. So you end with DOT.
+                    F.printFilter(triple, () => PRINT_WORD('.'));
+                }
+                else {
+                    // Subject
+                    SUBRULE(graphNodePath, triple.subject, undefined);
+                    // Predicate
+                    if (F.isTerm(triple.predicate) && F.isTermVariable(triple.predicate)) {
+                        SUBRULE(varOrTerm, triple.predicate, undefined);
+                    }
+                    else {
+                        SUBRULE(pathGenerator, triple.predicate, undefined);
+                    }
+                    // Object
+                    SUBRULE(graphNodePath, triple.object, undefined);
+                    // If no more things, or a top level collection (only possible if new block was part), or new subject: add DOT
+                    if (nextTriple === undefined || F.isTripleCollection(nextTriple) ||
+                        !F.isSourceLocationNoMaterialize(nextTriple.subject.loc)) {
+                        F.printFilter(ast, () => PRINT_WORD('.'));
+                    }
+                    else if (F.isSourceLocationNoMaterialize(nextTriple.predicate.loc)) {
+                        F.printFilter(ast, () => PRINT_WORD(','));
+                    }
+                    else {
+                        F.printFilter(ast, () => PRINT_WORD(';'));
+                    }
+                }
+            });
+        }
+    },
+};
+/**
+ * [[75]](https://www.w3.org/TR/sparql11-query/#rTriplesSameSubject)
+ * [[81]](https://www.w3.org/TR/sparql11-query/#rTriplesSameSubjectPath)
+ * CONTRACT: triples generated from the subject come first, then comes the main triple,
+ *  and then come the triples from the object. Only the first occurrence of a term has `SourceLocationType = source`
+ */
+function triplesSameSubjectImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ ACTION, SUBRULE, OR }) => C => OR([
+            { ALT: () => {
+                    const subject = SUBRULE(varOrTerm, undefined);
+                    const res = SUBRULE(allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty, { subject: ACTION(() => C.factory.dematerialized(subject)) });
+                    // Only the first occurrence of a subject is actually materialized.
+                    return ACTION(() => {
+                        if (res.length > 0) {
+                            res[0].subject = subject;
+                            res[0].loc = C.factory.sourceLocation(subject, res[0]);
+                        }
+                        return res;
+                    });
+                } },
+            { ALT: () => {
+                    const subjectNode = SUBRULE(allowPaths ? triplesNodePath : triplesNode, undefined);
+                    const restNode = SUBRULE(allowPaths ? propertyListPath : propertyList, { subject: ACTION(() => C.factory.graphNodeIdentifier(subjectNode)) });
+                    return ACTION(() => {
+                        if (restNode.length === 0) {
+                            return [subjectNode];
+                        }
+                        restNode[0].subject = subjectNode;
+                        restNode[0].loc = C.factory.sourceLocation(subjectNode, restNode[0]);
+                        return restNode;
+                    });
+                } },
+        ]),
+    };
+}
+export const triplesSameSubject = triplesSameSubjectImpl('triplesSameSubject', false);
+export const triplesSameSubjectPath = triplesSameSubjectImpl('triplesSameSubjectPath', true);
+/**
+ * [[52]](https://www.w3.org/TR/sparql11-query/#rTriplesTemplate)
+ */
+export const triplesTemplate = {
+    name: 'triplesTemplate',
+    impl: triplesDotSeperated(triplesSameSubject),
+};
+/**
+ * [[76]](https://www.w3.org/TR/sparql11-query/#rPropertyList)
+ * [[82]](https://www.w3.org/TR/sparql11-query/#rPropertyListPath)
+ */
+function propertyListImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ SUBRULE, OPTION }) => (_, arg) => OPTION(() => SUBRULE(allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty, arg)) ?? [],
+    };
+}
+export const propertyList = propertyListImpl('propertyList', false);
+export const propertyListPath = propertyListImpl('propertyListPath', true);
+// We could use gates for this, but in that case,
+// a grammar not in need of paths would still have to include the path rules
+/**
+ * [[77]](https://www.w3.org/TR/sparql11-query/#rPropertyListNotEmpty)
+ * [[83]](https://www.w3.org/TR/sparql11-query/#rPropertyListPathNotEmpty)
+ */
+function propertyListNotEmptyImplementation(name, allowPaths) {
+    return {
+        name,
+        impl: ({ ACTION, CONSUME, AT_LEAST_ONE, SUBRULE1, MANY2, OR1 }) => (_, arg) => {
+            const result = [];
+            let parsedSemi = true;
+            AT_LEAST_ONE({
+                GATE: () => parsedSemi,
+                DEF: () => {
+                    parsedSemi = false;
+                    const predicate = allowPaths ?
+                        OR1([
+                            { ALT: () => SUBRULE1(verbPath, undefined) },
+                            { ALT: () => SUBRULE1(verbSimple, undefined) },
+                        ]) :
+                        SUBRULE1(verb, undefined);
+                    const triples = SUBRULE1(allowPaths ? objectListPath : objectList, ACTION(() => ({ subject: arg.subject, predicate })));
+                    MANY2(() => {
+                        CONSUME(l.symbols.semi);
+                        parsedSemi = true;
+                    });
+                    ACTION(() => {
+                        result.push(...triples);
+                    });
+                },
+            });
+            return result;
+        },
+    };
+}
+export const propertyListNotEmpty = propertyListNotEmptyImplementation('propertyListNotEmpty', false);
+export const propertyListPathNotEmpty = propertyListNotEmptyImplementation('propertyListPathNotEmpty', true);
+/**
+ * [[84]](https://www.w3.org/TR/sparql11-query/#rVerbPath)
+ */
+export const verbPath = {
+    name: 'verbPath',
+    impl: ({ SUBRULE }) => () => SUBRULE(path, undefined),
+};
+/**
+ * [[85]](https://www.w3.org/TR/sparql11-query/#rVerbSimple)
+ */
+export const verbSimple = {
+    name: 'verbSimple',
+    impl: ({ SUBRULE }) => () => SUBRULE(var_, undefined),
+};
+/**
+ * [[79]](https://www.w3.org/TR/sparql11-query/#rObjectList)
+ * [[86]](https://www.w3.org/TR/sparql11-query/#rObjectListPath)
+ */
+function objectListImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ ACTION, SUBRULE, AT_LEAST_ONE_SEP }) => (_, arg) => {
+            const objects = [];
+            AT_LEAST_ONE_SEP({
+                SEP: l.symbols.comma,
+                DEF: () => {
+                    const objectTriple = SUBRULE(allowPaths ? objectPath : object, arg);
+                    ACTION(() => {
+                        objects.push(objectTriple);
+                    });
+                },
+            });
+            return objects;
+        },
+    };
+}
+export const objectList = objectListImpl('objectList', false);
+export const objectListPath = objectListImpl('objectListPath', true);
+/**
+ * [[80]](https://www.w3.org/TR/sparql11-query/#rObject)
+ * [[87]](https://www.w3.org/TR/sparql11-query/#rObjectPath)
+ */
+function objectImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ ACTION, SUBRULE }) => (C, arg) => {
+            const node = SUBRULE(allowPaths ? graphNodePath : graphNode, undefined);
+            return ACTION(() => C.factory.triple(arg.subject, arg.predicate, node));
+        },
+    };
+}
+export const object = objectImpl('object', false);
+export const objectPath = objectImpl('objectPath', true);
+/**
+ * [[102]](https://www.w3.org/TR/sparql11-query/#rCollection)
+ * [[103]](https://www.w3.org/TR/sparql11-query/#rCollectionPath)
+ */
+function collectionImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ ACTION, AT_LEAST_ONE, SUBRULE, CONSUME }) => (C) => {
+            // Construct a [cons list](https://en.wikipedia.org/wiki/Cons#Lists),
+            // here called a [RDF collection](https://www.w3.org/TR/sparql11-query/#collections).
+            const terms = [];
+            const startToken = CONSUME(l.symbols.LParen);
+            AT_LEAST_ONE(() => {
+                terms.push(SUBRULE(allowPaths ? graphNodePath : graphNode, undefined));
+            });
+            const endToken = CONSUME(l.symbols.RParen);
+            return ACTION(() => {
+                const F = C.factory;
+                const triples = [];
+                // The triples created in your recursion
+                const predFirst = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.FIRST, undefined);
+                const predRest = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.REST, undefined);
+                const predNil = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.NIL, undefined);
+                const listHead = F.blankNode(undefined, F.sourceLocationNoMaterialize());
+                let iterHead = listHead;
+                for (const [index, term] of terms.entries()) {
+                    const lastInList = index === terms.length - 1;
+                    const headTriple = F.triple(iterHead, predFirst, term);
+                    triples.push(headTriple);
+                    // If not the last, create new iterHead, otherwise, close list
+                    if (lastInList) {
+                        const nilTriple = F.triple(iterHead, predRest, predNil);
+                        triples.push(nilTriple);
+                    }
+                    else {
+                        const tail = F.blankNode(undefined, F.sourceLocationNoMaterialize());
+                        const linkTriple = F.triple(iterHead, predRest, tail);
+                        triples.push(linkTriple);
+                        iterHead = tail;
+                    }
+                }
+                return F.tripleCollectionList(listHead, triples, F.sourceLocation(startToken, endToken));
+            });
+        },
+        gImpl: ({ SUBRULE, PRINT_WORD }) => (ast, { factory: F }) => {
+            F.printFilter(ast, () => PRINT_WORD('('));
+            // Only every 2 triple is relevant. The odd triples are linking triples.
+            for (const [idx, triple] of ast.triples.entries()) {
+                if (idx % 2 === 0) {
+                    SUBRULE(allowPaths ? graphNodePath : graphNode, triple.object, undefined);
+                }
+            }
+            F.printFilter(ast, () => PRINT_WORD(')'));
+        },
+    };
+}
+export const collection = collectionImpl('collection', false);
+export const collectionPath = collectionImpl('collectionPath', true);
+/**
+ * [[98]](https://www.w3.org/TR/sparql11-query/#rTriplesNode)
+ * [[100]](https://www.w3.org/TR/sparql11-query/#rTriplesNodePath)
+ */
+function triplesNodeImpl(name, allowPaths) {
+    return {
+        name,
+        impl: ({ SUBRULE, OR }) => () => OR([
+            { ALT: () => SUBRULE(allowPaths ? collectionPath : collection, undefined) },
+            { ALT: () => SUBRULE(allowPaths ? blankNodePropertyListPath : blankNodePropertyList, undefined) },
+        ]),
+        gImpl: ({ SUBRULE }) => ast => ast.subType === 'list' ?
+            SUBRULE(allowPaths ? collectionPath : collection, ast, undefined) :
+            SUBRULE(allowPaths ? blankNodePropertyListPath : blankNodePropertyList, ast, undefined),
+    };
+}
+export const triplesNode = triplesNodeImpl('triplesNode', false);
+export const triplesNodePath = triplesNodeImpl('triplesNodePath', true);
+/**
+ * [[99]](https://www.w3.org/TR/sparql11-query/#rBlankNodePropertyList)
+ * [[101]](https://www.w3.org/TR/sparql11-query/#rBlankNodePropertyListPath)
+ */
+function blankNodePropertyListImpl(name, allowPaths) {
+    const propertyPathNotEmptyImpl = allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty;
+    return {
+        name,
+        impl: ({ ACTION, SUBRULE, CONSUME }) => (C) => {
+            const startToken = CONSUME(l.symbols.LSquare);
+            const blankNode = ACTION(() => C.factory.blankNode(undefined, C.factory.sourceLocationNoMaterialize()));
+            const propList = SUBRULE(propertyPathNotEmptyImpl, { subject: blankNode });
+            const endToken = CONSUME(l.symbols.RSquare);
+            return ACTION(() => C.factory.tripleCollectionBlankNodeProperties(blankNode, propList, C.factory.sourceLocation(startToken, endToken)));
+        },
+        gImpl: ({ SUBRULE, PRINT, PRINT_WORD, HANDLE_LOC }) => (ast, { factory: F }) => {
+            F.printFilter(ast, () => PRINT('['));
+            for (const triple of ast.triples) {
+                HANDLE_LOC(triple, () => {
+                    if (F.isTerm(triple.predicate) && F.isTermVariable(triple.predicate)) {
+                        SUBRULE(varOrTerm, triple.predicate, undefined);
+                    }
+                    else {
+                        SUBRULE(pathGenerator, triple.predicate, undefined);
+                    }
+                    SUBRULE(graphNodePath, triple.object, undefined);
+                    F.printFilter(ast, () => PRINT_WORD(';'));
+                });
+            }
+            F.printFilter(ast, () => PRINT(']'));
+        },
+    };
+}
+export const blankNodePropertyList = blankNodePropertyListImpl('blankNodePropertyList', false);
+export const blankNodePropertyListPath = blankNodePropertyListImpl('blankNodePropertyListPath', true);
+/**
+ * [[103]](https://www.w3.org/TR/sparql11-query/#rGraphNode)
+ * [[105]](https://www.w3.org/TR/sparql11-query/#rGraphNodePath)
+ */
+function graphNodeImpl(name, allowPaths) {
+    const triplesNodeRule = allowPaths ? triplesNodePath : triplesNode;
+    return {
+        name,
+        impl: ({ SUBRULE, OR }) => C => OR([
+            { ALT: () => SUBRULE(varOrTerm, undefined) },
+            {
+                GATE: () => C.parseMode.has('canCreateBlankNodes'),
+                ALT: () => SUBRULE(triplesNodeRule, undefined),
+            },
+        ]),
+        gImpl: ({ SUBRULE }) => (ast, { factory: F }) => {
+            if (F.isTerm(ast)) {
+                SUBRULE(varOrTerm, ast, undefined);
+            }
+            else {
+                SUBRULE(triplesNodeRule, ast, undefined);
+            }
+        },
+    };
+}
+export const graphNode = graphNodeImpl('graphNode', false);
+export const graphNodePath = graphNodeImpl('graphNodePath', true);
+//# sourceMappingURL=tripleBlock.js.map

package/lib/grammar/tripleBlock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tripleBlock.js","sourceRoot":"","sources":["tripleBlock.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,KAAK,CAAC,MAAM,UAAU,CAAC;AAiB9B,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAClD,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEtD,SAAS,mBAAmB,CAAC,yBAAuE;IAElG,OAAO,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;QACnE,MAAM,OAAO,GAAsB,EAAE,CAAC;QAEtC,IAAI,SAAS,GAAG,IAAI,CAAC;QACrB,IAAI,QAA4B,CAAC;QACjC,YAAY,CAAC;YACX,IAAI,EAAE,GAAG,EAAE,CAAC,SAAS;YACrB,GAAG,EAAE,GAAG,EAAE;gBACR,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM,QAAQ,GAAG,OAAO,CAAC,yBAAyB,EAAE,SAAS,CAAC,CAAC;gBAC/D,MAAM,CAAC,GAAG,EAAE;oBACV,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;gBAC5B,CAAC,CAAC,CAAC;gBACH,MAAM,CAAC,GAAG,EAAE;oBACV,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;oBAClC,SAAS,GAAG,IAAI,CAAC;gBACnB,CAAC,CAAC,CAAC;YACL,CAAC;SACF,CAAC,CAAC;QACH,OAAO,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,GAAG,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrG,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAkD;IACzE,IAAI,EAAE,cAAc;IACpB,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;IAC1F,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;QACtE,KAAK,MAAM,CAAE,KAAK,EAAE,MAAM,CAAE,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACtD,UAAU,CAAC,MAAM,EAAE,GAAG,EAAE;gBACtB,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBACzC,IAAI,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;oBACjC,OAAO,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;oBAC1C,iGAAiG;oBACjG,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/C,CAAC;qBAAM,CAAC;oBACN,UAAU;oBACV,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;oBAClD,YAAY;oBACZ,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;wBACrE,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBAClD,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACtD,CAAC;oBACD,SAAS;oBACT,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAEjD,8GAA8G;oBAC9G,IAAI,UAAU,KAAK,SAAS,IAAI,CAAC,CAAC,kBAAkB,CAAC,UAAU,CAAC;wBAC9D,CAAC,CAAC,CAAC,6BAA6B,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC3D,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5C,CAAC;yBAAM,IAAI,CAAC,CAAC,6BAA6B,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;wBACrE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5C,CAAC;yBAAM,CAAC;wBACN,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5C,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF,CAAC;AAEF;;;;;GAKG;AACH,SAAS,sBAAsB,CAAmB,IAAO,EAAE,UAAmB;IAE5E,OAAe;QACb,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAoB;YAC5D,EAAE,GAAG,EAAE,GAAG,EAAE;oBACV,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBAC9C,MAAM,GAAG,GAAG,OAAO,CACjB,UAAU,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,oBAAoB,EAC5D,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,CAC7D,CAAC;oBACF,mEAAmE;oBACnE,OAAO,MAAM,CAAC,GAAG,EAAE;wBACjB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BACnB,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC;4BACzB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzD,CAAC;wBACD,OAAO,GAAG,CAAC;oBACb,CAAC,CAAC,CAAC;gBACL,CAAC,EAAE;YACH,EAAE,GAAG,EAAE,GAAG,EAAE;oBACV,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;oBACnF,MAAM,QAAQ,GAAG,OAAO,CACtB,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,YAAY,EAC5C,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,EAAE,CACtE,CAAC;oBACF,OAAO,MAAM,CAAC,GAAG,EAAE;wBACjB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;4BAC1B,OAAO,CAAE,WAAW,CAAE,CAAC;wBACzB,CAAC;wBACD,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC;wBAClC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;wBACrE,OAAO,QAAQ,CAAC;oBAClB,CAAC,CAAC,CAAC;gBACL,CAAC,EAAE;SACJ,CAAC;KACH,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,oBAAoB,EAAE,KAAK,CAAC,CAAC;AACtF,MAAM,CAAC,MAAM,sBAAsB,GAAG,sBAAsB,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;AAE7F;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAA6D;IACvF,IAAI,EAAE,iBAAiB;IACvB,IAAI,EAAE,mBAAmB,CAAC,kBAAkB,CAAC;CAC9C,CAAC;AAEF;;;GAGG;AACH,SAAS,gBAAgB,CAAmB,IAAO,EAAE,UAAmB;IAEtE,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CACxC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE;KACjG,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,YAAY,GAAG,gBAAgB,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;AACpE,MAAM,CAAC,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC;AAE3E,iDAAiD;AACjD,4EAA4E;AAC5E;;;GAGG;AACH,SAAS,kCAAkC,CACzC,IAAO,EACP,UAAmB;IAEnB,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YAC5E,MAAM,MAAM,GAAoB,EAAE,CAAC;YACnC,IAAI,UAAU,GAAG,IAAI,CAAC;YAEtB,YAAY,CAAC;gBACX,IAAI,EAAE,GAAG,EAAE,CAAC,UAAU;gBACtB,GAAG,EAAE,GAAG,EAAE;oBACR,UAAU,GAAG,KAAK,CAAC;oBACnB,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC;wBAC5B,GAAG,CAAsB;4BACvB,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE;4BAC5C,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE;yBAC/C,CAAC,CAAC,CAAC;wBACJ,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBAC5B,MAAM,OAAO,GAAG,QAAQ,CACtB,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EACxC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CACpD,CAAC;oBAEF,KAAK,CAAC,GAAG,EAAE;wBACT,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBACxB,UAAU,GAAG,IAAI,CAAC;oBACpB,CAAC,CAAC,CAAC;oBAEH,MAAM,CAAC,GAAG,EAAE;wBACV,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;oBAC1B,CAAC,CAAC,CAAC;gBACL,CAAC;aACF,CAAC,CAAC;YACH,OAAO,MAAM,CAAC;QAChB,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,oBAAoB,GAAG,kCAAkC,CAAC,sBAAsB,EAAE,KAAK,CAAC,CAAC;AACtG,MAAM,CAAC,MAAM,wBAAwB,GAAG,kCAAkC,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;AAE7G;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAgD;IACnE,IAAI,EAAE,UAAU;IAChB,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC;CACtD,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAA0D;IAC/E,IAAI,EAAE,YAAY;IAClB,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC;CACtD,CAAC;AAEF;;;GAGG;AACH,SAAS,cAAc,CAAmB,IAAO,EAAE,UAAmB;IAEpE,OAAe;QACb,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YAC1D,MAAM,OAAO,GAAoB,EAAE,CAAC;YACpC,gBAAgB,CAAC;gBACf,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK;gBACpB,GAAG,EAAE,GAAG,EAAE;oBACR,MAAM,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;oBACpE,MAAM,CAAC,GAAG,EAAE;wBACV,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC7B,CAAC,CAAC,CAAC;gBACL,CAAC;aACF,CAAC,CAAC;YACH,OAAO,OAAO,CAAC;QACjB,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;AAC9D,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;AAErE;;;GAGG;AACH,SAAS,UAAU,CAAmB,IAAO,EAAE,UAAmB;IAEhE,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YACxC,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxE,OAAO,MAAM,CAAC,GAAG,EAAE,CACjB,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;QACxD,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAClD,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AAEzD;;;GAGG;AACH,SAAS,cAAc,CAAmB,IAAO,EAAE,UAAmB;IACpE,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1D,qEAAqE;YACrE,qFAAqF;YACrF,MAAM,KAAK,GAAgB,EAAE,CAAC;YAE9B,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAE7C,YAAY,CAAC,GAAG,EAAE;gBAChB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;YACzE,CAAC,CAAC,CAAC;YACH,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAE3C,OAAO,MAAM,CAAC,GAAG,EAAE;gBACjB,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBACpB,MAAM,OAAO,GAAoB,EAAE,CAAC;gBACpC,wCAAwC;gBACxC,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,2BAA2B,EAAE,EAAE,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAC5F,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,2BAA2B,EAAE,EAAE,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAC1F,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,2BAA2B,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;gBAExF,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,2BAA2B,EAAE,CAAC,CAAC;gBACzE,IAAI,QAAQ,GAA4B,QAAQ,CAAC;gBACjD,KAAK,MAAM,CAAE,KAAK,EAAE,IAAI,CAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC9C,MAAM,UAAU,GAAG,KAAK,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;oBAE9C,MAAM,UAAU,GAAkB,CAAC,CAAC,MAAM,CACxC,QAAQ,EACR,SAAS,EACT,IAAI,CACL,CAAC;oBACF,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAEzB,8DAA8D;oBAC9D,IAAI,UAAU,EAAE,CAAC;wBACf,MAAM,SAAS,GAAkB,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;wBACvE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC1B,CAAC;yBAAM,CAAC;wBACN,MAAM,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,2BAA2B,EAAE,CAAC,CAAC;wBACrE,MAAM,UAAU,GAAkB,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;wBACrE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBACzB,QAAQ,GAAG,IAAI,CAAC;oBAClB,CAAC;gBACH,CAAC;gBACD,OAAO,CAAC,CAAC,oBAAoB,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC3F,CAAC,CAAC,CAAC;QACL,CAAC;QACD,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;YAC1D,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,wEAAwE;YACxE,KAAK,MAAM,CAAE,GAAG,EAAE,MAAM,CAAE,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpD,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClB,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC5E,CAAC;YACH,CAAC;YACD,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;AAC9D,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;AAErE;;;GAGG;AACH,SAAS,eAAe,CAAmB,IAAO,EAAE,UAAmB;IACrE,OAAc;QACZ,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAmB;YACpD,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE;YAC3E,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,qBAAqB,EAAE,SAAS,CAAC,EAAE;SAClG,CAAC;QACF,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;YACrD,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;YACnE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,qBAAqB,EAAE,GAAG,EAAE,SAAS,CAAC;KAC1F,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,WAAW,GAAG,eAAe,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,eAAe,GAAG,eAAe,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;AAExE;;;GAGG;AACH,SAAS,yBAAyB,CAAmB,IAAO,EAAE,UAAmB;IAE/E,MAAM,wBAAwB,GAAG,UAAU,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,oBAAoB,CAAC;IAC9F,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;YAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAE9C,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,EAAE,CAC5B,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,2BAA2B,EAAE,CAAC,CAAC,CAAC;YAE3E,MAAM,QAAQ,GAAG,OAAO,CAAC,wBAAwB,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YAC3E,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAE5C,OAAO,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,mCAAmC,CAC/D,SAAS,EACT,QAAQ,EACR,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,CAC/C,CAAC,CAAC;QACL,CAAC;QACD,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;YAC7E,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrC,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;gBACjC,UAAU,CAAC,MAAM,EAAE,GAAG,EAAE;oBACtB,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;wBACrE,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBAClD,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACtD,CAAC;oBACD,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAEjD,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5C,CAAC,CAAC,CAAC;YACL,CAAC;YACD,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,qBAAqB,GAAG,yBAAyB,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;AAC/F,MAAM,CAAC,MAAM,yBAAyB,GAAG,yBAAyB,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;AAEtG;;;GAGG;AACH,SAAS,aAAa,CAAmB,IAAO,EAAE,UAAmB;IACnE,MAAM,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,WAAW,CAAC;IACnE,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAA0B;YAC1D,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE;YAC5C;gBACE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,qBAAqB,CAAC;gBAClD,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,eAAe,EAAE,SAAS,CAAC;aAC/C;SACF,CAAC;QACF,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;YAC9C,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClB,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AACD,MAAM,CAAC,MAAM,SAAS,GAAG,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;AAC3D,MAAM,CAAC,MAAM,aAAa,GAAG,aAAa,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC","sourcesContent":["import type { IToken } from 'chevrotain';\nimport { CommonIRIs } from '../grammar-helpers/utils';\nimport * as l from '../lexer';\nimport type {\n  BasicGraphPattern,\n  GraphNode,\n  Path,\n  PatternBgp,\n  Term,\n  TermVariable,\n  TripleCollection,\n  TripleCollectionBlankNodeProperties,\n  TripleCollectionList,\n  TripleNesting,\n} from '../RoundTripTypes';\nimport type {\n  SparqlGrammarRule,\n  SparqlRule,\n} from '../Sparql11types';\nimport { var_, varOrTerm, verb } from './general';\nimport { path, pathGenerator } from './propertyPaths';\n\nfunction triplesDotSeperated(triplesSameSubjectSubrule: SparqlGrammarRule<string, BasicGraphPattern>):\nSparqlGrammarRule<string, PatternBgp>['impl'] {\n  return ({ ACTION, AT_LEAST_ONE, SUBRULE, CONSUME, OPTION }) => (C) => {\n    const triples: BasicGraphPattern = [];\n\n    let parsedDot = true;\n    let dotToken: undefined | IToken;\n    AT_LEAST_ONE({\n      GATE: () => parsedDot,\n      DEF: () => {\n        parsedDot = false;\n        const template = SUBRULE(triplesSameSubjectSubrule, undefined);\n        ACTION(() => {\n          triples.push(...template);\n        });\n        OPTION(() => {\n          dotToken = CONSUME(l.symbols.dot);\n          parsedDot = true;\n        });\n      },\n    });\n    return ACTION(() => C.factory.patternBgp(triples, C.factory.sourceLocation(...triples, dotToken)));\n  };\n}\n\n/**\n * [[55]](https://www.w3.org/TR/sparql11-query/#rTriplesBlock)\n */\nexport const triplesBlock: SparqlRule<'triplesBlock', PatternBgp> = <const>{\n  name: 'triplesBlock',\n  impl: implArgs => C => triplesDotSeperated(triplesSameSubjectPath)(implArgs)(C, undefined),\n  gImpl: ({ SUBRULE, PRINT_WORD, HANDLE_LOC }) => (ast, { factory: F }) => {\n    for (const [ index, triple ] of ast.triples.entries()) {\n      HANDLE_LOC(triple, () => {\n        const nextTriple = ast.triples.at(index);\n        if (F.isTripleCollection(triple)) {\n          SUBRULE(graphNodePath, triple, undefined);\n          // A top level tripleCollection block means that it is not used in a triple. So you end with DOT.\n          F.printFilter(triple, () => PRINT_WORD('.'));\n        } else {\n          // Subject\n          SUBRULE(graphNodePath, triple.subject, undefined);\n          // Predicate\n          if (F.isTerm(triple.predicate) && F.isTermVariable(triple.predicate)) {\n            SUBRULE(varOrTerm, triple.predicate, undefined);\n          } else {\n            SUBRULE(pathGenerator, triple.predicate, undefined);\n          }\n          // Object\n          SUBRULE(graphNodePath, triple.object, undefined);\n\n          // If no more things, or a top level collection (only possible if new block was part), or new subject: add DOT\n          if (nextTriple === undefined || F.isTripleCollection(nextTriple) ||\n            !F.isSourceLocationNoMaterialize(nextTriple.subject.loc)) {\n            F.printFilter(ast, () => PRINT_WORD('.'));\n          } else if (F.isSourceLocationNoMaterialize(nextTriple.predicate.loc)) {\n            F.printFilter(ast, () => PRINT_WORD(','));\n          } else {\n            F.printFilter(ast, () => PRINT_WORD(';'));\n          }\n        }\n      });\n    }\n  },\n};\n\n/**\n * [[75]](https://www.w3.org/TR/sparql11-query/#rTriplesSameSubject)\n * [[81]](https://www.w3.org/TR/sparql11-query/#rTriplesSameSubjectPath)\n * CONTRACT: triples generated from the subject come first, then comes the main triple,\n *  and then come the triples from the object. Only the first occurrence of a term has `SourceLocationType = source`\n */\nfunction triplesSameSubjectImpl<T extends string>(name: T, allowPaths: boolean):\nSparqlGrammarRule<T, BasicGraphPattern> {\n  return <const> {\n    name,\n    impl: ({ ACTION, SUBRULE, OR }) => C => OR<BasicGraphPattern>([\n      { ALT: () => {\n        const subject = SUBRULE(varOrTerm, undefined);\n        const res = SUBRULE(\n          allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty,\n          { subject: ACTION(() => C.factory.dematerialized(subject)) },\n        );\n        // Only the first occurrence of a subject is actually materialized.\n        return ACTION(() => {\n          if (res.length > 0) {\n            res[0].subject = subject;\n            res[0].loc = C.factory.sourceLocation(subject, res[0]);\n          }\n          return res;\n        });\n      } },\n      { ALT: () => {\n        const subjectNode = SUBRULE(allowPaths ? triplesNodePath : triplesNode, undefined);\n        const restNode = SUBRULE(\n          allowPaths ? propertyListPath : propertyList,\n          { subject: ACTION(() => C.factory.graphNodeIdentifier(subjectNode)) },\n        );\n        return ACTION(() => {\n          if (restNode.length === 0) {\n            return [ subjectNode ];\n          }\n          restNode[0].subject = subjectNode;\n          restNode[0].loc = C.factory.sourceLocation(subjectNode, restNode[0]);\n          return restNode;\n        });\n      } },\n    ]),\n  };\n}\nexport const triplesSameSubject = triplesSameSubjectImpl('triplesSameSubject', false);\nexport const triplesSameSubjectPath = triplesSameSubjectImpl('triplesSameSubjectPath', true);\n\n/**\n * [[52]](https://www.w3.org/TR/sparql11-query/#rTriplesTemplate)\n */\nexport const triplesTemplate: SparqlGrammarRule<'triplesTemplate', PatternBgp> = <const> {\n  name: 'triplesTemplate',\n  impl: triplesDotSeperated(triplesSameSubject),\n};\n\n/**\n * [[76]](https://www.w3.org/TR/sparql11-query/#rPropertyList)\n * [[82]](https://www.w3.org/TR/sparql11-query/#rPropertyListPath)\n */\nfunction propertyListImpl<T extends string>(name: T, allowPaths: boolean):\nSparqlGrammarRule<T, TripleNesting[], Pick<TripleNesting, 'subject'>> {\n  return {\n    name,\n    impl: ({ SUBRULE, OPTION }) => (_, arg) =>\n      OPTION(() => SUBRULE(allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty, arg)) ?? [],\n  };\n}\nexport const propertyList = propertyListImpl('propertyList', false);\nexport const propertyListPath = propertyListImpl('propertyListPath', true);\n\n// We could use gates for this, but in that case,\n// a grammar not in need of paths would still have to include the path rules\n/**\n * [[77]](https://www.w3.org/TR/sparql11-query/#rPropertyListNotEmpty)\n * [[83]](https://www.w3.org/TR/sparql11-query/#rPropertyListPathNotEmpty)\n */\nfunction propertyListNotEmptyImplementation<T extends string>(\n  name: T,\n  allowPaths: boolean,\n): SparqlGrammarRule<T, TripleNesting[], Pick<TripleNesting, 'subject'>> {\n  return {\n    name,\n    impl: ({ ACTION, CONSUME, AT_LEAST_ONE, SUBRULE1, MANY2, OR1 }) => (_, arg) => {\n      const result: TripleNesting[] = [];\n      let parsedSemi = true;\n\n      AT_LEAST_ONE({\n        GATE: () => parsedSemi,\n        DEF: () => {\n          parsedSemi = false;\n          const predicate = allowPaths ?\n            OR1<TermVariable | Path>([\n              { ALT: () => SUBRULE1(verbPath, undefined) },\n              { ALT: () => SUBRULE1(verbSimple, undefined) },\n            ]) :\n            SUBRULE1(verb, undefined);\n          const triples = SUBRULE1(\n            allowPaths ? objectListPath : objectList,\n            ACTION(() => ({ subject: arg.subject, predicate })),\n          );\n\n          MANY2(() => {\n            CONSUME(l.symbols.semi);\n            parsedSemi = true;\n          });\n\n          ACTION(() => {\n            result.push(...triples);\n          });\n        },\n      });\n      return result;\n    },\n  };\n}\nexport const propertyListNotEmpty = propertyListNotEmptyImplementation('propertyListNotEmpty', false);\nexport const propertyListPathNotEmpty = propertyListNotEmptyImplementation('propertyListPathNotEmpty', true);\n\n/**\n * [[84]](https://www.w3.org/TR/sparql11-query/#rVerbPath)\n */\nexport const verbPath: SparqlGrammarRule<'verbPath', Path> = <const> {\n  name: 'verbPath',\n  impl: ({ SUBRULE }) => () => SUBRULE(path, undefined),\n};\n\n/**\n * [[85]](https://www.w3.org/TR/sparql11-query/#rVerbSimple)\n */\nexport const verbSimple: SparqlGrammarRule<'verbSimple', TermVariable> = <const> {\n  name: 'verbSimple',\n  impl: ({ SUBRULE }) => () => SUBRULE(var_, undefined),\n};\n\n/**\n * [[79]](https://www.w3.org/TR/sparql11-query/#rObjectList)\n * [[86]](https://www.w3.org/TR/sparql11-query/#rObjectListPath)\n */\nfunction objectListImpl<T extends string>(name: T, allowPaths: boolean):\nSparqlGrammarRule<T, TripleNesting[], Pick<TripleNesting, 'subject' | 'predicate'>> {\n  return <const> {\n    name,\n    impl: ({ ACTION, SUBRULE, AT_LEAST_ONE_SEP }) => (_, arg) => {\n      const objects: TripleNesting[] = [];\n      AT_LEAST_ONE_SEP({\n        SEP: l.symbols.comma,\n        DEF: () => {\n          const objectTriple = SUBRULE(allowPaths ? objectPath : object, arg);\n          ACTION(() => {\n            objects.push(objectTriple);\n          });\n        },\n      });\n      return objects;\n    },\n  };\n}\nexport const objectList = objectListImpl('objectList', false);\nexport const objectListPath = objectListImpl('objectListPath', true);\n\n/**\n * [[80]](https://www.w3.org/TR/sparql11-query/#rObject)\n * [[87]](https://www.w3.org/TR/sparql11-query/#rObjectPath)\n */\nfunction objectImpl<T extends string>(name: T, allowPaths: boolean):\nSparqlGrammarRule<T, TripleNesting, Pick<TripleNesting, 'subject' | 'predicate'>> {\n  return {\n    name,\n    impl: ({ ACTION, SUBRULE }) => (C, arg) => {\n      const node = SUBRULE(allowPaths ? graphNodePath : graphNode, undefined);\n      return ACTION(() =>\n        C.factory.triple(arg.subject, arg.predicate, node));\n    },\n  };\n}\nexport const object = objectImpl('object', false);\nexport const objectPath = objectImpl('objectPath', true);\n\n/**\n * [[102]](https://www.w3.org/TR/sparql11-query/#rCollection)\n * [[103]](https://www.w3.org/TR/sparql11-query/#rCollectionPath)\n */\nfunction collectionImpl<T extends string>(name: T, allowPaths: boolean): SparqlRule<T, TripleCollectionList> {\n  return {\n    name,\n    impl: ({ ACTION, AT_LEAST_ONE, SUBRULE, CONSUME }) => (C) => {\n      // Construct a [cons list](https://en.wikipedia.org/wiki/Cons#Lists),\n      // here called a [RDF collection](https://www.w3.org/TR/sparql11-query/#collections).\n      const terms: GraphNode[] = [];\n\n      const startToken = CONSUME(l.symbols.LParen);\n\n      AT_LEAST_ONE(() => {\n        terms.push(SUBRULE(allowPaths ? graphNodePath : graphNode, undefined));\n      });\n      const endToken = CONSUME(l.symbols.RParen);\n\n      return ACTION(() => {\n        const F = C.factory;\n        const triples: TripleNesting[] = [];\n        // The triples created in your recursion\n        const predFirst = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.FIRST, undefined);\n        const predRest = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.REST, undefined);\n        const predNil = F.namedNode(F.sourceLocationNoMaterialize(), CommonIRIs.NIL, undefined);\n\n        const listHead = F.blankNode(undefined, F.sourceLocationNoMaterialize());\n        let iterHead: TripleNesting['object'] = listHead;\n        for (const [ index, term ] of terms.entries()) {\n          const lastInList = index === terms.length - 1;\n\n          const headTriple: TripleNesting = F.triple(\n            iterHead,\n            predFirst,\n            term,\n          );\n          triples.push(headTriple);\n\n          // If not the last, create new iterHead, otherwise, close list\n          if (lastInList) {\n            const nilTriple: TripleNesting = F.triple(iterHead, predRest, predNil);\n            triples.push(nilTriple);\n          } else {\n            const tail = F.blankNode(undefined, F.sourceLocationNoMaterialize());\n            const linkTriple: TripleNesting = F.triple(iterHead, predRest, tail);\n            triples.push(linkTriple);\n            iterHead = tail;\n          }\n        }\n        return F.tripleCollectionList(listHead, triples, F.sourceLocation(startToken, endToken));\n      });\n    },\n    gImpl: ({ SUBRULE, PRINT_WORD }) => (ast, { factory: F }) => {\n      F.printFilter(ast, () => PRINT_WORD('('));\n      // Only every 2 triple is relevant. The odd triples are linking triples.\n      for (const [ idx, triple ] of ast.triples.entries()) {\n        if (idx % 2 === 0) {\n          SUBRULE(allowPaths ? graphNodePath : graphNode, triple.object, undefined);\n        }\n      }\n      F.printFilter(ast, () => PRINT_WORD(')'));\n    },\n  };\n}\nexport const collection = collectionImpl('collection', false);\nexport const collectionPath = collectionImpl('collectionPath', true);\n\n/**\n * [[98]](https://www.w3.org/TR/sparql11-query/#rTriplesNode)\n * [[100]](https://www.w3.org/TR/sparql11-query/#rTriplesNodePath)\n */\nfunction triplesNodeImpl<T extends string>(name: T, allowPaths: boolean): SparqlRule<T, TripleCollection> {\n  return <const>{\n    name,\n    impl: ({ SUBRULE, OR }) => () => OR<TripleCollection>([\n      { ALT: () => SUBRULE(allowPaths ? collectionPath : collection, undefined) },\n      { ALT: () => SUBRULE(allowPaths ? blankNodePropertyListPath : blankNodePropertyList, undefined) },\n    ]),\n    gImpl: ({ SUBRULE }) => ast => ast.subType === 'list' ?\n      SUBRULE(allowPaths ? collectionPath : collection, ast, undefined) :\n      SUBRULE(allowPaths ? blankNodePropertyListPath : blankNodePropertyList, ast, undefined),\n  };\n}\nexport const triplesNode = triplesNodeImpl('triplesNode', false);\nexport const triplesNodePath = triplesNodeImpl('triplesNodePath', true);\n\n/**\n * [[99]](https://www.w3.org/TR/sparql11-query/#rBlankNodePropertyList)\n * [[101]](https://www.w3.org/TR/sparql11-query/#rBlankNodePropertyListPath)\n */\nfunction blankNodePropertyListImpl<T extends string>(name: T, allowPaths: boolean):\nSparqlRule<T, TripleCollectionBlankNodeProperties> {\n  const propertyPathNotEmptyImpl = allowPaths ? propertyListPathNotEmpty : propertyListNotEmpty;\n  return {\n    name,\n    impl: ({ ACTION, SUBRULE, CONSUME }) => (C) => {\n      const startToken = CONSUME(l.symbols.LSquare);\n\n      const blankNode = ACTION(() =>\n        C.factory.blankNode(undefined, C.factory.sourceLocationNoMaterialize()));\n\n      const propList = SUBRULE(propertyPathNotEmptyImpl, { subject: blankNode });\n      const endToken = CONSUME(l.symbols.RSquare);\n\n      return ACTION(() => C.factory.tripleCollectionBlankNodeProperties(\n        blankNode,\n        propList,\n        C.factory.sourceLocation(startToken, endToken),\n      ));\n    },\n    gImpl: ({ SUBRULE, PRINT, PRINT_WORD, HANDLE_LOC }) => (ast, { factory: F }) => {\n      F.printFilter(ast, () => PRINT('['));\n      for (const triple of ast.triples) {\n        HANDLE_LOC(triple, () => {\n          if (F.isTerm(triple.predicate) && F.isTermVariable(triple.predicate)) {\n            SUBRULE(varOrTerm, triple.predicate, undefined);\n          } else {\n            SUBRULE(pathGenerator, triple.predicate, undefined);\n          }\n          SUBRULE(graphNodePath, triple.object, undefined);\n\n          F.printFilter(ast, () => PRINT_WORD(';'));\n        });\n      }\n      F.printFilter(ast, () => PRINT(']'));\n    },\n  };\n}\nexport const blankNodePropertyList = blankNodePropertyListImpl('blankNodePropertyList', false);\nexport const blankNodePropertyListPath = blankNodePropertyListImpl('blankNodePropertyListPath', true);\n\n/**\n * [[103]](https://www.w3.org/TR/sparql11-query/#rGraphNode)\n * [[105]](https://www.w3.org/TR/sparql11-query/#rGraphNodePath)\n */\nfunction graphNodeImpl<T extends string>(name: T, allowPaths: boolean): SparqlRule<T, Term | TripleCollection> {\n  const triplesNodeRule = allowPaths ? triplesNodePath : triplesNode;\n  return {\n    name,\n    impl: ({ SUBRULE, OR }) => C => OR<Term | TripleCollection>([\n      { ALT: () => SUBRULE(varOrTerm, undefined) },\n      {\n        GATE: () => C.parseMode.has('canCreateBlankNodes'),\n        ALT: () => SUBRULE(triplesNodeRule, undefined),\n      },\n    ]),\n    gImpl: ({ SUBRULE }) => (ast, { factory: F }) => {\n      if (F.isTerm(ast)) {\n        SUBRULE(varOrTerm, ast, undefined);\n      } else {\n        SUBRULE(triplesNodeRule, ast, undefined);\n      }\n    },\n  };\n}\nexport const graphNode = graphNodeImpl('graphNode', false);\nexport const graphNodePath = graphNodeImpl('graphNodePath', true);\n"]}

package/lib/grammar/updateUnit/updateUnit.d.ts

@@ -0,0 +1,95 @@
+import type { Wrap } from '@traqula/core';
+import type { GraphQuads, GraphRef, GraphRefDefault, GraphRefSpecific, Quads, Update, UpdateOperation, UpdateOperationAdd, UpdateOperationClear, UpdateOperationCopy, UpdateOperationCreate, UpdateOperationDeleteData, UpdateOperationDeleteWhere, UpdateOperationDrop, UpdateOperationInsertData, UpdateOperationLoad, UpdateOperationModify, UpdateOperationMove } from '../../RoundTripTypes';
+import type { SparqlGrammarRule, SparqlRule } from '../../Sparql11types';
+/**
+ * [[3]](https://www.w3.org/TR/sparql11-query/#rUpdateUnit)
+ */
+export declare const updateUnit: SparqlGrammarRule<'updateUnit', Update>;
+/**
+ * [[29]](https://www.w3.org/TR/sparql11-query/#rUpdate)
+ */
+export declare const update: SparqlRule<'update', Update>;
+/**
+ * [[30]](https://www.w3.org/TR/sparql11-query/#rUpdate1)
+ */
+export declare const update1: SparqlRule<'update1', UpdateOperation>;
+/**
+ * [[31]](https://www.w3.org/TR/sparql11-query/#rLoad)
+ */
+export declare const load: SparqlRule<'load', UpdateOperationLoad>;
+/**
+ * [[32]](https://www.w3.org/TR/sparql11-query/#rClear)
+ */
+export declare const clear: SparqlRule<"clear", UpdateOperationClear | UpdateOperationDrop>;
+/**
+ * [[33]](https://www.w3.org/TR/sparql11-query/#rDrop)
+ */
+export declare const drop: SparqlRule<"drop", UpdateOperationClear | UpdateOperationDrop>;
+/**
+ * [[34]](https://www.w3.org/TR/sparql11-query/#rCreate)
+ */
+export declare const create: SparqlRule<'create', UpdateOperationCreate>;
+/**
+ * [[35]](https://www.w3.org/TR/sparql11-query/#rAdd)
+ */
+export declare const add: SparqlRule<"add", UpdateOperationAdd | UpdateOperationMove | UpdateOperationCopy>;
+/**
+ * [[36]](https://www.w3.org/TR/sparql11-query/#rMove)
+ */
+export declare const move: SparqlRule<"move", UpdateOperationAdd | UpdateOperationMove | UpdateOperationCopy>;
+/**
+ * [[37]](https://www.w3.org/TR/sparql11-query/#rCopy)
+ */
+export declare const copy: SparqlRule<"copy", UpdateOperationAdd | UpdateOperationMove | UpdateOperationCopy>;
+/**
+ * [[48]](https://www.w3.org/TR/sparql11-query/#rQuadPattern)
+ */
+export declare const quadPattern: SparqlGrammarRule<'quadPattern', Wrap<Quads[]>>;
+/**
+ * [[49]](https://www.w3.org/TR/sparql11-query/#rQuadData)
+ */
+export declare const quadData: SparqlGrammarRule<'quadData', Wrap<Quads[]>>;
+/**
+ * [[38]](https://www.w3.org/TR/sparql11-query/#rInsertData)
+ */
+export declare const insertData: SparqlRule<"insertData", UpdateOperationInsertData | UpdateOperationDeleteData | UpdateOperationDeleteWhere>;
+/**
+ * [[39]](https://www.w3.org/TR/sparql11-query/#rDeleteData)
+ */
+export declare const deleteData: SparqlRule<"deleteData", UpdateOperationInsertData | UpdateOperationDeleteData | UpdateOperationDeleteWhere>;
+/**
+ * [[40]](https://www.w3.org/TR/sparql11-query/#rDeleteWhere)
+ */
+export declare const deleteWhere: SparqlRule<"deleteWhere", UpdateOperationInsertData | UpdateOperationDeleteData | UpdateOperationDeleteWhere>;
+/**
+ * [[41]](https://www.w3.org/TR/sparql11-query/#rModify)
+ */
+export declare const modify: SparqlRule<'modify', UpdateOperationModify>;
+/**
+ * [[42]](https://www.w3.org/TR/sparql11-query/#rDeleteClause)
+ */
+export declare const deleteClause: SparqlGrammarRule<'deleteClause', Wrap<Quads[]>>;
+/**
+ * [[43]](https://www.w3.org/TR/sparql11-query/#rInsertClause)
+ */
+export declare const insertClause: SparqlGrammarRule<'insertClause', Wrap<Quads[]>>;
+/**
+ * [[45]](https://www.w3.org/TR/sparql11-query/#rGraphOrDefault)
+ */
+export declare const graphOrDefault: SparqlGrammarRule<'graphOrDefault', GraphRefDefault | GraphRefSpecific>;
+/**
+ * [[46]](https://www.w3.org/TR/sparql11-query/#rGraphRef)
+ */
+export declare const graphRef: SparqlRule<'graphRef', GraphRefSpecific>;
+/**
+ * [[47]](https://www.w3.org/TR/sparql11-query/#rGraphRefAll)
+ */
+export declare const graphRefAll: SparqlRule<'graphRefAll', GraphRef>;
+/**
+ * [[50]](https://www.w3.org/TR/sparql11-query/#rQuads)
+ */
+export declare const quads: SparqlRule<'quads', Wrap<Quads[]>>;
+/**
+ * [[51]](https://www.w3.org/TR/sparql11-query/#rQuadsNotTriples)
+ */
+export declare const quadsNotTriples: SparqlRule<'quadsNotTriples', GraphQuads>;