Releases

Parallelization for ndarray (using rayon).

`rblas` bindings for `ndarray`.

Constructors for randomized arrays. `rand` integration for `ndarray`.

An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.

Extra iterator adaptors, iterator methods, free functions, and macros.

Graph data structure library. Provides graph types and graph algorithms.

A hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual hash table functionality, it preserves insertion order except after removals, and it allows lookup of its elements by either hash table key or numerical index. A corresponding hash set type is also provided. This crate was initially published under the name ordermap, but it was renamed to indexmap.

A hash table with consistent order and fast iteration.

Collection “literal” macros for HashMap, HashSet, BTreeMap, and BTreeSet.

A wrapper type to inhibit drop (destructor). Implementation crate for nodrop, the untagged unions implementation (which is unstable / requires nightly) as of this writing.

A wrapper type to inhibit drop (destructor). Use std::mem::ManuallyDrop instead!

A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.

The enum `Either` with variants `Left` and `Right` is a general purpose sum type with two cases.

General matrix multiplication of f32 and f64 matrices in Rust. Supports matrices with general strides. Uses a microkernel strategy, so that the implementation is easy to parallelize and optimize. `RUSTFLAGS="-C target-cpu=native"` is your friend here.

A RAII scope guard that will run a given closure when it goes out of scope, even if the code between panics (assuming unwinding panic). Defines the macros `defer!` and `defer_on_unwind!`; the latter only runs if the scope is extited through unwinding on panic.

Safe interface to memchr.

Sound unchecked indexing using “generativity”; a type system approach to indices, pointers and ranges that are trusted to be in bounds.

A port of the libtest (unstable Rust) benchmark runner to Rust stable releases. Supports running benchmarks and filtering based on the name. Benchmark execution works exactly the same way and no more (caveat: black_box is still missing!).

Generate permutations of sequences. Either lexicographical order permutations, or a minimal swaps permutation sequence implemented using Heap's algorithm.

Odds and ends — collection miscellania. Extra functionality for slices (`.find()`, `RevSlice`), strings and other things. Things in odds may move to more appropriate crates if we find them.

Fast substring search for strings and byte strings. Optional SSE4.2 acceleration (requires nightly and cargo feature flag pcmp) using pcmpestri. Memchr is the only mandatory dependency. The two way algorithm is also used by rust's libstd itself, but here it is exposed both for byte strings, using memchr, and optionally using a SSE4.2 accelerated version.

FixedBitSet is a simple bitset collection

The package provides bindings to BLAS (Fortran).

The “ixlist” is a linked list in a vector, or if you want a list in a pond or an arena-allocated linked index-chasing fest. Implements a queue interface and a cursor.

A grab-bag of tools for functional programming.

Debug-print any value without trait bounds using specialization (Rust nightly channel)

Fast-math wrappers for floats; experimental and unstable; for experiments.

Very simple drawing/diagramming library with svg output.

A macro to define lambda-like macros inline.

Unchecked indexing wrapper using regular index syntax.