Access the raw neighbor graph without correction.

Generate n_samples many integers from 0 to pool_size such that no integer is selected twice. Uses rejection sampling.

Create a override config to convert all rem units to px units with the `baseFontSize`

Re-upload the embedding (used by `reinit_embedding`).

Save a dataset to binary files.

Search for k nearest neighbors of a single query point using greedy graph traversal.

Select which side of a hyperplane a point falls on (for query-time tree traversal). Returns 0 for left, 1 for right.

Send a request to the WebSocket and wait for response

Interpolation between fuzzy union and intersection. Default: 1.0.

Switch optimizer. Resets the velocity (zeroed for Momentum, freed for Sgd).

Set the prop with key to value, only if value is not None. Key can be a dot-separated path for nested properties

Sift down element at position `elt` to restore max-heap property.

Returns a short non-secure hash for a string

Forward substitution: solve L * x = b in-place (b becomes x). L is m×m lower triangular, row-major. b has `cols` right-hand sides, stored as consecuti

Back substitution: solve L^T * x = b in-place.

Storage-buffer bind group layout entry.

Apply fuzzy set union: result = mix*(A + A^T - A∘A^T) + (1-mix)*(A∘A^T), where A∘A^T is the element-wise (Hadamard) product. The result is symmetric,