Random
Repository of Random, Useful, or Novel Functions (by JASory)
crates.io
The Rust package registry (by rust-lang)
Random | crates.io | |
---|---|---|
11 | 662 | |
1 | 2,814 | |
- | 1.6% | |
4.0 | 10.0 | |
almost 1 year ago | 6 days ago | |
Rust | Rust | |
- | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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
Posts with mentions or reviews of Random.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-13.
-
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.
crates.io
Posts with mentions or reviews of crates.io.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-04-28.
-
Create a Custom GitHub Action in Rust
Rust has a rich ecosystem of frameworks and libraries that let you read, parse, and manipulate text files, interact with cloud services and databases, and perform any other job that your project's development workflow may require. And because of its strong typing and tight memory management, you are much less likely to write programs that behave unexpectedly in production.
-
Rust Keyword Extraction: Creating the YAKE! algorithm from scratch
All the code discussed in this article can be accessed through this repository. For integration with existing projects consider using keyword_extraction crate available on crates.io.
-
Migrating a JavaScript frontend to Leptos, a Rust framework
So, be sure to double-check your critical libraries and be sure their alternatives exist in the Rust ecosystem. Thereβs a good chance the crates you need are available in Rust's crates.io repository.
-
Learning Rust: A clean start
The previous section was very simple, this section is also very simple but introduces us to cargo which is Rust's package manager, as a JS dev my mind goes straight to NPM.
-
#2 Rust - Cargo Package Manager
Now, there has to be a place where all these packages come from. Similar to npmjs registry, where all node packages are registered, stored and retrieved, Rust also has something called crates.io where many helpful packages and dependencies are registered.
-
Rust π¦ Installation + Hello World
Before proceeding, let's check https://crates.io/, the official Rust package registry.
-
Underestimating rust for my Project.
The most thrilling aspect has been the joy of writing the backend. It's like every struct, enum, and method in Rust forms this interconnected Multiverse of code , which you can see in crates.io which is best Documentation experience I Ever Had.
-
Top 10 Rusty Repositories for you to start your Open Source Journey
5. Crates.io
-
Project Structure Clarification Coming From Python - With Example
When using crates from eg. crates.io, and also things like std and core
-
Cargo has never frustrated me like npm or pip has. Does Cargo ever get frustrating? Does anyone ever find themselves in dependency hell?
Vendoring your packages was very tedious to even remotely get to work with Cargo. I spent a very long time getting Cargo to work together with cargo-local-registry. We vendor crates from crates.io and a custom internal registry.
What are some alternatives?
When comparing Random and crates.io you can also consider the following projects:
nvim-bacon - bacon's companion for neovim
docs.rs - crates.io documentation generator
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
plotters - A rust drawing library for high quality data plotting for both WASM and native, statically and realtimely π¦ ππ
Rust-CAS - Rust Computer Algebra library
Cargo - The Rust package manager
nextest - A next-generation test runner for Rust.
trunk - Build, bundle & ship your Rust WASM application to the web.
retro.tools-backend - Web backend for retro.tools
gtk4-rs - Rust bindings of GTK 4
ibig-rs - A big integer library in Rust with good performance.
Rocket - A web framework for Rust.