@kensio/quando 0.2.0 → 1.0.0

package/dist/tally.js

@@ -0,0 +1,80 @@
+/**
+ * How many, in the words people use for counting.
+ *
+ * The same relationship to [merging](./merge.ts) that a
+ * [schedule](./schedule.ts) has to a cascade. `merged("sum", layer(…),
+ * layer(…))` says what it does, and it asks the reader to know three things
+ * first: that layers overlap, that an overlap is what combines, and what a
+ * bare `"sum"` in the first argument governs. Nobody staffing a warehouse
+ * says any of that. They say three on weekdays, two more on the eleventh.
+ *
+ * A `Tally` *is* a `Cascade<number>` with `merge: "sum"`, so everything that
+ * takes a cascade takes one of these, and it serialises to the document a
+ * hand-written one would.
+ */
+import { valueAt } from "./assigned.js";
+import { always } from "./build.js";
+import { cascade, layer, replace, } from "./cascade.js";
+import { duration } from "./interval.js";
+import { asDays } from "./plain-forms.js";
+import { resolve } from "./resolve.js";
+/** Zero, as a duration to accumulate onto. */
+const NOTHING = Temporal.Duration.from({ seconds: 0 });
+/**
+ * A figure that claims its scope outright.
+ *
+ * The inner cascade covers the whole of the region this layer wins, which is
+ * what `always` means once it is resolved against that region rather than
+ * against the context.
+ */
+function fixed(scope, amount) {
+    const figure = cascade(layer(always(), amount));
+    return replace(asDays(scope), figure);
+}
+function build(layers) {
+    const self = {
+        type: "cascade",
+        merge: "sum",
+        layers,
+        plus: (scope, amount) => build([...layers, layer(asDays(scope), amount)]),
+        exactly: (scope, amount) => build([...layers, fixed(scope, amount)]),
+        at: (at) => valueAt(self, at) ?? 0,
+        least: (from, to) => {
+            let lowest;
+            let covered = NOTHING;
+            for (const span of resolve(self, { from, to })) {
+                lowest =
+                    lowest === undefined ? span.value : Math.min(lowest, span.value);
+                const length = duration(span);
+                if (length !== undefined) {
+                    covered = covered.add(length);
+                }
+            }
+            // Anything the layers left uncovered is nobody there, which is lower
+            // than any figure they assigned. Comparing what was covered against the
+            // window finds that without a second sweep for the gaps.
+            const window = from.until(to, { largestUnit: "hour" });
+            if (Temporal.Duration.compare(covered, window) < 0) {
+                return 0;
+            }
+            return lowest ?? 0;
+        },
+        counts: (from, to) => resolve(self, to === undefined ? { from } : { from, to }),
+    };
+    return self;
+}
+/**
+ * An empty tally: nobody, until something says otherwise.
+ *
+ * ```ts
+ * const staff = tally()
+ *   .plus(weekdays(), 3)
+ *   .plus(weekends(), 1)
+ *   .plus("2026-03-11", 2)
+ *   .exactly("2026-12-24", 1);
+ * ```
+ */
+export function tally() {
+    return build([]);
+}
+//# sourceMappingURL=tally.js.map

package/dist/tally.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tally.js","sourceRoot":"","sources":["../src/tally.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAEL,OAAO,EAEP,KAAK,EACL,OAAO,GACR,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,MAAM,EAAkB,MAAM,kBAAkB,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAGvC,8CAA8C;AAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AA2DvD;;;;;;GAMG;AACH,SAAS,KAAK,CAAC,KAAgB,EAAE,MAAc;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;IAChD,OAAO,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,KAAK,CAAC,MAAgC;IAC7C,MAAM,IAAI,GAAU;QAClB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,KAAK;QACZ,MAAM;QAEN,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAEzE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QAEpE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC;QAElC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE;YAClB,IAAI,MAA0B,CAAC;YAC/B,IAAI,OAAO,GAAG,OAAO,CAAC;YAEtB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC/C,MAAM;oBACJ,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YAED,qEAAqE;YACrE,wEAAwE;YACxE,yDAAyD;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;YACvD,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnD,OAAO,CAAC,CAAC;YACX,CAAC;YACD,OAAO,MAAM,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CACnB,OAAO,CAAC,IAAI,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;KAC5D,CAAC;IAEF,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK;IACnB,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC;AACnB,CAAC"}

package/dist/valued-stream.d.ts

@@ -1,13 +1,14 @@
 /**
- * Streams of intervals that carry values, and the two operations resolution
- * needs over them.
+ * Streams of intervals that carry values, and the operations resolution needs
+ * over them.
  *
  * The same shape as `interval-stream.ts` one level down, and deliberately
- * separate from it: those sweeps are set algebra over *when*, and nothing in
- * them has an opinion about values. These two do nothing but carry values
- * along, which is why neither needs the overlap arithmetic next door.
+ * separate from it. Those sweeps are set algebra over *when*, and nothing in
+ * them has an opinion about values. {@link overlay} is where an opinion is
+ * needed, and it is handed one rather than choosing.
  */
 import type { Valued } from "./cascade.js";
+import type { Merge } from "./merge.js";
 /**
  * A lazy sequence of valued intervals.
  *
@@ -18,13 +19,21 @@ import type { Valued } from "./cascade.js";
  */
 export type ValuedStream<V> = Iterable<Valued<V>>;
 /**
- * One ascending stream from many.
+ * Two streams laid over one another, with `merge` settling the overlap.
  *
- * The sources are disjoint by construction — a moment is won by exactly one
- * layer — so this only has to take whichever starts earliest, with none of the
- * overlap arithmetic the interval sweeps need.
+ * Where only one covers a moment, its value comes through. Where both do, the
+ * two values go to `merge`, `under` first. Where neither does, the moment is
+ * absent, the same as everywhere else in the library.
+ *
+ * It walks both fronts and cuts whichever runs on at the other's boundary, so
+ * it pulls only as far as the next piece of the answer and stays lazy over
+ * endless sources.
+ *
+ * Output is not coalesced. Cutting at every boundary splits runs carrying the
+ * same value on both sides, and {@link coalesce} over the top puts them back.
+ * Teaching this sweep to look ahead instead would buy nothing.
  */
-export declare function interleave<V>(sources: readonly ValuedStream<V>[]): ValuedStream<V>;
+export declare function overlay<V>(under: ValuedStream<V>, over: ValuedStream<V>, merge: Merge<V>): ValuedStream<V>;
 /**
  * Adjacent intervals carrying the same value are one interval.
  *

package/dist/valued-stream.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"valued-stream.d.ts","sourceRoot":"","sources":["../src/valued-stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAI3C;;;;;;;GAOG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAElD;;;;;;GAMG;AACH,wBAAiB,UAAU,CAAC,CAAC,EAC3B,OAAO,EAAE,SAAS,YAAY,CAAC,CAAC,CAAC,EAAE,GAClC,YAAY,CAAC,CAAC,CAAC,CAyBjB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAiB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAmBrE"}
+{"version":3,"file":"valued-stream.d.ts","sourceRoot":"","sources":["../src/valued-stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAGxC;;;;;;;GAOG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAElD;;;;;;;;;;;;;;GAcG;AACH,wBAAiB,OAAO,CAAC,CAAC,EACxB,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,EACtB,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EACrB,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GACd,YAAY,CAAC,CAAC,CAAC,CAsDjB;AA+CD;;;;;;;;;;;;GAYG;AACH,wBAAiB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAmBrE"}

package/dist/valued-stream.js

@@ -1,41 +1,112 @@
 /**
- * Streams of intervals that carry values, and the two operations resolution
- * needs over them.
+ * Streams of intervals that carry values, and the operations resolution needs
+ * over them.
  *
  * The same shape as `interval-stream.ts` one level down, and deliberately
- * separate from it: those sweeps are set algebra over *when*, and nothing in
- * them has an opinion about values. These two do nothing but carry values
- * along, which is why neither needs the overlap arithmetic next door.
+ * separate from it. Those sweeps are set algebra over *when*, and nothing in
+ * them has an opinion about values. {@link overlay} is where an opinion is
+ * needed, and it is handed one rather than choosing.
  */
-import { compareStarts } from "./interval.js";
+import { compareEnds, compareStarts, earlierEnd } from "./interval.js";
 import { peekable } from "./stream.js";
 /**
- * One ascending stream from many.
+ * Two streams laid over one another, with `merge` settling the overlap.
  *
- * The sources are disjoint by construction — a moment is won by exactly one
- * layer — so this only has to take whichever starts earliest, with none of the
- * overlap arithmetic the interval sweeps need.
+ * Where only one covers a moment, its value comes through. Where both do, the
+ * two values go to `merge`, `under` first. Where neither does, the moment is
+ * absent, the same as everywhere else in the library.
+ *
+ * It walks both fronts and cuts whichever runs on at the other's boundary, so
+ * it pulls only as far as the next piece of the answer and stays lazy over
+ * endless sources.
+ *
+ * Output is not coalesced. Cutting at every boundary splits runs carrying the
+ * same value on both sides, and {@link coalesce} over the top puts them back.
+ * Teaching this sweep to look ahead instead would buy nothing.
  */
-export function* interleave(sources) {
-    const fronts = sources.map((source) => peekable(source));
+export function* overlay(under, over, merge) {
+    const a = peekable(under);
+    const b = peekable(over);
+    // What is left of each front interval. A stretch already yielded is cut off
+    // the front rather than yielded twice, which is what keeps this to one pass
+    // over sources that can only be read forwards.
+    let restA = a.peek();
+    let restB = b.peek();
     for (;;) {
-        let earliest;
-        let from;
-        for (const front of fronts) {
-            const next = front.peek();
-            if (next !== undefined &&
-                (earliest === undefined ||
-                    compareStarts(next.start, earliest.start) < 0)) {
-                earliest = next;
-                from = front;
+        if (restA === undefined || restB === undefined) {
+            yield* remainder(restA ?? restB, restA === undefined ? b : a);
+            return;
+        }
+        const order = compareStarts(restA.start, restB.start);
+        if (order === 0) {
+            // Both cover the stretch up to whichever ends first, and that stretch is
+            // the only place `merge` is ever called.
+            const end = earlierEnd(restA.end, restB.end);
+            yield { start: restA.start, end, value: merge(restA.value, restB.value) };
+            const cutA = cut(restA, end, a);
+            restB = cut(restB, end, b);
+            restA = cutA;
+            continue;
+        }
+        // One of them starts first and holds alone until the other begins. Its own
+        // end may come first, in which case the whole of it stands alone.
+        if (order < 0) {
+            const boundary = restB.start;
+            if (compareEnds(restA.end, boundary) <= 0) {
+                yield restA;
+                a.drop();
+                restA = a.peek();
+                continue;
             }
+            yield { start: restA.start, end: boundary, value: restA.value };
+            restA = { ...restA, start: boundary };
+            continue;
+        }
+        const boundary = restA.start;
+        if (compareEnds(restB.end, boundary) <= 0) {
+            yield restB;
+            b.drop();
+            restB = b.peek();
+            continue;
         }
-        if (from === undefined || earliest === undefined) {
+        yield { start: restB.start, end: boundary, value: restB.value };
+        restB = { ...restB, start: boundary };
+    }
+}
+/**
+ * Whatever is left of one side once the other is spent, beginning with the
+ * piece already in hand.
+ *
+ * That piece may have been cut short, so it is yielded from the local rather
+ * than read again from the source, and the source's own copy of it dropped.
+ */
+function* remainder(held, source) {
+    if (held === undefined) {
+        return;
+    }
+    yield held;
+    source.drop();
+    for (;;) {
+        const next = source.peek();
+        if (next === undefined) {
             return;
         }
-        from.drop();
-        yield earliest;
+        source.drop();
+        yield next;
+    }
+}
+/**
+ * What is left of an interval once the stretch up to `end` has been yielded.
+ *
+ * An interval used up entirely is dropped and the next one pulled, so the
+ * front always holds something still to yield.
+ */
+function cut(interval, end, source) {
+    if (end === undefined || compareEnds(interval.end, end) <= 0) {
+        source.drop();
+        return source.peek();
     }
+    return { ...interval, start: end };
 }
 /**
  * Adjacent intervals carrying the same value are one interval.

package/dist/valued-stream.js.map

@@ -1 +1 @@
-{"version":3,"file":"valued-stream.js","sourceRoot":"","sources":["../src/valued-stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAYvC;;;;;;GAMG;AACH,MAAM,SAAS,CAAC,CAAC,UAAU,CACzB,OAAmC;IAEnC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzD,SAAS,CAAC;QACR,IAAI,QAA+B,CAAC;QACpC,IAAI,IAAyC,CAAC;QAE9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1B,IACE,IAAI,KAAK,SAAS;gBAClB,CAAC,QAAQ,KAAK,SAAS;oBACrB,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAChD,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjD,OAAO;QACT,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,QAAQ,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAI,MAAuB;IAClD,IAAI,IAA2B,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,CAAC;YACZ,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAC7D,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS;QACX,CAAC;QACD,MAAM,IAAI,CAAC;QACX,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IAED,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,CAAC;IACb,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,SAAS,OAAO,CAAC,IAAqB,EAAE,IAAqB;IAC3D,OAAO,CACL,IAAI,CAAC,GAAG,KAAK,SAAS;QACtB,IAAI,CAAC,KAAK,KAAK,SAAS;QACxB,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAC3D,CAAC;AACJ,CAAC"}
+{"version":3,"file":"valued-stream.js","sourceRoot":"","sources":["../src/valued-stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAEvE,OAAO,EAAiB,QAAQ,EAAE,MAAM,aAAa,CAAC;AAYtD;;;;;;;;;;;;;;GAcG;AACH,MAAM,SAAS,CAAC,CAAC,OAAO,CACtB,KAAsB,EACtB,IAAqB,EACrB,KAAe;IAEf,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEzB,4EAA4E;IAC5E,4EAA4E;IAC5E,+CAA+C;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACrB,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAErB,SAAS,CAAC;QACR,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC/C,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,OAAO;QACT,CAAC;QAED,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAEtD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,yEAAyE;YACzE,yCAAyC;YACzC,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1E,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAChC,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,GAAG,IAAI,CAAC;YACb,SAAS;QACX,CAAC;QAED,2EAA2E;QAC3E,kEAAkE;QAClE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;YAC7B,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,MAAM,KAAK,CAAC;gBACZ,CAAC,CAAC,IAAI,EAAE,CAAC;gBACT,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChE,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;YACtC,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;QAC7B,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,KAAK,CAAC;YACZ,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACjB,SAAS;QACX,CAAC;QACD,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QAChE,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,QAAQ,CAAC,CAAC,SAAS,CACjB,IAA2B,EAC3B,MAA2B;IAE3B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO;IACT,CAAC;IACD,MAAM,IAAI,CAAC;IACX,MAAM,CAAC,IAAI,EAAE,CAAC;IAEd,SAAS,CAAC;QACR,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QACD,MAAM,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,IAAI,CAAC;IACb,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,GAAG,CACV,QAAmB,EACnB,GAAuC,EACvC,MAA2B;IAE3B,IAAI,GAAG,KAAK,SAAS,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7D,MAAM,CAAC,IAAI,EAAE,CAAC;QACd,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IACD,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,SAAS,CAAC,CAAC,QAAQ,CAAI,MAAuB;IAClD,IAAI,IAA2B,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,CAAC;YACZ,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAC7D,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS;QACX,CAAC;QACD,MAAM,IAAI,CAAC;QACX,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IAED,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,CAAC;IACb,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,SAAS,OAAO,CAAC,IAAqB,EAAE,IAAqB;IAC3D,OAAO,CACL,IAAI,CAAC,GAAG,KAAK,SAAS;QACtB,IAAI,CAAC,KAAK,KAAK,SAAS;QACxB,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAC3D,CAAC;AACJ,CAAC"}

package/package.json

@@ -1,8 +1,11 @@
 {
   "name": "@kensio/quando",
-  "version": "0.2.0",
+  "version": "1.0.0",
   "description": "Declarative temporal rules for schedules, deadlines, constraints, and exceptions",
-  "repository": "https://github.com/KensioSoftware/quando",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/KensioSoftware/quando"
+  },
   "homepage": "https://quandojs.dev",
   "bugs": "https://github.com/KensioSoftware/quando/issues",
   "main": "./dist/index.js",
@@ -23,25 +26,11 @@
   "imports": {
     "#test/*": "./test/*"
   },
-  "packageManager": "pnpm@11.21.0+sha512.521705bce689924eac72f5a3587122f362689ef6571e55ba80076fd637c11132ecffada26fad4ea79c485bfddbfd3d5a2a5b05805a77e893de71ec8a6cca3bb1",
   "engines": {
     "node": ">=26.0.0"
   },
-  "scripts": {
-    "build": "rm -rf dist && tsc -p tsconfig.build.json",
-    "prepack": "pnpm build",
-    "build:check": "tsc -p tsconfig.json --noEmit",
-    "fmt": "oxlint --fix . && oxfmt .",
-    "lint": "oxlint . && oxfmt --check .",
-    "lint:ci": "oxlint --format=github . && oxfmt --check .",
-    "docs:check": "./scripts/sh/docs-check.sh",
-    "fta": "./scripts/sh/fta.sh",
-    "test": "vitest run",
-    "test:coverage": "vitest run --coverage",
-    "pack:check": "./scripts/sh/pack-check.sh",
-    "check": "pnpm fmt && pnpm docs:check && pnpm fta && pnpm build:check && pnpm pack:check && pnpm test:coverage"
-  },
   "devDependencies": {
+    "@faker-js/faker": "^10.6.0",
     "@kensio/smartass": "^1.33.0",
     "@semantic-release/exec": "7.1.0",
     "@types/node": "^26.0.0",
@@ -49,7 +38,7 @@
     "@vitest/coverage-v8": "^4.1.10",
     "conventional-changelog-conventionalcommits": "9.3.1",
     "fta-cli": "^3.0.0",
-    "oxfmt": "^0.62.0",
+    "oxfmt": "^0.65.0",
     "oxlint": "^1.77.0",
     "oxlint-tsgolint": "^7.0.2001",
     "semantic-release": "25.0.9",
@@ -67,5 +56,18 @@
   },
   "author": "Kensio Software",
   "license": "Apache-2.0",
-  "type": "module"
-}
+  "type": "module",
+  "scripts": {
+    "build": "rm -rf dist && tsc -p tsconfig.build.json",
+    "build:check": "tsc -p tsconfig.json --noEmit",
+    "fmt": "oxlint --fix . && oxfmt .",
+    "lint": "oxlint . && oxfmt --check .",
+    "lint:ci": "oxlint --format=github . && oxfmt --check .",
+    "docs:check": "./scripts/sh/docs-check.sh",
+    "fta": "./scripts/sh/fta.sh",
+    "test": "vitest run",
+    "test:coverage": "vitest run --coverage",
+    "pack:check": "./scripts/sh/pack-check.sh",
+    "check": "pnpm fmt && pnpm docs:check && pnpm fta && pnpm build:check && pnpm pack:check && pnpm test:coverage"
+  }
+}