mir-algorithm
Dlang Core Library (by libmir)
staticstep
Provides truly zero-cost alternatives to Iterator::step_by for both incrementing and decrementing any type that satisfies RangeBounds<T: Copy + Default + Step>. (by slightlyoutofphase)
| mir-algorithm | staticstep | |
|---|---|---|
| 1 | 5 | |
| 172 | 13 | |
| 0.0% | - | |
| 4.4 | 0.0 | |
| 10 days ago | over 2 years ago | |
| D | Rust | |
| GNU General Public License v3.0 or later | 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.
mir-algorithm
Posts with mentions or reviews of mir-algorithm.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-21.
-
embedrv2: Call D functions from R
[1] https://github.com/libmir/mir-algorithm/blob/master/source/mir/ndslice/connect/cpython.d
staticstep
Posts with mentions or reviews of staticstep.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-30.
- StaticStep 0.4.0: zero-overhead StepBy-like functionality for primitive RangeBounds implementors, now also with full-gamut integer overflow handling equivalent to that of StepBy
-
A critique of Rust's range types
TLDR it now completely matches StepBy's behaviour and still is not any slower than it was previously.
-
My Rust port of Prime Generator benchmark needs some optimization.
I was even inspired to make a little crate a few days ago that tries to offer a decent solution, after encountering someone else with basically the same optimization problem OP has.
- staticstep: bi-directional `step_by`-like functionality that actually optimizes well for the common use case of primitive ranges
What are some alternatives?
When comparing mir-algorithm and staticstep you can also consider the following projects:
range-v3 - Range library for C++14/17/20, basis for C++20's std::ranges
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
js-iterators - Ruby style iterators in JS
tref - Tree in Rows Elemental Format. Rust crate to parse, store and serialize trees.
ctl - My variant of the C Template Library
itertools - Extra iterator adaptors, iterator methods, free functions, and macros.
IntervalUtility - .Net C # utility for working with intervals, such as time periods. The utility allows you to find intersections of periods, exclude periods, etc.
const-chunks - Extension trait to chunk iterators into const-length arrays.