@goodandready/dsh-key-rotation 0.8.10 → 0.8.12

package/README.md

@@ -38,6 +38,13 @@
 
 ## ⚡ Overview & The Problem
 
+### 🚀 What's New in v0.8.11 (One-click Updater & Quality Gate)
+
+- **Plugin updater in Settings**: see current/latest version and update from the card without leaving DSH (`#307`).
+- **Safer best-effort side effects**: intentional non-critical failures log at debug instead of silent empty `catch` (`#315`).
+- **Theme-only client colors** and production-path test cleanup (`#311`, `#314`).
+- **Leaner publication set**: agent-only files no longer ship in git/npm (`#308`).
+
 ### 🚀 What's New in v0.8.10 (Stream Concurrency Hardening & Auto-Pruning)
 - **Zero Concurrency Leaks**: Guaranteed release of stream concurrency slots via deterministic `try ... finally` block, preventing key starvation during clean finishes or client stream aborts.
 - **Robust Probe Retry**: Added transient network socket error retry (`PROBE_RETRY_DELAY_MS`) in `SandboxRunner.probeModels` before marking keys as broken.
@@ -164,6 +171,17 @@ graph LR
 
 ---
 
+
+### 🔁 8. One-click Plugin Updater
+
+The settings card includes an **Updater** section:
+
+1. **Check for updates** — `GET /api/dsh-key-rotation/update` returns `currentVersion`, `latestVersion`, `updateAvailable`, `canAutoUpdate` (version metadata only; no secrets).
+2. **Update now** — `POST` with the same path installs the exact latest npm version through the standard `dsh plugin add` flow. The request is accepted only from loopback with a matching same-origin `Origin`/`Host` (and the dedicated header). Cross-origin or missing-origin POST is rejected with `403`.
+3. After a successful install the UI tells you to **restart DSH** so the new host code loads.
+
+No `--force`, no raw shell, no install from worktree/DEV paths. Update runs only after an explicit click.
+
 ## 🖥️ Rich Web GUI & Dashboard
 
 Access full visual management under **Settings → Key Rotation** or via the Header quick-widget.

package/README.ru.md

@@ -36,6 +36,13 @@
 
 ---
 
+### 🚀 Что нового в v0.8.11 (обновление в один клик и quality gate)
+
+- **Обновление плагина в карточке настроек**: текущая/последняя версия и кнопка установки без выхода из DSH (#307).
+- **bestEffort вместо пустых catch**: осознанные побочные эффекты логируются на debug, а не глотаются (#315).
+- **Цвета клиента только из токенов темы** и чистка production-path тестов (#311, #314).
+- **Публикационный набор без служебных файлов агентов** (#308).
+
 ## ⚡ Обзор и решаемая проблема
 
 ### 🚀 Что нового в версии 0.8.10 (Надёжность стриминга и очистка памяти)
@@ -190,6 +197,17 @@ graph LR
 
 ---
 
+
+### 🔁 8. Обновление плагина в один клик
+
+В карточке настроек есть раздел **Updater**:
+
+1. **Проверить обновления** — `GET /api/dsh-key-rotation/update` возвращает `currentVersion`, `latestVersion`, `updateAvailable`, `canAutoUpdate` (только метаданные версии).
+2. **Обновить сейчас** — `POST` ставит точную последнюю npm-версию штатным `dsh plugin add`. Запрос принимается только с loopback и совпадающим same-origin `Origin`/`Host`; иначе `403`.
+3. После установки UI предлагает **перезапустить DSH**.
+
+Без `--force`, без raw shell и установки из worktree/DEV. Обновление — только по явному нажатию.
+
 ## 📦 Установка
 
 ```bash

package/README.zh.md

@@ -38,6 +38,13 @@
 
 ## ⚡ 概述与核心痛点
 
+### 🚀 v0.8.11 新特性（一键更新与质量门禁）
+
+- **设置卡片中的插件更新器**：查看当前/最新版本并一键安装（#307）。
+- **bestEffort 替代空 catch**：非关键副作用在 debug 级别记录，不再被静默吞掉（#315）.
+- **客户端颜色仅使用主题变量**，并清理 production-path 测试（#311、#314）。
+- **发布集不再包含代理专用文件**（#308）。
+
 ### 🚀 v0.8.10 版本新特性（流并发加固与状态自动修剪）
 - **杜绝并发计数泄漏**：在 `try ... finally` 中强制释放流并发占用，防止在正常完成或客户端中断时密钥被永久锁定。
 - **探测抗网络抖动重试**：在 `probeModels` 中遇到套接字网络临时错误时自动重试一次，避免密钥被误判损坏。

package/lib/best-effort.js

@@ -0,0 +1,26 @@
+/** Run a non-critical side effect; never throw. Logs at debug when a logger is provided. */
+export function bestEffort(label, fn, logger) {
+  const log = (err) => {
+    try {
+      logger?.debug?.(`dsh-key-rotation: best-effort ${label}`, err);
+    } catch {
+      /* logger itself must not throw */
+    }
+  };
+  try {
+    const result = fn();
+    if (result && typeof result.then === 'function') {
+      return result.then(
+        (value) => value,
+        (err) => {
+          log(err);
+          return undefined;
+        },
+      );
+    }
+    return result;
+  } catch (err) {
+    log(err);
+    return undefined;
+  }
+}

package/lib/bucket.js

@@ -1,65 +1,6 @@
-// lib/bucket.js - per-key RPM token bucket (#192) + O(1) accumulator and adaptive tuning.
+// lib/bucket.js - per-key RPM token bucket (#192).
 const WINDOW_MS = 60000;
 
-/**
- * O(1) Mathematical Token Bucket Accumulator.
- * tokens = min(capacity, tokens + (now - lastRefill) * refillRate)
- */
-export class TokenBucketAccumulator {
-  constructor(capacity, windowMs = WINDOW_MS, now = Date.now()) {
-    this.capacity = Math.max(1, capacity);
-    this.tokens = this.capacity;
-    this.windowMs = windowMs;
-    this.refillRate = this.capacity / this.windowMs; // tokens per ms
-    this.lastRefill = now;
-  }
-
-  refill(now = Date.now()) {
-    const elapsed = Math.max(0, now - this.lastRefill);
-    if (elapsed > 0) {
-      this.tokens = Math.min(this.capacity, this.tokens + elapsed * this.refillRate);
-      this.lastRefill = now;
-    }
-  }
-
-  allow(cost = 1, now = Date.now()) {
-    this.refill(now);
-    if (this.tokens >= cost) {
-      this.tokens -= cost;
-      return true;
-    }
-    return false;
-  }
-
-  retryMs(cost = 1, now = Date.now()) {
-    this.refill(now);
-    if (this.tokens >= cost) return 0;
-    const needed = cost - this.tokens;
-    return Math.ceil(needed / this.refillRate);
-  }
-
-  updateCapacity(newCapacity, now = Date.now()) {
-    this.refill(now);
-    const prevCap = this.capacity;
-    this.capacity = Math.max(1, newCapacity);
-    this.refillRate = this.capacity / this.windowMs;
-    // Scale current tokens proportionally or clamp
-    this.tokens = Math.min(this.capacity, Math.max(0, this.tokens + (this.capacity - prevCap)));
-  }
-
-  info(now = Date.now()) {
-    this.refill(now);
-    const used = Math.max(0, Math.round(this.capacity - this.tokens));
-    const remaining = Math.max(0, Math.floor(this.tokens));
-    return {
-      used,
-      remaining,
-      resetMs: this.retryMs(1, now),
-      capacity: this.capacity,
-    };
-  }
-}
-
 /** Sliding-window check: true if `ref` is under `limit` requests/min. */
 export function bucketAllow(windows, ref, limit, now = Date.now()) {
   if (!limit || limit <= 0) return true;
@@ -74,14 +15,6 @@ export function bucketAllow(windows, ref, limit, now = Date.now()) {
   return true;
 }
 
-/** Record a hit without checking (use after a successful resolve). */
-export function bucketHit(windows, ref, now = Date.now()) {
-  const cut = now - WINDOW_MS;
-  const hits = (windows.get(ref) ?? []).filter((t) => t > cut);
-  hits.push(now);
-  windows.set(ref, hits);
-}
-
 /** ms until `ref` may retry again (0 = now). */
 export function bucketRetryMs(windows, ref, limit, now = Date.now()) {
   if (!limit || limit <= 0) return 0;
@@ -108,22 +41,3 @@ export function bucketInfo(windows, ref, limit, now = Date.now()) {
   };
 }
 
-/**
- * Adaptive limit computation from HTTP headers with manual limit precedence.
- * If manualLimit is given (> 0), it acts as the upper ceiling.
- * If adaptive is enabled and upstream reports a lower limit/remaining, adapt downwards.
- */
-export function computeEffectiveLimit(headerRateLimit, manualLimit, adaptiveEnabled = true) {
-  const manual = (Number.isFinite(manualLimit) && manualLimit > 0) ? manualLimit : null;
-  if (!adaptiveEnabled || !headerRateLimit) {
-    return manual;
-  }
-  const headerLimit = headerRateLimit.limit;
-  if (Number.isFinite(headerLimit) && headerLimit > 0) {
-    if (manual) {
-      return Math.min(manual, headerLimit); // manual acts as upper ceiling
-    }
-    return headerLimit;
-  }
-  return manual;
-}

package/lib/cascade.js

@@ -1,39 +1,27 @@
-// cascade.js — cross-provider failover cascade (issue #194).
-// ponytail: minimal — pick fallback provider from a RegionMap-like config.
-
-export const CASCADE_MAX_DEPTH = 1;
-
-export function pickCascadeFallback(provider, cfg, pools) {
-  const list = Array.isArray(cfg && cfg.cascade) ? cfg.cascade : [];
-  for (const entry of list) {
-    const fb = typeof entry === 'string' ? { provider: entry } : entry;
-    if (!fb || !fb.provider || fb.provider === provider) continue;
-    const pool = pools instanceof Map ? pools.get(fb.provider) : (pools ? pools[fb.provider] : null);
-    if (!pool) continue;
-    const now = Date.now();
-    let healthy = 0;
-    for (const ref of pool.refs) {
-      const failedUntil = (pool.state && pool.state.failedUntil && pool.state.failedUntil.get(ref)) || 0;
-      if (failedUntil > now) continue;
-      const exp = pool.expiresAt ? pool.expiresAt[ref] : undefined;
-      if (exp !== undefined && now >= exp) continue;
-      healthy += 1;
-    }
-    if (healthy === 0) continue;
-    return { provider: fb.provider, pool, model: fb.model || null };
-  }
-  return null;
-}
-
-export function hasHealthyKey(pool, now) {
-  now = now || Date.now();
-  if (!pool || !Array.isArray(pool.refs)) return false;
-  for (const ref of pool.refs) {
-    const failedUntil = (pool.state && pool.state.failedUntil && pool.state.failedUntil.get(ref)) || 0;
-    if (failedUntil > now) continue;
-    const exp = pool.expiresAt ? pool.expiresAt[ref] : undefined;
-    if (exp !== undefined && now >= exp) continue;
-    return true;
-  }
-  return false;
-}
+// cascade.js — cross-provider failover cascade (issue #194).
+// ponytail: minimal — pick fallback provider from a RegionMap-like config.
+
+export const CASCADE_MAX_DEPTH = 1;
+
+export function pickCascadeFallback(provider, cfg, pools) {
+  const list = Array.isArray(cfg && cfg.cascade) ? cfg.cascade : [];
+  for (const entry of list) {
+    const fb = typeof entry === 'string' ? { provider: entry } : entry;
+    if (!fb || !fb.provider || fb.provider === provider) continue;
+    const pool = pools instanceof Map ? pools.get(fb.provider) : (pools ? pools[fb.provider] : null);
+    if (!pool) continue;
+    const now = Date.now();
+    let healthy = 0;
+    for (const ref of pool.refs) {
+      const failedUntil = (pool.state && pool.state.failedUntil && pool.state.failedUntil.get(ref)) || 0;
+      if (failedUntil > now) continue;
+      const exp = pool.expiresAt ? pool.expiresAt[ref] : undefined;
+      if (exp !== undefined && now >= exp) continue;
+      healthy += 1;
+    }
+    if (healthy === 0) continue;
+    return { provider: fb.provider, pool, model: fb.model || null };
+  }
+  return null;
+}
+