reed-solomon-novelpoly 2.0.0

An implementation of a reed solomon code / encoder / decoder with complexity `O(n lg(n))`
Documentation
[build-dependencies.bindgen]
optional = true
version = "0.66.1"

[build-dependencies.cc]
features = ["parallel"]
optional = true
version = "1.0.67"

[build-dependencies.derive_more]
default-features = false
features = ["add_assign", "add"]
version = "0.99.0"

[build-dependencies.fs-err]
version = "2.5.0"
[dependencies.derive_more]
default-features = false
features = ["add_assign", "add"]
version = "0.99.0"

[dependencies.static_init]
version = "1"

[dependencies.thiserror]
version = "1.0.23"
[dev-dependencies.assert_matches]
version = "1.5.0"

[dev-dependencies.itertools]
version = "0.12"

[dev-dependencies.quickcheck]
default-features = false
version = "1.0.3"

[dev-dependencies.rand]
features = ["alloc", "small_rng"]
version = "0.8.3"

[features]
avx = []
default = []
f256 = []
with-alt-cxx-impl = ["cc", "bindgen"]

[package]
authors = ["Parity Technologies <admin@parity.io>"]
description = "An implementation of a reed solomon code / encoder / decoder with complexity `O(n lg(n))`"
edition = "2021"
keywords = ["reed-solomon", "erasure", "encoding", "algorithm"]
license = "Apache-2.0 AND MIT"
name = "reed-solomon-novelpoly"
readme = "README.md"
repository = "https://github.com/paritytech/reed-solomon-novelpoly"
version = "2.0.0"