@wardic/solid 0.0.0-stage → 1.0.0-rc.2

package/dist/server/appear.js

@@ -0,0 +1,727 @@
+import * as Easing from "@wardic/core/Easing";
+import * as Machine from "@wardic/core/Machine";
+import * as Appear from "@wardic/dom/Appear";
+import * as DomDefaultTransition from "@wardic/dom/DomDefaultTransition";
+import * as DomPositionalKeys from "@wardic/dom/DomPositionalKeys";
+import * as OwnValues from "@wardic/dom/OwnValues";
+import * as Arr from "effect/Array";
+import * as Bool from "effect/Boolean";
+import * as Effect from "effect/Effect";
+import { identity } from "effect/Function";
+import * as Match from "effect/Match";
+import * as Option from "effect/Option";
+import * as Order from "effect/Order";
+import * as Predicate from "effect/Predicate";
+import * as Rec from "effect/Record";
+import * as Result from "effect/Result";
+import * as UndefinedOr from "effect/UndefinedOr";
+import { entriesOf, keyframesFrom, legsOf, NO_VELOCITY, runOf, transitionForKey } from "./retarget-legs.js";
+import { withServerInterpolators } from "./server-interpolators.js";
+import { childDelayOf } from "./variant-tree.js";
+/** What stands in for a function with no easing name: canonical text holding it is no key. */
+const UNNAMED = "\u0000unnamed";
+/**
+ * A value as canonical text: JSON with each object's keys in order, `undefined`s left out, and a
+ * function by its easing name (`Easing.nameOf`), else {@link UNNAMED}. Written directly, its cases
+ * built once at module load: it runs per element (#69's PR 2).
+ */
+const textOf = /*#__PURE__*/Match.type().pipe(Match.when(Predicate.isFunction, fn => Option.match(Easing.nameOf(fn), {
+  onNone: () => UNNAMED,
+  onSome: easing => `{"easing":${JSON.stringify(easing)}}`
+})), Match.when(Arr.isArray, items => `[${Arr.map(items, item => textOf(item)).join(",")}]`), Match.when(Predicate.isObject, record => {
+  const keys = Arr.sort(Arr.filter(Object.keys(record), key => Predicate.isNotUndefined(record[key])), Order.String);
+  return `{${Arr.map(keys, key => `${JSON.stringify(key)}:${textOf(record[key])}`).join(",")}}`;
+}), Match.orElse(v => String(JSON.stringify(v))));
+/** Where a Path's key samples it (#438): nine points, its ends among them. */
+const PATH_SAMPLES = [0, 0.125, 0.25, 0.375, 0.5, 0.625, 0.75, 0.875, 1];
+/** An axis's number in `values`, its identity 0 when it has none (#438), as the leg reads it on a server. */
+const axisIn = (values, key) => UndefinedOr.match(values[key], {
+  onUndefined: () => 0,
+  onDefined: v => Number(v)
+});
+/**
+ * A mount animation's transition as its key holds it: a Path (#438), a function, as its samples
+ * between the mount's ends, so two paths key apart and one path keys the same each time. Sampling it
+ * again is safe: an arc's memory of its side changes only with the way it travels.
+ */
+const keyedTransitionOf = m => UndefinedOr.match(m.transition, {
+  onUndefined: () => null,
+  onDefined: t => UndefinedOr.match(t.path, {
+    onUndefined: () => t,
+    onDefined: path => {
+      const from = {
+        x: axisIn(m.from, "x"),
+        y: axisIn(m.from, "y")
+      };
+      const at = path(from, {
+        x: UndefinedOr.match(m.to.x, {
+          onUndefined: () => from.x,
+          onDefined: Number
+        }),
+        y: UndefinedOr.match(m.to.y, {
+          onUndefined: () => from.y,
+          onDefined: Number
+        })
+      });
+      return {
+        ...t,
+        path: Arr.map(PATH_SAMPLES, p => at(p))
+      };
+    }
+  })
+});
+/** A value as canonical text; `None` when a function in it has no easing name. */
+const canonical = value => Option.filter(Option.some(textOf(value)), text => Bool.not(text.includes(UNNAMED)));
+/** Each mount animation's canonical starts, targets and transition, by its `from`: both its plays share one. */
+// Module state (#460, Q7): a cache held weakly by the object it's for, so it goes with it.
+const baseKeys = /*#__PURE__*/new WeakMap();
+/**
+ * The mount animation's key: its starts, targets and transition as one canonical text, and whether
+ * motion is reduced. `None` when the transition holds a function with no easing name
+ * (`Easing.nameOf`): the server can't tell it from another, so the element keeps its Starting style.
+ */
+export const keyOf = m => {
+  const base = Option.getOrElse(Option.fromUndefinedOr(baseKeys.get(m.from)), () => {
+    const computed = canonical({
+      from: m.from,
+      to: m.to,
+      transition: keyedTransitionOf(m),
+      stops: m.stops
+    });
+    baseKeys.set(m.from, computed);
+    return computed;
+  });
+  // A skipped one's (#468) named apart: an unskipped one's name is as it was.
+  return Option.map(base, text => Bool.match(m.skipped === true, {
+    onTrue: () => `${text}|skipped`,
+    onFalse: () => `${text}|reduced:${m.reduced}`
+  }));
+};
+/** Whether a mount animation plays for ever: its transition repeats for ever, and it isn't skipped (#468), which lands it. */
+const playsForever = m => Bool.and(m.skipped !== true, repeatsForever(m.transition));
+/** Whether a transition repeats for ever: a tween's `repeat: Infinity`, a tween as it runs (ADR-0051). */
+export const repeatsForever = transition => UndefinedOr.match(runOf(transition), {
+  onUndefined: () => false,
+  onDefined: run => Bool.and(run.type === "tween", run.repeat === Number.POSITIVE_INFINITY)
+});
+/** A transition's own delay, 0 without one. */
+const ownDelayOf = transition => UndefinedOr.match(transition, {
+  onUndefined: () => 0,
+  onDefined: ({
+    delay = 0
+  }) => delay
+});
+/**
+ * The seconds a rule holds before it moves, of the delay the client counts: a transition's own
+ * delay is in its rule, except a forever-repeating one's, whose rule is a cycle and whose own delay
+ * goes in `animation-delay` with the stagger.
+ */
+const heldInRule = transition => Bool.match(repeatsForever(transition), {
+  onTrue: () => 0,
+  onFalse: () => ownDelayOf(transition)
+});
+/**
+ * The transition a server samples: as given, but for one that repeats for ever, two runs and the
+ * delay that follows them, with no delay before (one cycle of the CSS, played `infinite`). Two
+ * runs, so a cycle is exact for every `repeatType`, `reverse` and `mirror` included.
+ */
+const sampledTransition = transition => Bool.match(repeatsForever(transition), {
+  onTrue: () => ({
+    ...transition,
+    delay: 0,
+    repeat: 1
+  }),
+  onFalse: () => transition
+});
+/**
+ * One machine of a Retarget's legs, run together: each step steps every leg not yet settled, and
+ * merges their values; it settles with the last. What a server samples. Built with the DOM's
+ * Interpolators (a server projects with the DOM's `project`, ADR-0021 decision 2).
+ */
+const together = legs => {
+  const machines = Effect.runSync(withServerInterpolators(Effect.all(Arr.map(legs, leg => machineOfLeg(leg)))));
+  return Machine.make({
+    settles: true,
+    span: {
+      name: "wardic.appear",
+      attributes: {
+        legs: legs.length
+      }
+    },
+    start: () => {
+      const runs = Arr.map(machines, (machine, i) => ({
+        step: machine.start(),
+        key: keyOfLeg(legs[i]),
+        last: Option.none()
+      }));
+      return dt => {
+        const value = {};
+        const done = Arr.reduce(runs, true, (all, run) => {
+          const frame = Option.getOrElse(Option.filter(run.last, last => last.done), () => run.step(dt));
+          run.last = Option.some(frame);
+          Option.match(run.key, {
+            onNone: () => Object.assign(value, frame.value),
+            onSome: key => Object.assign(value, {
+              [key]: frame.value
+            })
+          });
+          return Bool.and(all, frame.done);
+        });
+        return {
+          value,
+          done
+        };
+      };
+    }
+  });
+};
+/** A leg's machine, built: a Blend's through the Interpolators `together` provides. */
+const machineOfLeg = leg => Bool.match(leg._tag === "Blend", {
+  onTrue: () => leg.machine(),
+  onFalse: () => Effect.sync(() => leg.machine())
+});
+/** The key a Follow leg's single value is: its own. */
+const keyOfLeg = leg => Bool.match(leg._tag === "Follow", {
+  onTrue: () => Option.some(leg.key),
+  onFalse: () => Option.none()
+});
+/** The DOM's Positional keys, which a server's reduced rule snaps (ADR-0029, ADR-0036). */
+const DOM_POSITIONAL = {
+  isPositional: DomPositionalKeys.isPositional
+};
+/** The DOM's Default transition, which a key with no transition defined samples as the client runs it (ADR-0051). */
+const DOM_DEFAULTS = {
+  transitionFor: DomDefaultTransition.transitionFor,
+  keyframes: DomDefaultTransition.keyframes
+};
+/**
+ * Whether a value's own transition drives one of its keys while anything repeats for ever (#301): one
+ * CSS cycle can't hold a key that stops beside one that repeats, nor two cycles' lengths. With every
+ * key on the transition's own fields (a `layout` entry alone), it plays as before.
+ */
+const foreverByValue = m => {
+  const entries = entriesOf(m.transition);
+  if (Predicate.isUndefined(entries)) return false;
+  const runsOn = Arr.map(Rec.keys(m.to), key => transitionForKey(m.transition, key));
+  if (Arr.every(runsOn, transition => transition === entries.own)) return false;
+  return Bool.or(repeatsForever(m.transition), Arr.some(runsOn, repeatsForever));
+};
+/** A mount animation's spec for the DOM's sampler, or why it has none. */
+export const specOf = m => Option.match(keyOf(m), {
+  onNone: () => Result.fail("its transition holds a function with no easing name"),
+  onSome: key => {
+    const skipped = m.skipped === true;
+    if (Bool.and(Bool.not(skipped), foreverByValue(m))) return Result.fail("a value's own transition repeats for ever beside another");
+    const forever = playsForever(m);
+    const transition = Bool.match(skipped, {
+      onTrue: () => m.transition,
+      onFalse: () => sampledTransition(m.transition)
+    });
+    const repeatDelay = UndefinedOr.match(m.transition, {
+      onUndefined: () => 0,
+      onDefined: t => Option.getOrElse(Option.fromUndefinedOr(t.repeatDelay), () => 0)
+    });
+    return Result.succeed({
+      key,
+      tag: m.tag,
+      infinite: forever,
+      projected: m.layout,
+      template: m.template,
+      // Skipped (#468): every key's snap, landing on its first frame, a rule of 0 s.
+      machine: () => Bool.match(forever, {
+        onTrue: () => Machine.holdAfter(together(legsOf(m.from, m.to, transition, m.reduced, skipped, DOM_POSITIONAL, DOM_DEFAULTS, NO_VELOCITY, undefined, m.stops)), repeatDelay),
+        onFalse: () => together(legsOf(m.from, m.to, transition, m.reduced, skipped, DOM_POSITIONAL, DOM_DEFAULTS, NO_VELOCITY, undefined, m.stops))
+      })
+    });
+  }
+});
+/**
+ * Why a mount animation can't play before hydration, or `None` when it can (decision 4): a key
+ * starting from anything but `initial`, a value the DOM reads from the element (`auto`, `var()`),
+ * or a start that can't take its target's shape (a length pair in two units).
+ */
+export const unplayable = (initial, to) => Arr.findFirst(Rec.toEntries(to), ([key, target]) => Option.match(Option.fromUndefinedOr(initial[key]), {
+  onNone: () => Option.some(`${key} starts from the element's own value (no initial)`),
+  onSome: start => Bool.match(Bool.or(readsElement(start), readsElement(target)), {
+    onTrue: () => Option.some(`${key} is a value the DOM reads from the element`),
+    onFalse: () =>
+    // A start that can't take its target's shape, a length in another unit among them (ADR-0024).
+    Bool.match(Option.isNone(OwnValues.valueLike(start, target)), {
+      onTrue: () => Option.some(`${key}'s start and target don't take one shape`),
+      onFalse: () => Option.none()
+    })
+  })
+}));
+/** Whether a value is one the DOM reads from the element: `auto`, or a custom property. */
+const readsElement = value => Predicate.isString(value) && /\bauto\b|var\(/.test(value);
+/** Whether an `initial` value, coerced to its target's shape, is that target: its key starts no leg (#448). */
+const atTarget = (start, target) => Option.exists(OwnValues.valueLike(start, target), like => like === target);
+/** No transition: no orchestration. */
+const NO_TRANSITION = {};
+/** An element's reduced motion (#434): its nearest config's, else the provider's. */
+const settingOr = (setting, provider) => {
+  if (Predicate.isNotUndefined(setting)) return setting;
+  return provider;
+};
+/**
+ * An element's plays under its reduced motion (#434): `"always"` plays its reduced one in both
+ * settings, `"never"` its normal one, and `"user"` each in its own, the reduced under the media query.
+ */
+const playsUnder = (plays, setting) => {
+  if (setting === "always") return {
+    normal: plays.reduced,
+    reduced: plays.reduced
+  };
+  if (setting === "never") return {
+    normal: plays.normal,
+    reduced: plays.normal
+  };
+  return plays;
+};
+/** Whether an entry follows the user's preference (#434). */
+const isUser = entry => entry.user;
+/**
+ * What a provider's `appear` explains with (#585): with `"explain"`, a Warning for each element that
+ * waits for the JavaScript, logged as the render finds it with Effect's own logger, since a server
+ * builds no runtime from the app's `env`; nothing otherwise.
+ */
+export const explainerOf = appear => {
+  if (appear !== "explain") return undefined;
+  return message => Effect.runSync(Effect.logWarning(message));
+};
+/** An element as the provider's explanation names it (#585): its tag and the keys its mount animates. */
+const nameOf = entry => {
+  const element = UndefinedOr.match(entry.tag, {
+    onUndefined: () => "an element",
+    onDefined: tag => `<${tag}>`
+  });
+  return Option.match(entry.to, {
+    onNone: () => element,
+    onSome: to => `${element} (${Rec.keys(to).join(", ")})`
+  });
+};
+/**
+ * A server render's Appear animations, for a provider whose reduced motion is `reducedMotion`. With
+ * `explain` (the provider's `appear="explain"`, #585), it says why each element that doesn't play
+ * waits for the JavaScript, as it finds out; without it, nothing is kept or said.
+ */
+export const serverAppear = (reducedMotion, explain, nonce) => {
+  const sheet = Appear.sheet();
+  const entries = [];
+  /** Says why `entry` waits for the JavaScript, when the provider explains. */
+  const waits = (entry, reason) => {
+    if (Predicate.isNotUndefined(explain)) explain(`wardic.appear: ${nameOf(entry)} waits for the JavaScript: ${reason}`);
+  };
+  // The shell is flushed once the head's CSS is asked for: what enters after is late (#245).
+  let flushed = false;
+  // The entries written so far, and how deep the render is in late elements.
+  let written = 0;
+  let lateDepth = 0;
+  /** The entries since the last write, now written. */
+  const nextBatch = () => {
+    const batch = entries.slice(written);
+    written = entries.length;
+    return batch;
+  };
+  /** A batch's timing, each slot defined, and the sheet's CSS for them (decision 5). */
+  const write = batch => {
+    // Each entry's plays are its own setting's (#434): the normal ones always, the reduced ones under
+    // the media query when an entry follows the user.
+    const resolve = pick => timings(batch, pick);
+    const normal = resolve("normal");
+    const reduced = Bool.match(Arr.some(batch, isUser), {
+      onTrue: () => Option.some(resolve("reduced")),
+      onFalse: () => Option.none()
+    });
+    const settings = Arr.prepend(Option.toArray(reduced), normal);
+    // Most renders write no SVG geometry: no group pass.
+    const supports = Bool.match(Arr.some(settings, byEntry => byEntry.geometry), {
+      onTrue: () => groupSupports(batch, settings),
+      onFalse: () => () => NO_SUPPORTS
+    });
+    Arr.forEach(batch, entry => Option.map(entry.slot, slot => {
+      const play = UndefinedOr.getOrThrow(normal.get(entry));
+      const reducedPlay = Option.map(Option.filter(reduced, () => entry.user), byEntry => UndefinedOr.getOrThrow(byEntry.get(entry)));
+      const defined = Result.flatMap(play, p => Option.match(reducedPlay, {
+        onNone: () => slot.define(p, undefined, supports(entry)),
+        onSome: r => Result.flatMap(r, rp => slot.define(p, rp, supports(entry)))
+      }));
+      Result.match(defined, {
+        onFailure: reason => waits(entry, reason),
+        onSuccess: () => undefined
+      });
+    }));
+    return sheet.css();
+  };
+  const plays = animation => Bool.or(Option.exists(animation.normal, Result.isSuccess), Option.exists(animation.reduced, Result.isSuccess));
+  const chunkCss = () => write(nextBatch());
+  return {
+    reducedMotion,
+    enter: (given, group, setting, skipped, tag, to) => {
+      // Skipped (#468): its one play in both slots, under no media query.
+      const own = Bool.match(skipped, {
+        onTrue: () => "never",
+        onFalse: () => settingOr(setting, reducedMotion)
+      });
+      const animation = playsUnder(given, own);
+      const slot = Option.liftPredicate(animation, plays).pipe(Option.map(() => sheet.slot()));
+      const entry = {
+        plays: animation,
+        slot,
+        group,
+        vetoes: [],
+        user: own === "user",
+        skipped,
+        tag,
+        to
+      };
+      // Why it plays neither: its normal play's reason, its reduced one's when that differs (#585).
+      if (Predicate.isNotUndefined(explain)) {
+        const reasons = Arr.dedupe(Arr.flatMap([animation.normal, animation.reduced], play => Option.toArray(Option.flatMap(play, p => Result.getFailure(p)))));
+        Arr.forEach(reasons, reason => waits(entry, reason));
+      }
+      entries.push(entry);
+      Option.map(group, g => g.children.push(entry));
+      return {
+        entry,
+        animation: Option.map(slot, s => s.animation),
+        late: flushed,
+        chunkRoot: Bool.and(flushed, lateDepth === 0)
+      };
+    },
+    within: (late, render) => {
+      // Per element on a server: a guard, no allocation.
+      if (Bool.not(late)) return render();
+      lateDepth++;
+      try {
+        return render();
+      } finally {
+        lateDepth--;
+      }
+    },
+    chunkCss,
+    chunk: () => Appear.chunkStyle(chunkCss(), nonce),
+    nonce,
+    group: (leader, transition) => {
+      const {
+        staggerChildren = 0,
+        delayChildren = 0,
+        from = "first",
+        staggerDirection = 1,
+        when
+      } = UndefinedOr.match(transition, {
+        onUndefined: () => NO_TRANSITION,
+        onDefined: t => t
+      });
+      return {
+        leader,
+        stagger: {
+          amount: staggerChildren,
+          delayChildren,
+          from,
+          direction: staggerDirection
+        },
+        when,
+        children: []
+      };
+    },
+    css: () => {
+      flushed = true;
+      return write(nextBatch());
+    }
+  };
+};
+/**
+ * Each entry's play for one motion setting: its spec and its delay, or why it has none. A Variant
+ * child starts after its stagger (`delayChildren` plus its place, ADR-0007), and after its parent
+ * settles under `when: "beforeChildren"`; a parent under `"afterChildren"` starts once its last
+ * child settles. A start that depends on an element with no rule has none.
+ *
+ * Timed a batch at a time (#245): the shell's, then each late chunk's, whose CSS starts when the
+ * chunk lands. A late Variant child of a group led earlier is a fresh mount from then: its stagger
+ * is among that group's children in its batch, and it doesn't wait on the leader (decision 5 of
+ * *Amendment (#245)*). The shell's batch is every entry, so nothing changes for it.
+ */
+const timings = (entries, pick) => {
+  const memo = new Map();
+  let geometry = false;
+  const inBatch = new Set(entries);
+  // Each group's children in this batch, once a group.
+  const batchChildren = new Map();
+  const childrenOf = g => Option.getOrElse(Option.fromUndefinedOr(batchChildren.get(g)), () => {
+    const children = Arr.filter(g.children, child => inBatch.has(child));
+    batchChildren.set(g, children);
+    return children;
+  });
+  /** An entry's spec and rule, or why it has none; a missing play (nothing animates) is a rule of 0 s. */
+  const ruleOf = entry => Arr.match(entry.vetoes, {
+    onNonEmpty: vetoes => Result.fail(vetoes.join("; ")),
+    onEmpty: () => playOf(entry)
+  });
+  const playOf = entry => Option.match(entry.plays[pick], {
+    onNone: () => Result.succeed(Option.none()),
+    onSome: animation => Result.flatMap(Result.flatMap(animation, specOf), spec => Result.map(Appear.keyframes(spec), rule => Option.some({
+      spec,
+      rule
+    })))
+  });
+  /** The seconds from first paint to when `entry` starts, and its play. */
+  const timingOf = entry => Option.getOrElse(Option.fromUndefinedOr(memo.get(entry)), () => {
+    const computed = Result.flatMap(ruleOf(entry), rule => Result.map(startOf(entry), start => {
+      const spec = Option.match(rule, {
+        onNone: () => undefined,
+        onSome: r => r.spec
+      });
+      // A forever-repeating rule is a cycle: its own delay plays before it, and it never settles.
+      const mount = Option.match(entry.plays[pick], {
+        onNone: () => undefined,
+        onSome: p => Result.match(p, {
+          onFailure: () => undefined,
+          onSuccess: identity
+        })
+      });
+      const transition = UndefinedOr.map(mount, m => m.transition);
+      const forever = UndefinedOr.match(mount, {
+        onUndefined: () => false,
+        onDefined: playsForever
+      });
+      const before = Bool.match(forever, {
+        onTrue: () => ownDelayOf(transition),
+        onFalse: () => 0
+      });
+      const settled = Option.match(rule, {
+        onNone: () => 0,
+        onSome: r => Bool.match(forever, {
+          onTrue: () => Number.POSITIVE_INFINITY,
+          onFalse: () => r.rule.settled
+        })
+      });
+      const supports = Option.match(rule, {
+        onNone: () => NO_SUPPORTS,
+        onSome: r => r.rule.supports
+      });
+      geometry = Bool.or(geometry, Arr.isReadonlyArrayNonEmpty(supports));
+      return {
+        play: {
+          spec: spec,
+          delay: start + before,
+          supports
+        },
+        settled: start + before + settled
+      };
+    }));
+    memo.set(entry, computed);
+    return computed;
+  });
+  /** When `entry` starts: its stagger, after its parent under `beforeChildren`, after its children under `afterChildren`. */
+  const startOf = entry => Result.flatMap(afterParent(entry), afterLeader => Result.map(afterChildren(entry), afterKids => Math.max(afterLeader, afterKids) + ownStaggerOf(entry, childrenOf)));
+  // A leader written earlier started at first paint: a late child doesn't wait on it.
+  const afterParent = entry => Option.match(Option.filter(entry.group, g => Bool.and(g.when === "beforeChildren", inBatch.has(g.leader))), {
+    onNone: () => Result.succeed(0),
+    onSome: g => Result.flatMap(Result.mapError(Result.map(timingOf(g.leader), t => t.settled), reason => `its parent has no rule (${reason})`), settled => Bool.match(Number.isFinite(settled), {
+      onTrue: () => Result.succeed(settled),
+      onFalse: () => Result.fail("its parent never settles")
+    }))
+  });
+  const afterChildren = entry => Option.match(Option.fromUndefinedOr(groupsLed.get(entry)), {
+    onNone: () => Result.succeed(0),
+    onSome: g => Bool.match(g.when === "afterChildren", {
+      onFalse: () => Result.succeed(0),
+      onTrue: () => Result.mapError(Result.map(Result.all(Arr.map(childrenOf(g), timingOf)), kids => Arr.reduce(kids, 0, (latest, t) => Math.max(latest, t.settled))), reason => `a child has no rule (${reason})`)
+    })
+  });
+  const groupsLed = new Map();
+  Arr.forEach(entries, entry => Option.map(entry.group, g => groupsLed.set(g.leader, g)));
+  const plays = new Map(Arr.map(entries, entry => [entry, Result.flatMap(timingOf(entry), t => Bool.match(Predicate.isUndefined(t.play.spec), {
+    onTrue: () => Result.fail("nothing animates"),
+    onFalse: () => Result.succeed(t.play)
+  }))]));
+  return Object.assign(plays, {
+    geometry
+  });
+};
+const NO_SUPPORTS = [];
+/**
+ * The SVG geometry properties each entry's orchestrated group writes, over every play (#245,
+ * `Appear.Keyframes.supports`): the whole tree a top leader orchestrates is defined under one
+ * `@supports`, so a browser without them keeps all of it at its Starting style, not part of it
+ * (decision 4: an element qualifies whole, and so does what it orchestrates). Per element on a
+ * server: a render whose rules write none (most) pays a look at each play.
+ */
+const groupSupports = (entries, settings) => {
+  /** The leader at the top of an entry's orchestration: itself, outside any group. */
+  const topOf = entry => Option.match(entry.group, {
+    onNone: () => entry,
+    onSome: g => topOf(g.leader)
+  });
+  /** What an entry's own rules write, over every play. */
+  const own = entry => Arr.flatMap(settings, byEntry => Option.match(Option.fromUndefinedOr(byEntry.get(entry)), {
+    onNone: () => NO_SUPPORTS,
+    onSome: play => Result.match(play, {
+      onFailure: () => NO_SUPPORTS,
+      onSuccess: p => p.supports
+    })
+  }));
+  const byTop = new Map();
+  Arr.forEach(entries, entry => Arr.match(own(entry), {
+    onEmpty: () => undefined,
+    onNonEmpty: mine => {
+      const top = topOf(entry);
+      byTop.set(top, Arr.appendAll(Option.getOrElse(Option.fromUndefinedOr(byTop.get(top)), () => NO_SUPPORTS), mine));
+    }
+  }));
+  return entry => Bool.match(byTop.size === 0, {
+    onTrue: () => NO_SUPPORTS,
+    onFalse: () => Option.getOrElse(Option.fromUndefinedOr(byTop.get(topOf(entry))), () => NO_SUPPORTS)
+  });
+};
+/** An entry's own stagger: none when it's skipped (#468), as its client's snap has no delay; its `when` waits still hold. */
+const ownStaggerOf = (entry, childrenOf) => {
+  if (entry.skipped) return 0;
+  return staggerOf(entry, childrenOf);
+};
+/**
+ * A Variant child's stagger: its parent's `delayChildren` plus its place (ADR-0007), as the client
+ * works it out, among the group's children in its batch (`childrenOf`, #245).
+ */
+const staggerOf = (entry, childrenOf) => Option.match(entry.group, {
+  onNone: () => 0,
+  onSome: g => {
+    const children = childrenOf(g);
+    const n = children.length;
+    const i = children.indexOf(entry);
+    return childDelayOf(g.stagger, i, n);
+  }
+});
+/**
+ * An element's entry in a server render's Appear animations: its inline `animation` when it plays
+ * one, and the group its Variant children join when it leads one.
+ */
+export const enterServer = (appear, el) => {
+  // Its starts and targets once, both plays sharing them (and so their key's text, `keyOf`). A key
+  // already at its target, coerced to its shape, is left out, as the client's first Retarget starts
+  // it no leg (#448); a Keyframes key never is, and starts at its first stop, unless the mount starts
+  // at its `animate`, when nothing plays (#429, Motion's).
+  const mount = Option.flatMap(el.to, to => {
+    const moving = Rec.filter(to, (target, key) => Bool.match(hasStops(el.keyframes, key), {
+      onTrue: () => Bool.not(el.quiet),
+      onFalse: () => Bool.not(atTarget(el.initial[key], target))
+    }));
+    return Bool.match(Rec.isEmptyRecord(moving), {
+      onTrue: () => Option.none(),
+      onFalse: () => Option.some(Result.map(playable(el, moving), prepared => startedOf(prepared, el.keyframes)))
+    });
+  });
+  // Skipped (#468): its config's, or its whole transition's own, as the client's legs read them.
+  const skipped = Bool.or(el.skipAnimations === true, UndefinedOr.match(el.transition, {
+    onUndefined: () => false,
+    onDefined: t => t.skipAnimations === true
+  }));
+  const play = reduced => Option.map(mount, prepared => Result.map(prepared, ({
+    from,
+    to,
+    stops
+  }) => ({
+    tag: el.tag,
+    from,
+    to,
+    transition: el.transition,
+    reduced,
+    layout: el.layout,
+    stops,
+    ...skippedField(skipped),
+    ...UndefinedOr.match(el.template, {
+      onUndefined: () => ({}),
+      onDefined: template => ({
+        template
+      })
+    })
+  })));
+  const plays = Bool.match(skipped, {
+    onTrue: () => {
+      const one = play(false);
+      return {
+        normal: one,
+        reduced: one
+      };
+    },
+    onFalse: () => ({
+      normal: play(false),
+      reduced: play(true)
+    })
+  });
+  const {
+    entry,
+    animation: inline,
+    late,
+    chunkRoot
+  } = appear.enter(plays, el.group, el.reducedMotion, skipped, el.tag, el.to);
+  return {
+    late,
+    chunkRoot,
+    animation: inline,
+    group: Option.liftPredicate(entry, () => el.leads).pipe(Option.map(leader => appear.group(leader, el.ownTransition))),
+    veto: reason => {
+      entry.vetoes.push(reason);
+    }
+  };
+};
+/** A mount animation's `skipped` (#468): left out when it isn't, so its key is as before. */
+export const skippedField = skipped => Bool.match(skipped, {
+  onTrue: () => ({
+    skipped: true
+  }),
+  onFalse: () => ({})
+});
+/** Whether `key` has Keyframes in `keyframes` (#429). */
+const hasStops = (keyframes, key) => {
+  if (Predicate.isUndefined(keyframes)) return false;
+  return Object.hasOwn(keyframes, key);
+};
+/** A mount's starts with its Keyframes resolved (#429, `keyframesFrom`), as the client's first Retarget resolves them. */
+const startedOf = (prepared, keyframes) => UndefinedOr.match(keyframes, {
+  onUndefined: () => ({
+    from: prepared.from,
+    to: prepared.to,
+    stops: undefined
+  }),
+  onDefined: byKey => ({
+    ...keyframesFrom(prepared.from, prepared.to, byKey),
+    to: prepared.to
+  })
+});
+/** An element's starts and targets, or why its mount animation can't play before hydration (decision 4). */
+const playable = (el, to) => playableMatch({
+  el,
+  to
+});
+/** {@link playable}'s cases, built once at module load: it runs per element (#69's PR 2). */
+const playableMatch = /*#__PURE__*/Match.type().pipe(Match.when({
+  el: {
+    appear: false
+  }
+}, () => Result.fail("appear={false}")), Match.orElse(({
+  el,
+  to
+}) => Option.match(unplayable(el.initial, to), {
+  onSome: reason => Result.fail(reason),
+  onNone: () => Result.succeed({
+    from: Rec.map(to, (target, key) => Option.getOrThrow(OwnValues.valueLike(el.initial[key], target))),
+    to
+  })
+})));
+/** Whether a user style sets an `animation` of its own: the element's one CSS animation would be taken. */
+export const setsAnimation = /*#__PURE__*/Match.type().pipe(Match.when(Predicate.isString, text => /(^|;)\s*animation(-name)?\s*:/i.test(text)), Match.when(Predicate.isObject, record => Bool.or(Object.hasOwn(record, "animation"), Object.hasOwn(record, "animationName"))), Match.orElse(() => false));
+/** The element's Appear animation, if a server started one (decision 6). */
+export const handoffOf = element => Option.map(Appear.find(element), animation => ({
+  animation
+}));
+/**
+ * How far into its own run the client's first legs start, in seconds, read at their first tick:
+ * where the CSS has got, less what the CSS waited that the client waits for itself. The CSS waited
+ * its `animation-delay` and its rule's hold; the client's legs hold their transition's delay
+ * (`clientDelay`, the stagger in it). The difference is a `when` wait, which the client has already
+ * waited.
+ */
+export const startAtOf = (handoff, ownTransition, clientDelay) => () => Appear.elapsedOf(handoff.animation) - Appear.delayOf(handoff.animation) - heldInRule(ownTransition) + clientDelay;
+//# sourceMappingURL=appear.js.map