Python fp and docs updtes (#58)

* refactor: Update comments for clarity and add expectations.json files for performance metrics

* feat: Implement FP guard for JS/TS local-collection receivers to suppress missing ownership checks

* feat: Enhance Rust parameter handling to classify local collections and prevent false ownership checks

* refactor: Simplify code formatting for better readability in multiple files

* refactor: Improve UTF-8 sequence length handling and enhance clarity in loop iteration

* feat: Update Java and Python patterns to include new security rules

* refactor: Improve comment clarity and consistency across multiple Rust files

* refactor: Simplify code formatting for improved readability in integration tests and module files

* refactor: Improve comment formatting and enhance clarity in assertions across multiple files
This commit is contained in:
Eli Peter 2026-04-29 19:53:34 -04:00 committed by GitHub
parent 4db0805de6
commit a438886217
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
291 changed files with 9485 additions and 3851 deletions

View file

@ -3,8 +3,8 @@
//! Production defaults run the scanner with `worker_threads > 1`, and callers
//! embedding `nyx_scanner` (the forthcoming `serve` UI, CI wrappers, scripted
//! harnesses) may invoke `scan_no_index` from multiple threads in the same
//! process. Shared engine state label tables, framework-detection caches,
//! tree-sitter thread-local parsers, rayon globals, `once_cell` statics
//! process. Shared engine state, label tables, framework-detection caches,
//! tree-sitter thread-local parsers, rayon globals, `once_cell` statics ,
//! must tolerate two simultaneous walks without races, panics, or diverging
//! outputs.
//!
@ -86,7 +86,7 @@ fn build_tree(root: &Path) {
}
/// Canonicalize a diag list for equality comparison. Finding output ordering
/// depends on rayon scheduling the individual fields must be identical but
/// depends on rayon scheduling, the individual fields must be identical but
/// the sequence is not. We sort by a stable composite key and stringify
/// (Diag itself doesn't derive Ord).
fn canonical_fingerprint(diags: &[Diag]) -> Vec<String> {
@ -104,7 +104,7 @@ fn two_concurrent_scans_produce_identical_findings() {
let root = tmp.path().to_path_buf();
build_tree(&root);
// Capture an initial single-threaded run so we have a reference point
// Capture an initial single-threaded run so we have a reference point ,
// if the concurrent run produced a subset we want to know whether that
// matches a known-good baseline or diverges from it.
let baseline = scan_no_index(&root, &test_cfg()).expect("baseline scan must succeed");
@ -138,7 +138,7 @@ fn two_concurrent_scans_produce_identical_findings() {
);
}
/// Four concurrent scans over the same tree larger blast radius for
/// Four concurrent scans over the same tree, larger blast radius for
/// serialization bugs in shared caches. Runs on a small tree to keep
/// CI time reasonable.
#[test]