⚡ Concurrency

• Semaphore — bounded access
• Actor Model — message passing
• Work Stealing — load balance
• MVCC — snapshot isolation
• Cooperative Scheduling — yield control
• Double Buffering — atomic swap
• Backpressure — flow control
• Event Loop — I/O multiplexing
• Logical Clock — event ordering

🏗️ Systems

• Circuit Breaker — fault tolerance
• Rate Limiter — throttle
• Retry Backoff — resilience
• Write-Ahead Log — durability
• Batch Processing — throughput
• Consistent Hashing — distribution
• Dependency Graph — ordering
• Middleware Chain — pipeline
• Registry — self-register
• Dirty Flag — deferred recompute
• LSM Tree — write-optimized store
• Checkpointing — snapshot recovery

♻️ Memory

• Object Pool — reuse instances
• Flyweight — share immutables
• Arena Allocator — bump alloc
• Free List — O(1) alloc/free
• Copy-on-Write — defer copy
• Reference Counting — auto-cleanup
• Tombstone — deferred deletion
• Interning — deduplicate values

🔄 Behavioral

• State Machine — transitions
• Observer — pub/sub
• Iterator — lazy eval
• Diff / Patch — minimal edits
• Vtable — manual polymorphism
• Visitor — tree traversal dispatch

📊 Proven In

• React · Linux · Go
• Redis · PostgreSQL
• Kafka · Chromium
• Tokio · Erlang/OTP
• LevelDB · RocksDB · etcd
• Nginx · Akka
• LLVM · Vue · Godot
• PyTorch · CPython · ZFS

The Gap This Fills

This project: code-level techniques from React, Linux, Go, Chromium — each with verifiable source links.

Patterns