| 1 | [package] |
|---|
| 2 | name = "ryu" |
|---|
| 3 | version = "1.0.17" # don't forget to update html_root_url |
|---|
| 4 | authors = ["David Tolnay <dtolnay@gmail.com>" ] |
|---|
| 5 | categories = ["value-formatting" , "no-std" , "no-std::no-alloc" ] |
|---|
| 6 | description = "Fast floating point to string conversion" |
|---|
| 7 | documentation = "https://docs.rs/ryu" |
|---|
| 8 | edition = "2018" |
|---|
| 9 | exclude = ["performance.png" , "chart/**" ] |
|---|
| 10 | keywords = ["float" ] |
|---|
| 11 | license = "Apache-2.0 OR BSL-1.0" |
|---|
| 12 | repository = "https://github.com/dtolnay/ryu" |
|---|
| 13 | rust-version = "1.36" |
|---|
| 14 | |
|---|
| 15 | [features] |
|---|
| 16 | # Use smaller lookup tables. Instead of storing every required power of |
|---|
| 17 | # 5, only store every 26th entry, and compute intermediate values with a |
|---|
| 18 | # multiplication. This reduces the lookup table size by about 10x (only |
|---|
| 19 | # one case, and only f64) at the cost of some performance. |
|---|
| 20 | small = [] |
|---|
| 21 | |
|---|
| 22 | [dependencies] |
|---|
| 23 | no-panic = { version = "0.1" , optional = true } |
|---|
| 24 | |
|---|
| 25 | [dev-dependencies] |
|---|
| 26 | num_cpus = "1.8" |
|---|
| 27 | rand = "0.8" |
|---|
| 28 | rand_xorshift = "0.3" |
|---|
| 29 | |
|---|
| 30 | [lib] |
|---|
| 31 | doc-scrape-examples = false |
|---|
| 32 | |
|---|
| 33 | [package.metadata.docs.rs] |
|---|
| 34 | targets = ["x86_64-unknown-linux-gnu" ] |
|---|
| 35 | rustdoc-args = ["--generate-link-to-definition" ] |
|---|
| 36 | |
|---|
