Results for callable_tree

A highly parallel Perl 5 interpreter written in Rust

Pure-Rust AV1 codec — orphan-rebuild scaffold pending clean-room re-implementation.

Elicitation-enabled ratatui TUI tools — dual-mode MCP tools with code emission

A library for decoding, classifying, normalizing, and re-emitting mangled, decorated, and runtime symbol names across a wide spread of compiler, platform, and language ecosystems.

Code graph generation using Tree-sitter AST parsing

Elicitation-enabled accesskit type wrappers — newtypes with JsonSchema and MCP reflect methods

Composable, parser-combinator-style abstraction over tree-sitter node dispatch

Spread analytics for the Convex fixed income analytics library

Simple, effective agent loop with tool execution and event streaming

Tree-walking ECMAScript interpreter built on ecma-syntax-cat. Evaluates Script programs to Values with a persistent heap and lexical environment, plus native (Rust-implemented) callables for embedder-supplied built-ins. No mut, no Rc/Arc, no interior mutability, no panics, exhaustive matches. Comp-cat-rs reformulation of the Boa engine core, targeting Tauri integration.

A prolly (probabilistic) tree for efficient storage, retrieval, and modification of ordered data.

Local-first MCP server for code understanding.

CallableTree provides a framework for organizing complex logic into a tree of callable nodes. It allows you to chain execution from a root node to leaf nodes based on matching conditions. Key features include multiple traversal strategies: `seekable` (like nested `if`/`case`), `broadcastable` (one-to-many execution), and `composable` (pipelined processing). Supports class-based, builder-style and factory-style definitions.