@thomasfosterau/effect-rdf 0.0.0 → 0.1.0

package/dist/N3-BzyV-KIH.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"N3-BzyV-KIH.mjs","names":["TurtleGrammar.alpha","TurtleGrammar.pnPrefix","TurtleGrammar.iriRef","TurtleGrammar.prefixedName","TurtleGrammar.pnLocal","Term.literal","TurtleGrammar.numericLiteral","TurtleGrammar.stringLiteral","TurtleGrammar.langTag","TurtleGrammar.pnCharsU","TurtleGrammar.pnChars","Model.Collection","Model.Formula","Term.Variable","Term.NamedNode","Iri.resolve","Model.Statement","Term.BlankNode","parse","PrefixMap.make","Term.escapeIri","Guards.isBlankNode","Model.Collection","Model.Formula","Guards.isNamedNode","Guards.isLiteral","Guards.isVariable","compact","PrefixMap.compact","Iri.relativize","Term.escapeString","Serialization.makeFormat","Parser.parse","Serialization.freshBlankNodePrefix","Parser.SyntaxFailure","Serialization.RdfParseError","Mapping.toDataset","Serialization.withParseSpan","Serialization.makeParser","isFormula","Model.isFormula","Writer.write","PrefixMap.empty","Mapping.fromDataset","Serialization.RdfSerializeError","Serialization.withSerializeSpan","Serialization.makeSerializer","Serialization.makeCodec"],"sources":["../src/n3/internal/parser.ts","../src/n3/internal/writer.ts","../src/n3/N3.ts"],"sourcesContent":["/**\n * The Notation3 parser: a compiled `@thomasfosterau/effect-parse` grammar\n * over the input string (no separate lexer), built on the Turtle terminals of\n * `/turtle` (`Grammar`), as the N3 grammar is: N3 extends Turtle with\n * formulas, paths, quick variables, `=`, `=>`, `<=`, `has`, `is … of` and the\n * legacy `@forAll` / `@forSome`.\n *\n * The grammar's callbacks build the model as it reads, with no syntax tree:\n * a `Builder` holds what depends on what came before (`@prefix` / `@base`,\n * quantifier scopes, blank node allocation, the open formulas and the\n * subjects being described), and statements are made in document order.\n * Side effects run in `tap`s and zero-width `Parser.make`s, never in a `map`\n * whose value is unused (the compiler skips those). An error the builder\n * finds is kept and reported once the whole document has been read, so a\n * syntax error anywhere takes precedence, as when the model was built from a\n * tree after parsing.\n *\n * @internal\n */\nimport * as Ascii from '@thomasfosterau/effect-parse/Ascii';\nimport * as Compiler from '@thomasfosterau/effect-parse/Compiler';\nimport * as Parser from '@thomasfosterau/effect-parse/Parser';\nimport * as Token from '@thomasfosterau/effect-parse/Token';\nimport * as TurtleGrammar from '../../turtle/Grammar.ts';\nimport * as Iri from '../../Iri.ts';\nimport * as PrefixMap from '../../PrefixMap.ts';\nimport * as Term from '../../Term.ts';\nimport { rdf, xsd } from '../../Vocab.ts';\nimport * as Arr from 'effect/Array';\nimport * as Iterable from 'effect/Iterable';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Result from 'effect/Result';\nimport * as Model from '../Model.ts';\nimport { i18n, log, sameAs } from '../Vocab.ts';\nimport { loop } from './loop.ts';\n\n/** @internal */\nexport class SyntaxFailure {\n  readonly message: string;\n  readonly line: number;\n  readonly column: number;\n  constructor(message: string, line: number, column: number) {\n    this.message = message;\n    this.line = line;\n    this.column = column;\n  }\n}\n\n/** @internal */\nexport interface ParserOptions {\n  readonly baseIri: Option.Option<string>;\n  readonly blankNodePrefix: string;\n}\n\n// -----------------------------------------------------------------------------\n// Character classes (also used by the writer)\n// -----------------------------------------------------------------------------\n\n/** @internal */\nexport const isPnCharsBase = (c: number): boolean =>\n  (c >= 0x41 && c <= 0x5a) ||\n  (c >= 0x61 && c <= 0x7a) ||\n  (c >= 0xc0 && c <= 0xd6) ||\n  (c >= 0xd8 && c <= 0xf6) ||\n  (c >= 0xf8 && c <= 0x2ff) ||\n  (c >= 0x370 && c <= 0x37d) ||\n  (c >= 0x37f && c <= 0x1fff) ||\n  (c >= 0x200c && c <= 0x200d) ||\n  (c >= 0x2070 && c <= 0x218f) ||\n  (c >= 0x2c00 && c <= 0x2fef) ||\n  (c >= 0x3001 && c <= 0xd7ff) ||\n  (c >= 0xf900 && c <= 0xfdcf) ||\n  (c >= 0xfdf0 && c <= 0xfffd) ||\n  (c >= 0x10000 && c <= 0xeffff);\n\n/** @internal */\nexport const isPnCharsU = (c: number): boolean => c === 0x5f || isPnCharsBase(c);\n\n/** @internal */\nexport const isPnChars = (c: number): boolean =>\n  isPnCharsU(c) ||\n  c === 0x2d ||\n  (c >= 0x30 && c <= 0x39) ||\n  c === 0xb7 ||\n  (c >= 0x300 && c <= 0x36f) ||\n  (c >= 0x203f && c <= 0x2040);\n\n// -----------------------------------------------------------------------------\n// IRIs as written\n// -----------------------------------------------------------------------------\n\n/** An IRI as written: an IRI reference or a prefixed name, at an offset. */\ntype IriNode =\n  | {\n      readonly _tag: 'IriRef';\n      readonly value: string;\n      readonly at: number;\n      /** Whether the reference contains `UCHAR` escapes. */\n      readonly escaped: boolean;\n    }\n  | {\n      readonly _tag: 'PName';\n      readonly prefix: string;\n      readonly local: string;\n      readonly at: number;\n    };\n\n// -----------------------------------------------------------------------------\n// Grammar\n// -----------------------------------------------------------------------------\n\n/** A syntax error with its offset (the cause of a grammar failure). */\ninterface Fail {\n  readonly message: string;\n  readonly at: number;\n}\n\ntype P<A> = Parser.Parser<A, Fail>;\n\nconst fail = <A>(message: string, at: number): Result.Result<A, Fail> =>\n  Result.fail({ message, at });\n\nconst WHITESPACE = 'whitespace';\n\n/** Whitespace and `#` comments (which also end at a form feed). */\nconst ws: P<void> = Parser.asVoid(\n  Parser.repeat(\n    Parser.alt(\n      Token.takeWhile(' \\t\\r\\n', { min: 1 }),\n      Parser.preceded(Token.literal('#'), Token.takeTill('\\n\\r\\f')),\n    ).pipe(Parser.expected(WHITESPACE)),\n  ),\n);\n\nconst lit = (s: string): P<string> => Token.literal(s);\n\nconst closeBracket: P<string> = Parser.cut(Parser.preceded(ws, Token.literal(']'))).pipe(\n  Parser.expected(\"']'\"),\n);\n\n/** `s` after whitespace. */\nconst sym = (s: string): P<string> => Parser.preceded(ws, Token.literal(s));\n\n/** A character that ends a statement, a list of objects or a formula. */\nconst endOf = (chars: string): P<unknown> =>\n  Parser.preceded(ws, Parser.alt(Parser.eof, Parser.peek(Token.oneOf(chars))));\n\n/** An `@` keyword: `@` followed by letters. */\nconst atWord: P<string> = Parser.taken(\n  Parser.preceded(lit('@'), Token.takeWhile(TurtleGrammar.alpha, { min: 1 })),\n);\n\nconst atKeyword = (word: string): P<string> => atWord.pipe(Parser.filter((w) => w === word));\n\n/** A `PN_PREFIX` not followed by `:` (a bare word such as `a`, `is`, `true`). */\nconst bareWord: P<string> = Parser.terminated(TurtleGrammar.pnPrefix, Parser.not(lit(':')));\n\n/**\n * The bare word `w`, checked by its first character before the word is\n * read, so that the names tried as keywords on the way to a path are not\n * each scanned as a word first.\n */\nconst word = (w: string): P<string> =>\n  Parser.preceded(Parser.peek(lit(w.slice(0, 1))), bareWord.pipe(Parser.filter((x) => x === w)));\n\n// eslint-disable-next-line no-control-regex\nconst forbiddenInIri = /[\\u0000- <>\"{}|^`\\\\]/u;\n\n/** IRIREF (escapes of characters not allowed in IRIs are rejected by the builder). */\nconst iriRef: P<IriNode> = Parser.seq(Parser.location, TurtleGrammar.iriRef, Parser.location).pipe(\n  Parser.map(([at, value, end]): IriNode => ({\n    _tag: 'IriRef',\n    value,\n    at,\n    escaped: end - at - 2 !== value.length,\n  })),\n);\n\nconst pname: P<IriNode> = Parser.seq(Parser.location, TurtleGrammar.prefixedName).pipe(\n  Parser.map(([at, { prefix, local }]): IriNode => ({ _tag: 'PName', prefix, local, at })),\n);\n\n/** Records the offset at which a term starts (`b.at`), for its errors. */\nconst mark: P<void> = Parser.make<void>((state) => {\n  b.at = state.pos;\n  return undefined;\n});\n\n/** Records the offset at which an IRI reference ends (`b.end`). */\nconst markEnd: P<void> = Parser.make<void>((state) => {\n  b.end = state.pos;\n  return undefined;\n});\n\n/** An IRI reference as a term, made without an intermediate `IriNode`. */\nconst iriRefTerm: P<Model.N3Term> = Parser.delimited(mark, TurtleGrammar.iriRef, markEnd).pipe(\n  Parser.map((value) => b.namedRef(value)),\n);\n\n/**\n * A prefixed name as a term: the `PNAME_LN` / `PNAME_NS` that\n * `TurtleGrammar.prefixedName` reads, taken as one slice and split at its\n * first `:` (which `PN_PREFIX` cannot contain).\n */\nconst pnameTerm: P<Model.N3Term> = Parser.preceded(\n  mark,\n  Parser.taken(\n    Parser.seq(Parser.opt(TurtleGrammar.pnPrefix), lit(':'), Parser.opt(TurtleGrammar.pnLocal)),\n  ),\n).pipe(Parser.map((name) => b.namedPName(name)));\n\n/** `iri`: an IRI reference or a prefixed name. */\nconst iri: P<IriNode> = Parser.alt(iriRef, pname).pipe(Parser.expected('an IRI'));\n\nconst path: P<Model.N3Term> = Parser.suspend(() => pathDef);\nconst pol: P<void> = Parser.suspend(() => polDef);\nconst statementList = (inFormula: boolean): P<void> =>\n  Parser.suspend(() => (inFormula ? formulaStatements : documentStatements));\n\n/** A parser that consumes nothing and runs `f` (on the builder's state). */\nconst act = (f: () => void): P<void> =>\n  Parser.make<void>(() => {\n    f();\n    return undefined;\n  });\n\nconst TRUE = Term.literal('true', xsd.boolean);\nconst FALSE = Term.literal('false', xsd.boolean);\n\n/**\n * Where a numeric literal can start: a digit, or `.`, `+` or `-` followed by\n * one. Checking up front (without consuming input) reports errors at a `.`\n * that ends a statement, rather than after it.\n */\nconst numberStart: P<void> = Parser.make<void>((state) => {\n  // SAFETY: the N3 parser runs on string input, never bytes.\n  const input = state.input;\n  const isDigit = (k: number) => {\n    const c = input.charCodeAt(k);\n    return c >= 0x30 && c <= 0x39;\n  };\n  const c = input.charCodeAt(state.pos);\n  const ok =\n    isDigit(state.pos) ||\n    (c === 0x2e && isDigit(state.pos + 1)) ||\n    ((c === 0x2b || c === 0x2d) &&\n      (isDigit(state.pos + 1) ||\n        (input.charCodeAt(state.pos + 1) === 0x2e && isDigit(state.pos + 2))));\n  return ok ? undefined : state.backtrack('Token', expectedNumber);\n});\n\nconst expectedNumber = ['a number'];\n\nconst numeric: P<Model.N3Term> = Parser.preceded(numberStart, TurtleGrammar.numericLiteral).pipe(\n  Parser.map(([lexical, type]) =>\n    Term.literal(\n      lexical,\n      type === 'double' ? xsd.double : type === 'decimal' ? xsd.decimal : xsd.integer,\n    ),\n  ),\n);\n\n/** What follows a string literal: a language tag (`''` for none) or a datatype. */\ninterface LiteralSuffix {\n  readonly language: string;\n  readonly datatype: Option.Option<IriNode>;\n}\n\nconst noDatatype = Option.none<IriNode>();\nconst plainSuffix: LiteralSuffix = { language: '', datatype: noDatatype };\n\nconst rdfLiteral: P<Model.N3Term> = Parser.seq(\n  TurtleGrammar.stringLiteral,\n  Parser.alt(\n    Parser.preceded(Parser.peek(lit('@')), Parser.cut(TurtleGrammar.langTag)).pipe(\n      Parser.map((language): LiteralSuffix => ({ language, datatype: noDatatype })),\n    ),\n    Parser.preceded(sym('^^'), Parser.cut(Parser.preceded(ws, iri))).pipe(\n      Parser.map((datatype): LiteralSuffix => ({ language: '', datatype: Option.some(datatype) })),\n    ),\n    Parser.succeed(plainSuffix),\n  ),\n).pipe(Parser.map(([value, { language, datatype }]) => b.literal(value, language, datatype)));\n\nconst quickVar: P<Model.N3Term> = Parser.preceded(\n  lit('?'),\n  Parser.cut(\n    Parser.taken(\n      Parser.seq(Token.oneOf(TurtleGrammar.pnCharsU), Token.takeWhile(TurtleGrammar.pnChars)),\n    ),\n  ).pipe(Parser.expected('a variable name')),\n).pipe(Parser.map((name) => b.variable(name)));\n\nconst blank: P<Model.N3Term> = Parser.preceded(\n  Parser.peek(lit('_:')),\n  Parser.cut(TurtleGrammar.blankNodeLabel.pipe(Parser.expected('a blank node label'))),\n).pipe(Parser.map((label) => b.labelledBlank(label)));\n\n/**\n * `[ … ]`: an anonymous node, or `[ id <iri> … ]`. A new node is made when\n * the bracket opens, before the nodes inside it, as the statements inside\n * are about it.\n */\nconst bracket: P<Model.N3Term> = Parser.preceded(\n  lit('['),\n  Parser.cut(\n    Parser.alt(\n      sym(']').pipe(Parser.map(() => b.freshBlank())),\n      Parser.preceded(\n        Parser.tap(\n          Parser.preceded(Parser.seq(ws, word('id')), Parser.cut(Parser.preceded(ws, iri))),\n          (id) => b.open(b.named(id)),\n        ),\n        Parser.cut(Parser.terminated(pol, closeBracket)),\n      ).pipe(Parser.map(() => b.close())),\n      Parser.preceded(\n        act(() => b.open(b.freshBlank())),\n        Parser.terminated(pol, closeBracket),\n      ).pipe(Parser.map(() => b.close())),\n    ),\n  ),\n);\n\n/** `( … )`: a collection. */\nconst collection: P<Model.N3Term> = Parser.delimited(\n  lit('('),\n  Parser.cut(Parser.repeat(Parser.preceded(Parser.not(sym(')')), path))),\n  Parser.cut(sym(')').pipe(Parser.expected(\"')'\"))),\n).pipe(Parser.map((items) => new Model.Collection(items)));\n\n/** `{ … }`: a formula; an empty one is the literal `true` (N3 test suite: graph/empty_graph). */\nconst formula: P<Model.N3Term> = Parser.preceded(\n  lit('{'),\n  Parser.cut(\n    Parser.delimited(\n      act(() => b.openFormula()),\n      statementList(true),\n      Parser.cut(sym('}').pipe(Parser.expected(\"'}'\"))),\n    ),\n  ),\n).pipe(\n  Parser.map(() => {\n    const f = b.closeFormula();\n    return f.size === 0 ? TRUE : f;\n  }),\n);\n\n/** A prefixed name, or the bare words `true` and `false`. */\nconst TRAILING_DOTS = /\\.+$/;\n\n/** ASCII letters (`PN_CHARS_BASE` below 0x80). */\nconst isAsciiLetter = (c: number): boolean => (c >= 0x61 && c <= 0x7a) || (c >= 0x41 && c <= 0x5a);\n\n/** ASCII name characters (`PN_CHARS` below 0x80): letters, digits, `_` and `-`. */\nconst isAsciiNameChar = (c: number): boolean =>\n  isAsciiLetter(c) || (c >= 0x30 && c <= 0x39) || c === 0x5f || c === 0x2d;\n\n/** The scan in progress: its input and position (one pair of step functions serves every scan). */\nlet scanInput = '';\nlet scanPos = 0;\n\nconst prefixStep = (): boolean => {\n  if (!isAsciiNameChar(scanInput.charCodeAt(scanPos))) return false;\n  scanPos++;\n  return true;\n};\n\nconst localStep = (): boolean => {\n  const c = scanInput.charCodeAt(scanPos);\n  if (!isAsciiNameChar(c) && c !== 0x2e && c !== 0x3a) return false;\n  scanPos++;\n  return true;\n};\n\n/** Where the run of characters that `step` accepts, from `pos`, ends. */\nconst scanTo = (step: () => boolean, input: string, pos: number): number => {\n  scanInput = input;\n  scanPos = pos;\n  loop(step);\n  return scanPos;\n};\n\n/**\n * A prefixed name that is plain ASCII, scanned by hand: a prefix of letters,\n * digits, `_` and `-` (or none), `:`, and a local name of those and `:` and\n * `.` (without trailing dots). It backtracks, having changed nothing, at\n * anything else (`.` in the prefix, `%`, `\\`, a character from 0x80, no\n * `:`), so that `pnameTerm` reads the name, with the same result.\n */\nconst asciiPName: P<Model.N3Term> = Parser.make((state) => {\n  const input = state.input;\n  const start = state.pos;\n  const colon = isAsciiLetter(input.charCodeAt(start))\n    ? scanTo(prefixStep, input, start + 1)\n    : start;\n  if (input.charCodeAt(colon) !== 0x3a) return state.backtrack('Token');\n  // A local name does not start with `-` or `.`\n  const first = input.charCodeAt(colon + 1);\n  const i =\n    first === 0x2d || first === 0x2e || !(isAsciiNameChar(first) || first === 0x3a)\n      ? colon + 1\n      : scanTo(localStep, input, colon + 2);\n  const c = input.charCodeAt(i);\n  if (c === 0x25 || c === 0x5c || c >= 0x80) return state.backtrack('Token');\n  // A dot cannot end a name (it ends the statement)\n  const local =\n    input.charCodeAt(i - 1) === 0x2e && i > colon + 1\n      ? input.slice(colon + 1, i).replace(TRAILING_DOTS, '')\n      : input.slice(colon + 1, i);\n  b.at = start;\n  state.pos = colon + 1 + local.length;\n  return b.namedPNameParts(input.slice(start, colon), local);\n});\n\nconst nameItem: P<Model.N3Term> = Parser.alt(\n  Parser.alt(asciiPName, pnameTerm),\n  Parser.seq(Parser.location, bareWord).pipe(\n    Parser.map(([at, w]) =>\n      w === 'true'\n        ? TRUE\n        : w === 'false'\n          ? FALSE\n          : b.error(`Unexpected keyword or undeclared prefix '${w}'`, at),\n    ),\n  ),\n);\n\n/**\n * A grammar rule compiled to a function of its own. Formulas, collections and\n * `[ … ]` nest, so the compiled functions on that path recurse; keeping the\n * leaf terms out of them keeps their stack frames small, and the nesting\n * depth the parser supports large.\n */\nconst rule = <A>(p: P<A>): P<A> => Parser.suspend(() => p);\n\nconst leafItem: P<Model.N3Term> = rule(\n  Parser.alt(\n    iriRefTerm,\n    rdfLiteral,\n    quickVar,\n    atKeyword('@true').pipe(Parser.as<Model.N3Term>(TRUE)),\n    atKeyword('@false').pipe(Parser.as<Model.N3Term>(FALSE)),\n    blank,\n    numeric,\n    nameItem,\n  ),\n);\n\nconst pathItem: P<Model.N3Term> = Parser.preceded(\n  ws,\n  Parser.alt(bracket, collection, formula, leafItem).pipe(Parser.expected('a term')),\n);\n\n/** A path: an item, then `!` (forward) and `^` (backward) steps, each applied as it is read. */\nconst pathDef: P<Model.N3Term> = Parser.preceded(\n  Parser.tap(pathItem, (head) => b.paths.push(head)),\n  Parser.repeat(\n    Parser.preceded(\n      Parser.tap(\n        Parser.preceded(\n          ws,\n          Parser.alt(lit('!'), Parser.terminated(lit('^'), Parser.not(lit('^')))),\n        ),\n        (dir) => b.dirs.push(dir),\n      ),\n      Parser.tap(Parser.cut(pathItem), (step) => b.step(step)),\n    ),\n  ),\n).pipe(Parser.map(() => b.endPath()));\n\nconst fixedVerb: P<Model.N3Term> = rule(\n  Parser.alt(\n    lit('=>').pipe(Parser.as<Model.N3Term>(log.implies)),\n    lit('=').pipe(Parser.as<Model.N3Term>(sameAs)),\n    // `<=` unless the `<` starts an IRI reference.\n    Parser.preceded(Parser.seq(Parser.peek(lit('<=')), Parser.not(iriRef)), lit('<=')).pipe(\n      Parser.as<Model.N3Term>(log.isImpliedBy),\n    ),\n    Parser.alt(word('a'), atKeyword('@a')).pipe(Parser.as<Model.N3Term>(rdf.type)),\n  ),\n);\n\n/** A verb, which becomes the predicate (and direction) of the objects after it. */\nconst verb: P<void> = Parser.preceded(\n  ws,\n  Parser.asVoid<Model.N3Term, Fail, never, string>(\n    Parser.alt(\n      Parser.tap(fixedVerb, (predicate) => b.verb(predicate, false)),\n      Parser.tap(\n        Parser.preceded(\n          Parser.seq(Parser.peek(lit('<-')), Parser.not(iriRef), lit('<-')),\n          Parser.cut(path),\n        ),\n        (predicate) => b.verb(predicate, true),\n      ),\n      Parser.tap(\n        Parser.preceded(Parser.alt(word('has'), atKeyword('@has')), Parser.cut(path)),\n        (predicate) => b.verb(predicate, false),\n      ),\n      Parser.preceded(\n        Parser.alt(word('is'), atKeyword('@is')),\n        Parser.cut(\n          Parser.terminated(\n            path,\n            Parser.preceded(ws, Parser.alt(word('of'), atKeyword('@of'))).pipe(\n              Parser.expected(\"'of' after 'is ...'\"),\n            ),\n          ),\n        ),\n      ).pipe(Parser.tap((predicate) => b.verb(predicate, true))),\n      Parser.tap(path, (predicate) => b.verb(predicate, false)),\n    ),\n  ),\n);\n\nconst objectList: P<unknown> = Parser.separated(\n  Parser.tap(path, (object) => b.object(object)),\n  sym(','),\n  { min: 1 },\n).pipe(Parser.expected('an object'));\n\nconst semicolons = Parser.repeat(sym(';'), { min: 1 });\n\nconst polDef: P<void> = Parser.asVoid(\n  Parser.terminated(\n    Parser.seq(\n      Parser.seq(verb, Parser.cut(objectList)),\n      Parser.repeat(\n        Parser.preceded(\n          semicolons,\n          Parser.preceded(Parser.not(endOf('.]}')), Parser.cut(Parser.seq(verb, objectList))),\n        ),\n      ),\n    ),\n    Parser.opt(semicolons),\n  ),\n);\n\nconst triples: P<void> = Parser.preceded(\n  Parser.tap(path, (subject) => b.open(subject)),\n  Parser.alt(Parser.preceded(Parser.peek(endOf('.}')), Parser.succeed(undefined)), pol),\n).pipe(Parser.tap(() => void b.close()));\n\n/** The body of `@prefix` / `PREFIX`: `PN_PREFIX? ':' IRIREF`. */\nconst prefixBody: P<void> = Parser.asVoid(\n  Parser.seq(\n    Parser.preceded(\n      ws,\n      Parser.terminated(\n        Parser.opt(TurtleGrammar.pnPrefix),\n        lit(':').pipe(Parser.expected('a prefix name ending in \":\"')),\n      ),\n    ),\n    Parser.preceded(ws, iriRef),\n  ).pipe(\n    Parser.tap(([prefix, ref]) =>\n      b.prefix(\n        Option.getOrElse(prefix, () => ''),\n        ref,\n      ),\n    ),\n  ),\n);\n\nconst baseBody: P<void> = Parser.asVoid(\n  Parser.preceded(ws, iriRef).pipe(\n    Parser.tap((ref) => {\n      b.base = Option.some(b.iri(ref));\n    }),\n  ),\n);\n\nconst quantifier = (universal: boolean): P<void> =>\n  Parser.alt(\n    Parser.preceded(Parser.peek(endOf('.}')), Parser.succeed<ReadonlyArray<IriNode>>([])),\n    Parser.separated(Parser.preceded(ws, iri), sym(','), { min: 1 }),\n  ).pipe(\n    Parser.tap((iris) => b.quantify(universal, iris)),\n    Parser.asVoid,\n  );\n\n/** `PREFIX` / `BASE` (case-insensitive, no trailing `.`). */\nconst sparqlDirective: P<void> = rule(\n  Parser.preceded(\n    ws,\n    Parser.alt(\n      Parser.preceded(\n        Parser.terminated(\n          Ascii.caseless('PREFIX'),\n          Parser.not(Token.oneOf([':.', TurtleGrammar.pnChars])),\n        ),\n        Parser.cut(prefixBody),\n      ),\n      Parser.preceded(\n        Parser.terminated(\n          Ascii.caseless('BASE'),\n          Parser.not(Token.oneOf([':.', TurtleGrammar.pnChars])),\n        ),\n        Parser.cut(baseBody),\n      ),\n    ),\n  ),\n);\n\nconst atDirective: P<void> = rule(\n  Parser.alt(\n    Parser.preceded(atKeyword('@prefix'), Parser.cut(prefixBody)),\n    Parser.preceded(atKeyword('@base'), Parser.cut(baseBody)),\n    Parser.preceded(atKeyword('@forAll'), Parser.cut(quantifier(true))),\n    Parser.preceded(atKeyword('@forSome'), Parser.cut(quantifier(false))),\n    Parser.preceded(\n      Parser.peek(atKeyword('@keywords')),\n      Parser.cut(\n        Parser.location.pipe(\n          Parser.tryMap((at) => fail<void>('@keywords is not supported by Notation3', at)),\n        ),\n      ),\n    ),\n  ),\n);\n\nconst statement: P<void> = Parser.preceded(ws, Parser.alt(atDirective, triples));\n\n/** Statements, each ended by `.` (optional before the `}` of a formula). */\nconst statements = (inFormula: boolean): P<void> =>\n  Parser.asVoid(\n    Parser.repeat(\n      Parser.preceded(\n        Parser.not(inFormula ? endOf('}') : Parser.preceded(ws, Parser.eof)),\n        Parser.alt(\n          sparqlDirective,\n          Parser.cut(\n            Parser.terminated(\n              statement,\n              (inFormula ? Parser.alt(sym('.'), Parser.peek(sym('}'))) : sym('.')).pipe(\n                Parser.expected(\"'.'\"),\n              ),\n            ),\n          ),\n        ),\n      ),\n    ),\n  );\n\nconst formulaStatements = statements(true);\nconst documentStatements = statements(false);\n\nconst document = Compiler.jit(\n  Parser.terminated(documentStatements, Parser.preceded(ws, Parser.eof)),\n);\n\n// -----------------------------------------------------------------------------\n// Builder\n// -----------------------------------------------------------------------------\n\nconst PN_LOCAL_ESC = /\\\\(.)/gu;\n\nconst I18N_DATATYPE = /^([a-zA-Z]+(?:-[a-zA-Z0-9]+)*)_(ltr|rtl)$/;\n\n/** The subject whose statements are being read, with the predicate and direction in force. */\nclass Frame {\n  subject: Model.N3Term = rdf.nil;\n  predicate: Model.N3Term = rdf.nil;\n  inverse = false;\n}\n\n/**\n * What depends on the document so far (prefixes, the base IRI, blank node\n * labels and counters, quantifier scopes, the open formulas and subjects),\n * updated by the grammar's callbacks as it reads, so that statements are\n * made in document order without a syntax tree. An error found here is\n * kept and reported once the grammar has read the whole document, so that a\n * syntax error anywhere comes first.\n */\nclass Builder {\n  readonly prefixes = MutableHashMap.empty<string, string>();\n  base: Option.Option<string>;\n  private readonly bnodePrefix: string;\n  private readonly bnodes = MutableHashMap.empty<string, Term.BlankNode>();\n  /** The blank node labels written in the document (as keys). */\n  private readonly reserved = MutableHashMap.empty<string, boolean>();\n  private anonCounter = 0;\n  /** Statement collectors, one per open formula (innermost last). */\n  private readonly out: Array<Array<Model.Statement>> = [];\n  /**\n   * Explicit quantifier scopes (legacy `@forAll` / `@forSome`), innermost\n   * last, each with the depth of the formula it belongs to: only formulas\n   * that quantify something have one, so a document without quantifiers\n   * looks nothing up.\n   */\n  private readonly scopes: Array<\n    readonly [depth: number, scope: MutableHashMap.MutableHashMap<string, Model.N3Term>]\n  > = [];\n  /** How many formulas are open. */\n  private depth = 0;\n  /**\n   * The variables made so far, by name: quick variables (one node per name,\n   * so that the copies of a rule compare by identity when a formula removes\n   * duplicate statements) and those made for `@forAll`, whose names avoid\n   * these.\n   */\n  private readonly variables = MutableHashMap.empty<string, Term.Variable>();\n  /** The subjects being described, innermost last (`depthOfFrames` of them are in use). */\n  private readonly frames: Array<Frame> = [];\n  private openFrames = 0;\n  /** The items of the paths being read, and the directions of their steps, innermost last. */\n  readonly paths: Array<Model.N3Term> = [];\n  readonly dirs: Array<string> = [];\n  /** Where the term being read starts, and (for an IRI reference) ends. */\n  at = 0;\n  end = 0;\n  /** The first error found (none while it is empty). */\n  readonly errors: Array<{ readonly message: string; readonly at: number }> = [];\n\n  readonly input: string;\n  constructor(input: string, options: ParserOptions) {\n    this.input = input;\n    this.base = options.baseIri;\n    this.bnodePrefix = options.blankNodePrefix;\n    // Labels written in the document; generated labels avoid them.\n    Iterable.forEach(input.matchAll(/_:([^\\s<>\"{}()[\\],;^!]+)/g), ([, label]) => {\n      MutableHashMap.set(this.reserved, `${this.bnodePrefix}${label ?? ''}`, true);\n    });\n  }\n\n  /** Keeps the first error, returning a stand-in term so that reading can go on. */\n  error(message: string, at: number): Model.N3Term {\n    if (Arr.isReadonlyArrayEmpty(this.errors)) this.errors.push({ message, at });\n    return rdf.nil;\n  }\n\n  openFormula(): void {\n    this.out.push([]);\n    this.depth++;\n  }\n\n  closeFormula(): Model.Formula {\n    if (this.scopes.at(-1)?.[0] === this.depth) this.scopes.pop();\n    this.depth--;\n    return new Model.Formula(this.out.pop() ?? []);\n  }\n\n  /** Starts describing `subject` (a statement's subject, or the node of a `[ … ]`). */\n  open(subject: Model.N3Term): void {\n    const frame = (this.frames[this.openFrames++] ??= new Frame());\n    frame.subject = subject;\n    frame.predicate = rdf.nil;\n    frame.inverse = false;\n  }\n\n  /** Stops describing the current subject, returning it. */\n  close(): Model.N3Term {\n    const frame = this.frames[--this.openFrames];\n    return frame === undefined ? rdf.nil : frame.subject;\n  }\n\n  verb(predicate: Model.N3Term, inverse: boolean): void {\n    const frame = this.frames[this.openFrames - 1];\n    if (frame === undefined) return;\n    frame.predicate = predicate;\n    frame.inverse = inverse;\n  }\n\n  /** A statement about the current subject, with the current predicate, of `object`. */\n  object(object: Model.N3Term): void {\n    const frame = this.frames[this.openFrames - 1];\n    if (frame === undefined) return;\n    if (frame.inverse) this.emit(object, frame.predicate, frame.subject);\n    else this.emit(frame.subject, frame.predicate, object);\n  }\n\n  /** A `!` or `^` step from the current path's item to a new blank node, which replaces it. */\n  step(predicate: Model.N3Term): void {\n    const dir = this.dirs.pop();\n    const item = this.paths.pop() ?? rdf.nil;\n    const node = this.freshBlank();\n    if (dir === '!') this.emit(item, predicate, node);\n    else this.emit(node, predicate, item);\n    this.paths.push(node);\n  }\n\n  endPath(): Model.N3Term {\n    return this.paths.pop() ?? rdf.nil;\n  }\n\n  prefix(prefix: string, ref: IriNode): void {\n    MutableHashMap.set(this.prefixes, prefix, this.iri(ref));\n  }\n\n  quantify(universal: boolean, iris: ReadonlyArray<IriNode>): void {\n    const scope = this.scope();\n    iris.forEach((node) => {\n      const quantified = this.iri(node);\n      MutableHashMap.set(\n        scope,\n        quantified,\n        universal ? this.variableFor(quantified) : this.freshBlank(),\n      );\n    });\n  }\n\n  variable(name: string): Term.Variable {\n    const known = this.variables.backing.get(name);\n    if (known !== undefined) return known;\n    const node = new Term.Variable(name);\n    MutableHashMap.set(this.variables, name, node);\n    return node;\n  }\n\n  /** A literal: with `language` unless it is `''`, else of `datatype` if there is one. */\n  literal(value: string, language: string, datatype: Option.Option<IriNode>): Term.Literal {\n    if (language !== '') return Term.literal(value, language);\n    if (Option.isNone(datatype)) return Term.literal(value);\n    const type = this.iri(datatype.value);\n    const dir = type.startsWith(i18n.base)\n      ? I18N_DATATYPE.exec(type.slice(i18n.base.length))\n      : null;\n    if (dir !== null) {\n      // The base-direction regex only captures `ltr` or `rtl`.\n      return Term.literal(value, {\n        language: dir[1] ?? '',\n        direction: dir[2] === 'rtl' ? 'rtl' : 'ltr',\n      });\n    }\n    return Term.literal(value, new Term.NamedNode(type));\n  }\n\n  iri(node: IriNode): string {\n    if (Predicate.isTagged(node, 'IriRef')) {\n      if (node.escaped && forbiddenInIri.test(node.value)) {\n        this.error('Invalid escaped character in IRI', node.at);\n        return node.value;\n      }\n      return this.resolveIri(node.value);\n    }\n    const ns = this.prefixes.backing.get(node.prefix);\n    if (ns !== undefined) return ns + node.local;\n    // The empty prefix defaults to `<#>` (the current document), as in cwm.\n    if (node.prefix === '') return this.resolveIri('#') + node.local;\n    this.error(`Undeclared prefix '${node.prefix}:'`, node.at);\n    return node.local;\n  }\n\n  private resolveIri(value: string): string {\n    return Option.isNone(this.base) ? value : Iri.resolve(value, this.base.value);\n  }\n\n  /** The quantifier scope of the innermost formula, made on first use. */\n  private scope(): MutableHashMap.MutableHashMap<string, Model.N3Term> {\n    const top = this.scopes.at(-1);\n    if (top !== undefined && top[0] === this.depth) return top[1];\n    const scope = MutableHashMap.empty<string, Model.N3Term>();\n    this.scopes.push([this.depth, scope]);\n    return scope;\n  }\n\n  /**\n   * The nodes made so far, by IRI and (for prefixed names) by namespace and\n   * local name, so that a name written again is neither concatenated nor\n   * hashed anew, and each IRI's key (which formulas deduplicate by) is\n   * computed once.\n   */\n  private readonly iriNodes = MutableHashMap.empty<string, Term.NamedNode>();\n  private readonly localNodes = MutableHashMap.empty<\n    string,\n    Array<readonly [string, Term.NamedNode]>\n  >();\n\n  /** The term an IRI reference read at `at`…`end` stands for. */\n  namedRef(value: string): Model.N3Term {\n    if (this.end - this.at - 2 !== value.length && forbiddenInIri.test(value)) {\n      return this.error('Invalid escaped character in IRI', this.at);\n    }\n    return this.scoped(this.iriNodeOf(this.resolveIri(value)));\n  }\n\n  /** The term a prefixed name read at `at` stands for. */\n  namedPName(name: string): Model.N3Term {\n    const colon = name.indexOf(':');\n    const raw = name.slice(colon + 1);\n    // `PN_LOCAL_ESC`s are decoded, as `TurtleGrammar.pnLocal` does\n    return this.namedPNameParts(\n      name.slice(0, colon),\n      raw.includes('\\\\') ? raw.replace(PN_LOCAL_ESC, '$1') : raw,\n    );\n  }\n\n  /** The term of a prefixed name read at `at`, given its prefix and decoded local name. */\n  namedPNameParts(prefix: string, local: string): Model.N3Term {\n    const ns = this.prefixes.backing.get(prefix);\n    if (ns !== undefined) return this.scoped(this.localNode(ns, local));\n    return this.named({ _tag: 'PName', prefix, local, at: this.at });\n  }\n\n  /** The term an IRI as written stands for: its node, or a quantified variable or blank node. */\n  named(node: IriNode): Model.N3Term {\n    return this.scoped(this.iriNode(node));\n  }\n\n  /** `named`, or the variable or blank node it is quantified as. */\n  private scoped(named: Term.NamedNode): Model.N3Term {\n    // Usually no formula quantifies anything, and there is nothing to look up\n    if (Arr.isReadonlyArrayEmpty(this.scopes)) return named;\n    const scope = this.scopes.findLast(([, quantified]) =>\n      MutableHashMap.has(quantified, named.value),\n    );\n    return scope?.[1].backing.get(named.value) ?? named;\n  }\n\n  private iriNode(node: IriNode): Term.NamedNode {\n    if (Predicate.isTagged(node, 'PName')) {\n      const ns = this.prefixes.backing.get(node.prefix);\n      if (ns !== undefined) return this.localNode(ns, node.local);\n    }\n    return this.iriNodeOf(this.iri(node));\n  }\n\n  private iriNodeOf(value: string): Term.NamedNode {\n    const known = this.iriNodes.backing.get(value);\n    if (known !== undefined) return known;\n    const named = new Term.NamedNode(value);\n    MutableHashMap.set(this.iriNodes, value, named);\n    return named;\n  }\n\n  /** The node of `ns` + `local`, by local name and then namespace (a local name rarely has two). */\n  private localNode(ns: string, local: string): Term.NamedNode {\n    let byNamespace = this.localNodes.backing.get(local);\n    if (byNamespace === undefined) {\n      byNamespace = [];\n      MutableHashMap.set(this.localNodes, local, byNamespace);\n    }\n    const known = byNamespace.find(([namespace]) => namespace === ns);\n    if (known !== undefined) return known[1];\n    const named = new Term.NamedNode(ns + local);\n    byNamespace.push([ns, named]);\n    return named;\n  }\n\n  private emit(subject: Model.N3Term, predicate: Model.N3Term, object: Model.N3Term): void {\n    this.out.at(-1)?.push(new Model.Statement(subject, predicate, object));\n  }\n\n  freshBlank(): Term.BlankNode {\n    const label = this.freshLabel();\n    // Usually the first label is free\n    return new Term.BlankNode(this.reserved.backing.has(label) ? this.freeLabel() : label);\n  }\n\n  private freshLabel(): string {\n    return `${this.bnodePrefix}b${(this.anonCounter++).toString(36)}`;\n  }\n\n  /** The next generated label that the document does not use. */\n  private freeLabel(): string {\n    let label = this.freshLabel();\n    loop(() => {\n      if (!this.reserved.backing.has(label)) return false;\n      label = this.freshLabel();\n      return true;\n    });\n    return label;\n  }\n\n  labelledBlank(label: string): Term.BlankNode {\n    const known = this.bnodes.backing.get(label);\n    if (known !== undefined) return known;\n    const node = new Term.BlankNode(`${this.bnodePrefix}${label}`);\n    MutableHashMap.set(this.bnodes, label, node);\n    return node;\n  }\n\n  private variableFor(quantified: string): Term.Variable {\n    const local = /[^#/:]*$/.exec(quantified)?.[0] ?? '';\n    const base = /^[A-Za-z_][A-Za-z0-9_]*$/.test(local) ? local : 'v';\n    let name = base;\n    if (MutableHashMap.has(this.variables, base)) {\n      loop((i) => {\n        name = `${base}_${i + 1}`;\n        return MutableHashMap.has(this.variables, name);\n      });\n    }\n    const node = new Term.Variable(name);\n    MutableHashMap.set(this.variables, name, node);\n    return node;\n  }\n}\n\n/** The builder of the document being parsed (the grammar's callbacks update it). */\nlet b: Builder = new Builder('', { baseIri: Option.none(), blankNodePrefix: '' });\n\n// -----------------------------------------------------------------------------\n// Entry point\n// -----------------------------------------------------------------------------\n\nconst failAt = (input: string, message: string, at: number): never => {\n  const end = Math.min(at, input.length);\n  // The lines before `at`: the last is the one it is on\n  const lines = input.slice(0, end).split('\\n');\n  const column = (lines.at(-1) ?? '').length + 1;\n  throw new SyntaxFailure(message, lines.length, column);\n};\n\nconst describe = (input: string, at: number): string =>\n  at >= input.length ? 'end of input' : `'${String.fromCodePoint(input.codePointAt(at) ?? 0)}'`;\n\n/** @internal */\nexport const parse = (input: string, options: ParserOptions): Model.Document => {\n  b = new Builder(input, options);\n  b.openFormula();\n  const result = Parser.parse(document, input);\n  if (Result.isFailure(result)) {\n    const error = result.failure;\n    if (error.cause !== undefined) return failAt(input, error.cause.message, error.cause.at);\n    const found = describe(input, error.offset);\n    const expected = error.expected.filter((e) => e !== WHITESPACE);\n    const message =\n      Arr.isReadonlyArrayEmpty(expected) || expected.length > 3\n        ? `Unexpected ${found}`\n        : `Expected ${expected.join(' or ')} but found ${found}`;\n    return failAt(input, message, error.offset);\n  }\n  const error = b.errors.at(0);\n  if (error !== undefined) return failAt(input, error.message, error.at);\n  return {\n    formula: b.closeFormula(),\n    prefixes: PrefixMap.make(b.prefixes),\n    baseIri: Option.getOrUndefined(b.base),\n  };\n};\n","/**\n * Pretty-printer for the N3 model.\n *\n * @internal\n */\nimport * as Arr from 'effect/Array';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Iri from '../../Iri.ts';\nimport * as PrefixMap from '../../PrefixMap.ts';\nimport * as Term from '../../Term.ts';\nimport { rdf, xsd } from '../../Vocab.ts';\nimport * as Model from '../Model.ts';\nimport * as Guards from './guards.ts';\nimport { loop } from './loop.ts';\nimport { isPnChars, isPnCharsBase, isPnCharsU } from './parser.ts';\nimport { i18n, log, sameAs } from '../Vocab.ts';\n\n/** @internal */\nexport interface WriterOptions {\n  readonly prefixes: PrefixMap.PrefixMap;\n  readonly baseIri: Option.Option<string>;\n  /** Indentation unit. */\n  readonly indent: string;\n}\n\n/** Whether a string is a valid `PN_PREFIX` (or empty). */\nconst isPnPrefix = (s: string): boolean => {\n  const cps = Array.from(s, codePoint);\n  if (!Arr.isReadonlyArrayNonEmpty(cps)) return true;\n  if (!isPnCharsBase(cps[0])) return false;\n  if (cps.length > 1 && cps[cps.length - 1] === 0x2e) return false;\n  return cps.slice(1).every((c) => c === 0x2e || isPnChars(c));\n};\n\n/** The code point of a character (as `Array.from` splits a string). */\nconst codePoint = (ch: string): number => ch.codePointAt(0) ?? 0;\n\n/** Whether a string is a valid quick variable name (without `?`). */\nconst isVarName = (s: string): boolean => {\n  const cps = Array.from(s, codePoint);\n  return Arr.isReadonlyArrayNonEmpty(cps) && isPnCharsU(cps[0]) && cps.slice(1).every(isPnChars);\n};\n\nconst BLANK_LABEL = /^[A-Za-z0-9_](?:[\\w.-]*[\\w-])?$/;\nconst INTEGER = /^[+-]?\\d+$/;\nconst DECIMAL = /^[+-]?\\d*\\.\\d+$/;\nconst DOUBLE = /^[+-]?(?:\\d+\\.\\d*|\\.\\d+|\\d+)[eE][+-]?\\d+$/;\n\ninterface BlankInfo {\n  refs: number;\n  predicate: boolean;\n  /** The first formula the blank node occurs in. */\n  readonly formula: Model.Formula;\n  /** Whether it occurs in another formula (object) too. */\n  shared: boolean;\n}\n\n/** The statements of one subject (or predicate), in order. */\ninterface Group {\n  readonly first: Model.Statement;\n  readonly statements: Array<Model.Statement>;\n}\n\n/** @internal */\nexport const write = (root: Model.Formula, options: WriterOptions): string =>\n  new Writer(root, options).run();\n\nclass Writer {\n  private readonly prefixes: PrefixMap.PrefixMap;\n  private readonly base: Option.Option<string>;\n  private readonly unit: string;\n  private readonly usedPrefixes = MutableHashSet.empty<string>();\n  private readonly blanks = MutableHashMap.empty<string, BlankInfo>();\n  private readonly blankLabels = MutableHashMap.empty<string, string>();\n  private readonly usedLabels = MutableHashSet.empty<string>();\n  private readonly varNames = MutableHashMap.empty<string, string>();\n  /** Subject groups of inlinable blank nodes, per formula. */\n  private readonly inlineGroups = MutableHashMap.empty<string, Array<Model.Statement>>();\n  private readonly inlinable = MutableHashSet.empty<string>();\n  private readonly emitted = MutableHashSet.empty<string>();\n\n  private readonly root: Model.Formula;\n  constructor(root: Model.Formula, options: WriterOptions) {\n    this.root = root;\n    this.prefixes = options.prefixes;\n    this.base = options.baseIri;\n    this.unit = options.indent;\n  }\n\n  run(): string {\n    this.analyse(this.root);\n    MutableHashMap.forEach(this.blanks, (info, label) => {\n      if (!info.predicate && info.refs <= 1 && !info.shared) {\n        MutableHashSet.add(this.inlinable, label);\n      }\n    });\n    const body = this.formulaBody(this.root, 0);\n    const base = Option.match(this.base, {\n      onNone: () => '',\n      onSome: (iri) => `@base <${Term.escapeIri(iri)}> .\\n`,\n    });\n    const header = Arr.reduce(\n      Arr.fromIterable(this.prefixes.prefixes),\n      base,\n      (acc, [prefix, ns]) =>\n        MutableHashSet.has(this.usedPrefixes, prefix)\n          ? `${acc}@prefix ${prefix}: <${Term.escapeIri(ns)}> .\\n`\n          : acc,\n    );\n    return header === '' ? body : `${header}\\n${body}`;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Analysis\n  // ---------------------------------------------------------------------------\n\n  /** The blank node's information, made (in `f`) on first sight. */\n  private info(label: string, f: Model.Formula): BlankInfo {\n    const known = this.blanks.backing.get(label);\n    if (known !== undefined) {\n      if (known.formula !== f) known.shared = true;\n      return known;\n    }\n    const info: BlankInfo = { refs: 0, predicate: false, formula: f, shared: false };\n    MutableHashMap.set(this.blanks, label, info);\n    return info;\n  }\n\n  private analyse(f: Model.Formula): void {\n    f.statements.forEach((s) => {\n      this.analyseTerm(s.subject, f, 'subject');\n      this.analyseTerm(s.predicate, f, 'predicate');\n      this.analyseTerm(s.object, f, 'object');\n    });\n  }\n\n  // Plain refinements rather than `Match`: `analyseTerm` runs for every term written.\n  private analyseTerm(t: Model.N3Term, f: Model.Formula, position: string): void {\n    if (Guards.isBlankNode(t)) {\n      const info = this.info(t.value, f);\n      if (position === 'predicate') info.predicate = true;\n      else if (position !== 'subject') info.refs++;\n    } else if (t instanceof Model.Collection) {\n      t.items.forEach((item) => this.analyseTerm(item, f, 'item'));\n    } else if (t instanceof Model.Formula) {\n      this.analyse(t);\n    }\n  }\n\n  /** Whether `subject` is an inlinable blank node. */\n  private isInlinable(subject: Model.N3Term): subject is Term.BlankNode {\n    return Guards.isBlankNode(subject) && MutableHashSet.has(this.inlinable, subject.value);\n  }\n\n  // ---------------------------------------------------------------------------\n  // Statements\n  // ---------------------------------------------------------------------------\n\n  private formulaBody(f: Model.Formula, depth: number): string {\n    const groups = MutableHashMap.empty<string, Group>();\n    f.statements.forEach((s) => {\n      const k = s.subject.key;\n      let g = groups.backing.get(k);\n      if (g === undefined) {\n        g = { first: s, statements: [s] };\n        MutableHashMap.set(groups, k, g);\n      } else g.statements.push(s);\n      if (this.isInlinable(s.subject)) {\n        MutableHashMap.set(this.inlineGroups, s.subject.value, g.statements);\n      }\n    });\n    const pad = this.unit.repeat(depth);\n    const lines: Array<string> = [];\n    const render = (g: Group) => {\n      const subject = g.first.subject;\n      if (this.isInlinable(subject)) {\n        MutableHashSet.add(this.emitted, subject.value);\n        lines.push(\n          `${pad}[ ${this.predicateObjects(g.statements, depth + 1, ` ;\\n${pad}${this.unit}`)} ] .`,\n        );\n        return;\n      }\n      const subj = this.term(subject, depth);\n      lines.push(\n        `${pad}${subj} ${this.predicateObjects(g.statements, depth, ` ;\\n${pad}${this.unit}`)} .`,\n      );\n    };\n    const deferred: Array<Group> = [];\n    MutableHashMap.forEach(groups, (g) => {\n      const subject = g.first.subject;\n      if (this.isInlinable(subject) && this.blanks.backing.get(subject.value)?.refs === 1) {\n        deferred.push(g);\n        return;\n      }\n      render(g);\n    });\n    // Inlinable blank nodes that were never reached (reference cycles) are\n    // written with labels.\n    deferred.forEach((g) => {\n      const subject = g.first.subject;\n      if (!Guards.isBlankNode(subject) || MutableHashSet.has(this.emitted, subject.value)) return;\n      MutableHashSet.remove(this.inlinable, subject.value);\n      render(g);\n    });\n    return lines.join('\\n') + (Arr.isReadonlyArrayNonEmpty(lines) ? '\\n' : '');\n  }\n\n  private predicateObjects(\n    statements: ReadonlyArray<Model.Statement>,\n    depth: number,\n    separator: string,\n  ): string {\n    const byPredicate = MutableHashMap.empty<\n      string,\n      { predicate: Model.N3Term; objects: Array<Model.N3Term> }\n    >();\n    statements.forEach((s) => {\n      const k = s.predicate.key;\n      const e = byPredicate.backing.get(k);\n      if (e === undefined) {\n        MutableHashMap.set(byPredicate, k, { predicate: s.predicate, objects: [s.object] });\n      } else e.objects.push(s.object);\n    });\n    return Arr.map(\n      Arr.fromIterable(MutableHashMap.values(byPredicate)),\n      ({ predicate, objects }) =>\n        `${this.verb(predicate, depth)} ${objects.map((o) => this.term(o, depth)).join(', ')}`,\n    ).join(separator);\n  }\n\n  private verb(t: Model.N3Term, depth: number): string {\n    if (Guards.isNamedNode(t)) {\n      if (t.value === rdf.type.value) return 'a';\n      if (t.value === log.implies.value) return '=>';\n      if (t.value === log.isImpliedBy.value) return '<=';\n      if (t.value === sameAs.value) return '=';\n    }\n    return this.term(t, depth);\n  }\n\n  // ---------------------------------------------------------------------------\n  // Terms\n  // ---------------------------------------------------------------------------\n\n  // Plain refinements rather than `Match`: `term` runs for every term written.\n  private term(t: Model.N3Term, depth: number): string {\n    if (Guards.isNamedNode(t)) return this.iri(t.value);\n    if (Guards.isBlankNode(t)) return this.blank(t, depth);\n    if (Guards.isLiteral(t)) return this.literal(t);\n    if (Guards.isVariable(t)) return this.variable(t);\n    if (t instanceof Model.Collection) {\n      return Arr.isReadonlyArrayEmpty(t.items)\n        ? '()'\n        : `( ${t.items.map((i) => this.term(i, depth)).join(' ')} )`;\n    }\n    return this.formula(t, depth);\n  }\n\n  private formula(f: Model.Formula, depth: number): string {\n    if (Arr.isReadonlyArrayEmpty(f.statements)) return '{}';\n    const inner = this.formulaBody(f, depth + 1);\n    if (f.statements.length === 1) {\n      const line = inner.trim();\n      if (!line.includes('\\n') && line.length <= 80) return `{ ${line.replace(/ \\.$/, '')} }`;\n    }\n    return `{\\n${inner}${this.unit.repeat(depth)}}`;\n  }\n\n  private blank(b: Term.BlankNode, depth: number): string {\n    if (MutableHashSet.has(this.inlinable, b.value) && !MutableHashSet.has(this.emitted, b.value)) {\n      MutableHashSet.add(this.emitted, b.value);\n      const g = this.inlineGroups.backing.get(b.value);\n      if (g === undefined || Arr.isReadonlyArrayEmpty(g)) return '[]';\n      const pad = this.unit.repeat(depth + 1);\n      return `[ ${this.predicateObjects(g, depth + 1, ` ;\\n${pad}`)} ]`;\n    }\n    const known = this.blankLabels.backing.get(b.value);\n    if (known !== undefined) return `_:${known}`;\n    let label = BLANK_LABEL.test(b.value) ? b.value : `b${MutableHashMap.size(this.blankLabels)}`;\n    loop(() => {\n      if (!MutableHashSet.has(this.usedLabels, label)) return false;\n      label = `${label}_`;\n      return true;\n    });\n    MutableHashSet.add(this.usedLabels, label);\n    MutableHashMap.set(this.blankLabels, b.value, label);\n    return `_:${label}`;\n  }\n\n  private variable(v: Term.Variable): string {\n    const known = this.varNames.backing.get(v.value);\n    if (known !== undefined) return `?${known}`;\n    const name = isVarName(v.value) ? v.value : `v${MutableHashMap.size(this.varNames)}`;\n    MutableHashMap.set(this.varNames, v.value, name);\n    return `?${name}`;\n  }\n\n  private iri(value: string): string {\n    const compact = PrefixMap.compact(this.prefixes, value);\n    if (Option.isSome(compact) && isPnPrefix(compact.value[0])) {\n      const [prefix, local] = compact.value;\n      if (!local.endsWith('.')) {\n        MutableHashSet.add(this.usedPrefixes, prefix);\n        return `${prefix}:${local}`;\n      }\n    }\n    if (Option.isSome(this.base)) {\n      const rel = Iri.relativize(value, this.base.value);\n      if (Option.isSome(rel)) return `<${Term.escapeIri(rel.value)}>`;\n    }\n    return `<${Term.escapeIri(value)}>`;\n  }\n\n  private literal(l: Term.Literal): string {\n    const dt = l.datatype.value;\n    if (l.language === '') {\n      if (dt === xsd.integer.value && INTEGER.test(l.value)) return l.value;\n      if (dt === xsd.decimal.value && DECIMAL.test(l.value)) return l.value;\n      if (dt === xsd.double.value && DOUBLE.test(l.value)) return l.value;\n      if (dt === xsd.boolean.value && (l.value === 'true' || l.value === 'false')) return l.value;\n    }\n    const quoted = this.quote(l.value);\n    if (l.language !== '') {\n      return l.direction === undefined\n        ? `${quoted}@${l.language}`\n        : `${quoted}^^${this.iri(`${i18n.base}${l.language}_${l.direction}`)}`;\n    }\n    if (dt === Term.XSD_STRING) return quoted;\n    return `${quoted}^^${this.iri(dt)}`;\n  }\n\n  private quote(value: string): string {\n    if (value.includes('\\n') && !value.endsWith('\"')) {\n      // eslint-disable-next-line no-control-regex\n      const body = value.replace(/[\\\\\"\\u0000-\\u0009\\u000b-\\u001f\\u007f]/g, (ch) =>\n        ch === '\\\\' || ch === '\"' ? `\\\\${ch}` : Term.escapeString(ch),\n      );\n      return `\"\"\"${body}\"\"\"`;\n    }\n    return `\"${Term.escapeString(value)}\"`;\n  }\n}\n","/**\n * Notation3 (N3) parsing and serialisation.\n *\n * - `parse` parses an N3 document into the full N3 model (`Model.Document`),\n *   including formulas, variables, collections and literals in any position.\n * - `serializeDocument` pretty-prints the N3 model.\n * - `parser`, `serializer` and `codec` implement the core\n *   `Serialization.Parser` / `Serializer` / `Codec` interfaces over RDF\n *   `Dataset`s, using the mapping documented in the `Mapping` module:\n *   formulas become named graphs identified by blank nodes, and collections\n *   become `rdf:first`/`rdf:rest` lists. Documents outside the RDF-compatible\n *   subset (variables, literal subjects, non-IRI predicates) fail with\n *   `RdfParseError`.\n *\n * Syntax notes (current W3C CG specification and test suite):\n *\n * - Supports `@prefix`/`@base`, SPARQL `PREFIX`/`BASE`, formulas, quick\n *   variables, paths (`!`, `^`), `a`, `has`, `is … of`, `<-`, `=`, `=>`,\n *   `<=`, IRI property lists (`[ id <iri> … ]`), and the `@`-prefixed\n *   keyword forms. The legacy explicit quantifiers `@forAll` (mapped to\n *   variables) and `@forSome` (mapped to fresh blank nodes) are accepted;\n *   `@keywords` is rejected.\n * - `<=` is `log:isImpliedBy`; `=` is `owl:sameAs`.\n * - An empty formula `{}` denotes the literal `true`.\n * - The empty prefix `:` defaults to `<#>` (relative to the base) when not\n *   declared.\n * - Blank node labels are scoped to the whole document.\n * - `\"…\"^^i18n:{lang}_{dir}` is read as a directional language-tagged\n *   string.\n *\n * @since 0.1.0\n */\nimport * as Effect from 'effect/Effect';\nimport * as Option from 'effect/Option';\nimport * as PrefixMap from '../PrefixMap.ts';\nimport * as Serialization from '../Serialization.ts';\nimport type * as Term from '../Term.ts';\nimport * as Parser from './internal/parser.ts';\nimport * as Writer from './internal/writer.ts';\nimport * as Mapping from './Mapping.ts';\nimport * as Model from './Model.ts';\n\n/**\n * The N3 format descriptor (`text/n3`, `.n3`).\n *\n * N3 can only represent named graphs that are named by blank nodes used as\n * terms (formulas), so `datasets` is `false`.\n *\n * @since 0.1.0\n * @category formats\n */\nexport const format: Serialization.Format = Serialization.makeFormat({\n  name: 'N3',\n  mediaType: 'text/n3',\n  mediaTypes: ['text/n3', 'text/rdf+n3', 'application/n3'],\n  extensions: ['n3'],\n  datasets: false,\n});\n\n// Spans are named `N3.parse`, `N3.serialize`.\nconst trace: Serialization.SpanTarget = { module: 'N3', format };\n\n/**\n * Options for parsing N3.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ParseOptions extends Serialization.ParseOptions {}\n\nconst runParser = (\n  input: string,\n  options?: ParseOptions,\n): Effect.Effect<Model.Document, Serialization.RdfParseError> =>\n  Effect.sync(() =>\n    Parser.parse(input, {\n      baseIri: Option.fromUndefinedOr(options?.baseIri),\n      blankNodePrefix: options?.blankNodePrefix ?? Serialization.freshBlankNodePrefix(),\n    }),\n  ).pipe(\n    Effect.catchDefect((e) =>\n      e instanceof Parser.SyntaxFailure\n        ? Effect.fail(\n            new Serialization.RdfParseError({\n              format: format.name,\n              message: e.message,\n              line: e.line,\n              column: e.column,\n            }),\n          )\n        : Effect.die(e),\n    ),\n  );\n\n/**\n * Parses an N3 document into the full N3 model.\n *\n * @example\n * ```ts\n * import { Effect } from 'effect'\n * import { N3 } from '@thomasfosterau/effect-rdf/n3'\n *\n * const doc = Effect.runSync(N3.parse('@prefix : <http://example.org/> . { ?x a :Man } => { ?x a :Mortal } .'))\n * doc.formula.statements.length // 1\n * ```\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parse: (\n  input: string,\n  options?: ParseOptions,\n) => Effect.Effect<Model.Document, Serialization.RdfParseError> = Effect.fn('N3.parse')(function* (\n  input: string,\n  options?: ParseOptions,\n) {\n  yield* Effect.annotateCurrentSpan({\n    'rdf.format': format.name,\n    'rdf.media_type': format.mediaType,\n    'rdf.input.length': input.length,\n  });\n  const doc = yield* runParser(input, options);\n  yield* Effect.annotateCurrentSpan('n3.statements', doc.formula.size);\n  return doc;\n});\n\n/**\n * Parses an N3 document in the RDF-compatible subset into a core dataset\n * (see `Mapping.toDataset`).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseDataset = (\n  input: string,\n  options?: ParseOptions,\n): Effect.Effect<Serialization.ParseResult, Serialization.RdfParseError> =>\n  Effect.flatMap(runParser(input, options), (doc) =>\n    Effect.suspend(() => {\n      const prefix = options?.blankNodePrefix ?? Serialization.freshBlankNodePrefix();\n      return Mapping.toDataset(doc, { blankNodePrefix: prefix }).pipe(\n        Effect.mapError(\n          (e) => new Serialization.RdfParseError({ format: format.name, message: e.message }),\n        ),\n        Effect.map((dataset): Serialization.ParseResult => ({\n          dataset,\n          prefixes: doc.prefixes,\n          baseIri: doc.baseIri,\n        })),\n      );\n    }),\n  ).pipe(Serialization.withParseSpan(trace, input, 'parseDataset'));\n\n/**\n * The N3 `Serialization.Parser`, producing core datasets.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parser: Serialization.Parser<ParseOptions> = Serialization.makeParser({\n  format,\n  parse: parseDataset,\n});\n\n/**\n * Options for serialising N3.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface SerializeOptions extends Serialization.SerializeOptions {\n  /** Indentation unit for nested formulas and statements (default four spaces). */\n  readonly indent?: string | undefined;\n}\n\n/**\n * Serialises an N3 formula or document. Prefixes from the options (or, for\n * a document, the document's own prefixes) are used to abbreviate IRIs, and\n * only the prefixes actually used are declared.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serializeDocument = (\n  self: Model.Formula | Model.Document,\n  options?: SerializeOptions,\n): string => {\n  const isFormula = Model.isFormula(self);\n  return Writer.write(isFormula ? self : self.formula, {\n    prefixes: options?.prefixes ?? (isFormula ? PrefixMap.empty : self.prefixes),\n    baseIri: Option.fromUndefinedOr(options?.baseIri ?? (isFormula ? undefined : self.baseIri)),\n    indent: options?.indent ?? '    ',\n  });\n};\n\n/**\n * Serialises RDF quads as N3. Graphs named by blank nodes that are used as\n * terms are written as nested formulas, and well-formed RDF lists as\n * collections; other named graphs cannot be represented and fail with\n * `RdfSerializeError`.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serialize = (\n  quads: Iterable<Term.Quad>,\n  options?: SerializeOptions,\n): Effect.Effect<string, Serialization.RdfSerializeError> =>\n  Mapping.fromDataset(quads).pipe(\n    Effect.map((f) => serializeDocument(f, options)),\n    Effect.mapError(\n      (e) => new Serialization.RdfSerializeError({ format: format.name, message: e.message }),\n    ),\n    Serialization.withSerializeSpan(trace),\n  );\n\n/**\n * The N3 `Serialization.Serializer` for core datasets.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serializer: Serialization.Serializer<SerializeOptions> = Serialization.makeSerializer({\n  format,\n  serialize,\n});\n\n/**\n * The N3 `Serialization.Codec` (parser + serializer over core datasets).\n *\n * @since 0.1.0\n * @category codecs\n */\nexport const codec: Serialization.Codec<ParseOptions, SerializeOptions> = Serialization.makeCodec(\n  parser,\n  serializer,\n);\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,IAAa,gBAAb,MAA2B;CACzB;CACA;CACA;CACA,YAAY,SAAiB,MAAc,QAAgB;EACzD,KAAK,UAAU;EACf,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;AACF;;AAaA,MAAa,iBAAiB,MAC3B,KAAK,MAAQ,KAAK,MAClB,KAAK,MAAQ,KAAK,OAClB,KAAK,OAAQ,KAAK,OAClB,KAAK,OAAQ,KAAK,OAClB,KAAK,OAAQ,KAAK,OAClB,KAAK,OAAS,KAAK,OACnB,KAAK,OAAS,KAAK,QACnB,KAAK,QAAU,KAAK,QACpB,KAAK,QAAU,KAAK,QACpB,KAAK,SAAU,KAAK,SACpB,KAAK,SAAU,KAAK,SACpB,KAAK,SAAU,KAAK,SACpB,KAAK,SAAU,KAAK,SACpB,KAAK,SAAW,KAAK;;AAGxB,MAAa,cAAc,MAAuB,MAAM,MAAQ,cAAc,CAAC;;AAG/E,MAAa,aAAa,MACxB,WAAW,CAAC,KACZ,MAAM,MACL,KAAK,MAAQ,KAAK,MACnB,MAAM,OACL,KAAK,OAAS,KAAK,OACnB,KAAK,QAAU,KAAK;AAkCvB,MAAM,QAAW,SAAiB,OAChC,OAAO,KAAK;CAAE;CAAS;AAAG,CAAC;AAE7B,MAAM,aAAa;;AAGnB,MAAM,KAAc,OAAO,OACzB,OAAO,OACL,OAAO,IACL,MAAM,UAAU,UAAW,EAAE,KAAK,EAAE,CAAC,GACrC,OAAO,SAAS,MAAM,QAAQ,GAAG,GAAG,MAAM,SAAS,QAAQ,CAAC,CAC9D,CAAC,CAAC,KAAK,OAAO,SAAS,UAAU,CAAC,CACpC,CACF;AAEA,MAAM,OAAO,MAAyB,MAAM,QAAQ,CAAC;AAErD,MAAM,eAA0B,OAAO,IAAI,OAAO,SAAS,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAClF,OAAO,SAAS,KAAK,CACvB;;AAGA,MAAM,OAAO,MAAyB,OAAO,SAAS,IAAI,MAAM,QAAQ,CAAC,CAAC;;AAG1E,MAAM,SAAS,UACb,OAAO,SAAS,IAAI,OAAO,IAAI,OAAO,KAAK,OAAO,KAAK,MAAM,MAAM,KAAK,CAAC,CAAC,CAAC;;AAG7E,MAAM,SAAoB,OAAO,MAC/B,OAAO,SAAS,IAAI,GAAG,GAAG,MAAM,UAAUA,OAAqB,EAAE,KAAK,EAAE,CAAC,CAAC,CAC5E;AAEA,MAAM,aAAa,SAA4B,OAAO,KAAK,OAAO,QAAQ,MAAM,MAAM,IAAI,CAAC;;AAG3F,MAAM,WAAsB,OAAO,WAAWC,UAAwB,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC;;;;;;AAO1F,MAAM,QAAQ,MACZ,OAAO,SAAS,OAAO,KAAK,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,KAAK,OAAO,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC;AAG/F,MAAM,iBAAiB;;AAGvB,MAAM,SAAqB,OAAO,IAAI,OAAO,UAAUC,UAAsB,OAAO,QAAQ,CAAC,CAAC,KAC5F,OAAO,KAAK,CAAC,IAAI,OAAO,UAAmB;CACzC,MAAM;CACN;CACA;CACA,SAAS,MAAM,KAAK,MAAM,MAAM;AAClC,EAAE,CACJ;AAEA,MAAM,QAAoB,OAAO,IAAI,OAAO,UAAUC,YAA0B,CAAC,CAAC,KAChF,OAAO,KAAK,CAAC,IAAI,EAAE,QAAQ,cAAuB;CAAE,MAAM;CAAS;CAAQ;CAAO;AAAG,EAAE,CACzF;;AAGA,MAAM,OAAgB,OAAO,MAAY,UAAU;CACjD,EAAE,KAAK,MAAM;AAEf,CAAC;;AAGD,MAAM,UAAmB,OAAO,MAAY,UAAU;CACpD,EAAE,MAAM,MAAM;AAEhB,CAAC;;AAGD,MAAM,aAA8B,OAAO,UAAU,MAAMD,UAAsB,OAAO,CAAC,CAAC,KACxF,OAAO,KAAK,UAAU,EAAE,SAAS,KAAK,CAAC,CACzC;;;;;;AAOA,MAAM,YAA6B,OAAO,SACxC,MACA,OAAO,MACL,OAAO,IAAI,OAAO,IAAID,QAAsB,GAAG,IAAI,GAAG,GAAG,OAAO,IAAIG,OAAqB,CAAC,CAC5F,CACF,CAAC,CAAC,KAAK,OAAO,KAAK,SAAS,EAAE,WAAW,IAAI,CAAC,CAAC;;AAG/C,MAAM,MAAkB,OAAO,IAAI,QAAQ,KAAK,CAAC,CAAC,KAAK,OAAO,SAAS,QAAQ,CAAC;AAEhF,MAAM,OAAwB,OAAO,cAAc,OAAO;AAC1D,MAAM,MAAe,OAAO,cAAc,MAAM;AAChD,MAAM,iBAAiB,cACrB,OAAO,cAAe,YAAY,oBAAoB,kBAAmB;;AAG3E,MAAM,OAAO,MACX,OAAO,WAAiB;CACtB,EAAE;AAEJ,CAAC;AAEH,MAAM,OAAOC,QAAa,QAAQ,IAAI,OAAO;AAC7C,MAAM,QAAQA,QAAa,SAAS,IAAI,OAAO;;;;;;AAO/C,MAAM,cAAuB,OAAO,MAAY,UAAU;CAExD,MAAM,QAAQ,MAAM;CACpB,MAAM,WAAW,MAAc;EAC7B,MAAM,IAAI,MAAM,WAAW,CAAC;EAC5B,OAAO,KAAK,MAAQ,KAAK;CAC3B;CACA,MAAM,IAAI,MAAM,WAAW,MAAM,GAAG;CAOpC,OALE,QAAQ,MAAM,GAAG,KAChB,MAAM,MAAQ,QAAQ,MAAM,MAAM,CAAC,MAClC,MAAM,MAAQ,MAAM,QACnB,QAAQ,MAAM,MAAM,CAAC,KACnB,MAAM,WAAW,MAAM,MAAM,CAAC,MAAM,MAAQ,QAAQ,MAAM,MAAM,CAAC,KAC5D,KAAA,IAAY,MAAM,UAAU,SAAS,cAAc;AACjE,CAAC;AAED,MAAM,iBAAiB,CAAC,UAAU;AAElC,MAAM,UAA2B,OAAO,SAAS,aAAaC,cAA4B,CAAC,CAAC,KAC1F,OAAO,KAAK,CAAC,SAAS,UACpBD,QACE,SACA,SAAS,WAAW,IAAI,SAAS,SAAS,YAAY,IAAI,UAAU,IAAI,OAC1E,CACF,CACF;AAQA,MAAM,aAAa,OAAO,KAAc;AACxC,MAAM,cAA6B;CAAE,UAAU;CAAI,UAAU;AAAW;AAExE,MAAM,aAA8B,OAAO,IACzCE,eACA,OAAO,IACL,OAAO,SAAS,OAAO,KAAK,IAAI,GAAG,CAAC,GAAG,OAAO,IAAIC,OAAqB,CAAC,CAAC,CAAC,KACxE,OAAO,KAAK,cAA6B;CAAE;CAAU,UAAU;AAAW,EAAE,CAC9E,GACA,OAAO,SAAS,IAAI,IAAI,GAAG,OAAO,IAAI,OAAO,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,KAC/D,OAAO,KAAK,cAA6B;CAAE,UAAU;CAAI,UAAU,OAAO,KAAK,QAAQ;AAAE,EAAE,CAC7F,GACA,OAAO,QAAQ,WAAW,CAC5B,CACF,CAAC,CAAC,KAAK,OAAO,KAAK,CAAC,OAAO,EAAE,UAAU,gBAAgB,EAAE,QAAQ,OAAO,UAAU,QAAQ,CAAC,CAAC;AAE5F,MAAM,WAA4B,OAAO,SACvC,IAAI,GAAG,GACP,OAAO,IACL,OAAO,MACL,OAAO,IAAI,MAAM,MAAMC,QAAsB,GAAG,MAAM,UAAUC,OAAqB,CAAC,CACxF,CACF,CAAC,CAAC,KAAK,OAAO,SAAS,iBAAiB,CAAC,CAC3C,CAAC,CAAC,KAAK,OAAO,KAAK,SAAS,EAAE,SAAS,IAAI,CAAC,CAAC;AAE7C,MAAM,QAAyB,OAAO,SACpC,OAAO,KAAK,IAAI,IAAI,CAAC,GACrB,OAAO,IAAA,eAAiC,KAAK,OAAO,SAAS,oBAAoB,CAAC,CAAC,CACrF,CAAC,CAAC,KAAK,OAAO,KAAK,UAAU,EAAE,cAAc,KAAK,CAAC,CAAC;;;;;;AAOpD,MAAM,UAA2B,OAAO,SACtC,IAAI,GAAG,GACP,OAAO,IACL,OAAO,IACL,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,UAAU,EAAE,WAAW,CAAC,CAAC,GAC9C,OAAO,SACL,OAAO,IACL,OAAO,SAAS,OAAO,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI,OAAO,SAAS,IAAI,GAAG,CAAC,CAAC,IAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAC5B,GACA,OAAO,IAAI,OAAO,WAAW,KAAK,YAAY,CAAC,CACjD,CAAC,CAAC,KAAK,OAAO,UAAU,EAAE,MAAM,CAAC,CAAC,GAClC,OAAO,SACL,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,GAChC,OAAO,WAAW,KAAK,YAAY,CACrC,CAAC,CAAC,KAAK,OAAO,UAAU,EAAE,MAAM,CAAC,CAAC,CACpC,CACF,CACF;;AAGA,MAAM,aAA8B,OAAO,UACzC,IAAI,GAAG,GACP,OAAO,IAAI,OAAO,OAAO,OAAO,SAAS,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GACrE,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,SAAS,KAAK,CAAC,CAAC,CAClD,CAAC,CAAC,KAAK,OAAO,KAAK,UAAU,IAAIC,WAAiB,KAAK,CAAC,CAAC;;AAGzD,MAAM,UAA2B,OAAO,SACtC,IAAI,GAAG,GACP,OAAO,IACL,OAAO,UACL,UAAU,EAAE,YAAY,CAAC,GACzB,cAAc,IAAI,GAClB,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,SAAS,KAAK,CAAC,CAAC,CAClD,CACF,CACF,CAAC,CAAC,KACA,OAAO,UAAU;CACf,MAAM,IAAI,EAAE,aAAa;CACzB,OAAO,EAAE,SAAS,IAAI,OAAO;AAC/B,CAAC,CACH;;AAGA,MAAM,gBAAgB;;AAGtB,MAAM,iBAAiB,MAAwB,KAAK,MAAQ,KAAK,OAAU,KAAK,MAAQ,KAAK;;AAG7F,MAAM,mBAAmB,MACvB,cAAc,CAAC,KAAM,KAAK,MAAQ,KAAK,MAAS,MAAM,MAAQ,MAAM;;AAGtE,IAAI,YAAY;AAChB,IAAI,UAAU;AAEd,MAAM,mBAA4B;CAChC,IAAI,CAAC,gBAAgB,UAAU,WAAW,OAAO,CAAC,GAAG,OAAO;CAC5D;CACA,OAAO;AACT;AAEA,MAAM,kBAA2B;CAC/B,MAAM,IAAI,UAAU,WAAW,OAAO;CACtC,IAAI,CAAC,gBAAgB,CAAC,KAAK,MAAM,MAAQ,MAAM,IAAM,OAAO;CAC5D;CACA,OAAO;AACT;;AAGA,MAAM,UAAU,MAAqB,OAAe,QAAwB;CAC1E,YAAY;CACZ,UAAU;CACV,KAAK,IAAI;CACT,OAAO;AACT;;;;;;;;AASA,MAAM,aAA8B,OAAO,MAAM,UAAU;CACzD,MAAM,QAAQ,MAAM;CACpB,MAAM,QAAQ,MAAM;CACpB,MAAM,QAAQ,cAAc,MAAM,WAAW,KAAK,CAAC,IAC/C,OAAO,YAAY,OAAO,QAAQ,CAAC,IACnC;CACJ,IAAI,MAAM,WAAW,KAAK,MAAM,IAAM,OAAO,MAAM,UAAU,OAAO;CAEpE,MAAM,QAAQ,MAAM,WAAW,QAAQ,CAAC;CACxC,MAAM,IACJ,UAAU,MAAQ,UAAU,MAAQ,EAAE,gBAAgB,KAAK,KAAK,UAAU,MACtE,QAAQ,IACR,OAAO,WAAW,OAAO,QAAQ,CAAC;CACxC,MAAM,IAAI,MAAM,WAAW,CAAC;CAC5B,IAAI,MAAM,MAAQ,MAAM,MAAQ,KAAK,KAAM,OAAO,MAAM,UAAU,OAAO;CAEzE,MAAM,QACJ,MAAM,WAAW,IAAI,CAAC,MAAM,MAAQ,IAAI,QAAQ,IAC5C,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,QAAQ,eAAe,EAAE,IACnD,MAAM,MAAM,QAAQ,GAAG,CAAC;CAC9B,EAAE,KAAK;CACP,MAAM,MAAM,QAAQ,IAAI,MAAM;CAC9B,OAAO,EAAE,gBAAgB,MAAM,MAAM,OAAO,KAAK,GAAG,KAAK;AAC3D,CAAC;AAED,MAAM,WAA4B,OAAO,IACvC,OAAO,IAAI,YAAY,SAAS,GAChC,OAAO,IAAI,OAAO,UAAU,QAAQ,CAAC,CAAC,KACpC,OAAO,KAAK,CAAC,IAAI,OACf,MAAM,SACF,OACA,MAAM,UACJ,QACA,EAAE,MAAM,4CAA4C,EAAE,IAAI,EAAE,CACpE,CACF,CACF;;;;;;;AAQA,MAAM,QAAW,MAAkB,OAAO,cAAc,CAAC;AAEzD,MAAM,WAA4B,KAChC,OAAO,IACL,YACA,YACA,UACA,UAAU,OAAO,CAAC,CAAC,KAAK,OAAO,GAAiB,IAAI,CAAC,GACrD,UAAU,QAAQ,CAAC,CAAC,KAAK,OAAO,GAAiB,KAAK,CAAC,GACvD,OACA,SACA,QACF,CACF;AAEA,MAAM,WAA4B,OAAO,SACvC,IACA,OAAO,IAAI,SAAS,YAAY,SAAS,QAAQ,CAAC,CAAC,KAAK,OAAO,SAAS,QAAQ,CAAC,CACnF;;AAGA,MAAM,UAA2B,OAAO,SACtC,OAAO,IAAI,WAAW,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC,GACjD,OAAO,OACL,OAAO,SACL,OAAO,IACL,OAAO,SACL,IACA,OAAO,IAAI,IAAI,GAAG,GAAG,OAAO,WAAW,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CACxE,IACC,QAAQ,EAAE,KAAK,KAAK,GAAG,CAC1B,GACA,OAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,SAAS,EAAE,KAAK,IAAI,CAAC,CACzD,CACF,CACF,CAAC,CAAC,KAAK,OAAO,UAAU,EAAE,QAAQ,CAAC,CAAC;AAEpC,MAAM,YAA6B,KACjC,OAAO,IACL,IAAI,IAAI,CAAC,CAAC,KAAK,OAAO,GAAiB,IAAI,OAAO,CAAC,GACnD,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,GAAiB,MAAM,CAAC,GAE7C,OAAO,SAAS,OAAO,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,KACjF,OAAO,GAAiB,IAAI,WAAW,CACzC,GACA,OAAO,IAAI,KAAK,GAAG,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,GAAiB,IAAI,IAAI,CAAC,CAC/E,CACF;;AAGA,MAAM,OAAgB,OAAO,SAC3B,IACA,OAAO,OACL,OAAO,IACL,OAAO,IAAI,YAAY,cAAc,EAAE,KAAK,WAAW,KAAK,CAAC,GAC7D,OAAO,IACL,OAAO,SACL,OAAO,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,GAChE,OAAO,IAAI,IAAI,CACjB,IACC,cAAc,EAAE,KAAK,WAAW,IAAI,CACvC,GACA,OAAO,IACL,OAAO,SAAS,OAAO,IAAI,KAAK,KAAK,GAAG,UAAU,MAAM,CAAC,GAAG,OAAO,IAAI,IAAI,CAAC,IAC3E,cAAc,EAAE,KAAK,WAAW,KAAK,CACxC,GACA,OAAO,SACL,OAAO,IAAI,KAAK,IAAI,GAAG,UAAU,KAAK,CAAC,GACvC,OAAO,IACL,OAAO,WACL,MACA,OAAO,SAAS,IAAI,OAAO,IAAI,KAAK,IAAI,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,KAC5D,OAAO,SAAS,qBAAqB,CACvC,CACF,CACF,CACF,CAAC,CAAC,KAAK,OAAO,KAAK,cAAc,EAAE,KAAK,WAAW,IAAI,CAAC,CAAC,GACzD,OAAO,IAAI,OAAO,cAAc,EAAE,KAAK,WAAW,KAAK,CAAC,CAC1D,CACF,CACF;AAEA,MAAM,aAAyB,OAAO,UACpC,OAAO,IAAI,OAAO,WAAW,EAAE,OAAO,MAAM,CAAC,GAC7C,IAAI,GAAG,GACP,EAAE,KAAK,EAAE,CACX,CAAC,CAAC,KAAK,OAAO,SAAS,WAAW,CAAC;AAEnC,MAAM,aAAa,OAAO,OAAO,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC;AAErD,MAAM,SAAkB,OAAO,OAC7B,OAAO,WACL,OAAO,IACL,OAAO,IAAI,MAAM,OAAO,IAAI,UAAU,CAAC,GACvC,OAAO,OACL,OAAO,SACL,YACA,OAAO,SAAS,OAAO,IAAI,MAAM,KAAK,CAAC,GAAG,OAAO,IAAI,OAAO,IAAI,MAAM,UAAU,CAAC,CAAC,CACpF,CACF,CACF,GACA,OAAO,IAAI,UAAU,CACvB,CACF;AAEA,MAAM,UAAmB,OAAO,SAC9B,OAAO,IAAI,OAAO,YAAY,EAAE,KAAK,OAAO,CAAC,GAC7C,OAAO,IAAI,OAAO,SAAS,OAAO,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO,QAAQ,KAAA,CAAS,CAAC,GAAG,GAAG,CACtF,CAAC,CAAC,KAAK,OAAO,UAAU,KAAK,EAAE,MAAM,CAAC,CAAC;;AAGvC,MAAM,aAAsB,OAAO,OACjC,OAAO,IACL,OAAO,SACL,IACA,OAAO,WACL,OAAO,IAAIV,QAAsB,GACjC,IAAI,GAAG,CAAC,CAAC,KAAK,OAAO,SAAS,+BAA6B,CAAC,CAC9D,CACF,GACA,OAAO,SAAS,IAAI,MAAM,CAC5B,CAAC,CAAC,KACA,OAAO,KAAK,CAAC,QAAQ,SACnB,EAAE,OACA,OAAO,UAAU,cAAc,EAAE,GACjC,GACF,CACF,CACF,CACF;AAEA,MAAM,WAAoB,OAAO,OAC/B,OAAO,SAAS,IAAI,MAAM,CAAC,CAAC,KAC1B,OAAO,KAAK,QAAQ;CAClB,EAAE,OAAO,OAAO,KAAK,EAAE,IAAI,GAAG,CAAC;AACjC,CAAC,CACH,CACF;AAEA,MAAM,cAAc,cAClB,OAAO,IACL,OAAO,SAAS,OAAO,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO,QAAgC,CAAC,CAAC,CAAC,GACpF,OAAO,UAAU,OAAO,SAAS,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CACjE,CAAC,CAAC,KACA,OAAO,KAAK,SAAS,EAAE,SAAS,WAAW,IAAI,CAAC,GAChD,OAAO,MACT;;AAGF,MAAM,kBAA2B,KAC/B,OAAO,SACL,IACA,OAAO,IACL,OAAO,SACL,OAAO,WACL,MAAM,SAAS,QAAQ,GACvB,OAAO,IAAI,MAAM,MAAM,CAAC,MAAMS,OAAqB,CAAC,CAAC,CACvD,GACA,OAAO,IAAI,UAAU,CACvB,GACA,OAAO,SACL,OAAO,WACL,MAAM,SAAS,MAAM,GACrB,OAAO,IAAI,MAAM,MAAM,CAAC,MAAMA,OAAqB,CAAC,CAAC,CACvD,GACA,OAAO,IAAI,QAAQ,CACrB,CACF,CACF,CACF;AAEA,MAAM,cAAuB,KAC3B,OAAO,IACL,OAAO,SAAS,UAAU,SAAS,GAAG,OAAO,IAAI,UAAU,CAAC,GAC5D,OAAO,SAAS,UAAU,OAAO,GAAG,OAAO,IAAI,QAAQ,CAAC,GACxD,OAAO,SAAS,UAAU,SAAS,GAAG,OAAO,IAAI,WAAW,IAAI,CAAC,CAAC,GAClE,OAAO,SAAS,UAAU,UAAU,GAAG,OAAO,IAAI,WAAW,KAAK,CAAC,CAAC,GACpE,OAAO,SACL,OAAO,KAAK,UAAU,WAAW,CAAC,GAClC,OAAO,IACL,OAAO,SAAS,KACd,OAAO,QAAQ,OAAO,KAAW,2CAA2C,EAAE,CAAC,CACjF,CACF,CACF,CACF,CACF;AAEA,MAAM,YAAqB,OAAO,SAAS,IAAI,OAAO,IAAI,aAAa,OAAO,CAAC;;AAG/E,MAAM,cAAc,cAClB,OAAO,OACL,OAAO,OACL,OAAO,SACL,OAAO,IAAI,YAAY,MAAM,GAAG,IAAI,OAAO,SAAS,IAAI,OAAO,GAAG,CAAC,GACnE,OAAO,IACL,iBACA,OAAO,IACL,OAAO,WACL,YACC,YAAY,OAAO,IAAI,IAAI,GAAG,GAAG,OAAO,KAAK,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,EAAA,CAAG,KACnE,OAAO,SAAS,KAAK,CACvB,CACF,CACF,CACF,CACF,CACF,CACF;AAEF,MAAM,oBAAoB,WAAW,IAAI;AACzC,MAAM,qBAAqB,WAAW,KAAK;AAE3C,MAAM,WAAW,SAAS,IACxB,OAAO,WAAW,oBAAoB,OAAO,SAAS,IAAI,OAAO,GAAG,CAAC,CACvE;AAMA,MAAM,eAAe;AAErB,MAAM,gBAAgB;;AAGtB,IAAM,QAAN,MAAY;CACV,UAAwB,IAAI;CAC5B,YAA0B,IAAI;CAC9B,UAAU;AACZ;;;;;;;;;AAUA,IAAM,UAAN,MAAc;CACZ,WAAoB,eAAe,MAAsB;CACzD;CACA;CACA,SAA0B,eAAe,MAA8B;;CAEvE,WAA4B,eAAe,MAAuB;CAClE,cAAsB;;CAEtB,MAAsD,CAAC;;;;;;;CAOvD,SAEI,CAAC;;CAEL,QAAgB;;;;;;;CAOhB,YAA6B,eAAe,MAA6B;;CAEzE,SAAwC,CAAC;CACzC,aAAqB;;CAErB,QAAsC,CAAC;CACvC,OAA+B,CAAC;;CAEhC,KAAK;CACL,MAAM;;CAEN,SAA4E,CAAC;CAE7E;CACA,YAAY,OAAe,SAAwB;EACjD,KAAK,QAAQ;EACb,KAAK,OAAO,QAAQ;EACpB,KAAK,cAAc,QAAQ;EAE3B,SAAS,QAAQ,MAAM,SAAS,2BAA2B,IAAI,GAAG,WAAW;GAC3E,eAAe,IAAI,KAAK,UAAU,GAAG,KAAK,cAAc,SAAS,MAAM,IAAI;EAC7E,CAAC;CACH;;CAGA,MAAM,SAAiB,IAA0B;EAC/C,IAAI,IAAI,qBAAqB,KAAK,MAAM,GAAG,KAAK,OAAO,KAAK;GAAE;GAAS;EAAG,CAAC;EAC3E,OAAO,IAAI;CACb;CAEA,cAAoB;EAClB,KAAK,IAAI,KAAK,CAAC,CAAC;EAChB,KAAK;CACP;CAEA,eAA8B;EAC5B,IAAI,KAAK,OAAO,GAAG,EAAE,CAAC,GAAG,OAAO,KAAK,OAAO,KAAK,OAAO,IAAI;EAC5D,KAAK;EACL,OAAO,IAAIE,QAAc,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC;CAC/C;;CAGA,KAAK,SAA6B;EAChC,MAAM,QAAS,KAAK,OAAO,KAAK,kBAAkB,IAAI,MAAM;EAC5D,MAAM,UAAU;EAChB,MAAM,YAAY,IAAI;EACtB,MAAM,UAAU;CAClB;;CAGA,QAAsB;EACpB,MAAM,QAAQ,KAAK,OAAO,EAAE,KAAK;EACjC,OAAO,UAAU,KAAA,IAAY,IAAI,MAAM,MAAM;CAC/C;CAEA,KAAK,WAAyB,SAAwB;EACpD,MAAM,QAAQ,KAAK,OAAO,KAAK,aAAa;EAC5C,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,YAAY;EAClB,MAAM,UAAU;CAClB;;CAGA,OAAO,QAA4B;EACjC,MAAM,QAAQ,KAAK,OAAO,KAAK,aAAa;EAC5C,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,MAAM,SAAS,KAAK,KAAK,QAAQ,MAAM,WAAW,MAAM,OAAO;OAC9D,KAAK,KAAK,MAAM,SAAS,MAAM,WAAW,MAAM;CACvD;;CAGA,KAAK,WAA+B;EAClC,MAAM,MAAM,KAAK,KAAK,IAAI;EAC1B,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;EACrC,MAAM,OAAO,KAAK,WAAW;EAC7B,IAAI,QAAQ,KAAK,KAAK,KAAK,MAAM,WAAW,IAAI;OAC3C,KAAK,KAAK,MAAM,WAAW,IAAI;EACpC,KAAK,MAAM,KAAK,IAAI;CACtB;CAEA,UAAwB;EACtB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,OAAO,QAAgB,KAAoB;EACzC,eAAe,IAAI,KAAK,UAAU,QAAQ,KAAK,IAAI,GAAG,CAAC;CACzD;CAEA,SAAS,WAAoB,MAAoC;EAC/D,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,SAAS,SAAS;GACrB,MAAM,aAAa,KAAK,IAAI,IAAI;GAChC,eAAe,IACb,OACA,YACA,YAAY,KAAK,YAAY,UAAU,IAAI,KAAK,WAAW,CAC7D;EACF,CAAC;CACH;CAEA,SAAS,MAA6B;EACpC,MAAM,QAAQ,KAAK,UAAU,QAAQ,IAAI,IAAI;EAC7C,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,MAAM,OAAO,IAAIC,SAAc,IAAI;EACnC,eAAe,IAAI,KAAK,WAAW,MAAM,IAAI;EAC7C,OAAO;CACT;;CAGA,QAAQ,OAAe,UAAkB,UAAgD;EACvF,IAAI,aAAa,IAAI,OAAOR,QAAa,OAAO,QAAQ;EACxD,IAAI,OAAO,OAAO,QAAQ,GAAG,OAAOA,QAAa,KAAK;EACtD,MAAM,OAAO,KAAK,IAAI,SAAS,KAAK;EACpC,MAAM,MAAM,KAAK,WAAW,KAAK,IAAI,IACjC,cAAc,KAAK,KAAK,MAAM,KAAK,KAAK,MAAM,CAAC,IAC/C;EACJ,IAAI,QAAQ,MAEV,OAAOA,QAAa,OAAO;GACzB,UAAU,IAAI,MAAM;GACpB,WAAW,IAAI,OAAO,QAAQ,QAAQ;EACxC,CAAC;EAEH,OAAOA,QAAa,OAAO,IAAIS,UAAe,IAAI,CAAC;CACrD;CAEA,IAAI,MAAuB;EACzB,IAAI,UAAU,SAAS,MAAM,QAAQ,GAAG;GACtC,IAAI,KAAK,WAAW,eAAe,KAAK,KAAK,KAAK,GAAG;IACnD,KAAK,MAAM,oCAAoC,KAAK,EAAE;IACtD,OAAO,KAAK;GACd;GACA,OAAO,KAAK,WAAW,KAAK,KAAK;EACnC;EACA,MAAM,KAAK,KAAK,SAAS,QAAQ,IAAI,KAAK,MAAM;EAChD,IAAI,OAAO,KAAA,GAAW,OAAO,KAAK,KAAK;EAEvC,IAAI,KAAK,WAAW,IAAI,OAAO,KAAK,WAAW,GAAG,IAAI,KAAK;EAC3D,KAAK,MAAM,sBAAsB,KAAK,OAAO,KAAK,KAAK,EAAE;EACzD,OAAO,KAAK;CACd;CAEA,WAAmB,OAAuB;EACxC,OAAO,OAAO,OAAO,KAAK,IAAI,IAAI,QAAQC,QAAY,OAAO,KAAK,KAAK,KAAK;CAC9E;;CAGA,QAAqE;EACnE,MAAM,MAAM,KAAK,OAAO,GAAG,EAAE;EAC7B,IAAI,QAAQ,KAAA,KAAa,IAAI,OAAO,KAAK,OAAO,OAAO,IAAI;EAC3D,MAAM,QAAQ,eAAe,MAA4B;EACzD,KAAK,OAAO,KAAK,CAAC,KAAK,OAAO,KAAK,CAAC;EACpC,OAAO;CACT;;;;;;;CAQA,WAA4B,eAAe,MAA8B;CACzE,aAA8B,eAAe,MAG3C;;CAGF,SAAS,OAA6B;EACpC,IAAI,KAAK,MAAM,KAAK,KAAK,MAAM,MAAM,UAAU,eAAe,KAAK,KAAK,GACtE,OAAO,KAAK,MAAM,oCAAoC,KAAK,EAAE;EAE/D,OAAO,KAAK,OAAO,KAAK,UAAU,KAAK,WAAW,KAAK,CAAC,CAAC;CAC3D;;CAGA,WAAW,MAA4B;EACrC,MAAM,QAAQ,KAAK,QAAQ,GAAG;EAC9B,MAAM,MAAM,KAAK,MAAM,QAAQ,CAAC;EAEhC,OAAO,KAAK,gBACV,KAAK,MAAM,GAAG,KAAK,GACnB,IAAI,SAAS,IAAI,IAAI,IAAI,QAAQ,cAAc,IAAI,IAAI,GACzD;CACF;;CAGA,gBAAgB,QAAgB,OAA6B;EAC3D,MAAM,KAAK,KAAK,SAAS,QAAQ,IAAI,MAAM;EAC3C,IAAI,OAAO,KAAA,GAAW,OAAO,KAAK,OAAO,KAAK,UAAU,IAAI,KAAK,CAAC;EAClE,OAAO,KAAK,MAAM;GAAE,MAAM;GAAS;GAAQ;GAAO,IAAI,KAAK;EAAG,CAAC;CACjE;;CAGA,MAAM,MAA6B;EACjC,OAAO,KAAK,OAAO,KAAK,QAAQ,IAAI,CAAC;CACvC;;CAGA,OAAe,OAAqC;EAElD,IAAI,IAAI,qBAAqB,KAAK,MAAM,GAAG,OAAO;EAIlD,OAHc,KAAK,OAAO,UAAU,GAAG,gBACrC,eAAe,IAAI,YAAY,MAAM,KAAK,CAEjC,CAAC,GAAG,EAAE,CAAC,QAAQ,IAAI,MAAM,KAAK,KAAK;CAChD;CAEA,QAAgB,MAA+B;EAC7C,IAAI,UAAU,SAAS,MAAM,OAAO,GAAG;GACrC,MAAM,KAAK,KAAK,SAAS,QAAQ,IAAI,KAAK,MAAM;GAChD,IAAI,OAAO,KAAA,GAAW,OAAO,KAAK,UAAU,IAAI,KAAK,KAAK;EAC5D;EACA,OAAO,KAAK,UAAU,KAAK,IAAI,IAAI,CAAC;CACtC;CAEA,UAAkB,OAA+B;EAC/C,MAAM,QAAQ,KAAK,SAAS,QAAQ,IAAI,KAAK;EAC7C,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,MAAM,QAAQ,IAAID,UAAe,KAAK;EACtC,eAAe,IAAI,KAAK,UAAU,OAAO,KAAK;EAC9C,OAAO;CACT;;CAGA,UAAkB,IAAY,OAA+B;EAC3D,IAAI,cAAc,KAAK,WAAW,QAAQ,IAAI,KAAK;EACnD,IAAI,gBAAgB,KAAA,GAAW;GAC7B,cAAc,CAAC;GACf,eAAe,IAAI,KAAK,YAAY,OAAO,WAAW;EACxD;EACA,MAAM,QAAQ,YAAY,MAAM,CAAC,eAAe,cAAc,EAAE;EAChE,IAAI,UAAU,KAAA,GAAW,OAAO,MAAM;EACtC,MAAM,QAAQ,IAAIA,UAAe,KAAK,KAAK;EAC3C,YAAY,KAAK,CAAC,IAAI,KAAK,CAAC;EAC5B,OAAO;CACT;CAEA,KAAa,SAAuB,WAAyB,QAA4B;EACvF,KAAK,IAAI,GAAG,EAAE,CAAC,EAAE,KAAK,IAAIE,UAAgB,SAAS,WAAW,MAAM,CAAC;CACvE;CAEA,aAA6B;EAC3B,MAAM,QAAQ,KAAK,WAAW;EAE9B,OAAO,IAAIC,UAAe,KAAK,SAAS,QAAQ,IAAI,KAAK,IAAI,KAAK,UAAU,IAAI,KAAK;CACvF;CAEA,aAA6B;EAC3B,OAAO,GAAG,KAAK,YAAY,IAAI,KAAK,cAAA,CAAe,SAAS,EAAE;CAChE;;CAGA,YAA4B;EAC1B,IAAI,QAAQ,KAAK,WAAW;EAC5B,WAAW;GACT,IAAI,CAAC,KAAK,SAAS,QAAQ,IAAI,KAAK,GAAG,OAAO;GAC9C,QAAQ,KAAK,WAAW;GACxB,OAAO;EACT,CAAC;EACD,OAAO;CACT;CAEA,cAAc,OAA+B;EAC3C,MAAM,QAAQ,KAAK,OAAO,QAAQ,IAAI,KAAK;EAC3C,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,MAAM,OAAO,IAAIA,UAAe,GAAG,KAAK,cAAc,OAAO;EAC7D,eAAe,IAAI,KAAK,QAAQ,OAAO,IAAI;EAC3C,OAAO;CACT;CAEA,YAAoB,YAAmC;EACrD,MAAM,QAAQ,WAAW,KAAK,UAAU,CAAC,GAAG,MAAM;EAClD,MAAM,OAAO,2BAA2B,KAAK,KAAK,IAAI,QAAQ;EAC9D,IAAI,OAAO;EACX,IAAI,eAAe,IAAI,KAAK,WAAW,IAAI,GACzC,MAAM,MAAM;GACV,OAAO,GAAG,KAAK,GAAG,IAAI;GACtB,OAAO,eAAe,IAAI,KAAK,WAAW,IAAI;EAChD,CAAC;EAEH,MAAM,OAAO,IAAIJ,SAAc,IAAI;EACnC,eAAe,IAAI,KAAK,WAAW,MAAM,IAAI;EAC7C,OAAO;CACT;AACF;;AAGA,IAAI,IAAa,IAAI,QAAQ,IAAI;CAAE,SAAS,OAAO,KAAK;CAAG,iBAAiB;AAAG,CAAC;AAMhF,MAAM,UAAU,OAAe,SAAiB,OAAsB;CACpE,MAAM,MAAM,KAAK,IAAI,IAAI,MAAM,MAAM;CAErC,MAAM,QAAQ,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI;CAC5C,MAAM,UAAU,MAAM,GAAG,EAAE,KAAK,GAAA,CAAI,SAAS;CAC7C,MAAM,IAAI,cAAc,SAAS,MAAM,QAAQ,MAAM;AACvD;AAEA,MAAM,YAAY,OAAe,OAC/B,MAAM,MAAM,SAAS,iBAAiB,IAAI,OAAO,cAAc,MAAM,YAAY,EAAE,KAAK,CAAC,EAAE;;AAG7F,MAAaK,WAAS,OAAe,YAA2C;CAC9E,IAAI,IAAI,QAAQ,OAAO,OAAO;CAC9B,EAAE,YAAY;CACd,MAAM,SAAS,OAAO,MAAM,UAAU,KAAK;CAC3C,IAAI,OAAO,UAAU,MAAM,GAAG;EAC5B,MAAM,QAAQ,OAAO;EACrB,IAAI,MAAM,UAAU,KAAA,GAAW,OAAO,OAAO,OAAO,MAAM,MAAM,SAAS,MAAM,MAAM,EAAE;EACvF,MAAM,QAAQ,SAAS,OAAO,MAAM,MAAM;EAC1C,MAAM,WAAW,MAAM,SAAS,QAAQ,MAAM,MAAM,UAAU;EAC9D,MAAM,UACJ,IAAI,qBAAqB,QAAQ,KAAK,SAAS,SAAS,IACpD,cAAc,UACd,YAAY,SAAS,KAAK,MAAM,EAAE,aAAa;EACrD,OAAO,OAAO,OAAO,SAAS,MAAM,MAAM;CAC5C;CACA,MAAM,QAAQ,EAAE,OAAO,GAAG,CAAC;CAC3B,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,OAAO,MAAM,SAAS,MAAM,EAAE;CACrE,OAAO;EACL,SAAS,EAAE,aAAa;EACxB,UAAUC,KAAe,EAAE,QAAQ;EACnC,SAAS,OAAO,eAAe,EAAE,IAAI;CACvC;AACF;;;;;;;;AC3+BA,MAAM,cAAc,MAAuB;CACzC,MAAM,MAAM,MAAM,KAAK,GAAG,SAAS;CACnC,IAAI,CAAC,IAAI,wBAAwB,GAAG,GAAG,OAAO;CAC9C,IAAI,CAAC,cAAc,IAAI,EAAE,GAAG,OAAO;CACnC,IAAI,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,OAAO,IAAM,OAAO;CAC3D,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,MAAM,MAAM,MAAQ,UAAU,CAAC,CAAC;AAC7D;;AAGA,MAAM,aAAa,OAAuB,GAAG,YAAY,CAAC,KAAK;;AAG/D,MAAM,aAAa,MAAuB;CACxC,MAAM,MAAM,MAAM,KAAK,GAAG,SAAS;CACnC,OAAO,IAAI,wBAAwB,GAAG,KAAK,WAAW,IAAI,EAAE,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,SAAS;AAC/F;AAEA,MAAM,cAAc;AACpB,MAAM,UAAU;AAChB,MAAM,UAAU;AAChB,MAAM,SAAS;;AAkBf,MAAa,SAAS,MAAqB,YACzC,IAAI,OAAO,MAAM,OAAO,CAAC,CAAC,IAAI;AAEhC,IAAM,SAAN,MAAa;CACX;CACA;CACA;CACA,eAAgC,eAAe,MAAc;CAC7D,SAA0B,eAAe,MAAyB;CAClE,cAA+B,eAAe,MAAsB;CACpE,aAA8B,eAAe,MAAc;CAC3D,WAA4B,eAAe,MAAsB;;CAEjE,eAAgC,eAAe,MAAsC;CACrF,YAA6B,eAAe,MAAc;CAC1D,UAA2B,eAAe,MAAc;CAExD;CACA,YAAY,MAAqB,SAAwB;EACvD,KAAK,OAAO;EACZ,KAAK,WAAW,QAAQ;EACxB,KAAK,OAAO,QAAQ;EACpB,KAAK,OAAO,QAAQ;CACtB;CAEA,MAAc;EACZ,KAAK,QAAQ,KAAK,IAAI;EACtB,eAAe,QAAQ,KAAK,SAAS,MAAM,UAAU;GACnD,IAAI,CAAC,KAAK,aAAa,KAAK,QAAQ,KAAK,CAAC,KAAK,QAC7C,eAAe,IAAI,KAAK,WAAW,KAAK;EAE5C,CAAC;EACD,MAAM,OAAO,KAAK,YAAY,KAAK,MAAM,CAAC;EAC1C,MAAM,OAAO,OAAO,MAAM,KAAK,MAAM;GACnC,cAAc;GACd,SAAS,QAAQ,UAAUC,UAAe,GAAG,EAAE;EACjD,CAAC;EACD,MAAM,SAAS,IAAI,OACjB,IAAI,aAAa,KAAK,SAAS,QAAQ,GACvC,OACC,KAAK,CAAC,QAAQ,QACb,eAAe,IAAI,KAAK,cAAc,MAAM,IACxC,GAAG,IAAI,UAAU,OAAO,KAAKA,UAAe,EAAE,EAAE,SAChD,GACR;EACA,OAAO,WAAW,KAAK,OAAO,GAAG,OAAO,IAAI;CAC9C;;CAOA,KAAa,OAAe,GAA6B;EACvD,MAAM,QAAQ,KAAK,OAAO,QAAQ,IAAI,KAAK;EAC3C,IAAI,UAAU,KAAA,GAAW;GACvB,IAAI,MAAM,YAAY,GAAG,MAAM,SAAS;GACxC,OAAO;EACT;EACA,MAAM,OAAkB;GAAE,MAAM;GAAG,WAAW;GAAO,SAAS;GAAG,QAAQ;EAAM;EAC/E,eAAe,IAAI,KAAK,QAAQ,OAAO,IAAI;EAC3C,OAAO;CACT;CAEA,QAAgB,GAAwB;EACtC,EAAE,WAAW,SAAS,MAAM;GAC1B,KAAK,YAAY,EAAE,SAAS,GAAG,SAAS;GACxC,KAAK,YAAY,EAAE,WAAW,GAAG,WAAW;GAC5C,KAAK,YAAY,EAAE,QAAQ,GAAG,QAAQ;EACxC,CAAC;CACH;CAGA,YAAoB,GAAiB,GAAkB,UAAwB;EAC7E,IAAIC,YAAmB,CAAC,GAAG;GACzB,MAAM,OAAO,KAAK,KAAK,EAAE,OAAO,CAAC;GACjC,IAAI,aAAa,aAAa,KAAK,YAAY;QAC1C,IAAI,aAAa,WAAW,KAAK;EACxC,OAAO,IAAI,aAAaC,YACtB,EAAE,MAAM,SAAS,SAAS,KAAK,YAAY,MAAM,GAAG,MAAM,CAAC;OACtD,IAAI,aAAaC,SACtB,KAAK,QAAQ,CAAC;CAElB;;CAGA,YAAoB,SAAkD;EACpE,OAAOF,YAAmB,OAAO,KAAK,eAAe,IAAI,KAAK,WAAW,QAAQ,KAAK;CACxF;CAMA,YAAoB,GAAkB,OAAuB;EAC3D,MAAM,SAAS,eAAe,MAAqB;EACnD,EAAE,WAAW,SAAS,MAAM;GAC1B,MAAM,IAAI,EAAE,QAAQ;GACpB,IAAI,IAAI,OAAO,QAAQ,IAAI,CAAC;GAC5B,IAAI,MAAM,KAAA,GAAW;IACnB,IAAI;KAAE,OAAO;KAAG,YAAY,CAAC,CAAC;IAAE;IAChC,eAAe,IAAI,QAAQ,GAAG,CAAC;GACjC,OAAO,EAAE,WAAW,KAAK,CAAC;GAC1B,IAAI,KAAK,YAAY,EAAE,OAAO,GAC5B,eAAe,IAAI,KAAK,cAAc,EAAE,QAAQ,OAAO,EAAE,UAAU;EAEvE,CAAC;EACD,MAAM,MAAM,KAAK,KAAK,OAAO,KAAK;EAClC,MAAM,QAAuB,CAAC;EAC9B,MAAM,UAAU,MAAa;GAC3B,MAAM,UAAU,EAAE,MAAM;GACxB,IAAI,KAAK,YAAY,OAAO,GAAG;IAC7B,eAAe,IAAI,KAAK,SAAS,QAAQ,KAAK;IAC9C,MAAM,KACJ,GAAG,IAAI,IAAI,KAAK,iBAAiB,EAAE,YAAY,QAAQ,GAAG,OAAO,MAAM,KAAK,MAAM,EAAE,KACtF;IACA;GACF;GACA,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK;GACrC,MAAM,KACJ,GAAG,MAAM,KAAK,GAAG,KAAK,iBAAiB,EAAE,YAAY,OAAO,OAAO,MAAM,KAAK,MAAM,EAAE,GACxF;EACF;EACA,MAAM,WAAyB,CAAC;EAChC,eAAe,QAAQ,SAAS,MAAM;GACpC,MAAM,UAAU,EAAE,MAAM;GACxB,IAAI,KAAK,YAAY,OAAO,KAAK,KAAK,OAAO,QAAQ,IAAI,QAAQ,KAAK,CAAC,EAAE,SAAS,GAAG;IACnF,SAAS,KAAK,CAAC;IACf;GACF;GACA,OAAO,CAAC;EACV,CAAC;EAGD,SAAS,SAAS,MAAM;GACtB,MAAM,UAAU,EAAE,MAAM;GACxB,IAAI,CAACA,YAAmB,OAAO,KAAK,eAAe,IAAI,KAAK,SAAS,QAAQ,KAAK,GAAG;GACrF,eAAe,OAAO,KAAK,WAAW,QAAQ,KAAK;GACnD,OAAO,CAAC;EACV,CAAC;EACD,OAAO,MAAM,KAAK,IAAI,KAAK,IAAI,wBAAwB,KAAK,IAAI,OAAO;CACzE;CAEA,iBACE,YACA,OACA,WACQ;EACR,MAAM,cAAc,eAAe,MAGjC;EACF,WAAW,SAAS,MAAM;GACxB,MAAM,IAAI,EAAE,UAAU;GACtB,MAAM,IAAI,YAAY,QAAQ,IAAI,CAAC;GACnC,IAAI,MAAM,KAAA,GACR,eAAe,IAAI,aAAa,GAAG;IAAE,WAAW,EAAE;IAAW,SAAS,CAAC,EAAE,MAAM;GAAE,CAAC;QAC7E,EAAE,QAAQ,KAAK,EAAE,MAAM;EAChC,CAAC;EACD,OAAO,IAAI,IACT,IAAI,aAAa,eAAe,OAAO,WAAW,CAAC,IAClD,EAAE,WAAW,cACZ,GAAG,KAAK,KAAK,WAAW,KAAK,EAAE,GAAG,QAAQ,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,GACvF,CAAC,CAAC,KAAK,SAAS;CAClB;CAEA,KAAa,GAAiB,OAAuB;EACnD,IAAIG,YAAmB,CAAC,GAAG;GACzB,IAAI,EAAE,UAAU,IAAI,KAAK,OAAO,OAAO;GACvC,IAAI,EAAE,UAAU,IAAI,QAAQ,OAAO,OAAO;GAC1C,IAAI,EAAE,UAAU,IAAI,YAAY,OAAO,OAAO;GAC9C,IAAI,EAAE,UAAU,OAAO,OAAO,OAAO;EACvC;EACA,OAAO,KAAK,KAAK,GAAG,KAAK;CAC3B;CAOA,KAAa,GAAiB,OAAuB;EACnD,IAAIA,YAAmB,CAAC,GAAG,OAAO,KAAK,IAAI,EAAE,KAAK;EAClD,IAAIH,YAAmB,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,KAAK;EACrD,IAAII,UAAiB,CAAC,GAAG,OAAO,KAAK,QAAQ,CAAC;EAC9C,IAAIC,WAAkB,CAAC,GAAG,OAAO,KAAK,SAAS,CAAC;EAChD,IAAI,aAAaJ,YACf,OAAO,IAAI,qBAAqB,EAAE,KAAK,IACnC,OACA,KAAK,EAAE,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;EAE7D,OAAO,KAAK,QAAQ,GAAG,KAAK;CAC9B;CAEA,QAAgB,GAAkB,OAAuB;EACvD,IAAI,IAAI,qBAAqB,EAAE,UAAU,GAAG,OAAO;EACnD,MAAM,QAAQ,KAAK,YAAY,GAAG,QAAQ,CAAC;EAC3C,IAAI,EAAE,WAAW,WAAW,GAAG;GAC7B,MAAM,OAAO,MAAM,KAAK;GACxB,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,QAAQ,QAAQ,EAAE,EAAE;EACtF;EACA,OAAO,MAAM,QAAQ,KAAK,KAAK,OAAO,KAAK,EAAE;CAC/C;CAEA,MAAc,GAAmB,OAAuB;EACtD,IAAI,eAAe,IAAI,KAAK,WAAW,EAAE,KAAK,KAAK,CAAC,eAAe,IAAI,KAAK,SAAS,EAAE,KAAK,GAAG;GAC7F,eAAe,IAAI,KAAK,SAAS,EAAE,KAAK;GACxC,MAAM,IAAI,KAAK,aAAa,QAAQ,IAAI,EAAE,KAAK;GAC/C,IAAI,MAAM,KAAA,KAAa,IAAI,qBAAqB,CAAC,GAAG,OAAO;GAC3D,MAAM,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;GACtC,OAAO,KAAK,KAAK,iBAAiB,GAAG,QAAQ,GAAG,OAAO,KAAK,EAAE;EAChE;EACA,MAAM,QAAQ,KAAK,YAAY,QAAQ,IAAI,EAAE,KAAK;EAClD,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;EACrC,IAAI,QAAQ,YAAY,KAAK,EAAE,KAAK,IAAI,EAAE,QAAQ,IAAI,eAAe,KAAK,KAAK,WAAW;EAC1F,WAAW;GACT,IAAI,CAAC,eAAe,IAAI,KAAK,YAAY,KAAK,GAAG,OAAO;GACxD,QAAQ,GAAG,MAAM;GACjB,OAAO;EACT,CAAC;EACD,eAAe,IAAI,KAAK,YAAY,KAAK;EACzC,eAAe,IAAI,KAAK,aAAa,EAAE,OAAO,KAAK;EACnD,OAAO,KAAK;CACd;CAEA,SAAiB,GAA0B;EACzC,MAAM,QAAQ,KAAK,SAAS,QAAQ,IAAI,EAAE,KAAK;EAC/C,IAAI,UAAU,KAAA,GAAW,OAAO,IAAI;EACpC,MAAM,OAAO,UAAU,EAAE,KAAK,IAAI,EAAE,QAAQ,IAAI,eAAe,KAAK,KAAK,QAAQ;EACjF,eAAe,IAAI,KAAK,UAAU,EAAE,OAAO,IAAI;EAC/C,OAAO,IAAI;CACb;CAEA,IAAY,OAAuB;EACjC,MAAMK,YAAUC,QAAkB,KAAK,UAAU,KAAK;EACtD,IAAI,OAAO,OAAOD,SAAO,KAAK,WAAWA,UAAQ,MAAM,EAAE,GAAG;GAC1D,MAAM,CAAC,QAAQ,SAASA,UAAQ;GAChC,IAAI,CAAC,MAAM,SAAS,GAAG,GAAG;IACxB,eAAe,IAAI,KAAK,cAAc,MAAM;IAC5C,OAAO,GAAG,OAAO,GAAG;GACtB;EACF;EACA,IAAI,OAAO,OAAO,KAAK,IAAI,GAAG;GAC5B,MAAM,MAAME,WAAe,OAAO,KAAK,KAAK,KAAK;GACjD,IAAI,OAAO,OAAO,GAAG,GAAG,OAAO,IAAIT,UAAe,IAAI,KAAK,EAAE;EAC/D;EACA,OAAO,IAAIA,UAAe,KAAK,EAAE;CACnC;CAEA,QAAgB,GAAyB;EACvC,MAAM,KAAK,EAAE,SAAS;EACtB,IAAI,EAAE,aAAa,IAAI;GACrB,IAAI,OAAO,IAAI,QAAQ,SAAS,QAAQ,KAAK,EAAE,KAAK,GAAG,OAAO,EAAE;GAChE,IAAI,OAAO,IAAI,QAAQ,SAAS,QAAQ,KAAK,EAAE,KAAK,GAAG,OAAO,EAAE;GAChE,IAAI,OAAO,IAAI,OAAO,SAAS,OAAO,KAAK,EAAE,KAAK,GAAG,OAAO,EAAE;GAC9D,IAAI,OAAO,IAAI,QAAQ,UAAU,EAAE,UAAU,UAAU,EAAE,UAAU,UAAU,OAAO,EAAE;EACxF;EACA,MAAM,SAAS,KAAK,MAAM,EAAE,KAAK;EACjC,IAAI,EAAE,aAAa,IACjB,OAAO,EAAE,cAAc,KAAA,IACnB,GAAG,OAAO,GAAG,EAAE,aACf,GAAG,OAAO,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,EAAE,SAAS,GAAG,EAAE,WAAW;EAEvE,IAAI,OAAO,2CAAiB,OAAO;EACnC,OAAO,GAAG,OAAO,IAAI,KAAK,IAAI,EAAE;CAClC;CAEA,MAAc,OAAuB;EACnC,IAAI,MAAM,SAAS,IAAI,KAAK,CAAC,MAAM,SAAS,IAAG,GAK7C,OAAO,MAHM,MAAM,QAAQ,2CAA2C,OACpE,OAAO,QAAQ,OAAO,OAAM,KAAK,OAAOU,aAAkB,EAAE,CAE9C,EAAE;EAEpB,OAAO,IAAIA,aAAkB,KAAK,EAAE;CACtC;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpSA,MAAa,SAA+BC,WAAyB;CACnE,MAAM;CACN,WAAW;CACX,YAAY;EAAC;EAAW;EAAe;CAAgB;CACvD,YAAY,CAAC,IAAI;CACjB,UAAU;AACZ,CAAC;AAGD,MAAM,QAAkC;CAAE,QAAQ;CAAM;AAAO;AAU/D,MAAM,aACJ,OACA,YAEA,OAAO,WACLC,QAAa,OAAO;CAClB,SAAS,OAAO,gBAAgB,SAAS,OAAO;CAChD,iBAAiB,SAAS,mBAAmBC,qBAAmC;AAClF,CAAC,CACH,CAAC,CAAC,KACA,OAAO,aAAa,MAClB,aAAaC,gBACT,OAAO,KACL,IAAIC,cAA4B;CAC9B,QAAQ,OAAO;CACf,SAAS,EAAE;CACX,MAAM,EAAE;CACR,QAAQ,EAAE;AACZ,CAAC,CACH,IACA,OAAO,IAAI,CAAC,CAClB,CACF;;;;;;;;;;;;;;;;AAiBF,MAAa,QAGqD,OAAO,GAAG,UAAU,CAAC,CAAC,WACtF,OACA,SACA;CACA,OAAO,OAAO,oBAAoB;EAChC,cAAc,OAAO;EACrB,kBAAkB,OAAO;EACzB,oBAAoB,MAAM;CAC5B,CAAC;CACD,MAAM,MAAM,OAAO,UAAU,OAAO,OAAO;CAC3C,OAAO,OAAO,oBAAoB,iBAAiB,IAAI,QAAQ,IAAI;CACnE,OAAO;AACT,CAAC;;;;;;;;AASD,MAAa,gBACX,OACA,YAEA,OAAO,QAAQ,UAAU,OAAO,OAAO,IAAI,QACzC,OAAO,cAAc;CACnB,MAAM,SAAS,SAAS,mBAAmBF,qBAAmC;CAC9E,OAAOG,UAAkB,KAAK,EAAE,iBAAiB,OAAO,CAAC,CAAC,CAAC,KACzD,OAAO,UACJ,MAAM,IAAID,cAA4B;EAAE,QAAQ,OAAO;EAAM,SAAS,EAAE;CAAQ,CAAC,CACpF,GACA,OAAO,KAAK,aAAwC;EAClD;EACA,UAAU,IAAI;EACd,SAAS,IAAI;CACf,EAAE,CACJ;AACF,CAAC,CACH,CAAC,CAAC,KAAKE,cAA4B,OAAO,OAAO,cAAc,CAAC;;;;;;;AAQlE,MAAa,SAA6CC,WAAyB;CACjF;CACA,OAAO;AACT,CAAC;;;;;;;;;AAqBD,MAAa,qBACX,MACA,YACW;CACX,MAAMC,cAAYC,UAAgB,IAAI;CACtC,OAAOC,MAAaF,cAAY,OAAO,KAAK,SAAS;EACnD,UAAU,SAAS,aAAaA,cAAYG,QAAkB,KAAK;EACnE,SAAS,OAAO,gBAAgB,SAAS,YAAYH,cAAY,KAAA,IAAY,KAAK,QAAQ;EAC1F,QAAQ,SAAS,UAAU;CAC7B,CAAC;AACH;;;;;;;;;;AAWA,MAAa,aACX,OACA,YAEAI,YAAoB,KAAK,CAAC,CAAC,KACzB,OAAO,KAAK,MAAM,kBAAkB,GAAG,OAAO,CAAC,GAC/C,OAAO,UACJ,MAAM,IAAIC,kBAAgC;CAAE,QAAQ,OAAO;CAAM,SAAS,EAAE;AAAQ,CAAC,CACxF,GACAC,kBAAgC,KAAK,CACvC;;;;;;;AAQF,MAAa,aAAyDC,eAA6B;CACjG;CACA;AACF,CAAC;;;;;;;AAQD,MAAa,QAA6DC,UACxE,QACA,UACF"}

package/dist/N3-DSLnonDn.d.mts

@@ -0,0 +1,100 @@
+import { _ as Quad } from "./Term-B_4ezyXq.mjs";
+import { c as Parser, i as Format, l as RdfParseError, m as Serializer, o as ParseOptions$1, p as SerializeOptions$1, r as Codec, s as ParseResult, u as RdfSerializeError } from "./Serialization-Df8iVauT.mjs";
+import { i as Formula, r as Document } from "./Model-DaMmxurZ.mjs";
+import * as Effect from "effect/Effect";
+declare namespace N3_d_exports {
+  export { ParseOptions, SerializeOptions, codec, format, parse, parseDataset, parser, serialize, serializeDocument, serializer };
+}
+/**
+ * The N3 format descriptor (`text/n3`, `.n3`).
+ *
+ * N3 can only represent named graphs that are named by blank nodes used as
+ * terms (formulas), so `datasets` is `false`.
+ *
+ * @since 0.1.0
+ * @category formats
+ */
+declare const format: Format;
+/**
+ * Options for parsing N3.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ParseOptions extends ParseOptions$1 {}
+/**
+ * Parses an N3 document into the full N3 model.
+ *
+ * @example
+ * ```ts
+ * import { Effect } from 'effect'
+ * import { N3 } from '@thomasfosterau/effect-rdf/n3'
+ *
+ * const doc = Effect.runSync(N3.parse('@prefix : <http://example.org/> . { ?x a :Man } => { ?x a :Mortal } .'))
+ * doc.formula.statements.length // 1
+ * ```
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parse: (input: string, options?: ParseOptions) => Effect.Effect<Document, RdfParseError>;
+/**
+ * Parses an N3 document in the RDF-compatible subset into a core dataset
+ * (see `Mapping.toDataset`).
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parseDataset: (input: string, options?: ParseOptions) => Effect.Effect<ParseResult, RdfParseError>;
+/**
+ * The N3 `Serialization.Parser`, producing core datasets.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parser: Parser<ParseOptions>;
+/**
+ * Options for serialising N3.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface SerializeOptions extends SerializeOptions$1 {
+  /** Indentation unit for nested formulas and statements (default four spaces). */
+  readonly indent?: string | undefined;
+}
+/**
+ * Serialises an N3 formula or document. Prefixes from the options (or, for
+ * a document, the document's own prefixes) are used to abbreviate IRIs, and
+ * only the prefixes actually used are declared.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serializeDocument: (self: Formula | Document, options?: SerializeOptions) => string;
+/**
+ * Serialises RDF quads as N3. Graphs named by blank nodes that are used as
+ * terms are written as nested formulas, and well-formed RDF lists as
+ * collections; other named graphs cannot be represented and fail with
+ * `RdfSerializeError`.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serialize: (quads: Iterable<Quad>, options?: SerializeOptions) => Effect.Effect<string, RdfSerializeError>;
+/**
+ * The N3 `Serialization.Serializer` for core datasets.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serializer: Serializer<SerializeOptions>;
+/**
+ * The N3 `Serialization.Codec` (parser + serializer over core datasets).
+ *
+ * @since 0.1.0
+ * @category codecs
+ */
+declare const codec: Codec<ParseOptions, SerializeOptions>;
+export { format as a, parser as c, serializer as d, codec as i, serialize as l, ParseOptions as n, parse as o, SerializeOptions as r, parseDataset as s, N3_d_exports as t, serializeDocument as u };
+//# sourceMappingURL=N3-DSLnonDn.d.mts.map

package/dist/NQuads-C1VBOJ3-.mjs

@@ -0,0 +1,117 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { c as makeCodec, d as makeSerializer, l as makeFormat, u as makeParser } from "./Serialization-DP9H5bYQ.mjs";
+import { a as serializeStream$1, i as serialize$1, n as parseQuads$1, r as parseStream$1, t as parse$1 } from "./codec-QNo7IdJF.mjs";
+// src/ntriples/NQuads.ts
+/**
+* RDF 1.2 N-Quads: a line-based, plain-text format for RDF datasets.
+*
+* The parser is strict and streaming (see `NTriples`); the serializer emits
+* canonical N-Quads.
+*
+* @example
+* ```ts
+* import { Effect } from 'effect'
+* import { NQuads } from '@thomasfosterau/effect-rdf/ntriples'
+*
+* const program = Effect.gen(function* () {
+*   const { dataset } = yield* NQuads.parse('<http://ex/s> <http://ex/p> <http://ex/o> <http://ex/g> .\n')
+*   return yield* NQuads.serialize(dataset, { sort: true })
+* })
+* ```
+*
+* @since 0.1.0
+*/
+var NQuads_exports = /* @__PURE__ */ __exportAll({
+	codec: () => codec,
+	format: () => format,
+	parse: () => parse,
+	parseQuads: () => parseQuads,
+	parseStream: () => parseStream,
+	parser: () => parser,
+	serialize: () => serialize,
+	serializeStream: () => serializeStream,
+	serializer: () => serializer
+});
+/**
+* @since 0.1.0
+* @category formats
+*/
+const format = makeFormat({
+	name: "N-Quads",
+	mediaType: "application/n-quads",
+	extensions: ["nq"],
+	datasets: true
+});
+const syntax = {
+	name: "N-Quads",
+	quads: true,
+	trace: {
+		module: "NQuads",
+		format
+	}
+};
+/**
+* Parses an N-Quads document. Statements without a graph label are placed
+* in `options.graph` (the default graph when omitted).
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parse = (input, options) => parse$1(syntax, input, options);
+/**
+* Parses an N-Quads document into quads in document order (duplicates are
+* kept).
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parseQuads = (input, options) => parseQuads$1(syntax, input, options);
+/**
+* Parses a stream of text chunks incrementally, line by line. Chunk
+* boundaries may fall anywhere.
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parseStream = parseStream$1(syntax);
+/**
+* Serialises quads as canonical N-Quads. Fails for triple terms in the
+* subject position.
+*
+* @since 0.1.0
+* @category serializing
+*/
+const serialize = (quads, options) => serialize$1(syntax, quads, options);
+/**
+* Serialises a stream of quads incrementally as canonical N-Quads.
+*
+* @since 0.1.0
+* @category serializing
+*/
+const serializeStream = serializeStream$1(syntax);
+/**
+* @since 0.1.0
+* @category parsing
+*/
+const parser = makeParser({
+	format,
+	parse,
+	parseStream
+});
+/**
+* @since 0.1.0
+* @category serializing
+*/
+const serializer = makeSerializer({
+	format,
+	serialize,
+	serializeStream
+});
+/**
+* @since 0.1.0
+* @category codecs
+*/
+const codec = makeCodec(parser, serializer);
+export { parseQuads as a, serialize as c, parse as i, serializeStream as l, codec as n, parseStream as o, format as r, parser as s, NQuads_exports as t, serializer as u };
+
+//# sourceMappingURL=NQuads-C1VBOJ3-.mjs.map

package/dist/NQuads-C1VBOJ3-.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"NQuads-C1VBOJ3-.mjs","names":["Serialization.makeFormat","internal.parse","internal.parseQuads","internal.parseStream","internal.serialize","internal.serializeStream","Serialization.makeParser","Serialization.makeSerializer","Serialization.makeCodec"],"sources":["../src/ntriples/NQuads.ts"],"sourcesContent":["/**\n * RDF 1.2 N-Quads: a line-based, plain-text format for RDF datasets.\n *\n * The parser is strict and streaming (see `NTriples`); the serializer emits\n * canonical N-Quads.\n *\n * @example\n * ```ts\n * import { Effect } from 'effect'\n * import { NQuads } from '@thomasfosterau/effect-rdf/ntriples'\n *\n * const program = Effect.gen(function* () {\n *   const { dataset } = yield* NQuads.parse('<http://ex/s> <http://ex/p> <http://ex/o> <http://ex/g> .\\n')\n *   return yield* NQuads.serialize(dataset, { sort: true })\n * })\n * ```\n *\n * @since 0.1.0\n */\nimport * as Serialization from '../Serialization.ts';\nimport type * as Term from '../Term.ts';\nimport type * as Effect from 'effect/Effect';\nimport type * as Stream from 'effect/Stream';\nimport * as internal from './internal/codec.ts';\n\n/**\n * Options for the N-Quads serializer.\n *\n * @since 0.1.0\n * @category models\n */\nexport type SerializeOptions = internal.SerializeOptions;\n\n/**\n * @since 0.1.0\n * @category formats\n */\nexport const format: Serialization.Format = Serialization.makeFormat({\n  name: 'N-Quads',\n  mediaType: 'application/n-quads',\n  extensions: ['nq'],\n  datasets: true,\n});\n\n// The span names are `NQuads.parse`, `NQuads.serialize`, …\nconst syntax: internal.Syntax = {\n  name: 'N-Quads',\n  quads: true,\n  trace: { module: 'NQuads', format },\n};\n\n/**\n * Parses an N-Quads document. Statements without a graph label are placed\n * in `options.graph` (the default graph when omitted).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parse = (\n  input: string,\n  options?: Serialization.ParseOptions,\n): Effect.Effect<Serialization.ParseResult, Serialization.RdfParseError> =>\n  internal.parse(syntax, input, options);\n\n/**\n * Parses an N-Quads document into quads in document order (duplicates are\n * kept).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseQuads = (\n  input: string,\n  options?: Serialization.ParseOptions,\n): Effect.Effect<ReadonlyArray<Term.Quad>, Serialization.RdfParseError> =>\n  internal.parseQuads(syntax, input, options);\n\n/**\n * Parses a stream of text chunks incrementally, line by line. Chunk\n * boundaries may fall anywhere.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseStream: <E, R>(\n  input: Stream.Stream<string, E, R>,\n  options?: Serialization.ParseOptions,\n) => Stream.Stream<Term.Quad, Serialization.RdfParseError | E, R> = internal.parseStream(syntax);\n\n/**\n * Serialises quads as canonical N-Quads. Fails for triple terms in the\n * subject position.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serialize = (\n  quads: Iterable<Term.Quad>,\n  options?: SerializeOptions,\n): Effect.Effect<string, Serialization.RdfSerializeError> =>\n  internal.serialize(syntax, quads, options);\n\n/**\n * Serialises a stream of quads incrementally as canonical N-Quads.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serializeStream: <E, R>(\n  quads: Stream.Stream<Term.Quad, E, R>,\n  options?: SerializeOptions,\n) => Stream.Stream<string, Serialization.RdfSerializeError | E, R> =\n  internal.serializeStream(syntax);\n\n/**\n * @since 0.1.0\n * @category parsing\n */\nexport const parser: Serialization.Parser = Serialization.makeParser({\n  format,\n  parse,\n  parseStream,\n});\n\n/**\n * @since 0.1.0\n * @category serializing\n */\nexport const serializer: Serialization.Serializer<SerializeOptions> = Serialization.makeSerializer({\n  format,\n  serialize,\n  serializeStream,\n});\n\n/**\n * @since 0.1.0\n * @category codecs\n */\nexport const codec: Serialization.Codec<Serialization.ParseOptions, SerializeOptions> =\n  Serialization.makeCodec(parser, serializer);\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCA,MAAa,SAA+BA,WAAyB;CACnE,MAAM;CACN,WAAW;CACX,YAAY,CAAC,IAAI;CACjB,UAAU;AACZ,CAAC;AAGD,MAAM,SAA0B;CAC9B,MAAM;CACN,OAAO;CACP,OAAO;EAAE,QAAQ;EAAU;CAAO;AACpC;;;;;;;;AASA,MAAa,SACX,OACA,YAEAC,QAAe,QAAQ,OAAO,OAAO;;;;;;;;AASvC,MAAa,cACX,OACA,YAEAC,aAAoB,QAAQ,OAAO,OAAO;;;;;;;;AAS5C,MAAa,cAGuDC,cAAqB,MAAM;;;;;;;;AAS/F,MAAa,aACX,OACA,YAEAC,YAAmB,QAAQ,OAAO,OAAO;;;;;;;AAQ3C,MAAa,kBAIXC,kBAAyB,MAAM;;;;;AAMjC,MAAa,SAA+BC,WAAyB;CACnE;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,aAAyDC,eAA6B;CACjG;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,QACXC,UAAwB,QAAQ,UAAU"}

package/dist/NQuads-FjFZikFg.d.mts

@@ -0,0 +1,76 @@
+import { _ as Quad } from "./Term-B_4ezyXq.mjs";
+import { c as Parser, i as Format, l as RdfParseError, m as Serializer, o as ParseOptions, r as Codec, s as ParseResult, u as RdfSerializeError } from "./Serialization-Df8iVauT.mjs";
+import { t as SerializeOptions$1 } from "./codec-Lb2T96rv.mjs";
+import * as Effect from "effect/Effect";
+import * as Stream from "effect/Stream";
+declare namespace NQuads_d_exports {
+  export { SerializeOptions, codec, format, parse, parseQuads, parseStream, parser, serialize, serializeStream, serializer };
+}
+/**
+ * Options for the N-Quads serializer.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type SerializeOptions = SerializeOptions$1;
+/**
+ * @since 0.1.0
+ * @category formats
+ */
+declare const format: Format;
+/**
+ * Parses an N-Quads document. Statements without a graph label are placed
+ * in `options.graph` (the default graph when omitted).
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parse: (input: string, options?: ParseOptions) => Effect.Effect<ParseResult, RdfParseError>;
+/**
+ * Parses an N-Quads document into quads in document order (duplicates are
+ * kept).
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parseQuads: (input: string, options?: ParseOptions) => Effect.Effect<ReadonlyArray<Quad>, RdfParseError>;
+/**
+ * Parses a stream of text chunks incrementally, line by line. Chunk
+ * boundaries may fall anywhere.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parseStream: <E, R>(input: Stream.Stream<string, E, R>, options?: ParseOptions) => Stream.Stream<Quad, RdfParseError | E, R>;
+/**
+ * Serialises quads as canonical N-Quads. Fails for triple terms in the
+ * subject position.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serialize: (quads: Iterable<Quad>, options?: SerializeOptions) => Effect.Effect<string, RdfSerializeError>;
+/**
+ * Serialises a stream of quads incrementally as canonical N-Quads.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serializeStream: <E, R>(quads: Stream.Stream<Quad, E, R>, options?: SerializeOptions) => Stream.Stream<string, RdfSerializeError | E, R>;
+/**
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parser: Parser;
+/**
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serializer: Serializer<SerializeOptions>;
+/**
+ * @since 0.1.0
+ * @category codecs
+ */
+declare const codec: Codec<ParseOptions, SerializeOptions>;
+export { parse as a, parser as c, serializer as d, format as i, serialize as l, SerializeOptions as n, parseQuads as o, codec as r, parseStream as s, NQuads_d_exports as t, serializeStream as u };
+//# sourceMappingURL=NQuads-FjFZikFg.d.mts.map

package/dist/NTriples-D-kLSEAf.mjs

@@ -0,0 +1,120 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { c as makeCodec, d as makeSerializer, l as makeFormat, u as makeParser } from "./Serialization-DP9H5bYQ.mjs";
+import { a as serializeStream$1, i as serialize$1, n as parseQuads$1, r as parseStream$1, t as parse$1 } from "./codec-QNo7IdJF.mjs";
+// src/ntriples/NTriples.ts
+/**
+* RDF 1.2 N-Triples: a line-based, plain-text format for RDF graphs.
+*
+* The parser is strict (absolute IRIs only, validated escapes, language tags
+* and base directions, triple terms `<<( s p o )>>` in object position,
+* `VERSION` directives) and streaming: `parseStream` consumes text chunks
+* line by line, so arbitrarily large documents are never buffered. The
+* serializer emits canonical N-Triples.
+*
+* @example
+* ```ts
+* import { Effect } from 'effect'
+* import { NTriples } from '@thomasfosterau/effect-rdf/ntriples'
+*
+* const program = Effect.gen(function* () {
+*   const { dataset } = yield* NTriples.parse('<http://ex/s> <http://ex/p> "o"@en .\n')
+*   return yield* NTriples.serialize(dataset)
+* })
+* ```
+*
+* @since 0.1.0
+*/
+var NTriples_exports = /* @__PURE__ */ __exportAll({
+	codec: () => codec,
+	format: () => format,
+	parse: () => parse,
+	parseQuads: () => parseQuads,
+	parseStream: () => parseStream,
+	parser: () => parser,
+	serialize: () => serialize,
+	serializeStream: () => serializeStream,
+	serializer: () => serializer
+});
+/**
+* @since 0.1.0
+* @category formats
+*/
+const format = makeFormat({
+	name: "N-Triples",
+	mediaType: "application/n-triples",
+	extensions: ["nt"],
+	datasets: false
+});
+const syntax = {
+	name: "N-Triples",
+	quads: false,
+	trace: {
+		module: "NTriples",
+		format
+	}
+};
+/**
+* Parses an N-Triples document. Triples are placed in `options.graph`
+* (the default graph when omitted).
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parse = (input, options) => parse$1(syntax, input, options);
+/**
+* Parses an N-Triples document into quads in document order (duplicates are
+* kept).
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parseQuads = (input, options) => parseQuads$1(syntax, input, options);
+/**
+* Parses a stream of text chunks incrementally, line by line. Chunk
+* boundaries may fall anywhere.
+*
+* @since 0.1.0
+* @category parsing
+*/
+const parseStream = parseStream$1(syntax);
+/**
+* Serialises triples as canonical N-Triples. Fails for quads in named
+* graphs and for triple terms in the subject position.
+*
+* @since 0.1.0
+* @category serializing
+*/
+const serialize = (quads, options) => serialize$1(syntax, quads, options);
+/**
+* Serialises a stream of quads incrementally as canonical N-Triples.
+*
+* @since 0.1.0
+* @category serializing
+*/
+const serializeStream = serializeStream$1(syntax);
+/**
+* @since 0.1.0
+* @category parsing
+*/
+const parser = makeParser({
+	format,
+	parse,
+	parseStream
+});
+/**
+* @since 0.1.0
+* @category serializing
+*/
+const serializer = makeSerializer({
+	format,
+	serialize,
+	serializeStream
+});
+/**
+* @since 0.1.0
+* @category codecs
+*/
+const codec = makeCodec(parser, serializer);
+export { parseQuads as a, serialize as c, parse as i, serializeStream as l, codec as n, parseStream as o, format as r, parser as s, NTriples_exports as t, serializer as u };
+
+//# sourceMappingURL=NTriples-D-kLSEAf.mjs.map

package/dist/NTriples-D-kLSEAf.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"NTriples-D-kLSEAf.mjs","names":["Serialization.makeFormat","internal.parse","internal.parseQuads","internal.parseStream","internal.serialize","internal.serializeStream","Serialization.makeParser","Serialization.makeSerializer","Serialization.makeCodec"],"sources":["../src/ntriples/NTriples.ts"],"sourcesContent":["/**\n * RDF 1.2 N-Triples: a line-based, plain-text format for RDF graphs.\n *\n * The parser is strict (absolute IRIs only, validated escapes, language tags\n * and base directions, triple terms `<<( s p o )>>` in object position,\n * `VERSION` directives) and streaming: `parseStream` consumes text chunks\n * line by line, so arbitrarily large documents are never buffered. The\n * serializer emits canonical N-Triples.\n *\n * @example\n * ```ts\n * import { Effect } from 'effect'\n * import { NTriples } from '@thomasfosterau/effect-rdf/ntriples'\n *\n * const program = Effect.gen(function* () {\n *   const { dataset } = yield* NTriples.parse('<http://ex/s> <http://ex/p> \"o\"@en .\\n')\n *   return yield* NTriples.serialize(dataset)\n * })\n * ```\n *\n * @since 0.1.0\n */\nimport * as Serialization from '../Serialization.ts';\nimport type * as Term from '../Term.ts';\nimport type * as Effect from 'effect/Effect';\nimport type * as Stream from 'effect/Stream';\nimport * as internal from './internal/codec.ts';\n\n/**\n * Options for the N-Triples serializer.\n *\n * @since 0.1.0\n * @category models\n */\nexport type SerializeOptions = internal.SerializeOptions;\n\n/**\n * @since 0.1.0\n * @category formats\n */\nexport const format: Serialization.Format = Serialization.makeFormat({\n  name: 'N-Triples',\n  mediaType: 'application/n-triples',\n  extensions: ['nt'],\n  datasets: false,\n});\n\n// The span names are `NTriples.parse`, `NTriples.serialize`, …\nconst syntax: internal.Syntax = {\n  name: 'N-Triples',\n  quads: false,\n  trace: { module: 'NTriples', format },\n};\n\n/**\n * Parses an N-Triples document. Triples are placed in `options.graph`\n * (the default graph when omitted).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parse = (\n  input: string,\n  options?: Serialization.ParseOptions,\n): Effect.Effect<Serialization.ParseResult, Serialization.RdfParseError> =>\n  internal.parse(syntax, input, options);\n\n/**\n * Parses an N-Triples document into quads in document order (duplicates are\n * kept).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseQuads = (\n  input: string,\n  options?: Serialization.ParseOptions,\n): Effect.Effect<ReadonlyArray<Term.Quad>, Serialization.RdfParseError> =>\n  internal.parseQuads(syntax, input, options);\n\n/**\n * Parses a stream of text chunks incrementally, line by line. Chunk\n * boundaries may fall anywhere.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseStream: <E, R>(\n  input: Stream.Stream<string, E, R>,\n  options?: Serialization.ParseOptions,\n) => Stream.Stream<Term.Quad, Serialization.RdfParseError | E, R> = internal.parseStream(syntax);\n\n/**\n * Serialises triples as canonical N-Triples. Fails for quads in named\n * graphs and for triple terms in the subject position.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serialize = (\n  quads: Iterable<Term.Quad>,\n  options?: SerializeOptions,\n): Effect.Effect<string, Serialization.RdfSerializeError> =>\n  internal.serialize(syntax, quads, options);\n\n/**\n * Serialises a stream of quads incrementally as canonical N-Triples.\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const serializeStream: <E, R>(\n  quads: Stream.Stream<Term.Quad, E, R>,\n  options?: SerializeOptions,\n) => Stream.Stream<string, Serialization.RdfSerializeError | E, R> =\n  internal.serializeStream(syntax);\n\n/**\n * @since 0.1.0\n * @category parsing\n */\nexport const parser: Serialization.Parser = Serialization.makeParser({\n  format,\n  parse,\n  parseStream,\n});\n\n/**\n * @since 0.1.0\n * @category serializing\n */\nexport const serializer: Serialization.Serializer<SerializeOptions> = Serialization.makeSerializer({\n  format,\n  serialize,\n  serializeStream,\n});\n\n/**\n * @since 0.1.0\n * @category codecs\n */\nexport const codec: Serialization.Codec<Serialization.ParseOptions, SerializeOptions> =\n  Serialization.makeCodec(parser, serializer);\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,MAAa,SAA+BA,WAAyB;CACnE,MAAM;CACN,WAAW;CACX,YAAY,CAAC,IAAI;CACjB,UAAU;AACZ,CAAC;AAGD,MAAM,SAA0B;CAC9B,MAAM;CACN,OAAO;CACP,OAAO;EAAE,QAAQ;EAAY;CAAO;AACtC;;;;;;;;AASA,MAAa,SACX,OACA,YAEAC,QAAe,QAAQ,OAAO,OAAO;;;;;;;;AASvC,MAAa,cACX,OACA,YAEAC,aAAoB,QAAQ,OAAO,OAAO;;;;;;;;AAS5C,MAAa,cAGuDC,cAAqB,MAAM;;;;;;;;AAS/F,MAAa,aACX,OACA,YAEAC,YAAmB,QAAQ,OAAO,OAAO;;;;;;;AAQ3C,MAAa,kBAIXC,kBAAyB,MAAM;;;;;AAMjC,MAAa,SAA+BC,WAAyB;CACnE;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,aAAyDC,eAA6B;CACjG;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,QACXC,UAAwB,QAAQ,UAAU"}