Alessio Battistutta
thatsme
Total Packages
10
Total Downloads
2 812+
Packages
harlock
0.7.0A pure-Elixir TUI framework for Unix terminals. TEA-style model / update / view loop on top of OTP, with first-class focus traversal, layout constraints, ANSI cell-diff rendering, and a thin termios NIF for direct /dev/tty control.
tincture
0.3.2Typographic-quality PDF generation with no runtime dependencies. TeX hyphenation, Knuth-Plass line breaking, TrueType/OpenType embedding with subsetting, tables, forms, AES-256 encryption, and verified PDF/UA and PDF/A output.
phi_accrual
1.1.0Source-agnostic φ-accrual failure detector for Elixir/OTP. Observability-grade, telemetry-first, EWMA-based. Emits a continuous suspicion value per monitored node; thresholding and policy are consumer concerns.
phi_accrual_udp
1.0.0Dedicated UDP socket source for phi_accrual. Escapes BEAM distribution head-of-line blocking. Receiver-driven clock discipline; packet timestamp is diagnostic-only.
ultra_log_log
0.2.0Space-efficient distinct counting for the BEAM. Implements UltraLogLog (Ertl, VLDB 2024), a 2024 successor to HyperLogLog with 24–28% less memory at the same accuracy. Includes FGRA, MLE, and martingale estimators, CRDT merge, and bit-exact validation against the Hash4j Java reference.
phi_accrual_amqp
0.2.0Dedicated AMQP 0-9-1 consumer source for phi_accrual (RabbitMQ-class brokers; not AMQP 1.0). Treats broker deliveries as liveness signals; receiver-driven clock discipline. Envelope timestamp is diagnostic-only.
maglev
0.2.1Maglev consistent hashing: a lookup table that spreads keys almost perfectly evenly across backends and stays stable when the backend set changes.
timewarp
0.2.0Optimistic parallel discrete-event simulation (Time Warp) on the BEAM: logical processes execute events speculatively and roll back automatically on causality violations, so models implement only pure event handling and never write rollback logic.
scriba
0.1.0A projection engine for Elixir event-sourced systems.
tuplex
0.1.0A Linda tuple space for the BEAM. Processes coordinate by writing tuples into a shared store and reading them by pattern rather than by address, decoupling producer and consumer in time, space, and reference.