/rust/registry/src/index.crates.io-1949cf8c6b5b557f/itoa-1.0.15/src/lib.rs
Line | Count | Source |
1 | | //! [![github]](https://github.com/dtolnay/itoa) [![crates-io]](https://crates.io/crates/itoa) [![docs-rs]](https://docs.rs/itoa) |
2 | | //! |
3 | | //! [github]: https://img.shields.io/badge/github-8da0cb?style=for-the-badge&labelColor=555555&logo=github |
4 | | //! [crates-io]: https://img.shields.io/badge/crates.io-fc8d62?style=for-the-badge&labelColor=555555&logo=rust |
5 | | //! [docs-rs]: https://img.shields.io/badge/docs.rs-66c2a5?style=for-the-badge&labelColor=555555&logo=docs.rs |
6 | | //! |
7 | | //! <br> |
8 | | //! |
9 | | //! This crate provides a fast conversion of integer primitives to decimal |
10 | | //! strings. The implementation comes straight from [libcore] but avoids the |
11 | | //! performance penalty of going through [`core::fmt::Formatter`]. |
12 | | //! |
13 | | //! See also [`ryu`] for printing floating point primitives. |
14 | | //! |
15 | | //! [libcore]: https://github.com/rust-lang/rust/blob/b8214dc6c6fc20d0a660fb5700dca9ebf51ebe89/src/libcore/fmt/num.rs#L201-L254 |
16 | | //! [`ryu`]: https://github.com/dtolnay/ryu |
17 | | //! |
18 | | //! # Example |
19 | | //! |
20 | | //! ``` |
21 | | //! fn main() { |
22 | | //! let mut buffer = itoa::Buffer::new(); |
23 | | //! let printed = buffer.format(128u64); |
24 | | //! assert_eq!(printed, "128"); |
25 | | //! } |
26 | | //! ``` |
27 | | //! |
28 | | //! # Performance (lower is better) |
29 | | //! |
30 | | //!  |
31 | | |
32 | | #![doc(html_root_url = "https://docs.rs/itoa/1.0.15")] |
33 | | #![no_std] |
34 | | #![allow( |
35 | | clippy::cast_lossless, |
36 | | clippy::cast_possible_truncation, |
37 | | clippy::cast_possible_wrap, |
38 | | clippy::cast_sign_loss, |
39 | | clippy::expl_impl_clone_on_copy, |
40 | | clippy::must_use_candidate, |
41 | | clippy::needless_doctest_main, |
42 | | clippy::unreadable_literal |
43 | | )] |
44 | | |
45 | | mod udiv128; |
46 | | |
47 | | use core::hint; |
48 | | use core::mem::MaybeUninit; |
49 | | use core::{ptr, slice, str}; |
50 | | #[cfg(feature = "no-panic")] |
51 | | use no_panic::no_panic; |
52 | | |
53 | | /// A correctly sized stack allocation for the formatted integer to be written |
54 | | /// into. |
55 | | /// |
56 | | /// # Example |
57 | | /// |
58 | | /// ``` |
59 | | /// let mut buffer = itoa::Buffer::new(); |
60 | | /// let printed = buffer.format(1234); |
61 | | /// assert_eq!(printed, "1234"); |
62 | | /// ``` |
63 | | pub struct Buffer { |
64 | | bytes: [MaybeUninit<u8>; i128::MAX_STR_LEN], |
65 | | } |
66 | | |
67 | | impl Default for Buffer { |
68 | | #[inline] |
69 | | fn default() -> Buffer { |
70 | | Buffer::new() |
71 | | } |
72 | | } |
73 | | |
74 | | impl Copy for Buffer {} |
75 | | |
76 | | impl Clone for Buffer { |
77 | | #[inline] |
78 | | #[allow(clippy::non_canonical_clone_impl)] // false positive https://github.com/rust-lang/rust-clippy/issues/11072 |
79 | | fn clone(&self) -> Self { |
80 | | Buffer::new() |
81 | | } |
82 | | } |
83 | | |
84 | | impl Buffer { |
85 | | /// This is a cheap operation; you don't need to worry about reusing buffers |
86 | | /// for efficiency. |
87 | | #[inline] |
88 | | #[cfg_attr(feature = "no-panic", no_panic)] |
89 | 5.17M | pub fn new() -> Buffer { |
90 | 5.17M | let bytes = [MaybeUninit::<u8>::uninit(); i128::MAX_STR_LEN]; |
91 | 5.17M | Buffer { bytes } |
92 | 5.17M | } Line | Count | Source | 89 | 96.6k | pub fn new() -> Buffer { | 90 | 96.6k | let bytes = [MaybeUninit::<u8>::uninit(); i128::MAX_STR_LEN]; | 91 | 96.6k | Buffer { bytes } | 92 | 96.6k | } |
Line | Count | Source | 89 | 5.07M | pub fn new() -> Buffer { | 90 | 5.07M | let bytes = [MaybeUninit::<u8>::uninit(); i128::MAX_STR_LEN]; | 91 | 5.07M | Buffer { bytes } | 92 | 5.07M | } |
|
93 | | |
94 | | /// Print an integer into this buffer and return a reference to its string |
95 | | /// representation within the buffer. |
96 | | #[cfg_attr(feature = "no-panic", no_panic)] |
97 | 5.17M | pub fn format<I: Integer>(&mut self, i: I) -> &str { |
98 | 5.17M | let string = i.write(unsafe { |
99 | 5.17M | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] |
100 | 5.17M | as *mut <I as private::Sealed>::Buffer) |
101 | | }); |
102 | 5.17M | if string.len() > I::MAX_STR_LEN { |
103 | 0 | unsafe { hint::unreachable_unchecked() }; |
104 | 5.17M | } |
105 | 5.17M | string |
106 | 5.17M | } <itoa::Buffer>::format::<i8> Line | Count | Source | 97 | 9.54k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 9.54k | let string = i.write(unsafe { | 99 | 9.54k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 9.54k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 9.54k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 9.54k | } | 105 | 9.54k | string | 106 | 9.54k | } |
<itoa::Buffer>::format::<u8> Line | Count | Source | 97 | 2.92k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 2.92k | let string = i.write(unsafe { | 99 | 2.92k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 2.92k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 2.92k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 2.92k | } | 105 | 2.92k | string | 106 | 2.92k | } |
<itoa::Buffer>::format::<i32> Line | Count | Source | 97 | 61.4k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 61.4k | let string = i.write(unsafe { | 99 | 61.4k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 61.4k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 61.4k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 61.4k | } | 105 | 61.4k | string | 106 | 61.4k | } |
<itoa::Buffer>::format::<u32> Line | Count | Source | 97 | 3.09k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.09k | let string = i.write(unsafe { | 99 | 3.09k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.09k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.09k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.09k | } | 105 | 3.09k | string | 106 | 3.09k | } |
<itoa::Buffer>::format::<i128> Line | Count | Source | 97 | 3.10k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.10k | let string = i.write(unsafe { | 99 | 3.10k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.10k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.10k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.10k | } | 105 | 3.10k | string | 106 | 3.10k | } |
<itoa::Buffer>::format::<u128> Line | Count | Source | 97 | 3.11k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.11k | let string = i.write(unsafe { | 99 | 3.11k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.11k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.11k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.11k | } | 105 | 3.11k | string | 106 | 3.11k | } |
<itoa::Buffer>::format::<i16> Line | Count | Source | 97 | 2.88k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 2.88k | let string = i.write(unsafe { | 99 | 2.88k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 2.88k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 2.88k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 2.88k | } | 105 | 2.88k | string | 106 | 2.88k | } |
<itoa::Buffer>::format::<u16> Line | Count | Source | 97 | 3.46k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.46k | let string = i.write(unsafe { | 99 | 3.46k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.46k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.46k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.46k | } | 105 | 3.46k | string | 106 | 3.46k | } |
<itoa::Buffer>::format::<i64> Line | Count | Source | 97 | 3.65k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.65k | let string = i.write(unsafe { | 99 | 3.65k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.65k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.65k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.65k | } | 105 | 3.65k | string | 106 | 3.65k | } |
<itoa::Buffer>::format::<u64> Line | Count | Source | 97 | 3.38k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.38k | let string = i.write(unsafe { | 99 | 3.38k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.38k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.38k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.38k | } | 105 | 3.38k | string | 106 | 3.38k | } |
<itoa::Buffer>::format::<i8> Line | Count | Source | 97 | 886k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 886k | let string = i.write(unsafe { | 99 | 886k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 886k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 886k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 886k | } | 105 | 886k | string | 106 | 886k | } |
<itoa::Buffer>::format::<u8> Line | Count | Source | 97 | 263k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 263k | let string = i.write(unsafe { | 99 | 263k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 263k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 263k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 263k | } | 105 | 263k | string | 106 | 263k | } |
<itoa::Buffer>::format::<u32> Line | Count | Source | 97 | 326k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 326k | let string = i.write(unsafe { | 99 | 326k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 326k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 326k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 326k | } | 105 | 326k | string | 106 | 326k | } |
<itoa::Buffer>::format::<u16> Line | Count | Source | 97 | 533k | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 533k | let string = i.write(unsafe { | 99 | 533k | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 533k | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 533k | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 533k | } | 105 | 533k | string | 106 | 533k | } |
<itoa::Buffer>::format::<u64> Line | Count | Source | 97 | 3.06M | pub fn format<I: Integer>(&mut self, i: I) -> &str { | 98 | 3.06M | let string = i.write(unsafe { | 99 | 3.06M | &mut *(&mut self.bytes as *mut [MaybeUninit<u8>; i128::MAX_STR_LEN] | 100 | 3.06M | as *mut <I as private::Sealed>::Buffer) | 101 | | }); | 102 | 3.06M | if string.len() > I::MAX_STR_LEN { | 103 | 0 | unsafe { hint::unreachable_unchecked() }; | 104 | 3.06M | } | 105 | 3.06M | string | 106 | 3.06M | } |
|
107 | | } |
108 | | |
109 | | /// An integer that can be written into an [`itoa::Buffer`][Buffer]. |
110 | | /// |
111 | | /// This trait is sealed and cannot be implemented for types outside of itoa. |
112 | | pub trait Integer: private::Sealed { |
113 | | /// The maximum length of string that formatting an integer of this type can |
114 | | /// produce on the current target platform. |
115 | | const MAX_STR_LEN: usize; |
116 | | } |
117 | | |
118 | | // Seal to prevent downstream implementations of the Integer trait. |
119 | | mod private { |
120 | | #[doc(hidden)] |
121 | | pub trait Sealed: Copy { |
122 | | #[doc(hidden)] |
123 | | type Buffer: 'static; |
124 | | fn write(self, buf: &mut Self::Buffer) -> &str; |
125 | | } |
126 | | } |
127 | | |
128 | | const DEC_DIGITS_LUT: [u8; 200] = *b"\ |
129 | | 0001020304050607080910111213141516171819\ |
130 | | 2021222324252627282930313233343536373839\ |
131 | | 4041424344454647484950515253545556575859\ |
132 | | 6061626364656667686970717273747576777879\ |
133 | | 8081828384858687888990919293949596979899"; |
134 | | |
135 | | // Adaptation of the original implementation at |
136 | | // https://github.com/rust-lang/rust/blob/b8214dc6c6fc20d0a660fb5700dca9ebf51ebe89/src/libcore/fmt/num.rs#L188-L266 |
137 | | macro_rules! impl_Integer { |
138 | | ($t:ty[len = $max_len:expr] as $large_unsigned:ty) => { |
139 | | impl Integer for $t { |
140 | | const MAX_STR_LEN: usize = $max_len; |
141 | | } |
142 | | |
143 | | impl private::Sealed for $t { |
144 | | type Buffer = [MaybeUninit<u8>; $max_len]; |
145 | | |
146 | | #[allow(unused_comparisons)] |
147 | | #[inline] |
148 | | #[cfg_attr(feature = "no-panic", no_panic)] |
149 | 5.17M | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { |
150 | 5.17M | let is_nonnegative = self >= 0; |
151 | 5.17M | let mut n = if is_nonnegative { |
152 | 4.79M | self as $large_unsigned |
153 | 381k | } else { |
154 | 381k | // Convert negative number to positive by summing 1 to its two's complement. |
155 | 381k | (!(self as $large_unsigned)).wrapping_add(1) |
156 | | }; |
157 | 5.17M | let mut curr = buf.len(); |
158 | 5.17M | let buf_ptr = buf.as_mut_ptr() as *mut u8; |
159 | 5.17M | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); |
160 | | |
161 | | // Render 4 digits at a time. |
162 | 18.6M | while n >= 10000 { |
163 | 13.4M | let rem = n % 10000; |
164 | 13.4M | n /= 10000; |
165 | | |
166 | 13.4M | let d1 = ((rem / 100) << 1) as usize; |
167 | 13.4M | let d2 = ((rem % 100) << 1) as usize; |
168 | 13.4M | curr -= 4; |
169 | 13.4M | unsafe { |
170 | 13.4M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); |
171 | 13.4M | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); |
172 | 13.4M | } |
173 | | } |
174 | | |
175 | | // Render 2 more digits, if >2 digits. |
176 | 5.17M | if n >= 100 { |
177 | 3.50M | let d1 = ((n % 100) << 1) as usize; |
178 | 3.50M | n /= 100; |
179 | 3.50M | curr -= 2; |
180 | 3.50M | unsafe { |
181 | 3.50M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); |
182 | 3.50M | } |
183 | 1.67M | } |
184 | | |
185 | | // Render last 1 or 2 digits. |
186 | 5.17M | if n < 10 { |
187 | 3.31M | curr -= 1; |
188 | 3.31M | unsafe { |
189 | 3.31M | *buf_ptr.add(curr) = (n as u8) + b'0'; |
190 | 3.31M | } |
191 | | } else { |
192 | 1.86M | let d1 = (n << 1) as usize; |
193 | 1.86M | curr -= 2; |
194 | 1.86M | unsafe { |
195 | 1.86M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); |
196 | 1.86M | } |
197 | | } |
198 | | |
199 | 5.17M | if !is_nonnegative { |
200 | 381k | curr -= 1; |
201 | 381k | unsafe { |
202 | 381k | *buf_ptr.add(curr) = b'-'; |
203 | 381k | } |
204 | 4.79M | } |
205 | | |
206 | 5.17M | let len = buf.len() - curr; |
207 | 5.17M | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; |
208 | 5.17M | unsafe { str::from_utf8_unchecked(bytes) } |
209 | 5.17M | } <i8 as itoa::private::Sealed>::write Line | Count | Source | 149 | 9.54k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 9.54k | let is_nonnegative = self >= 0; | 151 | 9.54k | let mut n = if is_nonnegative { | 152 | 8.81k | self as $large_unsigned | 153 | 731 | } else { | 154 | 731 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 731 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 9.54k | let mut curr = buf.len(); | 158 | 9.54k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 9.54k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 9.54k | while n >= 10000 { | 163 | 0 | let rem = n % 10000; | 164 | 0 | n /= 10000; | 165 | | | 166 | 0 | let d1 = ((rem / 100) << 1) as usize; | 167 | 0 | let d2 = ((rem % 100) << 1) as usize; | 168 | 0 | curr -= 4; | 169 | 0 | unsafe { | 170 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 0 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 9.54k | if n >= 100 { | 177 | 280 | let d1 = ((n % 100) << 1) as usize; | 178 | 280 | n /= 100; | 179 | 280 | curr -= 2; | 180 | 280 | unsafe { | 181 | 280 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 280 | } | 183 | 9.26k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 9.54k | if n < 10 { | 187 | 5.62k | curr -= 1; | 188 | 5.62k | unsafe { | 189 | 5.62k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 5.62k | } | 191 | | } else { | 192 | 3.91k | let d1 = (n << 1) as usize; | 193 | 3.91k | curr -= 2; | 194 | 3.91k | unsafe { | 195 | 3.91k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 3.91k | } | 197 | | } | 198 | | | 199 | 9.54k | if !is_nonnegative { | 200 | 731 | curr -= 1; | 201 | 731 | unsafe { | 202 | 731 | *buf_ptr.add(curr) = b'-'; | 203 | 731 | } | 204 | 8.81k | } | 205 | | | 206 | 9.54k | let len = buf.len() - curr; | 207 | 9.54k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 9.54k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 9.54k | } |
<u8 as itoa::private::Sealed>::write Line | Count | Source | 149 | 2.92k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 2.92k | let is_nonnegative = self >= 0; | 151 | 2.92k | let mut n = if is_nonnegative { | 152 | 2.92k | self as $large_unsigned | 153 | 0 | } else { | 154 | 0 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 2.92k | let mut curr = buf.len(); | 158 | 2.92k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 2.92k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 2.92k | while n >= 10000 { | 163 | 0 | let rem = n % 10000; | 164 | 0 | n /= 10000; | 165 | | | 166 | 0 | let d1 = ((rem / 100) << 1) as usize; | 167 | 0 | let d2 = ((rem % 100) << 1) as usize; | 168 | 0 | curr -= 4; | 169 | 0 | unsafe { | 170 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 0 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 2.92k | if n >= 100 { | 177 | 87 | let d1 = ((n % 100) << 1) as usize; | 178 | 87 | n /= 100; | 179 | 87 | curr -= 2; | 180 | 87 | unsafe { | 181 | 87 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 87 | } | 183 | 2.83k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 2.92k | if n < 10 { | 187 | 1.14k | curr -= 1; | 188 | 1.14k | unsafe { | 189 | 1.14k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.14k | } | 191 | | } else { | 192 | 1.77k | let d1 = (n << 1) as usize; | 193 | 1.77k | curr -= 2; | 194 | 1.77k | unsafe { | 195 | 1.77k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 1.77k | } | 197 | | } | 198 | | | 199 | 2.92k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 2.92k | } | 205 | | | 206 | 2.92k | let len = buf.len() - curr; | 207 | 2.92k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 2.92k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 2.92k | } |
<i16 as itoa::private::Sealed>::write Line | Count | Source | 149 | 2.88k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 2.88k | let is_nonnegative = self >= 0; | 151 | 2.88k | let mut n = if is_nonnegative { | 152 | 2.72k | self as $large_unsigned | 153 | 168 | } else { | 154 | 168 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 168 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 2.88k | let mut curr = buf.len(); | 158 | 2.88k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 2.88k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 2.93k | while n >= 10000 { | 163 | 45 | let rem = n % 10000; | 164 | 45 | n /= 10000; | 165 | | | 166 | 45 | let d1 = ((rem / 100) << 1) as usize; | 167 | 45 | let d2 = ((rem % 100) << 1) as usize; | 168 | 45 | curr -= 4; | 169 | 45 | unsafe { | 170 | 45 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 45 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 45 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 2.88k | if n >= 100 { | 177 | 395 | let d1 = ((n % 100) << 1) as usize; | 178 | 395 | n /= 100; | 179 | 395 | curr -= 2; | 180 | 395 | unsafe { | 181 | 395 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 395 | } | 183 | 2.49k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 2.88k | if n < 10 { | 187 | 1.58k | curr -= 1; | 188 | 1.58k | unsafe { | 189 | 1.58k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.58k | } | 191 | | } else { | 192 | 1.30k | let d1 = (n << 1) as usize; | 193 | 1.30k | curr -= 2; | 194 | 1.30k | unsafe { | 195 | 1.30k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 1.30k | } | 197 | | } | 198 | | | 199 | 2.88k | if !is_nonnegative { | 200 | 168 | curr -= 1; | 201 | 168 | unsafe { | 202 | 168 | *buf_ptr.add(curr) = b'-'; | 203 | 168 | } | 204 | 2.72k | } | 205 | | | 206 | 2.88k | let len = buf.len() - curr; | 207 | 2.88k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 2.88k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 2.88k | } |
<u16 as itoa::private::Sealed>::write Line | Count | Source | 149 | 3.46k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 3.46k | let is_nonnegative = self >= 0; | 151 | 3.46k | let mut n = if is_nonnegative { | 152 | 3.46k | self as $large_unsigned | 153 | 0 | } else { | 154 | 0 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 3.46k | let mut curr = buf.len(); | 158 | 3.46k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 3.46k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 3.55k | while n >= 10000 { | 163 | 87 | let rem = n % 10000; | 164 | 87 | n /= 10000; | 165 | | | 166 | 87 | let d1 = ((rem / 100) << 1) as usize; | 167 | 87 | let d2 = ((rem % 100) << 1) as usize; | 168 | 87 | curr -= 4; | 169 | 87 | unsafe { | 170 | 87 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 87 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 87 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 3.46k | if n >= 100 { | 177 | 462 | let d1 = ((n % 100) << 1) as usize; | 178 | 462 | n /= 100; | 179 | 462 | curr -= 2; | 180 | 462 | unsafe { | 181 | 462 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 462 | } | 183 | 3.00k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 3.46k | if n < 10 { | 187 | 1.64k | curr -= 1; | 188 | 1.64k | unsafe { | 189 | 1.64k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.64k | } | 191 | | } else { | 192 | 1.81k | let d1 = (n << 1) as usize; | 193 | 1.81k | curr -= 2; | 194 | 1.81k | unsafe { | 195 | 1.81k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 1.81k | } | 197 | | } | 198 | | | 199 | 3.46k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 3.46k | } | 205 | | | 206 | 3.46k | let len = buf.len() - curr; | 207 | 3.46k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 3.46k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 3.46k | } |
<i32 as itoa::private::Sealed>::write Line | Count | Source | 149 | 61.4k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 61.4k | let is_nonnegative = self >= 0; | 151 | 61.4k | let mut n = if is_nonnegative { | 152 | 56.0k | self as $large_unsigned | 153 | 5.48k | } else { | 154 | 5.48k | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 5.48k | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 61.4k | let mut curr = buf.len(); | 158 | 61.4k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 61.4k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 105k | while n >= 10000 { | 163 | 44.4k | let rem = n % 10000; | 164 | 44.4k | n /= 10000; | 165 | | | 166 | 44.4k | let d1 = ((rem / 100) << 1) as usize; | 167 | 44.4k | let d2 = ((rem % 100) << 1) as usize; | 168 | 44.4k | curr -= 4; | 169 | 44.4k | unsafe { | 170 | 44.4k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 44.4k | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 44.4k | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 61.4k | if n >= 100 { | 177 | 17.1k | let d1 = ((n % 100) << 1) as usize; | 178 | 17.1k | n /= 100; | 179 | 17.1k | curr -= 2; | 180 | 17.1k | unsafe { | 181 | 17.1k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 17.1k | } | 183 | 44.3k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 61.4k | if n < 10 { | 187 | 38.3k | curr -= 1; | 188 | 38.3k | unsafe { | 189 | 38.3k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 38.3k | } | 191 | | } else { | 192 | 23.1k | let d1 = (n << 1) as usize; | 193 | 23.1k | curr -= 2; | 194 | 23.1k | unsafe { | 195 | 23.1k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 23.1k | } | 197 | | } | 198 | | | 199 | 61.4k | if !is_nonnegative { | 200 | 5.48k | curr -= 1; | 201 | 5.48k | unsafe { | 202 | 5.48k | *buf_ptr.add(curr) = b'-'; | 203 | 5.48k | } | 204 | 56.0k | } | 205 | | | 206 | 61.4k | let len = buf.len() - curr; | 207 | 61.4k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 61.4k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 61.4k | } |
<u32 as itoa::private::Sealed>::write Line | Count | Source | 149 | 3.09k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 3.09k | let is_nonnegative = self >= 0; | 151 | 3.09k | let mut n = if is_nonnegative { | 152 | 3.09k | self as $large_unsigned | 153 | | } else { | 154 | | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 3.09k | let mut curr = buf.len(); | 158 | 3.09k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 3.09k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 3.30k | while n >= 10000 { | 163 | 212 | let rem = n % 10000; | 164 | 212 | n /= 10000; | 165 | | | 166 | 212 | let d1 = ((rem / 100) << 1) as usize; | 167 | 212 | let d2 = ((rem % 100) << 1) as usize; | 168 | 212 | curr -= 4; | 169 | 212 | unsafe { | 170 | 212 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 212 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 212 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 3.09k | if n >= 100 { | 177 | 431 | let d1 = ((n % 100) << 1) as usize; | 178 | 431 | n /= 100; | 179 | 431 | curr -= 2; | 180 | 431 | unsafe { | 181 | 431 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 431 | } | 183 | 2.66k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 3.09k | if n < 10 { | 187 | 1.37k | curr -= 1; | 188 | 1.37k | unsafe { | 189 | 1.37k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.37k | } | 191 | | } else { | 192 | 1.72k | let d1 = (n << 1) as usize; | 193 | 1.72k | curr -= 2; | 194 | 1.72k | unsafe { | 195 | 1.72k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 1.72k | } | 197 | | } | 198 | | | 199 | 3.09k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 3.09k | } | 205 | | | 206 | 3.09k | let len = buf.len() - curr; | 207 | 3.09k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 3.09k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 3.09k | } |
<i64 as itoa::private::Sealed>::write Line | Count | Source | 149 | 3.65k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 3.65k | let is_nonnegative = self >= 0; | 151 | 3.65k | let mut n = if is_nonnegative { | 152 | 3.50k | self as $large_unsigned | 153 | 154 | } else { | 154 | 154 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 154 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 3.65k | let mut curr = buf.len(); | 158 | 3.65k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 3.65k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 4.32k | while n >= 10000 { | 163 | 669 | let rem = n % 10000; | 164 | 669 | n /= 10000; | 165 | | | 166 | 669 | let d1 = ((rem / 100) << 1) as usize; | 167 | 669 | let d2 = ((rem % 100) << 1) as usize; | 168 | 669 | curr -= 4; | 169 | 669 | unsafe { | 170 | 669 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 669 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 669 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 3.65k | if n >= 100 { | 177 | 587 | let d1 = ((n % 100) << 1) as usize; | 178 | 587 | n /= 100; | 179 | 587 | curr -= 2; | 180 | 587 | unsafe { | 181 | 587 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 587 | } | 183 | 3.07k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 3.65k | if n < 10 { | 187 | 1.55k | curr -= 1; | 188 | 1.55k | unsafe { | 189 | 1.55k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.55k | } | 191 | | } else { | 192 | 2.10k | let d1 = (n << 1) as usize; | 193 | 2.10k | curr -= 2; | 194 | 2.10k | unsafe { | 195 | 2.10k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 2.10k | } | 197 | | } | 198 | | | 199 | 3.65k | if !is_nonnegative { | 200 | 154 | curr -= 1; | 201 | 154 | unsafe { | 202 | 154 | *buf_ptr.add(curr) = b'-'; | 203 | 154 | } | 204 | 3.50k | } | 205 | | | 206 | 3.65k | let len = buf.len() - curr; | 207 | 3.65k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 3.65k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 3.65k | } |
<u64 as itoa::private::Sealed>::write Line | Count | Source | 149 | 9.96k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 9.96k | let is_nonnegative = self >= 0; | 151 | 9.96k | let mut n = if is_nonnegative { | 152 | 9.96k | self as $large_unsigned | 153 | | } else { | 154 | | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 9.96k | let mut curr = buf.len(); | 158 | 9.96k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 9.96k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 13.4k | while n >= 10000 { | 163 | 3.46k | let rem = n % 10000; | 164 | 3.46k | n /= 10000; | 165 | | | 166 | 3.46k | let d1 = ((rem / 100) << 1) as usize; | 167 | 3.46k | let d2 = ((rem % 100) << 1) as usize; | 168 | 3.46k | curr -= 4; | 169 | 3.46k | unsafe { | 170 | 3.46k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 3.46k | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 3.46k | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 9.96k | if n >= 100 { | 177 | 1.90k | let d1 = ((n % 100) << 1) as usize; | 178 | 1.90k | n /= 100; | 179 | 1.90k | curr -= 2; | 180 | 1.90k | unsafe { | 181 | 1.90k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 1.90k | } | 183 | 8.05k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 9.96k | if n < 10 { | 187 | 4.89k | curr -= 1; | 188 | 4.89k | unsafe { | 189 | 4.89k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 4.89k | } | 191 | | } else { | 192 | 5.07k | let d1 = (n << 1) as usize; | 193 | 5.07k | curr -= 2; | 194 | 5.07k | unsafe { | 195 | 5.07k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 5.07k | } | 197 | | } | 198 | | | 199 | 9.96k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 9.96k | } | 205 | | | 206 | 9.96k | let len = buf.len() - curr; | 207 | 9.96k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 9.96k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 9.96k | } |
<i8 as itoa::private::Sealed>::write Line | Count | Source | 149 | 886k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 886k | let is_nonnegative = self >= 0; | 151 | 886k | let mut n = if is_nonnegative { | 152 | 512k | self as $large_unsigned | 153 | 374k | } else { | 154 | 374k | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 374k | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 886k | let mut curr = buf.len(); | 158 | 886k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 886k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 886k | while n >= 10000 { | 163 | 0 | let rem = n % 10000; | 164 | 0 | n /= 10000; | 165 | | | 166 | 0 | let d1 = ((rem / 100) << 1) as usize; | 167 | 0 | let d2 = ((rem % 100) << 1) as usize; | 168 | 0 | curr -= 4; | 169 | 0 | unsafe { | 170 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 0 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 886k | if n >= 100 { | 177 | 366k | let d1 = ((n % 100) << 1) as usize; | 178 | 366k | n /= 100; | 179 | 366k | curr -= 2; | 180 | 366k | unsafe { | 181 | 366k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 366k | } | 183 | 520k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 886k | if n < 10 { | 187 | 816k | curr -= 1; | 188 | 816k | unsafe { | 189 | 816k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 816k | } | 191 | | } else { | 192 | 69.9k | let d1 = (n << 1) as usize; | 193 | 69.9k | curr -= 2; | 194 | 69.9k | unsafe { | 195 | 69.9k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 69.9k | } | 197 | | } | 198 | | | 199 | 886k | if !is_nonnegative { | 200 | 374k | curr -= 1; | 201 | 374k | unsafe { | 202 | 374k | *buf_ptr.add(curr) = b'-'; | 203 | 374k | } | 204 | 512k | } | 205 | | | 206 | 886k | let len = buf.len() - curr; | 207 | 886k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 886k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 886k | } |
<u8 as itoa::private::Sealed>::write Line | Count | Source | 149 | 263k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 263k | let is_nonnegative = self >= 0; | 151 | 263k | let mut n = if is_nonnegative { | 152 | 263k | self as $large_unsigned | 153 | 0 | } else { | 154 | 0 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 263k | let mut curr = buf.len(); | 158 | 263k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 263k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 263k | while n >= 10000 { | 163 | 0 | let rem = n % 10000; | 164 | 0 | n /= 10000; | 165 | | | 166 | 0 | let d1 = ((rem / 100) << 1) as usize; | 167 | 0 | let d2 = ((rem % 100) << 1) as usize; | 168 | 0 | curr -= 4; | 169 | 0 | unsafe { | 170 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 0 | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 0 | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 263k | if n >= 100 { | 177 | 251k | let d1 = ((n % 100) << 1) as usize; | 178 | 251k | n /= 100; | 179 | 251k | curr -= 2; | 180 | 251k | unsafe { | 181 | 251k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 251k | } | 183 | 11.9k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 263k | if n < 10 { | 187 | 253k | curr -= 1; | 188 | 253k | unsafe { | 189 | 253k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 253k | } | 191 | | } else { | 192 | 10.3k | let d1 = (n << 1) as usize; | 193 | 10.3k | curr -= 2; | 194 | 10.3k | unsafe { | 195 | 10.3k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 10.3k | } | 197 | | } | 198 | | | 199 | 263k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 263k | } | 205 | | | 206 | 263k | let len = buf.len() - curr; | 207 | 263k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 263k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 263k | } |
<u16 as itoa::private::Sealed>::write Line | Count | Source | 149 | 533k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 533k | let is_nonnegative = self >= 0; | 151 | 533k | let mut n = if is_nonnegative { | 152 | 533k | self as $large_unsigned | 153 | 0 | } else { | 154 | 0 | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 533k | let mut curr = buf.len(); | 158 | 533k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 533k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 1.05M | while n >= 10000 { | 163 | 522k | let rem = n % 10000; | 164 | 522k | n /= 10000; | 165 | | | 166 | 522k | let d1 = ((rem / 100) << 1) as usize; | 167 | 522k | let d2 = ((rem % 100) << 1) as usize; | 168 | 522k | curr -= 4; | 169 | 522k | unsafe { | 170 | 522k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 522k | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 522k | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 533k | if n >= 100 { | 177 | 10.9k | let d1 = ((n % 100) << 1) as usize; | 178 | 10.9k | n /= 100; | 179 | 10.9k | curr -= 2; | 180 | 10.9k | unsafe { | 181 | 10.9k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 10.9k | } | 183 | 523k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 533k | if n < 10 { | 187 | 528k | curr -= 1; | 188 | 528k | unsafe { | 189 | 528k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 528k | } | 191 | | } else { | 192 | 5.60k | let d1 = (n << 1) as usize; | 193 | 5.60k | curr -= 2; | 194 | 5.60k | unsafe { | 195 | 5.60k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 5.60k | } | 197 | | } | 198 | | | 199 | 533k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 533k | } | 205 | | | 206 | 533k | let len = buf.len() - curr; | 207 | 533k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 533k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 533k | } |
<u32 as itoa::private::Sealed>::write Line | Count | Source | 149 | 326k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 326k | let is_nonnegative = self >= 0; | 151 | 326k | let mut n = if is_nonnegative { | 152 | 326k | self as $large_unsigned | 153 | | } else { | 154 | | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 326k | let mut curr = buf.len(); | 158 | 326k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 326k | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 979k | while n >= 10000 { | 163 | 652k | let rem = n % 10000; | 164 | 652k | n /= 10000; | 165 | | | 166 | 652k | let d1 = ((rem / 100) << 1) as usize; | 167 | 652k | let d2 = ((rem % 100) << 1) as usize; | 168 | 652k | curr -= 4; | 169 | 652k | unsafe { | 170 | 652k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 652k | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 652k | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 326k | if n >= 100 { | 177 | 1.19k | let d1 = ((n % 100) << 1) as usize; | 178 | 1.19k | n /= 100; | 179 | 1.19k | curr -= 2; | 180 | 1.19k | unsafe { | 181 | 1.19k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 1.19k | } | 183 | 325k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 326k | if n < 10 { | 187 | 12.5k | curr -= 1; | 188 | 12.5k | unsafe { | 189 | 12.5k | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 12.5k | } | 191 | | } else { | 192 | 314k | let d1 = (n << 1) as usize; | 193 | 314k | curr -= 2; | 194 | 314k | unsafe { | 195 | 314k | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 314k | } | 197 | | } | 198 | | | 199 | 326k | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 326k | } | 205 | | | 206 | 326k | let len = buf.len() - curr; | 207 | 326k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 326k | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 326k | } |
<u64 as itoa::private::Sealed>::write Line | Count | Source | 149 | 3.06M | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 150 | 3.06M | let is_nonnegative = self >= 0; | 151 | 3.06M | let mut n = if is_nonnegative { | 152 | 3.06M | self as $large_unsigned | 153 | | } else { | 154 | | // Convert negative number to positive by summing 1 to its two's complement. | 155 | 0 | (!(self as $large_unsigned)).wrapping_add(1) | 156 | | }; | 157 | 3.06M | let mut curr = buf.len(); | 158 | 3.06M | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 159 | 3.06M | let lut_ptr = DEC_DIGITS_LUT.as_ptr(); | 160 | | | 161 | | // Render 4 digits at a time. | 162 | 15.3M | while n >= 10000 { | 163 | 12.2M | let rem = n % 10000; | 164 | 12.2M | n /= 10000; | 165 | | | 166 | 12.2M | let d1 = ((rem / 100) << 1) as usize; | 167 | 12.2M | let d2 = ((rem % 100) << 1) as usize; | 168 | 12.2M | curr -= 4; | 169 | 12.2M | unsafe { | 170 | 12.2M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 171 | 12.2M | ptr::copy_nonoverlapping(lut_ptr.add(d2), buf_ptr.add(curr + 2), 2); | 172 | 12.2M | } | 173 | | } | 174 | | | 175 | | // Render 2 more digits, if >2 digits. | 176 | 3.06M | if n >= 100 { | 177 | 2.84M | let d1 = ((n % 100) << 1) as usize; | 178 | 2.84M | n /= 100; | 179 | 2.84M | curr -= 2; | 180 | 2.84M | unsafe { | 181 | 2.84M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 182 | 2.84M | } | 183 | 218k | } | 184 | | | 185 | | // Render last 1 or 2 digits. | 186 | 3.06M | if n < 10 { | 187 | 1.64M | curr -= 1; | 188 | 1.64M | unsafe { | 189 | 1.64M | *buf_ptr.add(curr) = (n as u8) + b'0'; | 190 | 1.64M | } | 191 | | } else { | 192 | 1.42M | let d1 = (n << 1) as usize; | 193 | 1.42M | curr -= 2; | 194 | 1.42M | unsafe { | 195 | 1.42M | ptr::copy_nonoverlapping(lut_ptr.add(d1), buf_ptr.add(curr), 2); | 196 | 1.42M | } | 197 | | } | 198 | | | 199 | 3.06M | if !is_nonnegative { | 200 | 0 | curr -= 1; | 201 | 0 | unsafe { | 202 | 0 | *buf_ptr.add(curr) = b'-'; | 203 | 0 | } | 204 | 3.06M | } | 205 | | | 206 | 3.06M | let len = buf.len() - curr; | 207 | 3.06M | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 208 | 3.06M | unsafe { str::from_utf8_unchecked(bytes) } | 209 | 3.06M | } |
|
210 | | } |
211 | | }; |
212 | | } |
213 | | |
214 | | impl_Integer!(i8[len = 4] as u32); |
215 | | impl_Integer!(u8[len = 3] as u32); |
216 | | impl_Integer!(i16[len = 6] as u32); |
217 | | impl_Integer!(u16[len = 5] as u32); |
218 | | impl_Integer!(i32[len = 11] as u32); |
219 | | impl_Integer!(u32[len = 10] as u32); |
220 | | impl_Integer!(i64[len = 20] as u64); |
221 | | impl_Integer!(u64[len = 20] as u64); |
222 | | |
223 | | macro_rules! impl_Integer_size { |
224 | | ($t:ty as $primitive:ident #[cfg(target_pointer_width = $width:literal)]) => { |
225 | | #[cfg(target_pointer_width = $width)] |
226 | | impl Integer for $t { |
227 | | const MAX_STR_LEN: usize = <$primitive as Integer>::MAX_STR_LEN; |
228 | | } |
229 | | |
230 | | #[cfg(target_pointer_width = $width)] |
231 | | impl private::Sealed for $t { |
232 | | type Buffer = <$primitive as private::Sealed>::Buffer; |
233 | | |
234 | | #[inline] |
235 | | #[cfg_attr(feature = "no-panic", no_panic)] |
236 | | fn write(self, buf: &mut Self::Buffer) -> &str { |
237 | | (self as $primitive).write(buf) |
238 | | } |
239 | | } |
240 | | }; |
241 | | } |
242 | | |
243 | | impl_Integer_size!(isize as i16 #[cfg(target_pointer_width = "16")]); |
244 | | impl_Integer_size!(usize as u16 #[cfg(target_pointer_width = "16")]); |
245 | | impl_Integer_size!(isize as i32 #[cfg(target_pointer_width = "32")]); |
246 | | impl_Integer_size!(usize as u32 #[cfg(target_pointer_width = "32")]); |
247 | | impl_Integer_size!(isize as i64 #[cfg(target_pointer_width = "64")]); |
248 | | impl_Integer_size!(usize as u64 #[cfg(target_pointer_width = "64")]); |
249 | | |
250 | | macro_rules! impl_Integer128 { |
251 | | ($t:ty[len = $max_len:expr]) => { |
252 | | impl Integer for $t { |
253 | | const MAX_STR_LEN: usize = $max_len; |
254 | | } |
255 | | |
256 | | impl private::Sealed for $t { |
257 | | type Buffer = [MaybeUninit<u8>; $max_len]; |
258 | | |
259 | | #[allow(unused_comparisons)] |
260 | | #[inline] |
261 | | #[cfg_attr(feature = "no-panic", no_panic)] |
262 | 6.22k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { |
263 | 6.22k | let is_nonnegative = self >= 0; |
264 | 6.22k | let n = if is_nonnegative { |
265 | 3.11k | self as u128 |
266 | | } else { |
267 | | // Convert negative number to positive by summing 1 to its two's complement. |
268 | 106 | (!(self as u128)).wrapping_add(1) |
269 | | }; |
270 | 6.22k | let mut curr = buf.len(); |
271 | 6.22k | let buf_ptr = buf.as_mut_ptr() as *mut u8; |
272 | | |
273 | | // Divide by 10^19 which is the highest power less than 2^64. |
274 | 6.22k | let (n, rem) = udiv128::udivmod_1e19(n); |
275 | 6.22k | let buf1 = unsafe { |
276 | 6.22k | buf_ptr.add(curr - u64::MAX_STR_LEN) as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] |
277 | | }; |
278 | 6.22k | curr -= rem.write(unsafe { &mut *buf1 }).len(); |
279 | | |
280 | 6.22k | if n != 0 { |
281 | | // Memset the base10 leading zeros of rem. |
282 | 361 | let target = buf.len() - 19; |
283 | 361 | unsafe { |
284 | 361 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); |
285 | 361 | } |
286 | 361 | curr = target; |
287 | | |
288 | | // Divide by 10^19 again. |
289 | 361 | let (n, rem) = udiv128::udivmod_1e19(n); |
290 | 361 | let buf2 = unsafe { |
291 | 361 | buf_ptr.add(curr - u64::MAX_STR_LEN) |
292 | 361 | as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] |
293 | | }; |
294 | 361 | curr -= rem.write(unsafe { &mut *buf2 }).len(); |
295 | | |
296 | 361 | if n != 0 { |
297 | | // Memset the leading zeros. |
298 | 33 | let target = buf.len() - 38; |
299 | 33 | unsafe { |
300 | 33 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); |
301 | 33 | } |
302 | 33 | curr = target; |
303 | | |
304 | | // There is at most one digit left |
305 | | // because u128::MAX / 10^19 / 10^19 is 3. |
306 | 33 | curr -= 1; |
307 | 33 | unsafe { |
308 | 33 | *buf_ptr.add(curr) = (n as u8) + b'0'; |
309 | 33 | } |
310 | 328 | } |
311 | 5.85k | } |
312 | | |
313 | 6.22k | if !is_nonnegative { |
314 | 106 | curr -= 1; |
315 | 106 | unsafe { |
316 | 106 | *buf_ptr.add(curr) = b'-'; |
317 | 106 | } |
318 | 6.11k | } |
319 | | |
320 | 6.22k | let len = buf.len() - curr; |
321 | 6.22k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; |
322 | 6.22k | unsafe { str::from_utf8_unchecked(bytes) } |
323 | 6.22k | } <i128 as itoa::private::Sealed>::write Line | Count | Source | 262 | 3.10k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 263 | 3.10k | let is_nonnegative = self >= 0; | 264 | 3.10k | let n = if is_nonnegative { | 265 | 2.99k | self as u128 | 266 | | } else { | 267 | | // Convert negative number to positive by summing 1 to its two's complement. | 268 | 106 | (!(self as u128)).wrapping_add(1) | 269 | | }; | 270 | 3.10k | let mut curr = buf.len(); | 271 | 3.10k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 272 | | | 273 | | // Divide by 10^19 which is the highest power less than 2^64. | 274 | 3.10k | let (n, rem) = udiv128::udivmod_1e19(n); | 275 | 3.10k | let buf1 = unsafe { | 276 | 3.10k | buf_ptr.add(curr - u64::MAX_STR_LEN) as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] | 277 | | }; | 278 | 3.10k | curr -= rem.write(unsafe { &mut *buf1 }).len(); | 279 | | | 280 | 3.10k | if n != 0 { | 281 | | // Memset the base10 leading zeros of rem. | 282 | 214 | let target = buf.len() - 19; | 283 | 214 | unsafe { | 284 | 214 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); | 285 | 214 | } | 286 | 214 | curr = target; | 287 | | | 288 | | // Divide by 10^19 again. | 289 | 214 | let (n, rem) = udiv128::udivmod_1e19(n); | 290 | 214 | let buf2 = unsafe { | 291 | 214 | buf_ptr.add(curr - u64::MAX_STR_LEN) | 292 | 214 | as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] | 293 | | }; | 294 | 214 | curr -= rem.write(unsafe { &mut *buf2 }).len(); | 295 | | | 296 | 214 | if n != 0 { | 297 | | // Memset the leading zeros. | 298 | 11 | let target = buf.len() - 38; | 299 | 11 | unsafe { | 300 | 11 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); | 301 | 11 | } | 302 | 11 | curr = target; | 303 | | | 304 | | // There is at most one digit left | 305 | | // because u128::MAX / 10^19 / 10^19 is 3. | 306 | 11 | curr -= 1; | 307 | 11 | unsafe { | 308 | 11 | *buf_ptr.add(curr) = (n as u8) + b'0'; | 309 | 11 | } | 310 | 203 | } | 311 | 2.89k | } | 312 | | | 313 | 3.10k | if !is_nonnegative { | 314 | 106 | curr -= 1; | 315 | 106 | unsafe { | 316 | 106 | *buf_ptr.add(curr) = b'-'; | 317 | 106 | } | 318 | 2.99k | } | 319 | | | 320 | 3.10k | let len = buf.len() - curr; | 321 | 3.10k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 322 | 3.10k | unsafe { str::from_utf8_unchecked(bytes) } | 323 | 3.10k | } |
<u128 as itoa::private::Sealed>::write Line | Count | Source | 262 | 3.11k | fn write(self, buf: &mut [MaybeUninit<u8>; $max_len]) -> &str { | 263 | 3.11k | let is_nonnegative = self >= 0; | 264 | 3.11k | let n = if is_nonnegative { | 265 | 3.11k | self as u128 | 266 | | } else { | 267 | | // Convert negative number to positive by summing 1 to its two's complement. | 268 | 0 | (!(self as u128)).wrapping_add(1) | 269 | | }; | 270 | 3.11k | let mut curr = buf.len(); | 271 | 3.11k | let buf_ptr = buf.as_mut_ptr() as *mut u8; | 272 | | | 273 | | // Divide by 10^19 which is the highest power less than 2^64. | 274 | 3.11k | let (n, rem) = udiv128::udivmod_1e19(n); | 275 | 3.11k | let buf1 = unsafe { | 276 | 3.11k | buf_ptr.add(curr - u64::MAX_STR_LEN) as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] | 277 | | }; | 278 | 3.11k | curr -= rem.write(unsafe { &mut *buf1 }).len(); | 279 | | | 280 | 3.11k | if n != 0 { | 281 | | // Memset the base10 leading zeros of rem. | 282 | 147 | let target = buf.len() - 19; | 283 | 147 | unsafe { | 284 | 147 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); | 285 | 147 | } | 286 | 147 | curr = target; | 287 | | | 288 | | // Divide by 10^19 again. | 289 | 147 | let (n, rem) = udiv128::udivmod_1e19(n); | 290 | 147 | let buf2 = unsafe { | 291 | 147 | buf_ptr.add(curr - u64::MAX_STR_LEN) | 292 | 147 | as *mut [MaybeUninit<u8>; u64::MAX_STR_LEN] | 293 | | }; | 294 | 147 | curr -= rem.write(unsafe { &mut *buf2 }).len(); | 295 | | | 296 | 147 | if n != 0 { | 297 | | // Memset the leading zeros. | 298 | 22 | let target = buf.len() - 38; | 299 | 22 | unsafe { | 300 | 22 | ptr::write_bytes(buf_ptr.add(target), b'0', curr - target); | 301 | 22 | } | 302 | 22 | curr = target; | 303 | | | 304 | | // There is at most one digit left | 305 | | // because u128::MAX / 10^19 / 10^19 is 3. | 306 | 22 | curr -= 1; | 307 | 22 | unsafe { | 308 | 22 | *buf_ptr.add(curr) = (n as u8) + b'0'; | 309 | 22 | } | 310 | 125 | } | 311 | 2.96k | } | 312 | | | 313 | 3.11k | if !is_nonnegative { | 314 | 0 | curr -= 1; | 315 | 0 | unsafe { | 316 | 0 | *buf_ptr.add(curr) = b'-'; | 317 | 0 | } | 318 | 3.11k | } | 319 | | | 320 | 3.11k | let len = buf.len() - curr; | 321 | 3.11k | let bytes = unsafe { slice::from_raw_parts(buf_ptr.add(curr), len) }; | 322 | 3.11k | unsafe { str::from_utf8_unchecked(bytes) } | 323 | 3.11k | } |
|
324 | | } |
325 | | }; |
326 | | } |
327 | | |
328 | | impl_Integer128!(i128[len = 40]); |
329 | | impl_Integer128!(u128[len = 39]); |