Results for complexity_assert

A complex number library

Test the computational complexity (big-O) of Rust algorithms

Composable complex-number primitives for RustUse.

A Rust type library that is as easy to use as Python built-in types.

A datatype library that allows for measurement unit association, conversion, and operations for values.

enum2str is a rust derive macro that creates a Display impl for enums. This is useful for strongly typing composable sets of strings.

Space Efficient Pretty Printer

Default, positional and named parameters

Rust implementation of the BEVE (Binary Efficient Versatile Encoding) specification with serde support

A procedural macro for ergonomic structural assertions in tests

A fluent, Jest-like testing library for Rust

Reactive Extensions for the Bevy game engine

They are some performance critical pieces of code that will be executed on huge data sets, which we want to make sure will run fast enough. Unfortunately, enforcing this is not easy, often requiring large scale and slow benchmarks. This rspec library (the result of an experiment to learn machine learning) uses linear regression to determine the time complexity (Big O notation, O(x)) of a piece of code and to check that it is at least as good as what we expect. This does not require huge data sets (only a few large ones) and can be written as any unit test (not as fast though).