Implements Phases 1-8 of the TFTSR implementation plan. Rust backend (Tauri 2.x, src-tauri/): - Multi-provider AI: OpenAI-compatible, Anthropic, Gemini, Mistral, Ollama - PII detection engine: 11 regex patterns with overlap resolution - SQLCipher AES-256 encrypted database with 10 versioned migrations - 28 Tauri IPC commands for triage, analysis, document, and system ops - Ollama: hardware probe, model recommendations, pull/delete with events - RCA and blameless post-mortem Markdown document generators - PDF export via printpdf - Audit log: SHA-256 hash of every external data send - Integration stubs for Confluence, ServiceNow, Azure DevOps (v0.2) Frontend (React 18 + TypeScript + Vite, src/): - 9 pages: full triage workflow NewIssue→LogUpload→Triage→Resolution→RCA→Postmortem→History+Settings - 7 components: ChatWindow, TriageProgress, PiiDiffViewer, DocEditor, HardwareReport, ModelSelector, UI primitives - 3 Zustand stores: session, settings (persisted), history - Type-safe tauriCommands.ts matching Rust backend types exactly - 8 IT domain system prompts (Linux, Windows, Network, K8s, DB, Virt, HW, Obs) DevOps: - .woodpecker/test.yml: rustfmt, clippy, cargo test, tsc, vitest on every push - .woodpecker/release.yml: linux/amd64 + linux/arm64 builds, Gogs release upload Verified: - cargo check: zero errors - tsc --noEmit: zero errors - vitest run: 13/13 unit tests passing Co-Authored-By: Claude Sonnet 4.6 (1M context) <noreply@anthropic.com>
47 lines
1.2 KiB
JavaScript
47 lines
1.2 KiB
JavaScript
export const filterNames = new Set([
|
|
"first",
|
|
"last",
|
|
"eq",
|
|
"gt",
|
|
"nth",
|
|
"lt",
|
|
"even",
|
|
"odd",
|
|
]);
|
|
export function isFilter(s) {
|
|
if (s.type !== "pseudo")
|
|
return false;
|
|
if (filterNames.has(s.name))
|
|
return true;
|
|
if (s.name === "not" && Array.isArray(s.data)) {
|
|
// Only consider `:not` with embedded filters
|
|
return s.data.some((s) => s.some(isFilter));
|
|
}
|
|
return false;
|
|
}
|
|
export function getLimit(filter, data, partLimit) {
|
|
const num = data != null ? parseInt(data, 10) : NaN;
|
|
switch (filter) {
|
|
case "first":
|
|
return 1;
|
|
case "nth":
|
|
case "eq":
|
|
return isFinite(num) ? (num >= 0 ? num + 1 : Infinity) : 0;
|
|
case "lt":
|
|
return isFinite(num)
|
|
? num >= 0
|
|
? Math.min(num, partLimit)
|
|
: Infinity
|
|
: 0;
|
|
case "gt":
|
|
return isFinite(num) ? Infinity : 0;
|
|
case "odd":
|
|
return 2 * partLimit;
|
|
case "even":
|
|
return 2 * partLimit - 1;
|
|
case "last":
|
|
case "not":
|
|
return Infinity;
|
|
}
|
|
}
|
|
//# sourceMappingURL=positionals.js.map
|