elfsternberg / boggle-solverLinks
A Boggle™ Solver in Rust
☆24Updated 6 years ago
Alternatives and similar repositories for boggle-solver
Users that are interested in boggle-solver are comparing it to the libraries listed below
Sorting:
- A trait to abstract over common tree functionality☆35Updated 5 years ago
- Concurrent hash trie☆58Updated 5 years ago
- Retriever stores ordinary rust data types in a similar manner as a NoSQL database.☆47Updated 2 years ago
- How to structure concurrent workflows in Rust, via five simple examples.☆32Updated 5 years ago
- A macro to generate Rust actors☆46Updated 4 years ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 5 years ago
- Collection of typed data structures, trait operators and aliases☆51Updated 5 years ago
- Set theory applied on sorted and deduplicated slices.☆47Updated 3 years ago
- Run a function after some data was mutably borrowed☆30Updated 5 years ago
- Spawn processes with arbitrary closures in rust☆113Updated 4 years ago
- Generate is a library for building iterators on the fly☆39Updated 4 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- ☆24Updated 2 years ago
- PEG parser generator built on top of nom☆70Updated 6 years ago
- A Cargo plugin to list unsafe code in a Rust project.☆46Updated 7 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- Derive macro for generating arrays from struct fields.☆20Updated 3 years ago
- A fast, small, full-featured, no-std compatible oneshot channel☆60Updated last year
- A safe-guarded transmute for Rust☆39Updated last year
- impl Stream for (your own) Generator☆18Updated 6 years ago
- Simple Opinionated Networking in Rust☆54Updated 5 years ago
- "Freedom from syn": Proc macro tools for operating on token trees☆108Updated 5 years ago
- Asynchronous byte buffers and pipes for concurrent I/O programming.☆102Updated 3 months ago
- To futures-lite as futures-lite is to futures: smaller.☆54Updated 10 months ago
- ☆21Updated 5 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆23Updated 4 years ago
- A trait-based system for creating async Wakers. Because RawWakers are healthier after they've been cooked.☆21Updated 4 years ago
- Faster, more flexible and more correct alternative to core::fmt☆40Updated 5 years ago
- Build and evaluate binary expression trees☆37Updated last year
- Custom exit status codes with ? in main☆29Updated 6 years ago