@graview/core 0.1.12 → 0.1.14

package/dist/arrangement.d.ts

@@ -0,0 +1,169 @@
+import type { AnySchema } from "./schema/schema.js";
+import type { AnyNodeDefinition } from "./schema/types.js";
+/**
+ * ARRANGEMENT IS A CAPABILITY OF THE DECLARATION, not of a view.
+ *
+ * Every surface that lists things arranges them, and each did it its own
+ * way or not at all: the list page grouped by an edge through a URL key of
+ * its own, the districts sorted by id, the board and the calendar took no
+ * sort, filter or group whatever. What a kind CAN be arranged by is already
+ * written down — its fields have types, its edges have far ends, its
+ * lifecycle names the past, the rules name what is flagged — so the offers
+ * are derived here once, headless, and the same string carries the chosen
+ * arrangement in a stop's fragment (`in.sort`, `in.filter`, `in.group`) and
+ * in a page's search, so an arranged picture is a link.
+ */
+export type SortDirection = "asc" | "desc";
+export interface Sort {
+    /** `label`, a field name, or an edge kind (by the far end's label). */
+    readonly by: string;
+    readonly direction: SortDirection;
+}
+/**
+ * One condition; a filter is the conjunction of several.
+ *
+ * `key` is a field name, an edge kind, or `is`. The value's grammar depends
+ * on the key: a boolean, enum or text field takes one of its values; a date
+ * field takes `before:<date>`, `after:<date>` or `on:<date>`; a number field
+ * takes `at-most:<n>`, `at-least:<n>` or a value; an edge takes a
+ * node id, `*` (tied to anything) or `none`; `is` takes `current`, `past`,
+ * `any`, `flagged` or `clear`. Anything else is dropped, not thrown.
+ */
+export interface Condition {
+    readonly key: string;
+    readonly value: string;
+}
+/** How wide a date group is. A year and a decade are what a catalogue of thirty years reads by. */
+export type DateBucket = "day" | "week" | "month" | "year" | "decade";
+export interface Grouping {
+    /** A field name or an edge kind. */
+    readonly by: string;
+    /** For a date field: how wide a group is. Day when unsaid. */
+    readonly bucket?: DateBucket;
+}
+export interface Arrangement {
+    readonly sort?: Sort;
+    readonly filter?: readonly Condition[];
+    readonly group?: Grouping;
+    /**
+     * Words to look for: a node stays when its label or any scalar field
+     * contains them, case aside. The narrowing a person types, beside the
+     * conditions a person picks — and the same matcher a search would use.
+     */
+    readonly query?: string;
+}
+export declare const NO_ARRANGEMENT: Arrangement;
+/** What a lens says to decline arrangement, wholly or a part at a time. */
+export type ArrangeOption = boolean | {
+    readonly sort?: boolean;
+    readonly filter?: boolean;
+    readonly group?: boolean;
+};
+export type OfferType = "text" | "number" | "date" | "boolean" | "choice";
+/** One thing a kind can be sorted, filtered or grouped by, in the declaration's own words. */
+export interface ArrangeOffer {
+    readonly key: string;
+    /** The words for it: the field's reading, the edge kind humanised, or the reserved word's sentence. */
+    readonly label: string;
+    readonly about: "label" | "field" | "edge" | "is";
+    readonly type?: OfferType;
+    /** For a choice field, its options; for `is`, its words; for an edge, nothing — the far ends are the graph's. */
+    readonly options?: readonly string[];
+    /** For a date field, how it may be bucketed when grouped. */
+    readonly buckets?: readonly DateBucket[];
+    /** For an edge: the kinds at the far end, and how it reads from this kind. */
+    readonly far?: readonly string[];
+}
+export interface Arrangeable {
+    readonly kind: string;
+    readonly sorts: readonly ArrangeOffer[];
+    readonly filters: readonly ArrangeOffer[];
+    readonly groups: readonly ArrangeOffer[];
+    /** The kind's natural order, when `fieldRoles.order` names one. */
+    readonly natural?: Sort;
+}
+/** The words for a field, after the declaration's own `display.labels`. */
+export declare function readingOf(definition: AnyNodeDefinition, field: string): string;
+export declare function fieldType(schema: unknown): OfferType | undefined;
+/** The edges this kind takes part in, from either end, with how each reads from here. */
+export declare function edgesOf(schema: AnySchema, kind: string): readonly ArrangeOffer[];
+/**
+ * Whether a condition names one of a kind's RETIRED states — `status:demo`
+ * where demos are behind the horizon — which is asking for the past by
+ * name. The search box and the list page both left the past out for it and
+ * found nothing.
+ */
+export declare function asksForThePast(definition: {
+    readonly lifecycle?: {
+        readonly field: string;
+        readonly retired: readonly unknown[] | "date";
+    };
+} | undefined, conditions: readonly {
+    readonly key: string;
+    readonly value: string;
+}[]): boolean;
+/**
+ * What a kind can be arranged by, derived from its declaration alone.
+ *
+ * Sorts: the label, every field with a scalar type, every edge (by the far
+ * end's label). Filters: boolean and choice fields by value, date fields by
+ * before/after/on, every edge by a node or by having one at all, and `is`
+ * for the lifecycle and the standing. Groups: boolean and choice fields,
+ * date fields by day, week or month, and every edge by its far end. A field
+ * the declaration hides is not offered — an ordering key is not a thing a
+ * person groups by.
+ */
+export declare function arrangeable(schema: AnySchema, kind: string): Arrangeable;
+export declare function describeArgOptions(schema: unknown): readonly string[];
+export interface ArrangementWords {
+    readonly sort?: string;
+    readonly filter?: string;
+    readonly group?: string;
+    readonly q?: string;
+}
+export declare function parseArrangement(words: ArrangementWords): Arrangement;
+/** What arranging needs of a node: its identity. Fields are read off it by name. */
+export type ArrangeNode = {
+    readonly id: string;
+    readonly kind: string;
+};
+export declare const fields: (node: ArrangeNode) => Record<string, unknown>;
+export declare const asRecord: (node: ArrangeNode) => ArrangeNode & Record<string, unknown>;
+/**
+ * The little of a graph arranging needs, said structurally so a `Graph<S>`
+ * over any concrete schema fits — `GraphReader`'s generic `nodesOfKind`
+ * does not, once the kinds are literal.
+ */
+export interface ArrangeGraph {
+    getNode(id: string): ArrangeNode | undefined;
+    allNodes(): readonly ArrangeNode[];
+    out(id: string, kind?: string): readonly ArrangeNode[];
+    in(id: string, kind?: string): readonly ArrangeNode[];
+}
+export interface ArrangeContext {
+    readonly schema: AnySchema;
+    readonly graph: ArrangeGraph;
+    /** Node ids the rules currently implicate, for `is:flagged` and `is:clear`. */
+    readonly flagged?: ReadonlySet<string>;
+    /** For the lifecycle: today, as YYYY-MM-DD. */
+    readonly today?: string;
+}
+export interface ArrangedGroup<N extends ArrangeNode = ArrangeNode> {
+    /** Stable, sortable: the value, the date bucket's first day, the far end's id, or `` for none. */
+    readonly key: string;
+    /** The words for the group: a value as it reads, a date, a far end's label, or "No <reading>". */
+    readonly label: string;
+    readonly nodes: readonly N[];
+}
+export interface Arranged<N extends ArrangeNode = ArrangeNode> {
+    /** The nodes that passed the filter, in order. */
+    readonly nodes: readonly N[];
+    /** The same nodes, grouped when a grouping was asked; one unnamed group otherwise. */
+    readonly groups: readonly ArrangedGroup<N>[];
+    readonly grouped: boolean;
+}
+/** The far ends of `edgeKind` from `id`, either way round, as nodes. */
+export declare function farEnds(graph: ArrangeGraph, id: string, edgeKind: string): ArrangeNode[];
+/** Whether a node meets one condition of a filter. Search judges its `key:value` tokens with this too. */
+export declare function conditionHolds(ctx: ArrangeContext, node: ArrangeNode, condition: Condition): boolean;
+//# sourceMappingURL=arrangement.d.ts.map

package/dist/arrangement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrangement.d.ts","sourceRoot":"","sources":["../src/arrangement.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAE3D;;;;;;;;;;;;GAYG;AAEH,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,MAAM,CAAC;AAE3C,MAAM,WAAW,IAAI;IACnB,uEAAuE;IACvE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;CACnC;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,mGAAmG;AACnG,MAAM,MAAM,UAAU,GAAG,KAAK,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG,QAAQ,CAAC;AAEtE,MAAM,WAAW,QAAQ;IACvB,oCAAoC;IACpC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,8DAA8D;IAC9D,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;CAC9B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IACvC,QAAQ,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,eAAO,MAAM,cAAc,EAAE,WAAgB,CAAC;AAE9C,2EAA2E;AAC3E,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG;IAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEvH,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ,CAAC;AAE1E,8FAA8F;AAC9F,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,uGAAuG;IACvG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC;IAClD,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC;IAC1B,iHAAiH;IACjH,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,8EAA8E;IAC9E,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC;IACzC,mEAAmE;IACnE,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;CACzB;AAED,2EAA2E;AAC3E,wBAAgB,SAAS,CAAC,UAAU,EAAE,iBAAiB,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9E;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,GAAG,SAAS,CAYhE;AAED,yFAAyF;AACzF,wBAAgB,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,YAAY,EAAE,CAyBhF;AAMD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,UAAU,EAAE;IAAE,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,OAAO,EAAE,GAAG,MAAM,CAAA;KAAE,CAAA;CAAE,GAAG,SAAS,EAC1H,UAAU,EAAE,SAAS;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,GACtE,OAAO,CAKT;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,CAmDxE;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,MAAM,EAAE,CAGrE;AAcD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;CACrB;AAID,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,gBAAgB,GAAG,WAAW,CAqBrE;AAMD,oFAAoF;AACpF,MAAM,MAAM,WAAW,GAAG;IAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzE,eAAO,MAAM,MAAM,GAAI,MAAM,WAAW,KAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAA+C,CAAC;AACjH,eAAO,MAAM,QAAQ,GAAI,MAAM,WAAW,KAAa,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE7F;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;IAC7C,QAAQ,IAAI,SAAS,WAAW,EAAE,CAAC;IACnC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,WAAW,EAAE,CAAC;IACvD,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,WAAW,EAAE,CAAC;CACvD;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW;IAChE,kGAAkG;IAClG,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,kGAAkG;IAClG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW;IAC3D,kDAAkD;IAClD,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAC7B,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7C,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED,wEAAwE;AACxE,wBAAgB,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,WAAW,EAAE,CAIxF;AAED,0GAA0G;AAC1G,wBAAgB,cAAc,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,GAAG,OAAO,CA6CpG"}

package/dist/arrangement.js

@@ -0,0 +1,220 @@
+import { describeArg } from "./mutations/node-ref.js";
+import { humaniseField, isCurrent } from "./schema/define-node.js";
+export const NO_ARRANGEMENT = {};
+/** The words for a field, after the declaration's own `display.labels`. */
+export function readingOf(definition, field) {
+    return definition.display?.labels?.[field] ?? humaniseField(field);
+}
+export function fieldType(schema) {
+    const shape = describeArg(schema);
+    switch (shape.type) {
+        case "text":
+        case "date":
+        case "number":
+        case "boolean":
+        case "choice":
+            return shape.type;
+        default:
+            return undefined;
+    }
+}
+/** The edges this kind takes part in, from either end, with how each reads from here. */
+export function edgesOf(schema, kind) {
+    const offers = new Map();
+    const definition = schema.tryDefinition(kind);
+    for (const [edgeKind, declared] of Object.entries(definition?.edges ?? {})) {
+        offers.set(edgeKind, {
+            key: edgeKind,
+            label: declared.description ? capitalise(declared.description) : humaniseField(edgeKind),
+            about: "edge",
+            far: declared.to === "*" ? [...schema.kinds] : [...declared.to],
+        });
+    }
+    for (const other of schema.definitions) {
+        if (other.kind === kind)
+            continue;
+        for (const [edgeKind, declared] of Object.entries(other.edges ?? {})) {
+            if (offers.has(edgeKind))
+                continue;
+            if (declared.to !== "*" && !declared.to.includes(kind))
+                continue;
+            offers.set(edgeKind, {
+                key: edgeKind,
+                label: declared.inverse ? capitalise(declared.inverse) : humaniseField(edgeKind),
+                about: "edge",
+                far: [other.kind],
+            });
+        }
+    }
+    return [...offers.values()];
+}
+const capitalise = (text) => text.charAt(0).toUpperCase() + text.slice(1);
+const IS_WORDS = ["current", "past", "any", "flagged", "clear"];
+/**
+ * Whether a condition names one of a kind's RETIRED states — `status:demo`
+ * where demos are behind the horizon — which is asking for the past by
+ * name. The search box and the list page both left the past out for it and
+ * found nothing.
+ */
+export function asksForThePast(definition, conditions) {
+    const lifecycle = definition?.lifecycle;
+    if (!lifecycle || lifecycle.retired === "date")
+        return false;
+    const retired = lifecycle.retired.map(String);
+    return conditions.some((condition) => condition.key === lifecycle.field && retired.includes(condition.value));
+}
+/**
+ * What a kind can be arranged by, derived from its declaration alone.
+ *
+ * Sorts: the label, every field with a scalar type, every edge (by the far
+ * end's label). Filters: boolean and choice fields by value, date fields by
+ * before/after/on, every edge by a node or by having one at all, and `is`
+ * for the lifecycle and the standing. Groups: boolean and choice fields,
+ * date fields by day, week or month, and every edge by its far end. A field
+ * the declaration hides is not offered — an ordering key is not a thing a
+ * person groups by.
+ */
+export function arrangeable(schema, kind) {
+    const definition = schema.tryDefinition(kind);
+    if (!definition)
+        return { kind, sorts: [], filters: [], groups: [] };
+    const hidden = new Set(definition.display?.hide ?? []);
+    const shape = (definition.fields.shape ?? {});
+    const sorts = [{ key: "label", label: "Name", about: "label", type: "text" }];
+    const filters = [];
+    const groups = [];
+    for (const [field, fieldSchema] of Object.entries(shape)) {
+        if (field === "id" || field === "kind" || field === "label" || hidden.has(field))
+            continue;
+        const type = fieldType(fieldSchema);
+        if (!type)
+            continue;
+        const label = readingOf(definition, field);
+        const options = type === "choice" ? describeArgOptions(fieldSchema) : type === "boolean" ? ["true", "false"] : undefined;
+        const offer = { key: field, label, about: "field", type, ...(options ? { options } : {}) };
+        sorts.push(offer);
+        /*
+         * A NUMBER AND A WORD ARE FILTERS TOO. "SUVs under £25,000 with fewer
+         * than 30,000 miles, a Kia or a Hyundai" is the whole of a car
+         * shopper's first minute, and the list offered none of it: only a
+         * choice, a yes or no and a date could be picked. A number is kept at
+         * most or at least a value; a word field is picked by the values it
+         * holds (which the graph says, so a surface lists them).
+         */
+        filters.push(offer);
+        if (type === "boolean" || type === "choice")
+            groups.push(offer);
+        if (type === "date")
+            groups.push({ ...offer, buckets: ["day", "week", "month", "year", "decade"] });
+    }
+    for (const edge of edgesOf(schema, kind)) {
+        sorts.push(edge);
+        filters.push(edge);
+        groups.push(edge);
+    }
+    const is = {
+        key: "is",
+        label: definition.lifecycle ? "Standing and currency" : "Standing",
+        about: "is",
+        type: "choice",
+        options: definition.lifecycle ? [...IS_WORDS] : ["flagged", "clear"],
+    };
+    filters.push(is);
+    const order = definition.fieldRoles?.["order"];
+    const natural = order && (order in shape || order === "label") ? { by: order, direction: "asc" } : undefined;
+    return { kind, sorts, filters, groups, ...(natural ? { natural } : {}) };
+}
+export function describeArgOptions(schema) {
+    const shape = describeArg(schema);
+    return shape.type === "choice" ? shape.options : [];
+}
+const BUCKETS = ["day", "week", "month", "year", "decade"];
+export function parseArrangement(words) {
+    const out = {};
+    if (words.q && words.q.trim().length > 0)
+        out.query = words.q;
+    if (words.sort) {
+        const [by, direction] = words.sort.split(":");
+        if (by)
+            out.sort = { by, direction: direction === "desc" ? "desc" : "asc" };
+    }
+    if (words.filter) {
+        const conditions = [];
+        for (const part of words.filter.split(",")) {
+            const colon = part.indexOf(":");
+            if (colon <= 0)
+                continue;
+            conditions.push({ key: part.slice(0, colon), value: part.slice(colon + 1) });
+        }
+        if (conditions.length > 0)
+            out.filter = conditions;
+    }
+    if (words.group) {
+        const [by, bucket] = words.group.split(":");
+        if (by)
+            out.group = { by, ...(BUCKETS.includes(bucket) ? { bucket: bucket } : {}) };
+    }
+    return out;
+}
+export const fields = (node) => node;
+export const asRecord = (node) => node;
+/** The far ends of `edgeKind` from `id`, either way round, as nodes. */
+export function farEnds(graph, id, edgeKind) {
+    const seen = new Map();
+    for (const node of [...graph.out(id, edgeKind), ...graph.in(id, edgeKind)])
+        seen.set(node.id, node);
+    return [...seen.values()];
+}
+/** Whether a node meets one condition of a filter. Search judges its `key:value` tokens with this too. */
+export function conditionHolds(ctx, node, condition) {
+    const definition = ctx.schema.tryDefinition(node.kind);
+    if (condition.key === "is") {
+        switch (condition.value) {
+            case "current":
+                return isCurrent(definition, asRecord(node), ctx.today);
+            case "past":
+                return !isCurrent(definition, asRecord(node), ctx.today);
+            case "any":
+                return true;
+            case "flagged":
+                return ctx.flagged?.has(node.id) ?? false;
+            case "clear":
+                return !(ctx.flagged?.has(node.id) ?? false);
+            default:
+                return true;
+        }
+    }
+    const shape = (definition?.fields.shape ?? {});
+    if (condition.key in shape) {
+        const value = fields(node)[condition.key];
+        const type = fieldType(shape[condition.key]);
+        if (type === "date") {
+            const [op, date] = condition.value.split(":");
+            if (typeof value !== "string" || !date)
+                return false;
+            const day = value.slice(0, 10);
+            return op === "before" ? day < date : op === "after" ? day > date : day === date;
+        }
+        if (type === "boolean")
+            return String(value) === condition.value;
+        if (type === "number") {
+            const at = condition.value.lastIndexOf(":");
+            const op = at > 0 ? condition.value.slice(0, at) : "";
+            const bound = Number(condition.value.slice(at + 1));
+            if (op === "at-most" || op === "at-least") {
+                if (typeof value !== "number" || !Number.isFinite(bound))
+                    return false;
+                return op === "at-most" ? value <= bound : value >= bound;
+            }
+        }
+        return String(value) === condition.value;
+    }
+    // An edge: tied to this node, to anything, or to nothing.
+    const ends = farEnds(ctx.graph, node.id, condition.key);
+    if (condition.value === "*")
+        return ends.length > 0;
+    if (condition.value === "none")
+        return ends.length === 0;
+    return ends.some((end) => end.id === condition.value);
+}
+//# sourceMappingURL=arrangement.js.map

package/dist/arrangement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrangement.js","sourceRoot":"","sources":["../src/arrangement.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AA+DnE,MAAM,CAAC,MAAM,cAAc,GAAgB,EAAE,CAAC;AA+B9C,2EAA2E;AAC3E,MAAM,UAAU,SAAS,CAAC,UAA6B,EAAE,KAAa;IACpE,OAAO,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC;AACrE,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,MAAe;IACvC,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,IAAI,CAAC;QACpB;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,OAAO,CAAC,MAAiB,EAAE,IAAY;IACrD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE;YACnB,GAAG,EAAE,QAAQ;YACb,KAAK,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC;YACxF,KAAK,EAAE,MAAM;YACb,GAAG,EAAE,QAAQ,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAI,MAAM,CAAC,KAA2B,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;SACvF,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAClC,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;YACrE,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACnC,IAAI,QAAQ,CAAC,EAAE,KAAK,GAAG,IAAI,CAAE,QAAQ,CAAC,EAAwB,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,SAAS;YACxF,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE;gBACnB,GAAG,EAAE,QAAQ;gBACb,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC;gBAChF,KAAK,EAAE,MAAM;gBACb,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;aAClB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAE1F,MAAM,QAAQ,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,CAAU,CAAC;AAEzE;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,UAA0H,EAC1H,UAAuE;IAEvE,MAAM,SAAS,GAAG,UAAU,EAAE,SAAS,CAAC;IACxC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,OAAO,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC;IAC7D,MAAM,OAAO,GAAI,SAAS,CAAC,OAA8B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACtE,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;AAChH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,MAAiB,EAAE,IAAY;IACzD,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IACrE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAA4B,CAAC;IAEzE,MAAM,KAAK,GAAmB,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IAC9F,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAC3F,MAAM,IAAI,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,KAAK,GAAG,SAAS,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACzH,MAAM,KAAK,GAAiB,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QACzG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB;;;;;;;WAOG;QACH,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,IAAI,IAAI,KAAK,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;IACtG,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,EAAE,GAAiB;QACvB,GAAG,EAAE,IAAI;QACT,KAAK,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,UAAU;QAClE,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC;KACrE,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEjB,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,OAAO,CAAC,CAAC;IAC/C,MAAM,OAAO,GACX,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAE/F,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,MAAe;IAChD,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AACtD,CAAC;AAqBD,MAAM,OAAO,GAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAElF,MAAM,UAAU,gBAAgB,CAAC,KAAuB;IACtD,MAAM,GAAG,GAA4E,EAAE,CAAC;IACxF,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IAC9D,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QACf,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,EAAE;YAAE,GAAG,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IAC9E,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,KAAK,IAAI,CAAC;gBAAE,SAAS;YACzB,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC;IACrD,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,EAAE;YAAE,GAAG,CAAC,KAAK,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAoB,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAoB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAClH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAiB,EAA2B,EAAE,CAAC,IAA0C,CAAC;AACjH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAAiB,EAAE,EAAE,CAAC,IAA6C,CAAC;AAuC7F,wEAAwE;AACxE,MAAM,UAAU,OAAO,CAAC,KAAmB,EAAE,EAAU,EAAE,QAAgB;IACvE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAmB,CAAC,CAAC;IACnH,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC5B,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,cAAc,CAAC,GAAmB,EAAE,IAAiB,EAAE,SAAoB;IACzF,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,IAAI,SAAS,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;QAC3B,QAAQ,SAAS,CAAC,KAAK,EAAE,CAAC;YACxB,KAAK,SAAS;gBACZ,OAAO,SAAS,CAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAC1D,KAAK,MAAM;gBACT,OAAO,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAC3D,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC;YACd,KAAK,SAAS;gBACZ,OAAO,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC;YAC5C,KAAK,OAAO;gBACV,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC;YAC/C;gBACE,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,KAAK,IAAI,EAAE,CAA4B,CAAC;IAC1E,IAAI,SAAS,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YACrD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC;QACnF,CAAC;QACD,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,KAAK,CAAC;QACjE,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC5C,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACpD,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,UAAU,EAAE,CAAC;gBAC1C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvE,OAAO,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC;YAC5D,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,KAAK,CAAC;IAC3C,CAAC;IACD,0DAA0D;IAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;IACxD,IAAI,SAAS,CAAC,KAAK,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACpD,IAAI,SAAS,CAAC,KAAK,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IACzD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC"}

package/dist/arranging.d.ts

@@ -0,0 +1,28 @@
+import { type ArrangeContext, type Arrangeable, type Arranged, type ArrangementWords, type ArrangeNode, type ArrangeOption, type Arrangement, type DateBucket } from "./arrangement.js";
+/** Whether a lens offers a part, given what it declared. Everything is on unless declined. */
+export declare function arrangeAllows(option: ArrangeOption | undefined, part: "sort" | "filter" | "group"): boolean;
+export declare function formatArrangement(arrangement: Arrangement): ArrangementWords;
+/**
+ * Keeps only the parts a kind can actually be arranged by, and says which
+ * were dropped — a stale link names a field that was renamed, and the
+ * honest thing is to show the rest arranged and say what was ignored.
+ */
+export declare function admitArrangement(arrangement: Arrangement, offers: Arrangeable): {
+    readonly arrangement: Arrangement;
+    readonly dropped: readonly string[];
+};
+/** The first day of the bucket a date falls in, as YYYY-MM-DD; weeks start on Monday, in UTC. */
+export declare function bucketStart(date: string, bucket: DateBucket): string | undefined;
+/**
+ * Whether the words find the node — search's own matcher, so a list's `q`
+ * and the Find box never disagree: every word the start of a word in the
+ * label or a readable field, case, diacritics and punctuation aside.
+ */
+export declare function matches(ctx: ArrangeContext, node: ArrangeNode, query: string): boolean;
+/**
+ * Filters, sorts and groups. The filter is a conjunction; the sort is
+ * stable; a grouping puts the group with nothing to say last. Nodes whose
+ * kind the context cannot describe are kept and sort by what they carry.
+ */
+export declare function arrange<N extends ArrangeNode>(nodes: readonly N[], arrangement: Arrangement, ctx: ArrangeContext): Arranged<N>;
+//# sourceMappingURL=arranging.d.ts.map

package/dist/arranging.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arranging.d.ts","sourceRoot":"","sources":["../src/arranging.ts"],"names":[],"mappings":"AAEA,OAAO,EAUL,KAAK,cAAc,EACnB,KAAK,WAAW,EAChB,KAAK,QAAQ,EACb,KAAK,gBAAgB,EACrB,KAAK,WAAW,EAChB,KAAK,aAAa,EAClB,KAAK,WAAW,EAEhB,KAAK,UAAU,EAGhB,MAAM,kBAAkB,CAAC;AAW1B,8FAA8F;AAC9F,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,OAAO,CAI3G;AAED,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,WAAW,GAAG,gBAAgB,CAa5E;AAGD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,WAAW,EACxB,MAAM,EAAE,WAAW,GAClB;IAAE,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAwB5E;AAyBD,iGAAiG;AACjG,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAYhF;AAYD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAEtF;AA8BD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,GAAG,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAC,CAyF9H"}