moodycamel
pest
Our great sponsors
moodycamel | pest | |
---|---|---|
11 | 42 | |
8,785 | 4,351 | |
- | 1.7% | |
3.9 | 7.6 | |
10 months ago | 18 days ago | |
C++ | Rust | |
GNU General Public License v3.0 or later | Apache 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.
moodycamel
-
Professional Usernames
Other than that... if your stuff is good, that's a much better signal than a professional username. I've seen a lot of decently unprofessional usernames out there that get taken pretty seriously because of the good work behind them. My recent favorite is "moodycamel" who authored a great concurrent queue library in C++.
-
How should you "fix your timestep" for physics?
In c++ the moodycamel ConcurrentQueue is a good choice.
-
Efficient asynchronous programming -- search keywords/basic pointers (ha)/examples?
Here's a decent concurrent queue: moodycamel::ConcurrentQueue.
-
moodycamel VS lockfree_mpmc_queue - a user suggested alternative
2 projects | 21 Apr 2022
-
Lockless Queue Not Working
Lock free programming is hard, and probably harder than you think. I would not even try something like that myself. I would look for existing solutions, something like https://github.com/cameron314/concurrentqueue for example.
-
Simple Blocking/Nonblocking Concurrent (thread-safe) Queue Adapter, header only library
I needed a concurrent queue that would block when attempting to pop an empty queue, which allows the consuming thread to suspend while it's waiting for work. I found that using mutexes allowed me to develop a simple template adapter had several advantages with few drawbacks when compared to non-blocking queues: it can use a variety of containers, the code can be reviewed and verified as to its correctness (very hard to do with fancy concurrent programming that avoids mutexes), and it is only slightly slower than fancier solutions (when I benchmarked it originally, it was 4x slower than Moody Camel's concurrent queue, which to me is fine performance).
-
Matthias Killat - Lock-free programming for real-time systems - Meeting C++ 2021
Not literatue but an example. This is a lock-free (not wait-free!) multi-producer multi-consumer queue, not a FIFO, but access patterns should be similar - if not the same: https://github.com/cameron314/concurrentqueue
-
Learning Clojure made me return back to C/C++
If I do implement it, the most likely route I'd take is make a compiler in Clojure/clojurescript that uses Instaparse (I have a more-or-less-clojure grammar written that I was tinkering with) and generate C++ code that uses Immer for its data structures and Zug for transducers and what my not-quite-clojure would support would be heavily dependent on what the C++ code and libraries I use can do. I'd use Taskflow to implement a core.async style system (not sure how to implement channels, maybe this but I'm unsure if its a good fit, but I also haven't looked). I would ultimately want to be able to interact with C++ code, so having some way to call C++ classes (even templated ones) would be a must. I'm unsure if I would just copy (and extend as needed) Clojure's host interop functionality or not. I had toyed with the idea that you can define the native types (including templates) as part of the type annotations and then the user-level code basically just looks like a normal function. But I didn't take it very far yet, haven't had the time. The reason I'd take this approach is that I'm writing a good bit of C++ again and I'd love to do that in this not-quite-clojure language, if I did make it. A bunch of languages, like Haxe and Nim compile to C or C++, so I think its a perfectly reasonable approach, and if interop works well enough, then just like Clojure was able to leverage the Java ecosystem, not-quite-clojure could be bootstrapped by leveraging the C++ ecosystem. But its mostly just a vague dream right now.
-
Recommendations for C++ library for shared memory (multiple producers/single consumer)
I would recommend https://github.com/cameron314/concurrentqueue as it's very battle tested and fast.
-
fmtlog: fastest C++ logging library using fmtlib syntax
This was explicitly considered for spdlog (using the moodycamel::ConcurrentQueue) but rejected for the above reason. I'm not involved in the development of spdlog but personally I agree, for me it's important that log output is not all mixed up.
pest
-
nom > regex
And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop
-
Jasmine, A rust-like programming language that compiles to Java
I had recently completed the first year of my Computer Science class at school and will begin my second year soon. My schools' class forces the use of Java programming language, and I absolutely hated it. So, over the course of a little less than a month, I wrote my own programming language, in Rust (objectively best programming language), using pest, to be as similar to Rust as possible, but compiling to Java.
- Restoration of the pest3 work effort 🙌 · pest-parser/pest · Discussion #885
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
I second pest.rs. Using it is fairly intuitive and there's also a live playground on their website which is great for quickly developing and testing your AST (abstract syntax tree) parser for whatever language you're implementing.
- pest v2.6.0 released with a new meta-grammar feature (node tags)
-
Finding a Crate to Help with Terminal Program Interface
This is where you'll run into trouble. People who write parsing-related Rust crates generally write things like pest that expect their syntax to be defined completely at compile time so the parser can be run through the compiler's optimizers for best performance.
-
easy way to produce a parser
Give https://pest.rs a try.
-
What is your opinion about lifetime of data generated from a parsing
For now I have used pest to generate an AST that borrows from the given input. But if I can manage to make the parser generic over the return type it may be worth a refactoring.
- Is there a parsing library (lexer?) which can handle generic tokens?
- v2.5.0: introducing `pest_debugger` · Discussion #739 · pest-parser/pest
What are some alternatives?
Boost.Compute - A C++ GPU Computing Library for OpenCL
nom - Rust parser combinator framework
MPMCQueue.h - A bounded multi-producer multi-consumer concurrent queue written in C++11
lalrpop - LR(1) parser generator for Rust
Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
readerwriterqueue - A fast single-producer, single-consumer lock-free queue for C++
chumsky - Write expressive, high-performance parsers with ease.
RaftLib - The RaftLib C++ library, streaming/dataflow concurrency via C++ iostream-like operators
pom - PEG parser combinators using operator overloading without macros.
libcds - A C++ library of Concurrent Data Structures
combine - A parser combinator library for Rust