@linxin666/dsh-client-ui-task-board 0.2.8 → 0.2.9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/LICENSE CHANGED
@@ -1,29 +1,202 @@
1
- BSD 3-Clause License
2
-
3
- Copyright (c) 2026, zhu1090093659
4
- All rights reserved.
5
-
6
- Redistribution and use in source and binary forms, with or without
7
- modification, are permitted provided that the following conditions are met:
8
-
9
- 1. Redistributions of source code must retain the above copyright notice, this
10
- list of conditions and the following disclaimer.
11
-
12
- 2. Redistributions in binary form must reproduce the above copyright notice,
13
- this list of conditions and the following disclaimer in the documentation
14
- and/or other materials provided with the distribution.
15
-
16
- 3. Neither the name of the copyright holder nor the names of its
17
- contributors may be used to endorse or promote products derived from
18
- this software without specific prior written permission.
19
-
20
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21
- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22
- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
23
- DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
24
- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25
- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
26
- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
27
- CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
28
- OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29
- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1
+
2
+ Apache License
3
+ Version 2.0, January 2004
4
+ http://www.apache.org/licenses/
5
+
6
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
7
+
8
+ 1. Definitions.
9
+
10
+ "License" shall mean the terms and conditions for use, reproduction,
11
+ and distribution as defined by Sections 1 through 9 of this document.
12
+
13
+ "Licensor" shall mean the copyright owner or entity authorized by
14
+ the copyright owner that is granting the License.
15
+
16
+ "Legal Entity" shall mean the union of the acting entity and all
17
+ other entities that control, are controlled by, or are under common
18
+ control with that entity. For the purposes of this definition,
19
+ "control" means (i) the power, direct or indirect, to cause the
20
+ direction or management of such entity, whether by contract or
21
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
22
+ outstanding shares, or (iii) beneficial ownership of such entity.
23
+
24
+ "You" (or "Your") shall mean an individual or Legal Entity
25
+ exercising permissions granted by this License.
26
+
27
+ "Source" form shall mean the preferred form for making modifications,
28
+ including but not limited to software source code, documentation
29
+ source, and configuration files.
30
+
31
+ "Object" form shall mean any form resulting from mechanical
32
+ transformation or translation of a Source form, including but
33
+ not limited to compiled object code, generated documentation,
34
+ and conversions to other media types.
35
+
36
+ "Work" shall mean the work of authorship, whether in Source or
37
+ Object form, made available under the License, as indicated by a
38
+ copyright notice that is included in or attached to the work
39
+ (an example is provided in the Appendix below).
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is conspicuously marked or otherwise
61
+ designated in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright [yyyy] [name of copyright owner]
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
package/lib/index.js CHANGED
@@ -1087,6 +1087,52 @@ var HostTaskLedger = class {
1087
1087
  scheduler
1088
1088
  };
1089
1089
  }
1090
+ /**
1091
+ * Runtime-only projection for the 5 s Host poll. It copies just primitive
1092
+ * identifiers and timestamps, never the complete task/execution history or
1093
+ * an authoritative mutable object from the ledger.
1094
+ */
1095
+ runtimeView() {
1096
+ let armedSchedules = 0;
1097
+ const openExecutions = [];
1098
+ for (const task of this.document.tasks) {
1099
+ if (task.archivedAt === void 0 && task.schedule?.enabled === true) armedSchedules += 1;
1100
+ for (const execution of task.executions) {
1101
+ if (execution.endedAt !== void 0) continue;
1102
+ openExecutions.push({
1103
+ taskId: task.id,
1104
+ executionId: execution.id,
1105
+ sessionId: execution.sessionId,
1106
+ startedAt: execution.startedAt
1107
+ });
1108
+ }
1109
+ }
1110
+ return {
1111
+ armedSchedules,
1112
+ openExecutions
1113
+ };
1114
+ }
1115
+ /** Count armed, non-archived schedules without cloning task histories. */
1116
+ armedScheduleCount() {
1117
+ let count = 0;
1118
+ for (const task of this.document.tasks) if (task.archivedAt === void 0 && task.schedule?.enabled === true) count += 1;
1119
+ return count;
1120
+ }
1121
+ /** Return value-only references for schedules due at the supplied Host time. */
1122
+ dueSchedules(now) {
1123
+ const due = [];
1124
+ for (const task of this.document.tasks) {
1125
+ if (task.archivedAt !== void 0) continue;
1126
+ const schedule = task.schedule;
1127
+ if (schedule === void 0 || !schedule.enabled || schedule.nextRunAt === void 0 || schedule.nextRunAt > now) continue;
1128
+ due.push({
1129
+ taskId: task.id,
1130
+ cron: schedule.cron,
1131
+ nextRunAt: schedule.nextRunAt
1132
+ });
1133
+ }
1134
+ return due;
1135
+ }
1090
1136
  subscribe(listener) {
1091
1137
  this.listeners.add(listener);
1092
1138
  return () => {
@@ -2062,24 +2108,33 @@ var TaskBoardHostService = class {
2062
2108
  }
2063
2109
  async pollSessions() {
2064
2110
  if (this.disposed) return;
2065
- if (!this.active && !this.hasOpenExecutions()) return;
2111
+ if (!this.active && this.ledger.runtimeView().openExecutions.length === 0) return;
2066
2112
  const running = await this.runner.listRunning();
2067
2113
  const previous = this.power.snapshot();
2114
+ if (!running.known) {
2115
+ this.power.updateReasons({
2116
+ runningSessions: previous.runningSessions,
2117
+ armedSchedules: this.ledger.armedScheduleCount(),
2118
+ sessionStateKnown: false
2119
+ });
2120
+ return;
2121
+ }
2122
+ const runtime = this.ledger.runtimeView();
2068
2123
  this.power.updateReasons({
2069
- runningSessions: running.known ? running.count : previous.runningSessions,
2070
- armedSchedules: this.armedSchedules(),
2071
- sessionStateKnown: running.known
2124
+ runningSessions: running.count,
2125
+ armedSchedules: runtime.armedSchedules,
2126
+ sessionStateKnown: true
2072
2127
  });
2073
- if (running.known) await this.reconcileExecutions(running.items);
2128
+ await this.reconcileExecutions(running.items, runtime.openExecutions);
2074
2129
  }
2075
2130
  /** Reuse the session list this poll already fetched: one list RPC per tick, not 1 + E. */
2076
- async reconcileExecutions(sessions) {
2077
- for (const task of this.ledger.state().tasks) for (const execution of task.executions) {
2078
- if (execution.sessionId === void 0 || execution.endedAt !== void 0) continue;
2131
+ async reconcileExecutions(sessions, executions) {
2132
+ for (const execution of executions) {
2133
+ if (execution.sessionId === void 0) continue;
2079
2134
  try {
2080
2135
  const result = await this.runner.inspect(execution.sessionId, execution.startedAt, sessions);
2081
2136
  if (result.outcome === "pending") continue;
2082
- this.ledger.settle(task.id, execution.id, result.outcome, "error" in result ? result.error : void 0);
2137
+ this.ledger.settle(execution.taskId, execution.executionId, result.outcome, "error" in result ? result.error : void 0);
2083
2138
  } catch {}
2084
2139
  }
2085
2140
  }
@@ -2093,20 +2148,14 @@ var TaskBoardHostService = class {
2093
2148
  this.ledger.skipMissed(now);
2094
2149
  return;
2095
2150
  }
2096
- for (const task of this.ledger.state().tasks) {
2097
- if (task.archivedAt !== void 0) continue;
2098
- const schedule = task.schedule;
2099
- if (schedule === void 0 || !schedule.enabled || schedule.nextRunAt === void 0 || schedule.nextRunAt > now) continue;
2151
+ for (const schedule of this.ledger.dueSchedules(now)) {
2100
2152
  const next = nextRunAtMs(schedule.cron, schedule.nextRunAt);
2101
- const opened = this.ledger.openScheduled(task.id, next, now);
2153
+ const opened = this.ledger.openScheduled(schedule.taskId, next, now);
2102
2154
  if (opened !== void 0) this.scheduleLaunch(opened);
2103
2155
  }
2104
2156
  }
2105
2157
  armedSchedules() {
2106
- return this.ledger.state().tasks.filter((task) => task.archivedAt === void 0 && task.schedule?.enabled === true).length;
2107
- }
2108
- hasOpenExecutions() {
2109
- return this.ledger.state().tasks.some((task) => task.executions.some((execution) => execution.endedAt === void 0));
2158
+ return this.ledger.armedScheduleCount();
2110
2159
  }
2111
2160
  scheduleLaunch(opened) {
2112
2161
  this.launch(opened).catch((error) => {
@@ -9,6 +9,24 @@ export interface OpenedRun {
9
9
  task: TaskRecord;
10
10
  execution: ExecutionRecord;
11
11
  }
12
+ /** Minimal value copy used by the Host session monitor. */
13
+ export interface OpenExecutionReference {
14
+ readonly taskId: string;
15
+ readonly executionId: string;
16
+ readonly sessionId: string | undefined;
17
+ readonly startedAt: number;
18
+ }
19
+ /** Minimal value copy used by the Host scheduler. */
20
+ export interface DueScheduleReference {
21
+ readonly taskId: string;
22
+ readonly cron: string;
23
+ readonly nextRunAt: number;
24
+ }
25
+ /** Derived runtime data for one session-poll pass. */
26
+ export interface LedgerRuntimeView {
27
+ readonly armedSchedules: number;
28
+ readonly openExecutions: readonly OpenExecutionReference[];
29
+ }
12
30
  /**
13
31
  * Best-effort single-letter process state ('R','S','D','Z',...) or undefined
14
32
  * when no probe is available on this platform. Linux reads /proc/<pid>/stat
@@ -36,6 +54,16 @@ export declare class HostTaskLedger {
36
54
  scheduler: TaskBoardSchedulerSnapshot;
37
55
  };
38
56
  state(): LedgerState;
57
+ /**
58
+ * Runtime-only projection for the 5 s Host poll. It copies just primitive
59
+ * identifiers and timestamps, never the complete task/execution history or
60
+ * an authoritative mutable object from the ledger.
61
+ */
62
+ runtimeView(): LedgerRuntimeView;
63
+ /** Count armed, non-archived schedules without cloning task histories. */
64
+ armedScheduleCount(): number;
65
+ /** Return value-only references for schedules due at the supplied Host time. */
66
+ dueSchedules(now: number): DueScheduleReference[];
39
67
  subscribe(listener: () => void): () => void;
40
68
  dispose(): void;
41
69
  applyRequest(requestId: string, action: TaskBoardAction): {
@@ -37,7 +37,6 @@ export declare class TaskBoardHostService {
37
37
  private reconcileExecutions;
38
38
  private tickSchedule;
39
39
  private armedSchedules;
40
- private hasOpenExecutions;
41
40
  private scheduleLaunch;
42
41
  private schedulePoll;
43
42
  private scheduleTick;
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "@linxin666/dsh-client-ui-task-board",
3
3
  "description": "Host-authoritative task board for the DSH Web GUI with real session execution, Host cron scheduling, and optional cross-platform idle-sleep protection; mounted without DSH source changes.",
4
- "version": "0.2.8",
4
+ "version": "0.2.9",
5
5
  "type": "module",
6
6
  "main": "lib/index.js",
7
7
  "types": "lib/types/index.d.ts",
@@ -41,6 +41,27 @@ export interface OpenedRun {
41
41
  execution: ExecutionRecord
42
42
  }
43
43
 
44
+ /** Minimal value copy used by the Host session monitor. */
45
+ export interface OpenExecutionReference {
46
+ readonly taskId: string
47
+ readonly executionId: string
48
+ readonly sessionId: string | undefined
49
+ readonly startedAt: number
50
+ }
51
+
52
+ /** Minimal value copy used by the Host scheduler. */
53
+ export interface DueScheduleReference {
54
+ readonly taskId: string
55
+ readonly cron: string
56
+ readonly nextRunAt: number
57
+ }
58
+
59
+ /** Derived runtime data for one session-poll pass. */
60
+ export interface LedgerRuntimeView {
61
+ readonly armedSchedules: number
62
+ readonly openExecutions: readonly OpenExecutionReference[]
63
+ }
64
+
44
65
  const MAX_REQUEST_CACHE = 256
45
66
 
46
67
  interface CachedRequest {
@@ -284,6 +305,50 @@ export class HostTaskLedger {
284
305
  return { revision, tasks: cloneTasks(this.document.tasks), scheduler }
285
306
  }
286
307
 
308
+ /**
309
+ * Runtime-only projection for the 5 s Host poll. It copies just primitive
310
+ * identifiers and timestamps, never the complete task/execution history or
311
+ * an authoritative mutable object from the ledger.
312
+ */
313
+ runtimeView(): LedgerRuntimeView {
314
+ let armedSchedules = 0
315
+ const openExecutions: OpenExecutionReference[] = []
316
+ for (const task of this.document.tasks) {
317
+ if (task.archivedAt === undefined && task.schedule?.enabled === true) armedSchedules += 1
318
+ for (const execution of task.executions) {
319
+ if (execution.endedAt !== undefined) continue
320
+ openExecutions.push({
321
+ taskId: task.id,
322
+ executionId: execution.id,
323
+ sessionId: execution.sessionId,
324
+ startedAt: execution.startedAt,
325
+ })
326
+ }
327
+ }
328
+ return { armedSchedules, openExecutions }
329
+ }
330
+
331
+ /** Count armed, non-archived schedules without cloning task histories. */
332
+ armedScheduleCount(): number {
333
+ let count = 0
334
+ for (const task of this.document.tasks) {
335
+ if (task.archivedAt === undefined && task.schedule?.enabled === true) count += 1
336
+ }
337
+ return count
338
+ }
339
+
340
+ /** Return value-only references for schedules due at the supplied Host time. */
341
+ dueSchedules(now: number): DueScheduleReference[] {
342
+ const due: DueScheduleReference[] = []
343
+ for (const task of this.document.tasks) {
344
+ if (task.archivedAt !== undefined) continue
345
+ const schedule = task.schedule
346
+ if (schedule === undefined || !schedule.enabled || schedule.nextRunAt === undefined || schedule.nextRunAt > now) continue
347
+ due.push({ taskId: task.id, cron: schedule.cron, nextRunAt: schedule.nextRunAt })
348
+ }
349
+ return due
350
+ }
351
+
287
352
  subscribe(listener: () => void): () => void {
288
353
  this.listeners.add(listener)
289
354
  return () => { this.listeners.delete(listener) }
@@ -1,7 +1,7 @@
1
1
  import type { ApiProxy } from '@deepseek-ai/dsh-host-apiproxy'
2
2
  import { nextRunAtMs } from './core/schedule.ts'
3
3
  import type { TaskRecord } from './core/tasks.ts'
4
- import { HostTaskLedger, type OpenedRun } from './host-ledger.ts'
4
+ import { HostTaskLedger, type OpenedRun, type OpenExecutionReference } from './host-ledger.ts'
5
5
  import { HostExecutionRunner, SessionLaunchError, type SessionCommandDispatcher, type SessionSummary } from './host-runner.ts'
6
6
  import { PowerInhibitor } from './power-inhibitor.ts'
7
7
  import type { TaskBoardAction, TaskBoardEventPayload, TaskBoardSnapshot } from './protocol.ts'
@@ -136,31 +136,43 @@ export class TaskBoardHostService {
136
136
 
137
137
  private async pollSessions(): Promise<void> {
138
138
  if (this.disposed) return
139
- if (!this.active && !this.hasOpenExecutions()) return
139
+ if (!this.active && this.ledger.runtimeView().openExecutions.length === 0) return
140
140
  const running = await this.runner.listRunning()
141
141
  const previous = this.power.snapshot()
142
+ if (!running.known) {
143
+ this.power.updateReasons({
144
+ runningSessions: previous.runningSessions,
145
+ armedSchedules: this.ledger.armedScheduleCount(),
146
+ sessionStateKnown: false,
147
+ })
148
+ return
149
+ }
150
+ // Read after the RPC so executions attached while it was in flight are
151
+ // included in this pass, matching the former full-state snapshot timing.
152
+ const runtime = this.ledger.runtimeView()
142
153
  this.power.updateReasons({
143
- runningSessions: running.known ? running.count : previous.runningSessions,
144
- armedSchedules: this.armedSchedules(),
145
- sessionStateKnown: running.known,
154
+ runningSessions: running.count,
155
+ armedSchedules: runtime.armedSchedules,
156
+ sessionStateKnown: true,
146
157
  })
147
158
  // No unconditional emit here: real changes already emit through the
148
159
  // ledger subscription (settles) and the gated power listener above.
149
- if (running.known) await this.reconcileExecutions(running.items)
160
+ await this.reconcileExecutions(running.items, runtime.openExecutions)
150
161
  }
151
162
 
152
163
  /** Reuse the session list this poll already fetched: one list RPC per tick, not 1 + E. */
153
- private async reconcileExecutions(sessions: readonly SessionSummary[]): Promise<void> {
154
- for (const task of this.ledger.state().tasks) {
155
- for (const execution of task.executions) {
156
- if (execution.sessionId === undefined || execution.endedAt !== undefined) continue
157
- try {
158
- const result = await this.runner.inspect(execution.sessionId, execution.startedAt, sessions)
159
- if (result.outcome === 'pending') continue
160
- this.ledger.settle(task.id, execution.id, result.outcome, 'error' in result ? result.error : undefined)
161
- } catch {
162
- // A transient inspection failure never settles a running execution.
163
- }
164
+ private async reconcileExecutions(
165
+ sessions: readonly SessionSummary[],
166
+ executions: readonly OpenExecutionReference[],
167
+ ): Promise<void> {
168
+ for (const execution of executions) {
169
+ if (execution.sessionId === undefined) continue
170
+ try {
171
+ const result = await this.runner.inspect(execution.sessionId, execution.startedAt, sessions)
172
+ if (result.outcome === 'pending') continue
173
+ this.ledger.settle(execution.taskId, execution.executionId, result.outcome, 'error' in result ? result.error : undefined)
174
+ } catch {
175
+ // A transient inspection failure never settles a running execution.
164
176
  }
165
177
  }
166
178
  }
@@ -175,22 +187,15 @@ export class TaskBoardHostService {
175
187
  this.ledger.skipMissed(now)
176
188
  return
177
189
  }
178
- for (const task of this.ledger.state().tasks) {
179
- if (task.archivedAt !== undefined) continue
180
- const schedule = task.schedule
181
- if (schedule === undefined || !schedule.enabled || schedule.nextRunAt === undefined || schedule.nextRunAt > now) continue
190
+ for (const schedule of this.ledger.dueSchedules(now)) {
182
191
  const next = nextRunAtMs(schedule.cron, schedule.nextRunAt)
183
- const opened = this.ledger.openScheduled(task.id, next, now)
192
+ const opened = this.ledger.openScheduled(schedule.taskId, next, now)
184
193
  if (opened !== undefined) this.scheduleLaunch(opened)
185
194
  }
186
195
  }
187
196
 
188
197
  private armedSchedules(): number {
189
- return this.ledger.state().tasks.filter((task: TaskRecord) => task.archivedAt === undefined && task.schedule?.enabled === true).length
190
- }
191
-
192
- private hasOpenExecutions(): boolean {
193
- return this.ledger.state().tasks.some(task => task.executions.some(execution => execution.endedAt === undefined))
198
+ return this.ledger.armedScheduleCount()
194
199
  }
195
200
 
196
201
  private scheduleLaunch(opened: OpenedRun): void {