@bjornpagen/bumbledb 0.4.0 → 0.6.0

package/src/relation.ts

@@ -2,12 +2,14 @@
  * `relation()` — the ordinary-relation half of the theory's signature. A
  * relation value is a frozen plain object carrying its name, its ordered
  * field descriptors (declaration order = ordinal ids, the macro's law),
- * typed field references (`R.fields.holder`), and — since selections are
- * the relation's own vocabulary — `where()`, which resolves a selection
- * into lowered bindings eagerly (handles verified against their roster at
- * construction). `Fact<>`/`InsertFact<>` are the inferred row object
- * types at BARE structural value types (no brands): fresh fields are
- * optional on insert input (omit-to-mint) and present on read
+ * and — since selections are the relation's own vocabulary — `where()`,
+ * which resolves a selection into lowered bindings eagerly (handles
+ * verified against their roster at construction). Fields are addressed by
+ * NAME everywhere — statements (`on(R, "holder")`), selections, and match
+ * records all spell the field's own name, checked by type
+ * (`FaceFields`/`MatchShape`). `Fact<>`/`InsertFact<>` are the inferred
+ * row object types at BARE structural value types (no brands): fresh
+ * fields are optional on insert input (omit-to-mint) and present on read
  * (resupply-to-preserve-identity), typed exactly.
  */
 
@@ -18,23 +20,6 @@ import { type LiteralSetSpec, type LiteralSpec, renderLiteral } from "#spec.ts"
 /** Flattens an intersection into one displayed object type (hover legibility). */
 type Flatten<T> = { [K in keyof T]: T[K] }
 
-/**
- * The one trusted seam of `relation()`: the reference record is built by
- * iterating the declared fields, and this guard verifies the checkable
- * facts — one reference per declared field, each carrying its own name —
- * before the record is admitted as the typed {@link FieldRefs} (the
- * macro-emission analog).
- */
-function refsComplete<RName extends string, Fields extends FieldsShape>(
-	refs: Record<string, unknown>,
-	fields: Fields
-): refs is FieldRefs<RName, Fields> {
-	return Object.keys(fields).every(function hasRef(fieldName) {
-		const ref = refs[fieldName]
-		return typeof ref === "object" && ref !== null && "field" in ref && ref.field === fieldName
-	})
-}
-
 /**
  * Resolves one selection entry to its lowered literal set: a plain ARRAY
  * (detected by `Array.isArray` — no field's value type is an array;
@@ -117,22 +102,6 @@ function resolveSelection(
 /** The field block of a relation: field name to field descriptor. */
 type FieldsShape = Record<string, AnyField>
 
-/**
- * A typed field reference (`Account.fields.holder`) — the value statements,
- * selections, and queries address a field through. Purely positional
- * (relation name + field name); the field's descriptor is read off the
- * relation's schema type structurally.
- */
-interface FieldRef<Rel extends string, Name extends string> {
-	readonly relation: Rel
-	readonly field: Name
-}
-
-/** The typed field-reference record of a relation. */
-type FieldRefs<RName extends string, Fields extends FieldsShape> = {
-	readonly [K in keyof Fields & string]: FieldRef<RName, K>
-}
-
 /** One declared field: name plus its descriptor, in declaration order. */
 interface RelationField {
 	readonly name: string
@@ -178,7 +147,6 @@ interface Selected<Name extends string, Fields extends FieldsShape> {
 interface Relation<Name extends string, Fields extends FieldsShape> {
 	readonly name: Name
 	readonly data: RelationData
-	readonly fields: FieldRefs<Name, Fields>
 	where(selection: SelectionInput<Fields>): Selected<Name, Fields>
 }
 
@@ -236,14 +204,6 @@ function relation<const Name extends string, Fields extends FieldsShape>(
 		ordered.push(Object.freeze({ name: fieldName, field }))
 	}
 	const data: RelationData = Object.freeze({ name, fields: Object.freeze(ordered) })
-	const refs: Record<string, unknown> = {}
-	for (const declared of ordered) {
-		refs[declared.name] = Object.freeze({ relation: name, field: declared.name })
-	}
-	Object.freeze(refs)
-	if (!refsComplete<Name, Fields>(refs, fields)) {
-		throw errors.new(`relation ${name}: field-reference construction incomplete`)
-	}
 	const holder: { value: Relation<Name, Fields> | undefined } = { value: undefined }
 	function where(selection: SelectionInput<Fields>): Selected<Name, Fields> {
 		const owner = holder.value
@@ -255,7 +215,7 @@ function relation<const Name extends string, Fields extends FieldsShape>(
 			selection: resolveSelection(name, ordered, Object.entries(selection))
 		})
 	}
-	const value: Relation<Name, Fields> = Object.freeze({ name, data, fields: refs, where })
+	const value: Relation<Name, Fields> = Object.freeze({ name, data, where })
 	holder.value = value
 	return value
 }
@@ -264,8 +224,6 @@ export type {
 	AnyRelation,
 	AnySelected,
 	Fact,
-	FieldRef,
-	FieldRefs,
 	FieldsShape,
 	FreshKeys,
 	InsertFact,

package/src/schema.ts

@@ -11,8 +11,9 @@
 
 import * as errors from "@superbuilders/errors"
 import type { AnyClosed } from "#closed.ts"
+import { isClosedMember, sealedFieldOf } from "#closed.ts"
 import type { FaceData } from "#face.ts"
-import { type AnyField, assertDeclarationOrderKey, type ClosedRoster } from "#fields.ts"
+import { assertDeclarationOrderKey, rosterOf } from "#fields.ts"
 import { type ClassesOf, classesComplete, computeClasses, type LawfulStatements, type SchemaClasses } from "#law.ts"
 import type { AnyRelation } from "#relation.ts"
 import type { LiteralSetSpec, LiteralSpec } from "#spec.ts"
@@ -34,7 +35,7 @@ function collectImplied(name: string, relations: SchemaRelations): Set<string> {
 				`schema ${name}: record key ${recordKey} holds relation ${member.name} — the key must equal the relation's declared name`
 			)
 		}
-		if ("handles" in member.data) {
+		if (isClosedMember(member)) {
 			implied.add(`${member.name}(id) -> ${member.name}`)
 			continue
 		}
@@ -75,33 +76,6 @@ function verifyMembership(name: string, relations: SchemaRelations, statement: S
 	}
 }
 
-/** Finds a face's field descriptor by name, across both relation kinds. */
-function faceField(face: FaceData, fieldName: string): AnyField | undefined {
-	const data = face.owner.data
-	if ("handles" in data) {
-		const column = data.columns.find(function byName(candidate) {
-			return candidate.name === fieldName
-		})
-		return column?.field
-	}
-	const declared = data.fields.find(function byName(candidate) {
-		return candidate.name === fieldName
-	})
-	return declared?.field
-}
-
-/**
- * The roster a field resolves handles through: present exactly on a closed
- * reference descriptor (the structural `closed` property — S1's
- * `ClosedIdField`), absent on every other field kind.
- */
-function rosterOf(field: AnyField | undefined): ClosedRoster | undefined {
-	if (field !== undefined && "closed" in field) {
-		return field.closed
-	}
-	return undefined
-}
-
 /** Flattens one binding's literal set into its literals. */
 function bindingLiterals(set: LiteralSetSpec): readonly LiteralSpec[] {
 	if (set.kind === "one") {
@@ -122,7 +96,7 @@ function verifyBindingHandles(
 	binding: { readonly field: string; readonly set: LiteralSetSpec },
 	rendered: string
 ): void {
-	const roster = rosterOf(faceField(face, binding.field))
+	const roster = rosterOf(sealedFieldOf(face.owner, binding.field))
 	for (const literal of bindingLiterals(binding.set)) {
 		if (literal.kind !== "handle") {
 			continue
@@ -177,7 +151,7 @@ function closedTargetOf(statements: readonly Statement[], owner: string, field:
 				source.projection[0] === field &&
 				target.projection.length === 1 &&
 				target.projection[0] === "id" &&
-				"handles" in target.owner.data
+				isClosedMember(target.owner)
 			) {
 				return target.owner.name
 			}
@@ -227,11 +201,11 @@ function verifyClosedReferenceBinding(
 	if (!spellsHandle) {
 		return
 	}
-	const roster = rosterOf(faceField(face, binding.field))
+	const roster = rosterOf(sealedFieldOf(face.owner, binding.field))
 	if (roster === undefined) {
 		return
 	}
-	if ("handles" in face.owner.data && binding.field === "id") {
+	if (isClosedMember(face.owner) && binding.field === "id") {
 		return
 	}
 	const resolved = closedTargetOf(statements, face.owner.name, binding.field)

package/src/statements.ts

@@ -12,8 +12,11 @@
  * schema type (the minimal kernel — descriptors are pure structure) and
  * constrained positionwise equal, so a u64 face against a str face, a
  * bytes width mismatch, an interval element mismatch, or a bare column
- * against a closed reference is a compile error. The ROSTER slot carries a
- * construction-time runtime twin here ({@link assertRosterAgreement} —
+ * against a closed reference is a compile error. TWO of those walls carry
+ * construction-time runtime twins here for untyped callers: ARITY
+ * ({@link assertArityAgreement} — cleanup-0.5.0 ruling 9: an
+ * arity-mismatched pairing fails at the statement, never by silent
+ * truncation) and the ROSTER slot ({@link assertRosterAgreement} —
  * roster IDENTITY, positionwise: a closed vocabulary's referencing column
  * is spelled with the vocabulary's own id descriptor, the ONE spelling, so
  * a plain u64 column can never alias a vocabulary through a declared law
@@ -32,9 +35,10 @@
  */
 
 import * as errors from "@superbuilders/errors"
+import { isClosedMember, sealedFieldOf } from "#closed.ts"
 import type { Count } from "#count.ts"
 import { type AnyFace, type FaceData, renderFace, type SameArity, type SameShapes } from "#face.ts"
-import type { AnyField, ClosedRoster } from "#fields.ts"
+import { type ClosedRoster, rosterOf } from "#fields.ts"
 import type { AnyRelation, RelationFields } from "#relation.ts"
 import { renderWindow, type WindowSpec } from "#spec.ts"
 
@@ -105,43 +109,28 @@ interface KeyStatement<R extends AnyRelation, Projection extends readonly string
 	readonly data: KeyData<R, Projection>
 }
 
-/**
- * The field descriptor one face position projects: an ordinary relation's
- * declared field; a closed relation's SEALED shape — the synthetic `id`
- * (the value's own roster-carrying descriptor, by identity) or a declared
- * payload column. `undefined` when the name is foreign (the type tier makes
- * that unwritable; the engine re-judges projections at `Db.create`).
- */
-function projectedFieldOf(face: FaceData, fieldName: string): AnyField | undefined {
-	const owner = face.owner
-	if ("axioms" in owner) {
-		if (fieldName === "id") {
-			return owner.id
-		}
-		const column = owner.data.columns.find(function byName(candidate) {
-			return candidate.name === fieldName
-		})
-		return column?.field
-	}
-	const declared = owner.data.fields.find(function byName(candidate) {
-		return candidate.name === fieldName
-	})
-	return declared?.field
-}
-
-/** The roster a descriptor carries: present exactly on a closed reference, absent on every other kind. */
-function rosterOfField(field: AnyField | undefined): ClosedRoster | undefined {
-	if (field !== undefined && "closed" in field) {
-		return field.closed
-	}
-	return undefined
-}
-
 /** Renders one face position's closedness for the roster-agreement diagnostics. */
 function renderRosterSide(roster: ClosedRoster | undefined): string {
 	return roster === undefined ? "a bare column" : `a ${roster.name} reference`
 }
 
+/**
+ * The runtime twin of {@link SameArity} (cleanup-0.5.0 ruling 9): the two
+ * faces must project equally many fields, judged at CONSTRUCTION for
+ * untyped callers too — without it an arity-mismatched containment
+ * silently truncates to the shorter projection (this module's positionwise
+ * walk and `law.ts`'s `unionSlot` both skip unpaired positions) until
+ * `Db.create`'s colder engine refusal. The error carries the two faces'
+ * own facts: names, arities, and the rendered statement.
+ */
+function assertArityAgreement(source: FaceData, target: FaceData, statement: Statement): void {
+	if (source.projection.length !== target.projection.length) {
+		throw errors.new(
+			`${source.owner.name}(${source.projection.join(", ")}) and ${target.owner.name}(${target.projection.join(", ")}) project ${source.projection.length} vs ${target.projection.length} fields — positional pairing requires both faces to project equally many — ${renderStatement(statement)}`
+		)
+	}
+}
+
 /**
  * The runtime twin of {@link SameShapes}'s roster slot: the two faces'
  * projected descriptors must agree POSITIONWISE on closedness — the same
@@ -154,6 +143,9 @@ function renderRosterSide(roster: ClosedRoster | undefined): string {
  * vocabulary's own descriptor (`Kind.id`) is the ONE spelling of a closed
  * reference at this surface (the canonical-utterance law); the engine
  * cannot backstop this one — the wire carries plain u64s, no rosters.
+ * Arity agreement ({@link assertArityAgreement}) runs first, so the
+ * positionwise walk here never sees an unpaired position from a well-typed
+ * OR an untyped caller.
  */
 function assertRosterAgreement(source: FaceData, target: FaceData, statement: Statement): void {
 	source.projection.forEach(function agreeAt(fieldName, position) {
@@ -161,8 +153,8 @@ function assertRosterAgreement(source: FaceData, target: FaceData, statement: St
 		if (targetField === undefined) {
 			return
 		}
-		const sourceRoster = rosterOfField(projectedFieldOf(source, fieldName))
-		const targetRoster = rosterOfField(projectedFieldOf(target, targetField))
+		const sourceRoster = rosterOf(sealedFieldOf(source.owner, fieldName))
+		const targetRoster = rosterOf(sealedFieldOf(target.owner, targetField))
 		if (sourceRoster !== targetRoster) {
 			throw errors.new(
 				`${source.owner.name}.${fieldName} is ${renderRosterSide(sourceRoster)} but ${target.owner.name}.${targetField} is ${renderRosterSide(targetRoster)} — closedness rides the descriptor: a closed reference is spelled with the vocabulary's own id descriptor (one meaning, one spelling), so faces pair closed-with-closed through one roster or bare-with-bare, never across — ${renderStatement(statement)}`
@@ -186,7 +178,7 @@ function key<
 	R extends AnyRelation,
 	const Projection extends readonly [keyof RelationFields<R> & string, ...(keyof RelationFields<R> & string)[]]
 >(relation: R, fields: Projection): KeyStatement<R, Projection> {
-	if (!("fields" in relation.data)) {
+	if (isClosedMember(relation)) {
 		throw errors.new(
 			`key(${relation.name}, ...): closedness already materializes ${relation.name}(id) -> ${relation.name} — an explicit key on a closed relation is rejected as a duplicate`
 		)
@@ -219,6 +211,7 @@ function contained<A extends AnyFace, B extends AnyFace>(
 		bidirectional: false
 	})
 	const statement = Object.freeze({ data })
+	assertArityAgreement(data.source, data.target, statement)
 	assertRosterAgreement(data.source, data.target, statement)
 	return statement
 }
@@ -243,6 +236,7 @@ function mirrors<A extends AnyFace, B extends AnyFace>(
 		bidirectional: true
 	})
 	const statement = Object.freeze({ data })
+	assertArityAgreement(data.source, data.target, statement)
 	assertRosterAgreement(data.source, data.target, statement)
 	return statement
 }
@@ -269,6 +263,7 @@ function window<B extends AnyFace, A extends AnyFace>(
 		source: source.data
 	})
 	const statement = Object.freeze({ data })
+	assertArityAgreement(data.source, data.target, statement)
 	assertRosterAgreement(data.source, data.target, statement)
 	return statement
 }

package/dist/query/select.d.ts

@@ -1,128 +0,0 @@
-/**
- * Select entries and aggregates, STRUCTURAL edition — the head vocabulary,
- * mirroring the IR's aggregate roster exactly
- * (`bumbledb/crates/bumbledb/src/ir.rs` `AggOp`/`FindTerm`;
- * `docs/architecture/20-query-ir.md` § aggregation): `count` (nullary),
- * `countDistinct`, `sum`/`min`/`max` (over an orderable variable or the
- * measure), `argMax`/`argMin` (arg-restriction: carried value + orderable
- * key; a tie yields every attaining row), and `pack` (the coalescing fold —
- * RELATION-SHAPED: one answer row per (group, maximal segment), the result
- * position interval-typed). Aggregates name their variables — `r.sum("m")`
- * — and are typed by the rule environment at `.select`. Grouping is
- * implicit: the non-aggregate select entries are the group key; over empty
- * input an all-aggregate select yields the EMPTY SET, never a zero row.
- * The creation quarantine is representational: a head position is a var
- * name, the measure, or an aggregate — no minting or arithmetic term
- * exists to spell (permanent law).
- */
-import type { Infer } from "#fields.ts";
-import type { IntervalVarOk, OrderVarOk } from "#query/atom.ts";
-import type { Duration, EnvShape, ShapeOf } from "#query/scope.ts";
-/** One aggregate operator name of the select vocabulary. */
-type AggOpName = "count" | "countDistinct" | "sum" | "min" | "max" | "argMax" | "argMin" | "pack";
-/**
- * One aggregate select VALUE: the op, the variable name (or measure) it
- * folds, and — for the Arg forms — the orderable key's variable name. The
- * runtime representation carries the types; the rule environment types the
- * result at `.select`.
- */
-interface Agg<Op extends AggOpName, Over extends string | Duration<string> | undefined, Key extends string | undefined = undefined> {
-    readonly agg: Op;
-    readonly over: Over;
-    readonly key: Key;
-}
-/** Any aggregate select value. */
-type AnyAgg = Agg<AggOpName, string | Duration<string> | undefined, string | undefined>;
-/** One select entry: a projected var name, the measure, or an aggregate. */
-type SelectEntry = string | Duration<string> | AnyAgg;
-/** Nullary count: |the group's set of distinct full bindings|, `bigint`; the answer column is named `count`. */
-declare function count(): Agg<"count", undefined>;
-/** |the distinct values of the named variable across the group|, `bigint`; legal over every type. */
-declare function countDistinct<const N extends string>(over: N): Agg<"countDistinct", N>;
-/**
- * Exact checked sum over an orderable (u64/i64) variable — wide
- * accumulator, one finalize range check; overflow is the engine's typed
- * runtime error, never a wrap — or over the measure
- * (`r.sum(r.duration("w"))`).
- */
-declare function sum<const N extends string | Duration<string>>(over: N): Agg<"sum", N>;
-/** Minimum over an orderable variable or the measure (orderable types only). */
-declare function min<const N extends string | Duration<string>>(over: N): Agg<"min", N>;
-/** Maximum over an orderable variable or the measure (orderable types only). */
-declare function max<const N extends string | Duration<string>>(over: N): Agg<"max", N>;
-/**
- * Arg-restriction toward the maximum of `key` (`ir::AggOp::ArgMax`): the
- * group's binding set is restricted to the bindings attaining the extreme
- * of the orderable key, and `value` is the carried payload — a tie yields
- * every attaining row. All Arg entries of one query share one key and one
- * direction; Arg and fold aggregates never mix (both the engine's typed
- * rules).
- */
-declare function argMax<const V extends string, const K extends string>(value: V, key: K): Agg<"argMax", V, K>;
-/** Arg-restriction toward the minimum of `key`; rules as {@link argMax}. */
-declare function argMin<const V extends string, const K extends string>(value: V, key: K): Agg<"argMin", V, K>;
-/**
- * The coalescing fold (Snodgrass coalesce, `ir::AggOp::Pack`): per group,
- * the maximal disjoint half-open segments of the union of the group's
- * interval point sets — RELATION-SHAPED, one answer row per (group,
- * maximal segment), the result position carrying one interval of the
- * input's element type. At most one `pack` per select, never beside a
- * fold or an Arg entry (the engine's typed rules).
- */
-declare function pack<const N extends string>(over: N): Agg<"pack", N>;
-/** A fold input's judgment: an orderable variable, or the measure of an interval variable. */
-type FoldOverOk<Env extends EnvShape, O> = O extends string ? OrderVarOk<Env, O> : O extends Duration<infer N extends string> ? IntervalVarOk<Env, N> : false;
-/**
- * One select entry's judgment against the rule environment: projected
- * names must be bound, the measure and `pack` demand interval-typed
- * variables, folds and Arg keys demand orderable ones.
- */
-type SelectEntryOk<Env extends EnvShape, E> = E extends string ? E extends keyof Env ? true : false : E extends Duration<infer N extends string> ? IntervalVarOk<Env, N> : E extends Agg<"count", undefined> ? true : E extends Agg<"countDistinct", infer O extends string> ? O extends keyof Env ? true : false : E extends Agg<"sum" | "min" | "max", infer O> ? FoldOverOk<Env, O> : E extends Agg<"argMax" | "argMin", infer O extends string, infer K extends string> ? [O extends keyof Env ? true : false, OrderVarOk<Env, K>] extends [true, true] ? true : false : E extends Agg<"pack", infer O extends string> ? IntervalVarOk<Env, O> : false;
-/** The validated select tuple (intersect with the inferred entries — errors land on the offending argument). */
-type CheckSelect<Env extends EnvShape, S> = {
-    readonly [I in keyof S]: SelectEntryOk<Env, S[I]> extends true ? S[I] : never;
-};
-/** The validated names-only select tuple of a RECURSIVE rule (aggregates and the measure are unwritable there). */
-type CheckNameSelect<Env extends EnvShape, S> = {
-    readonly [I in keyof S]: S[I] extends keyof Env ? S[I] : never;
-};
-/**
- * One select entry's answer-column fragment: the column is named by the
- * variable it projects or folds (`count` names its column `count`), and
- * its type reflects the entry — `count`/`countDistinct` are `bigint`
- * whatever they counted, folds carry their input's type, the measure is
- * `bigint`, the Arg forms carry the payload's type, `pack` its interval
- * type.
- */
-type SelectEntryRow<Env extends EnvShape, E> = E extends string ? {
-    readonly [K in E]: Infer<Env[E & keyof Env]["field"]>;
-} : E extends Duration<infer N extends string> ? {
-    readonly [K in N]: bigint;
-} : E extends Agg<"count", undefined> ? {
-    readonly count: bigint;
-} : E extends Agg<"countDistinct", infer O extends string> ? {
-    readonly [K in O]: bigint;
-} : E extends Agg<"sum" | "min" | "max", infer O> ? O extends string ? {
-    readonly [K in O]: Infer<Env[O & keyof Env]["field"]>;
-} : O extends Duration<infer N extends string> ? {
-    readonly [K in N]: bigint;
-} : never : E extends Agg<"argMax" | "argMin", infer O extends string, string> ? {
-    readonly [K in O]: Infer<Env[O & keyof Env]["field"]>;
-} : E extends Agg<"pack", infer O extends string> ? {
-    readonly [K in O]: Infer<Env[O & keyof Env]["field"]>;
-} : never;
-/** The inferred answer-row object type of a select tuple. */
-type RowOfSelect<Env extends EnvShape, S extends readonly SelectEntry[]> = ShapeOf<SelectEntryRow<Env, S[number]>>;
-/**
- * One projected name's answer-column fragment — a NAKED parameter, so the
- * judgment distributes per name (the union of a multi-name select never
- * smears into one column's type), mirroring {@link SelectEntryRow}.
- */
-type NameSelectRow<Env extends EnvShape, N> = N extends string ? {
-    readonly [K in N]: Infer<Env[K & keyof Env]["field"]>;
-} : never;
-/** The inferred answer-row object type of a names-only (recursive-rule) select tuple. */
-type RowOfNameSelect<Env extends EnvShape, S extends readonly string[]> = ShapeOf<NameSelectRow<Env, S[number]>>;
-export type { Agg, AggOpName, AnyAgg, CheckNameSelect, CheckSelect, RowOfNameSelect, RowOfSelect, SelectEntry, SelectEntryOk, SelectEntryRow };
-export { argMax, argMin, count, countDistinct, max, min, pack, sum };
-//# sourceMappingURL=select.d.ts.map

package/dist/query/select.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"select.d.ts","sourceRoot":"","sources":["../../src/query/select.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AACvC,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAC/D,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAA;AAElE,4DAA4D;AAC5D,KAAK,SAAS,GAAG,OAAO,GAAG,eAAe,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAA;AAEjG;;;;;GAKG;AACH,UAAU,GAAG,CACZ,EAAE,SAAS,SAAS,EACpB,IAAI,SAAS,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,SAAS,EAClD,GAAG,SAAS,MAAM,GAAG,SAAS,GAAG,SAAS;IAE1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAA;IAChB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAA;CACjB;AAED,kCAAkC;AAClC,KAAK,MAAM,GAAG,GAAG,CAAC,SAAS,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;AAEvF,4EAA4E;AAC5E,KAAK,WAAW,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,MAAM,CAAA;AAWrD,gHAAgH;AAChH,iBAAS,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAExC;AAED,qGAAqG;AACrG,iBAAS,aAAa,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAE/E;AAED;;;;;GAKG;AACH,iBAAS,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAE9E;AAED,gFAAgF;AAChF,iBAAS,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAE9E;AAED,gFAAgF;AAChF,iBAAS,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAE9E;AAED;;;;;;;GAOG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAErG;AAED,4EAA4E;AAC5E,iBAAS,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAErG;AAED;;;;;;;GAOG;AACH,iBAAS,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAE7D;AAED,8FAA8F;AAC9F,KAAK,UAAU,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI,CAAC,SAAS,MAAM,GACxD,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,GAClB,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,SAAS,MAAM,CAAC,GACzC,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,GACrB,KAAK,CAAA;AAET;;;;GAIG;AACH,KAAK,aAAa,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI,CAAC,SAAS,MAAM,GAC3D,CAAC,SAAS,MAAM,GAAG,GAClB,IAAI,GACJ,KAAK,GACN,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,SAAS,MAAM,CAAC,GACzC,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,GACrB,CAAC,SAAS,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,GAChC,IAAI,GACJ,CAAC,SAAS,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACrD,CAAC,SAAS,MAAM,GAAG,GAClB,IAAI,GACJ,KAAK,GACN,CAAC,SAAS,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC,GAC5C,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,GAClB,CAAC,SAAS,GAAG,CAAC,QAAQ,GAAG,QAAQ,EAAE,MAAM,CAAC,SAAS,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACjF,CAAC,CAAC,SAAS,MAAM,GAAG,GAAG,IAAI,GAAG,KAAK,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,GAC5E,IAAI,GACJ,KAAK,GACN,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GAC5C,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,GACrB,KAAK,CAAA;AAEd,gHAAgH;AAChH,KAAK,WAAW,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI;IAC3C,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;CAC7E,CAAA;AAED,mHAAmH;AACnH,KAAK,eAAe,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI;IAC/C,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;CAC9D,CAAA;AAED;;;;;;;GAOG;AACH,KAAK,cAAc,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI,CAAC,SAAS,MAAM,GAC5D;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAAE,GACzD,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,SAAS,MAAM,CAAC,GACzC;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM;CAAE,GAC7B,CAAC,SAAS,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,GAChC;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC1B,CAAC,SAAS,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACrD;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM;CAAE,GAC7B,CAAC,SAAS,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC,GAC5C,CAAC,SAAS,MAAM,GACf;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAAE,GACzD,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,SAAS,MAAM,CAAC,GACzC;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM;CAAE,GAC7B,KAAK,GACP,CAAC,SAAS,GAAG,CAAC,QAAQ,GAAG,QAAQ,EAAE,MAAM,CAAC,SAAS,MAAM,EAAE,MAAM,CAAC,GACjE;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAAE,GACzD,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GAC5C;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAAE,GACzD,KAAK,CAAA;AAEd,6DAA6D;AAC7D,KAAK,WAAW,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,SAAS,SAAS,WAAW,EAAE,IAAI,OAAO,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;AAElH;;;;GAIG;AACH,KAAK,aAAa,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,IAAI,CAAC,SAAS,MAAM,GAC3D;IAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAAE,GACzD,KAAK,CAAA;AAER,yFAAyF;AACzF,KAAK,eAAe,CAAC,GAAG,SAAS,QAAQ,EAAE,CAAC,SAAS,SAAS,MAAM,EAAE,IAAI,OAAO,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;AAEhH,YAAY,EACX,GAAG,EACH,SAAS,EACT,MAAM,EACN,eAAe,EACf,WAAW,EACX,eAAe,EACf,WAAW,EACX,WAAW,EACX,aAAa,EACb,cAAc,EACd,CAAA;AACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA"}

package/dist/query/select.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"select.js","sourceRoot":"","sources":["../../src/query/select.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AA+BH,kCAAkC;AAClC,SAAS,SAAS,CAIhB,EAAM,EAAE,IAAU,EAAE,GAAQ;IAC7B,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA;AAC7C,CAAC;AAED,gHAAgH;AAChH,SAAS,KAAK;IACb,OAAO,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;AAChD,CAAC;AAED,qGAAqG;AACrG,SAAS,aAAa,CAAyB,IAAO;IACrD,OAAO,SAAS,CAAC,eAAe,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAS,GAAG,CAA4C,IAAO;IAC9D,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACzC,CAAC;AAED,gFAAgF;AAChF,SAAS,GAAG,CAA4C,IAAO;IAC9D,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACzC,CAAC;AAED,gFAAgF;AAChF,SAAS,GAAG,CAA4C,IAAO;IAC9D,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,MAAM,CAAiD,KAAQ,EAAE,GAAM;IAC/E,OAAO,SAAS,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;AACvC,CAAC;AAED,4EAA4E;AAC5E,SAAS,MAAM,CAAiD,KAAQ,EAAE,GAAM;IAC/E,OAAO,SAAS,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;AACvC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,IAAI,CAAyB,IAAO;IAC5C,OAAO,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AAC1C,CAAC;AAqGD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA"}