Releases

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

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

`rblas` bindings for `ndarray`.

Parallelization for ndarray using rayon. (Deprecated - use ndarray with rayon directly.)

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

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

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. NOTE: This crate was renamed to indexmap. Please use it under its new name.

A wrapper type to inhibit drop (destructor). ***Deprecated: Use ManuallyDrop or MaybeUninit instead!***

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

A wrapper type to inhibit drop (destructor). Implementation crate for nodrop, the untagged unions implementation (which is unstable / requires nightly) as of this writing. ***Deprecated: Use ManuallyDrop or MaybeUninit instead!***

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

Safe interface to memchr.

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

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!`, `defer_on_unwind!`, `defer_on_success!` as shorthands for guards with one of the implemented strategies.

General matrix multiplication for f32 and f64 matrices. Operates on matrices with general layout (they can use arbitrary row and column stride). Detects and uses AVX or SSE2 on x86 platforms transparently for higher performance. Uses a microkernel strategy, so that the implementation is easy to parallelize and optimize.

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

FixedBitSet is a simple bitset collection

Fast substring search for strings and byte strings. Optional SSE4.2 acceleration (if detected at runtime) 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.

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.

A macro to define lambda-like macros inline.

A grab-bag of tools for functional programming.

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.

The package provides bindings to BLAS (Fortran).

Fast subslice search

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

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

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 is an ongoing fork of bluss/indexmap that provides amortized resizes.