levelset/src/level-blocks/ at main · russ.fugl.dev/levelset · Tangled

russ.fugl.dev / levelset

0

A functional toolkit for authoring resource-leveling algorithms — compose constraint and scoring blocks, enumerate feasible schedules

0

levelset / src / level-blocks /

at main 26 files

Russ T. Fugal feat(conf): parseConf — TOML pipeline configs (levelset/conf) 6d ago

feat(conf): parseConf — TOML pipeline configs (levelset/conf) New levelset/conf subpath: parseConf reads a .conf (TOML 1.0) file — a text projection of RunConfig — into a raw RunConfig. Sections map [levelset]/ [resolve]/[pipeline]/[blocks.<id>]/[weights]/[objective] onto the config; reserved block keys (code/enabled/provenance/shadow) peel off as instance fields, everything else is a param (dotted keys nest, array-of-tables become object arrays, "report" ⇄ null). Every framework section is strict. Coded issues E301–E308: TOML syntax (line/column), config shape (conf-path), missing/unsupported format, datetime literal, reserved-key collision, non-finite number, and registry validation (instanceId-attributed). With a registry, parse also runs validateGraph + the shared checkRunConfigRefs (extracted from fillRunConfig so the two can't drift). Adds smol-toml as a regular dependency and the ./conf export. Grammar goldens (fixture .conf ⇄ raw config JSON) plus one error fixture per code.

6 days ago

feat(level-blocks): family composition rules as registry data Lift the family grammar into src/level-blocks/composition.ts as pure data and predicates: FAMILY_ORDER, FAMILY_FOLLOWS, canFollow, sortIntoBandOrder, and FAMILY_CARDINALITY. validateGraph now loops over FAMILY_CARDINALITY instead of hard-coding the exactly-one-search check — behavior identical, existing tests unchanged — so a future per-family bound is a data edit. This is the levelset-side source of truth a canvas connection checker mirrors; a canFollow table test captures the contract so the vendor sync can delete its own copy.

6 days ago

concurrentResourceCost.ts

feat(leveling): coded static run analysis (analyzeRun) analyzeRun walks constraints' and scorers' declared references against a ResolvedProject before any search runs — spaCy's analyze_pipes + validate_attrs applied to leveling. Issues carry stable LEVELSET_E###/W### codes, error/warning severity, and attribute to the named instance: unknown resource/task/unit/calendar refs, deadline-vs-release and deadline-vs-duration infeasibility, precedence and unit-precedence cycles, inverted PeakCap windows, kinds the chosen search won't enforce (via supports()), empty governed sets, and duplicate instance names. Scorers gain optional reads metadata so a scorer referencing a missing entity is caught instead of silently optimizing on a constant zero; the four shipping scorer blocks now declare it.

6 days ago

concurrentUnitsLimit.ts

feat(level-blocks): unit-WIP limits (ConcurrentUnitsLimit, OpenUnitPenalty) Two WIP-limiting blocks that prioritize unit completion. ConcurrentUnitsLimit is the hard cap on how many units have active work on a day, with an optional discipline scope; OpenUnitPenalty is its soft companion, pricing each open-unit-day over a softMax across a unit's whole open span (idle gaps included). It subsumes the former LaydownSpaceCap. Both reference units by id into the resolved registry rather than carrying unit definitions by value. OpenUnitPenalty.score iterates distinct ids (new Set(unitIds)) so a duplicated reference is counted once, matching MiniZinc's set-literal semantics.

2 months ago

feat(level-blocks): PeakCap, Deadline, Release, Makespan, SerialSGS blocks Completes block coverage for the constraint kinds serialSGS enforces plus the two pieces every declarative run needs: the canonical Makespan scorer (previously hand-written inline by every caller) and the search itself as a registry-nameable block, so backends are selected by config rather than hard-wired.

6 days ago

feat(level-blocks): add Gate feasibility-gate collector block Gate keeps only schedules that satisfy every limit, where a limit bounds one scorer's value by max and/or min (an absent bound is unbounded on that side, never Infinity; at least one bound is required per limit). When at least one schedule passes, the passing set (order-preserving) is the result. When none pass, fallback decides: "none" yields the empty set; "leastBad" yields the single least-bad schedule. Least-bad compares schedules lexicographically by per-limit violation in the limits' declared order (first limit = binding). Violations of different scorers are not commensurable, so they are prioritized by order, never summed across scorers. Extends the Collector ADT with the Gate variant and GateLimit — the exhaustive collectorScorerRefs / collectors() switches (guarded by assertNeverCollector) force both dispatch sites to handle it. Adds the pure selectGate engine, levelset.Gate.v1 registration, leveling.ts re-exports, and README. Gate execution collects the stream once and filters/falls back in memory.

6 days ago

feat(level-blocks): family composition rules as registry data Lift the family grammar into src/level-blocks/composition.ts as pure data and predicates: FAMILY_ORDER, FAMILY_FOLLOWS, canFollow, sortIntoBandOrder, and FAMILY_CARDINALITY. validateGraph now loops over FAMILY_CARDINALITY instead of hard-coding the exactly-one-search check — behavior identical, existing tests unchanged — so a future per-family bound is a data edit. This is the levelset-side source of truth a canvas connection checker mirrors; a canFollow table test captures the contract so the vendor sync can delete its own copy.

6 days ago

hiringLagPenalty.ts

feat(leveling): coded static run analysis (analyzeRun) analyzeRun walks constraints' and scorers' declared references against a ResolvedProject before any search runs — spaCy's analyze_pipes + validate_attrs applied to leveling. Issues carry stable LEVELSET_E###/W### codes, error/warning severity, and attribute to the named instance: unknown resource/task/unit/calendar refs, deadline-vs-release and deadline-vs-duration infeasibility, precedence and unit-precedence cycles, inverted PeakCap windows, kinds the chosen search won't enforce (via supports()), empty governed sets, and duplicate instance names. Scorers gain optional reads metadata so a scorer referencing a missing entity is caught instead of silently optimizing on a constant zero; the four shipping scorer blocks now declare it.

6 days ago

feat(level-blocks): add KBest/Pareto collector blocks and run consumption path Collectors are the selection layer above scoring: a collector picks a set out of the candidate stream instead of ranking one schedule. KBest keeps the best k schedules lexicographically over referenced scorer instances; Pareto keeps the non-dominated set. Both reference scorers by instanceId, resolved at run-wiring time (like objective.lexicographic) so the spec stays plain JSON and round-trips through fillRunConfig untouched. Adds the Collector ADT and assertNeverCollector, ScheduleStream.kBestByLex (reusing lexBetter), the KBest/Pareto blocks under levelset.KBest.v1 / levelset.Pareto.v1, and LevelingRun.collectors() which runs every enabled collector against a fresh stream keyed by graph instanceId. Validation mirrors the lexicographic path: fillRunConfig rejects collector references to missing/non-scorer instances, runFromConfig rejects references to disabled scorers.

6 days ago

feat(level-blocks): PeakCap, Deadline, Release, Makespan, SerialSGS blocks Completes block coverage for the constraint kinds serialSGS enforces plus the two pieces every declarative run needs: the canonical Makespan scorer (previously hand-written inline by every caller) and the search itself as a registry-nameable block, so backends are selected by config rather than hard-wired.

6 days ago

maxConcurrentResource.ts

feat(level-blocks): Block abstraction and MaxConcurrentResource The Block abstraction: a typed quadruple of a zod input/output schema, an apply step, a toMiniZinc step (with an optional toCpSat), and a doc string (natural language plus pseudocode). Blocks are the composition unit shared by a visual editor and an LLM agent; the three families differ only in their output (Constraint / Scorer / Search), and constraint variants remain the interchange format with the search. Ships MaxConcurrentResource as the first concrete block. Its MiniZinc fragment references the well-known harness symbols (active[t,d], tasks_demanding[r], DAYS) rather than taking a context argument — composing fragments is the compiler's job.

2 months ago

feat(level-blocks): derived block metadata (deriveBlockMeta/dumpBlockMeta) Port a zod→JSON-Schema walk into src/level-blocks/meta.ts, minus all Blockly assembly: deriveBlockMeta flattens a block's input schema into editable scalar fields (date/number/slider/dropdown/checkbox with labels/bounds/defaults), variadic scalar-array params, and complex (field-less) params, alongside the block's family/tier/doc/shadow and its JSON-Schema. dumpBlockMeta wraps the whole registry with the composition grammar. Exports the ISO-date pattern both sides agree on by construction. Zod-only, exported from levelset/leveling.

6 days ago

modeSelection.ts

fix(level-blocks): reject empty and duplicate-resource ModeSelection modes Require at least one mode so toMiniZinc no longer emits an unsatisfiable empty domain, and forbid duplicate resourceUniqueId within a mode's demand so serialSGS does not double-count load or materialize duplicate rows. Document that multiple instances per task union under serial-SGS but intersect (likely UNSAT) under the MiniZinc contract.

6 days ago

openUnitPenalty.ts

feat(leveling): coded static run analysis (analyzeRun) analyzeRun walks constraints' and scorers' declared references against a ResolvedProject before any search runs — spaCy's analyze_pipes + validate_attrs applied to leveling. Issues carry stable LEVELSET_E###/W### codes, error/warning severity, and attribute to the named instance: unknown resource/task/unit/calendar refs, deadline-vs-release and deadline-vs-duration infeasibility, precedence and unit-precedence cycles, inverted PeakCap windows, kinds the chosen search won't enforce (via supports()), empty governed sets, and duplicate instance names. Scorers gain optional reads metadata so a scorer referencing a missing entity is caught instead of silently optimizing on a constant zero; the four shipping scorer blocks now declare it.

6 days ago

fix(level-blocks): validate collector refs off the compiled spec; exhaustive dispatch Extract collector scorer refs from the compiled Collector spec (via the block's pure apply()) instead of duck-typing parsed params as {by, over}: a custom collector naming its refs under a different param no longer skips layer-1 validation, and a non-array by/over can't surface as a raw TypeError. Distinguish a missing scorer from a disabled one in the layer-2 runFromConfig check. Convert both collector dispatch ternaries to exhaustive switches ending in assertNeverCollector so a future variant is a compile error. Fix stale docs (collectors labeled by, not keyed by; single-scorer Pareto keeps all co-best; ES2019 sort stability).

6 days ago

feat(level-blocks): PeakCap, Deadline, Release, Makespan, SerialSGS blocks Completes block coverage for the constraint kinds serialSGS enforces plus the two pieces every declarative run needs: the canonical Makespan scorer (previously hand-written inline by every caller) and the search itself as a registry-nameable block, so backends are selected by config rather than hard-wired.

6 days ago

phaseEarliness.ts

feat(level-blocks): phase completion-priority lateness/earliness scorers Generalize earlier phase-lateness and early-start scoring terms into standard registry blocks. Phases are data (an array of { name?, taskUniqueIds, targetDay, weight? }) rather than hardcoded: - PhaseLateness charges the working days a phase's latest task finishes past its target day; PhaseEarliness charges the working days its earliest task starts before its target. Each is weighted by the phase's completion-priority weight (an earlier completionWeight, a static per-phase priority) and summed. Two blocks, not one moded block: the originals anchor them on different targets (window end vs start) and rank them in different lexicographic tiers, and a single phase carries both at once. - Deviation is counted in working days via the shared calendar prefix sum; the per-day scale (phaseLatenessPerDay/earlyStartPerDay in the original formulation) comes from the run config's scorer weight. Both declare reads.taskUniqueIds so analyzeRun flags a phase pointing at a missing task. Registered as levelset.PhaseLateness.v1 / levelset.PhaseEarliness.v1 (estimator tier); shared logic in phaseScoring.ts. Tests cover schema, hand-computed scoring on the Mon-Fri fixture (including a realistic-shaped partially-complete phase), the MiniZinc fragment, and RunConfig wiring.

6 days ago

phaseLateness.ts

docs+test(level-blocks): phase-scorer fencepost docs and weighting/partial-phase tests Document the exclusive-finish frame of PhaseWindow.targetDay (finishing ON a deadline date costs a day unless targetDay is the day after), clarify the PhaseLateness nl doc that the zero-cost boundary is the exclusive finishDay index, and note the MiniZinc fixed-identifier collision when two instances of the same block share a graph (latent; per-instance varName is future work). Add a completion-priority trade-off test proving the phase weight ranks schedules (a heavier phase slipping fewer days beats a lighter phase slipping more), and a partially-scheduled phase test asserting the boundary derives from present tasks only.

6 days ago

phaseScoring.ts

docs+test(level-blocks): phase-scorer fencepost docs and weighting/partial-phase tests Document the exclusive-finish frame of PhaseWindow.targetDay (finishing ON a deadline date costs a day unless targetDay is the day after), clarify the PhaseLateness nl doc that the zero-cost boundary is the exclusive finishDay index, and note the MiniZinc fixed-identifier collision when two instances of the same block share a graph (latent; per-instance varName is future work). Add a completion-priority trade-off test proving the phase weight ranks schedules (a heavier phase slipping fewer days beats a lighter phase slipping more), and a partially-scheduled phase test asserting the boundary derives from present tasks only.

6 days ago

fix(level-blocks): validate metadata dot-paths at registration panelBindings.paramPath and projectAnchoredPaths are consumed app-side (panel generation, template save), so a typo'd dot-path previously failed silently at first use. register() now resolves every declared path against the parsed defaultShadow — curated to be complete — and throws when one doesn't resolve, matching the fail-at-registration principle already applied to defaultShadow itself.

1 month ago

feat(level-blocks): PeakCap, Deadline, Release, Makespan, SerialSGS blocks Completes block coverage for the constraint kinds serialSGS enforces plus the two pieces every declarative run needs: the canonical Makespan scorer (previously hand-written inline by every caller) and the search itself as a registry-nameable block, so backends are selected by config rather than hard-wired.

6 days ago

feat(conf): parseConf — TOML pipeline configs (levelset/conf) New levelset/conf subpath: parseConf reads a .conf (TOML 1.0) file — a text projection of RunConfig — into a raw RunConfig. Sections map [levelset]/ [resolve]/[pipeline]/[blocks.<id>]/[weights]/[objective] onto the config; reserved block keys (code/enabled/provenance/shadow) peel off as instance fields, everything else is a param (dotted keys nest, array-of-tables become object arrays, "report" ⇄ null). Every framework section is strict. Coded issues E301–E308: TOML syntax (line/column), config shape (conf-path), missing/unsupported format, datetime literal, reserved-key collision, non-finite number, and registry validation (instanceId-attributed). With a registry, parse also runs validateGraph + the shared checkRunConfigRefs (extracted from fillRunConfig so the two can't drift). Adds smol-toml as a regular dependency and the ./conf export. Grammar goldens (fixture .conf ⇄ raw config JSON) plus one error fixture per code.

6 days ago

serialSgsSearch.ts

feat(level-blocks): PeakCap, Deadline, Release, Makespan, SerialSGS blocks Completes block coverage for the constraint kinds serialSGS enforces plus the two pieces every declarative run needs: the canonical Makespan scorer (previously hand-written inline by every caller) and the search itself as a registry-nameable block, so backends are selected by config rather than hard-wired.

6 days ago

Merge branch 'feature/phase-scorer-blocks'

6 days ago

feat(level-blocks): add KBest/Pareto collector blocks and run consumption path Collectors are the selection layer above scoring: a collector picks a set out of the candidate stream instead of ranking one schedule. KBest keeps the best k schedules lexicographically over referenced scorer instances; Pareto keeps the non-dominated set. Both reference scorers by instanceId, resolved at run-wiring time (like objective.lexicographic) so the spec stays plain JSON and round-trips through fillRunConfig untouched. Adds the Collector ADT and assertNeverCollector, ScheduleStream.kBestByLex (reusing lexBetter), the KBest/Pareto blocks under levelset.KBest.v1 / levelset.Pareto.v1, and LevelingRun.collectors() which runs every enabled collector against a fresh stream keyed by graph instanceId. Validation mirrors the lexicographic path: fillRunConfig rejects collector references to missing/non-scorer instances, runFromConfig rejects references to disabled scorers.

6 days ago

unimodalDeviation.ts

feat(leveling): coded static run analysis (analyzeRun) analyzeRun walks constraints' and scorers' declared references against a ResolvedProject before any search runs — spaCy's analyze_pipes + validate_attrs applied to leveling. Issues carry stable LEVELSET_E###/W### codes, error/warning severity, and attribute to the named instance: unknown resource/task/unit/calendar refs, deadline-vs-release and deadline-vs-duration infeasibility, precedence and unit-precedence cycles, inverted PeakCap windows, kinds the chosen search won't enforce (via supports()), empty governed sets, and duplicate instance names. Scorers gain optional reads metadata so a scorer referencing a missing entity is caught instead of silently optimizing on a constant zero; the four shipping scorer blocks now declare it.

6 days ago