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>
59 lines
2.3 KiB
TypeScript
59 lines
2.3 KiB
TypeScript
import { AnyNode } from "domhandler";
|
|
/**
|
|
* Given an array of nodes, remove any member that is contained by another
|
|
* member.
|
|
*
|
|
* @category Helpers
|
|
* @param nodes Nodes to filter.
|
|
* @returns Remaining nodes that aren't contained by other nodes.
|
|
*/
|
|
export declare function removeSubsets(nodes: AnyNode[]): AnyNode[];
|
|
/**
|
|
* @category Helpers
|
|
* @see {@link http://dom.spec.whatwg.org/#dom-node-comparedocumentposition}
|
|
*/
|
|
export declare const enum DocumentPosition {
|
|
DISCONNECTED = 1,
|
|
PRECEDING = 2,
|
|
FOLLOWING = 4,
|
|
CONTAINS = 8,
|
|
CONTAINED_BY = 16
|
|
}
|
|
/**
|
|
* Compare the position of one node against another node in any other document,
|
|
* returning a bitmask with the values from {@link DocumentPosition}.
|
|
*
|
|
* Document order:
|
|
* > There is an ordering, document order, defined on all the nodes in the
|
|
* > document corresponding to the order in which the first character of the
|
|
* > XML representation of each node occurs in the XML representation of the
|
|
* > document after expansion of general entities. Thus, the document element
|
|
* > node will be the first node. Element nodes occur before their children.
|
|
* > Thus, document order orders element nodes in order of the occurrence of
|
|
* > their start-tag in the XML (after expansion of entities). The attribute
|
|
* > nodes of an element occur after the element and before its children. The
|
|
* > relative order of attribute nodes is implementation-dependent.
|
|
*
|
|
* Source:
|
|
* http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order
|
|
*
|
|
* @category Helpers
|
|
* @param nodeA The first node to use in the comparison
|
|
* @param nodeB The second node to use in the comparison
|
|
* @returns A bitmask describing the input nodes' relative position.
|
|
*
|
|
* See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for
|
|
* a description of these values.
|
|
*/
|
|
export declare function compareDocumentPosition(nodeA: AnyNode, nodeB: AnyNode): number;
|
|
/**
|
|
* Sort an array of nodes based on their relative position in the document,
|
|
* removing any duplicate nodes. If the array contains nodes that do not belong
|
|
* to the same document, sort order is unspecified.
|
|
*
|
|
* @category Helpers
|
|
* @param nodes Array of DOM nodes.
|
|
* @returns Collection of unique nodes, sorted in document order.
|
|
*/
|
|
export declare function uniqueSort<T extends AnyNode>(nodes: T[]): T[];
|
|
//# sourceMappingURL=helpers.d.ts.map
|