--- /dev/null
+{
+ "git": {
+ "sha1": "87082b92398cf8b20ded44a6669b3d0dc51a0b44"
+ },
+ "path_in_vcs": "macros"
+}
\ No newline at end of file
--- /dev/null
+The Uuid Project is copyright 2021, The Uuid Developers.
+
+Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+http://www.apache.org/licenses/LICENSE-2.0> or the MIT License <LICENSE-MIT or
+http://opensource.org/licenses/MIT>, at your option. All files in the project
+carrying such notice may not be copied, modified, or distributed except
+according to those terms.
--- /dev/null
+# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
+#
+# When uploading crates to the registry Cargo will automatically
+# "normalize" Cargo.toml files for maximal compatibility
+# with all versions of Cargo and also rewrite `path` dependencies
+# to registry (e.g., crates.io) dependencies.
+#
+# If you are reading this file be aware that the original Cargo.toml
+# will likely look very different (and much more reasonable).
+# See Cargo.toml.orig for the original contents.
+
+[package]
+edition = "2018"
+name = "uuid-macro-internal"
+version = "1.3.1"
+authors = ["QnnOkabayashi"]
+description = "Private implementation details of the uuid! macro."
+documentation = "https://docs.rs/uuid"
+categories = [
+ "data-structures",
+ "no-std",
+ "parser-implementations",
+ "wasm",
+]
+license = "Apache-2.0 OR MIT"
+
+[lib]
+proc-macro = true
+
+[dependencies.proc-macro2]
+version = "1.0.29"
+features = ["span-locations"]
+
+[dependencies.quote]
+version = "1.0.10"
+
+[dependencies.syn]
+version = "2.0.5"
--- /dev/null
+[package]
+name = "uuid-macro-internal"
+version = "1.3.1"
+edition = "2018"
+authors = [
+ "QnnOkabayashi"
+]
+categories = [
+ "data-structures",
+ "no-std",
+ "parser-implementations",
+ "wasm"
+]
+description = "Private implementation details of the uuid! macro."
+documentation = "https://docs.rs/uuid"
+license = "Apache-2.0 OR MIT"
+
+[lib]
+proc-macro = true
+
+[dependencies.syn]
+version = "2.0.5"
+
+[dependencies.quote]
+version = "1.0.10"
+
+[dependencies.proc-macro2]
+version = "1.0.29"
+features = ["span-locations"]
--- /dev/null
+ Apache License
+ Version 2.0, January 2004
+ http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+ "License" shall mean the terms and conditions for use, reproduction,
+ and distribution as defined by Sections 1 through 9 of this document.
+
+ "Licensor" shall mean the copyright owner or entity authorized by
+ the copyright owner that is granting the License.
+
+ "Legal Entity" shall mean the union of the acting entity and all
+ other entities that control, are controlled by, or are under common
+ control with that entity. For the purposes of this definition,
+ "control" means (i) the power, direct or indirect, to cause the
+ direction or management of such entity, whether by contract or
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ outstanding shares, or (iii) beneficial ownership of such entity.
+
+ "You" (or "Your") shall mean an individual or Legal Entity
+ exercising permissions granted by this License.
+
+ "Source" form shall mean the preferred form for making modifications,
+ including but not limited to software source code, documentation
+ source, and configuration files.
+
+ "Object" form shall mean any form resulting from mechanical
+ transformation or translation of a Source form, including but
+ not limited to compiled object code, generated documentation,
+ and conversions to other media types.
+
+ "Work" shall mean the work of authorship, whether in Source or
+ Object form, made available under the License, as indicated by a
+ copyright notice that is included in or attached to the work
+ (an example is provided in the Appendix below).
+
+ "Derivative Works" shall mean any work, whether in Source or Object
+ form, that is based on (or derived from) the Work and for which the
+ editorial revisions, annotations, elaborations, or other modifications
+ represent, as a whole, an original work of authorship. For the purposes
+ of this License, Derivative Works shall not include works that remain
+ separable from, or merely link (or bind by name) to the interfaces of,
+ the Work and Derivative Works thereof.
+
+ "Contribution" shall mean any work of authorship, including
+ the original version of the Work and any modifications or additions
+ to that Work or Derivative Works thereof, that is intentionally
+ submitted to Licensor for inclusion in the Work by the copyright owner
+ or by an individual or Legal Entity authorized to submit on behalf of
+ the copyright owner. For the purposes of this definition, "submitted"
+ means any form of electronic, verbal, or written communication sent
+ to the Licensor or its representatives, including but not limited to
+ communication on electronic mailing lists, source code control systems,
+ and issue tracking systems that are managed by, or on behalf of, the
+ Licensor for the purpose of discussing and improving the Work, but
+ excluding communication that is conspicuously marked or otherwise
+ designated in writing by the copyright owner as "Not a Contribution."
+
+ "Contributor" shall mean Licensor and any individual or Legal Entity
+ on behalf of whom a Contribution has been received by Licensor and
+ subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ copyright license to reproduce, prepare Derivative Works of,
+ publicly display, publicly perform, sublicense, and distribute the
+ Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ (except as stated in this section) patent license to make, have made,
+ use, offer to sell, sell, import, and otherwise transfer the Work,
+ where such license applies only to those patent claims licensable
+ by such Contributor that are necessarily infringed by their
+ Contribution(s) alone or by combination of their Contribution(s)
+ with the Work to which such Contribution(s) was submitted. If You
+ institute patent litigation against any entity (including a
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
+ or a Contribution incorporated within the Work constitutes direct
+ or contributory patent infringement, then any patent licenses
+ granted to You under this License for that Work shall terminate
+ as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+ Work or Derivative Works thereof in any medium, with or without
+ modifications, and in Source or Object form, provided that You
+ meet the following conditions:
+
+ (a) You must give any other recipients of the Work or
+ Derivative Works a copy of this License; and
+
+ (b) You must cause any modified files to carry prominent notices
+ stating that You changed the files; and
+
+ (c) You must retain, in the Source form of any Derivative Works
+ that You distribute, all copyright, patent, trademark, and
+ attribution notices from the Source form of the Work,
+ excluding those notices that do not pertain to any part of
+ the Derivative Works; and
+
+ (d) If the Work includes a "NOTICE" text file as part of its
+ distribution, then any Derivative Works that You distribute must
+ include a readable copy of the attribution notices contained
+ within such NOTICE file, excluding those notices that do not
+ pertain to any part of the Derivative Works, in at least one
+ of the following places: within a NOTICE text file distributed
+ as part of the Derivative Works; within the Source form or
+ documentation, if provided along with the Derivative Works; or,
+ within a display generated by the Derivative Works, if and
+ wherever such third-party notices normally appear. The contents
+ of the NOTICE file are for informational purposes only and
+ do not modify the License. You may add Your own attribution
+ notices within Derivative Works that You distribute, alongside
+ or as an addendum to the NOTICE text from the Work, provided
+ that such additional attribution notices cannot be construed
+ as modifying the License.
+
+ You may add Your own copyright statement to Your modifications and
+ may provide additional or different license terms and conditions
+ for use, reproduction, or distribution of Your modifications, or
+ for any such Derivative Works as a whole, provided Your use,
+ reproduction, and distribution of the Work otherwise complies with
+ the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+ any Contribution intentionally submitted for inclusion in the Work
+ by You to the Licensor shall be under the terms and conditions of
+ this License, without any additional terms or conditions.
+ Notwithstanding the above, nothing herein shall supersede or modify
+ the terms of any separate license agreement you may have executed
+ with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+ names, trademarks, service marks, or product names of the Licensor,
+ except as required for reasonable and customary use in describing the
+ origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+ agreed to in writing, Licensor provides the Work (and each
+ Contributor provides its Contributions) on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ implied, including, without limitation, any warranties or conditions
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ PARTICULAR PURPOSE. You are solely responsible for determining the
+ appropriateness of using or redistributing the Work and assume any
+ risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+ whether in tort (including negligence), contract, or otherwise,
+ unless required by applicable law (such as deliberate and grossly
+ negligent acts) or agreed to in writing, shall any Contributor be
+ liable to You for damages, including any direct, indirect, special,
+ incidental, or consequential damages of any character arising as a
+ result of this License or out of the use or inability to use the
+ Work (including but not limited to damages for loss of goodwill,
+ work stoppage, computer failure or malfunction, or any and all
+ other commercial damages or losses), even if such Contributor
+ has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+ the Work or Derivative Works thereof, You may choose to offer,
+ and charge a fee for, acceptance of support, warranty, indemnity,
+ or other liability obligations and/or rights consistent with this
+ License. However, in accepting such obligations, You may act only
+ on Your own behalf and on Your sole responsibility, not on behalf
+ of any other Contributor, and only if You agree to indemnify,
+ defend, and hold each Contributor harmless for any liability
+ incurred by, or claims asserted against, such Contributor by reason
+ of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+ To apply the Apache License to your work, attach the following
+ boilerplate notice, with the fields enclosed by brackets "[]"
+ replaced with your own identifying information. (Don't include
+ the brackets!) The text should be enclosed in the appropriate
+ comment syntax for the file format. We also recommend that a
+ file or class name and description of purpose be included on the
+ same "printed page" as the copyright notice for easier
+ identification within third-party archives.
+
+Copyright [yyyy] [name of copyright owner]
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
--- /dev/null
+Copyright (c) 2021 The Uuid Developers
+
+Permission is hereby granted, free of charge, to any
+person obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without
+limitation the rights to use, copy, modify, merge,
+publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software
+is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice
+shall be included in all copies or substantial portions
+of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
+SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
--- /dev/null
+use std::fmt;
+
+/// A general error that can occur when working with UUIDs.
+#[derive(Clone, Debug, Eq, Hash, PartialEq)]
+pub struct Error(pub(crate) ErrorKind);
+
+#[derive(Clone, Debug, Eq, Hash, PartialEq)]
+pub(crate) enum ErrorKind {
+ /// Invalid character in the [`Uuid`] string.
+ ///
+ /// [`Uuid`]: ../struct.Uuid.html
+ Char { character: char, index: usize },
+ /// A simple [`Uuid`] didn't contain 32 characters.
+ ///
+ /// [`Uuid`]: ../struct.Uuid.html
+ SimpleLength { len: usize },
+ /// A hyphenated [`Uuid`] didn't contain 5 groups
+ ///
+ /// [`Uuid`]: ../struct.Uuid.html
+ GroupCount { count: usize },
+ /// A hyphenated [`Uuid`] had a group that wasn't the right length
+ ///
+ /// [`Uuid`]: ../struct.Uuid.html
+ GroupLength {
+ group: usize,
+ len: usize,
+ index: usize,
+ },
+}
+
+/// A string that is guaranteed to fail to parse to a [`Uuid`].
+///
+/// This type acts as a lightweight error indicator, suggesting
+/// that the string cannot be parsed but offering no error
+/// details. To get details, use `InvalidUuid::into_err`.
+///
+/// [`Uuid`]: ../struct.Uuid.html
+#[derive(Clone, Debug, Eq, Hash, PartialEq)]
+pub struct InvalidUuid<'a>(pub(crate) &'a str);
+
+impl<'a> InvalidUuid<'a> {
+ /// Converts the lightweight error type into detailed diagnostics.
+ pub fn into_err(self) -> Error {
+ let (s, offset, simple) = match self.0.as_bytes() {
+ [b'{', s @ .., b'}'] => (s, 1, false),
+ [b'u', b'r', b'n', b':', b'u', b'u', b'i', b'd', b':', s @ ..] => {
+ (s, "urn:uuid:".len(), false)
+ }
+ s => (s, 0, true),
+ };
+
+ let mut hyphen_count = 0;
+ let mut group_bounds = [0; 4];
+
+ // SAFETY: the byte array came from a valid utf8 string,
+ // and is aligned along char boundries.
+ let string = unsafe { std::str::from_utf8_unchecked(s) };
+
+ for (index, character) in string.char_indices() {
+ let byte = character as u8;
+ if character as u32 - byte as u32 > 0 {
+ // Multibyte char
+ return Error(ErrorKind::Char {
+ character,
+ index: index + offset + 1,
+ });
+ } else if byte == b'-' {
+ // While we search, also count group breaks
+ if hyphen_count < 4 {
+ group_bounds[hyphen_count] = index;
+ }
+ hyphen_count += 1;
+ } else if !matches!(byte, b'0'..=b'9' | b'a'..=b'f' | b'A'..=b'F') {
+ // Non-hex char
+ return Error(ErrorKind::Char {
+ character: byte as char,
+ index: index + offset + 1,
+ });
+ }
+ }
+
+ if hyphen_count == 0 && simple {
+ // This means that we tried and failed to parse a simple uuid.
+ // Since we verified that all the characters are valid, this means
+ // that it MUST have an invalid length.
+ Error(ErrorKind::SimpleLength { len: s.len() })
+ } else if hyphen_count != 4 {
+ // We tried to parse a hyphenated variant, but there weren't
+ // 5 groups (4 hyphen splits).
+ Error(ErrorKind::GroupCount {
+ count: hyphen_count + 1,
+ })
+ } else {
+ // There are 5 groups, one of them has an incorrect length
+ const BLOCK_STARTS: [usize; 5] = [0, 9, 14, 19, 24];
+ for i in 0..4 {
+ if group_bounds[i] != BLOCK_STARTS[i + 1] - 1 {
+ return Error(ErrorKind::GroupLength {
+ group: i,
+ len: group_bounds[i] - BLOCK_STARTS[i],
+ index: offset + BLOCK_STARTS[i] + 1,
+ });
+ }
+ }
+
+ // The last group must be too long
+ Error(ErrorKind::GroupLength {
+ group: 4,
+ len: s.len() - BLOCK_STARTS[4],
+ index: offset + BLOCK_STARTS[4] + 1,
+ })
+ }
+ }
+}
+
+impl fmt::Display for Error {
+ fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+ match self.0 {
+ ErrorKind::Char {
+ character, index, ..
+ } => {
+ write!(f, "invalid character: expected an optional prefix of `urn:uuid:` followed by [0-9a-zA-Z], found `{}` at {}", character, index)
+ }
+ ErrorKind::SimpleLength { len } => {
+ write!(
+ f,
+ "invalid length: expected length 32 for simple format, found {}",
+ len
+ )
+ }
+ ErrorKind::GroupCount { count } => {
+ write!(f, "invalid group count: expected 5, found {}", count)
+ }
+ ErrorKind::GroupLength { group, len, .. } => {
+ let expected = [8, 4, 4, 4, 12][group];
+ write!(
+ f,
+ "invalid group length in group {}: expected {}, found {}",
+ group, expected, len
+ )
+ }
+ }
+ }
+}
--- /dev/null
+//! Implementation details for the `uuid!` macro.
+//!
+//! This crate is not meant to be used directly. Instead,
+//! you can use the `macro-diagnostics` feature of `uuid`:
+//!
+//! ```toml
+//! [dependencies.uuid]
+//! features = ["macro-diagnostics"]
+//! ```
+
+use proc_macro::TokenStream;
+use proc_macro2::TokenStream as TokenStream2;
+use quote::{quote, quote_spanned};
+use std::fmt;
+use syn::{spanned::Spanned, LitStr};
+
+mod error;
+mod parser;
+
+#[proc_macro]
+#[doc(hidden)]
+pub fn parse_lit(input: TokenStream) -> TokenStream {
+ build_uuid(input.clone()).unwrap_or_else(|e| {
+ let msg = e.to_string();
+ let span = match e {
+ Error::UuidParse(lit, error::Error(error::ErrorKind::Char { character, index })) => {
+ let mut bytes = character as u32;
+ let mut width = 0;
+ while bytes != 0 {
+ bytes >>= 4;
+ width += 1;
+ }
+ let mut s = proc_macro2::Literal::string("");
+ s.set_span(lit.span());
+ s.subspan(index..index + width - 1)
+ }
+ Error::UuidParse(
+ lit,
+ error::Error(error::ErrorKind::GroupLength { index, len, .. }),
+ ) => {
+ let mut s = proc_macro2::Literal::string("");
+ s.set_span(lit.span());
+ s.subspan(index..index + len)
+ }
+ _ => None,
+ }
+ .unwrap_or_else(|| TokenStream2::from(input).span());
+
+ TokenStream::from(quote_spanned! {span=>
+ compile_error!(#msg)
+ })
+ })
+}
+
+enum Error {
+ NonStringLiteral,
+ UuidParse(LitStr, error::Error),
+}
+
+impl fmt::Display for Error {
+ fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+ match *self {
+ Error::NonStringLiteral => f.write_str("expected string literal"),
+ Error::UuidParse(_, ref e) => write!(f, "{}", e),
+ }
+ }
+}
+
+fn build_uuid(input: TokenStream) -> Result<TokenStream, Error> {
+ let str_lit = match syn::parse::<syn::Lit>(input) {
+ Ok(syn::Lit::Str(literal)) => literal,
+ _ => return Err(Error::NonStringLiteral),
+ };
+
+ let bytes =
+ parser::try_parse(&str_lit.value()).map_err(|e| Error::UuidParse(str_lit, e.into_err()))?;
+
+ let tokens = bytes
+ .iter()
+ .map(|byte| quote! { #byte, })
+ .collect::<TokenStream2>();
+
+ Ok(quote! {[#tokens]}.into())
+}
--- /dev/null
+// Copyright 2013-2014 The Rust Project Developers.
+// Copyright 2018 The Uuid Project Developers.
+//
+// See the COPYRIGHT file at the top-level directory of this distribution.
+//
+// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// option. This file may not be copied, modified, or distributed
+// except according to those terms.
+
+use crate::error::InvalidUuid;
+
+#[inline]
+pub const fn try_parse(input: &str) -> Result<[u8; 16], InvalidUuid> {
+ let result = match (input.len(), input.as_bytes()) {
+ // Inputs of 32 bytes must be a non-hyphenated UUID
+ (32, s) => parse_simple(s),
+ // Hyphenated UUIDs may be wrapped in various ways:
+ // - `{UUID}` for braced UUIDs
+ // - `urn:uuid:UUID` for URNs
+ // - `UUID` for a regular hyphenated UUID
+ (36, s)
+ | (38, [b'{', s @ .., b'}'])
+ | (45, [b'u', b'r', b'n', b':', b'u', b'u', b'i', b'd', b':', s @ ..]) => {
+ parse_hyphenated(s)
+ }
+ // Any other shaped input is immediately invalid
+ _ => Err(()),
+ };
+
+ match result {
+ Ok(b) => Ok(b),
+ Err(()) => Err(InvalidUuid(input)),
+ }
+}
+
+#[inline]
+const fn parse_simple(s: &[u8]) -> Result<[u8; 16], ()> {
+ // This length check here removes all other bounds
+ // checks in this function
+ if s.len() != 32 {
+ return Err(());
+ }
+
+ let mut buf: [u8; 16] = [0; 16];
+ let mut i = 0;
+
+ while i < 16 {
+ // Convert a two-char hex value (like `A8`)
+ // into a byte (like `10101000`)
+ let h1 = HEX_TABLE[s[i * 2] as usize];
+ let h2 = HEX_TABLE[s[i * 2 + 1] as usize];
+
+ // We use `0xff` as a sentinel value to indicate
+ // an invalid hex character sequence (like the letter `G`)
+ if h1 | h2 == 0xff {
+ return Err(());
+ }
+
+ // The upper nibble needs to be shifted into position
+ // to produce the final byte value
+ buf[i] = SHL4_TABLE[h1 as usize] | h2;
+ i += 1;
+ }
+
+ Ok(buf)
+}
+
+#[inline]
+const fn parse_hyphenated(s: &[u8]) -> Result<[u8; 16], ()> {
+ // This length check here removes all other bounds
+ // checks in this function
+ if s.len() != 36 {
+ return Err(());
+ }
+
+ // We look at two hex-encoded values (4 chars) at a time because
+ // that's the size of the smallest group in a hyphenated UUID.
+ // The indexes we're interested in are:
+ //
+ // uuid : 936da01f-9abd-4d9d-80c7-02af85c822a8
+ // | | || || || || | |
+ // hyphens : | | 8| 13| 18| 23| | |
+ // positions: 0 4 9 14 19 24 28 32
+
+ // First, ensure the hyphens appear in the right places
+ match [s[8], s[13], s[18], s[23]] {
+ [b'-', b'-', b'-', b'-'] => {}
+ _ => return Err(()),
+ }
+
+ let positions: [u8; 8] = [0, 4, 9, 14, 19, 24, 28, 32];
+ let mut buf: [u8; 16] = [0; 16];
+ let mut j = 0;
+
+ while j < 8 {
+ let i = positions[j];
+
+ // The decoding here is the same as the simple case
+ // We're just dealing with two values instead of one
+ let h1 = HEX_TABLE[s[i as usize] as usize];
+ let h2 = HEX_TABLE[s[(i + 1) as usize] as usize];
+ let h3 = HEX_TABLE[s[(i + 2) as usize] as usize];
+ let h4 = HEX_TABLE[s[(i + 3) as usize] as usize];
+
+ if h1 | h2 | h3 | h4 == 0xff {
+ return Err(());
+ }
+
+ buf[j * 2] = SHL4_TABLE[h1 as usize] | h2;
+ buf[j * 2 + 1] = SHL4_TABLE[h3 as usize] | h4;
+ j += 1;
+ }
+
+ Ok(buf)
+}
+
+const HEX_TABLE: &[u8; 256] = &{
+ let mut buf = [0; 256];
+ let mut i: u8 = 0;
+
+ loop {
+ buf[i as usize] = match i {
+ b'0'..=b'9' => i - b'0',
+ b'a'..=b'f' => i - b'a' + 10,
+ b'A'..=b'F' => i - b'A' + 10,
+ _ => 0xff,
+ };
+
+ if i == 255 {
+ break buf;
+ }
+
+ i += 1
+ }
+};
+
+const SHL4_TABLE: &[u8; 256] = &{
+ let mut buf = [0; 256];
+ let mut i: u8 = 0;
+
+ loop {
+ buf[i as usize] = i.wrapping_shl(4);
+
+ if i == 255 {
+ break buf;
+ }
+
+ i += 1;
+ }
+};
projects / platform / upstream / rust-uuid-macro-internal.git / commitdiff