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>
79 lines
1.4 KiB
Markdown
79 lines
1.4 KiB
Markdown
# fast-fifo
|
|
|
|
A fast fifo implementation similar to the one powering nextTick in Node.js core
|
|
|
|
```
|
|
npm install fast-fifo
|
|
```
|
|
|
|
Uses a linked list of growing fixed sized arrays to implement the FIFO to avoid
|
|
allocating a wrapper object for each item.
|
|
|
|
## Usage
|
|
|
|
``` js
|
|
const FIFO = require('fast-fifo')
|
|
|
|
const q = new FIFO()
|
|
|
|
q.push('hello')
|
|
q.push('world')
|
|
|
|
q.shift() // returns hello
|
|
q.shift() // returns world
|
|
```
|
|
|
|
## API
|
|
|
|
#### `q = new FIFO()`
|
|
|
|
Create a new FIFO.
|
|
|
|
#### `q.push(value)`
|
|
|
|
Push a value to the FIFO. `value` can be anything other than undefined.
|
|
|
|
#### `value = q.shift()`
|
|
|
|
Return the oldest value from the FIFO.
|
|
|
|
#### `q.clear()`
|
|
|
|
Remove all values from the FIFO.
|
|
|
|
#### `bool = q.isEmpty()`
|
|
|
|
Returns `true` if the FIFO is empty and false otherwise.
|
|
|
|
#### `value = q.peek()`
|
|
|
|
Return the oldest value from the FIFO without shifting it out.
|
|
|
|
#### `len = q.length`
|
|
|
|
Get the number of entries remaining in the FIFO.
|
|
|
|
## Benchmarks
|
|
|
|
Included in bench.js is a simple benchmark that benchmarks this against a simple
|
|
linked list based FIFO.
|
|
|
|
On my machine the benchmark looks like this:
|
|
|
|
```
|
|
fifo bulk push and shift: 2881.508ms
|
|
fifo individual push and shift: 3248.437ms
|
|
fast-fifo bulk push and shift: 1606.972ms
|
|
fast-fifo individual push and shift: 1328.064ms
|
|
fifo bulk push and shift: 3266.902ms
|
|
fifo individual push and shift: 3320.944ms
|
|
fast-fifo bulk push and shift: 1858.307ms
|
|
fast-fifo individual push and shift: 1516.983ms
|
|
```
|
|
|
|
YMMV
|
|
|
|
## License
|
|
|
|
MIT
|