@things-factory/work-shift 10.1.248 → 10.1.250

package/dist-client/shift-editing.js

@@ -0,0 +1,212 @@
+/**
+ * The rules of the work-shift editor, kept out of the page so they can be tested.
+ *
+ * A shift is a name, a start (day offset + clock), an end and the work weekdays it runs on. The editor asks
+ * for the start day and both clocks; the end day follows from them: an end at or before the start clock is
+ * on the next day. Asking for it was the most common mistake on the old screen - a night shift saved with
+ * both ends on the same day is not a span at all.
+ *
+ * Weekdays are work dates, numbered like `Date.getDay()` (0 Sunday … 6 Saturday). The stored form is a sorted
+ * CSV, and the empty string means every day.
+ */
+import { minutesOf } from './shift-coverage';
+/** Display order of the week: Monday first. */
+export const WEEK = ['1', '2', '3', '4', '5', '6', '0'];
+const DAY = 24 * 60;
+const WEEK_MINUTES = 7 * DAY;
+/** The weekdays a stored value names, in display order. Empty or unreadable means every day. */
+export function daysOf(daysOfWeek) {
+    const named = new Set(String(daysOfWeek ?? '')
+        .split(',')
+        .map(day => day.trim())
+        .filter(day => WEEK.includes(day)));
+    return named.size ? WEEK.filter(day => named.has(day)) : [...WEEK];
+}
+/**
+ * The stored value for a chosen set of weekdays: '' for all seven, a sorted CSV otherwise.
+ * `undefined` when nothing is chosen - a shift that runs on no day is not a shift, and '' would read as every day.
+ */
+export function daysValue(chosen) {
+    const days = WEEK.filter(day => chosen.includes(day));
+    if (!days.length)
+        return undefined;
+    if (days.length === WEEK.length)
+        return '';
+    return [...days].sort().join(',');
+}
+/**
+ * A short label for a set of weekdays: runs of three or more consecutive days (Monday first) collapse to a
+ * range, the rest are listed. `월–금`, `월·수·금`, `토·일`, and the every-day word for all seven.
+ */
+export function daysLabel(days, name, everyDay) {
+    const ordered = WEEK.filter(day => days.includes(day));
+    if (ordered.length === WEEK.length)
+        return everyDay;
+    const runs = [];
+    for (const day of ordered) {
+        const run = runs[runs.length - 1];
+        if (run && WEEK.indexOf(run[run.length - 1]) + 1 === WEEK.indexOf(day))
+            run.push(day);
+        else
+            runs.push([day]);
+    }
+    return runs
+        .map(run => (run.length >= 3 ? `${name(run[0])}–${name(run[run.length - 1])}` : run.map(name).join('·')))
+        .join('·');
+}
+/** The end day that follows from the start: an end at or before the start clock is on the next day. */
+export function endDateOf(shift) {
+    const from = minutesOf(shift.fromTime);
+    const to = minutesOf(shift.toTime);
+    const fromDate = Number(shift.fromDate ?? 0);
+    if (from === undefined || to === undefined)
+        return fromDate;
+    return to <= from ? fromDate + 1 : fromDate;
+}
+/** The shift with its end day put right. Call after every change to a start day or a clock. */
+export function settle(shift) {
+    return { ...shift, toDate: endDateOf(shift) };
+}
+/** Length of a shift in minutes, or undefined when its clocks cannot be read. */
+export function lengthOf(shift) {
+    const from = minutesOf(shift.fromTime);
+    const to = minutesOf(shift.toTime);
+    if (from === undefined || to === undefined)
+        return undefined;
+    return Number(shift.toDate ?? 0) * DAY + to - (Number(shift.fromDate ?? 0) * DAY + from);
+}
+const clock = (minute) => {
+    const m = ((minute % DAY) + DAY) % DAY;
+    return `${String(Math.floor(m / 60)).padStart(2, '0')}:${String(m % 60).padStart(2, '0')}`;
+};
+/**
+ * The row "add shift" puts in: it starts where the last shift ends and lasts eight hours, on the same days.
+ * The work day is usually split into back-to-back shifts, so this is the next one more often than not.
+ */
+export function nextShift(shifts) {
+    const last = shifts[shifts.length - 1];
+    const lastEnd = last && minutesOf(last.toTime);
+    if (!last || lastEnd === undefined) {
+        return settle({ name: '', description: '', fromDate: 0, fromTime: '08:00', toDate: 0, toTime: '16:00', daysOfWeek: '' });
+    }
+    /* A shift that started on the next day cannot start a further one: offsets stop at the next day. */
+    const fromDate = Math.min(Number(last.toDate ?? 0), 1);
+    return settle({
+        name: '',
+        description: '',
+        fromDate,
+        fromTime: clock(lastEnd),
+        toDate: fromDate,
+        toTime: clock(lastEnd + 8 * 60),
+        daysOfWeek: last.daysOfWeek ?? ''
+    });
+}
+/**
+ * Weekdays grouped by the shifts that run on them, Monday first: one group per distinct set.
+ * A plant that runs the same shifts every day gets one group; days with no shift form a group with none.
+ */
+export function weekGroups(shifts) {
+    const groups = new Map();
+    for (const day of WEEK) {
+        const active = shifts.filter(shift => daysOf(shift.daysOfWeek).includes(day));
+        const key = active.map(shift => shifts.indexOf(shift)).join(',');
+        const group = groups.get(key) ?? { days: [], shifts: active };
+        group.days.push(day);
+        groups.set(key, group);
+    }
+    return [...groups.values()];
+}
+/**
+ * What stops a draft from saving, found before the server refuses it.
+ *
+ * The same rules as the server's content check: a non-empty unique name, readable clocks, a start day the
+ * end can follow (a shift that starts on the next day must end on it), a reason, and no two shifts running
+ * at the same time anywhere in the week - including a Friday night shift running into Saturday's first one.
+ */
+export function draftIssues(draft) {
+    const rows = new Map();
+    const flag = (index, issue) => rows.set(index, [...(rows.get(index) ?? []), issue]);
+    const names = draft.shifts.map(shift => String(shift.name ?? '').trim());
+    const windows = [];
+    draft.shifts.forEach((shift, index) => {
+        const name = names[index];
+        if (!name)
+            flag(index, 'name-missing');
+        else if (names.indexOf(name) !== index)
+            flag(index, 'name-duplicate');
+        const from = minutesOf(shift.fromTime);
+        const to = minutesOf(shift.toTime);
+        if (from === undefined || to === undefined) {
+            flag(index, 'time-missing');
+            return;
+        }
+        const toDate = endDateOf(shift);
+        if (toDate > 1) {
+            flag(index, 'ends-too-late');
+            return;
+        }
+        const start = Number(shift.fromDate ?? 0) * DAY + from;
+        const end = toDate * DAY + to;
+        /* One week and the start of the next: a shift running past Saturday night meets Sunday's in the next copy. */
+        for (const day of daysOf(shift.daysOfWeek)) {
+            for (const week of [0, 1]) {
+                const base = Number(day) * DAY + week * WEEK_MINUTES;
+                windows.push({ from: base + start, to: base + end, name: name || `#${index + 1}`, day, base });
+            }
+        }
+    });
+    windows.sort((a, b) => a.from - b.from || a.to - b.to);
+    const overlaps = [];
+    const seen = new Set();
+    let reach;
+    for (const window of windows) {
+        if (reach && window.from < reach.to) {
+            const fromMinute = window.from - window.base;
+            const key = `${reach.name}|${window.name}|${window.day}|${fromMinute}`;
+            /* The same overlap shows up in both week copies; report it once. */
+            if (!seen.has(key)) {
+                seen.add(key);
+                overlaps.push({
+                    names: [reach.name, window.name],
+                    day: window.day,
+                    fromMinute,
+                    toMinute: fromMinute + Math.min(reach.to, window.to) - window.from
+                });
+            }
+        }
+        if (!reach || window.to > reach.to)
+            reach = window;
+    }
+    const reasonMissing = draft.reason !== undefined && !String(draft.reason).trim();
+    return { rows, overlaps, reasonMissing, blocking: rows.size > 0 || overlaps.length > 0 || reasonMissing };
+}
+/** The content the server takes: trimmed names, end days put right, nothing the editor added. */
+export function shiftsContent(shifts) {
+    return shifts.map(shift => {
+        const settled = settle(shift);
+        return {
+            name: String(settled.name ?? '').trim(),
+            description: String(settled.description ?? ''),
+            fromDate: Number(settled.fromDate ?? 0),
+            fromTime: settled.fromTime,
+            toDate: settled.toDate,
+            toTime: settled.toTime,
+            daysOfWeek: settled.daysOfWeek ?? ''
+        };
+    });
+}
+/**
+ * Week overlaps folded into one line per pair and clock range: two every-day shifts that collide make one
+ * finding on seven days, not seven findings.
+ */
+export function groupOverlaps(overlaps) {
+    const groups = new Map();
+    for (const overlap of overlaps) {
+        const key = `${overlap.names.join('|')}|${overlap.fromMinute}|${overlap.toMinute}`;
+        const group = groups.get(key) ?? { names: overlap.names, days: [], fromMinute: overlap.fromMinute, toMinute: overlap.toMinute };
+        group.days.push(overlap.day);
+        groups.set(key, group);
+    }
+    return [...groups.values()].map(group => ({ ...group, days: WEEK.filter(day => group.days.includes(day)) }));
+}
+//# sourceMappingURL=shift-editing.js.map

package/dist-client/shift-editing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shift-editing.js","sourceRoot":"","sources":["../client/shift-editing.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAO5C,+CAA+C;AAC/C,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAU,CAAA;AAEhE,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAA;AACnB,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAA;AAE5B,gGAAgG;AAChG,MAAM,UAAU,MAAM,CAAC,UAA0B;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;SACrB,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;SACtB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,IAA0B,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAC5D,CAAA;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;AACpE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAyB;IACjD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IACrD,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAA;IAClC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAA;IAC1C,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACnC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,IAAuB,EAAE,IAA6B,EAAE,QAAgB;IAChG,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IACtD,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;QAAE,OAAO,QAAQ,CAAA;IAEnD,MAAM,IAAI,GAAe,EAAE,CAAA;IAC3B,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACjC,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,GAAU,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;;YAC9F,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,IAAI;SACR,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;SACxG,IAAI,CAAC,GAAG,CAAC,CAAA;AACd,CAAC;AAED,uGAAuG;AACvG,MAAM,UAAU,SAAS,CAAC,KAA0D;IAClF,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IACtC,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAA;IAC5C,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAA;IAC3D,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAA;AAC7C,CAAC;AAED,+FAA+F;AAC/F,MAAM,UAAU,MAAM,CAA0B,KAAQ;IACtD,OAAO,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAA;AAC/C,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,QAAQ,CAAC,KAAgB;IACvC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IACtC,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC5D,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAA;AAC1F,CAAC;AAED,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,EAAE;IAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAA;IACtC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAA;AAC5F,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAgC;IACxD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACtC,MAAM,OAAO,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC9C,IAAI,CAAC,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAA;IAC1H,CAAC;IACD,oGAAoG;IACpG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACtD,OAAO,MAAM,CAAC;QACZ,IAAI,EAAE,EAAE;QACR,WAAW,EAAE,EAAE;QACf,QAAQ;QACR,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC;QACxB,MAAM,EAAE,QAAQ;QAChB,MAAM,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,EAAE,CAAC;QAC/B,UAAU,EAAE,IAAI,CAAC,UAAU,IAAI,EAAE;KAClC,CAAC,CAAA;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAsB,MAAoB;IAClE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2C,CAAA;IACjE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7E,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAChE,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAA;QAC7D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACpB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;AAC7B,CAAC;AAuBD;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,KAA4D;IACtF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC1C,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,KAAe,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;IACrG,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IAGxE,MAAM,OAAO,GAAa,EAAE,CAAA;IAE5B,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;QACzB,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,cAAc,CAAC,CAAA;aACjC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,KAAK;YAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAA;QAErE,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QACtC,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAClC,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YAC3C,IAAI,CAAC,KAAK,EAAE,cAAc,CAAC,CAAA;YAC3B,OAAM;QACR,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;QAC/B,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,EAAE,eAAe,CAAC,CAAA;YAC5B,OAAM;QACR,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAA;QACtD,MAAM,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,EAAE,CAAA;QAC7B,8GAA8G;QAC9G,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,YAAY,CAAA;gBACpD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;YAChG,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAA;IAEF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;IACtD,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,IAAI,KAAyB,CAAA;IAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAA;YAC5C,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,IAAI,UAAU,EAAE,CAAA;YACtE,oEAAoE;YACpE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,QAAQ,CAAC,IAAI,CAAC;oBACZ,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC;oBAChC,GAAG,EAAE,MAAM,CAAC,GAAG;oBACf,UAAU;oBACV,QAAQ,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI;iBACnE,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE;YAAE,KAAK,GAAG,MAAM,CAAA;IACpD,CAAC;IAED,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAA;IAChF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,EAAE,CAAA;AAC3G,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,aAAa,CAAC,MAAgC;IAC5D,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;QACxB,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAC7B,OAAO;YACL,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;YACvC,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;YAC9C,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;YACvC,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,EAAE;SACrC,CAAA;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAUD;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgC;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAA;IAC9C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAA;QAClF,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAA;QAC/H,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9G,CAAC","sourcesContent":["/**\n * The rules of the work-shift editor, kept out of the page so they can be tested.\n *\n * A shift is a name, a start (day offset + clock), an end and the work weekdays it runs on. The editor asks\n * for the start day and both clocks; the end day follows from them: an end at or before the start clock is\n * on the next day. Asking for it was the most common mistake on the old screen - a night shift saved with\n * both ends on the same day is not a span at all.\n *\n * Weekdays are work dates, numbered like `Date.getDay()` (0 Sunday … 6 Saturday). The stored form is a sorted\n * CSV, and the empty string means every day.\n */\nimport { minutesOf } from './shift-coverage'\nimport type { ShiftLike } from './shift-coverage'\n\nexport interface EditableShift extends ShiftLike {\n  description?: string\n}\n\n/** Display order of the week: Monday first. */\nexport const WEEK = ['1', '2', '3', '4', '5', '6', '0'] as const\n\nconst DAY = 24 * 60\nconst WEEK_MINUTES = 7 * DAY\n\n/** The weekdays a stored value names, in display order. Empty or unreadable means every day. */\nexport function daysOf(daysOfWeek?: string | null): string[] {\n  const named = new Set(\n    String(daysOfWeek ?? '')\n      .split(',')\n      .map(day => day.trim())\n      .filter(day => (WEEK as readonly string[]).includes(day))\n  )\n  return named.size ? WEEK.filter(day => named.has(day)) : [...WEEK]\n}\n\n/**\n * The stored value for a chosen set of weekdays: '' for all seven, a sorted CSV otherwise.\n * `undefined` when nothing is chosen - a shift that runs on no day is not a shift, and '' would read as every day.\n */\nexport function daysValue(chosen: readonly string[]): string | undefined {\n  const days = WEEK.filter(day => chosen.includes(day))\n  if (!days.length) return undefined\n  if (days.length === WEEK.length) return ''\n  return [...days].sort().join(',')\n}\n\n/**\n * A short label for a set of weekdays: runs of three or more consecutive days (Monday first) collapse to a\n * range, the rest are listed. `월–금`, `월·수·금`, `토·일`, and the every-day word for all seven.\n */\nexport function daysLabel(days: readonly string[], name: (day: string) => string, everyDay: string): string {\n  const ordered = WEEK.filter(day => days.includes(day))\n  if (ordered.length === WEEK.length) return everyDay\n\n  const runs: string[][] = []\n  for (const day of ordered) {\n    const run = runs[runs.length - 1]\n    if (run && WEEK.indexOf(run[run.length - 1] as any) + 1 === WEEK.indexOf(day as any)) run.push(day)\n    else runs.push([day])\n  }\n  return runs\n    .map(run => (run.length >= 3 ? `${name(run[0])}–${name(run[run.length - 1])}` : run.map(name).join('·')))\n    .join('·')\n}\n\n/** The end day that follows from the start: an end at or before the start clock is on the next day. */\nexport function endDateOf(shift: Pick<ShiftLike, 'fromDate' | 'fromTime' | 'toTime'>): number {\n  const from = minutesOf(shift.fromTime)\n  const to = minutesOf(shift.toTime)\n  const fromDate = Number(shift.fromDate ?? 0)\n  if (from === undefined || to === undefined) return fromDate\n  return to <= from ? fromDate + 1 : fromDate\n}\n\n/** The shift with its end day put right. Call after every change to a start day or a clock. */\nexport function settle<T extends EditableShift>(shift: T): T {\n  return { ...shift, toDate: endDateOf(shift) }\n}\n\n/** Length of a shift in minutes, or undefined when its clocks cannot be read. */\nexport function lengthOf(shift: ShiftLike): number | undefined {\n  const from = minutesOf(shift.fromTime)\n  const to = minutesOf(shift.toTime)\n  if (from === undefined || to === undefined) return undefined\n  return Number(shift.toDate ?? 0) * DAY + to - (Number(shift.fromDate ?? 0) * DAY + from)\n}\n\nconst clock = (minute: number) => {\n  const m = ((minute % DAY) + DAY) % DAY\n  return `${String(Math.floor(m / 60)).padStart(2, '0')}:${String(m % 60).padStart(2, '0')}`\n}\n\n/**\n * The row \"add shift\" puts in: it starts where the last shift ends and lasts eight hours, on the same days.\n * The work day is usually split into back-to-back shifts, so this is the next one more often than not.\n */\nexport function nextShift(shifts: readonly EditableShift[]): EditableShift {\n  const last = shifts[shifts.length - 1]\n  const lastEnd = last && minutesOf(last.toTime)\n  if (!last || lastEnd === undefined) {\n    return settle({ name: '', description: '', fromDate: 0, fromTime: '08:00', toDate: 0, toTime: '16:00', daysOfWeek: '' })\n  }\n  /* A shift that started on the next day cannot start a further one: offsets stop at the next day. */\n  const fromDate = Math.min(Number(last.toDate ?? 0), 1)\n  return settle({\n    name: '',\n    description: '',\n    fromDate,\n    fromTime: clock(lastEnd),\n    toDate: fromDate,\n    toTime: clock(lastEnd + 8 * 60),\n    daysOfWeek: last.daysOfWeek ?? ''\n  })\n}\n\n/**\n * Weekdays grouped by the shifts that run on them, Monday first: one group per distinct set.\n * A plant that runs the same shifts every day gets one group; days with no shift form a group with none.\n */\nexport function weekGroups<T extends ShiftLike>(shifts: readonly T[]): { days: string[]; shifts: T[] }[] {\n  const groups = new Map<string, { days: string[]; shifts: T[] }>()\n  for (const day of WEEK) {\n    const active = shifts.filter(shift => daysOf(shift.daysOfWeek).includes(day))\n    const key = active.map(shift => shifts.indexOf(shift)).join(',')\n    const group = groups.get(key) ?? { days: [], shifts: active }\n    group.days.push(day)\n    groups.set(key, group)\n  }\n  return [...groups.values()]\n}\n\nexport type RowIssue = 'name-missing' | 'name-duplicate' | 'time-missing' | 'ends-too-late'\n\nexport interface WeekOverlap {\n  names: [string, string]\n  /** Work weekday of the later shift - the day the overlap is read on. */\n  day: string\n  /** Minutes from that work date's midnight. */\n  fromMinute: number\n  toMinute: number\n}\n\nexport interface DraftIssues {\n  /** Problems of one row, by its index. Rows without problems are absent. */\n  rows: Map<number, RowIssue[]>\n  /** Shifts that run at the same time somewhere in the week - the server refuses these. */\n  overlaps: WeekOverlap[]\n  reasonMissing: boolean\n  /** True when saving would be refused. Gaps are not here: an arrangement with gaps is allowed. */\n  blocking: boolean\n}\n\n/**\n * What stops a draft from saving, found before the server refuses it.\n *\n * The same rules as the server's content check: a non-empty unique name, readable clocks, a start day the\n * end can follow (a shift that starts on the next day must end on it), a reason, and no two shifts running\n * at the same time anywhere in the week - including a Friday night shift running into Saturday's first one.\n */\nexport function draftIssues(draft: { shifts: readonly EditableShift[]; reason?: string }): DraftIssues {\n  const rows = new Map<number, RowIssue[]>()\n  const flag = (index: number, issue: RowIssue) => rows.set(index, [...(rows.get(index) ?? []), issue])\n  const names = draft.shifts.map(shift => String(shift.name ?? '').trim())\n\n  type Window = { from: number; to: number; name: string; day: string; base: number }\n  const windows: Window[] = []\n\n  draft.shifts.forEach((shift, index) => {\n    const name = names[index]\n    if (!name) flag(index, 'name-missing')\n    else if (names.indexOf(name) !== index) flag(index, 'name-duplicate')\n\n    const from = minutesOf(shift.fromTime)\n    const to = minutesOf(shift.toTime)\n    if (from === undefined || to === undefined) {\n      flag(index, 'time-missing')\n      return\n    }\n    const toDate = endDateOf(shift)\n    if (toDate > 1) {\n      flag(index, 'ends-too-late')\n      return\n    }\n    const start = Number(shift.fromDate ?? 0) * DAY + from\n    const end = toDate * DAY + to\n    /* One week and the start of the next: a shift running past Saturday night meets Sunday's in the next copy. */\n    for (const day of daysOf(shift.daysOfWeek)) {\n      for (const week of [0, 1]) {\n        const base = Number(day) * DAY + week * WEEK_MINUTES\n        windows.push({ from: base + start, to: base + end, name: name || `#${index + 1}`, day, base })\n      }\n    }\n  })\n\n  windows.sort((a, b) => a.from - b.from || a.to - b.to)\n  const overlaps: WeekOverlap[] = []\n  const seen = new Set<string>()\n  let reach: Window | undefined\n  for (const window of windows) {\n    if (reach && window.from < reach.to) {\n      const fromMinute = window.from - window.base\n      const key = `${reach.name}|${window.name}|${window.day}|${fromMinute}`\n      /* The same overlap shows up in both week copies; report it once. */\n      if (!seen.has(key)) {\n        seen.add(key)\n        overlaps.push({\n          names: [reach.name, window.name],\n          day: window.day,\n          fromMinute,\n          toMinute: fromMinute + Math.min(reach.to, window.to) - window.from\n        })\n      }\n    }\n    if (!reach || window.to > reach.to) reach = window\n  }\n\n  const reasonMissing = draft.reason !== undefined && !String(draft.reason).trim()\n  return { rows, overlaps, reasonMissing, blocking: rows.size > 0 || overlaps.length > 0 || reasonMissing }\n}\n\n/** The content the server takes: trimmed names, end days put right, nothing the editor added. */\nexport function shiftsContent(shifts: readonly EditableShift[]): EditableShift[] {\n  return shifts.map(shift => {\n    const settled = settle(shift)\n    return {\n      name: String(settled.name ?? '').trim(),\n      description: String(settled.description ?? ''),\n      fromDate: Number(settled.fromDate ?? 0),\n      fromTime: settled.fromTime,\n      toDate: settled.toDate,\n      toTime: settled.toTime,\n      daysOfWeek: settled.daysOfWeek ?? ''\n    }\n  })\n}\n\nexport interface OverlapGroup {\n  names: [string, string]\n  /** Work weekdays it happens on, in display order. */\n  days: string[]\n  fromMinute: number\n  toMinute: number\n}\n\n/**\n * Week overlaps folded into one line per pair and clock range: two every-day shifts that collide make one\n * finding on seven days, not seven findings.\n */\nexport function groupOverlaps(overlaps: readonly WeekOverlap[]): OverlapGroup[] {\n  const groups = new Map<string, OverlapGroup>()\n  for (const overlap of overlaps) {\n    const key = `${overlap.names.join('|')}|${overlap.fromMinute}|${overlap.toMinute}`\n    const group = groups.get(key) ?? { names: overlap.names, days: [], fromMinute: overlap.fromMinute, toMinute: overlap.toMinute }\n    group.days.push(overlap.day)\n    groups.set(key, group)\n  }\n  return [...groups.values()].map(group => ({ ...group, days: WEEK.filter(day => group.days.includes(day)) }))\n}\n"]}

package/dist-client/shift-revisions.d.ts

@@ -0,0 +1,73 @@
+/**
+ * Where each revision of the shift arrangement belongs on the screen, kept out of the page so it can be tested.
+ *
+ * A revision is one whole arrangement with the moment it takes effect. Once published it has a segment in the
+ * plan: `current` (in force now), `scheduled` (takes effect later) or `expired` (replaced). Before that it is a
+ * draft, then - where changes need approval - pending, approved, rejected or withdrawn. The approval state
+ * comes from ops-master's approval flow, not from the revision row.
+ */
+import type { ShiftLike } from './shift-coverage';
+export type RevisionState = 'current' | 'scheduled' | 'expired' | 'draft' | 'pending' | 'approved' | 'rejected' | 'aborted' | 'unknown';
+export interface RevisionRow {
+    id: string;
+    revisionNumber?: number;
+    frozenAt?: string | null;
+    effectiveFrom?: string;
+    reason?: string;
+    /** How it was published, from the plan that published it; null until then. */
+    releaseKind?: 'approved' | 'policy' | 'baseline' | null;
+    shifts?: ShiftLike[];
+    [key: string]: any;
+}
+export interface Segment {
+    revisionId: string;
+    validFrom: string;
+    validTo?: string | null;
+    state: 'current' | 'scheduled' | 'expired';
+}
+export interface Overview {
+    revisions: RevisionRow[];
+    schedule: Segment[];
+}
+export interface PlacedRevision {
+    row: RevisionRow;
+    state: RevisionState;
+    /** When it is or was in force. Only published revisions have one. */
+    period?: {
+        from: string;
+        to?: string | null;
+    };
+}
+/**
+ * The state of one revision. A published one is what its segment says; an unpublished one is what its approval
+ * says, and without an approval it is a draft until it is frozen (submitted), then pending.
+ */
+export declare function revisionState(row: RevisionRow, schedule: readonly Segment[], approval?: {
+    state?: string;
+} | null): RevisionState;
+/** Revisions someone is still working on: they appear in the "changes in progress" list, not in the history. */
+export declare const OPEN_STATES: readonly RevisionState[];
+export interface PlacedOverview {
+    current?: PlacedRevision;
+    /** Takes effect later, earliest first. */
+    scheduled: PlacedRevision[];
+    /** Drafts and changes waiting for a decision, newest first. */
+    open: PlacedRevision[];
+    /** Everything decided: in force, scheduled, replaced, rejected, withdrawn - newest first. */
+    history: PlacedRevision[];
+}
+export declare function placeRevisions(overview: Overview, approvals?: Record<string, {
+    state?: string;
+} | undefined>): PlacedOverview;
+/**
+ * The first arrangement the server recorded from the shifts already in use, when revisions began. Nobody wrote
+ * its reason - the server did, for engineers - so the screen names it in the reader's words instead.
+ */
+export declare function isBaseline(row: RevisionRow): boolean;
+/** The reason as a person reads it: what its author wrote, or `baseline` for the recorded first arrangement. */
+export declare function reasonOf(row: RevisionRow, baseline: string): string;
+/**
+ * The clock range of a shift as a person reads it: `08:00 – 16:00`, `22:00 – 익일 06:00`, `전일 22:00 – 06:00`.
+ * Only a day other than the work date is named; `day(offset)` gives the word for -1 and 1.
+ */
+export declare function timeRange(shift: ShiftLike, day: (offset: number) => string): string;

package/dist-client/shift-revisions.js

@@ -0,0 +1,64 @@
+const SEGMENT_ORDER = { current: 0, scheduled: 1, expired: 2 };
+/** The segment that speaks for a revision: the one in force, else the next one, else the latest. */
+function segmentOf(schedule, revisionId) {
+    return schedule
+        .filter(segment => segment.revisionId === revisionId)
+        .sort((a, b) => SEGMENT_ORDER[a.state] - SEGMENT_ORDER[b.state] || b.validFrom.localeCompare(a.validFrom))[0];
+}
+/**
+ * The state of one revision. A published one is what its segment says; an unpublished one is what its approval
+ * says, and without an approval it is a draft until it is frozen (submitted), then pending.
+ */
+export function revisionState(row, schedule, approval) {
+    const segment = segmentOf(schedule, row.id);
+    if (segment)
+        return segment.state;
+    const said = approval?.state;
+    if (said && ['pending', 'approved', 'rejected', 'aborted', 'unknown'].includes(said))
+        return said;
+    return row.frozenAt ? 'pending' : 'draft';
+}
+/** Revisions someone is still working on: they appear in the "changes in progress" list, not in the history. */
+export const OPEN_STATES = ['draft', 'pending', 'approved', 'unknown'];
+const newestFirst = (a, b) => Number(b.row.revisionNumber ?? 0) - Number(a.row.revisionNumber ?? 0);
+export function placeRevisions(overview, approvals = {}) {
+    const placed = overview.revisions.map(row => {
+        const segment = segmentOf(overview.schedule, row.id);
+        return {
+            row,
+            state: revisionState(row, overview.schedule, approvals[row.id]),
+            ...(segment ? { period: { from: segment.validFrom, to: segment.validTo ?? null } } : {})
+        };
+    });
+    return {
+        current: placed.find(item => item.state === 'current'),
+        scheduled: placed
+            .filter(item => item.state === 'scheduled')
+            .sort((a, b) => a.period.from.localeCompare(b.period.from)),
+        open: placed.filter(item => OPEN_STATES.includes(item.state)).sort(newestFirst),
+        history: placed.filter(item => !OPEN_STATES.includes(item.state)).sort(newestFirst)
+    };
+}
+/**
+ * The first arrangement the server recorded from the shifts already in use, when revisions began. Nobody wrote
+ * its reason - the server did, for engineers - so the screen names it in the reader's words instead.
+ */
+export function isBaseline(row) {
+    return row.releaseKind === 'baseline';
+}
+/** The reason as a person reads it: what its author wrote, or `baseline` for the recorded first arrangement. */
+export function reasonOf(row, baseline) {
+    return isBaseline(row) ? baseline : row.reason ?? '';
+}
+/**
+ * The clock range of a shift as a person reads it: `08:00 – 16:00`, `22:00 – 익일 06:00`, `전일 22:00 – 06:00`.
+ * Only a day other than the work date is named; `day(offset)` gives the word for -1 and 1.
+ */
+export function timeRange(shift, day) {
+    const fromDate = Number(shift.fromDate ?? 0);
+    const toDate = Number(shift.toDate ?? 0);
+    const from = (fromDate ? `${day(fromDate)} ` : '') + String(shift.fromTime ?? '').slice(0, 5);
+    const to = (toDate ? `${day(toDate)} ` : '') + String(shift.toTime ?? '').slice(0, 5);
+    return `${from} – ${to}`;
+}
+//# sourceMappingURL=shift-revisions.js.map

package/dist-client/shift-revisions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shift-revisions.js","sourceRoot":"","sources":["../client/shift-revisions.ts"],"names":[],"mappings":"AAoDA,MAAM,aAAa,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAA;AAE9D,oGAAoG;AACpG,SAAS,SAAS,CAAC,QAA4B,EAAE,UAAkB;IACjE,OAAO,QAAQ;SACZ,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,KAAK,UAAU,CAAC;SACpD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACjH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,GAAgB,EAChB,QAA4B,EAC5B,QAAoC;IAEpC,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;IAC3C,IAAI,OAAO;QAAE,OAAO,OAAO,CAAC,KAAK,CAAA;IACjC,MAAM,IAAI,GAAG,QAAQ,EAAE,KAAK,CAAA;IAC5B,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAqB,CAAA;IAClH,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAA;AAC3C,CAAC;AAED,gHAAgH;AAChH,MAAM,CAAC,MAAM,WAAW,GAA6B,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAA;AAYhG,MAAM,WAAW,GAAG,CAAC,CAAiB,EAAE,CAAiB,EAAE,EAAE,CAC3D,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,IAAI,CAAC,CAAC,CAAA;AAEvE,MAAM,UAAU,cAAc,CAAC,QAAkB,EAAE,YAA4D,EAAE;IAC/G,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAC1C,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;QACpD,OAAO;YACL,GAAG;YACH,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/D,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,SAAS,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvE,CAAA;IACrB,CAAC,CAAC,CAAA;IAEF,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;QACtD,SAAS,EAAE,MAAM;aACd,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,WAAW,CAAC;aAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC;QAC/D,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QAC/E,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;KACpF,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAgB;IACzC,OAAO,GAAG,CAAC,WAAW,KAAK,UAAU,CAAA;AACvC,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,QAAQ,CAAC,GAAgB,EAAE,QAAgB;IACzD,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAA;AACtD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAgB,EAAE,GAA+B;IACzE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAA;IAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7F,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrF,OAAO,GAAG,IAAI,MAAM,EAAE,EAAE,CAAA;AAC1B,CAAC","sourcesContent":["/**\n * Where each revision of the shift arrangement belongs on the screen, kept out of the page so it can be tested.\n *\n * A revision is one whole arrangement with the moment it takes effect. Once published it has a segment in the\n * plan: `current` (in force now), `scheduled` (takes effect later) or `expired` (replaced). Before that it is a\n * draft, then - where changes need approval - pending, approved, rejected or withdrawn. The approval state\n * comes from ops-master's approval flow, not from the revision row.\n */\nimport type { ShiftLike } from './shift-coverage'\n\nexport type RevisionState =\n  | 'current'\n  | 'scheduled'\n  | 'expired'\n  | 'draft'\n  | 'pending'\n  | 'approved'\n  | 'rejected'\n  | 'aborted'\n  | 'unknown'\n\nexport interface RevisionRow {\n  id: string\n  revisionNumber?: number\n  frozenAt?: string | null\n  effectiveFrom?: string\n  reason?: string\n  /** How it was published, from the plan that published it; null until then. */\n  releaseKind?: 'approved' | 'policy' | 'baseline' | null\n  shifts?: ShiftLike[]\n  [key: string]: any\n}\n\nexport interface Segment {\n  revisionId: string\n  validFrom: string\n  validTo?: string | null\n  state: 'current' | 'scheduled' | 'expired'\n}\n\nexport interface Overview {\n  revisions: RevisionRow[]\n  schedule: Segment[]\n}\n\nexport interface PlacedRevision {\n  row: RevisionRow\n  state: RevisionState\n  /** When it is or was in force. Only published revisions have one. */\n  period?: { from: string; to?: string | null }\n}\n\nconst SEGMENT_ORDER = { current: 0, scheduled: 1, expired: 2 }\n\n/** The segment that speaks for a revision: the one in force, else the next one, else the latest. */\nfunction segmentOf(schedule: readonly Segment[], revisionId: string): Segment | undefined {\n  return schedule\n    .filter(segment => segment.revisionId === revisionId)\n    .sort((a, b) => SEGMENT_ORDER[a.state] - SEGMENT_ORDER[b.state] || b.validFrom.localeCompare(a.validFrom))[0]\n}\n\n/**\n * The state of one revision. A published one is what its segment says; an unpublished one is what its approval\n * says, and without an approval it is a draft until it is frozen (submitted), then pending.\n */\nexport function revisionState(\n  row: RevisionRow,\n  schedule: readonly Segment[],\n  approval?: { state?: string } | null\n): RevisionState {\n  const segment = segmentOf(schedule, row.id)\n  if (segment) return segment.state\n  const said = approval?.state\n  if (said && ['pending', 'approved', 'rejected', 'aborted', 'unknown'].includes(said)) return said as RevisionState\n  return row.frozenAt ? 'pending' : 'draft'\n}\n\n/** Revisions someone is still working on: they appear in the \"changes in progress\" list, not in the history. */\nexport const OPEN_STATES: readonly RevisionState[] = ['draft', 'pending', 'approved', 'unknown']\n\nexport interface PlacedOverview {\n  current?: PlacedRevision\n  /** Takes effect later, earliest first. */\n  scheduled: PlacedRevision[]\n  /** Drafts and changes waiting for a decision, newest first. */\n  open: PlacedRevision[]\n  /** Everything decided: in force, scheduled, replaced, rejected, withdrawn - newest first. */\n  history: PlacedRevision[]\n}\n\nconst newestFirst = (a: PlacedRevision, b: PlacedRevision) =>\n  Number(b.row.revisionNumber ?? 0) - Number(a.row.revisionNumber ?? 0)\n\nexport function placeRevisions(overview: Overview, approvals: Record<string, { state?: string } | undefined> = {}): PlacedOverview {\n  const placed = overview.revisions.map(row => {\n    const segment = segmentOf(overview.schedule, row.id)\n    return {\n      row,\n      state: revisionState(row, overview.schedule, approvals[row.id]),\n      ...(segment ? { period: { from: segment.validFrom, to: segment.validTo ?? null } } : {})\n    } as PlacedRevision\n  })\n\n  return {\n    current: placed.find(item => item.state === 'current'),\n    scheduled: placed\n      .filter(item => item.state === 'scheduled')\n      .sort((a, b) => a.period!.from.localeCompare(b.period!.from)),\n    open: placed.filter(item => OPEN_STATES.includes(item.state)).sort(newestFirst),\n    history: placed.filter(item => !OPEN_STATES.includes(item.state)).sort(newestFirst)\n  }\n}\n\n/**\n * The first arrangement the server recorded from the shifts already in use, when revisions began. Nobody wrote\n * its reason - the server did, for engineers - so the screen names it in the reader's words instead.\n */\nexport function isBaseline(row: RevisionRow): boolean {\n  return row.releaseKind === 'baseline'\n}\n\n/** The reason as a person reads it: what its author wrote, or `baseline` for the recorded first arrangement. */\nexport function reasonOf(row: RevisionRow, baseline: string): string {\n  return isBaseline(row) ? baseline : row.reason ?? ''\n}\n\n/**\n * The clock range of a shift as a person reads it: `08:00 – 16:00`, `22:00 – 익일 06:00`, `전일 22:00 – 06:00`.\n * Only a day other than the work date is named; `day(offset)` gives the word for -1 and 1.\n */\nexport function timeRange(shift: ShiftLike, day: (offset: number) => string): string {\n  const fromDate = Number(shift.fromDate ?? 0)\n  const toDate = Number(shift.toDate ?? 0)\n  const from = (fromDate ? `${day(fromDate)} ` : '') + String(shift.fromTime ?? '').slice(0, 5)\n  const to = (toDate ? `${day(toDate)} ` : '') + String(shift.toTime ?? '').slice(0, 5)\n  return `${from} – ${to}`\n}\n"]}