Initial commit to copy sourcecode from upsuper/dtoa-short Change-Id: I76e674138fc7f44cd754db1c6b490876e3c200cd
diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..6aa1064 --- /dev/null +++ b/.gitignore
@@ -0,0 +1,3 @@ +/target/ +**/*.rs.bk +Cargo.lock
diff --git a/.travis.yml b/.travis.yml new file mode 100644 index 0000000..1865327 --- /dev/null +++ b/.travis.yml
@@ -0,0 +1,12 @@ +language: rust + +rust: + - stable + - beta + - nightly + +matrix: + allow_failures: + - rust: nightly + +cache: cargo
diff --git a/Cargo.toml b/Cargo.toml new file mode 100644 index 0000000..068e872 --- /dev/null +++ b/Cargo.toml
@@ -0,0 +1,22 @@ +[package] +name = "dtoa-short" +version = "0.3.3" +authors = ["Xidorn Quan <me@upsuper.org>"] + +description = "Serialize float number and truncate to certain precision" +repository = "https://github.com/upsuper/dtoa-short" +keywords = ["float"] +categories = ["value-formatting"] +license = "MPL-2.0" + +include = ["src/*.rs", "Cargo.toml", "LICENSE"] + +[badges] +travis-ci = { repository = "upsuper/dtoa-short" } +codecov = { repository = "upsuper/dtoa-short" } + +[dependencies] +dtoa = "0.4.1" + +[dev-dependencies] +float-cmp = "0.4"
diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..a612ad9 --- /dev/null +++ b/LICENSE
@@ -0,0 +1,373 @@ +Mozilla Public License Version 2.0 +================================== + +1. Definitions +-------------- + +1.1. "Contributor" + means each individual or legal entity that creates, contributes to + the creation of, or owns Covered Software. + +1.2. "Contributor Version" + means the combination of the Contributions of others (if any) used + by a Contributor and that particular Contributor's Contribution. + +1.3. "Contribution" + means Covered Software of a particular Contributor. + +1.4. "Covered Software" + means Source Code Form to which the initial Contributor has attached + the notice in Exhibit A, the Executable Form of such Source Code + Form, and Modifications of such Source Code Form, in each case + including portions thereof. + +1.5. "Incompatible With Secondary Licenses" + means + + (a) that the initial Contributor has attached the notice described + in Exhibit B to the Covered Software; or + + (b) that the Covered Software was made available under the terms of + version 1.1 or earlier of the License, but not also under the + terms of a Secondary License. + +1.6. "Executable Form" + means any form of the work other than Source Code Form. + +1.7. "Larger Work" + means a work that combines Covered Software with other material, in + a separate file or files, that is not Covered Software. + +1.8. "License" + means this document. + +1.9. "Licensable" + means having the right to grant, to the maximum extent possible, + whether at the time of the initial grant or subsequently, any and + all of the rights conveyed by this License. + +1.10. "Modifications" + means any of the following: + + (a) any file in Source Code Form that results from an addition to, + deletion from, or modification of the contents of Covered + Software; or + + (b) any new file in Source Code Form that contains any Covered + Software. + +1.11. "Patent Claims" of a Contributor + means any patent claim(s), including without limitation, method, + process, and apparatus claims, in any patent Licensable by such + Contributor that would be infringed, but for the grant of the + License, by the making, using, selling, offering for sale, having + made, import, or transfer of either its Contributions or its + Contributor Version. + +1.12. "Secondary License" + means either the GNU General Public License, Version 2.0, the GNU + Lesser General Public License, Version 2.1, the GNU Affero General + Public License, Version 3.0, or any later versions of those + licenses. + +1.13. "Source Code Form" + means the form of the work preferred for making modifications. + +1.14. "You" (or "Your") + means an individual or a legal entity exercising rights under this + License. For legal entities, "You" includes any entity that + controls, is controlled by, or is under common control with You. For + purposes of this definition, "control" means (a) the power, direct + or indirect, to cause the direction or management of such entity, + whether by contract or otherwise, or (b) ownership of more than + fifty percent (50%) of the outstanding shares or beneficial + ownership of such entity. + +2. License Grants and Conditions +-------------------------------- + +2.1. Grants + +Each Contributor hereby grants You a world-wide, royalty-free, +non-exclusive license: + +(a) under intellectual property rights (other than patent or trademark) + Licensable by such Contributor to use, reproduce, make available, + modify, display, perform, distribute, and otherwise exploit its + Contributions, either on an unmodified basis, with Modifications, or + as part of a Larger Work; and + +(b) under Patent Claims of such Contributor to make, use, sell, offer + for sale, have made, import, and otherwise transfer either its + Contributions or its Contributor Version. + +2.2. Effective Date + +The licenses granted in Section 2.1 with respect to any Contribution +become effective for each Contribution on the date the Contributor first +distributes such Contribution. + +2.3. Limitations on Grant Scope + +The licenses granted in this Section 2 are the only rights granted under +this License. No additional rights or licenses will be implied from the +distribution or licensing of Covered Software under this License. +Notwithstanding Section 2.1(b) above, no patent license is granted by a +Contributor: + +(a) for any code that a Contributor has removed from Covered Software; + or + +(b) for infringements caused by: (i) Your and any other third party's + modifications of Covered Software, or (ii) the combination of its + Contributions with other software (except as part of its Contributor + Version); or + +(c) under Patent Claims infringed by Covered Software in the absence of + its Contributions. + +This License does not grant any rights in the trademarks, service marks, +or logos of any Contributor (except as may be necessary to comply with +the notice requirements in Section 3.4). + +2.4. Subsequent Licenses + +No Contributor makes additional grants as a result of Your choice to +distribute the Covered Software under a subsequent version of this +License (see Section 10.2) or under the terms of a Secondary License (if +permitted under the terms of Section 3.3). + +2.5. Representation + +Each Contributor represents that the Contributor believes its +Contributions are its original creation(s) or it has sufficient rights +to grant the rights to its Contributions conveyed by this License. + +2.6. Fair Use + +This License is not intended to limit any rights You have under +applicable copyright doctrines of fair use, fair dealing, or other +equivalents. + +2.7. Conditions + +Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted +in Section 2.1. + +3. Responsibilities +------------------- + +3.1. Distribution of Source Form + +All distribution of Covered Software in Source Code Form, including any +Modifications that You create or to which You contribute, must be under +the terms of this License. You must inform recipients that the Source +Code Form of the Covered Software is governed by the terms of this +License, and how they can obtain a copy of this License. You may not +attempt to alter or restrict the recipients' rights in the Source Code +Form. + +3.2. Distribution of Executable Form + +If You distribute Covered Software in Executable Form then: + +(a) such Covered Software must also be made available in Source Code + Form, as described in Section 3.1, and You must inform recipients of + the Executable Form how they can obtain a copy of such Source Code + Form by reasonable means in a timely manner, at a charge no more + than the cost of distribution to the recipient; and + +(b) You may distribute such Executable Form under the terms of this + License, or sublicense it under different terms, provided that the + license for the Executable Form does not attempt to limit or alter + the recipients' rights in the Source Code Form under this License. + +3.3. Distribution of a Larger Work + +You may create and distribute a Larger Work under terms of Your choice, +provided that You also comply with the requirements of this License for +the Covered Software. If the Larger Work is a combination of Covered +Software with a work governed by one or more Secondary Licenses, and the +Covered Software is not Incompatible With Secondary Licenses, this +License permits You to additionally distribute such Covered Software +under the terms of such Secondary License(s), so that the recipient of +the Larger Work may, at their option, further distribute the Covered +Software under the terms of either this License or such Secondary +License(s). + +3.4. Notices + +You may not remove or alter the substance of any license notices +(including copyright notices, patent notices, disclaimers of warranty, +or limitations of liability) contained within the Source Code Form of +the Covered Software, except that You may alter any license notices to +the extent required to remedy known factual inaccuracies. + +3.5. Application of Additional Terms + +You may choose to offer, and to charge a fee for, warranty, support, +indemnity or liability obligations to one or more recipients of Covered +Software. However, You may do so only on Your own behalf, and not on +behalf of any Contributor. You must make it absolutely clear that any +such warranty, support, indemnity, or liability obligation is offered by +You alone, and You hereby agree to indemnify every Contributor for any +liability incurred by such Contributor as a result of warranty, support, +indemnity or liability terms You offer. You may include additional +disclaimers of warranty and limitations of liability specific to any +jurisdiction. + +4. Inability to Comply Due to Statute or Regulation +--------------------------------------------------- + +If it is impossible for You to comply with any of the terms of this +License with respect to some or all of the Covered Software due to +statute, judicial order, or regulation then You must: (a) comply with +the terms of this License to the maximum extent possible; and (b) +describe the limitations and the code they affect. Such description must +be placed in a text file included with all distributions of the Covered +Software under this License. Except to the extent prohibited by statute +or regulation, such description must be sufficiently detailed for a +recipient of ordinary skill to be able to understand it. + +5. Termination +-------------- + +5.1. The rights granted under this License will terminate automatically +if You fail to comply with any of its terms. However, if You become +compliant, then the rights granted under this License from a particular +Contributor are reinstated (a) provisionally, unless and until such +Contributor explicitly and finally terminates Your grants, and (b) on an +ongoing basis, if such Contributor fails to notify You of the +non-compliance by some reasonable means prior to 60 days after You have +come back into compliance. Moreover, Your grants from a particular +Contributor are reinstated on an ongoing basis if such Contributor +notifies You of the non-compliance by some reasonable means, this is the +first time You have received notice of non-compliance with this License +from such Contributor, and You become compliant prior to 30 days after +Your receipt of the notice. + +5.2. If You initiate litigation against any entity by asserting a patent +infringement claim (excluding declaratory judgment actions, +counter-claims, and cross-claims) alleging that a Contributor Version +directly or indirectly infringes any patent, then the rights granted to +You by any and all Contributors for the Covered Software under Section +2.1 of this License shall terminate. + +5.3. In the event of termination under Sections 5.1 or 5.2 above, all +end user license agreements (excluding distributors and resellers) which +have been validly granted by You or Your distributors under this License +prior to termination shall survive termination. + +************************************************************************ +* * +* 6. Disclaimer of Warranty * +* ------------------------- * +* * +* Covered Software is provided under this License on an "as is" * +* basis, without warranty of any kind, either expressed, implied, or * +* statutory, including, without limitation, warranties that the * +* Covered Software is free of defects, merchantable, fit for a * +* particular purpose or non-infringing. The entire risk as to the * +* quality and performance of the Covered Software is with You. * +* Should any Covered Software prove defective in any respect, You * +* (not any Contributor) assume the cost of any necessary servicing, * +* repair, or correction. This disclaimer of warranty constitutes an * +* essential part of this License. No use of any Covered Software is * +* authorized under this License except under this disclaimer. * +* * +************************************************************************ + +************************************************************************ +* * +* 7. Limitation of Liability * +* -------------------------- * +* * +* Under no circumstances and under no legal theory, whether tort * +* (including negligence), contract, or otherwise, shall any * +* Contributor, or anyone who distributes Covered Software as * +* permitted above, be liable to You for any direct, indirect, * +* special, incidental, or consequential damages of any character * +* including, without limitation, damages for lost profits, loss of * +* goodwill, work stoppage, computer failure or malfunction, or any * +* and all other commercial damages or losses, even if such party * +* shall have been informed of the possibility of such damages. This * +* limitation of liability shall not apply to liability for death or * +* personal injury resulting from such party's negligence to the * +* extent applicable law prohibits such limitation. Some * +* jurisdictions do not allow the exclusion or limitation of * +* incidental or consequential damages, so this exclusion and * +* limitation may not apply to You. * +* * +************************************************************************ + +8. Litigation +------------- + +Any litigation relating to this License may be brought only in the +courts of a jurisdiction where the defendant maintains its principal +place of business and such litigation shall be governed by laws of that +jurisdiction, without reference to its conflict-of-law provisions. +Nothing in this Section shall prevent a party's ability to bring +cross-claims or counter-claims. + +9. Miscellaneous +---------------- + +This License represents the complete agreement concerning the subject +matter hereof. If any provision of this License is held to be +unenforceable, such provision shall be reformed only to the extent +necessary to make it enforceable. Any law or regulation which provides +that the language of a contract shall be construed against the drafter +shall not be used to construe this License against a Contributor. + +10. Versions of the License +--------------------------- + +10.1. New Versions + +Mozilla Foundation is the license steward. Except as provided in Section +10.3, no one other than the license steward has the right to modify or +publish new versions of this License. Each version will be given a +distinguishing version number. + +10.2. Effect of New Versions + +You may distribute the Covered Software under the terms of the version +of the License under which You originally received the Covered Software, +or under the terms of any subsequent version published by the license +steward. + +10.3. Modified Versions + +If you create software not governed by this License, and you want to +create a new license for such software, you may create and use a +modified version of this License if you rename the license and remove +any references to the name of the license steward (except to note that +such modified license differs from this License). + +10.4. Distributing Source Code Form that is Incompatible With Secondary +Licenses + +If You choose to distribute Source Code Form that is Incompatible With +Secondary Licenses under the terms of this version of the License, the +notice described in Exhibit B of this License must be attached. + +Exhibit A - Source Code Form License Notice +------------------------------------------- + + This Source Code Form is subject to the terms of the Mozilla Public + License, v. 2.0. If a copy of the MPL was not distributed with this + file, You can obtain one at http://mozilla.org/MPL/2.0/. + +If it is not possible or desirable to put the notice in a particular +file, then You may include the notice in a location (such as a LICENSE +file in a relevant directory) where a recipient would be likely to look +for such a notice. + +You may add additional accurate notices of copyright ownership. + +Exhibit B - "Incompatible With Secondary Licenses" Notice +--------------------------------------------------------- + + This Source Code Form is "Incompatible With Secondary Licenses", as + defined by the Mozilla Public License, v. 2.0.
diff --git a/README.md b/README.md new file mode 100644 index 0000000..0b86d1e --- /dev/null +++ b/README.md
@@ -0,0 +1,5 @@ +# dtoa-short + +[](https://crates.io/crates/dtoa-short) +[](https://travis-ci.org/upsuper/dtoa-short) +[](https://codecov.io/gh/upsuper/dtoa-short)
diff --git a/src/lib.rs b/src/lib.rs new file mode 100644 index 0000000..c5c23ee --- /dev/null +++ b/src/lib.rs
@@ -0,0 +1,197 @@ +/* This Source Code Form is subject to the terms of the Mozilla Public + * License, v. 2.0. If a copy of the MPL was not distributed with this + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ + +extern crate dtoa; + +use std::fmt::Write; +use std::{fmt, str}; + +/// Format the given `value` into `dest` and return the notation it uses. +#[inline] +pub fn write<W: Write, V: Floating>(dest: &mut W, value: V) -> DtoaResult { + Floating::write(value, dest) +} + +/// Form of the formatted floating-point number. +#[derive(Debug, PartialEq, Eq, Clone, Copy)] +pub struct Notation { + /// Whether it contains a decimal point. + pub decimal_point: bool, + /// Whether it uses E-notation. + pub scientific: bool, +} + +impl Notation { + fn integer() -> Self { + Notation { + decimal_point: false, + scientific: false, + } + } +} + +/// Result of formatting the number. +pub type DtoaResult = Result<Notation, fmt::Error>; + +pub trait Floating : dtoa::Floating { + fn write<W: Write>(self, dest: &mut W) -> DtoaResult; +} + +impl Floating for f32 { + fn write<W: Write>(self, dest: &mut W) -> DtoaResult { + write_with_prec(dest, self, 6) + } +} + +impl Floating for f64 { + fn write<W: Write>(self, dest: &mut W) -> DtoaResult { + write_with_prec(dest, self, 15) + } +} + +// dtoa's buffer is 24 bytes, so we use the same length here. We may +// need to update if dtoa changes its number in the future. See +// https://github.com/dtolnay/dtoa/blob/ +// 584674a70af74521ce40350dba776ea67cfcbaa7/src/dtoa.rs#L465 +const BUFFER_SIZE: usize = 24; + +fn write_with_prec<W, V>(dest: &mut W, value: V, prec: usize) + -> DtoaResult where W: Write, V: dtoa::Floating +{ + let mut buf = [b'\0'; BUFFER_SIZE + 8]; + let len = dtoa::write(&mut buf[1..], value).map_err(|_| fmt::Error)?; + let (result, notation) = restrict_prec(&mut buf[0..len + 1], prec); + dest.write_str(if cfg!(debug_assertions) { + str::from_utf8(result).unwrap() + } else { + // safety: dtoa only generates ascii. + unsafe { str::from_utf8_unchecked(result) } + })?; + Ok(notation) +} + +fn restrict_prec(buf: &mut [u8], prec: usize) -> (&[u8], Notation) { + let len = buf.len(); + debug_assert!(len <= BUFFER_SIZE + 1, "dtoa may have changed its buffer size"); + // Put a leading zero to capture any carry. + debug_assert!(buf[0] == b'\0', "Caller must prepare an empty byte for us"); + buf[0] = b'0'; + // Remove the sign for now. We will put it back at the end. + let sign = match buf[1] { + s @ b'+' | s @ b'-' => { + buf[1] = b'0'; + Some(s) + } + _ => None, + }; + // Locate dot, exponent, and the first significant digit. + let mut pos_dot = None; + let mut pos_exp = None; + let mut prec_start = None; + for i in 1..len { + if buf[i] == b'.' { + debug_assert!(pos_dot.is_none()); + pos_dot = Some(i); + } else if buf[i] == b'e' { + pos_exp = Some(i); + // We don't change exponent part, so stop here. + break; + } else if prec_start.is_none() && buf[i] != b'0' { + debug_assert!(buf[i] >= b'1' && buf[i] <= b'9'); + prec_start = Some(i); + } + } + let prec_start = match prec_start { + Some(i) => i, + // If there is no non-zero digit at all, it is just zero. + None => return (&buf[0..1], Notation::integer()), + }; + // Coefficient part ends at 'e' or the length. + let coeff_end = pos_exp.unwrap_or(len); + // Decimal dot is effectively at the end of coefficient part if no + // dot presents before that. + let pos_dot = pos_dot.unwrap_or(coeff_end); + // Find the end position of the number within the given precision. + let prec_end = { + let end = prec_start + prec; + if pos_dot > prec_start && pos_dot <= end { + end + 1 + } else { + end + } + }; + let mut new_coeff_end = coeff_end; + if prec_end < coeff_end { + // Round to the given precision. + let next_char = buf[prec_end]; + new_coeff_end = prec_end; + if next_char >= b'5' { + for i in (0..prec_end).rev() { + if buf[i] == b'.' { + continue; + } + if buf[i] != b'9' { + buf[i] += 1; + new_coeff_end = i + 1; + break; + } + buf[i] = b'0'; + } + } + } + if new_coeff_end < pos_dot { + // If the precision isn't enough to reach the dot, set all digits + // in-between to zero and keep the number until the dot. + for i in new_coeff_end..pos_dot { + buf[i] = b'0'; + } + new_coeff_end = pos_dot; + } else { + // Strip any trailing zeros. + for i in (0..new_coeff_end).rev() { + if buf[i] != b'0' { + if buf[i] == b'.' { + new_coeff_end = i; + } + break; + } + new_coeff_end = i; + } + } + // Move exponent part if necessary. + let real_end = if let Some(pos_exp) = pos_exp { + let exp_len = len - pos_exp; + if new_coeff_end != pos_exp { + for i in 0..exp_len { + buf[new_coeff_end + i] = buf[pos_exp + i]; + } + } + new_coeff_end + exp_len + } else { + new_coeff_end + }; + // Add back the sign and strip the leading zero. + let result = if let Some(sign) = sign { + if buf[1] == b'0' && buf[2] != b'.' { + buf[1] = sign; + &buf[1..real_end] + } else { + debug_assert!(buf[0] == b'0'); + buf[0] = sign; + &buf[0..real_end] + } + } else { + if buf[0] == b'0' && buf[1] != b'.' { + &buf[1..real_end] + } else { + &buf[0..real_end] + } + }; + // Generate the notation info. + let notation = Notation { + decimal_point: pos_dot < new_coeff_end, + scientific: pos_exp.is_some(), + }; + (result, notation) +}
diff --git a/tests/basic.rs b/tests/basic.rs new file mode 100644 index 0000000..9244669 --- /dev/null +++ b/tests/basic.rs
@@ -0,0 +1,137 @@ +/* This Source Code Form is subject to the terms of the Mozilla Public + * License, v. 2.0. If a copy of the MPL was not distributed with this + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ + +extern crate dtoa; +extern crate dtoa_short; +extern crate float_cmp; + +use dtoa_short::{Floating, Notation}; +use float_cmp::ApproxEqUlps; +use std::ops::Range; + +struct SimpleNumberGenerator { + whole_part: Range<i32>, + digit1: Range<u8>, + digit2: Range<u8>, +} + +impl SimpleNumberGenerator { + fn new(start: i32, end: i32) -> Self { + SimpleNumberGenerator { + whole_part: Range { start, end }, + digit1: Range { start: 0, end: 0 }, + digit2: Range { start: 0, end: 0 }, + } + } +} + +impl Iterator for SimpleNumberGenerator { + type Item = String; + + fn next(&mut self) -> Option<Self::Item> { + if self.digit2.next().is_some() { + Some(format!("{}.{}{}", self.whole_part.start - 1, + self.digit1.start, self.digit2.start)) + } else { + self.digit2 = Range { start: 0, end: 9 }; + if self.digit1.next().is_some() { + Some(format!("{}.{}", self.whole_part.start - 1, + self.digit1.start)) + } else { + self.digit1 = Range { start: 0, end: 9 }; + if self.whole_part.next().is_some() { + Some(format!("{}", self.whole_part.start - 1)) + } else { + None + } + } + } + } +} + +#[test] +fn generator_correctness() { + let mut last = 0; + let end = 101; + for (i, s) in SimpleNumberGenerator::new(0, end).enumerate() { + let expected = i as f32 * 0.01; + let result = s.parse::<f32>().unwrap(); + assert!(result.approx_eq_ulps(&expected, 1), + "str = {}, result = {}, expected = {}", s, result, expected); + last = i as i32; + } + assert_eq!(last, end * 100 - 1); +} + +fn assert_expected_serialization<T: Floating>(value: T, expected: &str) { + let mut result = String::new(); + let notation = dtoa_short::write(&mut result, value).unwrap(); + assert_eq!(result, expected); + + let exp_pos = expected.find('e'); + let has_dot = exp_pos.map(|exp_pos| &expected[..exp_pos]) + .unwrap_or(expected) + .contains('.'); + let expected_notation = Notation { + decimal_point: has_dot, + scientific: exp_pos.is_some(), + }; + assert_eq!(notation, expected_notation); +} + +#[test] +fn roundtrip_simple_numbers_f32() { + for s in SimpleNumberGenerator::new(0, 101) { + let value = s.parse::<f32>().unwrap(); + assert_expected_serialization(value, &s); + } +} + +fn test_simple_number_percentage_f32<F: FnMut(f32, &str)>(mut test: F) { + for s in SimpleNumberGenerator::new(0, 101) { + let value = s.parse::<f32>().unwrap(); + let value = value / 100.; + let value = value * 100.; + test(value, &s); + } +} + +// This test is for checking that test_simple_number_percentage_f32 +// actually works as expected, that it can generate numbers which dtoa +// fails to roundtrip. +#[test] +fn roundtrip_simple_numbers_percentage_dtoa_f32() { + let mut count = 0; + test_simple_number_percentage_f32(|value, expected| { + let mut result = Vec::new(); + dtoa::write(&mut result, value).unwrap(); + let result = String::from_utf8(result).unwrap(); + if result != expected { + count += 1; + } + }); + // This number may change if dtoa changes the algorithm. + assert_eq!(count, 1135); +} + +#[test] +fn roundtrip_simple_numbers_percentage_f32() { + test_simple_number_percentage_f32(assert_expected_serialization); +} + +#[test] +fn exponent_part_handling() { + assert_expected_serialization(3.999999e30_f32, "4e30"); + assert_expected_serialization(-3.999999e30_f32, "-4e30"); + assert_expected_serialization(3.999999e-30_f32, "4e-30"); + assert_expected_serialization(-3.999999e-30_f32, "-4e-30"); + // 10e30 should really be 1e31, and 10e-30 should be 1e-29. + // We can probably improve it later. + assert_expected_serialization(9.999999e30_f32, "10e30"); + assert_expected_serialization(-9.999999e30_f32, "-10e30"); + assert_expected_serialization(9.999999e-30_f32, "10e-30"); + assert_expected_serialization(-9.999999e-30_f32, "-10e-30"); + // Regression test for assertion failure (https://bugzilla.mozilla.org/show_bug.cgi?id=1402419) + assert_expected_serialization(-8192e17_f32, "-819200000000000000000"); +}