@thomasfosterau/effect-rdf 0.0.0 → 0.1.0

package/dist/RdfXml-DJ9G4gOq.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"RdfXml-DJ9G4gOq.mjs","names":["Serialization.makeFormat","Iri.resolve","Term.NamedNode","Term.Triple","Term.BlankNode","Xml.isNCName","Term.literal","Xml.isWhitespace","Term.Literal","Xml.canonicalize","Serialization.RdfParseError","Serialization.freshBlankNodePrefix","PrefixMap.make","Term.defaultGraph","Term.Quad","Dataset.fromIterable","XmlParser.parseText","XmlParser.Failure","Serialization.withParseSpan","Serialization.makeParser","Xml.NAME_START","Xml.NAME_CHAR","Xml.escapeAttribute","Xml.isValidText","Iri.relativize","Xml.escapeText","Term.Order","Term.isNamedNode","PrefixMap.empty","Term.isBlankNode","Term.isTriple","Term.compare","Term.isDefaultGraph","Serialization.RdfSerializeError","Serialization.withSerializeSpan","Serialization.makeSerializer","Serialization.makeCodec"],"sources":["../src/rdfxml/RdfXml.ts"],"sourcesContent":["/**\n * RDF 1.2 XML Syntax (RDF/XML): parser and serializer.\n *\n * The parser implements the RDF/XML grammar of\n * https://www.w3.org/TR/rdf-syntax-grammar/ together with the RDF 1.2\n * additions: `rdf:version`, base direction via `its:dir`, triple terms via\n * `rdf:parseType=\"Triple\"`, and annotations via `rdf:annotation` /\n * `rdf:annotationNodeID`. `rdf:parseType=\"Literal\"` content is turned into\n * an `rdf:XMLLiteral` using Exclusive XML Canonicalization.\n *\n * The serializer writes readable RDF/XML: typed node elements, nested blank\n * nodes where a blank node is referenced exactly once, namespace\n * declarations taken from `options.prefixes` and generated namespaces for the\n * rest.\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as Effect from 'effect/Effect';\nimport * as Match from 'effect/Match';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Result from 'effect/Result';\nimport * as Order from 'effect/Order';\nimport * as Dataset from '../Dataset.ts';\nimport * as Iri from '../Iri.ts';\nimport * as PrefixMap from '../PrefixMap.ts';\nimport * as Serialization from '../Serialization.ts';\nimport * as Term from '../Term.ts';\nimport * as Xml from './Xml.ts';\nimport * as XmlParser from './internal/parser.ts';\n\nconst RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\nconst ITS = 'http://www.w3.org/2005/11/its';\nconst XSD_STRING = 'http://www.w3.org/2001/XMLSchema#string';\nconst FORMAT_NAME = 'RDF/XML';\n\n/**\n * The RDF/XML format description (`application/rdf+xml`).\n *\n * @since 0.1.0\n * @category formats\n */\nexport const format: Serialization.Format = Serialization.makeFormat({\n  name: FORMAT_NAME,\n  mediaType: 'application/rdf+xml',\n  extensions: ['rdf', 'owl'],\n  datasets: false,\n});\n\n// Spans are named `RdfXml.parse`, `RdfXml.serialize`.\nconst trace: Serialization.SpanTarget = { module: 'RdfXml', format };\n\n// -----------------------------------------------------------------------------\n// Parsing\n// -----------------------------------------------------------------------------\n\n/**\n * Options for parsing RDF/XML.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ParseOptions extends Serialization.ParseOptions {\n  /**\n   * The RDF version assumed when the document does not announce one with\n   * `rdf:version`. RDF 1.2 features that require a version announcement\n   * (base direction and triple terms) are only enabled when a version other\n   * than `\"1.0\"`/`\"1.1\"` is in scope. Defaults to none.\n   */\n  readonly version?: string | undefined;\n}\n\nconst rdf = (local: string) => RDF + local;\n\n/** The core syntax terms and the old terms, which are never node, property or attribute names. */\nconst RESERVED_TERMS = MutableHashSet.fromIterable(\n  [\n    'RDF',\n    'ID',\n    'about',\n    'annotation',\n    'annotationNodeID',\n    'parseType',\n    'resource',\n    'nodeID',\n    'datatype',\n    'version',\n    'aboutEach',\n    'aboutEachPrefix',\n    'bagID',\n  ].map(rdf),\n);\nconst UNQUALIFIED_RDF_ATTRIBUTES = MutableHashSet.make(\n  'ID',\n  'about',\n  'resource',\n  'parseType',\n  'type',\n  'version',\n);\n\nconst RDF_DESCRIPTION = rdf('Description');\nconst RDF_LI = rdf('li');\nconst RDF_TYPE = rdf('type');\nconst RDF_ID = rdf('ID');\nconst RDF_NODE_ID = rdf('nodeID');\nconst RDF_ABOUT = rdf('about');\nconst RDF_VERSION = rdf('version');\nconst RDF_ANNOTATION = rdf('annotation');\nconst RDF_ANNOTATION_NODE_ID = rdf('annotationNodeID');\nconst RDF_PARSE_TYPE = rdf('parseType');\nconst RDF_RESOURCE = rdf('resource');\nconst RDF_DATATYPE = rdf('datatype');\n\nconst isReserved = (iri: string): boolean => MutableHashSet.has(RESERVED_TERMS, iri);\nconst isForbiddenNodeElement = (iri: string) => isReserved(iri) || iri === RDF_LI;\nconst isForbiddenPropertyElement = (iri: string) => isReserved(iri) || iri === RDF_DESCRIPTION;\nconst isForbiddenPropertyAttribute = (iri: string) =>\n  isReserved(iri) || iri === RDF_DESCRIPTION || iri === RDF_LI;\n\nconst isElement = Predicate.isTagged('Element');\nconst isText = Predicate.isTagged('Text');\n\nclass ParseFailure {\n  readonly message: string;\n  readonly position: Xml.Position;\n  constructor(message: string, position: Xml.Position) {\n    this.message = message;\n    this.position = position;\n  }\n}\n\ninterface Context {\n  readonly base: Option.Option<string>;\n  readonly language: string;\n  readonly direction: '' | Term.Direction;\n  readonly version: Option.Option<string>;\n}\n\n/** Resolves `reference` against the base IRI of `ctx`, if it has one. */\nconst resolveIn = (reference: string, base: Option.Option<string>): string =>\n  Iri.resolve(reference, Option.getOrUndefined(base));\n\ninterface Attr {\n  readonly iri: string;\n  readonly value: string;\n  readonly attribute: Xml.Attribute;\n}\n\nconst isRdf12 = (version: Option.Option<string>): boolean =>\n  Option.isSome(version) && version.value !== '1.0' && version.value !== '1.1';\n\nconst rdfType = new Term.NamedNode(rdf('type'));\nconst rdfFirst = new Term.NamedNode(rdf('first'));\nconst rdfRest = new Term.NamedNode(rdf('rest'));\nconst rdfNil = new Term.NamedNode(rdf('nil'));\nconst rdfStatement = new Term.NamedNode(rdf('Statement'));\nconst rdfSubject = new Term.NamedNode(rdf('subject'));\nconst rdfPredicate = new Term.NamedNode(rdf('predicate'));\nconst rdfObject = new Term.NamedNode(rdf('object'));\nconst rdfReifies = new Term.NamedNode(rdf('reifies'));\nconst rdfXmlLiteral = new Term.NamedNode(rdf('XMLLiteral'));\n\n/** The syntax attributes of a node element, gathered by `nodeAttribute`. */\ninterface NodeAttributes {\n  idAttr: Option.Option<Attr>;\n  readonly props: Array<Attr>;\n}\n\n/**\n * Adds an attribute that is not a syntax attribute of its element to `props`\n * (`rdf:version` aside, which `context` reads).\n */\nconst propertyAttr = (a: Attr, parser: RdfXmlParser, props: Array<Attr>): void => {\n  if (a.iri === RDF_VERSION) return;\n  if (isForbiddenPropertyAttribute(a.iri)) {\n    parser.fail(`${a.attribute.name} is not allowed as a property attribute`, a.attribute);\n  }\n  props.push(a);\n};\n\n/** Gathers an attribute of a node element (run for every one, so a chain of comparisons). */\nconst nodeAttribute = (a: Attr, parser: RdfXmlParser, attrs: NodeAttributes): void => {\n  const iri = a.iri;\n  if (iri !== RDF_ID && iri !== RDF_NODE_ID && iri !== RDF_ABOUT) {\n    propertyAttr(a, parser, attrs.props);\n    return;\n  }\n  if (Option.isSome(attrs.idAttr)) {\n    parser.fail(\n      `rdf:${attrs.idAttr.value.attribute.localName} and rdf:${a.attribute.localName} cannot be used together`,\n      a.attribute,\n    );\n  }\n  attrs.idAttr = Option.some(a);\n};\n\n/** The syntax attributes of a property element, gathered by `propertyAttribute`. */\ninterface PropertyAttributes {\n  id: Option.Option<Attr>;\n  annotation: Option.Option<Attr>;\n  parseType: Option.Option<Attr>;\n  resource: Option.Option<Attr>;\n  nodeId: Option.Option<Attr>;\n  datatype: Option.Option<Attr>;\n  readonly props: Array<Attr>;\n}\n\n/** Gathers an attribute of a property element (run for every one, so a chain of comparisons). */\nconst propertyAttribute = (a: Attr, parser: RdfXmlParser, attrs: PropertyAttributes): void => {\n  const iri = a.iri;\n  if (iri === RDF_ID) attrs.id = Option.some(a);\n  else if (iri === RDF_ANNOTATION || iri === RDF_ANNOTATION_NODE_ID) {\n    if (Option.isSome(attrs.annotation)) {\n      parser.fail('rdf:annotation and rdf:annotationNodeID cannot be used together', a.attribute);\n    }\n    attrs.annotation = Option.some(a);\n  } else if (iri === RDF_PARSE_TYPE) attrs.parseType = Option.some(a);\n  else if (iri === RDF_RESOURCE) attrs.resource = Option.some(a);\n  else if (iri === RDF_NODE_ID) attrs.nodeId = Option.some(a);\n  else if (iri === RDF_DATATYPE) attrs.datatype = Option.some(a);\n  else propertyAttr(a, parser, attrs.props);\n};\n\nconst isRdfRoot = (root: Xml.Element): boolean =>\n  root.namespace === RDF && root.localName === 'RDF';\n\nclass RdfXmlParser {\n  sink: Array<Term.Triple> = [];\n  readonly ids = MutableHashSet.empty<string>();\n  counter = 0;\n\n  readonly blankNodePrefix: string;\n  readonly defaultVersion: Option.Option<string>;\n  constructor(blankNodePrefix: string, defaultVersion: Option.Option<string>) {\n    this.blankNodePrefix = blankNodePrefix;\n    this.defaultVersion = defaultVersion;\n  }\n\n  fail(message: string, node: { readonly position: Xml.Position }): never {\n    throw new ParseFailure(message, node.position);\n  }\n\n  /** Fails if any of `attrs` is present: the first `<name> <why>`. */\n  reject(attrs: Iterable<Option.Option<Attr>>, why: string): void {\n    const other = Option.firstSomeOf(attrs);\n    if (Option.isSome(other)) {\n      const { attribute } = other.value;\n      this.fail(`${attribute.name} ${why}`, attribute);\n    }\n  }\n\n  emit(s: Term.Subject, p: Term.NamedNode, o: Term.Object): Term.Triple {\n    const t = new Term.Triple(s, p, o);\n    this.sink.push(t);\n    return t;\n  }\n\n  fresh(): Term.BlankNode {\n    return new Term.BlankNode(`${this.blankNodePrefix}${this.counter++}`);\n  }\n\n  blank(id: string, node: { readonly position: Xml.Position }): Term.BlankNode {\n    if (!Xml.isNCName(id)) this.fail(`Invalid blank node identifier \"${id}\"`, node);\n    return new Term.BlankNode(`${this.blankNodePrefix}${id}`);\n  }\n\n  /** The IRIs of names and datatypes seen so far, which repeat throughout a document. */\n  private readonly names = MutableHashMap.empty<string, Term.NamedNode>();\n\n  /**\n   * The IRIs of the names read so far, by local name, then namespace (a\n   * local name rarely has more than one).\n   */\n  private readonly qualifiedNames = MutableHashMap.empty<\n    string,\n    Array<readonly [namespace: string, iri: string]>\n  >();\n\n  /**\n   * The IRI of a name (`namespace` + `localName`), the same string each time\n   * it is read: names repeat throughout a document, and each later lookup of\n   * the IRI (in the reserved-term set, the node cache) then hashes nothing.\n   */\n  qualified(namespace: string, localName: string): string {\n    const byLocalName = MutableHashMap.get(this.qualifiedNames, localName);\n    if (Option.isNone(byLocalName)) {\n      const iri = namespace + localName;\n      MutableHashMap.set(this.qualifiedNames, localName, [[namespace, iri]]);\n      return iri;\n    }\n    const byNamespace = byLocalName.value;\n    const known = byNamespace.find(([ns]) => ns === namespace);\n    if (known !== undefined) return known[1];\n    const iri = namespace + localName;\n    byNamespace.push([namespace, iri]);\n    return iri;\n  }\n\n  /** The node for the IRI of an element or attribute name, or of a datatype. */\n  named(iri: string): Term.NamedNode {\n    const known = MutableHashMap.get(this.names, iri);\n    if (Option.isSome(known)) return known.value;\n    const node = new Term.NamedNode(iri);\n    MutableHashMap.set(this.names, iri, node);\n    return node;\n  }\n\n  iri(value: string, ctx: Context): Term.NamedNode {\n    return new Term.NamedNode(resolveIn(value, ctx.base));\n  }\n\n  idIri(id: string, ctx: Context, node: { readonly position: Xml.Position }): Term.NamedNode {\n    if (!Xml.isNCName(id)) this.fail(`Invalid rdf:ID \"${id}\"`, node);\n    const iri = resolveIn(`#${id}`, ctx.base);\n    if (MutableHashSet.has(this.ids, iri)) this.fail(`Duplicate rdf:ID \"${id}\"`, node);\n    MutableHashSet.add(this.ids, iri);\n    return new Term.NamedNode(iri);\n  }\n\n  literal(value: string, ctx: Context): Term.Literal {\n    if (ctx.language === '') return Term.literal(value);\n    return ctx.direction === ''\n      ? Term.literal(value, ctx.language)\n      : Term.literal(value, { language: ctx.language, direction: ctx.direction });\n  }\n\n  /** Computes the evaluation context of an element. */\n  context(el: Xml.Element, parent: Context): Context {\n    if (Arr.isReadonlyArrayEmpty(el.attributes)) return parent;\n    let base = parent.base;\n    let language = parent.language;\n    let direction = parent.direction;\n    let version = parent.version;\n    let dir = Option.none<Xml.Attribute>();\n    el.attributes.forEach((a) => {\n      if (a.namespace === Xml.XML_NAMESPACE) {\n        if (a.localName === 'base') base = Option.some(resolveIn(a.value, base));\n        else if (a.localName === 'lang') language = a.value;\n      } else if (a.namespace === ITS && a.localName === 'dir') {\n        dir = Option.some(a);\n      } else if ((a.namespace === RDF || a.namespace === undefined) && a.localName === 'version') {\n        version = Option.some(a.value);\n      }\n    });\n    if (Option.isSome(dir) && isRdf12(version)) {\n      const value = dir.value.value;\n      if (value !== 'ltr' && value !== 'rtl' && value !== '') {\n        this.fail(`Invalid its:dir value \"${value}\"`, dir.value);\n      }\n      // SAFETY: the value was checked to be `ltr` or `rtl` above.\n      direction = value;\n    }\n    return { base, language, direction, version };\n  }\n\n  /** The RDF-relevant attributes of an element, with their IRIs. */\n  attributes(el: Xml.Element): Array<Attr> {\n    const out: Array<Attr> = [];\n    el.attributes.forEach((a) => {\n      if (a.namespace === Xml.XML_NAMESPACE) return;\n      if (a.prefix.toLowerCase().startsWith('xml')) return;\n      if (a.namespace === undefined) {\n        if (a.localName.toLowerCase().startsWith('xml')) return;\n        if (!MutableHashSet.has(UNQUALIFIED_RDF_ATTRIBUTES, a.localName)) {\n          this.fail(`Unqualified attribute \"${a.localName}\" is not allowed`, a);\n        }\n        out.push({ iri: this.qualified(RDF, a.localName), value: a.value, attribute: a });\n        return;\n      }\n      if (a.namespace === ITS && (a.localName === 'dir' || a.localName === 'version')) return;\n      out.push({ iri: this.qualified(a.namespace, a.localName), value: a.value, attribute: a });\n    });\n    return out;\n  }\n\n  elementIri(el: Xml.Element): string {\n    if (el.namespace === undefined) {\n      this.fail(`Element \"${el.name}\" is not in a namespace`, el);\n    }\n    return this.qualified(el.namespace, el.localName);\n  }\n\n  document(doc: Xml.Document, base: Option.Option<string>): void {\n    const root = doc.root;\n    const ctx: Context = { base, language: '', direction: '', version: this.defaultVersion };\n    if (isRdfRoot(root)) this.nodeElementList(root.children, this.rdfRoot(root, ctx));\n    else this.nodeElement(root, ctx);\n  }\n\n  /** The context of the node elements in an `rdf:RDF` root, after checking its attributes. */\n  rdfRoot(root: Xml.Element, ctx: Context): Context {\n    const rootCtx = this.context(root, ctx);\n    this.attributes(root).forEach((a) => {\n      if (a.iri !== RDF_VERSION) this.fail(`Unexpected attribute on rdf:RDF`, a.attribute);\n    });\n    return rootCtx;\n  }\n\n  nodeElementList(children: ReadonlyArray<Xml.Node>, ctx: Context): Array<Term.Subject> {\n    const subjects: Array<Term.Subject> = [];\n    children.forEach((c) => {\n      if (isElement(c)) subjects.push(this.nodeElement(c, ctx));\n      else if (isText(c) && !Xml.isWhitespace(c.value)) {\n        this.fail('Unexpected text where node elements are expected', c);\n      }\n    });\n    return subjects;\n  }\n\n  nodeElement(el: Xml.Element, parentCtx: Context): Term.Subject {\n    const ctx = this.context(el, parentCtx);\n    const iri = this.elementIri(el);\n    if (isForbiddenNodeElement(iri)) this.fail(`<${el.name}> is not allowed as a node element`, el);\n    const attrs: NodeAttributes = { idAttr: Option.none(), props: [] };\n    this.attributes(el).forEach((a) => nodeAttribute(a, this, attrs));\n    const s: Term.Subject = Option.match(attrs.idAttr, {\n      onNone: () => this.fresh(),\n      onSome: (idAttr) => {\n        const local = idAttr.iri.slice(RDF.length);\n        return local === 'ID'\n          ? this.idIri(idAttr.value, ctx, idAttr.attribute)\n          : local === 'nodeID'\n            ? this.blank(idAttr.value, idAttr.attribute)\n            : this.iri(idAttr.value, ctx);\n      },\n    });\n    if (iri !== RDF_DESCRIPTION) this.emit(s, rdfType, this.named(iri));\n    attrs.props.forEach((a) => {\n      this.emit(\n        s,\n        this.named(a.iri),\n        a.iri === RDF_TYPE ? this.iri(a.value, ctx) : this.literal(a.value, ctx),\n      );\n    });\n    this.propertyEltList(el, s, ctx);\n    return s;\n  }\n\n  propertyEltList(el: Xml.Element, subject: Term.Subject, ctx: Context): void {\n    let li = 1;\n    el.children.forEach((c) => {\n      if (isElement(c)) {\n        const name = this.elementIri(c);\n        this.propertyElt(c, name === RDF_LI ? rdf(`_${li++}`) : name, subject, ctx);\n      } else if (isText(c) && !Xml.isWhitespace(c.value)) {\n        this.fail('Unexpected text where property elements are expected', c);\n      }\n    });\n  }\n\n  propertyElt(el: Xml.Element, iri: string, subject: Term.Subject, parentCtx: Context): void {\n    if (isForbiddenPropertyElement(iri)) {\n      this.fail(`<${el.name}> is not allowed as a property element`, el);\n    }\n    const ctx = this.context(el, parentCtx);\n    const predicate = this.named(iri);\n    const attrs: PropertyAttributes = {\n      id: Option.none(),\n      annotation: Option.none(),\n      parseType: Option.none(),\n      resource: Option.none(),\n      nodeId: Option.none(),\n      datatype: Option.none(),\n      props: [],\n    };\n    this.attributes(el).forEach((a) => propertyAttribute(a, this, attrs));\n    const { id, annotation, parseType, resource, nodeId, datatype, props } = attrs;\n    const elements: Array<Xml.Element> = [];\n    let text = '';\n    let hasText = false;\n    el.children.forEach((c) => {\n      if (isElement(c)) elements.push(c);\n      else if (isText(c)) {\n        text += c.value;\n        hasText = true;\n      }\n    });\n\n    const finish = (object: Term.Object) => {\n      const statement = this.emit(subject, predicate, object);\n      this.reify(statement, id, annotation, ctx);\n    };\n    const firstProp = Arr.head(props);\n\n    if (Option.isSome(parseType)) {\n      this.reject([resource, nodeId, datatype, firstProp], 'cannot be used with rdf:parseType');\n      Match.value(parseType.value.value).pipe(\n        Match.when('Resource', () => {\n          const n = this.fresh();\n          finish(n);\n          this.propertyEltList(el, n, ctx);\n        }),\n        Match.when('Collection', () => {\n          const items = this.nodeElementList(el.children, ctx);\n          if (!Arr.isArrayNonEmpty(items)) {\n            finish(rdfNil);\n            return;\n          }\n          const cells = Arr.map(items, () => this.fresh());\n          finish(Arr.headNonEmpty(cells));\n          Arr.zip(cells, items).forEach(([cell, item], i) => {\n            this.emit(cell, rdfFirst, item);\n            this.emit(cell, rdfRest, cells[i + 1] ?? rdfNil);\n          });\n        }),\n        Match.when('Triple', () => {\n          const saved = this.sink;\n          this.sink = [];\n          if (\n            !Arr.isArrayNonEmpty(elements) ||\n            elements.length !== 1 ||\n            (hasText && !Xml.isWhitespace(text))\n          ) {\n            this.fail('rdf:parseType=\"Triple\" must contain exactly one node element', el);\n          }\n          this.nodeElement(Arr.headNonEmpty(elements), ctx);\n          const triples = this.sink;\n          this.sink = saved;\n          if (!isRdf12(ctx.version)) {\n            // Triple terms require an RDF 1.2 version announcement; without\n            // one the property element is ignored.\n            return;\n          }\n          if (!Arr.isArrayNonEmpty(triples) || triples.length !== 1) {\n            this.fail(\n              `rdf:parseType=\"Triple\" content must describe exactly one triple, found ${triples.length}`,\n              el,\n            );\n          }\n          finish(Arr.headNonEmpty(triples));\n        }),\n        Match.orElse(() => {\n          finish(new Term.Literal(Xml.canonicalize(el.children), rdfXmlLiteral));\n        }),\n      );\n      return;\n    }\n\n    if (Arr.isArrayNonEmpty(elements)) {\n      if (elements.length > 1)\n        this.fail('A property element can contain only one node element', el);\n      if (!Xml.isWhitespace(text))\n        this.fail('Mixed content is not allowed in a property element', el);\n      this.reject(\n        [resource, nodeId, datatype, firstProp],\n        'is not allowed on a property element with content',\n      );\n      finish(this.nodeElement(Arr.headNonEmpty(elements), ctx));\n      return;\n    }\n\n    if (hasText && text !== '') {\n      this.reject([resource, nodeId, firstProp], 'is not allowed on a literal property element');\n      finish(\n        Option.isSome(datatype)\n          ? Term.literal(text, this.named(resolveIn(datatype.value.value, ctx.base)))\n          : this.literal(text, ctx),\n      );\n      return;\n    }\n\n    // empty property element\n    if (Option.isSome(resource) && Option.isSome(nodeId)) {\n      this.fail('rdf:resource and rdf:nodeID cannot be used together', nodeId.value.attribute);\n    }\n    if (Option.isSome(datatype)) {\n      this.reject([resource, nodeId, firstProp], 'cannot be used with rdf:datatype');\n      finish(Term.literal('', this.named(resolveIn(datatype.value.value, ctx.base))));\n      return;\n    }\n    if (Option.isNone(resource) && Option.isNone(nodeId) && Arr.isReadonlyArrayEmpty(props)) {\n      finish(this.literal('', ctx));\n      return;\n    }\n    const r: Term.NamedNode | Term.BlankNode = Option.isSome(resource)\n      ? this.iri(resource.value.value, ctx)\n      : Option.isSome(nodeId)\n        ? this.blank(nodeId.value.value, nodeId.value.attribute)\n        : this.fresh();\n    props.forEach((a) => {\n      this.emit(\n        r,\n        this.named(a.iri),\n        a.iri === RDF_TYPE ? this.iri(a.value, ctx) : this.literal(a.value, ctx),\n      );\n    });\n    finish(r);\n  }\n\n  reify(\n    statement: Term.Triple,\n    id: Option.Option<Attr>,\n    annotation: Option.Option<Attr>,\n    ctx: Context,\n  ) {\n    if (Option.isSome(id)) {\n      const i = this.idIri(id.value.value, ctx, id.value.attribute);\n      this.emit(i, rdfType, rdfStatement);\n      this.emit(i, rdfSubject, statement.subject);\n      this.emit(i, rdfPredicate, statement.predicate);\n      this.emit(i, rdfObject, statement.object);\n    }\n    if (Option.isSome(annotation)) {\n      const { iri, value, attribute } = annotation.value;\n      const reifier = iri === RDF_ANNOTATION ? this.iri(value, ctx) : this.blank(value, attribute);\n      this.emit(reifier, rdfReifies, statement);\n    }\n  }\n}\n\nconst toParseError = (message: string, position: Xml.Position) =>\n  new Serialization.RdfParseError({\n    format: FORMAT_NAME,\n    message,\n    line: position.line,\n    column: position.column,\n  });\n\nconst parseTriples = (\n  doc: Xml.Document,\n  options?: ParseOptions,\n): Effect.Effect<ReadonlyArray<Term.Triple>, Serialization.RdfParseError> =>\n  Effect.try({\n    try: () => {\n      const parser = new RdfXmlParser(\n        options?.blankNodePrefix ?? Serialization.freshBlankNodePrefix(),\n        Option.fromUndefinedOr(options?.version),\n      );\n      parser.document(doc, Option.fromUndefinedOr(options?.baseIri));\n      return parser.sink;\n    },\n    catch: (e) => {\n      if (e instanceof ParseFailure) return toParseError(e.message, e.position);\n      throw e;\n    },\n  });\n\n/** Prefixes in the order first declared, each with its first namespace. */\ntype Prefixes = Array<readonly [prefix: string, namespace: string]>;\n\n/**\n * Adds the namespace declarations of the elements among `nodes` (at\n * `depth`, the root's being 0) and of their descendants down to `maxDepth`\n * to `prefixes`, keeping the first declaration of each prefix.\n */\nconst declarePrefixes = (\n  prefixes: Prefixes,\n  nodes: ReadonlyArray<Xml.Node>,\n  depth: number,\n  maxDepth: number,\n): void => {\n  nodes.forEach((node) => {\n    if (!isElement(node)) return;\n    node.namespaceDeclarations.forEach((d) => {\n      if (d.prefix !== '' && d.namespace !== '' && !prefixes.some(([p]) => p === d.prefix)) {\n        prefixes.push([d.prefix, d.namespace]);\n      }\n    });\n    if (depth < maxDepth) declarePrefixes(prefixes, node.children, depth + 1, maxDepth);\n  });\n};\n\n/** The prefixes declared on the root, its children and their children. */\nconst collectPrefixes = (doc: Xml.Document): PrefixMap.PrefixMap => {\n  const prefixes: Prefixes = [];\n  declarePrefixes(prefixes, [doc.root], 0, 2);\n  return PrefixMap.make(prefixes);\n};\n\n/**\n * Converts the node elements of an `rdf:RDF` root while the XML is read, as\n * each one is closed, so that no more than one of them is held at a time.\n * The order of conversion (and so of triples, blank nodes and prefixes) and\n * which error is reported are as for a whole document: an XML error anywhere\n * comes first, so the first RDF/XML error is kept until the XML has been\n * read.\n */\nclass RootStream {\n  readonly parser: RdfXmlParser;\n  /** The context outside the root, and then that of its node elements. */\n  private ctx: Context;\n  readonly prefixes: Prefixes = [];\n  readonly failures: Array<ParseFailure> = [];\n  /** Whether the root has been seen, and whether it is `rdf:RDF`. */\n  private started = false;\n  private streaming = false;\n  /** How many of the children the root kept have been converted. */\n  private converted = 0;\n\n  constructor(parser: RdfXmlParser, ctx: Context) {\n    this.parser = parser;\n    this.ctx = ctx;\n  }\n\n  /** The `RootChildHook`: takes the child if the root is `rdf:RDF`. */\n  readonly take = (child: Xml.Element, root: Xml.Element): boolean => {\n    if (!this.begin(root)) return false;\n    this.guard(() => {\n      this.drain(root);\n      declarePrefixes(this.prefixes, [child], 1, 2);\n      this.parser.nodeElement(child, this.ctx);\n    });\n    return true;\n  };\n\n  /** Converts what is left once the document has been read. */\n  finish(doc: Xml.Document): void {\n    if (this.begin(doc.root)) {\n      this.guard(() => this.drain(doc.root));\n    } else {\n      this.parser.document(doc, this.ctx.base);\n      declarePrefixes(this.prefixes, [doc.root], 0, 2);\n    }\n    const failure = this.failures.at(0);\n    if (failure !== undefined) throw failure;\n  }\n\n  private begin(root: Xml.Element): boolean {\n    if (!this.started) {\n      this.started = true;\n      this.streaming = isRdfRoot(root);\n      if (this.streaming) {\n        declarePrefixes(this.prefixes, [root], 0, 0);\n        this.guard(() => {\n          this.ctx = this.parser.rdfRoot(root, this.ctx);\n        });\n      }\n    }\n    return this.streaming;\n  }\n\n  /** Converts the children the root kept (text, and elements from entities) since the last time. */\n  private drain(root: Xml.Element): void {\n    const pending = root.children.slice(this.converted);\n    this.converted = root.children.length;\n    declarePrefixes(this.prefixes, pending, 1, 2);\n    this.parser.nodeElementList(pending, this.ctx);\n  }\n\n  /** Runs a conversion step unless one has failed, keeping its failure. */\n  private guard(step: () => void): void {\n    if (Arr.isReadonlyArrayNonEmpty(this.failures)) return;\n    const outcome = Result.try({ try: step, catch: (e) => e });\n    if (Result.isSuccess(outcome)) return;\n    if (!(outcome.failure instanceof ParseFailure)) throw outcome.failure;\n    this.failures.push(outcome.failure);\n  }\n}\n\n/**\n * Parses an already-parsed XML document as RDF/XML. The root element is\n * `rdf:RDF` or a single node element; `xml:base` on it is returned as the\n * base IRI and namespace declarations on it (and its children) as prefixes.\n * Formats that embed RDF/XML in a larger XML document (XMP, SVG metadata)\n * pass a document whose root is the embedded `rdf:RDF` element.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseDocument = (\n  doc: Xml.Document,\n  options?: ParseOptions,\n): Effect.Effect<Serialization.ParseResult, Serialization.RdfParseError> =>\n  Effect.map(parseTriples(doc, options), (triples) =>\n    toResult(toQuadsResult(triples, doc, collectPrefixes(doc), options)),\n  );\n\n/** The result of a parse: the triples in their graph, with the document's prefixes and base. */\n/** The quads of a parse, in their graph, with the document's prefixes and base. */\nconst toQuadsResult = (\n  triples: ReadonlyArray<Term.Triple>,\n  doc: Xml.Document,\n  prefixes: PrefixMap.PrefixMap,\n  options?: ParseOptions,\n): QuadsResult => {\n  const graph = options?.graph ?? Term.defaultGraph;\n  let baseIri = options?.baseIri;\n  const xmlBase = doc.root.attributes.find(\n    (a) => a.namespace === Xml.XML_NAMESPACE && a.localName === 'base',\n  );\n  if (xmlBase !== undefined) baseIri = Iri.resolve(xmlBase.value, baseIri);\n  return {\n    quads: triples.map((t) => new Term.Quad(t.subject, t.predicate, t.object, graph)),\n    prefixes,\n    baseIri,\n  };\n};\n\nconst toResult = (quads: QuadsResult): Serialization.ParseResult => ({\n  dataset: Dataset.fromIterable(quads.quads),\n  prefixes: quads.prefixes,\n  baseIri: quads.baseIri,\n});\n\n/**\n * The statements of an RDF/XML document in document order (duplicates\n * kept), with the namespace declarations on the root element (and its\n * children) as prefixes and the document's base IRI.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface QuadsResult extends Omit<Serialization.ParseResult, 'dataset'> {\n  readonly quads: ReadonlyArray<Term.Quad>;\n}\n\n/**\n * Parses a complete RDF/XML document into its statements in document order,\n * without building a dataset. Node elements are converted as they are read,\n * so the XML tree is never held whole.\n *\n * @since 0.1.0\n * @category parsing\n * @example\n * ```ts\n * import * as Effect from 'effect/Effect';\n * import { RdfXml } from '@thomasfosterau/effect-rdf/rdfxml';\n *\n * const { quads } = Effect.runSync(\n *   RdfXml.parseQuads(\n *     `<rdf:RDF xmlns:rdf=\"http://www.w3.org/1999/02/22-rdf-syntax-ns#\"\n *               xmlns:ex=\"http://example.org/\">\n *        <rdf:Description rdf:about=\"http://example.org/a\" ex:p=\"1\"/>\n *      </rdf:RDF>`,\n *   ),\n * );\n * // quads.length === 1\n * ```\n */\nexport const parseQuads = (\n  input: string,\n  options?: ParseOptions,\n): Effect.Effect<QuadsResult, Serialization.RdfParseError> =>\n  Effect.try({\n    try: () => {\n      const version = Option.fromUndefinedOr(options?.version);\n      const parser = new RdfXmlParser(\n        options?.blankNodePrefix ?? Serialization.freshBlankNodePrefix(),\n        version,\n      );\n      const stream = new RootStream(parser, {\n        base: Option.fromUndefinedOr(options?.baseIri),\n        language: '',\n        direction: '',\n        version,\n      });\n      const doc = XmlParser.parseText(input, stream.take);\n      stream.finish(doc);\n      return toQuadsResult(parser.sink, doc, PrefixMap.make(stream.prefixes), options);\n    },\n    catch: (e) => {\n      if (e instanceof XmlParser.Failure) return toParseError(e.message, e.position);\n      if (e instanceof ParseFailure) return toParseError(e.message, e.position);\n      throw e;\n    },\n  });\n\n/**\n * Parses a complete RDF/XML document. Namespace declarations on the root\n * element (and its children) are returned as prefixes.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parse = (\n  input: string,\n  options?: ParseOptions,\n): Effect.Effect<Serialization.ParseResult, Serialization.RdfParseError> =>\n  Effect.map(parseQuads(input, options), toResult).pipe(Serialization.withParseSpan(trace, input));\n\n/**\n * The RDF/XML parser.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parser: Serialization.Parser<ParseOptions> = Serialization.makeParser({\n  format,\n  parse,\n});\n\n// -----------------------------------------------------------------------------\n// Serializing\n// -----------------------------------------------------------------------------\n\n/**\n * Options for serialising RDF/XML.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface SerializeOptions extends Serialization.SerializeOptions {\n  /** The indentation unit. Defaults to two spaces. */\n  readonly indent?: string | undefined;\n  /**\n   * Whether to nest blank nodes that are the object of exactly one triple\n   * inside the referencing property element. Defaults to `true`.\n   */\n  readonly nestBlankNodes?: boolean | undefined;\n  /**\n   * Whether to use typed node elements (`<ex:Person>`) for an `rdf:type`\n   * of each node. Defaults to `true`.\n   */\n  readonly typedNodes?: boolean | undefined;\n  /** Whether to write the `<?xml …?>` declaration. Defaults to `true`. */\n  readonly xmlDeclaration?: boolean | undefined;\n}\n\nclass SerializeFailure {\n  readonly message: string;\n  constructor(message: string) {\n    this.message = message;\n  }\n}\n\nconst LOCAL_SUFFIX_RE = new RegExp(`[${Xml.NAME_START}][${Xml.NAME_CHAR}]*$`, 'u');\n\n/**\n * Splits an IRI into a namespace and a local name that is an XML `NCName`,\n * choosing the longest possible local name. Returns `None` when the IRI does\n * not end with an `NCName` (such IRIs cannot be used as element or\n * attribute names).\n *\n * @since 0.1.0\n * @category serializing\n */\nexport const splitIri = (iri: string): Option.Option<readonly [string, string]> => {\n  // The leftmost match is the longest NCName suffix.\n  const m = LOCAL_SUFFIX_RE.exec(iri);\n  if (m === null || m.index === 0) return Option.none();\n  return Option.some([iri.slice(0, m.index), m[0]] as const);\n};\n\nconst escapeAttr = Xml.escapeAttribute;\n\ninterface Namespaces {\n  /** namespace → prefix, for configured and generated prefixes. */\n  readonly byNamespace: MutableHashMap.MutableHashMap<string, string>;\n  /** Prefixes taken (configured, generated or reserved). */\n  readonly used: MutableHashSet.MutableHashSet<string>;\n  /** Namespaces actually referenced by the output. */\n  readonly declared: MutableHashSet.MutableHashSet<string>;\n  counter: number;\n}\n\n/** Whether `prefix` may be declared for `ns` as configured in `options.prefixes`. */\nconst isConfigurable = (prefix: string, ns: string): boolean =>\n  Xml.isNCName(prefix) &&\n  !prefix.toLowerCase().startsWith('xml') &&\n  ns !== ITS &&\n  Xml.isValidText(ns) &&\n  (ns === RDF) === (prefix === 'rdf') &&\n  prefix !== 'its';\n\n/** The first of `name(1)`, `name(2)`, … (counting on from `from`) that `taken` does not hold. */\nconst freshName = (\n  taken: MutableHashSet.MutableHashSet<string>,\n  from: number,\n  name: (n: number) => string,\n): readonly [name: string, n: number] => {\n  const candidate = name(from + 1);\n  return MutableHashSet.has(taken, candidate)\n    ? freshName(taken, from + 1, name)\n    : [candidate, from + 1];\n};\n\nclass Writer {\n  readonly namespaces: Namespaces;\n  readonly blankLabels = MutableHashMap.empty<string, string>();\n  /** The QName of each IRI written so far, while no namespace has been added since. */\n  private readonly qnames = MutableHashMap.empty<string, string>();\n  needsVersion = false;\n  needsIts = false;\n\n  readonly options: SerializeOptions;\n  constructor(options: SerializeOptions, prefixes: PrefixMap.PrefixMap) {\n    this.options = options;\n    const byNamespace = MutableHashMap.empty<string, string>();\n    const used = MutableHashSet.empty<string>();\n    prefixes.prefixes.forEach((ns, prefix) => {\n      if (\n        isConfigurable(prefix, ns) &&\n        !MutableHashMap.has(byNamespace, ns) &&\n        !MutableHashSet.has(used, prefix)\n      ) {\n        MutableHashMap.set(byNamespace, ns, prefix);\n        MutableHashSet.add(used, prefix);\n      }\n    });\n    if (!MutableHashMap.has(byNamespace, RDF)) {\n      MutableHashMap.set(byNamespace, RDF, 'rdf');\n      MutableHashSet.add(used, 'rdf');\n    }\n    MutableHashSet.add(used, 'its');\n    this.namespaces = { byNamespace, used, declared: MutableHashSet.make(RDF), counter: 0 };\n  }\n\n  fail(message: string): never {\n    throw new SerializeFailure(message);\n  }\n\n  qname(iri: string, what: string): string {\n    const known = MutableHashMap.get(this.qnames, iri);\n    if (Option.isSome(known)) return known.value;\n    const name = this.newQname(iri, what);\n    MutableHashMap.set(this.qnames, iri, name);\n    return name;\n  }\n\n  private newQname(iri: string, what: string): string {\n    if (!Xml.isValidText(iri)) this.fail(`The ${what} <${iri}> contains invalid XML characters`);\n    const { byNamespace, used, declared } = this.namespaces;\n    // Prefer the longest configured namespace that leaves an NCName.\n    const configured = Arr.reduce(\n      Arr.fromIterable(MutableHashMap.keys(byNamespace)),\n      Option.none<readonly [string, string]>(),\n      (best, ns) =>\n        iri.startsWith(ns) &&\n        (Option.isNone(best) || ns.length > best.value[0].length) &&\n        Xml.isNCName(iri.slice(ns.length))\n          ? Option.some([ns, iri.slice(ns.length)] as const)\n          : best,\n    );\n    const [ns, local] = Option.getOrElse(\n      Option.orElse(configured, () => splitIri(iri)),\n      () => this.fail(`The ${what} <${iri}> cannot be written as an XML QName`),\n    );\n    MutableHashSet.add(declared, ns);\n    const prefix = Option.getOrElse(MutableHashMap.get(byNamespace, ns), () => {\n      const [generated, n] = freshName(used, this.namespaces.counter, (i) => `ns${i}`);\n      this.namespaces.counter = n;\n      MutableHashSet.add(used, generated);\n      MutableHashMap.set(byNamespace, ns, generated);\n      // A new namespace may be a better choice for the IRIs already named\n      MutableHashMap.clear(this.qnames);\n      return generated;\n    });\n    return `${prefix}:${local}`;\n  }\n\n  iriRef(iri: string): string {\n    if (!Xml.isValidText(iri)) this.fail(`The IRI <${iri}> contains characters not allowed in XML`);\n    const base = this.options.baseIri;\n    if (base !== undefined) {\n      const rel = Iri.relativize(iri, base);\n      if (Option.isSome(rel)) return escapeAttr(rel.value);\n    }\n    return escapeAttr(iri);\n  }\n\n  blankLabel(node: Term.BlankNode): string {\n    const known = MutableHashMap.get(this.blankLabels, node.value);\n    if (Option.isSome(known)) return known.value;\n    const label =\n      Xml.isNCName(node.value) && !MutableHashSet.has(this.usedLabels, node.value)\n        ? node.value\n        : this.freshLabel();\n    MutableHashSet.add(this.usedLabels, label);\n    MutableHashMap.set(this.blankLabels, node.value, label);\n    return label;\n  }\n\n  private freshLabel(): string {\n    // `b0`, `b1`, …: `freshName` counts on from the one before the next\n    const [label, n] = freshName(this.usedLabels, this.labelCounter - 1, (i) => `b${i}`);\n    this.labelCounter = n + 1;\n    return label;\n  }\n\n  readonly usedLabels = MutableHashSet.empty<string>();\n  labelCounter = 0;\n}\n\n/** A subject with the triples it is the subject of. */\ninterface Description {\n  readonly subject: Term.Subject;\n  readonly triples: Array<Term.Triple>;\n}\n\ninterface Graph {\n  readonly bySubject: MutableHashMap.MutableHashMap<string, Description>;\n  readonly references: MutableHashMap.MutableHashMap<string, number>;\n}\n\nconst text = (value: string, writer: Writer): string => {\n  if (!Xml.isValidText(value)) writer.fail('A literal contains characters not allowed in XML 1.0');\n  return Xml.escapeText(value);\n};\n\nconst sortByPredicateObject = (ts: ReadonlyArray<Term.Triple>) =>\n  Arr.sort(\n    ts,\n    Order.combine(\n      Order.mapInput(Term.Order, (t: Term.Triple) => t.predicate),\n      Order.mapInput(Term.Order, (t: Term.Triple) => t.object),\n    ),\n  );\n\n/** Whether `t` gives its subject an `rdf:type` that can be the name of a typed node element. */\nconst isTypeTriple = (t: Term.Triple): t is Term.Triple & { readonly object: Term.NamedNode } =>\n  t.predicate.value === RDF_TYPE &&\n  Term.isNamedNode(t.object) &&\n  !isForbiddenNodeElement(t.object.value) &&\n  Option.isSome(splitIri(t.object.value));\n\nconst serializeGraph = (triples: ReadonlyArray<Term.Triple>, options: SerializeOptions): string => {\n  const writer = new Writer(options, options.prefixes ?? PrefixMap.empty);\n  const indentUnit = options.indent ?? '  ';\n  const nest = options.nestBlankNodes ?? true;\n  const typed = options.typedNodes ?? true;\n\n  const graph: Graph = { bySubject: MutableHashMap.empty(), references: MutableHashMap.empty() };\n  const referenceCount = (label: string): number => {\n    const count = MutableHashMap.get(graph.references, label);\n    return Option.isSome(count) ? count.value : 0;\n  };\n  const inTripleTerm = MutableHashSet.empty<string>();\n  const markTripleTerm = (t: Term.Term): void => {\n    if (Term.isBlankNode(t)) MutableHashSet.add(inTripleTerm, t.value);\n    else if (Term.isTriple(t)) {\n      markTripleTerm(t.subject);\n      markTripleTerm(t.object);\n    }\n  };\n  triples.forEach((t) => {\n    if (Term.isTriple(t.subject)) {\n      writer.fail('RDF/XML cannot represent triple terms in the subject position');\n    }\n    const subject = t.subject;\n    const key = subject.key;\n    const entry = MutableHashMap.get(graph.bySubject, key);\n    if (Option.isSome(entry)) entry.value.triples.push(t);\n    else MutableHashMap.set(graph.bySubject, key, { subject, triples: [t] });\n    const o = t.object;\n    if (Term.isBlankNode(o)) {\n      MutableHashMap.set(graph.references, o.value, referenceCount(o.value) + 1);\n    } else if (Term.isTriple(o)) {\n      markTripleTerm(o);\n    }\n  });\n\n  // Blank nodes that can be written inline, inside their only reference.\n  const nested = MutableHashSet.empty<string>();\n  if (nest) {\n    MutableHashMap.forEach(graph.references, (count, label) => {\n      if (count === 1 && !MutableHashSet.has(inTripleTerm, label)) {\n        MutableHashSet.add(nested, label);\n      }\n    });\n    // Break cycles: every nested node must be reachable from a top-level node.\n    const reachable = MutableHashSet.empty<string>();\n    const visit = (subjectKey: string): void => {\n      const entry = MutableHashMap.get(graph.bySubject, subjectKey);\n      if (Option.isNone(entry)) return;\n      entry.value.triples.forEach((t) => {\n        const o = t.object;\n        if (\n          Term.isBlankNode(o) &&\n          MutableHashSet.has(nested, o.value) &&\n          !MutableHashSet.has(reachable, o.value)\n        ) {\n          MutableHashSet.add(reachable, o.value);\n          visit(o.key);\n        }\n      });\n    };\n    MutableHashMap.forEach(graph.bySubject, (entry, key) => {\n      const s = entry.subject;\n      if (!Term.isBlankNode(s) || !MutableHashSet.has(nested, s.value)) visit(key);\n    });\n    MutableHashMap.forEach(graph.bySubject, (entry) => {\n      const s = entry.subject;\n      if (\n        Term.isBlankNode(s) &&\n        MutableHashSet.has(nested, s.value) &&\n        !MutableHashSet.has(reachable, s.value)\n      ) {\n        MutableHashSet.remove(nested, s.value);\n        visit(s.key);\n      }\n    });\n  }\n\n  const body: Array<string> = [];\n\n  /** Writes a node element for `subject` at `depth`. */\n  const node = (subject: Term.Subject, depth: number, inline: boolean, lines: Array<string>) => {\n    const pad = indentUnit.repeat(depth);\n    const sorted = Option.match(MutableHashMap.get(graph.bySubject, subject.key), {\n      onNone: (): ReadonlyArray<Term.Triple> => [],\n      onSome: (entry) => sortByPredicateObject(entry.triples),\n    });\n    const typeTriple = typed\n      ? Arr.findFirst(sorted, (t) =>\n          isTypeTriple(t) && Xml.isValidText(t.object.value)\n            ? Option.some([t, t.object.value] as const)\n            : Option.none(),\n        )\n      : Option.none();\n    const element = Option.match(typeTriple, {\n      onNone: () => 'rdf:Description',\n      onSome: ([, type]) => writer.qname(type, 'type'),\n    });\n    const ts = Option.match(typeTriple, {\n      onNone: () => sorted,\n      onSome: ([typeT]) => sorted.filter((t) => t !== typeT),\n    });\n    const attrs = Term.isNamedNode(subject)\n      ? ` rdf:about=\"${writer.iriRef(subject.value)}\"`\n      : Term.isBlankNode(subject) &&\n          !inline &&\n          (referenceCount(subject.value) > 0 || MutableHashSet.has(inTripleTerm, subject.value))\n        ? ` rdf:nodeID=\"${writer.blankLabel(subject)}\"`\n        : '';\n    if (Arr.isReadonlyArrayEmpty(ts)) {\n      lines.push(`${pad}<${element}${attrs}/>`);\n      return;\n    }\n    lines.push(`${pad}<${element}${attrs}>`);\n    ts.forEach((t) => property(t, depth + 1, lines));\n    lines.push(`${pad}</${element}>`);\n  };\n  const property = (t: Term.Triple, depth: number, lines: Array<string>) => {\n    const pad = indentUnit.repeat(depth);\n    const p = t.predicate.value;\n    if (isForbiddenPropertyElement(p) || p === RDF_LI) {\n      writer.fail(`The predicate <${p}> cannot be used as an RDF/XML property element`);\n    }\n    const name = writer.qname(p, 'predicate');\n    propertyObject(t.object, pad, name, depth, lines);\n  };\n\n  // Built once per serialisation, not per triple.\n  const propertyObject = Match.fn(\n    (o: Term.Object, _pad: string, _name: string, _depth: number, _lines: Array<string>) => o,\n  ).pipe(\n    Match.withReturnType<void>(),\n    Match.tag('NamedNode', (o, _o, pad, name, _depth, lines) => {\n      lines.push(`${pad}<${name} rdf:resource=\"${writer.iriRef(o.value)}\"/>`);\n    }),\n    Match.tag('BlankNode', (o, _o, pad, name, depth, lines) => {\n      if (MutableHashSet.has(nested, o.value) && !MutableHashSet.has(inTripleTerm, o.value)) {\n        const described = Option.match(MutableHashMap.get(graph.bySubject, o.key), {\n          onNone: (): ReadonlyArray<Term.Triple> => [],\n          onSome: (entry) => entry.triples,\n        });\n        if (Arr.isReadonlyArrayEmpty(described)) {\n          lines.push(`${pad}<${name} rdf:parseType=\"Resource\"/>`);\n          return;\n        }\n        if (!(typed && described.some(isTypeTriple))) {\n          lines.push(`${pad}<${name} rdf:parseType=\"Resource\">`);\n          sortByPredicateObject(described).forEach((x) => property(x, depth + 1, lines));\n          lines.push(`${pad}</${name}>`);\n          return;\n        }\n        lines.push(`${pad}<${name}>`);\n        node(o, depth + 1, true, lines);\n        lines.push(`${pad}</${name}>`);\n        return;\n      }\n      lines.push(`${pad}<${name} rdf:nodeID=\"${writer.blankLabel(o)}\"/>`);\n    }),\n    Match.tag('Literal', (o, _o, pad, name, _depth, lines) => {\n      let attrs = '';\n      if (o.language !== '') {\n        attrs += ` xml:lang=\"${escapeAttr(o.language)}\"`;\n        if (o.direction !== undefined) {\n          writer.needsVersion = true;\n          writer.needsIts = true;\n          attrs += ` its:dir=\"${o.direction}\"`;\n        }\n      } else if (o.datatype.value !== XSD_STRING) {\n        attrs += ` rdf:datatype=\"${writer.iriRef(o.datatype.value)}\"`;\n      }\n      if (o.value === '') lines.push(`${pad}<${name}${attrs}/>`);\n      else lines.push(`${pad}<${name}${attrs}>${text(o.value, writer)}</${name}>`);\n    }),\n    Match.tag('Triple', (o, _o, pad, name, depth, lines) => {\n      writer.needsVersion = true;\n      lines.push(`${pad}<${name} rdf:parseType=\"Triple\">`);\n      tripleTerm(o, depth + 1, lines);\n      lines.push(`${pad}</${name}>`);\n    }),\n    Match.exhaustive,\n  );\n\n  const tripleTerm = (t: Term.Triple, depth: number, lines: Array<string>) => {\n    const pad = indentUnit.repeat(depth);\n    const s = t.subject;\n    const attrs = Term.isNamedNode(s)\n      ? ` rdf:about=\"${writer.iriRef(s.value)}\"`\n      : Term.isBlankNode(s)\n        ? ` rdf:nodeID=\"${writer.blankLabel(s)}\"`\n        : writer.fail('RDF/XML cannot represent triple terms in the subject position');\n    lines.push(`${pad}<rdf:Description${attrs}>`);\n    const o = t.object;\n    if (Term.isBlankNode(o)) {\n      const name = writer.qname(t.predicate.value, 'predicate');\n      if (isForbiddenPropertyElement(t.predicate.value) || t.predicate.value === RDF_LI) {\n        writer.fail(\n          `The predicate <${t.predicate.value}> cannot be used as an RDF/XML property element`,\n        );\n      }\n      lines.push(`${pad}${indentUnit}<${name} rdf:nodeID=\"${writer.blankLabel(o)}\"/>`);\n    } else {\n      property(t, depth + 1, lines);\n    }\n    lines.push(`${pad}</rdf:Description>`);\n  };\n\n  const subjects = Arr.sort(\n    Arr.map(Arr.fromIterable(MutableHashMap.values(graph.bySubject)), (e) => e.subject),\n    // Not `Term.Order`, which puts blank nodes first: IRI subjects come first here, so named\n    // descriptions lead the document and unnested blank nodes follow.\n    Order.make<Term.Term>((a, b) =>\n      a._tag === b._tag ? Term.compare(a, b) : Term.isNamedNode(a) ? -1 : 1,\n    ),\n  );\n  subjects.forEach((s) => {\n    if (!Term.isBlankNode(s) || !MutableHashSet.has(nested, s.value)) node(s, 1, false, body);\n  });\n\n  const nsEntries = Arr.sort(\n    Arr.filter(Arr.fromIterable(writer.namespaces.byNamespace), ([ns]) =>\n      MutableHashSet.has(writer.namespaces.declared, ns),\n    ),\n    Order.make<readonly [string, string]>((a, b) =>\n      a[1] === 'rdf' ? -1 : b[1] === 'rdf' ? 1 : a[1] < b[1] ? -1 : 1,\n    ),\n  );\n  const decls: Array<string> = [\n    ...nsEntries.map(([ns, prefix]) => `xmlns:${prefix}=\"${escapeAttr(ns)}\"`),\n    ...(writer.needsIts ? [`xmlns:its=\"${ITS}\"`, 'its:version=\"2.0\"'] : []),\n    ...(options.baseIri === undefined ? [] : [`xml:base=\"${escapeAttr(options.baseIri)}\"`]),\n    ...(writer.needsVersion ? ['rdf:version=\"1.2\"'] : []),\n  ];\n  const sep = `\\n${' '.repeat('<rdf:RDF '.length)}`;\n  const declaration =\n    (options.xmlDeclaration ?? true) ? ['<?xml version=\"1.0\" encoding=\"utf-8\"?>'] : [];\n  // Not `push(...body)`, which passes every line as an argument and overflows the stack\n  const out = Arr.isReadonlyArrayEmpty(body)\n    ? [...declaration, `<rdf:RDF ${decls.join(sep)}/>`]\n    : [...declaration, `<rdf:RDF ${decls.join(sep)}>`, ...body, '</rdf:RDF>'];\n  return `${out.join('\\n')}\\n`;\n};\n\n/**\n * Serialises quads as an RDF/XML document. Fails with `RdfSerializeError`\n * for quads in named graphs, triple terms in the subject position, and\n * predicates that cannot be written as XML QNames.\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  Effect.suspend(() => {\n    const all = Arr.fromIterable(quads);\n    const named = Arr.findFirst(all, (q) => !Term.isDefaultGraph(q.graph));\n    if (Option.isSome(named)) {\n      return Effect.fail(\n        new Serialization.RdfSerializeError({\n          format: FORMAT_NAME,\n          message: `RDF/XML cannot represent named graphs (found graph ${named.value.graph.key})`,\n        }),\n      );\n    }\n    const triples = all.map((q) => q.triple);\n    return Effect.try({\n      try: () => serializeGraph(triples, options ?? {}),\n      catch: (e) => {\n        if (e instanceof SerializeFailure) {\n          return new Serialization.RdfSerializeError({ format: FORMAT_NAME, message: e.message });\n        }\n        throw e;\n      },\n    });\n  }).pipe(Serialization.withSerializeSpan(trace));\n\n/**\n * The RDF/XML serializer.\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 RDF/XML codec, including a `Schema` transforming RDF/XML documents to\n * datasets and back.\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":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCA,MAAM,MAAM;AACZ,MAAM,MAAM;AACZ,MAAM,aAAa;AACnB,MAAM,cAAc;;;;;;;AAQpB,MAAa,SAA+BA,WAAyB;CACnE,MAAM;CACN,WAAW;CACX,YAAY,CAAC,OAAO,KAAK;CACzB,UAAU;AACZ,CAAC;AAGD,MAAM,QAAkC;CAAE,QAAQ;CAAU;AAAO;AAsBnE,MAAM,OAAO,UAAkB,MAAM;;AAGrC,MAAM,iBAAiB,eAAe,aACpC;CACE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,IAAI,GAAG,CACX;AACA,MAAM,6BAA6B,eAAe,KAChD,MACA,SACA,YACA,aACA,QACA,SACF;AAEA,MAAM,kBAAkB,IAAI,aAAa;AACzC,MAAM,SAAS,IAAI,IAAI;AACvB,MAAM,WAAW,IAAI,MAAM;AAC3B,MAAM,SAAS,IAAI,IAAI;AACvB,MAAM,cAAc,IAAI,QAAQ;AAChC,MAAM,YAAY,IAAI,OAAO;AAC7B,MAAM,cAAc,IAAI,SAAS;AACjC,MAAM,iBAAiB,IAAI,YAAY;AACvC,MAAM,yBAAyB,IAAI,kBAAkB;AACrD,MAAM,iBAAiB,IAAI,WAAW;AACtC,MAAM,eAAe,IAAI,UAAU;AACnC,MAAM,eAAe,IAAI,UAAU;AAEnC,MAAM,cAAc,QAAyB,eAAe,IAAI,gBAAgB,GAAG;AACnF,MAAM,0BAA0B,QAAgB,WAAW,GAAG,KAAK,QAAQ;AAC3E,MAAM,8BAA8B,QAAgB,WAAW,GAAG,KAAK,QAAQ;AAC/E,MAAM,gCAAgC,QACpC,WAAW,GAAG,KAAK,QAAQ,mBAAmB,QAAQ;AAExD,MAAM,YAAY,UAAU,SAAS,SAAS;AAC9C,MAAM,SAAS,UAAU,SAAS,MAAM;AAExC,IAAM,eAAN,MAAmB;CACjB;CACA;CACA,YAAY,SAAiB,UAAwB;EACnD,KAAK,UAAU;EACf,KAAK,WAAW;CAClB;AACF;;AAUA,MAAM,aAAa,WAAmB,SACpCC,QAAY,WAAW,OAAO,eAAe,IAAI,CAAC;AAQpD,MAAM,WAAW,YACf,OAAO,OAAO,OAAO,KAAK,QAAQ,UAAU,SAAS,QAAQ,UAAU;AAEzE,MAAM,UAAU,IAAIC,UAAe,IAAI,MAAM,CAAC;AAC9C,MAAM,WAAW,IAAIA,UAAe,IAAI,OAAO,CAAC;AAChD,MAAM,UAAU,IAAIA,UAAe,IAAI,MAAM,CAAC;AAC9C,MAAM,SAAS,IAAIA,UAAe,IAAI,KAAK,CAAC;AAC5C,MAAM,eAAe,IAAIA,UAAe,IAAI,WAAW,CAAC;AACxD,MAAM,aAAa,IAAIA,UAAe,IAAI,SAAS,CAAC;AACpD,MAAM,eAAe,IAAIA,UAAe,IAAI,WAAW,CAAC;AACxD,MAAM,YAAY,IAAIA,UAAe,IAAI,QAAQ,CAAC;AAClD,MAAM,aAAa,IAAIA,UAAe,IAAI,SAAS,CAAC;AACpD,MAAM,gBAAgB,IAAIA,UAAe,IAAI,YAAY,CAAC;;;;;AAY1D,MAAM,gBAAgB,GAAS,QAAsB,UAA6B;CAChF,IAAI,EAAE,QAAQ,aAAa;CAC3B,IAAI,6BAA6B,EAAE,GAAG,GACpC,OAAO,KAAK,GAAG,EAAE,UAAU,KAAK,0CAA0C,EAAE,SAAS;CAEvF,MAAM,KAAK,CAAC;AACd;;AAGA,MAAM,iBAAiB,GAAS,QAAsB,UAAgC;CACpF,MAAM,MAAM,EAAE;CACd,IAAI,QAAQ,UAAU,QAAQ,eAAe,QAAQ,WAAW;EAC9D,aAAa,GAAG,QAAQ,MAAM,KAAK;EACnC;CACF;CACA,IAAI,OAAO,OAAO,MAAM,MAAM,GAC5B,OAAO,KACL,OAAO,MAAM,OAAO,MAAM,UAAU,UAAU,WAAW,EAAE,UAAU,UAAU,2BAC/E,EAAE,SACJ;CAEF,MAAM,SAAS,OAAO,KAAK,CAAC;AAC9B;;AAcA,MAAM,qBAAqB,GAAS,QAAsB,UAAoC;CAC5F,MAAM,MAAM,EAAE;CACd,IAAI,QAAQ,QAAQ,MAAM,KAAK,OAAO,KAAK,CAAC;MACvC,IAAI,QAAQ,kBAAkB,QAAQ,wBAAwB;EACjE,IAAI,OAAO,OAAO,MAAM,UAAU,GAChC,OAAO,KAAK,mEAAmE,EAAE,SAAS;EAE5F,MAAM,aAAa,OAAO,KAAK,CAAC;CAClC,OAAO,IAAI,QAAQ,gBAAgB,MAAM,YAAY,OAAO,KAAK,CAAC;MAC7D,IAAI,QAAQ,cAAc,MAAM,WAAW,OAAO,KAAK,CAAC;MACxD,IAAI,QAAQ,aAAa,MAAM,SAAS,OAAO,KAAK,CAAC;MACrD,IAAI,QAAQ,cAAc,MAAM,WAAW,OAAO,KAAK,CAAC;MACxD,aAAa,GAAG,QAAQ,MAAM,KAAK;AAC1C;AAEA,MAAM,aAAa,SACjB,KAAK,cAAc,OAAO,KAAK,cAAc;AAE/C,IAAM,eAAN,MAAmB;CACjB,OAA2B,CAAC;CAC5B,MAAe,eAAe,MAAc;CAC5C,UAAU;CAEV;CACA;CACA,YAAY,iBAAyB,gBAAuC;EAC1E,KAAK,kBAAkB;EACvB,KAAK,iBAAiB;CACxB;CAEA,KAAK,SAAiB,MAAkD;EACtE,MAAM,IAAI,aAAa,SAAS,KAAK,QAAQ;CAC/C;;CAGA,OAAO,OAAsC,KAAmB;EAC9D,MAAM,QAAQ,OAAO,YAAY,KAAK;EACtC,IAAI,OAAO,OAAO,KAAK,GAAG;GACxB,MAAM,EAAE,cAAc,MAAM;GAC5B,KAAK,KAAK,GAAG,UAAU,KAAK,GAAG,OAAO,SAAS;EACjD;CACF;CAEA,KAAK,GAAiB,GAAmB,GAA6B;EACpE,MAAM,IAAI,IAAIC,OAAY,GAAG,GAAG,CAAC;EACjC,KAAK,KAAK,KAAK,CAAC;EAChB,OAAO;CACT;CAEA,QAAwB;EACtB,OAAO,IAAIC,UAAe,GAAG,KAAK,kBAAkB,KAAK,WAAW;CACtE;CAEA,MAAM,IAAY,MAA2D;EAC3E,IAAI,CAACC,SAAa,EAAE,GAAG,KAAK,KAAK,kCAAkC,GAAG,IAAI,IAAI;EAC9E,OAAO,IAAID,UAAe,GAAG,KAAK,kBAAkB,IAAI;CAC1D;;CAGA,QAAyB,eAAe,MAA8B;;;;;CAMtE,iBAAkC,eAAe,MAG/C;;;;;;CAOF,UAAU,WAAmB,WAA2B;EACtD,MAAM,cAAc,eAAe,IAAI,KAAK,gBAAgB,SAAS;EACrE,IAAI,OAAO,OAAO,WAAW,GAAG;GAC9B,MAAM,MAAM,YAAY;GACxB,eAAe,IAAI,KAAK,gBAAgB,WAAW,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;GACrE,OAAO;EACT;EACA,MAAM,cAAc,YAAY;EAChC,MAAM,QAAQ,YAAY,MAAM,CAAC,QAAQ,OAAO,SAAS;EACzD,IAAI,UAAU,KAAA,GAAW,OAAO,MAAM;EACtC,MAAM,MAAM,YAAY;EACxB,YAAY,KAAK,CAAC,WAAW,GAAG,CAAC;EACjC,OAAO;CACT;;CAGA,MAAM,KAA6B;EACjC,MAAM,QAAQ,eAAe,IAAI,KAAK,OAAO,GAAG;EAChD,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,MAAM;EACvC,MAAM,OAAO,IAAIF,UAAe,GAAG;EACnC,eAAe,IAAI,KAAK,OAAO,KAAK,IAAI;EACxC,OAAO;CACT;CAEA,IAAI,OAAe,KAA8B;EAC/C,OAAO,IAAIA,UAAe,UAAU,OAAO,IAAI,IAAI,CAAC;CACtD;CAEA,MAAM,IAAY,KAAc,MAA2D;EACzF,IAAI,CAACG,SAAa,EAAE,GAAG,KAAK,KAAK,mBAAmB,GAAG,IAAI,IAAI;EAC/D,MAAM,MAAM,UAAU,IAAI,MAAM,IAAI,IAAI;EACxC,IAAI,eAAe,IAAI,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,qBAAqB,GAAG,IAAI,IAAI;EACjF,eAAe,IAAI,KAAK,KAAK,GAAG;EAChC,OAAO,IAAIH,UAAe,GAAG;CAC/B;CAEA,QAAQ,OAAe,KAA4B;EACjD,IAAI,IAAI,aAAa,IAAI,OAAOI,QAAa,KAAK;EAClD,OAAO,IAAI,cAAc,KACrBA,QAAa,OAAO,IAAI,QAAQ,IAChCA,QAAa,OAAO;GAAE,UAAU,IAAI;GAAU,WAAW,IAAI;EAAU,CAAC;CAC9E;;CAGA,QAAQ,IAAiB,QAA0B;EACjD,IAAI,IAAI,qBAAqB,GAAG,UAAU,GAAG,OAAO;EACpD,IAAI,OAAO,OAAO;EAClB,IAAI,WAAW,OAAO;EACtB,IAAI,YAAY,OAAO;EACvB,IAAI,UAAU,OAAO;EACrB,IAAI,MAAM,OAAO,KAAoB;EACrC,GAAG,WAAW,SAAS,MAAM;GAC3B,IAAI,EAAE,cAAc,wCAAmB;IACrC,IAAI,EAAE,cAAc,QAAQ,OAAO,OAAO,KAAK,UAAU,EAAE,OAAO,IAAI,CAAC;SAClE,IAAI,EAAE,cAAc,QAAQ,WAAW,EAAE;GAChD,OAAO,IAAI,EAAE,cAAc,OAAO,EAAE,cAAc,OAChD,MAAM,OAAO,KAAK,CAAC;QACd,KAAK,EAAE,cAAc,OAAO,EAAE,cAAc,KAAA,MAAc,EAAE,cAAc,WAC/E,UAAU,OAAO,KAAK,EAAE,KAAK;EAEjC,CAAC;EACD,IAAI,OAAO,OAAO,GAAG,KAAK,QAAQ,OAAO,GAAG;GAC1C,MAAM,QAAQ,IAAI,MAAM;GACxB,IAAI,UAAU,SAAS,UAAU,SAAS,UAAU,IAClD,KAAK,KAAK,0BAA0B,MAAM,IAAI,IAAI,KAAK;GAGzD,YAAY;EACd;EACA,OAAO;GAAE;GAAM;GAAU;GAAW;EAAQ;CAC9C;;CAGA,WAAW,IAA8B;EACvC,MAAM,MAAmB,CAAC;EAC1B,GAAG,WAAW,SAAS,MAAM;GAC3B,IAAI,EAAE,cAAc,wCAAmB;GACvC,IAAI,EAAE,OAAO,YAAY,CAAC,CAAC,WAAW,KAAK,GAAG;GAC9C,IAAI,EAAE,cAAc,KAAA,GAAW;IAC7B,IAAI,EAAE,UAAU,YAAY,CAAC,CAAC,WAAW,KAAK,GAAG;IACjD,IAAI,CAAC,eAAe,IAAI,4BAA4B,EAAE,SAAS,GAC7D,KAAK,KAAK,0BAA0B,EAAE,UAAU,mBAAmB,CAAC;IAEtE,IAAI,KAAK;KAAE,KAAK,KAAK,UAAU,KAAK,EAAE,SAAS;KAAG,OAAO,EAAE;KAAO,WAAW;IAAE,CAAC;IAChF;GACF;GACA,IAAI,EAAE,cAAc,QAAQ,EAAE,cAAc,SAAS,EAAE,cAAc,YAAY;GACjF,IAAI,KAAK;IAAE,KAAK,KAAK,UAAU,EAAE,WAAW,EAAE,SAAS;IAAG,OAAO,EAAE;IAAO,WAAW;GAAE,CAAC;EAC1F,CAAC;EACD,OAAO;CACT;CAEA,WAAW,IAAyB;EAClC,IAAI,GAAG,cAAc,KAAA,GACnB,KAAK,KAAK,YAAY,GAAG,KAAK,0BAA0B,EAAE;EAE5D,OAAO,KAAK,UAAU,GAAG,WAAW,GAAG,SAAS;CAClD;CAEA,SAAS,KAAmB,MAAmC;EAC7D,MAAM,OAAO,IAAI;EACjB,MAAM,MAAe;GAAE;GAAM,UAAU;GAAI,WAAW;GAAI,SAAS,KAAK;EAAe;EACvF,IAAI,UAAU,IAAI,GAAG,KAAK,gBAAgB,KAAK,UAAU,KAAK,QAAQ,MAAM,GAAG,CAAC;OAC3E,KAAK,YAAY,MAAM,GAAG;CACjC;;CAGA,QAAQ,MAAmB,KAAuB;EAChD,MAAM,UAAU,KAAK,QAAQ,MAAM,GAAG;EACtC,KAAK,WAAW,IAAI,CAAC,CAAC,SAAS,MAAM;GACnC,IAAI,EAAE,QAAQ,aAAa,KAAK,KAAK,mCAAmC,EAAE,SAAS;EACrF,CAAC;EACD,OAAO;CACT;CAEA,gBAAgB,UAAmC,KAAmC;EACpF,MAAM,WAAgC,CAAC;EACvC,SAAS,SAAS,MAAM;GACtB,IAAI,UAAU,CAAC,GAAG,SAAS,KAAK,KAAK,YAAY,GAAG,GAAG,CAAC;QACnD,IAAI,OAAO,CAAC,KAAK,CAACC,aAAiB,EAAE,KAAK,GAC7C,KAAK,KAAK,oDAAoD,CAAC;EAEnE,CAAC;EACD,OAAO;CACT;CAEA,YAAY,IAAiB,WAAkC;EAC7D,MAAM,MAAM,KAAK,QAAQ,IAAI,SAAS;EACtC,MAAM,MAAM,KAAK,WAAW,EAAE;EAC9B,IAAI,uBAAuB,GAAG,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,qCAAqC,EAAE;EAC9F,MAAM,QAAwB;GAAE,QAAQ,OAAO,KAAK;GAAG,OAAO,CAAC;EAAE;EACjE,KAAK,WAAW,EAAE,CAAC,CAAC,SAAS,MAAM,cAAc,GAAG,MAAM,KAAK,CAAC;EAChE,MAAM,IAAkB,OAAO,MAAM,MAAM,QAAQ;GACjD,cAAc,KAAK,MAAM;GACzB,SAAS,WAAW;IAClB,MAAM,QAAQ,OAAO,IAAI,MAAM,EAAU;IACzC,OAAO,UAAU,OACb,KAAK,MAAM,OAAO,OAAO,KAAK,OAAO,SAAS,IAC9C,UAAU,WACR,KAAK,MAAM,OAAO,OAAO,OAAO,SAAS,IACzC,KAAK,IAAI,OAAO,OAAO,GAAG;GAClC;EACF,CAAC;EACD,IAAI,QAAQ,iBAAiB,KAAK,KAAK,GAAG,SAAS,KAAK,MAAM,GAAG,CAAC;EAClE,MAAM,MAAM,SAAS,MAAM;GACzB,KAAK,KACH,GACA,KAAK,MAAM,EAAE,GAAG,GAChB,EAAE,QAAQ,WAAW,KAAK,IAAI,EAAE,OAAO,GAAG,IAAI,KAAK,QAAQ,EAAE,OAAO,GAAG,CACzE;EACF,CAAC;EACD,KAAK,gBAAgB,IAAI,GAAG,GAAG;EAC/B,OAAO;CACT;CAEA,gBAAgB,IAAiB,SAAuB,KAAoB;EAC1E,IAAI,KAAK;EACT,GAAG,SAAS,SAAS,MAAM;GACzB,IAAI,UAAU,CAAC,GAAG;IAChB,MAAM,OAAO,KAAK,WAAW,CAAC;IAC9B,KAAK,YAAY,GAAG,SAAS,SAAS,IAAI,IAAI,MAAM,IAAI,MAAM,SAAS,GAAG;GAC5E,OAAO,IAAI,OAAO,CAAC,KAAK,CAACA,aAAiB,EAAE,KAAK,GAC/C,KAAK,KAAK,wDAAwD,CAAC;EAEvE,CAAC;CACH;CAEA,YAAY,IAAiB,KAAa,SAAuB,WAA0B;EACzF,IAAI,2BAA2B,GAAG,GAChC,KAAK,KAAK,IAAI,GAAG,KAAK,yCAAyC,EAAE;EAEnE,MAAM,MAAM,KAAK,QAAQ,IAAI,SAAS;EACtC,MAAM,YAAY,KAAK,MAAM,GAAG;EAChC,MAAM,QAA4B;GAChC,IAAI,OAAO,KAAK;GAChB,YAAY,OAAO,KAAK;GACxB,WAAW,OAAO,KAAK;GACvB,UAAU,OAAO,KAAK;GACtB,QAAQ,OAAO,KAAK;GACpB,UAAU,OAAO,KAAK;GACtB,OAAO,CAAC;EACV;EACA,KAAK,WAAW,EAAE,CAAC,CAAC,SAAS,MAAM,kBAAkB,GAAG,MAAM,KAAK,CAAC;EACpE,MAAM,EAAE,IAAI,YAAY,WAAW,UAAU,QAAQ,UAAU,UAAU;EACzE,MAAM,WAA+B,CAAC;EACtC,IAAI,OAAO;EACX,IAAI,UAAU;EACd,GAAG,SAAS,SAAS,MAAM;GACzB,IAAI,UAAU,CAAC,GAAG,SAAS,KAAK,CAAC;QAC5B,IAAI,OAAO,CAAC,GAAG;IAClB,QAAQ,EAAE;IACV,UAAU;GACZ;EACF,CAAC;EAED,MAAM,UAAU,WAAwB;GACtC,MAAM,YAAY,KAAK,KAAK,SAAS,WAAW,MAAM;GACtD,KAAK,MAAM,WAAW,IAAI,YAAY,GAAG;EAC3C;EACA,MAAM,YAAY,IAAI,KAAK,KAAK;EAEhC,IAAI,OAAO,OAAO,SAAS,GAAG;GAC5B,KAAK,OAAO;IAAC;IAAU;IAAQ;IAAU;GAAS,GAAG,mCAAmC;GACxF,MAAM,MAAM,UAAU,MAAM,KAAK,CAAC,CAAC,KACjC,MAAM,KAAK,kBAAkB;IAC3B,MAAM,IAAI,KAAK,MAAM;IACrB,OAAO,CAAC;IACR,KAAK,gBAAgB,IAAI,GAAG,GAAG;GACjC,CAAC,GACD,MAAM,KAAK,oBAAoB;IAC7B,MAAM,QAAQ,KAAK,gBAAgB,GAAG,UAAU,GAAG;IACnD,IAAI,CAAC,IAAI,gBAAgB,KAAK,GAAG;KAC/B,OAAO,MAAM;KACb;IACF;IACA,MAAM,QAAQ,IAAI,IAAI,aAAa,KAAK,MAAM,CAAC;IAC/C,OAAO,IAAI,aAAa,KAAK,CAAC;IAC9B,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC,SAAS,CAAC,MAAM,OAAO,MAAM;KACjD,KAAK,KAAK,MAAM,UAAU,IAAI;KAC9B,KAAK,KAAK,MAAM,SAAS,MAAM,IAAI,MAAM,MAAM;IACjD,CAAC;GACH,CAAC,GACD,MAAM,KAAK,gBAAgB;IACzB,MAAM,QAAQ,KAAK;IACnB,KAAK,OAAO,CAAC;IACb,IACE,CAAC,IAAI,gBAAgB,QAAQ,KAC7B,SAAS,WAAW,KACnB,WAAW,CAACA,aAAiB,IAAI,GAElC,KAAK,KAAK,kEAAgE,EAAE;IAE9E,KAAK,YAAY,IAAI,aAAa,QAAQ,GAAG,GAAG;IAChD,MAAM,UAAU,KAAK;IACrB,KAAK,OAAO;IACZ,IAAI,CAAC,QAAQ,IAAI,OAAO,GAGtB;IAEF,IAAI,CAAC,IAAI,gBAAgB,OAAO,KAAK,QAAQ,WAAW,GACtD,KAAK,KACH,0EAA0E,QAAQ,UAClF,EACF;IAEF,OAAO,IAAI,aAAa,OAAO,CAAC;GAClC,CAAC,GACD,MAAM,aAAa;IACjB,OAAO,IAAIC,QAAaC,aAAiB,GAAG,QAAQ,GAAG,aAAa,CAAC;GACvE,CAAC,CACH;GACA;EACF;EAEA,IAAI,IAAI,gBAAgB,QAAQ,GAAG;GACjC,IAAI,SAAS,SAAS,GACpB,KAAK,KAAK,wDAAwD,EAAE;GACtE,IAAI,CAACF,aAAiB,IAAI,GACxB,KAAK,KAAK,sDAAsD,EAAE;GACpE,KAAK,OACH;IAAC;IAAU;IAAQ;IAAU;GAAS,GACtC,mDACF;GACA,OAAO,KAAK,YAAY,IAAI,aAAa,QAAQ,GAAG,GAAG,CAAC;GACxD;EACF;EAEA,IAAI,WAAW,SAAS,IAAI;GAC1B,KAAK,OAAO;IAAC;IAAU;IAAQ;GAAS,GAAG,8CAA8C;GACzF,OACE,OAAO,OAAO,QAAQ,IAClBD,QAAa,MAAM,KAAK,MAAM,UAAU,SAAS,MAAM,OAAO,IAAI,IAAI,CAAC,CAAC,IACxE,KAAK,QAAQ,MAAM,GAAG,CAC5B;GACA;EACF;EAGA,IAAI,OAAO,OAAO,QAAQ,KAAK,OAAO,OAAO,MAAM,GACjD,KAAK,KAAK,uDAAuD,OAAO,MAAM,SAAS;EAEzF,IAAI,OAAO,OAAO,QAAQ,GAAG;GAC3B,KAAK,OAAO;IAAC;IAAU;IAAQ;GAAS,GAAG,kCAAkC;GAC7E,OAAOA,QAAa,IAAI,KAAK,MAAM,UAAU,SAAS,MAAM,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;GAC9E;EACF;EACA,IAAI,OAAO,OAAO,QAAQ,KAAK,OAAO,OAAO,MAAM,KAAK,IAAI,qBAAqB,KAAK,GAAG;GACvF,OAAO,KAAK,QAAQ,IAAI,GAAG,CAAC;GAC5B;EACF;EACA,MAAM,IAAqC,OAAO,OAAO,QAAQ,IAC7D,KAAK,IAAI,SAAS,MAAM,OAAO,GAAG,IAClC,OAAO,OAAO,MAAM,IAClB,KAAK,MAAM,OAAO,MAAM,OAAO,OAAO,MAAM,SAAS,IACrD,KAAK,MAAM;EACjB,MAAM,SAAS,MAAM;GACnB,KAAK,KACH,GACA,KAAK,MAAM,EAAE,GAAG,GAChB,EAAE,QAAQ,WAAW,KAAK,IAAI,EAAE,OAAO,GAAG,IAAI,KAAK,QAAQ,EAAE,OAAO,GAAG,CACzE;EACF,CAAC;EACD,OAAO,CAAC;CACV;CAEA,MACE,WACA,IACA,YACA,KACA;EACA,IAAI,OAAO,OAAO,EAAE,GAAG;GACrB,MAAM,IAAI,KAAK,MAAM,GAAG,MAAM,OAAO,KAAK,GAAG,MAAM,SAAS;GAC5D,KAAK,KAAK,GAAG,SAAS,YAAY;GAClC,KAAK,KAAK,GAAG,YAAY,UAAU,OAAO;GAC1C,KAAK,KAAK,GAAG,cAAc,UAAU,SAAS;GAC9C,KAAK,KAAK,GAAG,WAAW,UAAU,MAAM;EAC1C;EACA,IAAI,OAAO,OAAO,UAAU,GAAG;GAC7B,MAAM,EAAE,KAAK,OAAO,cAAc,WAAW;GAC7C,MAAM,UAAU,QAAQ,iBAAiB,KAAK,IAAI,OAAO,GAAG,IAAI,KAAK,MAAM,OAAO,SAAS;GAC3F,KAAK,KAAK,SAAS,YAAY,SAAS;EAC1C;CACF;AACF;AAEA,MAAM,gBAAgB,SAAiB,aACrC,IAAII,cAA4B;CAC9B,QAAQ;CACR;CACA,MAAM,SAAS;CACf,QAAQ,SAAS;AACnB,CAAC;AAEH,MAAM,gBACJ,KACA,YAEA,OAAO,IAAI;CACT,WAAW;EACT,MAAM,SAAS,IAAI,aACjB,SAAS,mBAAmBC,qBAAmC,GAC/D,OAAO,gBAAgB,SAAS,OAAO,CACzC;EACA,OAAO,SAAS,KAAK,OAAO,gBAAgB,SAAS,OAAO,CAAC;EAC7D,OAAO,OAAO;CAChB;CACA,QAAQ,MAAM;EACZ,IAAI,aAAa,cAAc,OAAO,aAAa,EAAE,SAAS,EAAE,QAAQ;EACxE,MAAM;CACR;AACF,CAAC;;;;;;AAUH,MAAM,mBACJ,UACA,OACA,OACA,aACS;CACT,MAAM,SAAS,SAAS;EACtB,IAAI,CAAC,UAAU,IAAI,GAAG;EACtB,KAAK,sBAAsB,SAAS,MAAM;GACxC,IAAI,EAAE,WAAW,MAAM,EAAE,cAAc,MAAM,CAAC,SAAS,MAAM,CAAC,OAAO,MAAM,EAAE,MAAM,GACjF,SAAS,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC;EAEzC,CAAC;EACD,IAAI,QAAQ,UAAU,gBAAgB,UAAU,KAAK,UAAU,QAAQ,GAAG,QAAQ;CACpF,CAAC;AACH;;AAGA,MAAM,mBAAmB,QAA2C;CAClE,MAAM,WAAqB,CAAC;CAC5B,gBAAgB,UAAU,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;CAC1C,OAAOC,KAAe,QAAQ;AAChC;;;;;;;;;AAUA,IAAM,aAAN,MAAiB;CACf;;CAEA;CACA,WAA8B,CAAC;CAC/B,WAAyC,CAAC;;CAE1C,UAAkB;CAClB,YAAoB;;CAEpB,YAAoB;CAEpB,YAAY,QAAsB,KAAc;EAC9C,KAAK,SAAS;EACd,KAAK,MAAM;CACb;;CAGA,QAAiB,OAAoB,SAA+B;EAClE,IAAI,CAAC,KAAK,MAAM,IAAI,GAAG,OAAO;EAC9B,KAAK,YAAY;GACf,KAAK,MAAM,IAAI;GACf,gBAAgB,KAAK,UAAU,CAAC,KAAK,GAAG,GAAG,CAAC;GAC5C,KAAK,OAAO,YAAY,OAAO,KAAK,GAAG;EACzC,CAAC;EACD,OAAO;CACT;;CAGA,OAAO,KAAyB;EAC9B,IAAI,KAAK,MAAM,IAAI,IAAI,GACrB,KAAK,YAAY,KAAK,MAAM,IAAI,IAAI,CAAC;OAChC;GACL,KAAK,OAAO,SAAS,KAAK,KAAK,IAAI,IAAI;GACvC,gBAAgB,KAAK,UAAU,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;EACjD;EACA,MAAM,UAAU,KAAK,SAAS,GAAG,CAAC;EAClC,IAAI,YAAY,KAAA,GAAW,MAAM;CACnC;CAEA,MAAc,MAA4B;EACxC,IAAI,CAAC,KAAK,SAAS;GACjB,KAAK,UAAU;GACf,KAAK,YAAY,UAAU,IAAI;GAC/B,IAAI,KAAK,WAAW;IAClB,gBAAgB,KAAK,UAAU,CAAC,IAAI,GAAG,GAAG,CAAC;IAC3C,KAAK,YAAY;KACf,KAAK,MAAM,KAAK,OAAO,QAAQ,MAAM,KAAK,GAAG;IAC/C,CAAC;GACH;EACF;EACA,OAAO,KAAK;CACd;;CAGA,MAAc,MAAyB;EACrC,MAAM,UAAU,KAAK,SAAS,MAAM,KAAK,SAAS;EAClD,KAAK,YAAY,KAAK,SAAS;EAC/B,gBAAgB,KAAK,UAAU,SAAS,GAAG,CAAC;EAC5C,KAAK,OAAO,gBAAgB,SAAS,KAAK,GAAG;CAC/C;;CAGA,MAAc,MAAwB;EACpC,IAAI,IAAI,wBAAwB,KAAK,QAAQ,GAAG;EAChD,MAAM,UAAU,OAAO,IAAI;GAAE,KAAK;GAAM,QAAQ,MAAM;EAAE,CAAC;EACzD,IAAI,OAAO,UAAU,OAAO,GAAG;EAC/B,IAAI,EAAE,QAAQ,mBAAmB,eAAe,MAAM,QAAQ;EAC9D,KAAK,SAAS,KAAK,QAAQ,OAAO;CACpC;AACF;;;;;;;;;;;AAYA,MAAa,iBACX,KACA,YAEA,OAAO,IAAI,aAAa,KAAK,OAAO,IAAI,YACtC,SAAS,cAAc,SAAS,KAAK,gBAAgB,GAAG,GAAG,OAAO,CAAC,CACrE;;;AAIF,MAAM,iBACJ,SACA,KACA,UACA,YACgB;CAChB,MAAM,QAAQ,SAAS,SAASC;CAChC,IAAI,UAAU,SAAS;CACvB,MAAM,UAAU,IAAI,KAAK,WAAW,MACjC,MAAM,EAAE,cAAc,0CAAqB,EAAE,cAAc,MAC9D;CACA,IAAI,YAAY,KAAA,GAAW,UAAUZ,QAAY,QAAQ,OAAO,OAAO;CACvE,OAAO;EACL,OAAO,QAAQ,KAAK,MAAM,IAAIa,KAAU,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,KAAK,CAAC;EAChF;EACA;CACF;AACF;AAEA,MAAM,YAAY,WAAmD;CACnE,SAASC,aAAqB,MAAM,KAAK;CACzC,UAAU,MAAM;CAChB,SAAS,MAAM;AACjB;;;;;;;;;;;;;;;;;;;;;;;;AAqCA,MAAa,cACX,OACA,YAEA,OAAO,IAAI;CACT,WAAW;EACT,MAAM,UAAU,OAAO,gBAAgB,SAAS,OAAO;EACvD,MAAM,SAAS,IAAI,aACjB,SAAS,mBAAmBJ,qBAAmC,GAC/D,OACF;EACA,MAAM,SAAS,IAAI,WAAW,QAAQ;GACpC,MAAM,OAAO,gBAAgB,SAAS,OAAO;GAC7C,UAAU;GACV,WAAW;GACX;EACF,CAAC;EACD,MAAM,MAAMK,UAAoB,OAAO,OAAO,IAAI;EAClD,OAAO,OAAO,GAAG;EACjB,OAAO,cAAc,OAAO,MAAM,KAAKJ,KAAe,OAAO,QAAQ,GAAG,OAAO;CACjF;CACA,QAAQ,MAAM;EACZ,IAAI,aAAaK,SAAmB,OAAO,aAAa,EAAE,SAAS,EAAE,QAAQ;EAC7E,IAAI,aAAa,cAAc,OAAO,aAAa,EAAE,SAAS,EAAE,QAAQ;EACxE,MAAM;CACR;AACF,CAAC;;;;;;;;AASH,MAAa,SACX,OACA,YAEA,OAAO,IAAI,WAAW,OAAO,OAAO,GAAG,QAAQ,CAAC,CAAC,KAAKC,cAA4B,OAAO,KAAK,CAAC;;;;;;;AAQjG,MAAa,SAA6CC,WAAyB;CACjF;CACA;AACF,CAAC;AA6BD,IAAM,mBAAN,MAAuB;CACrB;CACA,YAAY,SAAiB;EAC3B,KAAK,UAAU;CACjB;AACF;AAEA,MAAM,kBAAkB,IAAI,OAAO,IAAIC,WAAe,IAAIC,UAAc,MAAM,GAAG;;;;;;;;;;AAWjF,MAAa,YAAY,QAA0D;CAEjF,MAAM,IAAI,gBAAgB,KAAK,GAAG;CAClC,IAAI,MAAM,QAAQ,EAAE,UAAU,GAAG,OAAO,OAAO,KAAK;CACpD,OAAO,OAAO,KAAK,CAAC,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,EAAE,EAAE,CAAU;AAC3D;AAEA,MAAM,aAAaC;;AAanB,MAAM,kBAAkB,QAAgB,OACtCjB,SAAa,MAAM,KACnB,CAAC,OAAO,YAAY,CAAC,CAAC,WAAW,KAAK,KACtC,OAAO,OACPkB,YAAgB,EAAE,KACjB,OAAO,SAAU,WAAW,UAC7B,WAAW;;AAGb,MAAM,aACJ,OACA,MACA,SACuC;CACvC,MAAM,YAAY,KAAK,OAAO,CAAC;CAC/B,OAAO,eAAe,IAAI,OAAO,SAAS,IACtC,UAAU,OAAO,OAAO,GAAG,IAAI,IAC/B,CAAC,WAAW,OAAO,CAAC;AAC1B;AAEA,IAAM,SAAN,MAAa;CACX;CACA,cAAuB,eAAe,MAAsB;;CAE5D,SAA0B,eAAe,MAAsB;CAC/D,eAAe;CACf,WAAW;CAEX;CACA,YAAY,SAA2B,UAA+B;EACpE,KAAK,UAAU;EACf,MAAM,cAAc,eAAe,MAAsB;EACzD,MAAM,OAAO,eAAe,MAAc;EAC1C,SAAS,SAAS,SAAS,IAAI,WAAW;GACxC,IACE,eAAe,QAAQ,EAAE,KACzB,CAAC,eAAe,IAAI,aAAa,EAAE,KACnC,CAAC,eAAe,IAAI,MAAM,MAAM,GAChC;IACA,eAAe,IAAI,aAAa,IAAI,MAAM;IAC1C,eAAe,IAAI,MAAM,MAAM;GACjC;EACF,CAAC;EACD,IAAI,CAAC,eAAe,IAAI,aAAa,GAAG,GAAG;GACzC,eAAe,IAAI,aAAa,KAAK,KAAK;GAC1C,eAAe,IAAI,MAAM,KAAK;EAChC;EACA,eAAe,IAAI,MAAM,KAAK;EAC9B,KAAK,aAAa;GAAE;GAAa;GAAM,UAAU,eAAe,KAAK,GAAG;GAAG,SAAS;EAAE;CACxF;CAEA,KAAK,SAAwB;EAC3B,MAAM,IAAI,iBAAiB,OAAO;CACpC;CAEA,MAAM,KAAa,MAAsB;EACvC,MAAM,QAAQ,eAAe,IAAI,KAAK,QAAQ,GAAG;EACjD,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,MAAM;EACvC,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI;EACpC,eAAe,IAAI,KAAK,QAAQ,KAAK,IAAI;EACzC,OAAO;CACT;CAEA,SAAiB,KAAa,MAAsB;EAClD,IAAI,CAACA,YAAgB,GAAG,GAAG,KAAK,KAAK,OAAO,KAAK,IAAI,IAAI,kCAAkC;EAC3F,MAAM,EAAE,aAAa,MAAM,aAAa,KAAK;EAE7C,MAAM,aAAa,IAAI,OACrB,IAAI,aAAa,eAAe,KAAK,WAAW,CAAC,GACjD,OAAO,KAAgC,IACtC,MAAM,OACL,IAAI,WAAW,EAAE,MAChB,OAAO,OAAO,IAAI,KAAK,GAAG,SAAS,KAAK,MAAM,EAAE,CAAC,WAClDlB,SAAa,IAAI,MAAM,GAAG,MAAM,CAAC,IAC7B,OAAO,KAAK,CAAC,IAAI,IAAI,MAAM,GAAG,MAAM,CAAC,CAAU,IAC/C,IACR;EACA,MAAM,CAAC,IAAI,SAAS,OAAO,UACzB,OAAO,OAAO,kBAAkB,SAAS,GAAG,CAAC,SACvC,KAAK,KAAK,OAAO,KAAK,IAAI,IAAI,oCAAoC,CAC1E;EACA,eAAe,IAAI,UAAU,EAAE;EAU/B,OAAO,GATQ,OAAO,UAAU,eAAe,IAAI,aAAa,EAAE,SAAS;GACzE,MAAM,CAAC,WAAW,KAAK,UAAU,MAAM,KAAK,WAAW,UAAU,MAAM,KAAK,GAAG;GAC/E,KAAK,WAAW,UAAU;GAC1B,eAAe,IAAI,MAAM,SAAS;GAClC,eAAe,IAAI,aAAa,IAAI,SAAS;GAE7C,eAAe,MAAM,KAAK,MAAM;GAChC,OAAO;EACT,CACe,EAAE,GAAG;CACtB;CAEA,OAAO,KAAqB;EAC1B,IAAI,CAACkB,YAAgB,GAAG,GAAG,KAAK,KAAK,YAAY,IAAI,yCAAyC;EAC9F,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,SAAS,KAAA,GAAW;GACtB,MAAM,MAAMC,WAAe,KAAK,IAAI;GACpC,IAAI,OAAO,OAAO,GAAG,GAAG,OAAO,WAAW,IAAI,KAAK;EACrD;EACA,OAAO,WAAW,GAAG;CACvB;CAEA,WAAW,MAA8B;EACvC,MAAM,QAAQ,eAAe,IAAI,KAAK,aAAa,KAAK,KAAK;EAC7D,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,MAAM;EACvC,MAAM,QACJnB,SAAa,KAAK,KAAK,KAAK,CAAC,eAAe,IAAI,KAAK,YAAY,KAAK,KAAK,IACvE,KAAK,QACL,KAAK,WAAW;EACtB,eAAe,IAAI,KAAK,YAAY,KAAK;EACzC,eAAe,IAAI,KAAK,aAAa,KAAK,OAAO,KAAK;EACtD,OAAO;CACT;CAEA,aAA6B;EAE3B,MAAM,CAAC,OAAO,KAAK,UAAU,KAAK,YAAY,KAAK,eAAe,IAAI,MAAM,IAAI,GAAG;EACnF,KAAK,eAAe,IAAI;EACxB,OAAO;CACT;CAEA,aAAsB,eAAe,MAAc;CACnD,eAAe;AACjB;AAaA,MAAM,QAAQ,OAAe,WAA2B;CACtD,IAAI,CAACkB,YAAgB,KAAK,GAAG,OAAO,KAAK,sDAAsD;CAC/F,OAAOE,WAAe,KAAK;AAC7B;AAEA,MAAM,yBAAyB,OAC7B,IAAI,KACF,IACA,MAAM,QACJ,MAAM,SAASC,UAAa,MAAmB,EAAE,SAAS,GAC1D,MAAM,SAASA,UAAa,MAAmB,EAAE,MAAM,CACzD,CACF;;AAGF,MAAM,gBAAgB,MACpB,EAAE,UAAU,UAAU,YACtBC,YAAiB,EAAE,MAAM,KACzB,CAAC,uBAAuB,EAAE,OAAO,KAAK,KACtC,OAAO,OAAO,SAAS,EAAE,OAAO,KAAK,CAAC;AAExC,MAAM,kBAAkB,SAAqC,YAAsC;CACjG,MAAM,SAAS,IAAI,OAAO,SAAS,QAAQ,YAAYC,KAAe;CACtE,MAAM,aAAa,QAAQ,UAAU;CACrC,MAAM,OAAO,QAAQ,kBAAkB;CACvC,MAAM,QAAQ,QAAQ,cAAc;CAEpC,MAAM,QAAe;EAAE,WAAW,eAAe,MAAM;EAAG,YAAY,eAAe,MAAM;CAAE;CAC7F,MAAM,kBAAkB,UAA0B;EAChD,MAAM,QAAQ,eAAe,IAAI,MAAM,YAAY,KAAK;EACxD,OAAO,OAAO,OAAO,KAAK,IAAI,MAAM,QAAQ;CAC9C;CACA,MAAM,eAAe,eAAe,MAAc;CAClD,MAAM,kBAAkB,MAAuB;EAC7C,IAAIC,YAAiB,CAAC,GAAG,eAAe,IAAI,cAAc,EAAE,KAAK;OAC5D,IAAIC,SAAc,CAAC,GAAG;GACzB,eAAe,EAAE,OAAO;GACxB,eAAe,EAAE,MAAM;EACzB;CACF;CACA,QAAQ,SAAS,MAAM;EACrB,IAAIA,SAAc,EAAE,OAAO,GACzB,OAAO,KAAK,+DAA+D;EAE7E,MAAM,UAAU,EAAE;EAClB,MAAM,MAAM,QAAQ;EACpB,MAAM,QAAQ,eAAe,IAAI,MAAM,WAAW,GAAG;EACrD,IAAI,OAAO,OAAO,KAAK,GAAG,MAAM,MAAM,QAAQ,KAAK,CAAC;OAC/C,eAAe,IAAI,MAAM,WAAW,KAAK;GAAE;GAAS,SAAS,CAAC,CAAC;EAAE,CAAC;EACvE,MAAM,IAAI,EAAE;EACZ,IAAID,YAAiB,CAAC,GACpB,eAAe,IAAI,MAAM,YAAY,EAAE,OAAO,eAAe,EAAE,KAAK,IAAI,CAAC;OACpE,IAAIC,SAAc,CAAC,GACxB,eAAe,CAAC;CAEpB,CAAC;CAGD,MAAM,SAAS,eAAe,MAAc;CAC5C,IAAI,MAAM;EACR,eAAe,QAAQ,MAAM,aAAa,OAAO,UAAU;GACzD,IAAI,UAAU,KAAK,CAAC,eAAe,IAAI,cAAc,KAAK,GACxD,eAAe,IAAI,QAAQ,KAAK;EAEpC,CAAC;EAED,MAAM,YAAY,eAAe,MAAc;EAC/C,MAAM,SAAS,eAA6B;GAC1C,MAAM,QAAQ,eAAe,IAAI,MAAM,WAAW,UAAU;GAC5D,IAAI,OAAO,OAAO,KAAK,GAAG;GAC1B,MAAM,MAAM,QAAQ,SAAS,MAAM;IACjC,MAAM,IAAI,EAAE;IACZ,IACED,YAAiB,CAAC,KAClB,eAAe,IAAI,QAAQ,EAAE,KAAK,KAClC,CAAC,eAAe,IAAI,WAAW,EAAE,KAAK,GACtC;KACA,eAAe,IAAI,WAAW,EAAE,KAAK;KACrC,MAAM,EAAE,GAAG;IACb;GACF,CAAC;EACH;EACA,eAAe,QAAQ,MAAM,YAAY,OAAO,QAAQ;GACtD,MAAM,IAAI,MAAM;GAChB,IAAI,CAACA,YAAiB,CAAC,KAAK,CAAC,eAAe,IAAI,QAAQ,EAAE,KAAK,GAAG,MAAM,GAAG;EAC7E,CAAC;EACD,eAAe,QAAQ,MAAM,YAAY,UAAU;GACjD,MAAM,IAAI,MAAM;GAChB,IACEA,YAAiB,CAAC,KAClB,eAAe,IAAI,QAAQ,EAAE,KAAK,KAClC,CAAC,eAAe,IAAI,WAAW,EAAE,KAAK,GACtC;IACA,eAAe,OAAO,QAAQ,EAAE,KAAK;IACrC,MAAM,EAAE,GAAG;GACb;EACF,CAAC;CACH;CAEA,MAAM,OAAsB,CAAC;;CAG7B,MAAM,QAAQ,SAAuB,OAAe,QAAiB,UAAyB;EAC5F,MAAM,MAAM,WAAW,OAAO,KAAK;EACnC,MAAM,SAAS,OAAO,MAAM,eAAe,IAAI,MAAM,WAAW,QAAQ,GAAG,GAAG;GAC5E,cAA0C,CAAC;GAC3C,SAAS,UAAU,sBAAsB,MAAM,OAAO;EACxD,CAAC;EACD,MAAM,aAAa,QACf,IAAI,UAAU,SAAS,MACrB,aAAa,CAAC,KAAKN,YAAgB,EAAE,OAAO,KAAK,IAC7C,OAAO,KAAK,CAAC,GAAG,EAAE,OAAO,KAAK,CAAU,IACxC,OAAO,KAAK,CAClB,IACA,OAAO,KAAK;EAChB,MAAM,UAAU,OAAO,MAAM,YAAY;GACvC,cAAc;GACd,SAAS,GAAG,UAAU,OAAO,MAAM,MAAM,MAAM;EACjD,CAAC;EACD,MAAM,KAAK,OAAO,MAAM,YAAY;GAClC,cAAc;GACd,SAAS,CAAC,WAAW,OAAO,QAAQ,MAAM,MAAM,KAAK;EACvD,CAAC;EACD,MAAM,QAAQI,YAAiB,OAAO,IAClC,eAAe,OAAO,OAAO,QAAQ,KAAK,EAAE,KAC5CE,YAAiB,OAAO,KACtB,CAAC,WACA,eAAe,QAAQ,KAAK,IAAI,KAAK,eAAe,IAAI,cAAc,QAAQ,KAAK,KACpF,gBAAgB,OAAO,WAAW,OAAO,EAAE,KAC3C;EACN,IAAI,IAAI,qBAAqB,EAAE,GAAG;GAChC,MAAM,KAAK,GAAG,IAAI,GAAG,UAAU,MAAM,GAAG;GACxC;EACF;EACA,MAAM,KAAK,GAAG,IAAI,GAAG,UAAU,MAAM,EAAE;EACvC,GAAG,SAAS,MAAM,SAAS,GAAG,QAAQ,GAAG,KAAK,CAAC;EAC/C,MAAM,KAAK,GAAG,IAAI,IAAI,QAAQ,EAAE;CAClC;CACA,MAAM,YAAY,GAAgB,OAAe,UAAyB;EACxE,MAAM,MAAM,WAAW,OAAO,KAAK;EACnC,MAAM,IAAI,EAAE,UAAU;EACtB,IAAI,2BAA2B,CAAC,KAAK,MAAM,QACzC,OAAO,KAAK,kBAAkB,EAAE,gDAAgD;EAElF,MAAM,OAAO,OAAO,MAAM,GAAG,WAAW;EACxC,eAAe,EAAE,QAAQ,KAAK,MAAM,OAAO,KAAK;CAClD;CAGA,MAAM,iBAAiB,MAAM,IAC1B,GAAgB,MAAc,OAAe,QAAgB,WAA0B,CAC1F,CAAC,CAAC,KACA,MAAM,eAAqB,GAC3B,MAAM,IAAI,cAAc,GAAG,IAAI,KAAK,MAAM,QAAQ,UAAU;EAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,iBAAiB,OAAO,OAAO,EAAE,KAAK,EAAE,IAAI;CACxE,CAAC,GACD,MAAM,IAAI,cAAc,GAAG,IAAI,KAAK,MAAM,OAAO,UAAU;EACzD,IAAI,eAAe,IAAI,QAAQ,EAAE,KAAK,KAAK,CAAC,eAAe,IAAI,cAAc,EAAE,KAAK,GAAG;GACrF,MAAM,YAAY,OAAO,MAAM,eAAe,IAAI,MAAM,WAAW,EAAE,GAAG,GAAG;IACzE,cAA0C,CAAC;IAC3C,SAAS,UAAU,MAAM;GAC3B,CAAC;GACD,IAAI,IAAI,qBAAqB,SAAS,GAAG;IACvC,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,4BAA4B;IACtD;GACF;GACA,IAAI,EAAE,SAAS,UAAU,KAAK,YAAY,IAAI;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,2BAA2B;IACrD,sBAAsB,SAAS,CAAC,CAAC,SAAS,MAAM,SAAS,GAAG,QAAQ,GAAG,KAAK,CAAC;IAC7E,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE;IAC7B;GACF;GACA,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,EAAE;GAC5B,KAAK,GAAG,QAAQ,GAAG,MAAM,KAAK;GAC9B,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE;GAC7B;EACF;EACA,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,eAAe,OAAO,WAAW,CAAC,EAAE,IAAI;CACpE,CAAC,GACD,MAAM,IAAI,YAAY,GAAG,IAAI,KAAK,MAAM,QAAQ,UAAU;EACxD,IAAI,QAAQ;EACZ,IAAI,EAAE,aAAa,IAAI;GACrB,SAAS,cAAc,WAAW,EAAE,QAAQ,EAAE;GAC9C,IAAI,EAAE,cAAc,KAAA,GAAW;IAC7B,OAAO,eAAe;IACtB,OAAO,WAAW;IAClB,SAAS,aAAa,EAAE,UAAU;GACpC;EACF,OAAO,IAAI,EAAE,SAAS,UAAU,YAC9B,SAAS,kBAAkB,OAAO,OAAO,EAAE,SAAS,KAAK,EAAE;EAE7D,IAAI,EAAE,UAAU,IAAI,MAAM,KAAK,GAAG,IAAI,GAAG,OAAO,MAAM,GAAG;OACpD,MAAM,KAAK,GAAG,IAAI,GAAG,OAAO,MAAM,GAAG,KAAK,EAAE,OAAO,MAAM,EAAE,IAAI,KAAK,EAAE;CAC7E,CAAC,GACD,MAAM,IAAI,WAAW,GAAG,IAAI,KAAK,MAAM,OAAO,UAAU;EACtD,OAAO,eAAe;EACtB,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,yBAAyB;EACnD,WAAW,GAAG,QAAQ,GAAG,KAAK;EAC9B,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE;CAC/B,CAAC,GACD,MAAM,UACR;CAEA,MAAM,cAAc,GAAgB,OAAe,UAAyB;EAC1E,MAAM,MAAM,WAAW,OAAO,KAAK;EACnC,MAAM,IAAI,EAAE;EACZ,MAAM,QAAQF,YAAiB,CAAC,IAC5B,eAAe,OAAO,OAAO,EAAE,KAAK,EAAE,KACtCE,YAAiB,CAAC,IAChB,gBAAgB,OAAO,WAAW,CAAC,EAAE,KACrC,OAAO,KAAK,+DAA+D;EACjF,MAAM,KAAK,GAAG,IAAI,kBAAkB,MAAM,EAAE;EAC5C,MAAM,IAAI,EAAE;EACZ,IAAIA,YAAiB,CAAC,GAAG;GACvB,MAAM,OAAO,OAAO,MAAM,EAAE,UAAU,OAAO,WAAW;GACxD,IAAI,2BAA2B,EAAE,UAAU,KAAK,KAAK,EAAE,UAAU,UAAU,QACzE,OAAO,KACL,kBAAkB,EAAE,UAAU,MAAM,gDACtC;GAEF,MAAM,KAAK,GAAG,MAAM,WAAW,GAAG,KAAK,eAAe,OAAO,WAAW,CAAC,EAAE,IAAI;EACjF,OACE,SAAS,GAAG,QAAQ,GAAG,KAAK;EAE9B,MAAM,KAAK,GAAG,IAAI,mBAAmB;CACvC;CAUA,IARqB,KACnB,IAAI,IAAI,IAAI,aAAa,eAAe,OAAO,MAAM,SAAS,CAAC,IAAI,MAAM,EAAE,OAAO,GAGlF,MAAM,MAAiB,GAAG,MACxB,EAAE,SAAS,EAAE,OAAOE,QAAa,GAAG,CAAC,IAAIJ,YAAiB,CAAC,IAAI,KAAK,CACtE,CAEK,CAAC,CAAC,SAAS,MAAM;EACtB,IAAI,CAACE,YAAiB,CAAC,KAAK,CAAC,eAAe,IAAI,QAAQ,EAAE,KAAK,GAAG,KAAK,GAAG,GAAG,OAAO,IAAI;CAC1F,CAAC;CAUD,MAAM,QAAuB;EAC3B,GATgB,IAAI,KACpB,IAAI,OAAO,IAAI,aAAa,OAAO,WAAW,WAAW,IAAI,CAAC,QAC5D,eAAe,IAAI,OAAO,WAAW,UAAU,EAAE,CACnD,GACA,MAAM,MAAiC,GAAG,MACxC,EAAE,OAAO,QAAQ,KAAK,EAAE,OAAO,QAAQ,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,CAChE,CAGW,CAAC,CAAC,KAAK,CAAC,IAAI,YAAY,SAAS,OAAO,IAAI,WAAW,EAAE,EAAE,EAAE;EACxE,GAAI,OAAO,WAAW,CAAC,cAAc,IAAI,IAAI,qBAAmB,IAAI,CAAC;EACrE,GAAI,QAAQ,YAAY,KAAA,IAAY,CAAC,IAAI,CAAC,aAAa,WAAW,QAAQ,OAAO,EAAE,EAAE;EACrF,GAAI,OAAO,eAAe,CAAC,qBAAmB,IAAI,CAAC;CACrD;CACA,MAAM,MAAM,KAAK,IAAI,OAAO,CAAkB;CAC9C,MAAM,cACH,QAAQ,kBAAkB,OAAQ,CAAC,4CAAwC,IAAI,CAAC;CAKnF,OAAO,IAHK,IAAI,qBAAqB,IAAI,IACrC,CAAC,GAAG,aAAa,YAAY,MAAM,KAAK,GAAG,EAAE,GAAG,IAChD;EAAC,GAAG;EAAa,YAAY,MAAM,KAAK,GAAG,EAAE;EAAI,GAAG;EAAM;CAAY,EAAA,CAC5D,KAAK,IAAI,EAAE;AAC3B;;;;;;;;;AAUA,MAAa,aACX,OACA,YAEA,OAAO,cAAc;CACnB,MAAM,MAAM,IAAI,aAAa,KAAK;CAClC,MAAM,QAAQ,IAAI,UAAU,MAAM,MAAM,CAACG,eAAoB,EAAE,KAAK,CAAC;CACrE,IAAI,OAAO,OAAO,KAAK,GACrB,OAAO,OAAO,KACZ,IAAIC,kBAAgC;EAClC,QAAQ;EACR,SAAS,sDAAsD,MAAM,MAAM,MAAM,IAAI;CACvF,CAAC,CACH;CAEF,MAAM,UAAU,IAAI,KAAK,MAAM,EAAE,MAAM;CACvC,OAAO,OAAO,IAAI;EAChB,WAAW,eAAe,SAAS,WAAW,CAAC,CAAC;EAChD,QAAQ,MAAM;GACZ,IAAI,aAAa,kBACf,OAAO,IAAIA,kBAAgC;IAAE,QAAQ;IAAa,SAAS,EAAE;GAAQ,CAAC;GAExF,MAAM;EACR;CACF,CAAC;AACH,CAAC,CAAC,CAAC,KAAKC,kBAAgC,KAAK,CAAC;;;;;;;AAQhD,MAAa,aAAyDC,eAA6B;CACjG;CACA;AACF,CAAC;;;;;;;;AASD,MAAa,QAA6DC,UACxE,QACA,UACF"}

package/dist/RdfXml-_N7yxWEp.d.mts

@@ -0,0 +1,149 @@
+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 { r as Document } from "./Xml-CmfHS7SW.mjs";
+import * as Option from "effect/Option";
+import * as Effect from "effect/Effect";
+declare namespace RdfXml_d_exports {
+  export { ParseOptions, QuadsResult, SerializeOptions, codec, format, parse, parseDocument, parseQuads, parser, serialize, serializer, splitIri };
+}
+/**
+ * The RDF/XML format description (`application/rdf+xml`).
+ *
+ * @since 0.1.0
+ * @category formats
+ */
+declare const format: Format;
+/**
+ * Options for parsing RDF/XML.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ParseOptions extends ParseOptions$1 {
+  /**
+   * The RDF version assumed when the document does not announce one with
+   * `rdf:version`. RDF 1.2 features that require a version announcement
+   * (base direction and triple terms) are only enabled when a version other
+   * than `"1.0"`/`"1.1"` is in scope. Defaults to none.
+   */
+  readonly version?: string | undefined;
+}
+/**
+ * Parses an already-parsed XML document as RDF/XML. The root element is
+ * `rdf:RDF` or a single node element; `xml:base` on it is returned as the
+ * base IRI and namespace declarations on it (and its children) as prefixes.
+ * Formats that embed RDF/XML in a larger XML document (XMP, SVG metadata)
+ * pass a document whose root is the embedded `rdf:RDF` element.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parseDocument: (doc: Document, options?: ParseOptions) => Effect.Effect<ParseResult, RdfParseError>;
+/**
+ * The statements of an RDF/XML document in document order (duplicates
+ * kept), with the namespace declarations on the root element (and its
+ * children) as prefixes and the document's base IRI.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface QuadsResult extends Omit<ParseResult, 'dataset'> {
+  readonly quads: ReadonlyArray<Quad>;
+}
+/**
+ * Parses a complete RDF/XML document into its statements in document order,
+ * without building a dataset. Node elements are converted as they are read,
+ * so the XML tree is never held whole.
+ *
+ * @since 0.1.0
+ * @category parsing
+ * @example
+ * ```ts
+ * import * as Effect from 'effect/Effect';
+ * import { RdfXml } from '@thomasfosterau/effect-rdf/rdfxml';
+ *
+ * const { quads } = Effect.runSync(
+ *   RdfXml.parseQuads(
+ *     `<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+ *               xmlns:ex="http://example.org/">
+ *        <rdf:Description rdf:about="http://example.org/a" ex:p="1"/>
+ *      </rdf:RDF>`,
+ *   ),
+ * );
+ * // quads.length === 1
+ * ```
+ */
+declare const parseQuads: (input: string, options?: ParseOptions) => Effect.Effect<QuadsResult, RdfParseError>;
+/**
+ * Parses a complete RDF/XML document. Namespace declarations on the root
+ * element (and its children) are returned as prefixes.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parse: (input: string, options?: ParseOptions) => Effect.Effect<ParseResult, RdfParseError>;
+/**
+ * The RDF/XML parser.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parser: Parser<ParseOptions>;
+/**
+ * Options for serialising RDF/XML.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface SerializeOptions extends SerializeOptions$1 {
+  /** The indentation unit. Defaults to two spaces. */
+  readonly indent?: string | undefined;
+  /**
+   * Whether to nest blank nodes that are the object of exactly one triple
+   * inside the referencing property element. Defaults to `true`.
+   */
+  readonly nestBlankNodes?: boolean | undefined;
+  /**
+   * Whether to use typed node elements (`<ex:Person>`) for an `rdf:type`
+   * of each node. Defaults to `true`.
+   */
+  readonly typedNodes?: boolean | undefined;
+  /** Whether to write the `<?xml …?>` declaration. Defaults to `true`. */
+  readonly xmlDeclaration?: boolean | undefined;
+}
+/**
+ * Splits an IRI into a namespace and a local name that is an XML `NCName`,
+ * choosing the longest possible local name. Returns `None` when the IRI does
+ * not end with an `NCName` (such IRIs cannot be used as element or
+ * attribute names).
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const splitIri: (iri: string) => Option.Option<readonly [string, string]>;
+/**
+ * Serialises quads as an RDF/XML document. Fails with `RdfSerializeError`
+ * for quads in named graphs, triple terms in the subject position, and
+ * predicates that cannot be written as XML QNames.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serialize: (quads: Iterable<Quad>, options?: SerializeOptions) => Effect.Effect<string, RdfSerializeError>;
+/**
+ * The RDF/XML serializer.
+ *
+ * @since 0.1.0
+ * @category serializing
+ */
+declare const serializer: Serializer<SerializeOptions>;
+/**
+ * The RDF/XML codec, including a `Schema` transforming RDF/XML documents to
+ * datasets and back.
+ *
+ * @since 0.1.0
+ * @category codecs
+ */
+declare const codec: Codec<ParseOptions, SerializeOptions>;
+export { codec as a, parseDocument as c, serialize as d, serializer as f, SerializeOptions as i, parseQuads as l, QuadsResult as n, format as o, splitIri as p, RdfXml_d_exports as r, parse as s, ParseOptions as t, parser as u };
+//# sourceMappingURL=RdfXml-_N7yxWEp.d.mts.map

package/dist/Rdfs-BRVPsAjc.d.mts

@@ -0,0 +1,84 @@
+import { C as Resource, p as Object$1, w as Subject } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+declare namespace Rdfs_d_exports {
+  export { EntailmentOptions, closure, instancesOf, isInstanceOf, subClasses, subProperties, superClasses, superProperties, types };
+}
+/**
+ * All (transitive) superclasses of a class, excluding the class itself.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const superClasses: (self: Dataset, cls: Resource) => ReadonlyArray<Object$1>;
+/**
+ * All (transitive) subclasses of a class, excluding the class itself.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const subClasses: (self: Dataset, cls: Resource) => ReadonlyArray<Object$1>;
+/**
+ * All (transitive) superproperties of a property, excluding itself.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const superProperties: (self: Dataset, property: Resource) => ReadonlyArray<Object$1>;
+/**
+ * All (transitive) subproperties of a property, excluding itself.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const subProperties: (self: Dataset, property: Resource) => ReadonlyArray<Object$1>;
+/**
+ * The asserted types (`rdf:type` values) of a resource.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const types: (self: Dataset, resource: Subject) => ReadonlyArray<Object$1>;
+/**
+ * Whether `resource` is an instance of `cls`, taking `rdfs:subClassOf` into
+ * account.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const isInstanceOf: (self: Dataset, resource: Subject, cls: Resource) => boolean;
+/**
+ * All instances of a class, including instances of its subclasses.
+ *
+ * @since 0.1.0
+ * @category hierarchy
+ */
+declare const instancesOf: (self: Dataset, cls: Resource) => ReadonlyArray<Subject>;
+/**
+ * Options for RDFS entailment.
+ *
+ * @since 0.1.0
+ * @category entailment
+ */
+interface EntailmentOptions {
+  /**
+   * Include the axiomatic and "every resource is an rdfs:Resource" style
+   * triples (rules rdfs4a/4b, rdfs8, rdfs10, rdfs12, rdfs13, rdf1). These
+   * produce many uninteresting triples; disabled by default.
+   */
+  readonly full?: boolean;
+}
+/**
+ * Computes the RDFS closure of the default graph (or every graph
+ * independently) by forward chaining the RDFS entailment rules to a fixpoint.
+ *
+ * Implemented rules: rdfs2 (domain), rdfs3 (range), rdfs5 (subPropertyOf
+ * transitivity), rdfs7 (subproperty inheritance), rdfs9 (type inheritance),
+ * rdfs11 (subClassOf transitivity), and — when `full` is set — rdf1, rdfs4a,
+ * rdfs4b, rdfs6, rdfs8, rdfs10, rdfs12 and rdfs13.
+ *
+ * @since 0.1.0
+ * @category entailment
+ */
+declare const closure: (self: Dataset, options?: EntailmentOptions) => Dataset;
+export { isInstanceOf as a, superClasses as c, instancesOf as i, superProperties as l, Rdfs_d_exports as n, subClasses as o, closure as r, subProperties as s, EntailmentOptions as t, types as u };
+//# sourceMappingURL=Rdfs-BRVPsAjc.d.mts.map

package/dist/Rdfs-CyY2wVHI.mjs

@@ -0,0 +1,167 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { B as isNamedNode, d as Quad, z as isLiteral } from "./Term-CFLG1qu4.mjs";
+import { t as loop } from "./loop-DZ2hXlr_.mjs";
+import { A as objectsOf, D as mutate, L as subjectsOf, U as union, _ as graphs, g as graph } from "./Dataset-BlmlcI7J.mjs";
+import { a as rdfs, i as rdf } from "./Vocab-DceKywpq.mjs";
+import * as Arr from "effect/Array";
+import * as MutableHashMap from "effect/MutableHashMap";
+import * as Option from "effect/Option";
+// src/Rdfs.ts
+/**
+* RDF Schema: class and property hierarchies, and RDFS entailment.
+*
+* @since 0.1.0
+*/
+var Rdfs_exports = /* @__PURE__ */ __exportAll({
+	closure: () => closure,
+	instancesOf: () => instancesOf,
+	isInstanceOf: () => isInstanceOf,
+	subClasses: () => subClasses,
+	subProperties: () => subProperties,
+	superClasses: () => superClasses,
+	superProperties: () => superProperties,
+	types: () => types
+});
+const transitiveClosure = (self, start, property, direction) => {
+	const seen = MutableHashMap.empty();
+	const stack = [start];
+	loop(() => {
+		const node = stack.pop();
+		if (node === void 0) return false;
+		(direction === "up" ? isLiteral(node) ? [] : objectsOf(self, node, property) : subjectsOf(self, property, node)).forEach((n) => {
+			if (!MutableHashMap.has(seen, n.key) && n.key !== start.key) {
+				MutableHashMap.set(seen, n.key, n);
+				stack.push(n);
+			}
+		});
+		return true;
+	});
+	return Arr.fromIterable(MutableHashMap.values(seen));
+};
+/**
+* All (transitive) superclasses of a class, excluding the class itself.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const superClasses = (self, cls) => transitiveClosure(self, cls, rdfs.subClassOf, "up");
+/**
+* All (transitive) subclasses of a class, excluding the class itself.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const subClasses = (self, cls) => transitiveClosure(self, cls, rdfs.subClassOf, "down");
+/**
+* All (transitive) superproperties of a property, excluding itself.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const superProperties = (self, property) => transitiveClosure(self, property, rdfs.subPropertyOf, "up");
+/**
+* All (transitive) subproperties of a property, excluding itself.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const subProperties = (self, property) => transitiveClosure(self, property, rdfs.subPropertyOf, "down");
+/**
+* The asserted types (`rdf:type` values) of a resource.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const types = (self, resource) => objectsOf(self, resource, rdf.type);
+/**
+* Whether `resource` is an instance of `cls`, taking `rdfs:subClassOf` into
+* account.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const isInstanceOf = (self, resource, cls) => {
+	const asserted = types(self, resource);
+	if (asserted.some((t) => t.key === cls.key)) return true;
+	return asserted.some((t) => !isLiteral(t) && transitiveClosure(self, t, rdfs.subClassOf, "up").some((s) => s.key === cls.key));
+};
+/**
+* All instances of a class, including instances of its subclasses.
+*
+* @since 0.1.0
+* @category hierarchy
+*/
+const instancesOf = (self, cls) => {
+	const classes = [cls, ...subClasses(self, cls)];
+	const out = MutableHashMap.empty();
+	classes.forEach((c) => subjectsOf(self, rdf.type, c).forEach((s) => {
+		MutableHashMap.set(out, s.key, s);
+	}));
+	return Arr.fromIterable(MutableHashMap.values(out));
+};
+/**
+* Computes the RDFS closure of the default graph (or every graph
+* independently) by forward chaining the RDFS entailment rules to a fixpoint.
+*
+* Implemented rules: rdfs2 (domain), rdfs3 (range), rdfs5 (subPropertyOf
+* transitivity), rdfs7 (subproperty inheritance), rdfs9 (type inheritance),
+* rdfs11 (subClassOf transitivity), and — when `full` is set — rdf1, rdfs4a,
+* rdfs4b, rdfs6, rdfs8, rdfs10, rdfs12 and rdfs13.
+*
+* @since 0.1.0
+* @category entailment
+*/
+const closure = (self, options = {}) => {
+	return Arr.reduce(graphs(self), self, (result, graph$1) => union(result, closeGraph(graph(self, graph$1), graph$1, options.full === true)));
+};
+const asSubject = (o) => isLiteral(o) ? Option.none() : Option.some(o);
+const closeGraph = (input, graph, full) => {
+	let ds = input;
+	const q = (s, p, o) => new Quad(s, p, o, graph);
+	loop(() => {
+		const before = ds.size;
+		ds = mutate(ds, (b) => {
+			const add = (s, p, o) => {
+				b.add(q(s, p, o));
+			};
+			const addFrom = (s, p, o) => {
+				if (Option.isSome(s)) add(s.value, p, o);
+			};
+			Array.from(ds).forEach((t) => {
+				const { subject: s, predicate: p, object: o } = t;
+				const os = asSubject(o);
+				if (full) {
+					add(p, rdf.type, rdf.Property);
+					add(s, rdf.type, rdfs.Resource);
+					addFrom(os, rdf.type, rdfs.Resource);
+				}
+				objectsOf(ds, p, rdfs.domain, graph).forEach((d) => add(s, rdf.type, d));
+				objectsOf(ds, p, rdfs.range, graph).forEach((r) => addFrom(os, rdf.type, r));
+				objectsOf(ds, p, rdfs.subPropertyOf, graph).forEach((sp) => {
+					if (isNamedNode(sp)) add(s, sp, o);
+				});
+				if (p.value === rdfs.subPropertyOf.value) {
+					if (Option.isSome(os)) objectsOf(ds, os.value, rdfs.subPropertyOf, graph).forEach((x) => add(s, rdfs.subPropertyOf, x));
+				} else if (p.value === rdfs.subClassOf.value) {
+					if (Option.isSome(os)) objectsOf(ds, os.value, rdfs.subClassOf, graph).forEach((x) => add(s, rdfs.subClassOf, x));
+				} else if (p.value === rdf.type.value) {
+					if (Option.isSome(os)) objectsOf(ds, os.value, rdfs.subClassOf, graph).forEach((x) => add(s, rdf.type, x));
+					if (full) {
+						if (o.key === rdf.Property.key) add(s, rdfs.subPropertyOf, s);
+						if (o.key === rdfs.Class.key) {
+							add(s, rdfs.subClassOf, rdfs.Resource);
+							add(s, rdfs.subClassOf, s);
+						}
+						if (o.key === rdfs.ContainerMembershipProperty.key) add(s, rdfs.subPropertyOf, rdfs.member);
+						if (o.key === rdfs.Datatype.key) add(s, rdfs.subClassOf, rdfs.Literal);
+					}
+				}
+			});
+		});
+		return ds.size !== before;
+	});
+	return ds;
+};
+export { subClasses as a, superProperties as c, isInstanceOf as i, types as l, closure as n, subProperties as o, instancesOf as r, superClasses as s, Rdfs_exports as t };
+
+//# sourceMappingURL=Rdfs-CyY2wVHI.mjs.map

package/dist/Rdfs-CyY2wVHI.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Rdfs-CyY2wVHI.mjs","names":["Term.isLiteral","Dataset.objectsOf","Dataset.subjectsOf","Dataset.graphs","Dataset.union","Dataset.graph","graph","Term.Quad","Dataset.mutate","Term.isNamedNode"],"sources":["../src/Rdfs.ts"],"sourcesContent":["/**\n * RDF Schema: class and property hierarchies, and RDFS entailment.\n *\n * @since 0.1.0\n */\nimport * as Dataset from './Dataset.ts';\nimport * as Term from './Term.ts';\nimport { rdf, rdfs } from './Vocab.ts';\nimport * as Arr from 'effect/Array';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as Option from 'effect/Option';\nimport { loop } from './internal/loop.ts';\n\nconst transitiveClosure = (\n  self: Dataset.Dataset,\n  start: Term.Object,\n  property: Term.NamedNode,\n  direction: 'up' | 'down',\n): ReadonlyArray<Term.Object> => {\n  const seen = MutableHashMap.empty<string, Term.Object>();\n  const stack: Array<Term.Object> = [start];\n  // Depth-first, with an explicit stack: hierarchies can be deep\n  loop(() => {\n    const node = stack.pop();\n    if (node === undefined) return false;\n    const next: ReadonlyArray<Term.Object> =\n      direction === 'up'\n        ? Term.isLiteral(node)\n          ? []\n          : Dataset.objectsOf(self, node, property)\n        : Dataset.subjectsOf(self, property, node);\n    next.forEach((n) => {\n      if (!MutableHashMap.has(seen, n.key) && n.key !== start.key) {\n        MutableHashMap.set(seen, n.key, n);\n        stack.push(n);\n      }\n    });\n    return true;\n  });\n  return Arr.fromIterable(MutableHashMap.values(seen));\n};\n\n/**\n * All (transitive) superclasses of a class, excluding the class itself.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const superClasses = (\n  self: Dataset.Dataset,\n  cls: Term.Resource,\n): ReadonlyArray<Term.Object> => transitiveClosure(self, cls, rdfs.subClassOf, 'up');\n\n/**\n * All (transitive) subclasses of a class, excluding the class itself.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const subClasses = (self: Dataset.Dataset, cls: Term.Resource): ReadonlyArray<Term.Object> =>\n  transitiveClosure(self, cls, rdfs.subClassOf, 'down');\n\n/**\n * All (transitive) superproperties of a property, excluding itself.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const superProperties = (\n  self: Dataset.Dataset,\n  property: Term.Resource,\n): ReadonlyArray<Term.Object> => transitiveClosure(self, property, rdfs.subPropertyOf, 'up');\n\n/**\n * All (transitive) subproperties of a property, excluding itself.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const subProperties = (\n  self: Dataset.Dataset,\n  property: Term.Resource,\n): ReadonlyArray<Term.Object> => transitiveClosure(self, property, rdfs.subPropertyOf, 'down');\n\n/**\n * The asserted types (`rdf:type` values) of a resource.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const types = (self: Dataset.Dataset, resource: Term.Subject): ReadonlyArray<Term.Object> =>\n  Dataset.objectsOf(self, resource, rdf.type);\n\n/**\n * Whether `resource` is an instance of `cls`, taking `rdfs:subClassOf` into\n * account.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const isInstanceOf = (\n  self: Dataset.Dataset,\n  resource: Term.Subject,\n  cls: Term.Resource,\n): boolean => {\n  const asserted = types(self, resource);\n  if (asserted.some((t) => t.key === cls.key)) return true;\n  return asserted.some(\n    (t) =>\n      !Term.isLiteral(t) &&\n      transitiveClosure(self, t, rdfs.subClassOf, 'up').some((s) => s.key === cls.key),\n  );\n};\n\n/**\n * All instances of a class, including instances of its subclasses.\n *\n * @since 0.1.0\n * @category hierarchy\n */\nexport const instancesOf = (\n  self: Dataset.Dataset,\n  cls: Term.Resource,\n): ReadonlyArray<Term.Subject> => {\n  const classes = [cls, ...subClasses(self, cls)];\n  const out = MutableHashMap.empty<string, Term.Subject>();\n  classes.forEach((c) =>\n    Dataset.subjectsOf(self, rdf.type, c).forEach((s) => {\n      MutableHashMap.set(out, s.key, s);\n    }),\n  );\n  return Arr.fromIterable(MutableHashMap.values(out));\n};\n\n/**\n * Options for RDFS entailment.\n *\n * @since 0.1.0\n * @category entailment\n */\nexport interface EntailmentOptions {\n  /**\n   * Include the axiomatic and \"every resource is an rdfs:Resource\" style\n   * triples (rules rdfs4a/4b, rdfs8, rdfs10, rdfs12, rdfs13, rdf1). These\n   * produce many uninteresting triples; disabled by default.\n   */\n  readonly full?: boolean;\n}\n\n/**\n * Computes the RDFS closure of the default graph (or every graph\n * independently) by forward chaining the RDFS entailment rules to a fixpoint.\n *\n * Implemented rules: rdfs2 (domain), rdfs3 (range), rdfs5 (subPropertyOf\n * transitivity), rdfs7 (subproperty inheritance), rdfs9 (type inheritance),\n * rdfs11 (subClassOf transitivity), and — when `full` is set — rdf1, rdfs4a,\n * rdfs4b, rdfs6, rdfs8, rdfs10, rdfs12 and rdfs13.\n *\n * @since 0.1.0\n * @category entailment\n */\nexport const closure = (\n  self: Dataset.Dataset,\n  options: EntailmentOptions = {},\n): Dataset.Dataset => {\n  return Arr.reduce(Dataset.graphs(self), self, (result, graph) =>\n    Dataset.union(result, closeGraph(Dataset.graph(self, graph), graph, options.full === true)),\n  );\n};\n\nconst asSubject = (o: Term.Object): Option.Option<Term.Subject> =>\n  Term.isLiteral(o) ? Option.none() : Option.some(o);\n\nconst closeGraph = (input: Dataset.Dataset, graph: Term.Graph, full: boolean): Dataset.Dataset => {\n  let ds = input;\n  const q = (s: Term.Subject, p: Term.Predicate, o: Term.Object) => new Term.Quad(s, p, o, graph);\n  // Apply the rules until a round adds nothing\n  loop(() => {\n    const before = ds.size;\n    ds = Dataset.mutate(ds, (b) => {\n      const add = (s: Term.Subject, p: Term.Predicate, o: Term.Object) => {\n        b.add(q(s, p, o));\n      };\n      const addFrom = (s: Option.Option<Term.Subject>, p: Term.Predicate, o: Term.Object) => {\n        if (Option.isSome(s)) add(s.value, p, o);\n      };\n      const all = Array.from(ds);\n      all.forEach((t) => {\n        const { subject: s, predicate: p, object: o } = t;\n        const os = asSubject(o);\n        if (full) {\n          add(p, rdf.type, rdf.Property);\n          add(s, rdf.type, rdfs.Resource);\n          addFrom(os, rdf.type, rdfs.Resource);\n        }\n        // rdfs2 / rdfs3\n        Dataset.objectsOf(ds, p, rdfs.domain, graph).forEach((d) => add(s, rdf.type, d));\n        Dataset.objectsOf(ds, p, rdfs.range, graph).forEach((r) => addFrom(os, rdf.type, r));\n        // rdfs7\n        Dataset.objectsOf(ds, p, rdfs.subPropertyOf, graph).forEach((sp) => {\n          if (Term.isNamedNode(sp)) add(s, sp, o);\n        });\n        if (p.value === rdfs.subPropertyOf.value) {\n          // rdfs5\n          if (Option.isSome(os))\n            Dataset.objectsOf(ds, os.value, rdfs.subPropertyOf, graph).forEach((x) =>\n              add(s, rdfs.subPropertyOf, x),\n            );\n        } else if (p.value === rdfs.subClassOf.value) {\n          // rdfs11\n          if (Option.isSome(os))\n            Dataset.objectsOf(ds, os.value, rdfs.subClassOf, graph).forEach((x) =>\n              add(s, rdfs.subClassOf, x),\n            );\n        } else if (p.value === rdf.type.value) {\n          // rdfs9\n          if (Option.isSome(os))\n            Dataset.objectsOf(ds, os.value, rdfs.subClassOf, graph).forEach((x) =>\n              add(s, rdf.type, x),\n            );\n          if (full) {\n            if (o.key === rdf.Property.key) {\n              // SAFETY: a subject is also a valid object.\n              add(s, rdfs.subPropertyOf, s); // rdfs6\n            }\n            if (o.key === rdfs.Class.key) {\n              add(s, rdfs.subClassOf, rdfs.Resource); // rdfs8\n              // SAFETY: a subject is also a valid object.\n              add(s, rdfs.subClassOf, s); // rdfs10\n            }\n            if (o.key === rdfs.ContainerMembershipProperty.key)\n              add(s, rdfs.subPropertyOf, rdfs.member); // rdfs12\n            if (o.key === rdfs.Datatype.key) add(s, rdfs.subClassOf, rdfs.Literal); // rdfs13\n          }\n        }\n      });\n    });\n    return ds.size !== before;\n  });\n  return ds;\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAaA,MAAM,qBACJ,MACA,OACA,UACA,cAC+B;CAC/B,MAAM,OAAO,eAAe,MAA2B;CACvD,MAAM,QAA4B,CAAC,KAAK;CAExC,WAAW;EACT,MAAM,OAAO,MAAM,IAAI;EACvB,IAAI,SAAS,KAAA,GAAW,OAAO;EAO/B,CALE,cAAc,OACVA,UAAe,IAAI,IACjB,CAAC,IACDC,UAAkB,MAAM,MAAM,QAAQ,IACxCC,WAAmB,MAAM,UAAU,IAAI,EAAA,CACxC,SAAS,MAAM;GAClB,IAAI,CAAC,eAAe,IAAI,MAAM,EAAE,GAAG,KAAK,EAAE,QAAQ,MAAM,KAAK;IAC3D,eAAe,IAAI,MAAM,EAAE,KAAK,CAAC;IACjC,MAAM,KAAK,CAAC;GACd;EACF,CAAC;EACD,OAAO;CACT,CAAC;CACD,OAAO,IAAI,aAAa,eAAe,OAAO,IAAI,CAAC;AACrD;;;;;;;AAQA,MAAa,gBACX,MACA,QAC+B,kBAAkB,MAAM,KAAK,KAAK,YAAY,IAAI;;;;;;;AAQnF,MAAa,cAAc,MAAuB,QAChD,kBAAkB,MAAM,KAAK,KAAK,YAAY,MAAM;;;;;;;AAQtD,MAAa,mBACX,MACA,aAC+B,kBAAkB,MAAM,UAAU,KAAK,eAAe,IAAI;;;;;;;AAQ3F,MAAa,iBACX,MACA,aAC+B,kBAAkB,MAAM,UAAU,KAAK,eAAe,MAAM;;;;;;;AAQ7F,MAAa,SAAS,MAAuB,aAC3CD,UAAkB,MAAM,UAAU,IAAI,IAAI;;;;;;;;AAS5C,MAAa,gBACX,MACA,UACA,QACY;CACZ,MAAM,WAAW,MAAM,MAAM,QAAQ;CACrC,IAAI,SAAS,MAAM,MAAM,EAAE,QAAQ,IAAI,GAAG,GAAG,OAAO;CACpD,OAAO,SAAS,MACb,MACC,CAACD,UAAe,CAAC,KACjB,kBAAkB,MAAM,GAAG,KAAK,YAAY,IAAI,CAAC,CAAC,MAAM,MAAM,EAAE,QAAQ,IAAI,GAAG,CACnF;AACF;;;;;;;AAQA,MAAa,eACX,MACA,QACgC;CAChC,MAAM,UAAU,CAAC,KAAK,GAAG,WAAW,MAAM,GAAG,CAAC;CAC9C,MAAM,MAAM,eAAe,MAA4B;CACvD,QAAQ,SAAS,MACfE,WAAmB,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,SAAS,MAAM;EACnD,eAAe,IAAI,KAAK,EAAE,KAAK,CAAC;CAClC,CAAC,CACH;CACA,OAAO,IAAI,aAAa,eAAe,OAAO,GAAG,CAAC;AACpD;;;;;;;;;;;;;AA6BA,MAAa,WACX,MACA,UAA6B,CAAC,MACV;CACpB,OAAO,IAAI,OAAOC,OAAe,IAAI,GAAG,OAAO,QAAQ,YACrDC,MAAc,QAAQ,WAAWC,MAAc,MAAMC,OAAK,GAAGA,SAAO,QAAQ,SAAS,IAAI,CAAC,CAC5F;AACF;AAEA,MAAM,aAAa,MACjBN,UAAe,CAAC,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC;AAEnD,MAAM,cAAc,OAAwB,OAAmB,SAAmC;CAChG,IAAI,KAAK;CACT,MAAM,KAAK,GAAiB,GAAmB,MAAmB,IAAIO,KAAU,GAAG,GAAG,GAAG,KAAK;CAE9F,WAAW;EACT,MAAM,SAAS,GAAG;EAClB,KAAKC,OAAe,KAAK,MAAM;GAC7B,MAAM,OAAO,GAAiB,GAAmB,MAAmB;IAClE,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC;GAClB;GACA,MAAM,WAAW,GAAgC,GAAmB,MAAmB;IACrF,IAAI,OAAO,OAAO,CAAC,GAAG,IAAI,EAAE,OAAO,GAAG,CAAC;GACzC;GAEA,MADkB,KAAK,EACrB,CAAC,CAAC,SAAS,MAAM;IACjB,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,QAAQ,MAAM;IAChD,MAAM,KAAK,UAAU,CAAC;IACtB,IAAI,MAAM;KACR,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ;KAC7B,IAAI,GAAG,IAAI,MAAM,KAAK,QAAQ;KAC9B,QAAQ,IAAI,IAAI,MAAM,KAAK,QAAQ;IACrC;IAEA,UAAkB,IAAI,GAAG,KAAK,QAAQ,KAAK,CAAC,CAAC,SAAS,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;IAC/E,UAAkB,IAAI,GAAG,KAAK,OAAO,KAAK,CAAC,CAAC,SAAS,MAAM,QAAQ,IAAI,IAAI,MAAM,CAAC,CAAC;IAEnF,UAAkB,IAAI,GAAG,KAAK,eAAe,KAAK,CAAC,CAAC,SAAS,OAAO;KAClE,IAAIC,YAAiB,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;IACxC,CAAC;IACD,IAAI,EAAE,UAAU,KAAK,cAAc,OAE7B;SAAA,OAAO,OAAO,EAAE,GAClB,UAAkB,IAAI,GAAG,OAAO,KAAK,eAAe,KAAK,CAAC,CAAC,SAAS,MAClE,IAAI,GAAG,KAAK,eAAe,CAAC,CAC9B;IAAA,OACG,IAAI,EAAE,UAAU,KAAK,WAAW,OAEjC;SAAA,OAAO,OAAO,EAAE,GAClB,UAAkB,IAAI,GAAG,OAAO,KAAK,YAAY,KAAK,CAAC,CAAC,SAAS,MAC/D,IAAI,GAAG,KAAK,YAAY,CAAC,CAC3B;IAAA,OACG,IAAI,EAAE,UAAU,IAAI,KAAK,OAAO;KAErC,IAAI,OAAO,OAAO,EAAE,GAClB,UAAkB,IAAI,GAAG,OAAO,KAAK,YAAY,KAAK,CAAC,CAAC,SAAS,MAC/D,IAAI,GAAG,IAAI,MAAM,CAAC,CACpB;KACF,IAAI,MAAM;MACR,IAAI,EAAE,QAAQ,IAAI,SAAS,KAEzB,IAAI,GAAG,KAAK,eAAe,CAAC;MAE9B,IAAI,EAAE,QAAQ,KAAK,MAAM,KAAK;OAC5B,IAAI,GAAG,KAAK,YAAY,KAAK,QAAQ;OAErC,IAAI,GAAG,KAAK,YAAY,CAAC;MAC3B;MACA,IAAI,EAAE,QAAQ,KAAK,4BAA4B,KAC7C,IAAI,GAAG,KAAK,eAAe,KAAK,MAAM;MACxC,IAAI,EAAE,QAAQ,KAAK,SAAS,KAAK,IAAI,GAAG,KAAK,YAAY,KAAK,OAAO;KACvE;IACF;GACF,CAAC;EACH,CAAC;EACD,OAAO,GAAG,SAAS;CACrB,CAAC;CACD,OAAO;AACT"}

package/dist/Rdfs.d.mts

@@ -0,0 +1,2 @@
+import { a as isInstanceOf, c as superClasses, i as instancesOf, l as superProperties, o as subClasses, r as closure, s as subProperties, t as EntailmentOptions, u as types } from "./Rdfs-BRVPsAjc.mjs";
+export { EntailmentOptions, closure, instancesOf, isInstanceOf, subClasses, subProperties, superClasses, superProperties, types };

package/dist/Rdfs.mjs

@@ -0,0 +1 @@
+export { n as closure, r as instancesOf, i as isInstanceOf, a as subClasses, o as subProperties, s as superClasses, c as superProperties, l as types } from "./Rdfs-CyY2wVHI.mjs";