hypergraph
rpds
Our great sponsors
hypergraph | rpds | |
---|---|---|
7 | 3 | |
267 | 1,125 | |
- | - | |
2.4 | 7.6 | |
about 1 month ago | 2 months ago | |
Rust | Rust | |
MIT License | Mozilla Public License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
hypergraph
-
Hypergraph - a data structure library to generate directed hypergraphs
Thanks! There's some benchmarks done here https://github.com/yamafaktory/hypergraph/blob/main/benches/performance.rs but you have to clone the project and test it locally. I can also move that to the CI workflow.
- Hypergraph - a data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
-
Show HN: Hypergraph, a data structure library to generate directed hypergraphs
What triggers the initial willingness to implement something with hypergraphs was indeed the Wolfram physics project! https://github.com/yamafaktory/hypergraph/discussions/11#dis...
- Show HN: Hypergraph, a Rust data structure library to create directed hypegraphs
rpds
-
Getting both a mutable and immutable reference to a shared structure?
Another option I can think of - but not completely sure how one would implement in Rust - would be to never mutate the shared state, but rather when updating it - completely swapping it out with a completely new copy of the desired state. There's lots of different ways to go about doing this - each with their own trade offs. But using some form of Persistent Data Structure would probably be a good way to start. If you only have a single writer - then I believe using a Cell and simply updating which version of the structure is being read could work. rpds seems to be a decent start to look at these sorts of structures in Rust.
-
Learning Clojure made me return back to C/C++
Thanks for taking the time to provide a detailed response. Need to think on this. I had actually started a regular Clojure parser using LLVM as a hobby, but then my friend said it was better to implement this in a safe-memory and. save-concurrency language like Rust and leverage cranelift for code generation. So, now I am learning rust, lol. (Btw, Rust has a persistent data structures lib too: https://github.com/orium/rpds )
-
Persisting data that has revisions for values
Take a look at https://github.com/orium/rpds or one of the many others.
What are some alternatives?
Rust - All Algorithms implemented in Rust
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
Toshi - A full-text search engine in rust
rust-rocksdb - rust wrapper for rocksdb
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
cranelift - Cranelift code generator
hello-world.rs - 🚀Memory safe, blazing fast, configurable, minimal hello world written in rust(🚀) in a few lines of code with few(1092🚀) dependencies🚀
pest - The Elegant Parser
grid - Two dimensional grid data structure
bimap-rs - Generic bijective maps in Rust
perfecthash - A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.