light-plan 0.0.0-stage → 0.1.0

package/dist/core/board/tasks/ranking.js

@@ -0,0 +1,374 @@
+import { effortAttributeOf, isActiveStatus, isTerminalStatus, priorityAttributeOf, prefixFor, } from '../../config/lookup.js';
+import { numberOf } from '../../storage/state.js';
+import { blockerIds, upstreamWork } from '../../../shared/blocking.js';
+import { progressComparator } from '../../../shared/cohesion.js';
+import { isGenericResource, periodOf, periodStance, workUnits } from '../query.js';
+import { inScope } from '../scope.js';
+function today(options) {
+    return options.today ?? new Date().toISOString().slice(0, 10);
+}
+const structureCache = new WeakMap();
+function structureOf(board) {
+    const cached = structureCache.get(board.issues);
+    if (cached)
+        return cached;
+    const children = new Map();
+    for (const issue of board.issues) {
+        if (!issue.parentId)
+            continue;
+        const list = children.get(issue.parentId);
+        if (list)
+            list.push(issue.id);
+        else
+            children.set(issue.parentId, [issue.id]);
+    }
+    const structure = {
+        children,
+        units: new Set(workUnits(board).map((issue) => issue.id)),
+    };
+    structureCache.set(board.issues, structure);
+    return structure;
+}
+/**
+ * Adapt a `LoadedBoard` to the id-based lookup `src/shared/blocking.ts` reads.
+ *
+ * Exported because `validation/checks/dependencies.ts` runs the cycle check
+ * over the *inherited* graph these rules produce, and a second adapter there
+ * would be a second answer to "what gates this issue".
+ */
+export function blockingLookupFor(board) {
+    const { children, units } = structureOf(board);
+    return {
+        exists: (id) => board.byId.has(id),
+        parentOf: (id) => board.byId.get(id)?.parentId ?? null,
+        dependenciesOf: (id) => board.byId.get(id)?.depends_on ?? [],
+        childIdsOf: (id) => children.get(id) ?? [],
+        isTerminal: (id) => {
+            const issue = board.byId.get(id);
+            return issue ? isTerminalStatus(board.config, issue.status) : false;
+        },
+        isWorkUnit: (id) => units.has(id),
+    };
+}
+/**
+ * Adapt a `LoadedBoard` to the id-based lookup `src/shared/cohesion.ts` reads.
+ *
+ * It shares `structureOf` with the blocking lookup — the parenting and the
+ * units are the same two questions — and reads the statuses live, which is why
+ * it is built per sort rather than cached: `simulateQueue` moves the board on
+ * between steps and the whole point of the rule is that it notices.
+ */
+function cohesionLookupFor(board) {
+    const { children, units } = structureOf(board);
+    const statusOf = (id) => board.byId.get(id)?.status ?? null;
+    return {
+        parentOf: (id) => board.byId.get(id)?.parentId ?? null,
+        childIdsOf: (id) => children.get(id) ?? [],
+        isWorkUnit: (id) => units.has(id),
+        isTerminal: (id) => {
+            const status = statusOf(id);
+            return status ? isTerminalStatus(board.config, status) : false;
+        },
+        isActive: (id) => {
+            const status = statusOf(id);
+            return status ? isActiveStatus(board.config, status) : false;
+        },
+    };
+}
+/**
+ * Issues that must be finished before `issue` can start, nearest cause first.
+ *
+ * Dependencies are inherited: an issue waits on everything its ancestors wait
+ * on. A dependency on a container is cleared by the work inside it rather than
+ * by the container's own status.
+ *
+ * @see src/shared/blocking.ts for the rules and why they are that way.
+ */
+export function blockersOf(board, issue) {
+    return blockerIds(issue.id, blockingLookupFor(board))
+        .map((id) => board.byId.get(id))
+        .filter((other) => Boolean(other));
+}
+export function isBlocked(board, issue) {
+    return blockersOf(board, issue).length > 0;
+}
+/**
+ * Everything that has to be finished before `issue` can be, nearest cause
+ * first — the whole chain, not just the nearest link of it.
+ *
+ * `blockersOf` says why the work cannot start today. This says what would have
+ * to happen for it to be closed at all: what the blockers wait on, what those
+ * wait on, and the open work inside each blocking container, which is what a
+ * container amounts to and what somebody would actually be handed.
+ *
+ * Read-only, and it answers for the board as it stands — a dangling id blocks
+ * nothing, exactly as it does for the queue.
+ *
+ * @see src/shared/blocking.ts for the rules and why they are that way.
+ */
+export function upstreamOf(board, issue) {
+    const lookup = blockingLookupFor(board);
+    const found = [];
+    for (const entry of upstreamWork(issue.id, lookup)) {
+        const document = board.byId.get(entry.id);
+        if (document)
+            found.push({ ...entry, issue: document });
+    }
+    return found;
+}
+/**
+ * Work sitting in a period somebody switched off — including one nested inside
+ * a switched-off period, since `periodStance` cascades the way parking an
+ * increment parks the sprints in it.
+ *
+ * This is the one definition of "parked", and `candidatesFor` is the one place
+ * that acts on it, so `lpm task next`, `lpm task start`, MCP `next_tasks` and
+ * `simulateQueue` cannot disagree about whether a parked sprint is on offer.
+ */
+export function isParked(board, issue) {
+    const period = periodOf(board, issue);
+    return period ? periodStance(board, period) === 'off' : false;
+}
+/** Effort declared on an issue, when the board measures effort at all. */
+export function effortOf(board, issue) {
+    if (!effortAttributeOf(board.config, issue.type))
+        return null;
+    const value = issue.attributes[board.config.effort_attribute];
+    return typeof value === 'number' && Number.isFinite(value) ? value : null;
+}
+/**
+ * Position of an issue's priority in its type's enum, most important first.
+ * Issues whose type declares no priority, or that left it empty, sort last.
+ */
+function priorityRank(board, issue) {
+    const def = priorityAttributeOf(board.config, issue.type);
+    const values = def?.values;
+    if (!values)
+        return Number.MAX_SAFE_INTEGER;
+    const value = issue.attributes[board.config.priority_attribute];
+    const index = typeof value === 'string' ? values.indexOf(value) : -1;
+    return index < 0 ? Number.MAX_SAFE_INTEGER : index;
+}
+/**
+ * Work already under way ranks first, then unscheduled work, then work parked
+ * in a period that has not started — so nobody is told to start next quarter's
+ * sprint while this one is running. A period somebody has switched off ranks
+ * below all of that: it is the one bucket a reader asked for by hand, and
+ * putting it last is what makes the switch a way of steering the team.
+ *
+ * Note that a period which has merely *ended* still ranks first. Overrunning
+ * work is the most urgent thing on the board, not the least, and only the
+ * switch moves work down.
+ */
+function scheduleRank(board, issue, now) {
+    const period = periodOf(board, issue);
+    if (!period)
+        return [1, ''];
+    const stance = periodStance(board, period);
+    if (stance === 'off')
+        return [3, period.starts ?? ''];
+    if (stance === 'on')
+        return [0, period.starts ?? ''];
+    if (!period.starts)
+        return [1, ''];
+    return period.starts <= now ? [0, period.starts] : [2, period.starts];
+}
+function statusRank(board, issue) {
+    const index = board.config.statuses.findIndex((status) => status.id === issue.status);
+    // Later columns are closer to done, so they come first.
+    return index < 0 ? 0 : -index;
+}
+/** Whether an issue sits anywhere under `parentId`, walking the parent chain. */
+function underParent(board, issue, parentId) {
+    const seen = new Set();
+    let current = issue.parentId;
+    while (current && !seen.has(current)) {
+        if (current === parentId)
+            return true;
+        seen.add(current);
+        current = board.byId.get(current)?.parentId ?? null;
+    }
+    return false;
+}
+function compareCandidates(board, now, focusParent) {
+    const prefix = prefixFor(board.config, 'issue');
+    const byProgress = progressComparator(cohesionLookupFor(board));
+    return (a, b) => {
+        // Cohesion first: keep a run inside the current feature until it is done.
+        // Absent focusParent, this is skipped and the order is exactly as before.
+        if (focusParent) {
+            const near = Number(underParent(board, b.issue, focusParent)) - Number(underParent(board, a.issue, focusParent));
+            if (near !== 0)
+                return near;
+        }
+        const [bucketA, startA] = scheduleRank(board, a.issue, now);
+        const [bucketB, startB] = scheduleRank(board, b.issue, now);
+        if (bucketA !== bucketB)
+            return bucketA - bucketB;
+        if (startA !== startB)
+            return startA.localeCompare(startB);
+        const priority = priorityRank(board, a.issue) - priorityRank(board, b.issue);
+        if (priority !== 0)
+            return priority;
+        const status = statusRank(board, a.issue) - statusRank(board, b.issue);
+        if (status !== 0)
+            return status;
+        // Stay inside the part of the plan that is already moving. Below the three
+        // signals a person set by hand (the schedule, the priority, the column) and
+        // above the graph heuristics, so it decides exactly the case it is for: two
+        // otherwise indistinguishable stories in two unrelated features.
+        // @see src/shared/cohesion.ts
+        const ongoing = byProgress(a.issue.id, b.issue.id);
+        if (ongoing !== 0)
+            return ongoing;
+        const unblocks = (board.dependents.get(b.issue.id)?.length ?? 0) -
+            (board.dependents.get(a.issue.id)?.length ?? 0);
+        if (unblocks !== 0)
+            return unblocks;
+        return numberOf(a.issue.id, prefix) - numberOf(b.issue.id, prefix);
+    };
+}
+/**
+ * The order the queue offers work in, applied to candidates that did not come
+ * from `candidatesFor` — work already under way, say. Exported so a caller that
+ * assembles its own list still ranks it the one way the board ranks work.
+ */
+export function rankCandidates(board, candidates, options = {}) {
+    return [...candidates].sort(compareCandidates(board, today(options), options.focusParent));
+}
+/** How an issue is routed to a resource, or null when it is none of its business. */
+function routeFor(board, issue, resource, options) {
+    if (!issue.assignee) {
+        return options.includeUnassigned ? { route: 'unassigned', pool: null } : null;
+    }
+    if (issue.assignee === resource.id)
+        return { route: 'direct', pool: null };
+    if (!resource.covers.includes(issue.assignee))
+        return null;
+    const pool = board.resourcesById.get(issue.assignee) ?? null;
+    return pool && isGenericResource(board, pool) ? { route: 'pool', pool } : null;
+}
+/**
+ * How a piece of work reaches a resource, or null when it never does: assigned
+ * to it, parked in a pool it covers, or assigned to nobody when the caller is
+ * willing to consider that.
+ *
+ * The public face of the rule `candidatesFor` filters by. It answers *routing*
+ * alone and says nothing about whether the work is ready, in scope or finished
+ * — a caller explaining why something was never offered needs to separate those
+ * reasons, and asking this is how it does so without restating the rule.
+ */
+export function routeOf(board, issue, resource, options = {}) {
+    return routeFor(board, issue, resource, options);
+}
+/** Everything a resource could pick up, blocked or not, in recommended order. */
+function candidatesFor(board, resourceId, options) {
+    const resource = board.resourcesById.get(resourceId);
+    if (!resource)
+        return [];
+    const units = new Set(workUnits(board).map((issue) => issue.id));
+    const candidates = [];
+    for (const issue of board.issues) {
+        if (!units.has(issue.id))
+            continue;
+        if (isTerminalStatus(board.config, issue.status))
+            continue;
+        if (isActiveStatus(board.config, issue.status))
+            continue;
+        // A flag says this work has stopped and needs a person. Most flagged work
+        // is in progress and excluded by the line above, but a flag can be raised
+        // on anything unfinished — "blocked, do not start this" is exactly what a
+        // planner writes on a backlog issue — and offering that as the next thing
+        // to pick up contradicts the flag. It stays reachable by id, like
+        // everything else the queue steers rather than hides.
+        if (issue.flag)
+            continue;
+        if (options.scope && !inScope(options.scope, issue))
+            continue;
+        if (!options.includeParked && isParked(board, issue))
+            continue;
+        const route = routeFor(board, issue, resource, options);
+        if (!route)
+            continue;
+        // Squad gate: when an issue's period is owned by a squad, only that
+        // squad's members can be offered work from it. A period with no squad
+        // is the normal case and applies no filter.
+        if (issue.period) {
+            const members = board.periodSquadMembers.get(issue.period);
+            if (members && !members.has(resourceId))
+                continue;
+        }
+        candidates.push({
+            issue,
+            route: route.route,
+            pool: route.pool,
+            period: periodOf(board, issue),
+            blockedBy: blockersOf(board, issue),
+        });
+    }
+    return candidates.sort(compareCandidates(board, today(options), options.focusParent));
+}
+/** What to work on next: ready, unblocked work, best first. */
+export function nextTasks(board, resourceId, options = {}) {
+    const ready = candidatesFor(board, resourceId, options).filter((candidate) => !candidate.blockedBy.length);
+    return options.limit === undefined ? ready : ready.slice(0, Math.max(0, options.limit));
+}
+/** Work that would be next if something else were finished first. */
+export function blockedTasks(board, resourceId, options = {}) {
+    return candidatesFor(board, resourceId, options).filter((candidate) => candidate.blockedBy.length > 0);
+}
+/**
+ * Work this resource has already picked up and may carry straight on with.
+ *
+ * The queue never offers what has been picked up — `candidatesFor` skips an
+ * active status, because a thing in progress is not a thing to start. That
+ * leaves a hole for anything working the queue on its own: a run that only ever
+ * asked `nextTasks` could never come back to a task it left half-finished, so
+ * one interrupted task dammed the board and everything waiting on it was
+ * blocked for ever. This is the one definition of "what may I carry on with",
+ * called by `simulateQueue` to seed a run and by `lpm queue agent` to resume
+ * one, so the prediction and the run cannot disagree about it.
+ *
+ * Two things are not resumable. A container somebody moved into an active
+ * column is not a thing you pick up — its children are, and counting it would
+ * double the work it stands for. And a **flag** ends the licence: it says the
+ * work has stopped and needs a person, which is a decision no one-person run
+ * is going to make on its own, so carrying on with it would assume away the
+ * very thing holding the queue up.
+ *
+ * Like `currentTasks`, this ignores scope and the period switch: work already
+ * picked up stays yours even if the queue that offered it has moved. It is
+ * ranked but never truncated — the caller decides how much of it to take.
+ */
+export function resumableTasks(board, resourceId, options = {}) {
+    const units = new Set(workUnits(board).map((issue) => issue.id));
+    const candidates = currentTasks(board, resourceId)
+        .filter((issue) => units.has(issue.id))
+        .filter((issue) => !issue.flag)
+        .map((issue) => ({
+        issue,
+        route: 'direct',
+        pool: null,
+        period: periodOf(board, issue),
+        blockedBy: blockersOf(board, issue),
+    }));
+    return rankCandidates(board, candidates, options);
+}
+/** What a resource is working on right now: assigned to it, in an active status. */
+export function currentTasks(board, resourceId) {
+    const resource = board.resourcesById.get(resourceId);
+    if (!resource)
+        return [];
+    return board.issues.filter((issue) => issue.assignee === resource.id && isActiveStatus(board.config, issue.status));
+}
+/** What a resource finished most recently, newest first. */
+export function previousTasks(board, resourceId, limit = 3) {
+    const resource = board.resourcesById.get(resourceId);
+    if (!resource)
+        return [];
+    return board.issues
+        .filter((issue) => issue.assignee === resource.id && isTerminalStatus(board.config, issue.status))
+        .sort((a, b) => (b.updated ?? b.created ?? '').localeCompare(a.updated ?? a.created ?? ''))
+        .slice(0, Math.max(0, limit));
+}
+//# sourceMappingURL=ranking.js.map

package/dist/core/board/tasks/ranking.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranking.js","sourceRoot":"","sources":["../../../../src/core/board/tasks/ranking.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,gBAAgB,EAChB,mBAAmB,EACnB,SAAS,GACV,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAEvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAEjE,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAEnF,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAuDtC,SAAS,KAAK,CAAC,OAAoB;IACjC,OAAO,OAAO,CAAC,KAAK,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAChE,CAAC;AAmBD,MAAM,cAAc,GAAG,IAAI,OAAO,EAA2B,CAAC;AAE9D,SAAS,WAAW,CAAC,KAAkB;IACrC,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,QAAQ;YAAE,SAAS;QAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,SAAS,GAAmB;QAChC,QAAQ;QACR,KAAK,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;KAC1D,CAAC;IACF,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkB;IAClD,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC/C,OAAO;QACL,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,IAAI,IAAI;QACtD,cAAc,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,UAAU,IAAI,EAAE;QAC5D,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;QAC1C,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACtE,CAAC;QACD,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;KAClC,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CAAC,KAAkB;IAC3C,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAiB,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IACnF,OAAO;QACL,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,IAAI,IAAI;QACtD,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;QAC1C,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE;YACjB,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC5B,OAAO,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACjE,CAAC;QACD,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC5B,OAAO,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/D,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,KAAkB,EAAE,KAAY;IACzD,OAAO,UAAU,CAAC,KAAK,CAAC,EAAE,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC;SAClD,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC/B,MAAM,CAAC,CAAC,KAAK,EAAkB,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAkB,EAAE,KAAY;IACxD,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AAC7C,CAAC;AAOD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,KAAkB,EAAE,KAAY;IACzD,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAkB,EAAE,KAAY;IACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AAChE,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,QAAQ,CAAC,KAAkB,EAAE,KAAY;IACvD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAC9D,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5E,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,KAAkB,EAAE,KAAY;IACpD,MAAM,GAAG,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,GAAG,EAAE,MAAM,CAAC;IAC3B,IAAI,CAAC,MAAM;QAAE,OAAO,MAAM,CAAC,gBAAgB,CAAC;IAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC;AACrD,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CAAC,KAAkB,EAAE,KAAY,EAAE,GAAW;IACjE,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAE5B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3C,IAAI,MAAM,KAAK,KAAK;QAAE,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;IACtD,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;IAErD,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACnC,OAAO,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,UAAU,CAAC,KAAkB,EAAE,KAAY;IAClD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC;IACtF,wDAAwD;IACxD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAChC,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAC,KAAkB,EAAE,KAAY,EAAE,QAAgB;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC7B,OAAO,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACrC,IAAI,OAAO,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,QAAQ,IAAI,IAAI,CAAC;IACtD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAkB,EAAE,GAAW,EAAE,WAA2B;IACrF,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;IAChE,OAAO,CAAC,CAAgB,EAAE,CAAgB,EAAU,EAAE;QACpD,0EAA0E;QAC1E,0EAA0E;QAC1E,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;YACjH,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC9B,CAAC;QAED,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5D,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5D,IAAI,OAAO,KAAK,OAAO;YAAE,OAAO,OAAO,GAAG,OAAO,CAAC;QAClD,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAE3D,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7E,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAEpC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvE,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEhC,2EAA2E;QAC3E,4EAA4E;QAC5E,4EAA4E;QAC5E,iEAAiE;QACjE,8BAA8B;QAC9B,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAElC,MAAM,QAAQ,GACZ,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;YAC/C,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAEpC,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAkB,EAClB,UAA2B,EAC3B,UAAuB,EAAE;IAEzB,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,qFAAqF;AACrF,SAAS,QAAQ,CACf,KAAkB,EAClB,KAAY,EACZ,QAAkB,EAClB,OAAoB;IAEpB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpB,OAAO,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAChF,CAAC;IACD,IAAI,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,EAAE;QAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC3E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3D,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;IAC7D,OAAO,IAAI,IAAI,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACjF,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CACrB,KAAkB,EAClB,KAAY,EACZ,QAAkB,EAClB,UAAuB,EAAE;IAEzB,OAAO,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACnD,CAAC;AAED,iFAAiF;AACjF,SAAS,aAAa,CACpB,KAAkB,EAClB,UAAkB,EAClB,OAAoB;IAEpB,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACrD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IAEzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,UAAU,GAAoB,EAAE,CAAC;IAEvC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,SAAS;QACnC,IAAI,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;YAAE,SAAS;QAC3D,IAAI,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;YAAE,SAAS;QACzD,0EAA0E;QAC1E,0EAA0E;QAC1E,0EAA0E;QAC1E,0EAA0E;QAC1E,kEAAkE;QAClE,sDAAsD;QACtD,IAAI,KAAK,CAAC,IAAI;YAAE,SAAS;QACzB,IAAI,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QAC9D,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QAE/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,oEAAoE;QACpE,sEAAsE;QACtE,4CAA4C;QAC5C,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3D,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;QACpD,CAAC;QAED,UAAU,CAAC,IAAI,CAAC;YACd,KAAK;YACL,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;YAC9B,SAAS,EAAE,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC;SACpC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;AACxF,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,SAAS,CACvB,KAAkB,EAClB,UAAkB,EAClB,UAAuB,EAAE;IAEzB,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,MAAM,CAC5D,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAC3C,CAAC;IACF,OAAO,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1F,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,UAAkB,EAClB,UAAuB,EAAE;IAEzB,OAAO,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,MAAM,CACrD,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAC9C,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAkB,EAClB,UAAkB,EAClB,UAAuB,EAAE;IAEzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC;SAC/C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;SACtC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;SAC9B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,KAAK;QACL,KAAK,EAAE,QAAqB;QAC5B,IAAI,EAAE,IAAI;QACV,MAAM,EAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;QAC9B,SAAS,EAAE,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC;KACpC,CAAC,CAAC,CAAC;IACN,OAAO,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACpD,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,UAAkB;IACjE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACrD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CACxB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,EAAE,IAAI,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CACxF,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,aAAa,CAAC,KAAkB,EAAE,UAAkB,EAAE,KAAK,GAAG,CAAC;IAC7E,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACrD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,OAAO,KAAK,CAAC,MAAM;SAChB,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,EAAE,IAAI,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAC1F;SACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;SAC1F,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAClC,CAAC"}

package/dist/core/board/tasks/roster.d.ts

@@ -0,0 +1,42 @@
+import type { Period, Resource } from '../../model/types.js';
+import type { LoadedBoard } from '../load.js';
+export interface LoadRow {
+    /** The resource this row describes, or null for the unassigned bucket. */
+    resource: Resource | null;
+    generic: boolean;
+    /** Full-time equivalents supplied. Zero for the unassigned bucket. */
+    capacity: number;
+    /** Issues not in a terminal status. */
+    open: number;
+    /** Issues in an active status. */
+    wip: number;
+    done: number;
+    /** Total effort of the open issues; null when the board measures no effort. */
+    effort: number | null;
+    covers: string[];
+    coveredBy: string[];
+}
+export interface LoadReport {
+    rows: LoadRow[];
+    unassigned: LoadRow;
+    /** The period the report was scoped to, when one was given. */
+    period: Period | null;
+    /** Pools holding open work that no resource covers — nobody can pick it up. */
+    uncovered: Resource[];
+    totals: {
+        capacity: number;
+        open: number;
+        wip: number;
+        effort: number | null;
+    };
+}
+/**
+ * Who is carrying how much. Optionally scoped to a period (including its child
+ * periods), which is where over-commitment actually shows up.
+ *
+ * This is a load view, not a scheduler: it reports demand against declared
+ * capacity and flags pools nobody can serve, and leaves the judgement to you.
+ */
+export declare function resourceLoad(board: LoadedBoard, options?: {
+    periodId?: string;
+}): LoadReport;

package/dist/core/board/tasks/roster.js

@@ -0,0 +1,82 @@
+import { isActiveStatus, isTerminalStatus } from '../../config/lookup.js';
+import { isGenericResource, issuesInPeriod, workUnits } from '../query.js';
+import { effortOf } from './ranking.js';
+function emptyRow(board, resource) {
+    return {
+        resource,
+        generic: resource ? isGenericResource(board, resource) : false,
+        capacity: resource ? resource.capacity : 0,
+        open: 0,
+        wip: 0,
+        done: 0,
+        effort: null,
+        covers: resource ? [...resource.covers] : [],
+        coveredBy: resource ? [...(board.coveredBy.get(resource.id) ?? [])] : [],
+    };
+}
+function tally(board, row, issue) {
+    if (isTerminalStatus(board.config, issue.status)) {
+        row.done += 1;
+        return;
+    }
+    row.open += 1;
+    if (isActiveStatus(board.config, issue.status))
+        row.wip += 1;
+    const effort = effortOf(board, issue);
+    if (effort !== null)
+        row.effort = (row.effort ?? 0) + effort;
+}
+/**
+ * Who is carrying how much. Optionally scoped to a period (including its child
+ * periods), which is where over-commitment actually shows up.
+ *
+ * This is a load view, not a scheduler: it reports demand against declared
+ * capacity and flags pools nobody can serve, and leaves the judgement to you.
+ */
+export function resourceLoad(board, options = {}) {
+    const period = options.periodId
+        ? (board.periods.find((entry) => entry.id.toLowerCase() === options.periodId.toLowerCase()) ??
+            null)
+        : null;
+    // Only work units carry work: counting a feature as well as its stories would
+    // report the same effort twice, and so would counting an `atomic` story
+    // alongside the sub-tasks it was estimated to include.
+    const units = workUnits(board);
+    const scoped = period
+        ? new Set(issuesInPeriod(board, period.id).map((issue) => issue.id))
+        : null;
+    const issues = scoped ? units.filter((issue) => scoped.has(issue.id)) : units;
+    const rows = new Map();
+    for (const resource of board.resources)
+        rows.set(resource.id, emptyRow(board, resource));
+    const unassigned = emptyRow(board, null);
+    for (const issue of issues) {
+        const row = issue.assignee ? rows.get(issue.assignee) : unassigned;
+        if (row)
+            tally(board, row, issue);
+    }
+    const uncovered = board.resources.filter((resource) => {
+        if (!isGenericResource(board, resource))
+            return false;
+        if (!(rows.get(resource.id)?.open ?? 0))
+            return false;
+        return (board.coveredBy.get(resource.id) ?? []).length === 0;
+    });
+    const list = [...rows.values()];
+    const efforts = [...list, unassigned]
+        .map((row) => row.effort)
+        .filter((value) => value !== null);
+    return {
+        rows: list,
+        unassigned,
+        period,
+        uncovered,
+        totals: {
+            capacity: list.reduce((sum, row) => sum + row.capacity, 0),
+            open: list.reduce((sum, row) => sum + row.open, 0) + unassigned.open,
+            wip: list.reduce((sum, row) => sum + row.wip, 0),
+            effort: efforts.length ? efforts.reduce((sum, value) => sum + value, 0) : null,
+        },
+    };
+}
+//# sourceMappingURL=roster.js.map

package/dist/core/board/tasks/roster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"roster.js","sourceRoot":"","sources":["../../../../src/core/board/tasks/roster.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1E,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC3E,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AA6BxC,SAAS,QAAQ,CAAC,KAAkB,EAAE,QAAyB;IAC7D,OAAO;QACL,QAAQ;QACR,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK;QAC9D,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,EAAE,CAAC;QACP,GAAG,EAAE,CAAC;QACN,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,IAAI;QACZ,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;QAC5C,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;KACzE,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CAAC,KAAkB,EAAE,GAAY,EAAE,KAAY;IAC3D,IAAI,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QACjD,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;QACd,OAAO;IACT,CAAC;IACD,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IACd,IAAI,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;QAAE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,UAAiC,EAAE;IAEnC,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ;QAC7B,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,OAAO,CAAC,QAAS,CAAC,WAAW,EAAE,CAAC;YAC1F,IAAI,CAAC;QACP,CAAC,CAAC,IAAI,CAAC;IAET,8EAA8E;IAC9E,wEAAwE;IACxE,uDAAuD;IACvD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAE/B,MAAM,MAAM,GAAG,MAAM;QACnB,CAAC,CAAC,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC,CAAC,IAAI,CAAC;IACT,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAE9E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAmB,CAAC;IACxC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS;QAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;IACzF,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAEzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACnE,IAAI,GAAG;YAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;QACpD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC;QACtD,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACtD,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC;SAClC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;SACxB,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;IAEtD,OAAO;QACL,IAAI,EAAE,IAAI;QACV,UAAU;QACV,MAAM;QACN,SAAS;QACT,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1D,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI;YACpE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YAChD,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;SAC/E;KACF,CAAC;AACJ,CAAC"}

package/dist/core/board/tasks.d.ts

@@ -0,0 +1 @@
+export * from './tasks/index.js';

package/dist/core/board/tasks.js

@@ -0,0 +1,2 @@
+export * from './tasks/index.js';
+//# sourceMappingURL=tasks.js.map

package/dist/core/board/tasks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tasks.js","sourceRoot":"","sources":["../../../src/core/board/tasks.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC"}

package/dist/core/config/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * The board configuration: parsing `.lpm/config.yml` into a validated
+ * `BoardConfig` (schema.ts) and answering questions about it (lookup.ts).
+ * Every rule about hierarchy depth, statuses and type namespaces is resolved
+ * here so callers never inspect the raw config shape.
+ */
+export * from './lookup.js';
+export * from './remote-blocks.js';
+export * from './schema.js';

package/dist/core/config/index.js

@@ -0,0 +1,10 @@
+/**
+ * The board configuration: parsing `.lpm/config.yml` into a validated
+ * `BoardConfig` (schema.ts) and answering questions about it (lookup.ts).
+ * Every rule about hierarchy depth, statuses and type namespaces is resolved
+ * here so callers never inspect the raw config shape.
+ */
+export * from './lookup.js';
+export * from './remote-blocks.js';
+export * from './schema.js';
+//# sourceMappingURL=index.js.map

package/dist/core/config/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/config/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,cAAc,aAAa,CAAC;AAC5B,cAAc,oBAAoB,CAAC;AACnC,cAAc,aAAa,CAAC"}