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>
70 lines
2.2 KiB
JavaScript
70 lines
2.2 KiB
JavaScript
"use strict";
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
exports.sequence = exports.generate = exports.compile = exports.parse = void 0;
|
|
var parse_js_1 = require("./parse.js");
|
|
Object.defineProperty(exports, "parse", { enumerable: true, get: function () { return parse_js_1.parse; } });
|
|
var compile_js_1 = require("./compile.js");
|
|
Object.defineProperty(exports, "compile", { enumerable: true, get: function () { return compile_js_1.compile; } });
|
|
Object.defineProperty(exports, "generate", { enumerable: true, get: function () { return compile_js_1.generate; } });
|
|
/**
|
|
* Parses and compiles a formula to a highly optimized function.
|
|
* Combination of {@link parse} and {@link compile}.
|
|
*
|
|
* If the formula doesn't match any elements,
|
|
* it returns [`boolbase`](https://github.com/fb55/boolbase)'s `falseFunc`.
|
|
* Otherwise, a function accepting an _index_ is returned, which returns
|
|
* whether or not the passed _index_ matches the formula.
|
|
*
|
|
* Note: The nth-rule starts counting at `1`, the returned function at `0`.
|
|
*
|
|
* @param formula The formula to compile.
|
|
* @example
|
|
* const check = nthCheck("2n+3");
|
|
*
|
|
* check(0); // `false`
|
|
* check(1); // `false`
|
|
* check(2); // `true`
|
|
* check(3); // `false`
|
|
* check(4); // `true`
|
|
* check(5); // `false`
|
|
* check(6); // `true`
|
|
*/
|
|
function nthCheck(formula) {
|
|
return (0, compile_js_1.compile)((0, parse_js_1.parse)(formula));
|
|
}
|
|
exports.default = nthCheck;
|
|
/**
|
|
* Parses and compiles a formula to a generator that produces a sequence of indices.
|
|
* Combination of {@link parse} and {@link generate}.
|
|
*
|
|
* @param formula The formula to compile.
|
|
* @returns A function that produces a sequence of indices.
|
|
* @example <caption>Always increasing</caption>
|
|
*
|
|
* ```js
|
|
* const gen = nthCheck.sequence('2n+3')
|
|
*
|
|
* gen() // `1`
|
|
* gen() // `3`
|
|
* gen() // `5`
|
|
* gen() // `8`
|
|
* gen() // `11`
|
|
* ```
|
|
*
|
|
* @example <caption>With end value</caption>
|
|
*
|
|
* ```js
|
|
*
|
|
* const gen = nthCheck.sequence('-2n+5');
|
|
*
|
|
* gen() // 0
|
|
* gen() // 2
|
|
* gen() // 4
|
|
* gen() // null
|
|
* ```
|
|
*/
|
|
function sequence(formula) {
|
|
return (0, compile_js_1.generate)((0, parse_js_1.parse)(formula));
|
|
}
|
|
exports.sequence = sequence;
|
|
//# sourceMappingURL=index.js.map
|