Random
Repository of Random, Useful, or Novel Functions (by JASory)
nvim-bacon
bacon's companion for neovim (by Canop)
Random | nvim-bacon | |
---|---|---|
11 | 3 | |
1 | 35 | |
- | - | |
4.0 | 6.1 | |
almost 1 year ago | 12 days ago | |
Rust | Lua | |
- | GNU General Public License v3.0 only |
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.
nvim-bacon
Posts with mentions or reviews of nvim-bacon.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-05-15.
-
What's your current Vim+Rust setup?
bacon + nvim-bacon
-
Bacon not working in NeoVim?
I'm trying to get bacon to work in NeoVim with https://github.com/Canop/nvim-bacon, but it says no bacon locations loaded. I uncommented export_locations = true to prefs.toml, but it still doesn't work. I don't know where the .bacon-locations file is, or is supposed to be, or if I need to make it, all I found in the documentation was that it was necessary.
-
What's everyone working on this week (12/2022)?
Working on a neovim plugin which allows jumping to the next error/warning/test failure location in one key press, without interacting with the bacon instance running side to the editor: https://github.com/Canop/nvim-bacon
What are some alternatives?
When comparing Random and nvim-bacon you can also consider the following projects:
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
strop - Stochastically generates machine code
Rust-CAS - Rust Computer Algebra library
tracing-filter - A replacement for tracing_subscriber EnvFilter
nextest - A next-generation test runner for Rust.
bonsaidb - A developer-friendly document database that grows with you, written in Rust
retro.tools-backend - Web backend for retro.tools
ibig-rs - A big integer library in Rust with good performance.
quickcheck - Automated property based testing for Rust (with shrinking).
robust - Robust predicates for computational geometry