integer-sqrt-rs/Cargo.toml

[package]
name = "integer-sqrt"
description = """
An implementation of integer square root algorithm for primitive rust types"""
version = "0.1.3"
authors = ["Richard Dodd <richard.dodd@itp-group.co.uk>"]
include = ["src/**/*.rs", "Cargo.toml"]
repository = "https://github.com/derekdreery/integer-sqrt-rs"
readme = "README.md"
keywords = ["integer", "square", "root", "isqrt", "sqrt"]
categories = ["algorithms", "no-std"]
license = "Apache-2.0/MIT"

[dependencies]
num-traits = "0.2"
First commit 2017-10-23 08:14:24 -04:00			`[package]`
			`name = "integer-sqrt"`
			`description = """`
			`An implementation of integer square root algorithm for primitive rust types"""`
Fix overflow in some edge cases. 2020-01-24 07:25:14 -05:00			`version = "0.1.3"`
First commit 2017-10-23 08:14:24 -04:00			`authors = ["Richard Dodd <richard.dodd@itp-group.co.uk>"]`
			`include = ["src/*/.rs", "Cargo.toml"]`
			`repository = "https://github.com/derekdreery/integer-sqrt-rs"`
			`readme = "README.md"`
			`keywords = ["integer", "square", "root", "isqrt", "sqrt"]`
			`categories = ["algorithms", "no-std"]`
			`license = "Apache-2.0/MIT"`

Use improved algorithm that only uses shifts This new algorithm (taken from Wikipedia) only uses shifts, addditions, and subtrations. On my x86_64 machine, the benchmarks are over twice as fast. This also takes num-traits as a dependancy, so that the implementation can be a normal generic function, instread of a macro. Signed-off-by: Joe Richey <joerichey@google.com> 2020-09-07 23:10:09 -04:00			`[dependencies]`
			`num-traits = "0.2"`