8839075805
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>
30 lines
704 B
JavaScript
30 lines
704 B
JavaScript
/*
|
|
Fraction.js v5.0.0 10/1/2024
|
|
https://raw.org/article/rational-numbers-in-javascript/
|
|
|
|
Copyright (c) 2024, Robert Eisele (https://raw.org/)
|
|
Licensed under the MIT license.
|
|
*/
|
|
const Fraction = require('fraction.js');
|
|
|
|
// Calculates (a/b)^(c/d) if result is rational
|
|
// Derivation: https://raw.org/book/analysis/rational-numbers/
|
|
function root(a, b, c, d) {
|
|
|
|
// Initial estimate
|
|
let x = Fraction(100 * (Math.floor(Math.pow(a / b, c / d)) || 1), 100);
|
|
const abc = Fraction(a, b).pow(c);
|
|
|
|
for (let i = 0; i < 30; i++) {
|
|
const n = abc.mul(x.pow(1 - d)).sub(x).div(d).add(x)
|
|
|
|
if (x.n === n.n && x.d === n.d) {
|
|
return n;
|
|
}
|
|
x = n;
|
|
}
|
|
return null;
|
|
}
|
|
|
|
root(18, 2, 1, 2); // 3/1
|