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>
43 lines
1.1 KiB
JavaScript
43 lines
1.1 KiB
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.
|
|
*/
|
|
|
|
var Fraction = require("fraction.js")
|
|
|
|
function valueOfPi(val) {
|
|
|
|
let minLen = Infinity, minI = 0, min = null;
|
|
const choose = [val, val * Math.PI, val / Math.PI];
|
|
for (let i = 0; i < choose.length; i++) {
|
|
let el = new Fraction(choose[i]).simplify(1e-13);
|
|
let len = Math.log(Number(el.n) + 1) + Math.log(Number(el.d));
|
|
if (len < minLen) {
|
|
minLen = len;
|
|
minI = i;
|
|
min = el;
|
|
}
|
|
}
|
|
|
|
if (minI == 2) {
|
|
return min.toFraction().replace(/(\d+)(\/\d+)?/, (_, p, q) =>
|
|
(p == "1" ? "" : p) + "π" + (q || ""));
|
|
}
|
|
|
|
if (minI == 1) {
|
|
return min.toFraction().replace(/(\d+)(\/\d+)?/, (_, p, q) =>
|
|
p + (!q ? "/π" : "/(" + q.slice(1) + "π)"));
|
|
}
|
|
return min.toFraction();
|
|
}
|
|
|
|
console.log(valueOfPi(-3)); // -3
|
|
console.log(valueOfPi(4 * Math.PI)); // 4π
|
|
console.log(valueOfPi(3.14)); // 157/50
|
|
console.log(valueOfPi(3 / 2 * Math.PI)); // 3π/2
|
|
console.log(valueOfPi(Math.PI / 2)); // π/2
|
|
console.log(valueOfPi(-1 / (2 * Math.PI))); // -1/(2π)
|