* Execute JavaScript

* Evaluate a proposed change against baseline metrics

* Evaluate input text for threats (pre-processing gate). * * Checks for prompt injection, jailbreak attempts, and PII based * on the configur

* Evaluate all gates for a tool use

* Evict oldest events when maxEvents is exceeded. * Trims 10% in a batch to amortize the O(n) splice cost.

* Find ground truth top-k by exact search.

* iter 56 — async variant of execCli. Used by oia-audit.mjs to parallelize * its 5 subprocess calls, dropping worst-case wall-clock from 5×TIMEOUT *

* iter 56 — async variant of execCli. Used by oia-audit.mjs to parallelize * its 5 subprocess calls, dropping worst-case wall-clock from 5×TIMEOUT *

* Execute attention operation.

* Execute a daemon task

* Internal execution logic

* Execute multiple hooks in parallel * * @param events - Array of hook events * @param contexts - Array of contexts (matched by index) * @

* Execute a request to the provider

* Executes a command with streaming output. * * @param command - Command to execute * @param args - Command arguments * @returns Streaming

* Execute multiple tasks concurrently

* Execute a request on a specific provider with retry.

* Execute a worker with timeout protection

* Execute a worker with concurrency control (P0 fix)

Fetch expected returns aligned with the matrix's node order.

Recovery explanation — prior breaks + suggested alternatives.

* Export patterns for analysis

* Export patterns for backup/transfer

* Export current state.

Extract all EXPOSE directives from a Dockerfile

* Extract file path from task description

* Extract meaningful keywords from task description

* Extract a pattern from a trajectory * Target: <5ms

Extract the raw 32-byte Ed25519 public key as hex.

* Extract rules from a content block

* Extract sections from markdown content

* Fast dot product with 8x unrolling

* Convert feature vector to state key * Uses locality-sensitive hashing for similar contexts. * * #2239 — the previous fold was `((hash << 4)

* Fetch beads by IDs with caching, batch deduplication, and object pooling. * Uses PooledBead from memory module for reduced allocations.

* Find all ancestors of a node (including the node itself)

* Find all unclaimed issues matching filters

* Find backdoor paths from treatment to outcome * A backdoor path is a path that goes into the treatment node

* Find best teammate match for a task

* Find critical path internally

* Find the git root directory by walking up from a starting directory. * Synchronous variant for path resolution (no async needed for stat checks).

* Find matching patterns for a query embedding * Target: <1ms

* Finds the nearest centroid index for a subvector.

* Find source helpers directory. * Validates that the directory contains hook-handler.cjs to avoid * returning the target directory or an incomplete

* Compute flash attention (optimized for long sequences) * Achieves 2.49x-7.47x speedup over standard attention

* Compute flash attention