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>
68 lines
1.8 KiB
JavaScript
68 lines
1.8 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.
|
|
*/
|
|
const Fraction = require('fraction.js');
|
|
|
|
// NOTE: This is a nice example, but a stable version of this is served with Polynomial.js:
|
|
// https://github.com/rawify/Polynomial.js
|
|
|
|
function integrate(poly) {
|
|
|
|
poly = poly.replace(/\s+/g, "");
|
|
|
|
var regex = /(\([+-]?[0-9/]+\)|[+-]?[0-9/]+)x(?:\^(\([+-]?[0-9/]+\)|[+-]?[0-9]+))?/g;
|
|
var arr;
|
|
var res = {};
|
|
while (null !== (arr = regex.exec(poly))) {
|
|
|
|
var a = (arr[1] || "1").replace("(", "").replace(")", "").split("/");
|
|
var b = (arr[2] || "1").replace("(", "").replace(")", "").split("/");
|
|
|
|
var exp = new Fraction(b).add(1);
|
|
var key = "" + exp;
|
|
|
|
if (res[key] !== undefined) {
|
|
res[key] = { x: new Fraction(a).div(exp).add(res[key].x), e: exp };
|
|
} else {
|
|
res[key] = { x: new Fraction(a).div(exp), e: exp };
|
|
}
|
|
}
|
|
|
|
var str = "";
|
|
var c = 0;
|
|
for (var i in res) {
|
|
if (res[i].x.s !== -1n && c > 0) {
|
|
str += "+";
|
|
} else if (res[i].x.s === -1n) {
|
|
str += "-";
|
|
}
|
|
if (res[i].x.n !== res[i].x.d) {
|
|
if (res[i].x.d !== 1n) {
|
|
str += res[i].x.n + "/" + res[i].x.d;
|
|
} else {
|
|
str += res[i].x.n;
|
|
}
|
|
}
|
|
str += "x";
|
|
if (res[i].e.n !== res[i].e.d) {
|
|
str += "^";
|
|
if (res[i].e.d !== 1n) {
|
|
str += "(" + res[i].e.n + "/" + res[i].e.d + ")";
|
|
} else {
|
|
str += res[i].e.n;
|
|
}
|
|
}
|
|
c++;
|
|
}
|
|
return str;
|
|
}
|
|
|
|
var poly = "-2/3x^3-2x^2+3x+8x^3-1/3x^(4/8)";
|
|
|
|
console.log("f(x): " + poly);
|
|
console.log("F(x): " + integrate(poly));
|