aboutsummaryrefslogtreecommitdiff
path: root/vendor/ryu/tests
diff options
context:
space:
mode:
authorValentin Popov <valentin@popov.link>2024-07-19 15:37:58 +0300
committerValentin Popov <valentin@popov.link>2024-07-19 15:37:58 +0300
commita990de90fe41456a23e58bd087d2f107d321f3a1 (patch)
tree15afc392522a9e85dc3332235e311b7d39352ea9 /vendor/ryu/tests
parent3d48cd3f81164bbfc1a755dc1d4a9a02f98c8ddd (diff)
downloadfparkan-a990de90fe41456a23e58bd087d2f107d321f3a1.tar.xz
fparkan-a990de90fe41456a23e58bd087d2f107d321f3a1.zip
Deleted vendor folder
Diffstat (limited to 'vendor/ryu/tests')
-rw-r--r--vendor/ryu/tests/common_test.rs91
-rw-r--r--vendor/ryu/tests/d2s_intrinsics_test.rs72
-rw-r--r--vendor/ryu/tests/d2s_table_test.rs59
-rw-r--r--vendor/ryu/tests/d2s_test.rs331
-rw-r--r--vendor/ryu/tests/exhaustive.rs52
-rw-r--r--vendor/ryu/tests/f2s_test.rs181
-rw-r--r--vendor/ryu/tests/macros/mod.rs8
-rw-r--r--vendor/ryu/tests/s2d_test.rs167
-rw-r--r--vendor/ryu/tests/s2f_test.rs110
9 files changed, 0 insertions, 1071 deletions
diff --git a/vendor/ryu/tests/common_test.rs b/vendor/ryu/tests/common_test.rs
deleted file mode 100644
index 2f05b33..0000000
--- a/vendor/ryu/tests/common_test.rs
+++ /dev/null
@@ -1,91 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(dead_code)]
-#![allow(
- clippy::approx_constant,
- clippy::cast_possible_wrap,
- clippy::cast_sign_loss,
- clippy::excessive_precision,
- clippy::unreadable_literal,
- clippy::wildcard_imports
-)]
-
-#[path = "../src/common.rs"]
-mod common;
-
-use common::*;
-
-#[test]
-fn test_decimal_length9() {
- assert_eq!(1, decimal_length9(0));
- assert_eq!(1, decimal_length9(1));
- assert_eq!(1, decimal_length9(9));
- assert_eq!(2, decimal_length9(10));
- assert_eq!(2, decimal_length9(99));
- assert_eq!(3, decimal_length9(100));
- assert_eq!(3, decimal_length9(999));
- assert_eq!(9, decimal_length9(999999999));
-}
-
-#[test]
-fn test_ceil_log2_pow5() {
- assert_eq!(1, ceil_log2_pow5(0));
- assert_eq!(3, ceil_log2_pow5(1));
- assert_eq!(5, ceil_log2_pow5(2));
- assert_eq!(7, ceil_log2_pow5(3));
- assert_eq!(10, ceil_log2_pow5(4));
- assert_eq!(8192, ceil_log2_pow5(3528));
-}
-
-#[test]
-fn test_log10_pow2() {
- assert_eq!(0, log10_pow2(0));
- assert_eq!(0, log10_pow2(1));
- assert_eq!(0, log10_pow2(2));
- assert_eq!(0, log10_pow2(3));
- assert_eq!(1, log10_pow2(4));
- assert_eq!(496, log10_pow2(1650));
-}
-
-#[test]
-fn test_log10_pow5() {
- assert_eq!(0, log10_pow5(0));
- assert_eq!(0, log10_pow5(1));
- assert_eq!(1, log10_pow5(2));
- assert_eq!(2, log10_pow5(3));
- assert_eq!(2, log10_pow5(4));
- assert_eq!(1831, log10_pow5(2620));
-}
-
-#[test]
-fn test_float_to_bits() {
- assert_eq!(0, 0.0_f32.to_bits());
- assert_eq!(0x40490fda, 3.1415926_f32.to_bits());
-}
-
-#[test]
-fn test_double_to_bits() {
- assert_eq!(0, 0.0_f64.to_bits());
- assert_eq!(
- 0x400921FB54442D18,
- 3.1415926535897932384626433_f64.to_bits(),
- );
-}
diff --git a/vendor/ryu/tests/d2s_intrinsics_test.rs b/vendor/ryu/tests/d2s_intrinsics_test.rs
deleted file mode 100644
index 0ac80c9..0000000
--- a/vendor/ryu/tests/d2s_intrinsics_test.rs
+++ /dev/null
@@ -1,72 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(dead_code)]
-#![allow(
- clippy::cast_lossless,
- clippy::cast_possible_truncation,
- clippy::unreadable_literal
-)]
-
-#[path = "../src/d2s_intrinsics.rs"]
-mod d2s_intrinsics;
-
-use d2s_intrinsics::pow5_factor;
-
-#[test]
-fn test_pow5_factor() {
- assert_eq!(0, pow5_factor(1));
- assert_eq!(0, pow5_factor(2));
- assert_eq!(0, pow5_factor(3));
- assert_eq!(0, pow5_factor(4));
- assert_eq!(1, pow5_factor(5));
- assert_eq!(0, pow5_factor(6));
- assert_eq!(0, pow5_factor(7));
- assert_eq!(0, pow5_factor(8));
- assert_eq!(0, pow5_factor(9));
- assert_eq!(1, pow5_factor(10));
-
- assert_eq!(0, pow5_factor(12));
- assert_eq!(0, pow5_factor(14));
- assert_eq!(0, pow5_factor(16));
- assert_eq!(0, pow5_factor(18));
- assert_eq!(1, pow5_factor(20));
-
- assert_eq!(2, pow5_factor(5 * 5));
- assert_eq!(3, pow5_factor(5 * 5 * 5));
- assert_eq!(4, pow5_factor(5 * 5 * 5 * 5));
- assert_eq!(5, pow5_factor(5 * 5 * 5 * 5 * 5));
- assert_eq!(6, pow5_factor(5 * 5 * 5 * 5 * 5 * 5));
- assert_eq!(7, pow5_factor(5 * 5 * 5 * 5 * 5 * 5 * 5));
- assert_eq!(8, pow5_factor(5 * 5 * 5 * 5 * 5 * 5 * 5 * 5));
- assert_eq!(9, pow5_factor(5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5));
- assert_eq!(10, pow5_factor(5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5));
-
- assert_eq!(0, pow5_factor(42));
- assert_eq!(1, pow5_factor(42 * 5));
- assert_eq!(2, pow5_factor(42 * 5 * 5));
- assert_eq!(3, pow5_factor(42 * 5 * 5 * 5));
- assert_eq!(4, pow5_factor(42 * 5 * 5 * 5 * 5));
- assert_eq!(5, pow5_factor(42 * 5 * 5 * 5 * 5 * 5));
-
- assert_eq!(27, pow5_factor(7450580596923828125)); // 5^27, largest power of 5 < 2^64.
- assert_eq!(1, pow5_factor(18446744073709551615)); // 2^64 - 1, largest multiple of 5 < 2^64.
- assert_eq!(0, pow5_factor(18446744073709551614)); // 2^64 - 2, largest non-multiple of 5 < 2^64.
-}
diff --git a/vendor/ryu/tests/d2s_table_test.rs b/vendor/ryu/tests/d2s_table_test.rs
deleted file mode 100644
index dce1be3..0000000
--- a/vendor/ryu/tests/d2s_table_test.rs
+++ /dev/null
@@ -1,59 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(dead_code)]
-#![allow(
- clippy::cast_lossless,
- clippy::cast_possible_truncation,
- clippy::cast_possible_wrap,
- clippy::cast_sign_loss,
- clippy::unreadable_literal,
- clippy::unseparated_literal_suffix,
- clippy::wildcard_imports
-)]
-
-#[path = "../src/common.rs"]
-mod common;
-
-#[path = "../src/d2s_full_table.rs"]
-mod d2s_full_table;
-
-#[path = "../src/d2s_intrinsics.rs"]
-mod d2s_intrinsics;
-
-#[path = "../src/d2s_small_table.rs"]
-mod d2s_small_table;
-
-use d2s_full_table::*;
-use d2s_small_table::*;
-
-#[test]
-fn test_compute_pow5() {
- for (i, entry) in DOUBLE_POW5_SPLIT.iter().enumerate() {
- assert_eq!(*entry, unsafe { compute_pow5(i as u32) }, "entry {}", i);
- }
-}
-
-#[test]
-fn test_compute_inv_pow5() {
- for (i, entry) in DOUBLE_POW5_INV_SPLIT[..292].iter().enumerate() {
- assert_eq!(*entry, unsafe { compute_inv_pow5(i as u32) }, "entry {}", i);
- }
-}
diff --git a/vendor/ryu/tests/d2s_test.rs b/vendor/ryu/tests/d2s_test.rs
deleted file mode 100644
index 7e8eba6..0000000
--- a/vendor/ryu/tests/d2s_test.rs
+++ /dev/null
@@ -1,331 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(
- clippy::approx_constant,
- clippy::cast_lossless,
- clippy::float_cmp,
- clippy::int_plus_one,
- clippy::non_ascii_literal,
- clippy::unreadable_literal,
- clippy::unseparated_literal_suffix
-)]
-
-#[macro_use]
-mod macros;
-
-use std::f64;
-
-fn pretty(f: f64) -> String {
- ryu::Buffer::new().format(f).to_owned()
-}
-
-fn ieee_parts_to_double(sign: bool, ieee_exponent: u32, ieee_mantissa: u64) -> f64 {
- assert!(ieee_exponent <= 2047);
- assert!(ieee_mantissa <= (1u64 << 53) - 1);
- f64::from_bits(((sign as u64) << 63) | ((ieee_exponent as u64) << 52) | ieee_mantissa)
-}
-
-#[test]
-fn test_ryu() {
- check!(0.3);
- check!(1234000000000000.0);
- check!(1.234e16);
- check!(2.71828);
- check!(1.1e128);
- check!(1.1e-64);
- check!(2.718281828459045);
- check!(5e-324);
- check!(1.7976931348623157e308);
-}
-
-#[test]
-fn test_random() {
- let n = if cfg!(miri) { 100 } else { 1000000 };
- let mut buffer = ryu::Buffer::new();
- for _ in 0..n {
- let f: f64 = rand::random();
- assert_eq!(f, buffer.format_finite(f).parse().unwrap());
- }
-}
-
-#[test]
-#[cfg_attr(miri, ignore)]
-fn test_non_finite() {
- for i in 0u64..1 << 23 {
- let f = f64::from_bits((((1 << 11) - 1) << 52) + (i << 29));
- assert!(!f.is_finite(), "f={}", f);
- ryu::Buffer::new().format_finite(f);
- }
-}
-
-#[test]
-fn test_basic() {
- check!(0.0);
- check!(-0.0);
- check!(1.0);
- check!(-1.0);
- assert_eq!(pretty(f64::NAN.copysign(1.0)), "NaN");
- assert_eq!(pretty(f64::NAN.copysign(-1.0)), "NaN");
- assert_eq!(pretty(f64::INFINITY), "inf");
- assert_eq!(pretty(f64::NEG_INFINITY), "-inf");
-}
-
-#[test]
-fn test_switch_to_subnormal() {
- check!(2.2250738585072014e-308);
-}
-
-#[test]
-fn test_min_and_max() {
- assert_eq!(f64::from_bits(0x7fefffffffffffff), 1.7976931348623157e308);
- check!(1.7976931348623157e308);
- assert_eq!(f64::from_bits(1), 5e-324);
- check!(5e-324);
-}
-
-#[test]
-fn test_lots_of_trailing_zeros() {
- check!(2.9802322387695312e-8);
-}
-
-#[test]
-fn test_regression() {
- check!(-2.109808898695963e16);
- check!(4.940656e-318);
- check!(1.18575755e-316);
- check!(2.989102097996e-312);
- check!(9060801153433600.0);
- check!(4.708356024711512e18);
- check!(9.409340012568248e18);
- check!(1.2345678);
-}
-
-#[test]
-fn test_looks_like_pow5() {
- // These numbers have a mantissa that is a multiple of the largest power of
- // 5 that fits, and an exponent that causes the computation for q to result
- // in 22, which is a corner case for Ryū.
- assert_eq!(f64::from_bits(0x4830F0CF064DD592), 5.764607523034235e39);
- check!(5.764607523034235e39);
- assert_eq!(f64::from_bits(0x4840F0CF064DD592), 1.152921504606847e40);
- check!(1.152921504606847e40);
- assert_eq!(f64::from_bits(0x4850F0CF064DD592), 2.305843009213694e40);
- check!(2.305843009213694e40);
-}
-
-#[test]
-fn test_output_length() {
- check!(1.0); // already tested in Basic
- check!(1.2);
- check!(1.23);
- check!(1.234);
- check!(1.2345);
- check!(1.23456);
- check!(1.234567);
- check!(1.2345678); // already tested in Regression
- check!(1.23456789);
- check!(1.234567895); // 1.234567890 would be trimmed
- check!(1.2345678901);
- check!(1.23456789012);
- check!(1.234567890123);
- check!(1.2345678901234);
- check!(1.23456789012345);
- check!(1.234567890123456);
- check!(1.2345678901234567);
-
- // Test 32-bit chunking
- check!(4.294967294); // 2^32 - 2
- check!(4.294967295); // 2^32 - 1
- check!(4.294967296); // 2^32
- check!(4.294967297); // 2^32 + 1
- check!(4.294967298); // 2^32 + 2
-}
-
-// Test min, max shift values in shiftright128
-#[test]
-fn test_min_max_shift() {
- let max_mantissa = (1u64 << 53) - 1;
-
- // 32-bit opt-size=0: 49 <= dist <= 50
- // 32-bit opt-size=1: 30 <= dist <= 50
- // 64-bit opt-size=0: 50 <= dist <= 50
- // 64-bit opt-size=1: 30 <= dist <= 50
- assert_eq!(1.7800590868057611E-307, ieee_parts_to_double(false, 4, 0));
- check!(1.7800590868057611e-307);
- // 32-bit opt-size=0: 49 <= dist <= 49
- // 32-bit opt-size=1: 28 <= dist <= 49
- // 64-bit opt-size=0: 50 <= dist <= 50
- // 64-bit opt-size=1: 28 <= dist <= 50
- assert_eq!(
- 2.8480945388892175E-306,
- ieee_parts_to_double(false, 6, max_mantissa)
- );
- check!(2.8480945388892175e-306);
- // 32-bit opt-size=0: 52 <= dist <= 53
- // 32-bit opt-size=1: 2 <= dist <= 53
- // 64-bit opt-size=0: 53 <= dist <= 53
- // 64-bit opt-size=1: 2 <= dist <= 53
- assert_eq!(2.446494580089078E-296, ieee_parts_to_double(false, 41, 0));
- check!(2.446494580089078e-296);
- // 32-bit opt-size=0: 52 <= dist <= 52
- // 32-bit opt-size=1: 2 <= dist <= 52
- // 64-bit opt-size=0: 53 <= dist <= 53
- // 64-bit opt-size=1: 2 <= dist <= 53
- assert_eq!(
- 4.8929891601781557E-296,
- ieee_parts_to_double(false, 40, max_mantissa)
- );
- check!(4.8929891601781557e-296);
-
- // 32-bit opt-size=0: 57 <= dist <= 58
- // 32-bit opt-size=1: 57 <= dist <= 58
- // 64-bit opt-size=0: 58 <= dist <= 58
- // 64-bit opt-size=1: 58 <= dist <= 58
- assert_eq!(1.8014398509481984E16, ieee_parts_to_double(false, 1077, 0));
- check!(1.8014398509481984e16);
- // 32-bit opt-size=0: 57 <= dist <= 57
- // 32-bit opt-size=1: 57 <= dist <= 57
- // 64-bit opt-size=0: 58 <= dist <= 58
- // 64-bit opt-size=1: 58 <= dist <= 58
- assert_eq!(
- 3.6028797018963964E16,
- ieee_parts_to_double(false, 1076, max_mantissa)
- );
- check!(3.6028797018963964e16);
- // 32-bit opt-size=0: 51 <= dist <= 52
- // 32-bit opt-size=1: 51 <= dist <= 59
- // 64-bit opt-size=0: 52 <= dist <= 52
- // 64-bit opt-size=1: 52 <= dist <= 59
- assert_eq!(2.900835519859558E-216, ieee_parts_to_double(false, 307, 0));
- check!(2.900835519859558e-216);
- // 32-bit opt-size=0: 51 <= dist <= 51
- // 32-bit opt-size=1: 51 <= dist <= 59
- // 64-bit opt-size=0: 52 <= dist <= 52
- // 64-bit opt-size=1: 52 <= dist <= 59
- assert_eq!(
- 5.801671039719115E-216,
- ieee_parts_to_double(false, 306, max_mantissa)
- );
- check!(5.801671039719115e-216);
-
- // https://github.com/ulfjack/ryu/commit/19e44d16d80236f5de25800f56d82606d1be00b9#commitcomment-30146483
- // 32-bit opt-size=0: 49 <= dist <= 49
- // 32-bit opt-size=1: 44 <= dist <= 49
- // 64-bit opt-size=0: 50 <= dist <= 50
- // 64-bit opt-size=1: 44 <= dist <= 50
- assert_eq!(
- 3.196104012172126E-27,
- ieee_parts_to_double(false, 934, 0x000FA7161A4D6E0C)
- );
- check!(3.196104012172126e-27);
-}
-
-#[test]
-fn test_small_integers() {
- check!(9007199254740991.0); // 2^53-1
- check!(9007199254740992.0); // 2^53
-
- check!(1.0);
- check!(12.0);
- check!(123.0);
- check!(1234.0);
- check!(12345.0);
- check!(123456.0);
- check!(1234567.0);
- check!(12345678.0);
- check!(123456789.0);
- check!(1234567890.0);
- check!(1234567895.0);
- check!(12345678901.0);
- check!(123456789012.0);
- check!(1234567890123.0);
- check!(12345678901234.0);
- check!(123456789012345.0);
- check!(1234567890123456.0);
-
- // 10^i
- check!(1.0);
- check!(10.0);
- check!(100.0);
- check!(1000.0);
- check!(10000.0);
- check!(100000.0);
- check!(1000000.0);
- check!(10000000.0);
- check!(100000000.0);
- check!(1000000000.0);
- check!(10000000000.0);
- check!(100000000000.0);
- check!(1000000000000.0);
- check!(10000000000000.0);
- check!(100000000000000.0);
- check!(1000000000000000.0);
-
- // 10^15 + 10^i
- check!(1000000000000001.0);
- check!(1000000000000010.0);
- check!(1000000000000100.0);
- check!(1000000000001000.0);
- check!(1000000000010000.0);
- check!(1000000000100000.0);
- check!(1000000001000000.0);
- check!(1000000010000000.0);
- check!(1000000100000000.0);
- check!(1000001000000000.0);
- check!(1000010000000000.0);
- check!(1000100000000000.0);
- check!(1001000000000000.0);
- check!(1010000000000000.0);
- check!(1100000000000000.0);
-
- // Largest power of 2 <= 10^(i+1)
- check!(8.0);
- check!(64.0);
- check!(512.0);
- check!(8192.0);
- check!(65536.0);
- check!(524288.0);
- check!(8388608.0);
- check!(67108864.0);
- check!(536870912.0);
- check!(8589934592.0);
- check!(68719476736.0);
- check!(549755813888.0);
- check!(8796093022208.0);
- check!(70368744177664.0);
- check!(562949953421312.0);
- check!(9007199254740992.0);
-
- // 1000 * (Largest power of 2 <= 10^(i+1))
- check!(8000.0);
- check!(64000.0);
- check!(512000.0);
- check!(8192000.0);
- check!(65536000.0);
- check!(524288000.0);
- check!(8388608000.0);
- check!(67108864000.0);
- check!(536870912000.0);
- check!(8589934592000.0);
- check!(68719476736000.0);
- check!(549755813888000.0);
- check!(8796093022208000.0);
-}
diff --git a/vendor/ryu/tests/exhaustive.rs b/vendor/ryu/tests/exhaustive.rs
deleted file mode 100644
index 569bcff..0000000
--- a/vendor/ryu/tests/exhaustive.rs
+++ /dev/null
@@ -1,52 +0,0 @@
-#![cfg(exhaustive)]
-
-use std::str;
-use std::sync::atomic::{AtomicUsize, Ordering};
-use std::sync::Arc;
-use std::thread;
-
-#[test]
-fn test_exhaustive() {
- const BATCH_SIZE: u32 = 1_000_000;
- let counter = Arc::new(AtomicUsize::new(0));
- let finished = Arc::new(AtomicUsize::new(0));
-
- let mut workers = Vec::new();
- for _ in 0..num_cpus::get() {
- let counter = counter.clone();
- let finished = finished.clone();
- workers.push(thread::spawn(move || loop {
- let batch = counter.fetch_add(1, Ordering::Relaxed) as u32;
- if batch > u32::max_value() / BATCH_SIZE {
- return;
- }
-
- let min = batch * BATCH_SIZE;
- let max = if batch == u32::max_value() / BATCH_SIZE {
- u32::max_value()
- } else {
- min + BATCH_SIZE - 1
- };
-
- let mut bytes = [0u8; 24];
- let mut buffer = ryu::Buffer::new();
- for u in min..=max {
- let f = f32::from_bits(u);
- if !f.is_finite() {
- continue;
- }
- let n = unsafe { ryu::raw::format32(f, &mut bytes[0]) };
- assert_eq!(Ok(Ok(f)), str::from_utf8(&bytes[..n]).map(str::parse));
- assert_eq!(Ok(f), buffer.format_finite(f).parse());
- }
-
- let increment = (max - min + 1) as usize;
- let update = finished.fetch_add(increment, Ordering::Relaxed);
- println!("{}", update + increment);
- }));
- }
-
- for w in workers {
- w.join().unwrap();
- }
-}
diff --git a/vendor/ryu/tests/f2s_test.rs b/vendor/ryu/tests/f2s_test.rs
deleted file mode 100644
index d6249a3..0000000
--- a/vendor/ryu/tests/f2s_test.rs
+++ /dev/null
@@ -1,181 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(
- clippy::approx_constant,
- clippy::float_cmp,
- clippy::non_ascii_literal,
- clippy::unreadable_literal,
- clippy::unseparated_literal_suffix
-)]
-
-#[macro_use]
-mod macros;
-
-use std::f32;
-
-fn pretty(f: f32) -> String {
- ryu::Buffer::new().format(f).to_owned()
-}
-
-#[test]
-fn test_ryu() {
- check!(0.3);
- check!(1234000000000.0);
- check!(1.234e13);
- check!(2.71828);
- check!(1.1e32);
- check!(1.1e-32);
- check!(2.7182817);
- check!(1e-45);
- check!(3.4028235e38);
- check!(-0.001234);
-}
-
-#[test]
-fn test_random() {
- let n = if cfg!(miri) { 100 } else { 1000000 };
- let mut buffer = ryu::Buffer::new();
- for _ in 0..n {
- let f: f32 = rand::random();
- assert_eq!(f, buffer.format_finite(f).parse().unwrap());
- }
-}
-
-#[test]
-#[cfg_attr(miri, ignore)]
-fn test_non_finite() {
- for i in 0u32..1 << 23 {
- let f = f32::from_bits((((1 << 8) - 1) << 23) + i);
- assert!(!f.is_finite(), "f={}", f);
- ryu::Buffer::new().format_finite(f);
- }
-}
-
-#[test]
-fn test_basic() {
- check!(0.0);
- check!(-0.0);
- check!(1.0);
- check!(-1.0);
- assert_eq!(pretty(f32::NAN.copysign(1.0)), "NaN");
- assert_eq!(pretty(f32::NAN.copysign(-1.0)), "NaN");
- assert_eq!(pretty(f32::INFINITY), "inf");
- assert_eq!(pretty(f32::NEG_INFINITY), "-inf");
-}
-
-#[test]
-fn test_switch_to_subnormal() {
- check!(1.1754944e-38);
-}
-
-#[test]
-fn test_min_and_max() {
- assert_eq!(f32::from_bits(0x7f7fffff), 3.4028235e38);
- check!(3.4028235e38);
- assert_eq!(f32::from_bits(1), 1e-45);
- check!(1e-45);
-}
-
-// Check that we return the exact boundary if it is the shortest
-// representation, but only if the original floating point number is even.
-#[test]
-fn test_boundary_round_even() {
- check!(33554450.0);
- check!(9000000000.0);
- check!(34366720000.0);
-}
-
-// If the exact value is exactly halfway between two shortest representations,
-// then we round to even. It seems like this only makes a difference if the
-// last two digits are ...2|5 or ...7|5, and we cut off the 5.
-#[test]
-fn test_exact_value_round_even() {
- check!(305404.12);
- check!(8099.0312);
-}
-
-#[test]
-fn test_lots_of_trailing_zeros() {
- // Pattern for the first test: 00111001100000000000000000000000
- check!(0.00024414062);
- check!(0.0024414062);
- check!(0.0043945312);
- check!(0.0063476562);
-}
-
-#[test]
-fn test_regression() {
- check!(4.7223665e21);
- check!(8388608.0);
- check!(16777216.0);
- check!(33554436.0);
- check!(67131496.0);
- check!(1.9310392e-38);
- check!(-2.47e-43);
- check!(1.993244e-38);
- check!(4103.9004);
- check!(5339999700.0);
- check!(6.0898e-39);
- check!(0.0010310042);
- check!(2.882326e17);
- check!(7.038531e-26);
- check!(9.223404e17);
- check!(67108870.0);
- check!(1e-44);
- check!(2.816025e14);
- check!(9.223372e18);
- check!(1.5846086e29);
- check!(1.1811161e19);
- check!(5.368709e18);
- check!(4.6143166e18);
- check!(0.007812537);
- check!(1e-45);
- check!(1.18697725e20);
- check!(1.00014165e-36);
- check!(200.0);
- check!(33554432.0);
-}
-
-#[test]
-fn test_looks_like_pow5() {
- // These numbers have a mantissa that is the largest power of 5 that fits,
- // and an exponent that causes the computation for q to result in 10, which
- // is a corner case for Ryū.
- assert_eq!(f32::from_bits(0x5D1502F9), 6.7108864e17);
- check!(6.7108864e17);
- assert_eq!(f32::from_bits(0x5D9502F9), 1.3421773e18);
- check!(1.3421773e18);
- assert_eq!(f32::from_bits(0x5E1502F9), 2.6843546e18);
- check!(2.6843546e18);
-}
-
-#[test]
-fn test_output_length() {
- check!(1.0); // already tested in Basic
- check!(1.2);
- check!(1.23);
- check!(1.234);
- check!(1.2345);
- check!(1.23456);
- check!(1.234567);
- check!(1.2345678);
- check!(1.23456735e-36);
-}
diff --git a/vendor/ryu/tests/macros/mod.rs b/vendor/ryu/tests/macros/mod.rs
deleted file mode 100644
index de6fb46..0000000
--- a/vendor/ryu/tests/macros/mod.rs
+++ /dev/null
@@ -1,8 +0,0 @@
-macro_rules! check {
- ($f:tt) => {
- assert_eq!(pretty($f), stringify!($f));
- };
- (-$f:tt) => {
- assert_eq!(pretty(-$f), concat!("-", stringify!($f)));
- };
-}
diff --git a/vendor/ryu/tests/s2d_test.rs b/vendor/ryu/tests/s2d_test.rs
deleted file mode 100644
index 7b42164..0000000
--- a/vendor/ryu/tests/s2d_test.rs
+++ /dev/null
@@ -1,167 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![cfg(not(feature = "small"))]
-#![allow(dead_code)]
-#![allow(
- clippy::cast_lossless,
- clippy::cast_possible_truncation,
- clippy::cast_possible_wrap,
- clippy::cast_sign_loss,
- clippy::excessive_precision,
- clippy::float_cmp,
- clippy::manual_range_contains,
- clippy::similar_names,
- clippy::too_many_lines,
- clippy::unreadable_literal,
- clippy::unseparated_literal_suffix,
- clippy::wildcard_imports
-)]
-
-#[path = "../src/common.rs"]
-mod common;
-
-#[cfg(not(feature = "small"))]
-#[path = "../src/d2s_full_table.rs"]
-mod d2s_full_table;
-
-#[path = "../src/d2s_intrinsics.rs"]
-mod d2s_intrinsics;
-
-#[cfg(feature = "small")]
-#[path = "../src/d2s_small_table.rs"]
-mod d2s_small_table;
-
-#[path = "../src/d2s.rs"]
-mod d2s;
-
-#[path = "../src/s2d.rs"]
-mod s2d;
-
-#[path = "../src/parse.rs"]
-mod parse;
-
-use crate::parse::Error;
-use crate::s2d::s2d;
-
-impl PartialEq for Error {
- fn eq(&self, other: &Self) -> bool {
- *self as u8 == *other as u8
- }
-}
-
-#[test]
-fn test_bad_input() {
- assert_eq!(Error::MalformedInput, s2d(b"x").unwrap_err());
- assert_eq!(Error::MalformedInput, s2d(b"1..1").unwrap_err());
- assert_eq!(Error::MalformedInput, s2d(b"..").unwrap_err());
- assert_eq!(Error::MalformedInput, s2d(b"1..1").unwrap_err());
- assert_eq!(Error::MalformedInput, s2d(b"1ee1").unwrap_err());
- assert_eq!(Error::MalformedInput, s2d(b"1e.1").unwrap_err());
- assert_eq!(Error::InputTooShort, s2d(b"").unwrap_err());
- assert_eq!(Error::InputTooLong, s2d(b"123456789012345678").unwrap_err());
- assert_eq!(Error::InputTooLong, s2d(b"1e12345").unwrap_err());
-}
-
-#[test]
-fn test_basic() {
- assert_eq!(0.0, s2d(b"0").unwrap());
- assert_eq!(-0.0, s2d(b"-0").unwrap());
- assert_eq!(1.0, s2d(b"1").unwrap());
- assert_eq!(2.0, s2d(b"2").unwrap());
- assert_eq!(123456789.0, s2d(b"123456789").unwrap());
- assert_eq!(123.456, s2d(b"123.456").unwrap());
- assert_eq!(123.456, s2d(b"123456e-3").unwrap());
- assert_eq!(123.456, s2d(b"1234.56e-1").unwrap());
- assert_eq!(1.453, s2d(b"1.453").unwrap());
- assert_eq!(1453.0, s2d(b"1.453e+3").unwrap());
- assert_eq!(0.0, s2d(b".0").unwrap());
- assert_eq!(1.0, s2d(b"1e0").unwrap());
- assert_eq!(1.0, s2d(b"1E0").unwrap());
- assert_eq!(1.0, s2d(b"000001.000000").unwrap());
- assert_eq!(0.2316419, s2d(b"0.2316419").unwrap());
-}
-
-#[test]
-fn test_min_max() {
- assert_eq!(
- 1.7976931348623157e308,
- s2d(b"1.7976931348623157e308").unwrap(),
- );
- assert_eq!(5E-324, s2d(b"5E-324").unwrap());
-}
-
-#[test]
-fn test_mantissa_rounding_overflow() {
- // This results in binary mantissa that is all ones and requires rounding up
- // because it is closer to 1 than to the next smaller float. This is a
- // regression test that the mantissa overflow is handled correctly by
- // increasing the exponent.
- assert_eq!(1.0, s2d(b"0.99999999999999999").unwrap());
- // This number overflows the mantissa *and* the IEEE exponent.
- assert_eq!(f64::INFINITY, s2d(b"1.7976931348623159e308").unwrap());
-}
-
-#[test]
-fn test_underflow() {
- assert_eq!(0.0, s2d(b"2.4e-324").unwrap());
- assert_eq!(0.0, s2d(b"1e-324").unwrap());
- assert_eq!(0.0, s2d(b"9.99999e-325").unwrap());
- // These are just about halfway between 0 and the smallest float.
- // The first is just below the halfway point, the second just above.
- assert_eq!(0.0, s2d(b"2.4703282292062327e-324").unwrap());
- assert_eq!(5e-324, s2d(b"2.4703282292062328e-324").unwrap());
-}
-
-#[test]
-fn test_overflow() {
- assert_eq!(f64::INFINITY, s2d(b"2e308").unwrap());
- assert_eq!(f64::INFINITY, s2d(b"1e309").unwrap());
-}
-
-#[test]
-fn test_table_size_denormal() {
- assert_eq!(5e-324, s2d(b"4.9406564584124654e-324").unwrap());
-}
-
-#[test]
-fn test_issue157() {
- assert_eq!(
- 1.2999999999999999E+154,
- s2d(b"1.2999999999999999E+154").unwrap(),
- );
-}
-
-#[test]
-fn test_issue173() {
- // Denormal boundary
- assert_eq!(
- 2.2250738585072012e-308,
- s2d(b"2.2250738585072012e-308").unwrap(),
- );
- assert_eq!(
- 2.2250738585072013e-308,
- s2d(b"2.2250738585072013e-308").unwrap(),
- );
- assert_eq!(
- 2.2250738585072014e-308,
- s2d(b"2.2250738585072014e-308").unwrap(),
- );
-}
diff --git a/vendor/ryu/tests/s2f_test.rs b/vendor/ryu/tests/s2f_test.rs
deleted file mode 100644
index 5bae935..0000000
--- a/vendor/ryu/tests/s2f_test.rs
+++ /dev/null
@@ -1,110 +0,0 @@
-// Translated from C to Rust. The original C code can be found at
-// https://github.com/ulfjack/ryu and carries the following license:
-//
-// Copyright 2018 Ulf Adams
-//
-// The contents of this file may be used under the terms of the Apache License,
-// Version 2.0.
-//
-// (See accompanying file LICENSE-Apache or copy at
-// http://www.apache.org/licenses/LICENSE-2.0)
-//
-// Alternatively, the contents of this file may be used under the terms of
-// the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE-Boost or copy at
-// https://www.boost.org/LICENSE_1_0.txt)
-//
-// Unless required by applicable law or agreed to in writing, this software
-// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-// KIND, either express or implied.
-
-#![allow(dead_code)]
-#![allow(
- clippy::cast_lossless,
- clippy::cast_possible_truncation,
- clippy::cast_possible_wrap,
- clippy::cast_possible_wrap,
- clippy::cast_sign_loss,
- clippy::checked_conversions,
- clippy::float_cmp,
- clippy::manual_range_contains,
- clippy::similar_names,
- clippy::too_many_lines,
- clippy::unreadable_literal,
- clippy::unseparated_literal_suffix,
- clippy::wildcard_imports
-)]
-
-#[path = "../src/common.rs"]
-mod common;
-
-#[cfg(not(feature = "small"))]
-#[path = "../src/d2s_full_table.rs"]
-mod d2s_full_table;
-
-#[path = "../src/d2s_intrinsics.rs"]
-mod d2s_intrinsics;
-
-#[cfg(feature = "small")]
-#[path = "../src/d2s_small_table.rs"]
-mod d2s_small_table;
-
-#[path = "../src/d2s.rs"]
-mod d2s;
-
-#[path = "../src/f2s_intrinsics.rs"]
-mod f2s_intrinsics;
-
-#[path = "../src/f2s.rs"]
-mod f2s;
-
-#[path = "../src/s2f.rs"]
-mod s2f;
-
-#[path = "../src/parse.rs"]
-mod parse;
-
-use crate::parse::Error;
-use crate::s2f::s2f;
-
-impl PartialEq for Error {
- fn eq(&self, other: &Self) -> bool {
- *self as u8 == *other as u8
- }
-}
-
-#[test]
-fn test_basic() {
- assert_eq!(0.0, s2f(b"0").unwrap());
- assert_eq!(-0.0, s2f(b"-0").unwrap());
- assert_eq!(1.0, s2f(b"1").unwrap());
- assert_eq!(-1.0, s2f(b"-1").unwrap());
- assert_eq!(123456792.0, s2f(b"123456789").unwrap());
- assert_eq!(299792448.0, s2f(b"299792458").unwrap());
-}
-
-#[test]
-fn test_min_max() {
- assert_eq!(1e-45, s2f(b"1e-45").unwrap());
- assert_eq!(f32::MIN_POSITIVE, s2f(b"1.1754944e-38").unwrap());
- assert_eq!(f32::MAX, s2f(b"3.4028235e+38").unwrap());
-}
-
-#[test]
-fn test_mantissa_rounding_overflow() {
- assert_eq!(1.0, s2f(b"0.999999999").unwrap());
- assert_eq!(f32::INFINITY, s2f(b"3.4028236e+38").unwrap());
- assert_eq!(1.1754944e-38, s2f(b"1.17549430e-38").unwrap()); // FLT_MIN
- assert_eq!(1.1754944e-38, s2f(b"1.17549431e-38").unwrap());
- assert_eq!(1.1754944e-38, s2f(b"1.17549432e-38").unwrap());
- assert_eq!(1.1754944e-38, s2f(b"1.17549433e-38").unwrap());
- assert_eq!(1.1754944e-38, s2f(b"1.17549434e-38").unwrap());
- assert_eq!(1.1754944e-38, s2f(b"1.17549435e-38").unwrap());
-}
-
-#[test]
-fn test_trailing_zeros() {
- assert_eq!(26843550.0, s2f(b"26843549.5").unwrap());
- assert_eq!(50000004.0, s2f(b"50000002.5").unwrap());
- assert_eq!(99999992.0, s2f(b"99999989.5").unwrap());
-}