Random
nextest
Random | nextest | |
---|---|---|
11 | 16 | |
1 | 1,968 | |
- | 3.3% | |
4.0 | 9.8 | |
almost 1 year ago | 6 days ago | |
Rust | Rust | |
- | 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.
Random
-
How do computers use imaginary numbers to give the results of things like the riemann zeta function?
Sure here is a an example (repository) (click "run" to see it work) contrasting the two in Rust, note that it is not fully symbolic, just the imaginary component. But the immediate advantage one can see is allowing direct computation without needing to modify the polynomial multiplication algorithm. (As noted in the source code, this is a purely theoretical advantage).
-
Hey Rustaceans! Got a question? Ask here (11/2023)!
I can't help you with the specific website, but here's a trivial cli implementation of Game of Life.
-
Announcing Malachite, a new arbitrary-precision arithmetic library
I've been sitting on my hands when it comes to updating my library, but if you really want a fast test, you can use some of my research/implementation for RCPrime, with creditation of course. I'm not sure what algorithms FLINT uses, but I'm fairly certain that the RCPrime implementation is the most efficient for integers less than 2^35 (requiring 64 multiplications and only one strong fermat test) even if you implement with Montgomery exponentiation.
-
Tip of the Day: Fast Division
Here is a sample implementation along with the inverses of the first 128 primes (in hex). (Except 2, which can be easily checked by the &1 trick)
-
What problems are you solving?
Not what one normally considers in CS, but producing a fast deterministic test for checking primality in the interval 0;2^64 with some extensions beyond. Fully constructing one to 2^128 is well beyond what is currently computable, however some progress has been made that surpasses published bounds.
-
What's everyone working on this week (12/2022)?
Working on developing a faster and smaller primality check in the interval 0;2^64 with tentative extensions towards 2^65. While it performs satisfactorily for the intervals currently available, reducing the memory to less than other implementations is a major challenge.
-
RFC: first Rust program (a hello world)
See this other approach for a similar engine, that utilizes a linear bitvector to model cellular automata.
-
IQpills from a grad student
You are way overthinking it. For something like minesweeper you can just model an integer lattice, and use either a 1d vector of integers to represent the positions of the mines or a 1d bitvector and check the values in the chebyshev distance of 1 from the point. (If you use integers like in the first example, your system becomes a plane of 2^32, 2^32 dimensions and is bounded by the number of mines (64-bit integers) that can fit in your RAM)
-
99 is breaking my isPrime function
You can look here for some slightly better ways to test for primality (ignore the different language).
-
In languages like C#, how long (relatively) do different common operations general take?
RAND calls a hardware source of Johnson-Nyquist noise (basically electric static), and then performs some filtering on it to make sure that it's evenly distributed. There are faster methods, like a simple "linear" rng, but they frequently don't give as good results.
nextest
-
Rust Tooling: 8 tools that will increase your productivity
cargo-nextest describes itself as a “next-generation Rust test runner”. To install, you need to run cargo install cargo-nextest.
-
My favourite Git commit (2019)
> On my work I make 1-15 commits a day. If I have to spend thought cycles on the commit message, that is time that goes from other productive endeavours.
I make roughly that many commits a day as well. If something's easy to understand I'll put in a simple commit message (e.g. [1]), but I do put in the effort for more complicated ones.
[1] https://github.com/nextest-rs/nextest/commit/efd194b2e1d8d61...
[2] https://github.com/oxidecomputer/omicron/commit/b07a8f593325...
-
Rust tech stack
If you need fancier testing than what's built into Rust, cargo-nextest is becoming quite popular.
-
Customizable testing framework
https://nexte.st/ is what is getting all the attention as a replacement test harness/framework these days.
-
Hey Rustaceans! Got a question? Ask here (11/2023)!
I believe cargo-nextest supports running separate binaries concurrently.
-
Fellow Rust enthusiasts: What "sucks" about Rust?
Do you already use nextest or something else? That really leans into test parallelism and sounds like a perfect fit for how you structure the tests.
- Альтернативний спосіб запускати тести
-
buffer-unordered-weighted: a variant of StreamExt::buffer_unordered where each future has a weight
I built it for cargo-nextest, in service of a new feature where some tests can be marked as heavier than others.
-
Small changes you can make in a rust codebase that have a significant impact
IMO 100% worth checking out: https://nexte.st/
-
Why does Rusts testing tools seem so much less polished compared to its other tooling?
For me, most of my needs are covered with next-test(https://nexte.st/), not that I have ever used any of the things you mentioned 😅
What are some alternatives?
nvim-bacon - bacon's companion for neovim
cargo-release - Cargo subcommand `release`: everything about releasing a rust crate.
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
cargo-limit - Productivity improvements for Rust ecosystem: warnings are skipped until errors are fixed, LSP-independent Neovim integration, etc.
Rust-CAS - Rust Computer Algebra library
cargo-deny - ❌ Cargo plugin for linting your dependencies 🦀
retro.tools-backend - Web backend for retro.tools
shadow-rs - A build-time information stored in your rust project.(binary,lib,cdylib,dylib)
ibig-rs - A big integer library in Rust with good performance.
Cargo - The Rust package manager
quickcheck - Automated property based testing for Rust (with shrinking).
TestNG - TestNG testing framework