so-dang-cool / z
Z is a Java library providing accessible, consistent function combinators.
☆27Updated last year
Alternatives and similar repositories for z:
Users that are interested in z are comparing it to the libraries listed below
- Pure Rust Distributed Hash Table☆37Updated 9 years ago
- A low level embedded information retrieval system.☆45Updated 4 years ago
- Capnp support for intellij☆16Updated 5 years ago
- Rust library for memory barrier☆35Updated 11 months ago
- ## Auto-archived due to inactivity. ## Rust's serde implementation for the Kafka protocol.☆17Updated 4 years ago
- Library for scripting analyses against crates.io's database dumps☆69Updated last month
- 🛶 Lean parametrized testing library for Rust☆21Updated 4 months ago
- experimental middleware-based minimalism async HTTP server framework☆22Updated 4 years ago
- toy project to learn about the memory usage of different workloads with different allocators☆9Updated 2 years ago
- mirror: GC implementation in Rust: http://ts.data61.csiro.au/publications/nictaabstracts/Lin_BHN_16.abstract.pml☆36Updated 8 years ago
- Yet Another Kev-Value DataBase☆19Updated last year
- Find the load at which a benchmark falls over.☆35Updated 4 years ago
- golang like task executor☆51Updated 3 years ago
- A simple utility for ensuring that certain Rust code does not compile.☆36Updated 4 years ago
- Rust implementation of Tim Bray's topfew tool☆40Updated last week
- A no-frills async memcached client for Rust.☆23Updated last month
- Thread-safe, reference-counted null-terminated immutable Rust strings.☆43Updated 3 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 3 weeks ago
- A library for logging and propagating Zipkin trace information in Rust☆54Updated 2 months ago
- A radix tree implementation☆14Updated 2 years ago
- high-efficiency concurrent reclamation☆35Updated 7 months ago
- Another builder macro-based generator☆12Updated last month
- a fast async pool based on channel☆24Updated 5 months ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆24Updated 4 years ago
- A Rust library for runtime-checked linearish types☆32Updated last year
- To futures-lite as futures-lite is to futures: smaller.☆54Updated 4 months ago
- Rust crate for managing cancellable services☆24Updated 3 years ago
- Rust web toolkit for impatient perfectionists☆41Updated 4 months ago
- A fast and simple in-memory key-value database 🦀☆62Updated 2 years ago
- A scalable, distributed message queue powered by a segmented, partitioned, replicated and immutable log.☆64Updated 11 months ago