From 066b806313e6918b91bc3fca761cdb402baabd7c Mon Sep 17 00:00:00 2001 From: muit Date: Wed, 7 Aug 2024 22:44:26 +0200 Subject: [PATCH] Fixes for Unreal Engine, removed TChar --- Include/Pipe/Core/Backward.h | 14 +- Include/Pipe/Core/Char.h | 9 +- Include/Pipe/Core/FixedString.h | 8 +- Include/Pipe/Core/GenericPlatform.h | 4 - Include/Pipe/Core/Guid.h | 2 +- Include/Pipe/Core/Hash.h | 4 +- Include/Pipe/Core/LinuxPlatform.h | 1 - Include/Pipe/Core/MacPlatform.h | 1 - Include/Pipe/Core/Platform.h | 2 - Include/Pipe/Core/String.h | 14 +- Include/Pipe/Core/StringView.h | 60 +- Include/Pipe/Core/Tag.h | 8 +- Include/Pipe/Core/WindowsPlatformMisc.h | 2 +- Include/Pipe/Extern/fast_float.h | 7914 +++++++++++-------- Include/Pipe/Extern/portable-file-dialogs.h | 3682 ++++----- Include/Pipe/Files/Paths.h | 60 +- Include/Pipe/Memory/BigBestFitArena.h | 2 +- Include/Pipe/Memory/MemoryStats.h | 4 +- Include/Pipe/Memory/MultiLinearArena.h | 2 +- Include/Pipe/Memory/OwnPtr.h | 87 +- Include/PipeECS.h | 2 +- Include/PipeReflect.h | 56 +- Include/PipeSerialize.h | 4 +- Include/PipeTime.h | 10 +- Src/Core/Hash.cpp | 28 +- Src/Core/String.cpp | 16 +- Src/Core/Subprocess.cpp | 25 +- Src/Core/Tag.cpp | 16 +- Src/Core/WindowsPlatformMisc.cpp | 6 +- Src/Files/Files.cpp | 4 +- Src/Files/Paths.cpp | 146 +- Src/Files/PlatformPaths.cpp | 4 +- Src/Memory/MemoryStats.cpp | 17 +- Src/Memory/OwnPtr.cpp | 4 +- Src/Pipe.cpp | 5 +- Src/PipeECS.cpp | 4 +- Src/PipeSerialize.cpp | 18 +- Src/PipeTime.cpp | 18 +- Src/PipeVectors.cpp | 8 - Tests/Reflection/TypeName.spec.cpp | 3 +- 40 files changed, 6739 insertions(+), 5535 deletions(-) diff --git a/Include/Pipe/Core/Backward.h b/Include/Pipe/Core/Backward.h index ab076b20..e37b48ba 100644 --- a/Include/Pipe/Core/Backward.h +++ b/Include/Pipe/Core/Backward.h @@ -383,7 +383,7 @@ typedef int ssize_t; // TODO maybe these should be undefined somewhere else? #undef BACKWARD_HAS_UNWIND #undef BACKWARD_HAS_BACKTRACE -#if BACKWARD_HAS_PDB_SYMBOL == 1 +#if defined(BACKWARD_HAS_PDB_SYMBOL) && BACKWARD_HAS_PDB_SYMBOL == 1 #else #undef BACKWARD_HAS_PDB_SYMBOL #define BACKWARD_HAS_PDB_SYMBOL 1 @@ -391,7 +391,7 @@ typedef int ssize_t; #endif -#if BACKWARD_HAS_UNWIND == 1 +#if defined(BACKWARD_HAS_UNWIND) && BACKWARD_HAS_UNWIND == 1 #include // while gcc's unwind.h defines something like that: @@ -415,7 +415,7 @@ extern "C" uintptr_t _Unwind_GetIPInfo(_Unwind_Context *, int *); #endif // BACKWARD_HAS_UNWIND == 1 -#if BACKWARD_HAS_LIBUNWIND == 1 +#if defined(BACKWARD_HAS_LIBUNWIND) && BACKWARD_HAS_LIBUNWIND == 1 #define UNW_LOCAL_ONLY #include #endif // BACKWARD_HAS_LIBUNWIND == 1 @@ -812,7 +812,7 @@ class StackTraceImplHolder : public StackTraceImplBase { std::vector> _stacktrace; }; -#if BACKWARD_HAS_UNWIND == 1 +#if defined(BACKWARD_HAS_UNWIND) && BACKWARD_HAS_UNWIND == 1 namespace details { @@ -914,7 +914,7 @@ class StackTraceImpl : public StackTraceImplHolder { }; }; -#elif BACKWARD_HAS_LIBUNWIND == 1 +#elif defined(BACKWARD_HAS_LIBUNWIND) && BACKWARD_HAS_LIBUNWIND == 1 template <> class StackTraceImpl : public StackTraceImplHolder { @@ -1223,7 +1223,7 @@ class StackTraceImpl : public StackTraceImplHolder { } } - Super::_stacktrace.resize(std::min(Super::_stacktrace.size(), Super::skip_n_firsts() + depth)); + //Super::_stacktrace.resize(std::min(Super::_stacktrace.size(), Super::skip_n_firsts() + depth)); return Super::size(); } @@ -3763,7 +3763,7 @@ class SourceFile { // but look, I will reuse it two times! // What a good boy am I. struct isspace { - bool operator()(char c) { return std::isspace(c); } + bool operator()(char c) { return bool(std::isspace(c)); } }; bool started = false; diff --git a/Include/Pipe/Core/Char.h b/Include/Pipe/Core/Char.h index ca05fe0e..3187f5c5 100644 --- a/Include/Pipe/Core/Char.h +++ b/Include/Pipe/Core/Char.h @@ -45,12 +45,13 @@ namespace p } }; -#define LITERAL(CharType, StringLiteral) TLiteral::Select(StringLiteral, L##StringLiteral) +#define P_LITERAL(CharType, StringLiteral) \ + TLiteral::Select(StringLiteral, L##StringLiteral) /** * TChar * Set of utility functions operating on a single character. The functions - * are specialized for AnsiChar and TChar character types. You can use the + * are specialized for AnsiChar and char character types. You can use the * typedefs FChar and FCharAnsi for convenience. */ @@ -152,7 +153,7 @@ namespace p } static inline bool IsUnderscore(CharType c) { - return c == LITERAL(CharType, '_'); + return c == P_LITERAL(CharType, '_'); } static inline bool IsLinebreak(CharType c) @@ -163,7 +164,7 @@ namespace p static inline i32 StrtoI32(const CharType* str, CharType** end, i32 radix); }; - using FChar = TCharHelpers; + using FChar = TCharHelpers; using FCharWide = TCharHelpers; using FCharAnsi = TCharHelpers; diff --git a/Include/Pipe/Core/FixedString.h b/Include/Pipe/Core/FixedString.h index ebdb4cdc..daebc0b2 100644 --- a/Include/Pipe/Core/FixedString.h +++ b/Include/Pipe/Core/FixedString.h @@ -49,7 +49,7 @@ namespace p } // namespace Details - template> + template> struct TFixedString { // exposition only @@ -696,14 +696,14 @@ namespace p #endif // CPP20_SPACESHIP_OPERATOR_PRESENT - template + template TFixedString(const CharType (&)[N]) -> TFixedString; template - using FixedString = TFixedString; + using FixedString = TFixedString; // template - // FixedString(const TChar (&)[N]) -> FixedString; + // FixedString(const char (&)[N]) -> FixedString; template diff --git a/Include/Pipe/Core/GenericPlatform.h b/Include/Pipe/Core/GenericPlatform.h index 8e4e4461..239cd0ff 100644 --- a/Include/Pipe/Core/GenericPlatform.h +++ b/Include/Pipe/Core/GenericPlatform.h @@ -60,10 +60,6 @@ namespace p // compilers which don't fully support C++11 yet (i.e. MSVC). using Char32 = unsigned int; - // A switchable character - In-memory only. - // Either AnsiChar or WideChar - using TChar = AnsiChar; - // unsigned int the same size as a pointer using uPtr = SelectIntPointerType::TIntPointer; diff --git a/Include/Pipe/Core/Guid.h b/Include/Pipe/Core/Guid.h index f791acab..46660154 100644 --- a/Include/Pipe/Core/Guid.h +++ b/Include/Pipe/Core/Guid.h @@ -194,7 +194,7 @@ namespace p return Value.ToString(); } - friend void LexFromString(Guid& Result, const TChar* String) + friend void LexFromString(Guid& Result, const char* String) { Guid::Parse(String, Result); } diff --git a/Include/Pipe/Core/Hash.h b/Include/Pipe/Core/Hash.h index 17e16074..7b426714 100644 --- a/Include/Pipe/Core/Hash.h +++ b/Include/Pipe/Core/Hash.h @@ -17,7 +17,7 @@ namespace p // FNV String hash // Use offset and prime based on the architecture (64bit or 32bit) // http://www.isthe.com/chongo/tech/comp/fnv/index.html - template + template inline PIPE_API constexpr sizet GetStringHash(const CharType* str) { // 32/64 bit architecture switch @@ -41,7 +41,7 @@ namespace p } } - template + template inline PIPE_API constexpr sizet GetStringHash(const CharType* str, sizet size) { // 32/64 bit architecture switch diff --git a/Include/Pipe/Core/LinuxPlatform.h b/Include/Pipe/Core/LinuxPlatform.h index a2953f5b..1986f59c 100644 --- a/Include/Pipe/Core/LinuxPlatform.h +++ b/Include/Pipe/Core/LinuxPlatform.h @@ -18,7 +18,6 @@ namespace p using TYPE_OF_NULL = decltype(__null); #if P_PLATFORM_LINUX_USE_CHAR16 using WideChar = char16_t; - using TChar = WideChar; #endif }; diff --git a/Include/Pipe/Core/MacPlatform.h b/Include/Pipe/Core/MacPlatform.h index 34a4ab6c..3d8bb611 100644 --- a/Include/Pipe/Core/MacPlatform.h +++ b/Include/Pipe/Core/MacPlatform.h @@ -21,7 +21,6 @@ namespace p using TYPE_OF_NULL = decltype(nullptr); #if P_PLATFORM_MACOS_USE_CHAR16 using WideChar = char16_t; - using TChar = WideChar; #else using Char16 = char16_t; #endif diff --git a/Include/Pipe/Core/Platform.h b/Include/Pipe/Core/Platform.h index f0cabc55..e95a72d6 100644 --- a/Include/Pipe/Core/Platform.h +++ b/Include/Pipe/Core/Platform.h @@ -92,8 +92,6 @@ namespace p using AnsiChar = PlatformTypes::AnsiChar; // A wide character. Normally a signed type. using WideChar = PlatformTypes::WideChar; - // Either AnsiChar or WideChar, depending on whether the platform supports wide characters - using TChar = PlatformTypes::TChar; // An 8-bit character containing a UTF8 (Unicode, 8-bit, variable-width) code unit. using Char8 = PlatformTypes::Char8; // A 16-bit character containing a UTF16 (Unicode, 16-bit, variable-width) code unit. diff --git a/Include/Pipe/Core/String.h b/Include/Pipe/Core/String.h index 9c2bedc5..01666852 100644 --- a/Include/Pipe/Core/String.h +++ b/Include/Pipe/Core/String.h @@ -24,11 +24,11 @@ namespace p template using TString = std::basic_string, std::allocator>; - using String = TString; + using String = TString; using WString = TString; template - using FormatString = std::basic_format_string; + using FormatString = std::basic_format_string; namespace Strings { @@ -88,20 +88,20 @@ namespace p * @return The number of elements in InArray */ PIPE_API i32 ParseIntoArray(const String& str, TArray& OutArray, - const TChar* pchDelim, bool InCullEmpty = true); + const char* pchDelim, bool InCullEmpty = true); PIPE_API void RemoveFromStart(String& str, sizet size); PIPE_API void RemoveFromEnd(String& str, sizet size); PIPE_API void RemoveFromEnd(String& str, StringView subStr); - PIPE_API bool RemoveCharFromEnd(String& str, TChar c); + PIPE_API bool RemoveCharFromEnd(String& str, char c); - PIPE_API i32 Split(const String& str, TArray& tokens, const TChar delim); + PIPE_API i32 Split(const String& str, TArray& tokens, const char delim); - PIPE_API bool Split(const String& str, String& a, String& b, const TChar* delim); + PIPE_API bool Split(const String& str, String& a, String& b, const char* delim); PIPE_API bool IsNumeric(const String& str); - PIPE_API bool IsNumeric(const TChar* Str); + PIPE_API bool IsNumeric(const char* Str); PIPE_API String ParseMemorySize(sizet size); diff --git a/Include/Pipe/Core/StringView.h b/Include/Pipe/Core/StringView.h index d15b892a..c563845a 100644 --- a/Include/Pipe/Core/StringView.h +++ b/Include/Pipe/Core/StringView.h @@ -15,7 +15,7 @@ namespace p template using TStringView = std::basic_string_view>; - using StringView = TStringView; + using StringView = TStringView; using WStringView = TStringView; @@ -187,103 +187,103 @@ namespace p // END Any Char API - // BEGIN TChar API - // Specializations to avoid requiring on function calls + // BEGIN char API + // Specializations to avoid requiring on function calls PIPE_API constexpr sizet Find( - const StringView str, const TChar c, FindDirection direction = FindDirection::Front) + const StringView str, const char c, FindDirection direction = FindDirection::Front) { - return Find(str, c, direction); + return Find(str, c, direction); } PIPE_API constexpr sizet Find(const StringView str, const StringView subStr, FindDirection direction = FindDirection::Front) { - return Find(str, subStr, direction); + return Find(str, subStr, direction); } PIPE_API constexpr bool Contains( - const StringView str, const TChar c, FindDirection direction = FindDirection::Front) + const StringView str, const char c, FindDirection direction = FindDirection::Front) { - return Contains(str, c, direction); + return Contains(str, c, direction); } PIPE_API constexpr bool Contains(const StringView str, const StringView subStr, FindDirection direction = FindDirection::Front) { - return Contains(str, subStr, direction); + return Contains(str, subStr, direction); } PIPE_API constexpr bool Equals(const StringView str, const StringView other) { - return Equals(str, other); + return Equals(str, other); } - PIPE_API constexpr bool Equals(const StringView str, const TChar c) + PIPE_API constexpr bool Equals(const StringView str, const char c) { - return Equals(str, c); + return Equals(str, c); } PIPE_API constexpr bool StartsWith(const StringView str, const StringView subStr) { - return StartsWith(str, subStr); + return StartsWith(str, subStr); } PIPE_API constexpr bool EndsWith(const StringView str, const StringView subStr) { - return EndsWith(str, subStr); + return EndsWith(str, subStr); } - PIPE_API constexpr bool EndsWith(const StringView str, const TChar c) + PIPE_API constexpr bool EndsWith(const StringView str, const char c) { - return EndsWith(str, c); + return EndsWith(str, c); } PIPE_API constexpr StringView RemoveFromStart(const StringView str, sizet size) { - return RemoveFromStart(str, size); + return RemoveFromStart(str, size); } PIPE_API constexpr StringView RemoveFromStart(const StringView str, const StringView subStr) { - return RemoveFromStart(str, subStr); + return RemoveFromStart(str, subStr); } PIPE_API constexpr StringView RemoveFromEnd(const StringView str, sizet size) { - return RemoveFromEnd(str, size); + return RemoveFromEnd(str, size); } PIPE_API constexpr StringView RemoveFromEnd(const StringView str, const StringView subStr) { - return RemoveFromEnd(str, subStr); + return RemoveFromEnd(str, subStr); } - PIPE_API constexpr StringView RemoveCharFromEnd(const StringView str, const TChar c) + PIPE_API constexpr StringView RemoveCharFromEnd(const StringView str, const char c) { - return RemoveCharFromEnd(str, c); + return RemoveCharFromEnd(str, c); } PIPE_API constexpr StringView FrontSubstr(StringView str, sizet size) { - return FrontSubstr(str, size); + return FrontSubstr(str, size); } PIPE_API constexpr StringView BackSubstr(StringView str, sizet size) { - return BackSubstr(str, size); + return BackSubstr(str, size); } PIPE_API constexpr void Replace( - StringView str, const TChar searchChar, const TChar replacementChar) + StringView str, const char searchChar, const char replacementChar) { - Replace(str, searchChar, replacementChar); + Replace(str, searchChar, replacementChar); } - PIPE_API constexpr sizet Length(const TChar* str) + PIPE_API constexpr sizet Length(const char* str) { - return Length(str); + return Length(str); } template @@ -319,7 +319,7 @@ namespace p PIPE_API TOptional ToNumber(StringView str); /** End ToNumber spetializations */ - // END TChar API + // END char API } // namespace Strings @@ -328,7 +328,7 @@ namespace p return GetStringHash(str.data(), str.size()); }; - inline sizet GetHash(const TChar* str) + inline sizet GetHash(const char* str) { return GetStringHash(str); }; diff --git a/Include/Pipe/Core/Tag.h b/Include/Pipe/Core/Tag.h index be29371f..45ae75cb 100644 --- a/Include/Pipe/Core/Tag.h +++ b/Include/Pipe/Core/Tag.h @@ -19,14 +19,14 @@ namespace p struct PIPE_API Tag { private: - sizet hash = 0; - const TChar* str = nullptr; + sizet hash = 0; + const char* str = nullptr; public: constexpr Tag() = default; Tag(StringView value); - Tag(const TChar* value) : Tag(StringView{value}) {} + Tag(const char* value) : Tag(StringView{value}) {} explicit Tag(const String& value) : Tag(StringView(value)) {} Tag(const Tag& other); @@ -35,7 +35,7 @@ namespace p Tag& operator=(Tag&& other) noexcept; ~Tag(); - const TChar* Data() const; + const char* Data() const; u32 Size() const; StringView AsString() const; diff --git a/Include/Pipe/Core/WindowsPlatformMisc.h b/Include/Pipe/Core/WindowsPlatformMisc.h index 7efbf29d..7890ff81 100644 --- a/Include/Pipe/Core/WindowsPlatformMisc.h +++ b/Include/Pipe/Core/WindowsPlatformMisc.h @@ -12,7 +12,7 @@ namespace p **/ struct PIPE_API WindowsPlatformMisc : public GenericPlatformMisc { - static const TChar* GetSystemErrorMessage(TChar* buffer, i32 size, i32 error = 0); + static const char* GetSystemErrorMessage(char* buffer, i32 size, i32 error = 0); }; using PlatformMisc = WindowsPlatformMisc; diff --git a/Include/Pipe/Extern/fast_float.h b/Include/Pipe/Extern/fast_float.h index 6e7df4d4..d6589f0d 100644 --- a/Include/Pipe/Extern/fast_float.h +++ b/Include/Pipe/Extern/fast_float.h @@ -21,9 +21,9 @@ // MIT License Notice // // MIT License -// +// // Copyright (c) 2021 The fast_float authors -// +// // 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 @@ -33,11 +33,11 @@ // 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 @@ -54,9 +54,9 @@ // 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. @@ -65,21 +65,21 @@ // BOOST License Notice // // Boost Software License - Version 1.0 - August 17th, 2003 -// +// // Permission is hereby granted, free of charge, to any person or organization // obtaining a copy of the software and accompanying documentation covered by // this license (the "Software") to use, reproduce, display, distribute, // execute, and transmit the Software, and to prepare derivative works of the // Software, and to permit third-parties to whom the Software is furnished to // do so, all subject to the following: -// +// // The copyright notices in the Software and this entire statement, including // the above license grant, this restriction and the following disclaimer, // must be included in all copies of the Software, in whole or in part, and // all derivative works of the Software, unless such copies or derivative // works are solely in the form of machine-executable object code generated by // a source language processor. -// +// // 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT @@ -93,807 +93,922 @@ #define FASTFLOAT_CONSTEXPR_FEATURE_DETECT_H #ifdef __has_include -#if __has_include() -#include -#endif + #if __has_include() + #include + #endif #endif // Testing for https://wg21.link/N3652, adopted in C++14 #if __cpp_constexpr >= 201304 -#define FASTFLOAT_CONSTEXPR14 constexpr + #define FASTFLOAT_CONSTEXPR14 constexpr #else -#define FASTFLOAT_CONSTEXPR14 + #define FASTFLOAT_CONSTEXPR14 #endif #if defined(__cpp_lib_bit_cast) && __cpp_lib_bit_cast >= 201806L -#define FASTFLOAT_HAS_BIT_CAST 1 + #define FASTFLOAT_HAS_BIT_CAST 1 #else -#define FASTFLOAT_HAS_BIT_CAST 0 + #define FASTFLOAT_HAS_BIT_CAST 0 #endif #if defined(__cpp_lib_is_constant_evaluated) && __cpp_lib_is_constant_evaluated >= 201811L -#define FASTFLOAT_HAS_IS_CONSTANT_EVALUATED 1 + #define FASTFLOAT_HAS_IS_CONSTANT_EVALUATED 1 #else -#define FASTFLOAT_HAS_IS_CONSTANT_EVALUATED 0 + #define FASTFLOAT_HAS_IS_CONSTANT_EVALUATED 0 #endif // Testing for relevant C++20 constexpr library features -#if FASTFLOAT_HAS_IS_CONSTANT_EVALUATED \ - && FASTFLOAT_HAS_BIT_CAST \ +#if FASTFLOAT_HAS_IS_CONSTANT_EVALUATED && FASTFLOAT_HAS_BIT_CAST \ && __cpp_lib_constexpr_algorithms >= 201806L /*For std::copy and std::fill*/ -#define FASTFLOAT_CONSTEXPR20 constexpr -#define FASTFLOAT_IS_CONSTEXPR 1 + #define FASTFLOAT_CONSTEXPR20 constexpr + #define FASTFLOAT_IS_CONSTEXPR 1 #else -#define FASTFLOAT_CONSTEXPR20 -#define FASTFLOAT_IS_CONSTEXPR 0 + #define FASTFLOAT_CONSTEXPR20 + #define FASTFLOAT_IS_CONSTEXPR 0 #endif -#endif // FASTFLOAT_CONSTEXPR_FEATURE_DETECT_H +#endif // FASTFLOAT_CONSTEXPR_FEATURE_DETECT_H #ifndef FASTFLOAT_FLOAT_COMMON_H #define FASTFLOAT_FLOAT_COMMON_H +#include #include #include -#include #include -#include #include +#include + #ifdef __has_include - #if __has_include() && (__cplusplus > 202002L || _MSVC_LANG > 202002L) - #include - #endif + #if __has_include() && (__cplusplus > 202002L || _MSVC_LANG > 202002L) + #include + #endif #endif -namespace fast_float { +namespace fast_float +{ #define FASTFLOAT_JSONFMT (1 << 5) #define FASTFLOAT_FORTRANFMT (1 << 6) -enum chars_format { - scientific = 1 << 0, - fixed = 1 << 2, - hex = 1 << 3, - no_infnan = 1 << 4, - // RFC 8259: https://datatracker.ietf.org/doc/html/rfc8259#section-6 - json = FASTFLOAT_JSONFMT | fixed | scientific | no_infnan, - // Extension of RFC 8259 where, e.g., "inf" and "nan" are allowed. - json_or_infnan = FASTFLOAT_JSONFMT | fixed | scientific, - fortran = FASTFLOAT_FORTRANFMT | fixed | scientific, - general = fixed | scientific -}; - -template -struct from_chars_result_t { - UC const* ptr; - std::errc ec; -}; -using from_chars_result = from_chars_result_t; - -template -struct parse_options_t { - constexpr explicit parse_options_t(chars_format fmt = chars_format::general, - UC dot = UC('.')) - : format(fmt), decimal_point(dot) {} - - /** Which number formats are accepted */ - chars_format format; - /** The character used as decimal point */ - UC decimal_point; -}; -using parse_options = parse_options_t; - -} + enum chars_format + { + scientific = 1 << 0, + fixed = 1 << 2, + hex = 1 << 3, + no_infnan = 1 << 4, + // RFC 8259: https://datatracker.ietf.org/doc/html/rfc8259#section-6 + json = FASTFLOAT_JSONFMT | fixed | scientific | no_infnan, + // Extension of RFC 8259 where, e.g., "inf" and "nan" are allowed. + json_or_infnan = FASTFLOAT_JSONFMT | fixed | scientific, + fortran = FASTFLOAT_FORTRANFMT | fixed | scientific, + general = fixed | scientific + }; + + template + struct from_chars_result_t + { + UC const* ptr; + std::errc ec; + }; + using from_chars_result = from_chars_result_t; + + template + struct parse_options_t + { + constexpr explicit parse_options_t( + chars_format fmt = chars_format::general, UC dot = UC('.')) + : format(fmt), decimal_point(dot) + {} + + /** Which number formats are accepted */ + chars_format format; + /** The character used as decimal point */ + UC decimal_point; + }; + using parse_options = parse_options_t; + +} // namespace fast_float #if FASTFLOAT_HAS_BIT_CAST -#include -#endif - -#if (defined(__x86_64) || defined(__x86_64__) || defined(_M_X64) \ - || defined(__amd64) || defined(__aarch64__) || defined(_M_ARM64) \ - || defined(__MINGW64__) \ - || defined(__s390x__) \ - || (defined(__ppc64__) || defined(__PPC64__) || defined(__ppc64le__) || defined(__PPC64LE__)) \ - || defined(__loongarch64) ) -#define FASTFLOAT_64BIT 1 -#elif (defined(__i386) || defined(__i386__) || defined(_M_IX86) \ - || defined(__arm__) || defined(_M_ARM) || defined(__ppc__) \ - || defined(__MINGW32__) || defined(__EMSCRIPTEN__)) -#define FASTFLOAT_32BIT 1 + #include +#endif + +#if (defined(__x86_64) || defined(__x86_64__) || defined(_M_X64) || defined(__amd64) \ + || defined(__aarch64__) || defined(_M_ARM64) || defined(__MINGW64__) || defined(__s390x__) \ + || (defined(__ppc64__) || defined(__PPC64__) || defined(__ppc64le__) || defined(__PPC64LE__)) \ + || defined(__loongarch64)) + #define FASTFLOAT_64BIT 1 +#elif (defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__arm__) \ + || defined(_M_ARM) || defined(__ppc__) || defined(__MINGW32__) || defined(__EMSCRIPTEN__)) + #define FASTFLOAT_32BIT 1 #else - // Need to check incrementally, since SIZE_MAX is a size_t, avoid overflow. - // We can never tell the register width, but the SIZE_MAX is a good approximation. - // UINTPTR_MAX and INTPTR_MAX are optional, so avoid them for max portability. - #if SIZE_MAX == 0xffff - #error Unknown platform (16-bit, unsupported) - #elif SIZE_MAX == 0xffffffff - #define FASTFLOAT_32BIT 1 - #elif SIZE_MAX == 0xffffffffffffffff - #define FASTFLOAT_64BIT 1 - #else - #error Unknown platform (not 32-bit, not 64-bit?) - #endif + // Need to check incrementally, since SIZE_MAX is a size_t, avoid overflow. + // We can never tell the register width, but the SIZE_MAX is a good approximation. + // UINTPTR_MAX and INTPTR_MAX are optional, so avoid them for max portability. + #if SIZE_MAX == 0xffff + #error Unknown platform (16-bit, unsupported) + #elif SIZE_MAX == 0xffffffff + #define FASTFLOAT_32BIT 1 + #elif SIZE_MAX == 0xffffffffffffffff + #define FASTFLOAT_64BIT 1 + #else + #error Unknown platform (not 32-bit, not 64-bit?) + #endif #endif #if ((defined(_WIN32) || defined(_WIN64)) && !defined(__clang__)) -#include + #include #endif #if defined(_MSC_VER) && !defined(__clang__) -#define FASTFLOAT_VISUAL_STUDIO 1 + #define FASTFLOAT_VISUAL_STUDIO 1 #endif #if defined __BYTE_ORDER__ && defined __ORDER_BIG_ENDIAN__ -#define FASTFLOAT_IS_BIG_ENDIAN (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__) + #define FASTFLOAT_IS_BIG_ENDIAN (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__) #elif defined _WIN32 -#define FASTFLOAT_IS_BIG_ENDIAN 0 -#else -#if defined(__APPLE__) || defined(__FreeBSD__) -#include -#elif defined(sun) || defined(__sun) -#include -#elif defined(__MVS__) -#include + #define FASTFLOAT_IS_BIG_ENDIAN 0 #else -#ifdef __has_include -#if __has_include() -#include -#endif //__has_include() -#endif //__has_include -#endif -# -#ifndef __BYTE_ORDER__ -// safe choice -#define FASTFLOAT_IS_BIG_ENDIAN 0 -#endif -# -#ifndef __ORDER_LITTLE_ENDIAN__ -// safe choice -#define FASTFLOAT_IS_BIG_ENDIAN 0 -#endif -# -#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ -#define FASTFLOAT_IS_BIG_ENDIAN 0 -#else -#define FASTFLOAT_IS_BIG_ENDIAN 1 -#endif + #if defined(__APPLE__) || defined(__FreeBSD__) + #include + #elif defined(sun) || defined(__sun) + #include + #elif defined(__MVS__) + #include + #else + #ifdef __has_include + #if __has_include() + #include + #endif //__has_include() + #endif //__has_include + #endif + # + #ifndef __BYTE_ORDER__ + // safe choice + #define FASTFLOAT_IS_BIG_ENDIAN 0 + #endif + # + #ifndef __ORDER_LITTLE_ENDIAN__ + // safe choice + #define FASTFLOAT_IS_BIG_ENDIAN 0 + #endif + # + #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ + #define FASTFLOAT_IS_BIG_ENDIAN 0 + #else + #define FASTFLOAT_IS_BIG_ENDIAN 1 + #endif #endif -#if defined(__SSE2__) || \ - (defined(FASTFLOAT_VISUAL_STUDIO) && \ - (defined(_M_AMD64) || defined(_M_X64) || (defined(_M_IX86_FP) && _M_IX86_FP == 2))) -#define FASTFLOAT_SSE2 1 +#if defined(__SSE2__) \ + || (defined(FASTFLOAT_VISUAL_STUDIO) \ + && (defined(_M_AMD64) || defined(_M_X64) || (defined(_M_IX86_FP) && _M_IX86_FP == 2))) + #define FASTFLOAT_SSE2 1 #endif #if defined(__aarch64__) || defined(_M_ARM64) -#define FASTFLOAT_NEON 1 + #define FASTFLOAT_NEON 1 #endif #if defined(FASTFLOAT_SSE2) || defined(FASTFLOAT_NEON) -#define FASTFLOAT_HAS_SIMD 1 + #define FASTFLOAT_HAS_SIMD 1 #endif #if defined(__GNUC__) -// disable -Wcast-align=strict (GCC only) -#define FASTFLOAT_SIMD_DISABLE_WARNINGS \ - _Pragma("GCC diagnostic push") \ - _Pragma("GCC diagnostic ignored \"-Wcast-align\"") + // disable -Wcast-align=strict (GCC only) + #define FASTFLOAT_SIMD_DISABLE_WARNINGS \ + _Pragma("GCC diagnostic push") _Pragma("GCC diagnostic ignored \"-Wcast-align\"") #else -#define FASTFLOAT_SIMD_DISABLE_WARNINGS + #define FASTFLOAT_SIMD_DISABLE_WARNINGS #endif #if defined(__GNUC__) -#define FASTFLOAT_SIMD_RESTORE_WARNINGS \ - _Pragma("GCC diagnostic pop") + #define FASTFLOAT_SIMD_RESTORE_WARNINGS _Pragma("GCC diagnostic pop") #else -#define FASTFLOAT_SIMD_RESTORE_WARNINGS + #define FASTFLOAT_SIMD_RESTORE_WARNINGS #endif - #ifdef FASTFLOAT_VISUAL_STUDIO -#define fastfloat_really_inline __forceinline + #define fastfloat_really_inline __forceinline #else -#define fastfloat_really_inline inline __attribute__((always_inline)) + #define fastfloat_really_inline inline __attribute__((always_inline)) #endif #ifndef FASTFLOAT_ASSERT -#define FASTFLOAT_ASSERT(x) { ((void)(x)); } + #define FASTFLOAT_ASSERT(x) \ + { \ + ((void)(x)); \ + } #endif #ifndef FASTFLOAT_DEBUG_ASSERT -#define FASTFLOAT_DEBUG_ASSERT(x) { ((void)(x)); } + #define FASTFLOAT_DEBUG_ASSERT(x) \ + { \ + ((void)(x)); \ + } #endif // rust style `try!()` macro, or `?` operator -#define FASTFLOAT_TRY(x) { if (!(x)) return false; } +#define FASTFLOAT_TRY(x) \ + { \ + if (!(x)) \ + return false; \ + } #define FASTFLOAT_ENABLE_IF(...) typename std::enable_if<(__VA_ARGS__), int>::type -namespace fast_float { +namespace fast_float +{ -fastfloat_really_inline constexpr bool cpp20_and_in_constexpr() { + fastfloat_really_inline constexpr bool cpp20_and_in_constexpr() + { #if FASTFLOAT_HAS_IS_CONSTANT_EVALUATED - return std::is_constant_evaluated(); + return std::is_constant_evaluated(); #else - return false; -#endif -} - -template -fastfloat_really_inline constexpr bool is_supported_float_type() { - return std::is_same::value || std::is_same::value -#if __STDCPP_FLOAT32_T__ - || std::is_same::value -#endif -#if __STDCPP_FLOAT64_T__ - || std::is_same::value -#endif - ; -} - -template -fastfloat_really_inline constexpr bool is_supported_char_type() { - return - std::is_same::value || - std::is_same::value || - std::is_same::value || - std::is_same::value; -} - -// Compares two ASCII strings in a case insensitive manner. -template -inline FASTFLOAT_CONSTEXPR14 bool -fastfloat_strncasecmp(UC const * input1, UC const * input2, size_t length) { - char running_diff{0}; - for (size_t i = 0; i < length; ++i) { - running_diff |= (char(input1[i]) ^ char(input2[i])); - } - return (running_diff == 0) || (running_diff == 32); -} + return false; +#endif + } + + template + fastfloat_really_inline constexpr bool is_supported_float_type() + { + return std::is_same::value || std::is_same::value +#if defined(__STDCPP_FLOAT32_T__) + || std::is_same::value +#endif +#if defined(__STDCPP_FLOAT64_T__) + || std::is_same::value +#endif + ; + } + + template + fastfloat_really_inline constexpr bool is_supported_char_type() + { + return std::is_same::value || std::is_same::value + || std::is_same::value || std::is_same::value; + } + + // Compares two ASCII strings in a case insensitive manner. + template + inline FASTFLOAT_CONSTEXPR14 bool fastfloat_strncasecmp( + UC const* input1, UC const* input2, size_t length) + { + char running_diff{0}; + for (size_t i = 0; i < length; ++i) + { + running_diff |= (char(input1[i]) ^ char(input2[i])); + } + return (running_diff == 0) || (running_diff == 32); + } #ifndef FLT_EVAL_METHOD -#error "FLT_EVAL_METHOD should be defined, please include cfloat." -#endif - -// a pointer and a length to a contiguous block of memory -template -struct span { - const T* ptr; - size_t length; - constexpr span(const T* _ptr, size_t _length) : ptr(_ptr), length(_length) {} - constexpr span() : ptr(nullptr), length(0) {} - - constexpr size_t len() const noexcept { - return length; - } - - FASTFLOAT_CONSTEXPR14 const T& operator[](size_t index) const noexcept { - FASTFLOAT_DEBUG_ASSERT(index < length); - return ptr[index]; - } -}; - -struct value128 { - uint64_t low; - uint64_t high; - constexpr value128(uint64_t _low, uint64_t _high) : low(_low), high(_high) {} - constexpr value128() : low(0), high(0) {} -}; - -/* Helper C++14 constexpr generic implementation of leading_zeroes */ -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -int leading_zeroes_generic(uint64_t input_num, int last_bit = 0) { - if(input_num & uint64_t(0xffffffff00000000)) { input_num >>= 32; last_bit |= 32; } - if(input_num & uint64_t( 0xffff0000)) { input_num >>= 16; last_bit |= 16; } - if(input_num & uint64_t( 0xff00)) { input_num >>= 8; last_bit |= 8; } - if(input_num & uint64_t( 0xf0)) { input_num >>= 4; last_bit |= 4; } - if(input_num & uint64_t( 0xc)) { input_num >>= 2; last_bit |= 2; } - if(input_num & uint64_t( 0x2)) { /* input_num >>= 1; */ last_bit |= 1; } - return 63 - last_bit; -} - -/* result might be undefined when input_num is zero */ -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -int leading_zeroes(uint64_t input_num) { - assert(input_num > 0); - if (cpp20_and_in_constexpr()) { - return leading_zeroes_generic(input_num); - } + #error "FLT_EVAL_METHOD should be defined, please include cfloat." +#endif + + // a pointer and a length to a contiguous block of memory + template + struct span + { + const T* ptr; + size_t length; + constexpr span(const T* _ptr, size_t _length) : ptr(_ptr), length(_length) {} + constexpr span() : ptr(nullptr), length(0) {} + + constexpr size_t len() const noexcept + { + return length; + } + + FASTFLOAT_CONSTEXPR14 const T& operator[](size_t index) const noexcept + { + FASTFLOAT_DEBUG_ASSERT(index < length); + return ptr[index]; + } + }; + + struct value128 + { + uint64_t low; + uint64_t high; + constexpr value128(uint64_t _low, uint64_t _high) : low(_low), high(_high) {} + constexpr value128() : low(0), high(0) {} + }; + + /* Helper C++14 constexpr generic implementation of leading_zeroes */ + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 int leading_zeroes_generic( + uint64_t input_num, int last_bit = 0) + { + if (input_num & uint64_t(0xffffffff00000000)) + { + input_num >>= 32; + last_bit |= 32; + } + if (input_num & uint64_t(0xffff0000)) + { + input_num >>= 16; + last_bit |= 16; + } + if (input_num & uint64_t(0xff00)) + { + input_num >>= 8; + last_bit |= 8; + } + if (input_num & uint64_t(0xf0)) + { + input_num >>= 4; + last_bit |= 4; + } + if (input_num & uint64_t(0xc)) + { + input_num >>= 2; + last_bit |= 2; + } + if (input_num & uint64_t(0x2)) + { /* input_num >>= 1; */ + last_bit |= 1; + } + return 63 - last_bit; + } + + /* result might be undefined when input_num is zero */ + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 int leading_zeroes(uint64_t input_num) + { + assert(input_num > 0); + if (cpp20_and_in_constexpr()) + { + return leading_zeroes_generic(input_num); + } #ifdef FASTFLOAT_VISUAL_STUDIO - #if defined(_M_X64) || defined(_M_ARM64) - unsigned long leading_zero = 0; - // Search the mask data from most significant bit (MSB) - // to least significant bit (LSB) for a set bit (1). - _BitScanReverse64(&leading_zero, input_num); - return (int)(63 - leading_zero); - #else - return leading_zeroes_generic(input_num); - #endif + #if defined(_M_X64) || defined(_M_ARM64) + unsigned long leading_zero = 0; + // Search the mask data from most significant bit (MSB) + // to least significant bit (LSB) for a set bit (1). + _BitScanReverse64(&leading_zero, input_num); + return (int)(63 - leading_zero); + #else + return leading_zeroes_generic(input_num); + #endif #else - return __builtin_clzll(input_num); -#endif -} - -// slow emulation routine for 32-bit -fastfloat_really_inline constexpr uint64_t emulu(uint32_t x, uint32_t y) { - return x * (uint64_t)y; -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -uint64_t umul128_generic(uint64_t ab, uint64_t cd, uint64_t *hi) { - uint64_t ad = emulu((uint32_t)(ab >> 32), (uint32_t)cd); - uint64_t bd = emulu((uint32_t)ab, (uint32_t)cd); - uint64_t adbc = ad + emulu((uint32_t)ab, (uint32_t)(cd >> 32)); - uint64_t adbc_carry = (uint64_t)(adbc < ad); - uint64_t lo = bd + (adbc << 32); - *hi = emulu((uint32_t)(ab >> 32), (uint32_t)(cd >> 32)) + (adbc >> 32) + - (adbc_carry << 32) + (uint64_t)(lo < bd); - return lo; -} + return __builtin_clzll(input_num); +#endif + } + + // slow emulation routine for 32-bit + fastfloat_really_inline constexpr uint64_t emulu(uint32_t x, uint32_t y) + { + return x * (uint64_t)y; + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 uint64_t umul128_generic( + uint64_t ab, uint64_t cd, uint64_t* hi) + { + uint64_t ad = emulu((uint32_t)(ab >> 32), (uint32_t)cd); + uint64_t bd = emulu((uint32_t)ab, (uint32_t)cd); + uint64_t adbc = ad + emulu((uint32_t)ab, (uint32_t)(cd >> 32)); + uint64_t adbc_carry = (uint64_t)(adbc < ad); + uint64_t lo = bd + (adbc << 32); + *hi = emulu((uint32_t)(ab >> 32), (uint32_t)(cd >> 32)) + (adbc >> 32) + (adbc_carry << 32) + + (uint64_t)(lo < bd); + return lo; + } #ifdef FASTFLOAT_32BIT -// slow emulation routine for 32-bit -#if !defined(__MINGW64__) -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -uint64_t _umul128(uint64_t ab, uint64_t cd, uint64_t *hi) { - return umul128_generic(ab, cd, hi); -} -#endif // !__MINGW64__ - -#endif // FASTFLOAT_32BIT - - -// compute 64-bit a*b -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -value128 full_multiplication(uint64_t a, uint64_t b) { - if (cpp20_and_in_constexpr()) { - value128 answer; - answer.low = umul128_generic(a, b, &answer.high); - return answer; - } - value128 answer; + // slow emulation routine for 32-bit + #if !defined(__MINGW64__) + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 uint64_t _umul128( + uint64_t ab, uint64_t cd, uint64_t* hi) + { + return umul128_generic(ab, cd, hi); + } + #endif // !__MINGW64__ + +#endif // FASTFLOAT_32BIT + + + // compute 64-bit a*b + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 value128 full_multiplication( + uint64_t a, uint64_t b) + { + if (cpp20_and_in_constexpr()) + { + value128 answer; + answer.low = umul128_generic(a, b, &answer.high); + return answer; + } + value128 answer; #if defined(_M_ARM64) && !defined(__MINGW32__) - // ARM64 has native support for 64-bit multiplications, no need to emulate - // But MinGW on ARM64 doesn't have native support for 64-bit multiplications - answer.high = __umulh(a, b); - answer.low = a * b; + // ARM64 has native support for 64-bit multiplications, no need to emulate + // But MinGW on ARM64 doesn't have native support for 64-bit multiplications + answer.high = __umulh(a, b); + answer.low = a * b; #elif defined(FASTFLOAT_32BIT) || (defined(_WIN64) && !defined(__clang__)) - answer.low = _umul128(a, b, &answer.high); // _umul128 not available on ARM64 + answer.low = _umul128(a, b, &answer.high); // _umul128 not available on ARM64 #elif defined(FASTFLOAT_64BIT) && defined(__SIZEOF_INT128__) - __uint128_t r = ((__uint128_t)a) * b; - answer.low = uint64_t(r); - answer.high = uint64_t(r >> 64); + __uint128_t r = ((__uint128_t)a) * b; + answer.low = uint64_t(r); + answer.high = uint64_t(r >> 64); #else - answer.low = umul128_generic(a, b, &answer.high); -#endif - return answer; -} - -struct adjusted_mantissa { - uint64_t mantissa{0}; - int32_t power2{0}; // a negative value indicates an invalid result - adjusted_mantissa() = default; - constexpr bool operator==(const adjusted_mantissa &o) const { - return mantissa == o.mantissa && power2 == o.power2; - } - constexpr bool operator!=(const adjusted_mantissa &o) const { - return mantissa != o.mantissa || power2 != o.power2; - } -}; - -// Bias so we can get the real exponent with an invalid adjusted_mantissa. -constexpr static int32_t invalid_am_bias = -0x8000; - -// used for binary_format_lookup_tables::max_mantissa -constexpr uint64_t constant_55555 = 5 * 5 * 5 * 5 * 5; - -template -struct binary_format_lookup_tables; - -template struct binary_format : binary_format_lookup_tables { - using equiv_uint = typename std::conditional::type; - - static inline constexpr int mantissa_explicit_bits(); - static inline constexpr int minimum_exponent(); - static inline constexpr int infinite_power(); - static inline constexpr int sign_index(); - static inline constexpr int min_exponent_fast_path(); // used when fegetround() == FE_TONEAREST - static inline constexpr int max_exponent_fast_path(); - static inline constexpr int max_exponent_round_to_even(); - static inline constexpr int min_exponent_round_to_even(); - static inline constexpr uint64_t max_mantissa_fast_path(int64_t power); - static inline constexpr uint64_t max_mantissa_fast_path(); // used when fegetround() == FE_TONEAREST - static inline constexpr int largest_power_of_ten(); - static inline constexpr int smallest_power_of_ten(); - static inline constexpr T exact_power_of_ten(int64_t power); - static inline constexpr size_t max_digits(); - static inline constexpr equiv_uint exponent_mask(); - static inline constexpr equiv_uint mantissa_mask(); - static inline constexpr equiv_uint hidden_bit_mask(); -}; - -template -struct binary_format_lookup_tables { - static constexpr double powers_of_ten[] = { - 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, - 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22}; - - // Largest integer value v so that (5**index * v) <= 1<<53. - // 0x10000000000000 == 1 << 53 - static constexpr uint64_t max_mantissa[] = { - 0x10000000000000, - 0x10000000000000 / 5, - 0x10000000000000 / (5 * 5), - 0x10000000000000 / (5 * 5 * 5), - 0x10000000000000 / (5 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555), - 0x10000000000000 / (constant_55555 * 5), - 0x10000000000000 / (constant_55555 * 5 * 5), - 0x10000000000000 / (constant_55555 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * 5 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555), - 0x10000000000000 / (constant_55555 * constant_55555 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5), - 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5 * 5)}; -}; - -template -constexpr double binary_format_lookup_tables::powers_of_ten[]; - -template -constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; - -template -struct binary_format_lookup_tables { - static constexpr float powers_of_ten[] = {1e0f, 1e1f, 1e2f, 1e3f, 1e4f, 1e5f, - 1e6f, 1e7f, 1e8f, 1e9f, 1e10f}; - - // Largest integer value v so that (5**index * v) <= 1<<24. - // 0x1000000 == 1<<24 - static constexpr uint64_t max_mantissa[] = { - 0x1000000, - 0x1000000 / 5, - 0x1000000 / (5 * 5), - 0x1000000 / (5 * 5 * 5), - 0x1000000 / (5 * 5 * 5 * 5), - 0x1000000 / (constant_55555), - 0x1000000 / (constant_55555 * 5), - 0x1000000 / (constant_55555 * 5 * 5), - 0x1000000 / (constant_55555 * 5 * 5 * 5), - 0x1000000 / (constant_55555 * 5 * 5 * 5 * 5), - 0x1000000 / (constant_55555 * constant_55555), - 0x1000000 / (constant_55555 * constant_55555 * 5)}; -}; - -template -constexpr float binary_format_lookup_tables::powers_of_ten[]; - -template -constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; - -template <> inline constexpr int binary_format::min_exponent_fast_path() { + answer.low = umul128_generic(a, b, &answer.high); +#endif + return answer; + } + + struct adjusted_mantissa + { + uint64_t mantissa{0}; + int32_t power2{0}; // a negative value indicates an invalid result + adjusted_mantissa() = default; + constexpr bool operator==(const adjusted_mantissa& o) const + { + return mantissa == o.mantissa && power2 == o.power2; + } + constexpr bool operator!=(const adjusted_mantissa& o) const + { + return mantissa != o.mantissa || power2 != o.power2; + } + }; + + // Bias so we can get the real exponent with an invalid adjusted_mantissa. + constexpr static int32_t invalid_am_bias = -0x8000; + + // used for binary_format_lookup_tables::max_mantissa + constexpr uint64_t constant_55555 = 5 * 5 * 5 * 5 * 5; + + template + struct binary_format_lookup_tables; + + template + struct binary_format : binary_format_lookup_tables + { + using equiv_uint = typename std::conditional::type; + + static inline constexpr int mantissa_explicit_bits(); + static inline constexpr int minimum_exponent(); + static inline constexpr int infinite_power(); + static inline constexpr int sign_index(); + static inline constexpr int + min_exponent_fast_path(); // used when fegetround() == FE_TONEAREST + static inline constexpr int max_exponent_fast_path(); + static inline constexpr int max_exponent_round_to_even(); + static inline constexpr int min_exponent_round_to_even(); + static inline constexpr uint64_t max_mantissa_fast_path(int64_t power); + static inline constexpr uint64_t + max_mantissa_fast_path(); // used when fegetround() == FE_TONEAREST + static inline constexpr int largest_power_of_ten(); + static inline constexpr int smallest_power_of_ten(); + static inline constexpr T exact_power_of_ten(int64_t power); + static inline constexpr size_t max_digits(); + static inline constexpr equiv_uint exponent_mask(); + static inline constexpr equiv_uint mantissa_mask(); + static inline constexpr equiv_uint hidden_bit_mask(); + }; + + template + struct binary_format_lookup_tables + { + static constexpr double powers_of_ten[] = {1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, + 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22}; + + // Largest integer value v so that (5**index * v) <= 1<<53. + // 0x10000000000000 == 1 << 53 + static constexpr uint64_t max_mantissa[] = {0x10000000000000, 0x10000000000000 / 5, + 0x10000000000000 / (5 * 5), 0x10000000000000 / (5 * 5 * 5), + 0x10000000000000 / (5 * 5 * 5 * 5), 0x10000000000000 / (constant_55555), + 0x10000000000000 / (constant_55555 * 5), 0x10000000000000 / (constant_55555 * 5 * 5), + 0x10000000000000 / (constant_55555 * 5 * 5 * 5), + 0x10000000000000 / (constant_55555 * 5 * 5 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555), + 0x10000000000000 / (constant_55555 * constant_55555 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * 5 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5 * 5), + 0x10000000000000 / (constant_55555 * constant_55555 * constant_55555 * constant_55555), + 0x10000000000000 + / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5), + 0x10000000000000 + / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5), + 0x10000000000000 + / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5), + 0x10000000000000 + / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * 5 * 5 * 5 + * 5)}; + }; + + template + constexpr double binary_format_lookup_tables::powers_of_ten[]; + + template + constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; + + template + struct binary_format_lookup_tables + { + static constexpr float powers_of_ten[] = { + 1e0f, 1e1f, 1e2f, 1e3f, 1e4f, 1e5f, 1e6f, 1e7f, 1e8f, 1e9f, 1e10f}; + + // Largest integer value v so that (5**index * v) <= 1<<24. + // 0x1000000 == 1<<24 + static constexpr uint64_t max_mantissa[] = {0x1000000, 0x1000000 / 5, 0x1000000 / (5 * 5), + 0x1000000 / (5 * 5 * 5), 0x1000000 / (5 * 5 * 5 * 5), 0x1000000 / (constant_55555), + 0x1000000 / (constant_55555 * 5), 0x1000000 / (constant_55555 * 5 * 5), + 0x1000000 / (constant_55555 * 5 * 5 * 5), 0x1000000 / (constant_55555 * 5 * 5 * 5 * 5), + 0x1000000 / (constant_55555 * constant_55555), + 0x1000000 / (constant_55555 * constant_55555 * 5)}; + }; + + template + constexpr float binary_format_lookup_tables::powers_of_ten[]; + + template + constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; + + template<> + inline constexpr int binary_format::min_exponent_fast_path() + { #if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) - return 0; + return 0; #else - return -22; + return -22; #endif -} + } -template <> inline constexpr int binary_format::min_exponent_fast_path() { + template<> + inline constexpr int binary_format::min_exponent_fast_path() + { #if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) - return 0; + return 0; #else - return -10; -#endif -} - -template <> inline constexpr int binary_format::mantissa_explicit_bits() { - return 52; -} -template <> inline constexpr int binary_format::mantissa_explicit_bits() { - return 23; -} - -template <> inline constexpr int binary_format::max_exponent_round_to_even() { - return 23; -} - -template <> inline constexpr int binary_format::max_exponent_round_to_even() { - return 10; -} - -template <> inline constexpr int binary_format::min_exponent_round_to_even() { - return -4; -} - -template <> inline constexpr int binary_format::min_exponent_round_to_even() { - return -17; -} - -template <> inline constexpr int binary_format::minimum_exponent() { - return -1023; -} -template <> inline constexpr int binary_format::minimum_exponent() { - return -127; -} - -template <> inline constexpr int binary_format::infinite_power() { - return 0x7FF; -} -template <> inline constexpr int binary_format::infinite_power() { - return 0xFF; -} - -template <> inline constexpr int binary_format::sign_index() { return 63; } -template <> inline constexpr int binary_format::sign_index() { return 31; } - -template <> inline constexpr int binary_format::max_exponent_fast_path() { - return 22; -} -template <> inline constexpr int binary_format::max_exponent_fast_path() { - return 10; -} - -template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path() { - return uint64_t(2) << mantissa_explicit_bits(); -} -template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) { - // caller is responsible to ensure that - // power >= 0 && power <= 22 - // - // Work around clang bug https://godbolt.org/z/zedh7rrhc - return (void)max_mantissa[0], max_mantissa[power]; -} -template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path() { - return uint64_t(2) << mantissa_explicit_bits(); -} -template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) { - // caller is responsible to ensure that - // power >= 0 && power <= 10 - // - // Work around clang bug https://godbolt.org/z/zedh7rrhc - return (void)max_mantissa[0], max_mantissa[power]; -} - -template <> -inline constexpr double binary_format::exact_power_of_ten(int64_t power) { - // Work around clang bug https://godbolt.org/z/zedh7rrhc - return (void)powers_of_ten[0], powers_of_ten[power]; -} -template <> -inline constexpr float binary_format::exact_power_of_ten(int64_t power) { - // Work around clang bug https://godbolt.org/z/zedh7rrhc - return (void)powers_of_ten[0], powers_of_ten[power]; -} - - -template <> -inline constexpr int binary_format::largest_power_of_ten() { - return 308; -} -template <> -inline constexpr int binary_format::largest_power_of_ten() { - return 38; -} - -template <> -inline constexpr int binary_format::smallest_power_of_ten() { - return -342; -} -template <> -inline constexpr int binary_format::smallest_power_of_ten() { - return -65; -} - -template <> inline constexpr size_t binary_format::max_digits() { - return 769; -} -template <> inline constexpr size_t binary_format::max_digits() { - return 114; -} - -template <> inline constexpr binary_format::equiv_uint - binary_format::exponent_mask() { - return 0x7F800000; -} -template <> inline constexpr binary_format::equiv_uint - binary_format::exponent_mask() { - return 0x7FF0000000000000; -} - -template <> inline constexpr binary_format::equiv_uint - binary_format::mantissa_mask() { - return 0x007FFFFF; -} -template <> inline constexpr binary_format::equiv_uint - binary_format::mantissa_mask() { - return 0x000FFFFFFFFFFFFF; -} - -template <> inline constexpr binary_format::equiv_uint - binary_format::hidden_bit_mask() { - return 0x00800000; -} -template <> inline constexpr binary_format::equiv_uint - binary_format::hidden_bit_mask() { - return 0x0010000000000000; -} - -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void to_float(bool negative, adjusted_mantissa am, T &value) { - using fastfloat_uint = typename binary_format::equiv_uint; - fastfloat_uint word = (fastfloat_uint)am.mantissa; - word |= fastfloat_uint(am.power2) << binary_format::mantissa_explicit_bits(); - word |= fastfloat_uint(negative) << binary_format::sign_index(); + return -10; +#endif + } + + template<> + inline constexpr int binary_format::mantissa_explicit_bits() + { + return 52; + } + template<> + inline constexpr int binary_format::mantissa_explicit_bits() + { + return 23; + } + + template<> + inline constexpr int binary_format::max_exponent_round_to_even() + { + return 23; + } + + template<> + inline constexpr int binary_format::max_exponent_round_to_even() + { + return 10; + } + + template<> + inline constexpr int binary_format::min_exponent_round_to_even() + { + return -4; + } + + template<> + inline constexpr int binary_format::min_exponent_round_to_even() + { + return -17; + } + + template<> + inline constexpr int binary_format::minimum_exponent() + { + return -1023; + } + template<> + inline constexpr int binary_format::minimum_exponent() + { + return -127; + } + + template<> + inline constexpr int binary_format::infinite_power() + { + return 0x7FF; + } + template<> + inline constexpr int binary_format::infinite_power() + { + return 0xFF; + } + + template<> + inline constexpr int binary_format::sign_index() + { + return 63; + } + template<> + inline constexpr int binary_format::sign_index() + { + return 31; + } + + template<> + inline constexpr int binary_format::max_exponent_fast_path() + { + return 22; + } + template<> + inline constexpr int binary_format::max_exponent_fast_path() + { + return 10; + } + + template<> + inline constexpr uint64_t binary_format::max_mantissa_fast_path() + { + return uint64_t(2) << mantissa_explicit_bits(); + } + template<> + inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) + { + // caller is responsible to ensure that + // power >= 0 && power <= 22 + // + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)max_mantissa[0], max_mantissa[power]; + } + template<> + inline constexpr uint64_t binary_format::max_mantissa_fast_path() + { + return uint64_t(2) << mantissa_explicit_bits(); + } + template<> + inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) + { + // caller is responsible to ensure that + // power >= 0 && power <= 10 + // + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)max_mantissa[0], max_mantissa[power]; + } + + template<> + inline constexpr double binary_format::exact_power_of_ten(int64_t power) + { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)powers_of_ten[0], powers_of_ten[power]; + } + template<> + inline constexpr float binary_format::exact_power_of_ten(int64_t power) + { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)powers_of_ten[0], powers_of_ten[power]; + } + + + template<> + inline constexpr int binary_format::largest_power_of_ten() + { + return 308; + } + template<> + inline constexpr int binary_format::largest_power_of_ten() + { + return 38; + } + + template<> + inline constexpr int binary_format::smallest_power_of_ten() + { + return -342; + } + template<> + inline constexpr int binary_format::smallest_power_of_ten() + { + return -65; + } + + template<> + inline constexpr size_t binary_format::max_digits() + { + return 769; + } + template<> + inline constexpr size_t binary_format::max_digits() + { + return 114; + } + + template<> + inline constexpr binary_format::equiv_uint binary_format::exponent_mask() + { + return 0x7F800000; + } + template<> + inline constexpr binary_format::equiv_uint binary_format::exponent_mask() + { + return 0x7FF0000000000000; + } + + template<> + inline constexpr binary_format::equiv_uint binary_format::mantissa_mask() + { + return 0x007FFFFF; + } + template<> + inline constexpr binary_format::equiv_uint binary_format::mantissa_mask() + { + return 0x000FFFFFFFFFFFFF; + } + + template<> + inline constexpr binary_format::equiv_uint binary_format::hidden_bit_mask() + { + return 0x00800000; + } + template<> + inline constexpr binary_format::equiv_uint binary_format::hidden_bit_mask() + { + return 0x0010000000000000; + } + + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void to_float( + bool negative, adjusted_mantissa am, T& value) + { + using fastfloat_uint = typename binary_format::equiv_uint; + fastfloat_uint word = (fastfloat_uint)am.mantissa; + word |= fastfloat_uint(am.power2) << binary_format::mantissa_explicit_bits(); + word |= fastfloat_uint(negative) << binary_format::sign_index(); #if FASTFLOAT_HAS_BIT_CAST - value = std::bit_cast(word); + value = std::bit_cast(word); #else - ::memcpy(&value, &word, sizeof(T)); -#endif -} - -#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default -template -struct space_lut { - static constexpr bool value[] = { - 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; -}; - -template -constexpr bool space_lut::value[]; - -inline constexpr bool is_space(uint8_t c) { return space_lut<>::value[c]; } -#endif - -template -static constexpr uint64_t int_cmp_zeros() -{ - static_assert((sizeof(UC) == 1) || (sizeof(UC) == 2) || (sizeof(UC) == 4), "Unsupported character size"); - return (sizeof(UC) == 1) ? 0x3030303030303030 : (sizeof(UC) == 2) ? (uint64_t(UC('0')) << 48 | uint64_t(UC('0')) << 32 | uint64_t(UC('0')) << 16 | UC('0')) : (uint64_t(UC('0')) << 32 | UC('0')); -} -template -static constexpr int int_cmp_len() -{ - return sizeof(uint64_t) / sizeof(UC); -} -template -static constexpr UC const * str_const_nan() -{ - return nullptr; -} -template<> -constexpr char const * str_const_nan() -{ - return "nan"; -} -template<> -constexpr wchar_t const * str_const_nan() -{ - return L"nan"; -} -template<> -constexpr char16_t const * str_const_nan() -{ - return u"nan"; -} -template<> -constexpr char32_t const * str_const_nan() -{ - return U"nan"; -} -template -static constexpr UC const * str_const_inf() -{ - return nullptr; -} -template<> -constexpr char const * str_const_inf() -{ - return "infinity"; -} -template<> -constexpr wchar_t const * str_const_inf() -{ - return L"infinity"; -} -template<> -constexpr char16_t const * str_const_inf() -{ - return u"infinity"; -} -template<> -constexpr char32_t const * str_const_inf() -{ - return U"infinity"; -} - - -template -struct int_luts { - static constexpr uint8_t chdigit[] = { - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 255, 255, 255, 255, 255, 255, - 255, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, - 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 255, 255, 255, 255, 255, - 255, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, - 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255 - }; - - static constexpr size_t maxdigits_u64[] = { - 64, 41, 32, 28, 25, 23, 22, 21, - 20, 19, 18, 18, 17, 17, 16, 16, - 16, 16, 15, 15, 15, 15, 14, 14, - 14, 14, 14, 14, 14, 13, 13, 13, - 13, 13, 13 - }; - - static constexpr uint64_t min_safe_u64[] = { - 9223372036854775808ull, 12157665459056928801ull, 4611686018427387904, 7450580596923828125, 4738381338321616896, - 3909821048582988049, 9223372036854775808ull, 12157665459056928801ull, 10000000000000000000ull, 5559917313492231481, - 2218611106740436992, 8650415919381337933, 2177953337809371136, 6568408355712890625, 1152921504606846976, - 2862423051509815793, 6746640616477458432, 15181127029874798299ull, 1638400000000000000, 3243919932521508681, - 6221821273427820544, 11592836324538749809ull, 876488338465357824, 1490116119384765625, 2481152873203736576, - 4052555153018976267, 6502111422497947648, 10260628712958602189ull, 15943230000000000000ull, 787662783788549761, - 1152921504606846976, 1667889514952984961, 2386420683693101056, 3379220508056640625, 4738381338321616896 - }; -}; - -template -constexpr uint8_t int_luts::chdigit[]; - -template -constexpr size_t int_luts::maxdigits_u64[]; - -template -constexpr uint64_t int_luts::min_safe_u64[]; - -template -fastfloat_really_inline -constexpr uint8_t ch_to_digit(UC c) { return int_luts<>::chdigit[static_cast(c)]; } - -fastfloat_really_inline -constexpr size_t max_digits_u64(int base) { return int_luts<>::maxdigits_u64[base - 2]; } - -// If a u64 is exactly max_digits_u64() in length, this is -// the value below which it has definitely overflowed. -fastfloat_really_inline -constexpr uint64_t min_safe_u64(int base) { return int_luts<>::min_safe_u64[base - 2]; } - -} // namespace fast_float + ::memcpy(&value, &word, sizeof(T)); +#endif + } + +#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default + template + struct space_lut + { + static constexpr bool value[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0}; + }; + + template + constexpr bool space_lut::value[]; + + inline constexpr bool is_space(uint8_t c) + { + return space_lut<>::value[c]; + } +#endif + + template + static constexpr uint64_t int_cmp_zeros() + { + static_assert((sizeof(UC) == 1) || (sizeof(UC) == 2) || (sizeof(UC) == 4), + "Unsupported character size"); + return (sizeof(UC) == 1) ? 0x3030303030303030 + : (sizeof(UC) == 2) ? (uint64_t(UC('0')) << 48 | uint64_t(UC('0')) << 32 + | uint64_t(UC('0')) << 16 | UC('0')) + : (uint64_t(UC('0')) << 32 | UC('0')); + } + template + static constexpr int int_cmp_len() + { + return sizeof(uint64_t) / sizeof(UC); + } + template + static constexpr UC const* str_const_nan() + { + return nullptr; + } + template<> + constexpr char const* str_const_nan() + { + return "nan"; + } + template<> + constexpr wchar_t const* str_const_nan() + { + return L"nan"; + } + template<> + constexpr char16_t const* str_const_nan() + { + return u"nan"; + } + template<> + constexpr char32_t const* str_const_nan() + { + return U"nan"; + } + template + static constexpr UC const* str_const_inf() + { + return nullptr; + } + template<> + constexpr char const* str_const_inf() + { + return "infinity"; + } + template<> + constexpr wchar_t const* str_const_inf() + { + return L"infinity"; + } + template<> + constexpr char16_t const* str_const_inf() + { + return u"infinity"; + } + template<> + constexpr char32_t const* str_const_inf() + { + return U"infinity"; + } + + + template + struct int_luts + { + static constexpr uint8_t chdigit[] = {255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 255, 255, 255, 255, 255, 255, 255, 10, 11, + 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, + 34, 35, 255, 255, 255, 255, 255, 255, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, + 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255}; + + static constexpr size_t maxdigits_u64[] = {64, 41, 32, 28, 25, 23, 22, 21, 20, 19, 18, 18, + 17, 17, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, + 13}; + + static constexpr uint64_t min_safe_u64[] = {9223372036854775808ull, 12157665459056928801ull, + 4611686018427387904, 7450580596923828125, 4738381338321616896, 3909821048582988049, + 9223372036854775808ull, 12157665459056928801ull, 10000000000000000000ull, + 5559917313492231481, 2218611106740436992, 8650415919381337933, 2177953337809371136, + 6568408355712890625, 1152921504606846976, 2862423051509815793, 6746640616477458432, + 15181127029874798299ull, 1638400000000000000, 3243919932521508681, 6221821273427820544, + 11592836324538749809ull, 876488338465357824, 1490116119384765625, 2481152873203736576, + 4052555153018976267, 6502111422497947648, 10260628712958602189ull, + 15943230000000000000ull, 787662783788549761, 1152921504606846976, 1667889514952984961, + 2386420683693101056, 3379220508056640625, 4738381338321616896}; + }; + + template + constexpr uint8_t int_luts::chdigit[]; + + template + constexpr size_t int_luts::maxdigits_u64[]; + + template + constexpr uint64_t int_luts::min_safe_u64[]; + + template + fastfloat_really_inline constexpr uint8_t ch_to_digit(UC c) + { + return int_luts<>::chdigit[static_cast(c)]; + } + + fastfloat_really_inline constexpr size_t max_digits_u64(int base) + { + return int_luts<>::maxdigits_u64[base - 2]; + } + + // If a u64 is exactly max_digits_u64() in length, this is + // the value below which it has definitely overflowed. + fastfloat_really_inline constexpr uint64_t min_safe_u64(int base) + { + return int_luts<>::min_safe_u64[base - 2]; + } + +} // namespace fast_float #endif @@ -902,47 +1017,52 @@ constexpr uint64_t min_safe_u64(int base) { return int_luts<>::min_safe_u64[base #define FASTFLOAT_FAST_FLOAT_H -namespace fast_float { -/** - * This function parses the character sequence [first,last) for a number. It parses floating-point numbers expecting - * a locale-indepent format equivalent to what is used by std::strtod in the default ("C") locale. - * The resulting floating-point value is the closest floating-point values (using either float or double), - * using the "round to even" convention for values that would otherwise fall right in-between two values. - * That is, we provide exact parsing according to the IEEE standard. - * - * Given a successful parse, the pointer (`ptr`) in the returned value is set to point right after the - * parsed number, and the `value` referenced is set to the parsed value. In case of error, the returned - * `ec` contains a representative error, otherwise the default (`std::errc()`) value is stored. - * - * The implementation does not throw and does not allocate memory (e.g., with `new` or `malloc`). - * - * Like the C++17 standard, the `fast_float::from_chars` functions take an optional last argument of - * the type `fast_float::chars_format`. It is a bitset value: we check whether - * `fmt & fast_float::chars_format::fixed` and `fmt & fast_float::chars_format::scientific` are set - * to determine whether we allow the fixed point and scientific notation respectively. - * The default is `fast_float::chars_format::general` which allows both `fixed` and `scientific`. - */ -template())> -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars(UC const * first, UC const * last, - T &value, chars_format fmt = chars_format::general) noexcept; - -/** - * Like from_chars, but accepts an `options` argument to govern number parsing. - */ -template -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars_advanced(UC const * first, UC const * last, - T &value, parse_options_t options) noexcept; -/** -* from_chars for integer types. -*/ -template ())> -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars(UC const * first, UC const * last, T& value, int base = 10) noexcept; - -} // namespace fast_float -#endif // FASTFLOAT_FAST_FLOAT_H +namespace fast_float +{ + /** + * This function parses the character sequence [first,last) for a number. It parses + * floating-point numbers expecting a locale-indepent format equivalent to what is used by + * std::strtod in the default ("C") locale. The resulting floating-point value is the closest + * floating-point values (using either float or double), using the "round to even" convention + * for values that would otherwise fall right in-between two values. That is, we provide exact + * parsing according to the IEEE standard. + * + * Given a successful parse, the pointer (`ptr`) in the returned value is set to point right + * after the parsed number, and the `value` referenced is set to the parsed value. In case of + * error, the returned `ec` contains a representative error, otherwise the default + * (`std::errc()`) value is stored. + * + * The implementation does not throw and does not allocate memory (e.g., with `new` or + * `malloc`). + * + * Like the C++17 standard, the `fast_float::from_chars` functions take an optional last + * argument of the type `fast_float::chars_format`. It is a bitset value: we check whether `fmt + * & fast_float::chars_format::fixed` and `fmt & fast_float::chars_format::scientific` are set + * to determine whether we allow the fixed point and scientific notation respectively. + * The default is `fast_float::chars_format::general` which allows both `fixed` and + * `scientific`. + */ + template())> + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars(UC const* first, UC const* last, + T& value, chars_format fmt = chars_format::general) noexcept; + + /** + * Like from_chars, but accepts an `options` argument to govern number parsing. + */ + template + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars_advanced( + UC const* first, UC const* last, T& value, parse_options_t options) noexcept; + /** + * from_chars for integer types. + */ + template())> + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars( + UC const* first, UC const* last, T& value, int base = 10) noexcept; + +} // namespace fast_float +#endif // FASTFLOAT_FAST_FLOAT_H #ifndef FASTFLOAT_ASCII_NUMBER_H #define FASTFLOAT_ASCII_NUMBER_H @@ -956,537 +1076,625 @@ from_chars_result_t from_chars(UC const * first, UC const * last, T& value, #ifdef FASTFLOAT_SSE2 -#include + #include #endif #ifdef FASTFLOAT_NEON -#include + #include #endif -namespace fast_float { +namespace fast_float +{ -template -fastfloat_really_inline constexpr bool has_simd_opt() { + template + fastfloat_really_inline constexpr bool has_simd_opt() + { #ifdef FASTFLOAT_HAS_SIMD - return std::is_same::value; + return std::is_same::value; #else - return false; -#endif -} - -// Next function can be micro-optimized, but compilers are entirely -// able to optimize it well. -template -fastfloat_really_inline constexpr bool is_integer(UC c) noexcept { - return !(c > UC('9') || c < UC('0')); -} - -fastfloat_really_inline constexpr uint64_t byteswap(uint64_t val) { - return (val & 0xFF00000000000000) >> 56 - | (val & 0x00FF000000000000) >> 40 - | (val & 0x0000FF0000000000) >> 24 - | (val & 0x000000FF00000000) >> 8 - | (val & 0x00000000FF000000) << 8 - | (val & 0x0000000000FF0000) << 24 - | (val & 0x000000000000FF00) << 40 - | (val & 0x00000000000000FF) << 56; -} - -// Read 8 UC into a u64. Truncates UC if not char. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t read8_to_u64(const UC *chars) { - if (cpp20_and_in_constexpr() || !std::is_same::value) { - uint64_t val = 0; - for(int i = 0; i < 8; ++i) { - val |= uint64_t(uint8_t(*chars)) << (i*8); - ++chars; - } - return val; - } - uint64_t val; - ::memcpy(&val, chars, sizeof(uint64_t)); + return false; +#endif + } + + // Next function can be micro-optimized, but compilers are entirely + // able to optimize it well. + template + fastfloat_really_inline constexpr bool is_integer(UC c) noexcept + { + return !(c > UC('9') || c < UC('0')); + } + + fastfloat_really_inline constexpr uint64_t byteswap(uint64_t val) + { + return (val & 0xFF00000000000000) >> 56 | (val & 0x00FF000000000000) >> 40 + | (val & 0x0000FF0000000000) >> 24 | (val & 0x000000FF00000000) >> 8 + | (val & 0x00000000FF000000) << 8 | (val & 0x0000000000FF0000) << 24 + | (val & 0x000000000000FF00) << 40 | (val & 0x00000000000000FF) << 56; + } + + // Read 8 UC into a u64. Truncates UC if not char. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t read8_to_u64(const UC* chars) + { + if (cpp20_and_in_constexpr() || !std::is_same::value) + { + uint64_t val = 0; + for (int i = 0; i < 8; ++i) + { + val |= uint64_t(uint8_t(*chars)) << (i * 8); + ++chars; + } + return val; + } + uint64_t val; + ::memcpy(&val, chars, sizeof(uint64_t)); #if FASTFLOAT_IS_BIG_ENDIAN == 1 - // Need to read as-if the number was in little-endian order. - val = byteswap(val); + // Need to read as-if the number was in little-endian order. + val = byteswap(val); #endif - return val; -} + return val; + } #ifdef FASTFLOAT_SSE2 -fastfloat_really_inline -uint64_t simd_read8_to_u64(const __m128i data) { -FASTFLOAT_SIMD_DISABLE_WARNINGS - const __m128i packed = _mm_packus_epi16(data, data); -#ifdef FASTFLOAT_64BIT - return uint64_t(_mm_cvtsi128_si64(packed)); -#else - uint64_t value; - // Visual Studio + older versions of GCC don't support _mm_storeu_si64 - _mm_storel_epi64(reinterpret_cast<__m128i*>(&value), packed); - return value; -#endif -FASTFLOAT_SIMD_RESTORE_WARNINGS -} - -fastfloat_really_inline -uint64_t simd_read8_to_u64(const char16_t* chars) { -FASTFLOAT_SIMD_DISABLE_WARNINGS - return simd_read8_to_u64(_mm_loadu_si128(reinterpret_cast(chars))); -FASTFLOAT_SIMD_RESTORE_WARNINGS -} + fastfloat_really_inline uint64_t simd_read8_to_u64(const __m128i data) + { + FASTFLOAT_SIMD_DISABLE_WARNINGS + const __m128i packed = _mm_packus_epi16(data, data); + #ifdef FASTFLOAT_64BIT + return uint64_t(_mm_cvtsi128_si64(packed)); + #else + uint64_t value; + // Visual Studio + older versions of GCC don't support _mm_storeu_si64 + _mm_storel_epi64(reinterpret_cast<__m128i*>(&value), packed); + return value; + #endif + FASTFLOAT_SIMD_RESTORE_WARNINGS + } + + fastfloat_really_inline uint64_t simd_read8_to_u64(const char16_t* chars) + { + FASTFLOAT_SIMD_DISABLE_WARNINGS + return simd_read8_to_u64(_mm_loadu_si128(reinterpret_cast(chars))); + FASTFLOAT_SIMD_RESTORE_WARNINGS + } #elif defined(FASTFLOAT_NEON) -fastfloat_really_inline -uint64_t simd_read8_to_u64(const uint16x8_t data) { -FASTFLOAT_SIMD_DISABLE_WARNINGS - uint8x8_t utf8_packed = vmovn_u16(data); - return vget_lane_u64(vreinterpret_u64_u8(utf8_packed), 0); -FASTFLOAT_SIMD_RESTORE_WARNINGS -} + fastfloat_really_inline uint64_t simd_read8_to_u64(const uint16x8_t data) + { + FASTFLOAT_SIMD_DISABLE_WARNINGS + uint8x8_t utf8_packed = vmovn_u16(data); + return vget_lane_u64(vreinterpret_u64_u8(utf8_packed), 0); + FASTFLOAT_SIMD_RESTORE_WARNINGS + } -fastfloat_really_inline -uint64_t simd_read8_to_u64(const char16_t* chars) { -FASTFLOAT_SIMD_DISABLE_WARNINGS - return simd_read8_to_u64(vld1q_u16(reinterpret_cast(chars))); -FASTFLOAT_SIMD_RESTORE_WARNINGS -} + fastfloat_really_inline uint64_t simd_read8_to_u64(const char16_t* chars) + { + FASTFLOAT_SIMD_DISABLE_WARNINGS + return simd_read8_to_u64(vld1q_u16(reinterpret_cast(chars))); + FASTFLOAT_SIMD_RESTORE_WARNINGS + } -#endif // FASTFLOAT_SSE2 +#endif // FASTFLOAT_SSE2 // MSVC SFINAE is broken pre-VS2017 #if defined(_MSC_VER) && _MSC_VER <= 1900 -template + template #else -template ()) = 0> -#endif -// dummy for compile -uint64_t simd_read8_to_u64(UC const*) { - return 0; -} - - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void write_u64(uint8_t *chars, uint64_t val) { - if (cpp20_and_in_constexpr()) { - for(int i = 0; i < 8; ++i) { - *chars = uint8_t(val); - val >>= 8; - ++chars; - } - return; - } + template()) = 0> +#endif + // dummy for compile + uint64_t simd_read8_to_u64(UC const*) + { + return 0; + } + + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void write_u64(uint8_t* chars, uint64_t val) + { + if (cpp20_and_in_constexpr()) + { + for (int i = 0; i < 8; ++i) + { + *chars = uint8_t(val); + val >>= 8; + ++chars; + } + return; + } #if FASTFLOAT_IS_BIG_ENDIAN == 1 - // Need to read as-if the number was in little-endian order. - val = byteswap(val); -#endif - ::memcpy(chars, &val, sizeof(uint64_t)); -} - -// credit @aqrit -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -uint32_t parse_eight_digits_unrolled(uint64_t val) { - const uint64_t mask = 0x000000FF000000FF; - const uint64_t mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32) - const uint64_t mul2 = 0x0000271000000001; // 1 + (10000ULL << 32) - val -= 0x3030303030303030; - val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8; - val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32; - return uint32_t(val); -} - - -// Call this if chars are definitely 8 digits. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint32_t parse_eight_digits_unrolled(UC const * chars) noexcept { - if (cpp20_and_in_constexpr() || !has_simd_opt()) { - return parse_eight_digits_unrolled(read8_to_u64(chars)); // truncation okay - } - return parse_eight_digits_unrolled(simd_read8_to_u64(chars)); -} - - -// credit @aqrit -fastfloat_really_inline constexpr bool is_made_of_eight_digits_fast(uint64_t val) noexcept { - return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) & - 0x8080808080808080)); -} + // Need to read as-if the number was in little-endian order. + val = byteswap(val); +#endif + ::memcpy(chars, &val, sizeof(uint64_t)); + } + + // credit @aqrit + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 uint32_t parse_eight_digits_unrolled(uint64_t val) + { + const uint64_t mask = 0x000000FF000000FF; + const uint64_t mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32) + const uint64_t mul2 = 0x0000271000000001; // 1 + (10000ULL << 32) + val -= 0x3030303030303030; + val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8; + val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32; + return uint32_t(val); + } + + + // Call this if chars are definitely 8 digits. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint32_t parse_eight_digits_unrolled( + UC const* chars) noexcept + { + if (cpp20_and_in_constexpr() || !has_simd_opt()) + { + return parse_eight_digits_unrolled(read8_to_u64(chars)); // truncation okay + } + return parse_eight_digits_unrolled(simd_read8_to_u64(chars)); + } + + + // credit @aqrit + fastfloat_really_inline constexpr bool is_made_of_eight_digits_fast(uint64_t val) noexcept + { + return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) & 0x8080808080808080)); + } #ifdef FASTFLOAT_HAS_SIMD -// Call this if chars might not be 8 digits. -// Using this style (instead of is_made_of_eight_digits_fast() then parse_eight_digits_unrolled()) -// ensures we don't load SIMD registers twice. -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -bool simd_parse_if_eight_digits_unrolled(const char16_t* chars, uint64_t& i) noexcept { - if (cpp20_and_in_constexpr()) { - return false; - } -#ifdef FASTFLOAT_SSE2 -FASTFLOAT_SIMD_DISABLE_WARNINGS - const __m128i data = _mm_loadu_si128(reinterpret_cast(chars)); - - // (x - '0') <= 9 - // http://0x80.pl/articles/simd-parsing-int-sequences.html - const __m128i t0 = _mm_add_epi16(data, _mm_set1_epi16(32720)); - const __m128i t1 = _mm_cmpgt_epi16(t0, _mm_set1_epi16(-32759)); - - if (_mm_movemask_epi8(t1) == 0) { - i = i * 100000000 + parse_eight_digits_unrolled(simd_read8_to_u64(data)); - return true; - } - else return false; -FASTFLOAT_SIMD_RESTORE_WARNINGS -#elif defined(FASTFLOAT_NEON) -FASTFLOAT_SIMD_DISABLE_WARNINGS - const uint16x8_t data = vld1q_u16(reinterpret_cast(chars)); - - // (x - '0') <= 9 - // http://0x80.pl/articles/simd-parsing-int-sequences.html - const uint16x8_t t0 = vsubq_u16(data, vmovq_n_u16('0')); - const uint16x8_t mask = vcltq_u16(t0, vmovq_n_u16('9' - '0' + 1)); - - if (vminvq_u16(mask) == 0xFFFF) { - i = i * 100000000 + parse_eight_digits_unrolled(simd_read8_to_u64(data)); - return true; - } - else return false; -FASTFLOAT_SIMD_RESTORE_WARNINGS -#else - (void)chars; (void)i; - return false; -#endif // FASTFLOAT_SSE2 -} - -#endif // FASTFLOAT_HAS_SIMD + // Call this if chars might not be 8 digits. + // Using this style (instead of is_made_of_eight_digits_fast() then + // parse_eight_digits_unrolled()) ensures we don't load SIMD registers twice. + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 bool simd_parse_if_eight_digits_unrolled( + const char16_t* chars, uint64_t& i) noexcept + { + if (cpp20_and_in_constexpr()) + { + return false; + } + #ifdef FASTFLOAT_SSE2 + FASTFLOAT_SIMD_DISABLE_WARNINGS + const __m128i data = _mm_loadu_si128(reinterpret_cast(chars)); + + // (x - '0') <= 9 + // http://0x80.pl/articles/simd-parsing-int-sequences.html + const __m128i t0 = _mm_add_epi16(data, _mm_set1_epi16(32720)); + const __m128i t1 = _mm_cmpgt_epi16(t0, _mm_set1_epi16(-32759)); + + if (_mm_movemask_epi8(t1) == 0) + { + i = i * 100000000 + parse_eight_digits_unrolled(simd_read8_to_u64(data)); + return true; + } + else + return false; + FASTFLOAT_SIMD_RESTORE_WARNINGS + #elif defined(FASTFLOAT_NEON) + FASTFLOAT_SIMD_DISABLE_WARNINGS + const uint16x8_t data = vld1q_u16(reinterpret_cast(chars)); + + // (x - '0') <= 9 + // http://0x80.pl/articles/simd-parsing-int-sequences.html + const uint16x8_t t0 = vsubq_u16(data, vmovq_n_u16('0')); + const uint16x8_t mask = vcltq_u16(t0, vmovq_n_u16('9' - '0' + 1)); + + if (vminvq_u16(mask) == 0xFFFF) + { + i = i * 100000000 + parse_eight_digits_unrolled(simd_read8_to_u64(data)); + return true; + } + else + return false; + FASTFLOAT_SIMD_RESTORE_WARNINGS + #else + (void)chars; + (void)i; + return false; + #endif // FASTFLOAT_SSE2 + } + +#endif // FASTFLOAT_HAS_SIMD // MSVC SFINAE is broken pre-VS2017 #if defined(_MSC_VER) && _MSC_VER <= 1900 -template + template #else -template ()) = 0> -#endif -// dummy for compile -bool simd_parse_if_eight_digits_unrolled(UC const*, uint64_t&) { - return 0; -} - - -template ::value) = 0> -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void loop_parse_if_eight_digits(const UC*& p, const UC* const pend, uint64_t& i) { - if (!has_simd_opt()) { - return; - } - while ((std::distance(p, pend) >= 8) && simd_parse_if_eight_digits_unrolled(p, i)) { // in rare cases, this will overflow, but that's ok - p += 8; - } -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void loop_parse_if_eight_digits(const char*& p, const char* const pend, uint64_t& i) { - // optimizes better than parse_if_eight_digits_unrolled() for UC = char. - while ((std::distance(p, pend) >= 8) && is_made_of_eight_digits_fast(read8_to_u64(p))) { - i = i * 100000000 + parse_eight_digits_unrolled(read8_to_u64(p)); // in rare cases, this will overflow, but that's ok - p += 8; - } -} - -template -struct parsed_number_string_t { - int64_t exponent{0}; - uint64_t mantissa{0}; - UC const * lastmatch{nullptr}; - bool negative{false}; - bool valid{false}; - bool too_many_digits{false}; - // contains the range of the significant digits - span integer{}; // non-nullable - span fraction{}; // nullable -}; - -using byte_span = span; -using parsed_number_string = parsed_number_string_t; - -// Assuming that you use no more than 19 digits, this will -// parse an ASCII string. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -parsed_number_string_t parse_number_string(UC const *p, UC const * pend, parse_options_t options) noexcept { - chars_format const fmt = options.format; - UC const decimal_point = options.decimal_point; - - parsed_number_string_t answer; - answer.valid = false; - answer.too_many_digits = false; - answer.negative = (*p == UC('-')); -#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default - if ((*p == UC('-')) || (!(fmt & FASTFLOAT_JSONFMT) && *p == UC('+'))) { + template()) = 0> +#endif + // dummy for compile + bool simd_parse_if_eight_digits_unrolled(UC const*, uint64_t&) + { + return 0; + } + + + template::value) = 0> + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void loop_parse_if_eight_digits( + const UC*& p, const UC* const pend, uint64_t& i) + { + if (!has_simd_opt()) + { + return; + } + while ((std::distance(p, pend) >= 8) && simd_parse_if_eight_digits_unrolled(p, i)) + { // in rare cases, this will overflow, but that's ok + p += 8; + } + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void loop_parse_if_eight_digits( + const char*& p, const char* const pend, uint64_t& i) + { + // optimizes better than parse_if_eight_digits_unrolled() for UC = char. + while ((std::distance(p, pend) >= 8) && is_made_of_eight_digits_fast(read8_to_u64(p))) + { + i = i * 100000000 + + parse_eight_digits_unrolled( + read8_to_u64(p)); // in rare cases, this will overflow, but that's ok + p += 8; + } + } + + template + struct parsed_number_string_t + { + int64_t exponent{0}; + uint64_t mantissa{0}; + UC const* lastmatch{nullptr}; + bool negative{false}; + bool valid{false}; + bool too_many_digits{false}; + // contains the range of the significant digits + span integer{}; // non-nullable + span fraction{}; // nullable + }; + + using byte_span = span; + using parsed_number_string = parsed_number_string_t; + + // Assuming that you use no more than 19 digits, this will + // parse an ASCII string. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 parsed_number_string_t parse_number_string( + UC const* p, UC const* pend, parse_options_t options) noexcept + { + chars_format const fmt = options.format; + UC const decimal_point = options.decimal_point; + + parsed_number_string_t answer; + answer.valid = false; + answer.too_many_digits = false; + answer.negative = (*p == UC('-')); +#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default + if ((*p == UC('-')) || (!(fmt & FASTFLOAT_JSONFMT) && *p == UC('+'))) + { #else - if (*p == UC('-')) { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here -#endif - ++p; - if (p == pend) { - return answer; - } - if (fmt & FASTFLOAT_JSONFMT) { - if (!is_integer(*p)) { // a sign must be followed by an integer - return answer; - } - } else { - if (!is_integer(*p) && (*p != decimal_point)) { // a sign must be followed by an integer or the dot - return answer; - } - } - } - UC const * const start_digits = p; - - uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad) - - while ((p != pend) && is_integer(*p)) { - // a multiplication by 10 is cheaper than an arbitrary integer - // multiplication - i = 10 * i + - uint64_t(*p - UC('0')); // might overflow, we will handle the overflow later - ++p; - } - UC const * const end_of_integer_part = p; - int64_t digit_count = int64_t(end_of_integer_part - start_digits); - answer.integer = span(start_digits, size_t(digit_count)); - if (fmt & FASTFLOAT_JSONFMT) { - // at least 1 digit in integer part, without leading zeros - if (digit_count == 0 || (start_digits[0] == UC('0') && digit_count > 1)) { - return answer; - } - } - - int64_t exponent = 0; - const bool has_decimal_point = (p != pend) && (*p == decimal_point); - if (has_decimal_point) { - ++p; - UC const * before = p; - // can occur at most twice without overflowing, but let it occur more, since - // for integers with many digits, digit parsing is the primary bottleneck. - loop_parse_if_eight_digits(p, pend, i); - - while ((p != pend) && is_integer(*p)) { - uint8_t digit = uint8_t(*p - UC('0')); - ++p; - i = i * 10 + digit; // in rare cases, this will overflow, but that's ok - } - exponent = before - p; - answer.fraction = span(before, size_t(p - before)); - digit_count -= exponent; - } - if (fmt & FASTFLOAT_JSONFMT) { - // at least 1 digit in fractional part - if (has_decimal_point && exponent == 0) { - return answer; - } - } - else if (digit_count == 0) { // we must have encountered at least one integer! - return answer; - } - int64_t exp_number = 0; // explicit exponential part - if ( ((fmt & chars_format::scientific) && - (p != pend) && - ((UC('e') == *p) || (UC('E') == *p))) - || - ((fmt & FASTFLOAT_FORTRANFMT) && - (p != pend) && - ((UC('+') == *p) || (UC('-') == *p) || (UC('d') == *p) || (UC('D') == *p)))) { - UC const * location_of_e = p; - if ((UC('e') == *p) || (UC('E') == *p) || (UC('d') == *p) || (UC('D') == *p)) { - ++p; - } - bool neg_exp = false; - if ((p != pend) && (UC('-') == *p)) { - neg_exp = true; - ++p; - } else if ((p != pend) && (UC('+') == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1) - ++p; - } - if ((p == pend) || !is_integer(*p)) { - if(!(fmt & chars_format::fixed)) { - // We are in error. - return answer; - } - // Otherwise, we will be ignoring the 'e'. - p = location_of_e; - } else { - while ((p != pend) && is_integer(*p)) { - uint8_t digit = uint8_t(*p - UC('0')); - if (exp_number < 0x10000000) { - exp_number = 10 * exp_number + digit; - } - ++p; - } - if(neg_exp) { exp_number = - exp_number; } - exponent += exp_number; - } - } else { - // If it scientific and not fixed, we have to bail out. - if((fmt & chars_format::scientific) && !(fmt & chars_format::fixed)) { return answer; } - } - answer.lastmatch = p; - answer.valid = true; - - // If we frequently had to deal with long strings of digits, - // we could extend our code by using a 128-bit integer instead - // of a 64-bit integer. However, this is uncommon. - // - // We can deal with up to 19 digits. - if (digit_count > 19) { // this is uncommon - // It is possible that the integer had an overflow. - // We have to handle the case where we have 0.0000somenumber. - // We need to be mindful of the case where we only have zeroes... - // E.g., 0.000000000...000. - UC const * start = start_digits; - while ((start != pend) && (*start == UC('0') || *start == decimal_point)) { - if(*start == UC('0')) { digit_count --; } - start++; - } - - if (digit_count > 19) { - answer.too_many_digits = true; - // Let us start again, this time, avoiding overflows. - // We don't need to check if is_integer, since we use the - // pre-tokenized spans from above. - i = 0; - p = answer.integer.ptr; - UC const* int_end = p + answer.integer.len(); - const uint64_t minimal_nineteen_digit_integer{ 1000000000000000000 }; - while ((i < minimal_nineteen_digit_integer) && (p != int_end)) { - i = i * 10 + uint64_t(*p - UC('0')); - ++p; - } - if (i >= minimal_nineteen_digit_integer) { // We have a big integers - exponent = end_of_integer_part - p + exp_number; - } - else { // We have a value with a fractional component. - p = answer.fraction.ptr; - UC const* frac_end = p + answer.fraction.len(); - while ((i < minimal_nineteen_digit_integer) && (p != frac_end)) { - i = i * 10 + uint64_t(*p - UC('0')); - ++p; - } - exponent = answer.fraction.ptr - p + exp_number; - } - // We have now corrected both exponent and i, to a truncated value - } - } - answer.exponent = exponent; - answer.mantissa = i; - return answer; -} - -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -from_chars_result_t parse_int_string(UC const* p, UC const* pend, T& value, int base) { - from_chars_result_t answer; - - UC const* const first = p; - - bool negative = (*p == UC('-')); - if (!std::is_signed::value && negative) { - answer.ec = std::errc::invalid_argument; - answer.ptr = first; - return answer; - } -#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default - if ((*p == UC('-')) || (*p == UC('+'))) { + if (*p == UC('-')) + { // C++17 20.19.3.(7.1) explicitly forbids '+' sign here +#endif + ++p; + if (p == pend) + { + return answer; + } + if (fmt & FASTFLOAT_JSONFMT) + { + if (!is_integer(*p)) + { // a sign must be followed by an integer + return answer; + } + } + else + { + if (!is_integer(*p) && (*p != decimal_point)) + { // a sign must be followed by an integer or the dot + return answer; + } + } + } + UC const* const start_digits = p; + + uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad) + + while ((p != pend) && is_integer(*p)) + { + // a multiplication by 10 is cheaper than an arbitrary integer + // multiplication + i = 10 * i + + uint64_t(*p - UC('0')); // might overflow, we will handle the overflow later + ++p; + } + UC const* const end_of_integer_part = p; + int64_t digit_count = int64_t(end_of_integer_part - start_digits); + answer.integer = span(start_digits, size_t(digit_count)); + if (fmt & FASTFLOAT_JSONFMT) + { + // at least 1 digit in integer part, without leading zeros + if (digit_count == 0 || (start_digits[0] == UC('0') && digit_count > 1)) + { + return answer; + } + } + + int64_t exponent = 0; + const bool has_decimal_point = (p != pend) && (*p == decimal_point); + if (has_decimal_point) + { + ++p; + UC const* before = p; + // can occur at most twice without overflowing, but let it occur more, since + // for integers with many digits, digit parsing is the primary bottleneck. + loop_parse_if_eight_digits(p, pend, i); + + while ((p != pend) && is_integer(*p)) + { + uint8_t digit = uint8_t(*p - UC('0')); + ++p; + i = i * 10 + digit; // in rare cases, this will overflow, but that's ok + } + exponent = before - p; + answer.fraction = span(before, size_t(p - before)); + digit_count -= exponent; + } + if (fmt & FASTFLOAT_JSONFMT) + { + // at least 1 digit in fractional part + if (has_decimal_point && exponent == 0) + { + return answer; + } + } + else if (digit_count == 0) + { // we must have encountered at least one integer! + return answer; + } + int64_t exp_number = 0; // explicit exponential part + if (((fmt & chars_format::scientific) && (p != pend) + && ((UC('e') == *p) || (UC('E') == *p))) + || ((fmt & FASTFLOAT_FORTRANFMT) && (p != pend) + && ((UC('+') == *p) || (UC('-') == *p) || (UC('d') == *p) || (UC('D') == *p)))) + { + UC const* location_of_e = p; + if ((UC('e') == *p) || (UC('E') == *p) || (UC('d') == *p) || (UC('D') == *p)) + { + ++p; + } + bool neg_exp = false; + if ((p != pend) && (UC('-') == *p)) + { + neg_exp = true; + ++p; + } + else if ((p != pend) && (UC('+') == *p)) + { // '+' on exponent is allowed by C++17 20.19.3.(7.1) + ++p; + } + if ((p == pend) || !is_integer(*p)) + { + if (!(fmt & chars_format::fixed)) + { + // We are in error. + return answer; + } + // Otherwise, we will be ignoring the 'e'. + p = location_of_e; + } + else + { + while ((p != pend) && is_integer(*p)) + { + uint8_t digit = uint8_t(*p - UC('0')); + if (exp_number < 0x10000000) + { + exp_number = 10 * exp_number + digit; + } + ++p; + } + if (neg_exp) + { + exp_number = -exp_number; + } + exponent += exp_number; + } + } + else + { + // If it scientific and not fixed, we have to bail out. + if ((fmt & chars_format::scientific) && !(fmt & chars_format::fixed)) + { + return answer; + } + } + answer.lastmatch = p; + answer.valid = true; + + // If we frequently had to deal with long strings of digits, + // we could extend our code by using a 128-bit integer instead + // of a 64-bit integer. However, this is uncommon. + // + // We can deal with up to 19 digits. + if (digit_count > 19) + { // this is uncommon + // It is possible that the integer had an overflow. + // We have to handle the case where we have 0.0000somenumber. + // We need to be mindful of the case where we only have zeroes... + // E.g., 0.000000000...000. + UC const* start = start_digits; + while ((start != pend) && (*start == UC('0') || *start == decimal_point)) + { + if (*start == UC('0')) + { + digit_count--; + } + start++; + } + + if (digit_count > 19) + { + answer.too_many_digits = true; + // Let us start again, this time, avoiding overflows. + // We don't need to check if is_integer, since we use the + // pre-tokenized spans from above. + i = 0; + p = answer.integer.ptr; + UC const* int_end = p + answer.integer.len(); + const uint64_t minimal_nineteen_digit_integer{1000000000000000000}; + while ((i < minimal_nineteen_digit_integer) && (p != int_end)) + { + i = i * 10 + uint64_t(*p - UC('0')); + ++p; + } + if (i >= minimal_nineteen_digit_integer) + { // We have a big integers + exponent = end_of_integer_part - p + exp_number; + } + else + { // We have a value with a fractional component. + p = answer.fraction.ptr; + UC const* frac_end = p + answer.fraction.len(); + while ((i < minimal_nineteen_digit_integer) && (p != frac_end)) + { + i = i * 10 + uint64_t(*p - UC('0')); + ++p; + } + exponent = answer.fraction.ptr - p + exp_number; + } + // We have now corrected both exponent and i, to a truncated value + } + } + answer.exponent = exponent; + answer.mantissa = i; + return answer; + } + + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 from_chars_result_t parse_int_string( + UC const* p, UC const* pend, T& value, int base) + { + from_chars_result_t answer; + + UC const* const first = p; + + bool negative = (*p == UC('-')); + if (!std::is_signed::value && negative) + { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + return answer; + } +#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default + if ((*p == UC('-')) || (*p == UC('+'))) + { #else - if (*p == UC('-')) { -#endif - ++p; - } - - UC const* const start_num = p; - - while (p!= pend && *p == UC('0')) { - ++p; - } - - const bool has_leading_zeros = p > start_num; - - UC const* const start_digits = p; - - uint64_t i = 0; - if (base == 10) { - loop_parse_if_eight_digits(p, pend, i); // use SIMD if possible - } - while (p != pend) { - uint8_t digit = ch_to_digit(*p); - if (digit >= base) { - break; - } - i = uint64_t(base) * i + digit; // might overflow, check this later - p++; - } - - size_t digit_count = size_t(p - start_digits); - - if (digit_count == 0) { - if (has_leading_zeros) { - value = 0; - answer.ec = std::errc(); - answer.ptr = p; - } - else { - answer.ec = std::errc::invalid_argument; - answer.ptr = first; - } - return answer; - } - - answer.ptr = p; - - // check u64 overflow - size_t max_digits = max_digits_u64(base); - if (digit_count > max_digits) { - answer.ec = std::errc::result_out_of_range; - return answer; - } - // this check can be eliminated for all other types, but they will all require a max_digits(base) equivalent - if (digit_count == max_digits && i < min_safe_u64(base)) { - answer.ec = std::errc::result_out_of_range; - return answer; - } - - // check other types overflow - if (!std::is_same::value) { - if (i > uint64_t(std::numeric_limits::max()) + uint64_t(negative)) { - answer.ec = std::errc::result_out_of_range; - return answer; - } - } - - if (negative) { + if (*p == UC('-')) + { +#endif + ++p; + } + + UC const* const start_num = p; + + while (p != pend && *p == UC('0')) + { + ++p; + } + + const bool has_leading_zeros = p > start_num; + + UC const* const start_digits = p; + + uint64_t i = 0; + if (base == 10) + { + loop_parse_if_eight_digits(p, pend, i); // use SIMD if possible + } + while (p != pend) + { + uint8_t digit = ch_to_digit(*p); + if (digit >= base) + { + break; + } + i = uint64_t(base) * i + digit; // might overflow, check this later + p++; + } + + size_t digit_count = size_t(p - start_digits); + + if (digit_count == 0) + { + if (has_leading_zeros) + { + value = 0; + answer.ec = std::errc(); + answer.ptr = p; + } + else + { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + } + return answer; + } + + answer.ptr = p; + + // check u64 overflow + size_t max_digits = max_digits_u64(base); + if (digit_count > max_digits) + { + answer.ec = std::errc::result_out_of_range; + return answer; + } + // this check can be eliminated for all other types, but they will all require a + // max_digits(base) equivalent + if (digit_count == max_digits && i < min_safe_u64(base)) + { + answer.ec = std::errc::result_out_of_range; + return answer; + } + + // check other types overflow + if (!std::is_same::value) + { + if (i > uint64_t(std::numeric_limits::max()) + uint64_t(negative)) + { + answer.ec = std::errc::result_out_of_range; + return answer; + } + } + + if (negative) + { #ifdef FASTFLOAT_VISUAL_STUDIO -#pragma warning(push) -#pragma warning(disable: 4146) -#endif - // this weird workaround is required because: - // - converting unsigned to signed when its value is greater than signed max is UB pre-C++23. - // - reinterpret_casting (~i + 1) would work, but it is not constexpr - // this is always optimized into a neg instruction (note: T is an integer type) - value = T(-std::numeric_limits::max() - T(i - uint64_t(std::numeric_limits::max()))); + #pragma warning(push) + #pragma warning(disable:4146) +#endif + // this weird workaround is required because: + // - converting unsigned to signed when its value is greater than signed max is UB + // pre-C++23. + // - reinterpret_casting (~i + 1) would work, but it is not constexpr + // this is always optimized into a neg instruction (note: T is an integer type) + value = + T(-std::numeric_limits::max() - T(i - uint64_t(std::numeric_limits::max()))); #ifdef FASTFLOAT_VISUAL_STUDIO -#pragma warning(pop) + #pragma warning(pop) #endif - } - else { value = T(i); } + } + else + { + value = T(i); + } - answer.ec = std::errc(); - return answer; -} + answer.ec = std::errc(); + return answer; + } -} // namespace fast_float +} // namespace fast_float #endif @@ -1495,699 +1703,1354 @@ from_chars_result_t parse_int_string(UC const* p, UC const* pend, T& value, #include -namespace fast_float { - -/** - * When mapping numbers from decimal to binary, - * we go from w * 10^q to m * 2^p but we have - * 10^q = 5^q * 2^q, so effectively - * we are trying to match - * w * 2^q * 5^q to m * 2^p. Thus the powers of two - * are not a concern since they can be represented - * exactly using the binary notation, only the powers of five - * affect the binary significand. - */ - -/** - * The smallest non-zero float (binary64) is 2^-1074. - * We take as input numbers of the form w x 10^q where w < 2^64. - * We have that w * 10^-343 < 2^(64-344) 5^-343 < 2^-1076. - * However, we have that - * (2^64-1) * 10^-342 = (2^64-1) * 2^-342 * 5^-342 > 2^-1074. - * Thus it is possible for a number of the form w * 10^-342 where - * w is a 64-bit value to be a non-zero floating-point number. - ********* - * Any number of form w * 10^309 where w>= 1 is going to be - * infinite in binary64 so we never need to worry about powers - * of 5 greater than 308. - */ -template -struct powers_template { - -constexpr static int smallest_power_of_five = binary_format::smallest_power_of_ten(); -constexpr static int largest_power_of_five = binary_format::largest_power_of_ten(); -constexpr static int number_of_entries = 2 * (largest_power_of_five - smallest_power_of_five + 1); -// Powers of five from 5^-342 all the way to 5^308 rounded toward one. -constexpr static uint64_t power_of_five_128[number_of_entries] = { - 0xeef453d6923bd65a,0x113faa2906a13b3f, - 0x9558b4661b6565f8,0x4ac7ca59a424c507, - 0xbaaee17fa23ebf76,0x5d79bcf00d2df649, - 0xe95a99df8ace6f53,0xf4d82c2c107973dc, - 0x91d8a02bb6c10594,0x79071b9b8a4be869, - 0xb64ec836a47146f9,0x9748e2826cdee284, - 0xe3e27a444d8d98b7,0xfd1b1b2308169b25, - 0x8e6d8c6ab0787f72,0xfe30f0f5e50e20f7, - 0xb208ef855c969f4f,0xbdbd2d335e51a935, - 0xde8b2b66b3bc4723,0xad2c788035e61382, - 0x8b16fb203055ac76,0x4c3bcb5021afcc31, - 0xaddcb9e83c6b1793,0xdf4abe242a1bbf3d, - 0xd953e8624b85dd78,0xd71d6dad34a2af0d, - 0x87d4713d6f33aa6b,0x8672648c40e5ad68, - 0xa9c98d8ccb009506,0x680efdaf511f18c2, - 0xd43bf0effdc0ba48,0x212bd1b2566def2, - 0x84a57695fe98746d,0x14bb630f7604b57, - 0xa5ced43b7e3e9188,0x419ea3bd35385e2d, - 0xcf42894a5dce35ea,0x52064cac828675b9, - 0x818995ce7aa0e1b2,0x7343efebd1940993, - 0xa1ebfb4219491a1f,0x1014ebe6c5f90bf8, - 0xca66fa129f9b60a6,0xd41a26e077774ef6, - 0xfd00b897478238d0,0x8920b098955522b4, - 0x9e20735e8cb16382,0x55b46e5f5d5535b0, - 0xc5a890362fddbc62,0xeb2189f734aa831d, - 0xf712b443bbd52b7b,0xa5e9ec7501d523e4, - 0x9a6bb0aa55653b2d,0x47b233c92125366e, - 0xc1069cd4eabe89f8,0x999ec0bb696e840a, - 0xf148440a256e2c76,0xc00670ea43ca250d, - 0x96cd2a865764dbca,0x380406926a5e5728, - 0xbc807527ed3e12bc,0xc605083704f5ecf2, - 0xeba09271e88d976b,0xf7864a44c633682e, - 0x93445b8731587ea3,0x7ab3ee6afbe0211d, - 0xb8157268fdae9e4c,0x5960ea05bad82964, - 0xe61acf033d1a45df,0x6fb92487298e33bd, - 0x8fd0c16206306bab,0xa5d3b6d479f8e056, - 0xb3c4f1ba87bc8696,0x8f48a4899877186c, - 0xe0b62e2929aba83c,0x331acdabfe94de87, - 0x8c71dcd9ba0b4925,0x9ff0c08b7f1d0b14, - 0xaf8e5410288e1b6f,0x7ecf0ae5ee44dd9, - 0xdb71e91432b1a24a,0xc9e82cd9f69d6150, - 0x892731ac9faf056e,0xbe311c083a225cd2, - 0xab70fe17c79ac6ca,0x6dbd630a48aaf406, - 0xd64d3d9db981787d,0x92cbbccdad5b108, - 0x85f0468293f0eb4e,0x25bbf56008c58ea5, - 0xa76c582338ed2621,0xaf2af2b80af6f24e, - 0xd1476e2c07286faa,0x1af5af660db4aee1, - 0x82cca4db847945ca,0x50d98d9fc890ed4d, - 0xa37fce126597973c,0xe50ff107bab528a0, - 0xcc5fc196fefd7d0c,0x1e53ed49a96272c8, - 0xff77b1fcbebcdc4f,0x25e8e89c13bb0f7a, - 0x9faacf3df73609b1,0x77b191618c54e9ac, - 0xc795830d75038c1d,0xd59df5b9ef6a2417, - 0xf97ae3d0d2446f25,0x4b0573286b44ad1d, - 0x9becce62836ac577,0x4ee367f9430aec32, - 0xc2e801fb244576d5,0x229c41f793cda73f, - 0xf3a20279ed56d48a,0x6b43527578c1110f, - 0x9845418c345644d6,0x830a13896b78aaa9, - 0xbe5691ef416bd60c,0x23cc986bc656d553, - 0xedec366b11c6cb8f,0x2cbfbe86b7ec8aa8, - 0x94b3a202eb1c3f39,0x7bf7d71432f3d6a9, - 0xb9e08a83a5e34f07,0xdaf5ccd93fb0cc53, - 0xe858ad248f5c22c9,0xd1b3400f8f9cff68, - 0x91376c36d99995be,0x23100809b9c21fa1, - 0xb58547448ffffb2d,0xabd40a0c2832a78a, - 0xe2e69915b3fff9f9,0x16c90c8f323f516c, - 0x8dd01fad907ffc3b,0xae3da7d97f6792e3, - 0xb1442798f49ffb4a,0x99cd11cfdf41779c, - 0xdd95317f31c7fa1d,0x40405643d711d583, - 0x8a7d3eef7f1cfc52,0x482835ea666b2572, - 0xad1c8eab5ee43b66,0xda3243650005eecf, - 0xd863b256369d4a40,0x90bed43e40076a82, - 0x873e4f75e2224e68,0x5a7744a6e804a291, - 0xa90de3535aaae202,0x711515d0a205cb36, - 0xd3515c2831559a83,0xd5a5b44ca873e03, - 0x8412d9991ed58091,0xe858790afe9486c2, - 0xa5178fff668ae0b6,0x626e974dbe39a872, - 0xce5d73ff402d98e3,0xfb0a3d212dc8128f, - 0x80fa687f881c7f8e,0x7ce66634bc9d0b99, - 0xa139029f6a239f72,0x1c1fffc1ebc44e80, - 0xc987434744ac874e,0xa327ffb266b56220, - 0xfbe9141915d7a922,0x4bf1ff9f0062baa8, - 0x9d71ac8fada6c9b5,0x6f773fc3603db4a9, - 0xc4ce17b399107c22,0xcb550fb4384d21d3, - 0xf6019da07f549b2b,0x7e2a53a146606a48, - 0x99c102844f94e0fb,0x2eda7444cbfc426d, - 0xc0314325637a1939,0xfa911155fefb5308, - 0xf03d93eebc589f88,0x793555ab7eba27ca, - 0x96267c7535b763b5,0x4bc1558b2f3458de, - 0xbbb01b9283253ca2,0x9eb1aaedfb016f16, - 0xea9c227723ee8bcb,0x465e15a979c1cadc, - 0x92a1958a7675175f,0xbfacd89ec191ec9, - 0xb749faed14125d36,0xcef980ec671f667b, - 0xe51c79a85916f484,0x82b7e12780e7401a, - 0x8f31cc0937ae58d2,0xd1b2ecb8b0908810, - 0xb2fe3f0b8599ef07,0x861fa7e6dcb4aa15, - 0xdfbdcece67006ac9,0x67a791e093e1d49a, - 0x8bd6a141006042bd,0xe0c8bb2c5c6d24e0, - 0xaecc49914078536d,0x58fae9f773886e18, - 0xda7f5bf590966848,0xaf39a475506a899e, - 0x888f99797a5e012d,0x6d8406c952429603, - 0xaab37fd7d8f58178,0xc8e5087ba6d33b83, - 0xd5605fcdcf32e1d6,0xfb1e4a9a90880a64, - 0x855c3be0a17fcd26,0x5cf2eea09a55067f, - 0xa6b34ad8c9dfc06f,0xf42faa48c0ea481e, - 0xd0601d8efc57b08b,0xf13b94daf124da26, - 0x823c12795db6ce57,0x76c53d08d6b70858, - 0xa2cb1717b52481ed,0x54768c4b0c64ca6e, - 0xcb7ddcdda26da268,0xa9942f5dcf7dfd09, - 0xfe5d54150b090b02,0xd3f93b35435d7c4c, - 0x9efa548d26e5a6e1,0xc47bc5014a1a6daf, - 0xc6b8e9b0709f109a,0x359ab6419ca1091b, - 0xf867241c8cc6d4c0,0xc30163d203c94b62, - 0x9b407691d7fc44f8,0x79e0de63425dcf1d, - 0xc21094364dfb5636,0x985915fc12f542e4, - 0xf294b943e17a2bc4,0x3e6f5b7b17b2939d, - 0x979cf3ca6cec5b5a,0xa705992ceecf9c42, - 0xbd8430bd08277231,0x50c6ff782a838353, - 0xece53cec4a314ebd,0xa4f8bf5635246428, - 0x940f4613ae5ed136,0x871b7795e136be99, - 0xb913179899f68584,0x28e2557b59846e3f, - 0xe757dd7ec07426e5,0x331aeada2fe589cf, - 0x9096ea6f3848984f,0x3ff0d2c85def7621, - 0xb4bca50b065abe63,0xfed077a756b53a9, - 0xe1ebce4dc7f16dfb,0xd3e8495912c62894, - 0x8d3360f09cf6e4bd,0x64712dd7abbbd95c, - 0xb080392cc4349dec,0xbd8d794d96aacfb3, - 0xdca04777f541c567,0xecf0d7a0fc5583a0, - 0x89e42caaf9491b60,0xf41686c49db57244, - 0xac5d37d5b79b6239,0x311c2875c522ced5, - 0xd77485cb25823ac7,0x7d633293366b828b, - 0x86a8d39ef77164bc,0xae5dff9c02033197, - 0xa8530886b54dbdeb,0xd9f57f830283fdfc, - 0xd267caa862a12d66,0xd072df63c324fd7b, - 0x8380dea93da4bc60,0x4247cb9e59f71e6d, - 0xa46116538d0deb78,0x52d9be85f074e608, - 0xcd795be870516656,0x67902e276c921f8b, - 0x806bd9714632dff6,0xba1cd8a3db53b6, - 0xa086cfcd97bf97f3,0x80e8a40eccd228a4, - 0xc8a883c0fdaf7df0,0x6122cd128006b2cd, - 0xfad2a4b13d1b5d6c,0x796b805720085f81, - 0x9cc3a6eec6311a63,0xcbe3303674053bb0, - 0xc3f490aa77bd60fc,0xbedbfc4411068a9c, - 0xf4f1b4d515acb93b,0xee92fb5515482d44, - 0x991711052d8bf3c5,0x751bdd152d4d1c4a, - 0xbf5cd54678eef0b6,0xd262d45a78a0635d, - 0xef340a98172aace4,0x86fb897116c87c34, - 0x9580869f0e7aac0e,0xd45d35e6ae3d4da0, - 0xbae0a846d2195712,0x8974836059cca109, - 0xe998d258869facd7,0x2bd1a438703fc94b, - 0x91ff83775423cc06,0x7b6306a34627ddcf, - 0xb67f6455292cbf08,0x1a3bc84c17b1d542, - 0xe41f3d6a7377eeca,0x20caba5f1d9e4a93, - 0x8e938662882af53e,0x547eb47b7282ee9c, - 0xb23867fb2a35b28d,0xe99e619a4f23aa43, - 0xdec681f9f4c31f31,0x6405fa00e2ec94d4, - 0x8b3c113c38f9f37e,0xde83bc408dd3dd04, - 0xae0b158b4738705e,0x9624ab50b148d445, - 0xd98ddaee19068c76,0x3badd624dd9b0957, - 0x87f8a8d4cfa417c9,0xe54ca5d70a80e5d6, - 0xa9f6d30a038d1dbc,0x5e9fcf4ccd211f4c, - 0xd47487cc8470652b,0x7647c3200069671f, - 0x84c8d4dfd2c63f3b,0x29ecd9f40041e073, - 0xa5fb0a17c777cf09,0xf468107100525890, - 0xcf79cc9db955c2cc,0x7182148d4066eeb4, - 0x81ac1fe293d599bf,0xc6f14cd848405530, - 0xa21727db38cb002f,0xb8ada00e5a506a7c, - 0xca9cf1d206fdc03b,0xa6d90811f0e4851c, - 0xfd442e4688bd304a,0x908f4a166d1da663, - 0x9e4a9cec15763e2e,0x9a598e4e043287fe, - 0xc5dd44271ad3cdba,0x40eff1e1853f29fd, - 0xf7549530e188c128,0xd12bee59e68ef47c, - 0x9a94dd3e8cf578b9,0x82bb74f8301958ce, - 0xc13a148e3032d6e7,0xe36a52363c1faf01, - 0xf18899b1bc3f8ca1,0xdc44e6c3cb279ac1, - 0x96f5600f15a7b7e5,0x29ab103a5ef8c0b9, - 0xbcb2b812db11a5de,0x7415d448f6b6f0e7, - 0xebdf661791d60f56,0x111b495b3464ad21, - 0x936b9fcebb25c995,0xcab10dd900beec34, - 0xb84687c269ef3bfb,0x3d5d514f40eea742, - 0xe65829b3046b0afa,0xcb4a5a3112a5112, - 0x8ff71a0fe2c2e6dc,0x47f0e785eaba72ab, - 0xb3f4e093db73a093,0x59ed216765690f56, - 0xe0f218b8d25088b8,0x306869c13ec3532c, - 0x8c974f7383725573,0x1e414218c73a13fb, - 0xafbd2350644eeacf,0xe5d1929ef90898fa, - 0xdbac6c247d62a583,0xdf45f746b74abf39, - 0x894bc396ce5da772,0x6b8bba8c328eb783, - 0xab9eb47c81f5114f,0x66ea92f3f326564, - 0xd686619ba27255a2,0xc80a537b0efefebd, - 0x8613fd0145877585,0xbd06742ce95f5f36, - 0xa798fc4196e952e7,0x2c48113823b73704, - 0xd17f3b51fca3a7a0,0xf75a15862ca504c5, - 0x82ef85133de648c4,0x9a984d73dbe722fb, - 0xa3ab66580d5fdaf5,0xc13e60d0d2e0ebba, - 0xcc963fee10b7d1b3,0x318df905079926a8, - 0xffbbcfe994e5c61f,0xfdf17746497f7052, - 0x9fd561f1fd0f9bd3,0xfeb6ea8bedefa633, - 0xc7caba6e7c5382c8,0xfe64a52ee96b8fc0, - 0xf9bd690a1b68637b,0x3dfdce7aa3c673b0, - 0x9c1661a651213e2d,0x6bea10ca65c084e, - 0xc31bfa0fe5698db8,0x486e494fcff30a62, - 0xf3e2f893dec3f126,0x5a89dba3c3efccfa, - 0x986ddb5c6b3a76b7,0xf89629465a75e01c, - 0xbe89523386091465,0xf6bbb397f1135823, - 0xee2ba6c0678b597f,0x746aa07ded582e2c, - 0x94db483840b717ef,0xa8c2a44eb4571cdc, - 0xba121a4650e4ddeb,0x92f34d62616ce413, - 0xe896a0d7e51e1566,0x77b020baf9c81d17, - 0x915e2486ef32cd60,0xace1474dc1d122e, - 0xb5b5ada8aaff80b8,0xd819992132456ba, - 0xe3231912d5bf60e6,0x10e1fff697ed6c69, - 0x8df5efabc5979c8f,0xca8d3ffa1ef463c1, - 0xb1736b96b6fd83b3,0xbd308ff8a6b17cb2, - 0xddd0467c64bce4a0,0xac7cb3f6d05ddbde, - 0x8aa22c0dbef60ee4,0x6bcdf07a423aa96b, - 0xad4ab7112eb3929d,0x86c16c98d2c953c6, - 0xd89d64d57a607744,0xe871c7bf077ba8b7, - 0x87625f056c7c4a8b,0x11471cd764ad4972, - 0xa93af6c6c79b5d2d,0xd598e40d3dd89bcf, - 0xd389b47879823479,0x4aff1d108d4ec2c3, - 0x843610cb4bf160cb,0xcedf722a585139ba, - 0xa54394fe1eedb8fe,0xc2974eb4ee658828, - 0xce947a3da6a9273e,0x733d226229feea32, - 0x811ccc668829b887,0x806357d5a3f525f, - 0xa163ff802a3426a8,0xca07c2dcb0cf26f7, - 0xc9bcff6034c13052,0xfc89b393dd02f0b5, - 0xfc2c3f3841f17c67,0xbbac2078d443ace2, - 0x9d9ba7832936edc0,0xd54b944b84aa4c0d, - 0xc5029163f384a931,0xa9e795e65d4df11, - 0xf64335bcf065d37d,0x4d4617b5ff4a16d5, - 0x99ea0196163fa42e,0x504bced1bf8e4e45, - 0xc06481fb9bcf8d39,0xe45ec2862f71e1d6, - 0xf07da27a82c37088,0x5d767327bb4e5a4c, - 0x964e858c91ba2655,0x3a6a07f8d510f86f, - 0xbbe226efb628afea,0x890489f70a55368b, - 0xeadab0aba3b2dbe5,0x2b45ac74ccea842e, - 0x92c8ae6b464fc96f,0x3b0b8bc90012929d, - 0xb77ada0617e3bbcb,0x9ce6ebb40173744, - 0xe55990879ddcaabd,0xcc420a6a101d0515, - 0x8f57fa54c2a9eab6,0x9fa946824a12232d, - 0xb32df8e9f3546564,0x47939822dc96abf9, - 0xdff9772470297ebd,0x59787e2b93bc56f7, - 0x8bfbea76c619ef36,0x57eb4edb3c55b65a, - 0xaefae51477a06b03,0xede622920b6b23f1, - 0xdab99e59958885c4,0xe95fab368e45eced, - 0x88b402f7fd75539b,0x11dbcb0218ebb414, - 0xaae103b5fcd2a881,0xd652bdc29f26a119, - 0xd59944a37c0752a2,0x4be76d3346f0495f, - 0x857fcae62d8493a5,0x6f70a4400c562ddb, - 0xa6dfbd9fb8e5b88e,0xcb4ccd500f6bb952, - 0xd097ad07a71f26b2,0x7e2000a41346a7a7, - 0x825ecc24c873782f,0x8ed400668c0c28c8, - 0xa2f67f2dfa90563b,0x728900802f0f32fa, - 0xcbb41ef979346bca,0x4f2b40a03ad2ffb9, - 0xfea126b7d78186bc,0xe2f610c84987bfa8, - 0x9f24b832e6b0f436,0xdd9ca7d2df4d7c9, - 0xc6ede63fa05d3143,0x91503d1c79720dbb, - 0xf8a95fcf88747d94,0x75a44c6397ce912a, - 0x9b69dbe1b548ce7c,0xc986afbe3ee11aba, - 0xc24452da229b021b,0xfbe85badce996168, - 0xf2d56790ab41c2a2,0xfae27299423fb9c3, - 0x97c560ba6b0919a5,0xdccd879fc967d41a, - 0xbdb6b8e905cb600f,0x5400e987bbc1c920, - 0xed246723473e3813,0x290123e9aab23b68, - 0x9436c0760c86e30b,0xf9a0b6720aaf6521, - 0xb94470938fa89bce,0xf808e40e8d5b3e69, - 0xe7958cb87392c2c2,0xb60b1d1230b20e04, - 0x90bd77f3483bb9b9,0xb1c6f22b5e6f48c2, - 0xb4ecd5f01a4aa828,0x1e38aeb6360b1af3, - 0xe2280b6c20dd5232,0x25c6da63c38de1b0, - 0x8d590723948a535f,0x579c487e5a38ad0e, - 0xb0af48ec79ace837,0x2d835a9df0c6d851, - 0xdcdb1b2798182244,0xf8e431456cf88e65, - 0x8a08f0f8bf0f156b,0x1b8e9ecb641b58ff, - 0xac8b2d36eed2dac5,0xe272467e3d222f3f, - 0xd7adf884aa879177,0x5b0ed81dcc6abb0f, - 0x86ccbb52ea94baea,0x98e947129fc2b4e9, - 0xa87fea27a539e9a5,0x3f2398d747b36224, - 0xd29fe4b18e88640e,0x8eec7f0d19a03aad, - 0x83a3eeeef9153e89,0x1953cf68300424ac, - 0xa48ceaaab75a8e2b,0x5fa8c3423c052dd7, - 0xcdb02555653131b6,0x3792f412cb06794d, - 0x808e17555f3ebf11,0xe2bbd88bbee40bd0, - 0xa0b19d2ab70e6ed6,0x5b6aceaeae9d0ec4, - 0xc8de047564d20a8b,0xf245825a5a445275, - 0xfb158592be068d2e,0xeed6e2f0f0d56712, - 0x9ced737bb6c4183d,0x55464dd69685606b, - 0xc428d05aa4751e4c,0xaa97e14c3c26b886, - 0xf53304714d9265df,0xd53dd99f4b3066a8, - 0x993fe2c6d07b7fab,0xe546a8038efe4029, - 0xbf8fdb78849a5f96,0xde98520472bdd033, - 0xef73d256a5c0f77c,0x963e66858f6d4440, - 0x95a8637627989aad,0xdde7001379a44aa8, - 0xbb127c53b17ec159,0x5560c018580d5d52, - 0xe9d71b689dde71af,0xaab8f01e6e10b4a6, - 0x9226712162ab070d,0xcab3961304ca70e8, - 0xb6b00d69bb55c8d1,0x3d607b97c5fd0d22, - 0xe45c10c42a2b3b05,0x8cb89a7db77c506a, - 0x8eb98a7a9a5b04e3,0x77f3608e92adb242, - 0xb267ed1940f1c61c,0x55f038b237591ed3, - 0xdf01e85f912e37a3,0x6b6c46dec52f6688, - 0x8b61313bbabce2c6,0x2323ac4b3b3da015, - 0xae397d8aa96c1b77,0xabec975e0a0d081a, - 0xd9c7dced53c72255,0x96e7bd358c904a21, - 0x881cea14545c7575,0x7e50d64177da2e54, - 0xaa242499697392d2,0xdde50bd1d5d0b9e9, - 0xd4ad2dbfc3d07787,0x955e4ec64b44e864, - 0x84ec3c97da624ab4,0xbd5af13bef0b113e, - 0xa6274bbdd0fadd61,0xecb1ad8aeacdd58e, - 0xcfb11ead453994ba,0x67de18eda5814af2, - 0x81ceb32c4b43fcf4,0x80eacf948770ced7, - 0xa2425ff75e14fc31,0xa1258379a94d028d, - 0xcad2f7f5359a3b3e,0x96ee45813a04330, - 0xfd87b5f28300ca0d,0x8bca9d6e188853fc, - 0x9e74d1b791e07e48,0x775ea264cf55347e, - 0xc612062576589dda,0x95364afe032a819e, - 0xf79687aed3eec551,0x3a83ddbd83f52205, - 0x9abe14cd44753b52,0xc4926a9672793543, - 0xc16d9a0095928a27,0x75b7053c0f178294, - 0xf1c90080baf72cb1,0x5324c68b12dd6339, - 0x971da05074da7bee,0xd3f6fc16ebca5e04, - 0xbce5086492111aea,0x88f4bb1ca6bcf585, - 0xec1e4a7db69561a5,0x2b31e9e3d06c32e6, - 0x9392ee8e921d5d07,0x3aff322e62439fd0, - 0xb877aa3236a4b449,0x9befeb9fad487c3, - 0xe69594bec44de15b,0x4c2ebe687989a9b4, - 0x901d7cf73ab0acd9,0xf9d37014bf60a11, - 0xb424dc35095cd80f,0x538484c19ef38c95, - 0xe12e13424bb40e13,0x2865a5f206b06fba, - 0x8cbccc096f5088cb,0xf93f87b7442e45d4, - 0xafebff0bcb24aafe,0xf78f69a51539d749, - 0xdbe6fecebdedd5be,0xb573440e5a884d1c, - 0x89705f4136b4a597,0x31680a88f8953031, - 0xabcc77118461cefc,0xfdc20d2b36ba7c3e, - 0xd6bf94d5e57a42bc,0x3d32907604691b4d, - 0x8637bd05af6c69b5,0xa63f9a49c2c1b110, - 0xa7c5ac471b478423,0xfcf80dc33721d54, - 0xd1b71758e219652b,0xd3c36113404ea4a9, - 0x83126e978d4fdf3b,0x645a1cac083126ea, - 0xa3d70a3d70a3d70a,0x3d70a3d70a3d70a4, - 0xcccccccccccccccc,0xcccccccccccccccd, - 0x8000000000000000,0x0, - 0xa000000000000000,0x0, - 0xc800000000000000,0x0, - 0xfa00000000000000,0x0, - 0x9c40000000000000,0x0, - 0xc350000000000000,0x0, - 0xf424000000000000,0x0, - 0x9896800000000000,0x0, - 0xbebc200000000000,0x0, - 0xee6b280000000000,0x0, - 0x9502f90000000000,0x0, - 0xba43b74000000000,0x0, - 0xe8d4a51000000000,0x0, - 0x9184e72a00000000,0x0, - 0xb5e620f480000000,0x0, - 0xe35fa931a0000000,0x0, - 0x8e1bc9bf04000000,0x0, - 0xb1a2bc2ec5000000,0x0, - 0xde0b6b3a76400000,0x0, - 0x8ac7230489e80000,0x0, - 0xad78ebc5ac620000,0x0, - 0xd8d726b7177a8000,0x0, - 0x878678326eac9000,0x0, - 0xa968163f0a57b400,0x0, - 0xd3c21bcecceda100,0x0, - 0x84595161401484a0,0x0, - 0xa56fa5b99019a5c8,0x0, - 0xcecb8f27f4200f3a,0x0, - 0x813f3978f8940984,0x4000000000000000, - 0xa18f07d736b90be5,0x5000000000000000, - 0xc9f2c9cd04674ede,0xa400000000000000, - 0xfc6f7c4045812296,0x4d00000000000000, - 0x9dc5ada82b70b59d,0xf020000000000000, - 0xc5371912364ce305,0x6c28000000000000, - 0xf684df56c3e01bc6,0xc732000000000000, - 0x9a130b963a6c115c,0x3c7f400000000000, - 0xc097ce7bc90715b3,0x4b9f100000000000, - 0xf0bdc21abb48db20,0x1e86d40000000000, - 0x96769950b50d88f4,0x1314448000000000, - 0xbc143fa4e250eb31,0x17d955a000000000, - 0xeb194f8e1ae525fd,0x5dcfab0800000000, - 0x92efd1b8d0cf37be,0x5aa1cae500000000, - 0xb7abc627050305ad,0xf14a3d9e40000000, - 0xe596b7b0c643c719,0x6d9ccd05d0000000, - 0x8f7e32ce7bea5c6f,0xe4820023a2000000, - 0xb35dbf821ae4f38b,0xdda2802c8a800000, - 0xe0352f62a19e306e,0xd50b2037ad200000, - 0x8c213d9da502de45,0x4526f422cc340000, - 0xaf298d050e4395d6,0x9670b12b7f410000, - 0xdaf3f04651d47b4c,0x3c0cdd765f114000, - 0x88d8762bf324cd0f,0xa5880a69fb6ac800, - 0xab0e93b6efee0053,0x8eea0d047a457a00, - 0xd5d238a4abe98068,0x72a4904598d6d880, - 0x85a36366eb71f041,0x47a6da2b7f864750, - 0xa70c3c40a64e6c51,0x999090b65f67d924, - 0xd0cf4b50cfe20765,0xfff4b4e3f741cf6d, - 0x82818f1281ed449f,0xbff8f10e7a8921a4, - 0xa321f2d7226895c7,0xaff72d52192b6a0d, - 0xcbea6f8ceb02bb39,0x9bf4f8a69f764490, - 0xfee50b7025c36a08,0x2f236d04753d5b4, - 0x9f4f2726179a2245,0x1d762422c946590, - 0xc722f0ef9d80aad6,0x424d3ad2b7b97ef5, - 0xf8ebad2b84e0d58b,0xd2e0898765a7deb2, - 0x9b934c3b330c8577,0x63cc55f49f88eb2f, - 0xc2781f49ffcfa6d5,0x3cbf6b71c76b25fb, - 0xf316271c7fc3908a,0x8bef464e3945ef7a, - 0x97edd871cfda3a56,0x97758bf0e3cbb5ac, - 0xbde94e8e43d0c8ec,0x3d52eeed1cbea317, - 0xed63a231d4c4fb27,0x4ca7aaa863ee4bdd, - 0x945e455f24fb1cf8,0x8fe8caa93e74ef6a, - 0xb975d6b6ee39e436,0xb3e2fd538e122b44, - 0xe7d34c64a9c85d44,0x60dbbca87196b616, - 0x90e40fbeea1d3a4a,0xbc8955e946fe31cd, - 0xb51d13aea4a488dd,0x6babab6398bdbe41, - 0xe264589a4dcdab14,0xc696963c7eed2dd1, - 0x8d7eb76070a08aec,0xfc1e1de5cf543ca2, - 0xb0de65388cc8ada8,0x3b25a55f43294bcb, - 0xdd15fe86affad912,0x49ef0eb713f39ebe, - 0x8a2dbf142dfcc7ab,0x6e3569326c784337, - 0xacb92ed9397bf996,0x49c2c37f07965404, - 0xd7e77a8f87daf7fb,0xdc33745ec97be906, - 0x86f0ac99b4e8dafd,0x69a028bb3ded71a3, - 0xa8acd7c0222311bc,0xc40832ea0d68ce0c, - 0xd2d80db02aabd62b,0xf50a3fa490c30190, - 0x83c7088e1aab65db,0x792667c6da79e0fa, - 0xa4b8cab1a1563f52,0x577001b891185938, - 0xcde6fd5e09abcf26,0xed4c0226b55e6f86, - 0x80b05e5ac60b6178,0x544f8158315b05b4, - 0xa0dc75f1778e39d6,0x696361ae3db1c721, - 0xc913936dd571c84c,0x3bc3a19cd1e38e9, - 0xfb5878494ace3a5f,0x4ab48a04065c723, - 0x9d174b2dcec0e47b,0x62eb0d64283f9c76, - 0xc45d1df942711d9a,0x3ba5d0bd324f8394, - 0xf5746577930d6500,0xca8f44ec7ee36479, - 0x9968bf6abbe85f20,0x7e998b13cf4e1ecb, - 0xbfc2ef456ae276e8,0x9e3fedd8c321a67e, - 0xefb3ab16c59b14a2,0xc5cfe94ef3ea101e, - 0x95d04aee3b80ece5,0xbba1f1d158724a12, - 0xbb445da9ca61281f,0x2a8a6e45ae8edc97, - 0xea1575143cf97226,0xf52d09d71a3293bd, - 0x924d692ca61be758,0x593c2626705f9c56, - 0xb6e0c377cfa2e12e,0x6f8b2fb00c77836c, - 0xe498f455c38b997a,0xb6dfb9c0f956447, - 0x8edf98b59a373fec,0x4724bd4189bd5eac, - 0xb2977ee300c50fe7,0x58edec91ec2cb657, - 0xdf3d5e9bc0f653e1,0x2f2967b66737e3ed, - 0x8b865b215899f46c,0xbd79e0d20082ee74, - 0xae67f1e9aec07187,0xecd8590680a3aa11, - 0xda01ee641a708de9,0xe80e6f4820cc9495, - 0x884134fe908658b2,0x3109058d147fdcdd, - 0xaa51823e34a7eede,0xbd4b46f0599fd415, - 0xd4e5e2cdc1d1ea96,0x6c9e18ac7007c91a, - 0x850fadc09923329e,0x3e2cf6bc604ddb0, - 0xa6539930bf6bff45,0x84db8346b786151c, - 0xcfe87f7cef46ff16,0xe612641865679a63, - 0x81f14fae158c5f6e,0x4fcb7e8f3f60c07e, - 0xa26da3999aef7749,0xe3be5e330f38f09d, - 0xcb090c8001ab551c,0x5cadf5bfd3072cc5, - 0xfdcb4fa002162a63,0x73d9732fc7c8f7f6, - 0x9e9f11c4014dda7e,0x2867e7fddcdd9afa, - 0xc646d63501a1511d,0xb281e1fd541501b8, - 0xf7d88bc24209a565,0x1f225a7ca91a4226, - 0x9ae757596946075f,0x3375788de9b06958, - 0xc1a12d2fc3978937,0x52d6b1641c83ae, - 0xf209787bb47d6b84,0xc0678c5dbd23a49a, - 0x9745eb4d50ce6332,0xf840b7ba963646e0, - 0xbd176620a501fbff,0xb650e5a93bc3d898, - 0xec5d3fa8ce427aff,0xa3e51f138ab4cebe, - 0x93ba47c980e98cdf,0xc66f336c36b10137, - 0xb8a8d9bbe123f017,0xb80b0047445d4184, - 0xe6d3102ad96cec1d,0xa60dc059157491e5, - 0x9043ea1ac7e41392,0x87c89837ad68db2f, - 0xb454e4a179dd1877,0x29babe4598c311fb, - 0xe16a1dc9d8545e94,0xf4296dd6fef3d67a, - 0x8ce2529e2734bb1d,0x1899e4a65f58660c, - 0xb01ae745b101e9e4,0x5ec05dcff72e7f8f, - 0xdc21a1171d42645d,0x76707543f4fa1f73, - 0x899504ae72497eba,0x6a06494a791c53a8, - 0xabfa45da0edbde69,0x487db9d17636892, - 0xd6f8d7509292d603,0x45a9d2845d3c42b6, - 0x865b86925b9bc5c2,0xb8a2392ba45a9b2, - 0xa7f26836f282b732,0x8e6cac7768d7141e, - 0xd1ef0244af2364ff,0x3207d795430cd926, - 0x8335616aed761f1f,0x7f44e6bd49e807b8, - 0xa402b9c5a8d3a6e7,0x5f16206c9c6209a6, - 0xcd036837130890a1,0x36dba887c37a8c0f, - 0x802221226be55a64,0xc2494954da2c9789, - 0xa02aa96b06deb0fd,0xf2db9baa10b7bd6c, - 0xc83553c5c8965d3d,0x6f92829494e5acc7, - 0xfa42a8b73abbf48c,0xcb772339ba1f17f9, - 0x9c69a97284b578d7,0xff2a760414536efb, - 0xc38413cf25e2d70d,0xfef5138519684aba, - 0xf46518c2ef5b8cd1,0x7eb258665fc25d69, - 0x98bf2f79d5993802,0xef2f773ffbd97a61, - 0xbeeefb584aff8603,0xaafb550ffacfd8fa, - 0xeeaaba2e5dbf6784,0x95ba2a53f983cf38, - 0x952ab45cfa97a0b2,0xdd945a747bf26183, - 0xba756174393d88df,0x94f971119aeef9e4, - 0xe912b9d1478ceb17,0x7a37cd5601aab85d, - 0x91abb422ccb812ee,0xac62e055c10ab33a, - 0xb616a12b7fe617aa,0x577b986b314d6009, - 0xe39c49765fdf9d94,0xed5a7e85fda0b80b, - 0x8e41ade9fbebc27d,0x14588f13be847307, - 0xb1d219647ae6b31c,0x596eb2d8ae258fc8, - 0xde469fbd99a05fe3,0x6fca5f8ed9aef3bb, - 0x8aec23d680043bee,0x25de7bb9480d5854, - 0xada72ccc20054ae9,0xaf561aa79a10ae6a, - 0xd910f7ff28069da4,0x1b2ba1518094da04, - 0x87aa9aff79042286,0x90fb44d2f05d0842, - 0xa99541bf57452b28,0x353a1607ac744a53, - 0xd3fa922f2d1675f2,0x42889b8997915ce8, - 0x847c9b5d7c2e09b7,0x69956135febada11, - 0xa59bc234db398c25,0x43fab9837e699095, - 0xcf02b2c21207ef2e,0x94f967e45e03f4bb, - 0x8161afb94b44f57d,0x1d1be0eebac278f5, - 0xa1ba1ba79e1632dc,0x6462d92a69731732, - 0xca28a291859bbf93,0x7d7b8f7503cfdcfe, - 0xfcb2cb35e702af78,0x5cda735244c3d43e, - 0x9defbf01b061adab,0x3a0888136afa64a7, - 0xc56baec21c7a1916,0x88aaa1845b8fdd0, - 0xf6c69a72a3989f5b,0x8aad549e57273d45, - 0x9a3c2087a63f6399,0x36ac54e2f678864b, - 0xc0cb28a98fcf3c7f,0x84576a1bb416a7dd, - 0xf0fdf2d3f3c30b9f,0x656d44a2a11c51d5, - 0x969eb7c47859e743,0x9f644ae5a4b1b325, - 0xbc4665b596706114,0x873d5d9f0dde1fee, - 0xeb57ff22fc0c7959,0xa90cb506d155a7ea, - 0x9316ff75dd87cbd8,0x9a7f12442d588f2, - 0xb7dcbf5354e9bece,0xc11ed6d538aeb2f, - 0xe5d3ef282a242e81,0x8f1668c8a86da5fa, - 0x8fa475791a569d10,0xf96e017d694487bc, - 0xb38d92d760ec4455,0x37c981dcc395a9ac, - 0xe070f78d3927556a,0x85bbe253f47b1417, - 0x8c469ab843b89562,0x93956d7478ccec8e, - 0xaf58416654a6babb,0x387ac8d1970027b2, - 0xdb2e51bfe9d0696a,0x6997b05fcc0319e, - 0x88fcf317f22241e2,0x441fece3bdf81f03, - 0xab3c2fddeeaad25a,0xd527e81cad7626c3, - 0xd60b3bd56a5586f1,0x8a71e223d8d3b074, - 0x85c7056562757456,0xf6872d5667844e49, - 0xa738c6bebb12d16c,0xb428f8ac016561db, - 0xd106f86e69d785c7,0xe13336d701beba52, - 0x82a45b450226b39c,0xecc0024661173473, - 0xa34d721642b06084,0x27f002d7f95d0190, - 0xcc20ce9bd35c78a5,0x31ec038df7b441f4, - 0xff290242c83396ce,0x7e67047175a15271, - 0x9f79a169bd203e41,0xf0062c6e984d386, - 0xc75809c42c684dd1,0x52c07b78a3e60868, - 0xf92e0c3537826145,0xa7709a56ccdf8a82, - 0x9bbcc7a142b17ccb,0x88a66076400bb691, - 0xc2abf989935ddbfe,0x6acff893d00ea435, - 0xf356f7ebf83552fe,0x583f6b8c4124d43, - 0x98165af37b2153de,0xc3727a337a8b704a, - 0xbe1bf1b059e9a8d6,0x744f18c0592e4c5c, - 0xeda2ee1c7064130c,0x1162def06f79df73, - 0x9485d4d1c63e8be7,0x8addcb5645ac2ba8, - 0xb9a74a0637ce2ee1,0x6d953e2bd7173692, - 0xe8111c87c5c1ba99,0xc8fa8db6ccdd0437, - 0x910ab1d4db9914a0,0x1d9c9892400a22a2, - 0xb54d5e4a127f59c8,0x2503beb6d00cab4b, - 0xe2a0b5dc971f303a,0x2e44ae64840fd61d, - 0x8da471a9de737e24,0x5ceaecfed289e5d2, - 0xb10d8e1456105dad,0x7425a83e872c5f47, - 0xdd50f1996b947518,0xd12f124e28f77719, - 0x8a5296ffe33cc92f,0x82bd6b70d99aaa6f, - 0xace73cbfdc0bfb7b,0x636cc64d1001550b, - 0xd8210befd30efa5a,0x3c47f7e05401aa4e, - 0x8714a775e3e95c78,0x65acfaec34810a71, - 0xa8d9d1535ce3b396,0x7f1839a741a14d0d, - 0xd31045a8341ca07c,0x1ede48111209a050, - 0x83ea2b892091e44d,0x934aed0aab460432, - 0xa4e4b66b68b65d60,0xf81da84d5617853f, - 0xce1de40642e3f4b9,0x36251260ab9d668e, - 0x80d2ae83e9ce78f3,0xc1d72b7c6b426019, - 0xa1075a24e4421730,0xb24cf65b8612f81f, - 0xc94930ae1d529cfc,0xdee033f26797b627, - 0xfb9b7cd9a4a7443c,0x169840ef017da3b1, - 0x9d412e0806e88aa5,0x8e1f289560ee864e, - 0xc491798a08a2ad4e,0xf1a6f2bab92a27e2, - 0xf5b5d7ec8acb58a2,0xae10af696774b1db, - 0x9991a6f3d6bf1765,0xacca6da1e0a8ef29, - 0xbff610b0cc6edd3f,0x17fd090a58d32af3, - 0xeff394dcff8a948e,0xddfc4b4cef07f5b0, - 0x95f83d0a1fb69cd9,0x4abdaf101564f98e, - 0xbb764c4ca7a4440f,0x9d6d1ad41abe37f1, - 0xea53df5fd18d5513,0x84c86189216dc5ed, - 0x92746b9be2f8552c,0x32fd3cf5b4e49bb4, - 0xb7118682dbb66a77,0x3fbc8c33221dc2a1, - 0xe4d5e82392a40515,0xfabaf3feaa5334a, - 0x8f05b1163ba6832d,0x29cb4d87f2a7400e, - 0xb2c71d5bca9023f8,0x743e20e9ef511012, - 0xdf78e4b2bd342cf6,0x914da9246b255416, - 0x8bab8eefb6409c1a,0x1ad089b6c2f7548e, - 0xae9672aba3d0c320,0xa184ac2473b529b1, - 0xda3c0f568cc4f3e8,0xc9e5d72d90a2741e, - 0x8865899617fb1871,0x7e2fa67c7a658892, - 0xaa7eebfb9df9de8d,0xddbb901b98feeab7, - 0xd51ea6fa85785631,0x552a74227f3ea565, - 0x8533285c936b35de,0xd53a88958f87275f, - 0xa67ff273b8460356,0x8a892abaf368f137, - 0xd01fef10a657842c,0x2d2b7569b0432d85, - 0x8213f56a67f6b29b,0x9c3b29620e29fc73, - 0xa298f2c501f45f42,0x8349f3ba91b47b8f, - 0xcb3f2f7642717713,0x241c70a936219a73, - 0xfe0efb53d30dd4d7,0xed238cd383aa0110, - 0x9ec95d1463e8a506,0xf4363804324a40aa, - 0xc67bb4597ce2ce48,0xb143c6053edcd0d5, - 0xf81aa16fdc1b81da,0xdd94b7868e94050a, - 0x9b10a4e5e9913128,0xca7cf2b4191c8326, - 0xc1d4ce1f63f57d72,0xfd1c2f611f63a3f0, - 0xf24a01a73cf2dccf,0xbc633b39673c8cec, - 0x976e41088617ca01,0xd5be0503e085d813, - 0xbd49d14aa79dbc82,0x4b2d8644d8a74e18, - 0xec9c459d51852ba2,0xddf8e7d60ed1219e, - 0x93e1ab8252f33b45,0xcabb90e5c942b503, - 0xb8da1662e7b00a17,0x3d6a751f3b936243, - 0xe7109bfba19c0c9d,0xcc512670a783ad4, - 0x906a617d450187e2,0x27fb2b80668b24c5, - 0xb484f9dc9641e9da,0xb1f9f660802dedf6, - 0xe1a63853bbd26451,0x5e7873f8a0396973, - 0x8d07e33455637eb2,0xdb0b487b6423e1e8, - 0xb049dc016abc5e5f,0x91ce1a9a3d2cda62, - 0xdc5c5301c56b75f7,0x7641a140cc7810fb, - 0x89b9b3e11b6329ba,0xa9e904c87fcb0a9d, - 0xac2820d9623bf429,0x546345fa9fbdcd44, - 0xd732290fbacaf133,0xa97c177947ad4095, - 0x867f59a9d4bed6c0,0x49ed8eabcccc485d, - 0xa81f301449ee8c70,0x5c68f256bfff5a74, - 0xd226fc195c6a2f8c,0x73832eec6fff3111, - 0x83585d8fd9c25db7,0xc831fd53c5ff7eab, - 0xa42e74f3d032f525,0xba3e7ca8b77f5e55, - 0xcd3a1230c43fb26f,0x28ce1bd2e55f35eb, - 0x80444b5e7aa7cf85,0x7980d163cf5b81b3, - 0xa0555e361951c366,0xd7e105bcc332621f, - 0xc86ab5c39fa63440,0x8dd9472bf3fefaa7, - 0xfa856334878fc150,0xb14f98f6f0feb951, - 0x9c935e00d4b9d8d2,0x6ed1bf9a569f33d3, - 0xc3b8358109e84f07,0xa862f80ec4700c8, - 0xf4a642e14c6262c8,0xcd27bb612758c0fa, - 0x98e7e9cccfbd7dbd,0x8038d51cb897789c, - 0xbf21e44003acdd2c,0xe0470a63e6bd56c3, - 0xeeea5d5004981478,0x1858ccfce06cac74, - 0x95527a5202df0ccb,0xf37801e0c43ebc8, - 0xbaa718e68396cffd,0xd30560258f54e6ba, - 0xe950df20247c83fd,0x47c6b82ef32a2069, - 0x91d28b7416cdd27e,0x4cdc331d57fa5441, - 0xb6472e511c81471d,0xe0133fe4adf8e952, - 0xe3d8f9e563a198e5,0x58180fddd97723a6, - 0x8e679c2f5e44ff8f,0x570f09eaa7ea7648,}; -}; - -template -constexpr uint64_t powers_template::power_of_five_128[number_of_entries]; - -using powers = powers_template<>; - -} // namespace fast_float +namespace fast_float +{ + + /** + * When mapping numbers from decimal to binary, + * we go from w * 10^q to m * 2^p but we have + * 10^q = 5^q * 2^q, so effectively + * we are trying to match + * w * 2^q * 5^q to m * 2^p. Thus the powers of two + * are not a concern since they can be represented + * exactly using the binary notation, only the powers of five + * affect the binary significand. + */ + + /** + * The smallest non-zero float (binary64) is 2^-1074. + * We take as input numbers of the form w x 10^q where w < 2^64. + * We have that w * 10^-343 < 2^(64-344) 5^-343 < 2^-1076. + * However, we have that + * (2^64-1) * 10^-342 = (2^64-1) * 2^-342 * 5^-342 > 2^-1074. + * Thus it is possible for a number of the form w * 10^-342 where + * w is a 64-bit value to be a non-zero floating-point number. + ********* + * Any number of form w * 10^309 where w>= 1 is going to be + * infinite in binary64 so we never need to worry about powers + * of 5 greater than 308. + */ + template + struct powers_template + { + constexpr static int smallest_power_of_five = + binary_format::smallest_power_of_ten(); + constexpr static int largest_power_of_five = binary_format::largest_power_of_ten(); + constexpr static int number_of_entries = + 2 * (largest_power_of_five - smallest_power_of_five + 1); + // Powers of five from 5^-342 all the way to 5^308 rounded toward one. + constexpr static uint64_t power_of_five_128[number_of_entries] = { + 0xeef453d6923bd65a, + 0x113faa2906a13b3f, + 0x9558b4661b6565f8, + 0x4ac7ca59a424c507, + 0xbaaee17fa23ebf76, + 0x5d79bcf00d2df649, + 0xe95a99df8ace6f53, + 0xf4d82c2c107973dc, + 0x91d8a02bb6c10594, + 0x79071b9b8a4be869, + 0xb64ec836a47146f9, + 0x9748e2826cdee284, + 0xe3e27a444d8d98b7, + 0xfd1b1b2308169b25, + 0x8e6d8c6ab0787f72, + 0xfe30f0f5e50e20f7, + 0xb208ef855c969f4f, + 0xbdbd2d335e51a935, + 0xde8b2b66b3bc4723, + 0xad2c788035e61382, + 0x8b16fb203055ac76, + 0x4c3bcb5021afcc31, + 0xaddcb9e83c6b1793, + 0xdf4abe242a1bbf3d, + 0xd953e8624b85dd78, + 0xd71d6dad34a2af0d, + 0x87d4713d6f33aa6b, + 0x8672648c40e5ad68, + 0xa9c98d8ccb009506, + 0x680efdaf511f18c2, + 0xd43bf0effdc0ba48, + 0x212bd1b2566def2, + 0x84a57695fe98746d, + 0x14bb630f7604b57, + 0xa5ced43b7e3e9188, + 0x419ea3bd35385e2d, + 0xcf42894a5dce35ea, + 0x52064cac828675b9, + 0x818995ce7aa0e1b2, + 0x7343efebd1940993, + 0xa1ebfb4219491a1f, + 0x1014ebe6c5f90bf8, + 0xca66fa129f9b60a6, + 0xd41a26e077774ef6, + 0xfd00b897478238d0, + 0x8920b098955522b4, + 0x9e20735e8cb16382, + 0x55b46e5f5d5535b0, + 0xc5a890362fddbc62, + 0xeb2189f734aa831d, + 0xf712b443bbd52b7b, + 0xa5e9ec7501d523e4, + 0x9a6bb0aa55653b2d, + 0x47b233c92125366e, + 0xc1069cd4eabe89f8, + 0x999ec0bb696e840a, + 0xf148440a256e2c76, + 0xc00670ea43ca250d, + 0x96cd2a865764dbca, + 0x380406926a5e5728, + 0xbc807527ed3e12bc, + 0xc605083704f5ecf2, + 0xeba09271e88d976b, + 0xf7864a44c633682e, + 0x93445b8731587ea3, + 0x7ab3ee6afbe0211d, + 0xb8157268fdae9e4c, + 0x5960ea05bad82964, + 0xe61acf033d1a45df, + 0x6fb92487298e33bd, + 0x8fd0c16206306bab, + 0xa5d3b6d479f8e056, + 0xb3c4f1ba87bc8696, + 0x8f48a4899877186c, + 0xe0b62e2929aba83c, + 0x331acdabfe94de87, + 0x8c71dcd9ba0b4925, + 0x9ff0c08b7f1d0b14, + 0xaf8e5410288e1b6f, + 0x7ecf0ae5ee44dd9, + 0xdb71e91432b1a24a, + 0xc9e82cd9f69d6150, + 0x892731ac9faf056e, + 0xbe311c083a225cd2, + 0xab70fe17c79ac6ca, + 0x6dbd630a48aaf406, + 0xd64d3d9db981787d, + 0x92cbbccdad5b108, + 0x85f0468293f0eb4e, + 0x25bbf56008c58ea5, + 0xa76c582338ed2621, + 0xaf2af2b80af6f24e, + 0xd1476e2c07286faa, + 0x1af5af660db4aee1, + 0x82cca4db847945ca, + 0x50d98d9fc890ed4d, + 0xa37fce126597973c, + 0xe50ff107bab528a0, + 0xcc5fc196fefd7d0c, + 0x1e53ed49a96272c8, + 0xff77b1fcbebcdc4f, + 0x25e8e89c13bb0f7a, + 0x9faacf3df73609b1, + 0x77b191618c54e9ac, + 0xc795830d75038c1d, + 0xd59df5b9ef6a2417, + 0xf97ae3d0d2446f25, + 0x4b0573286b44ad1d, + 0x9becce62836ac577, + 0x4ee367f9430aec32, + 0xc2e801fb244576d5, + 0x229c41f793cda73f, + 0xf3a20279ed56d48a, + 0x6b43527578c1110f, + 0x9845418c345644d6, + 0x830a13896b78aaa9, + 0xbe5691ef416bd60c, + 0x23cc986bc656d553, + 0xedec366b11c6cb8f, + 0x2cbfbe86b7ec8aa8, + 0x94b3a202eb1c3f39, + 0x7bf7d71432f3d6a9, + 0xb9e08a83a5e34f07, + 0xdaf5ccd93fb0cc53, + 0xe858ad248f5c22c9, + 0xd1b3400f8f9cff68, + 0x91376c36d99995be, + 0x23100809b9c21fa1, + 0xb58547448ffffb2d, + 0xabd40a0c2832a78a, + 0xe2e69915b3fff9f9, + 0x16c90c8f323f516c, + 0x8dd01fad907ffc3b, + 0xae3da7d97f6792e3, + 0xb1442798f49ffb4a, + 0x99cd11cfdf41779c, + 0xdd95317f31c7fa1d, + 0x40405643d711d583, + 0x8a7d3eef7f1cfc52, + 0x482835ea666b2572, + 0xad1c8eab5ee43b66, + 0xda3243650005eecf, + 0xd863b256369d4a40, + 0x90bed43e40076a82, + 0x873e4f75e2224e68, + 0x5a7744a6e804a291, + 0xa90de3535aaae202, + 0x711515d0a205cb36, + 0xd3515c2831559a83, + 0xd5a5b44ca873e03, + 0x8412d9991ed58091, + 0xe858790afe9486c2, + 0xa5178fff668ae0b6, + 0x626e974dbe39a872, + 0xce5d73ff402d98e3, + 0xfb0a3d212dc8128f, + 0x80fa687f881c7f8e, + 0x7ce66634bc9d0b99, + 0xa139029f6a239f72, + 0x1c1fffc1ebc44e80, + 0xc987434744ac874e, + 0xa327ffb266b56220, + 0xfbe9141915d7a922, + 0x4bf1ff9f0062baa8, + 0x9d71ac8fada6c9b5, + 0x6f773fc3603db4a9, + 0xc4ce17b399107c22, + 0xcb550fb4384d21d3, + 0xf6019da07f549b2b, + 0x7e2a53a146606a48, + 0x99c102844f94e0fb, + 0x2eda7444cbfc426d, + 0xc0314325637a1939, + 0xfa911155fefb5308, + 0xf03d93eebc589f88, + 0x793555ab7eba27ca, + 0x96267c7535b763b5, + 0x4bc1558b2f3458de, + 0xbbb01b9283253ca2, + 0x9eb1aaedfb016f16, + 0xea9c227723ee8bcb, + 0x465e15a979c1cadc, + 0x92a1958a7675175f, + 0xbfacd89ec191ec9, + 0xb749faed14125d36, + 0xcef980ec671f667b, + 0xe51c79a85916f484, + 0x82b7e12780e7401a, + 0x8f31cc0937ae58d2, + 0xd1b2ecb8b0908810, + 0xb2fe3f0b8599ef07, + 0x861fa7e6dcb4aa15, + 0xdfbdcece67006ac9, + 0x67a791e093e1d49a, + 0x8bd6a141006042bd, + 0xe0c8bb2c5c6d24e0, + 0xaecc49914078536d, + 0x58fae9f773886e18, + 0xda7f5bf590966848, + 0xaf39a475506a899e, + 0x888f99797a5e012d, + 0x6d8406c952429603, + 0xaab37fd7d8f58178, + 0xc8e5087ba6d33b83, + 0xd5605fcdcf32e1d6, + 0xfb1e4a9a90880a64, + 0x855c3be0a17fcd26, + 0x5cf2eea09a55067f, + 0xa6b34ad8c9dfc06f, + 0xf42faa48c0ea481e, + 0xd0601d8efc57b08b, + 0xf13b94daf124da26, + 0x823c12795db6ce57, + 0x76c53d08d6b70858, + 0xa2cb1717b52481ed, + 0x54768c4b0c64ca6e, + 0xcb7ddcdda26da268, + 0xa9942f5dcf7dfd09, + 0xfe5d54150b090b02, + 0xd3f93b35435d7c4c, + 0x9efa548d26e5a6e1, + 0xc47bc5014a1a6daf, + 0xc6b8e9b0709f109a, + 0x359ab6419ca1091b, + 0xf867241c8cc6d4c0, + 0xc30163d203c94b62, + 0x9b407691d7fc44f8, + 0x79e0de63425dcf1d, + 0xc21094364dfb5636, + 0x985915fc12f542e4, + 0xf294b943e17a2bc4, + 0x3e6f5b7b17b2939d, + 0x979cf3ca6cec5b5a, + 0xa705992ceecf9c42, + 0xbd8430bd08277231, + 0x50c6ff782a838353, + 0xece53cec4a314ebd, + 0xa4f8bf5635246428, + 0x940f4613ae5ed136, + 0x871b7795e136be99, + 0xb913179899f68584, + 0x28e2557b59846e3f, + 0xe757dd7ec07426e5, + 0x331aeada2fe589cf, + 0x9096ea6f3848984f, + 0x3ff0d2c85def7621, + 0xb4bca50b065abe63, + 0xfed077a756b53a9, + 0xe1ebce4dc7f16dfb, + 0xd3e8495912c62894, + 0x8d3360f09cf6e4bd, + 0x64712dd7abbbd95c, + 0xb080392cc4349dec, + 0xbd8d794d96aacfb3, + 0xdca04777f541c567, + 0xecf0d7a0fc5583a0, + 0x89e42caaf9491b60, + 0xf41686c49db57244, + 0xac5d37d5b79b6239, + 0x311c2875c522ced5, + 0xd77485cb25823ac7, + 0x7d633293366b828b, + 0x86a8d39ef77164bc, + 0xae5dff9c02033197, + 0xa8530886b54dbdeb, + 0xd9f57f830283fdfc, + 0xd267caa862a12d66, + 0xd072df63c324fd7b, + 0x8380dea93da4bc60, + 0x4247cb9e59f71e6d, + 0xa46116538d0deb78, + 0x52d9be85f074e608, + 0xcd795be870516656, + 0x67902e276c921f8b, + 0x806bd9714632dff6, + 0xba1cd8a3db53b6, + 0xa086cfcd97bf97f3, + 0x80e8a40eccd228a4, + 0xc8a883c0fdaf7df0, + 0x6122cd128006b2cd, + 0xfad2a4b13d1b5d6c, + 0x796b805720085f81, + 0x9cc3a6eec6311a63, + 0xcbe3303674053bb0, + 0xc3f490aa77bd60fc, + 0xbedbfc4411068a9c, + 0xf4f1b4d515acb93b, + 0xee92fb5515482d44, + 0x991711052d8bf3c5, + 0x751bdd152d4d1c4a, + 0xbf5cd54678eef0b6, + 0xd262d45a78a0635d, + 0xef340a98172aace4, + 0x86fb897116c87c34, + 0x9580869f0e7aac0e, + 0xd45d35e6ae3d4da0, + 0xbae0a846d2195712, + 0x8974836059cca109, + 0xe998d258869facd7, + 0x2bd1a438703fc94b, + 0x91ff83775423cc06, + 0x7b6306a34627ddcf, + 0xb67f6455292cbf08, + 0x1a3bc84c17b1d542, + 0xe41f3d6a7377eeca, + 0x20caba5f1d9e4a93, + 0x8e938662882af53e, + 0x547eb47b7282ee9c, + 0xb23867fb2a35b28d, + 0xe99e619a4f23aa43, + 0xdec681f9f4c31f31, + 0x6405fa00e2ec94d4, + 0x8b3c113c38f9f37e, + 0xde83bc408dd3dd04, + 0xae0b158b4738705e, + 0x9624ab50b148d445, + 0xd98ddaee19068c76, + 0x3badd624dd9b0957, + 0x87f8a8d4cfa417c9, + 0xe54ca5d70a80e5d6, + 0xa9f6d30a038d1dbc, + 0x5e9fcf4ccd211f4c, + 0xd47487cc8470652b, + 0x7647c3200069671f, + 0x84c8d4dfd2c63f3b, + 0x29ecd9f40041e073, + 0xa5fb0a17c777cf09, + 0xf468107100525890, + 0xcf79cc9db955c2cc, + 0x7182148d4066eeb4, + 0x81ac1fe293d599bf, + 0xc6f14cd848405530, + 0xa21727db38cb002f, + 0xb8ada00e5a506a7c, + 0xca9cf1d206fdc03b, + 0xa6d90811f0e4851c, + 0xfd442e4688bd304a, + 0x908f4a166d1da663, + 0x9e4a9cec15763e2e, + 0x9a598e4e043287fe, + 0xc5dd44271ad3cdba, + 0x40eff1e1853f29fd, + 0xf7549530e188c128, + 0xd12bee59e68ef47c, + 0x9a94dd3e8cf578b9, + 0x82bb74f8301958ce, + 0xc13a148e3032d6e7, + 0xe36a52363c1faf01, + 0xf18899b1bc3f8ca1, + 0xdc44e6c3cb279ac1, + 0x96f5600f15a7b7e5, + 0x29ab103a5ef8c0b9, + 0xbcb2b812db11a5de, + 0x7415d448f6b6f0e7, + 0xebdf661791d60f56, + 0x111b495b3464ad21, + 0x936b9fcebb25c995, + 0xcab10dd900beec34, + 0xb84687c269ef3bfb, + 0x3d5d514f40eea742, + 0xe65829b3046b0afa, + 0xcb4a5a3112a5112, + 0x8ff71a0fe2c2e6dc, + 0x47f0e785eaba72ab, + 0xb3f4e093db73a093, + 0x59ed216765690f56, + 0xe0f218b8d25088b8, + 0x306869c13ec3532c, + 0x8c974f7383725573, + 0x1e414218c73a13fb, + 0xafbd2350644eeacf, + 0xe5d1929ef90898fa, + 0xdbac6c247d62a583, + 0xdf45f746b74abf39, + 0x894bc396ce5da772, + 0x6b8bba8c328eb783, + 0xab9eb47c81f5114f, + 0x66ea92f3f326564, + 0xd686619ba27255a2, + 0xc80a537b0efefebd, + 0x8613fd0145877585, + 0xbd06742ce95f5f36, + 0xa798fc4196e952e7, + 0x2c48113823b73704, + 0xd17f3b51fca3a7a0, + 0xf75a15862ca504c5, + 0x82ef85133de648c4, + 0x9a984d73dbe722fb, + 0xa3ab66580d5fdaf5, + 0xc13e60d0d2e0ebba, + 0xcc963fee10b7d1b3, + 0x318df905079926a8, + 0xffbbcfe994e5c61f, + 0xfdf17746497f7052, + 0x9fd561f1fd0f9bd3, + 0xfeb6ea8bedefa633, + 0xc7caba6e7c5382c8, + 0xfe64a52ee96b8fc0, + 0xf9bd690a1b68637b, + 0x3dfdce7aa3c673b0, + 0x9c1661a651213e2d, + 0x6bea10ca65c084e, + 0xc31bfa0fe5698db8, + 0x486e494fcff30a62, + 0xf3e2f893dec3f126, + 0x5a89dba3c3efccfa, + 0x986ddb5c6b3a76b7, + 0xf89629465a75e01c, + 0xbe89523386091465, + 0xf6bbb397f1135823, + 0xee2ba6c0678b597f, + 0x746aa07ded582e2c, + 0x94db483840b717ef, + 0xa8c2a44eb4571cdc, + 0xba121a4650e4ddeb, + 0x92f34d62616ce413, + 0xe896a0d7e51e1566, + 0x77b020baf9c81d17, + 0x915e2486ef32cd60, + 0xace1474dc1d122e, + 0xb5b5ada8aaff80b8, + 0xd819992132456ba, + 0xe3231912d5bf60e6, + 0x10e1fff697ed6c69, + 0x8df5efabc5979c8f, + 0xca8d3ffa1ef463c1, + 0xb1736b96b6fd83b3, + 0xbd308ff8a6b17cb2, + 0xddd0467c64bce4a0, + 0xac7cb3f6d05ddbde, + 0x8aa22c0dbef60ee4, + 0x6bcdf07a423aa96b, + 0xad4ab7112eb3929d, + 0x86c16c98d2c953c6, + 0xd89d64d57a607744, + 0xe871c7bf077ba8b7, + 0x87625f056c7c4a8b, + 0x11471cd764ad4972, + 0xa93af6c6c79b5d2d, + 0xd598e40d3dd89bcf, + 0xd389b47879823479, + 0x4aff1d108d4ec2c3, + 0x843610cb4bf160cb, + 0xcedf722a585139ba, + 0xa54394fe1eedb8fe, + 0xc2974eb4ee658828, + 0xce947a3da6a9273e, + 0x733d226229feea32, + 0x811ccc668829b887, + 0x806357d5a3f525f, + 0xa163ff802a3426a8, + 0xca07c2dcb0cf26f7, + 0xc9bcff6034c13052, + 0xfc89b393dd02f0b5, + 0xfc2c3f3841f17c67, + 0xbbac2078d443ace2, + 0x9d9ba7832936edc0, + 0xd54b944b84aa4c0d, + 0xc5029163f384a931, + 0xa9e795e65d4df11, + 0xf64335bcf065d37d, + 0x4d4617b5ff4a16d5, + 0x99ea0196163fa42e, + 0x504bced1bf8e4e45, + 0xc06481fb9bcf8d39, + 0xe45ec2862f71e1d6, + 0xf07da27a82c37088, + 0x5d767327bb4e5a4c, + 0x964e858c91ba2655, + 0x3a6a07f8d510f86f, + 0xbbe226efb628afea, + 0x890489f70a55368b, + 0xeadab0aba3b2dbe5, + 0x2b45ac74ccea842e, + 0x92c8ae6b464fc96f, + 0x3b0b8bc90012929d, + 0xb77ada0617e3bbcb, + 0x9ce6ebb40173744, + 0xe55990879ddcaabd, + 0xcc420a6a101d0515, + 0x8f57fa54c2a9eab6, + 0x9fa946824a12232d, + 0xb32df8e9f3546564, + 0x47939822dc96abf9, + 0xdff9772470297ebd, + 0x59787e2b93bc56f7, + 0x8bfbea76c619ef36, + 0x57eb4edb3c55b65a, + 0xaefae51477a06b03, + 0xede622920b6b23f1, + 0xdab99e59958885c4, + 0xe95fab368e45eced, + 0x88b402f7fd75539b, + 0x11dbcb0218ebb414, + 0xaae103b5fcd2a881, + 0xd652bdc29f26a119, + 0xd59944a37c0752a2, + 0x4be76d3346f0495f, + 0x857fcae62d8493a5, + 0x6f70a4400c562ddb, + 0xa6dfbd9fb8e5b88e, + 0xcb4ccd500f6bb952, + 0xd097ad07a71f26b2, + 0x7e2000a41346a7a7, + 0x825ecc24c873782f, + 0x8ed400668c0c28c8, + 0xa2f67f2dfa90563b, + 0x728900802f0f32fa, + 0xcbb41ef979346bca, + 0x4f2b40a03ad2ffb9, + 0xfea126b7d78186bc, + 0xe2f610c84987bfa8, + 0x9f24b832e6b0f436, + 0xdd9ca7d2df4d7c9, + 0xc6ede63fa05d3143, + 0x91503d1c79720dbb, + 0xf8a95fcf88747d94, + 0x75a44c6397ce912a, + 0x9b69dbe1b548ce7c, + 0xc986afbe3ee11aba, + 0xc24452da229b021b, + 0xfbe85badce996168, + 0xf2d56790ab41c2a2, + 0xfae27299423fb9c3, + 0x97c560ba6b0919a5, + 0xdccd879fc967d41a, + 0xbdb6b8e905cb600f, + 0x5400e987bbc1c920, + 0xed246723473e3813, + 0x290123e9aab23b68, + 0x9436c0760c86e30b, + 0xf9a0b6720aaf6521, + 0xb94470938fa89bce, + 0xf808e40e8d5b3e69, + 0xe7958cb87392c2c2, + 0xb60b1d1230b20e04, + 0x90bd77f3483bb9b9, + 0xb1c6f22b5e6f48c2, + 0xb4ecd5f01a4aa828, + 0x1e38aeb6360b1af3, + 0xe2280b6c20dd5232, + 0x25c6da63c38de1b0, + 0x8d590723948a535f, + 0x579c487e5a38ad0e, + 0xb0af48ec79ace837, + 0x2d835a9df0c6d851, + 0xdcdb1b2798182244, + 0xf8e431456cf88e65, + 0x8a08f0f8bf0f156b, + 0x1b8e9ecb641b58ff, + 0xac8b2d36eed2dac5, + 0xe272467e3d222f3f, + 0xd7adf884aa879177, + 0x5b0ed81dcc6abb0f, + 0x86ccbb52ea94baea, + 0x98e947129fc2b4e9, + 0xa87fea27a539e9a5, + 0x3f2398d747b36224, + 0xd29fe4b18e88640e, + 0x8eec7f0d19a03aad, + 0x83a3eeeef9153e89, + 0x1953cf68300424ac, + 0xa48ceaaab75a8e2b, + 0x5fa8c3423c052dd7, + 0xcdb02555653131b6, + 0x3792f412cb06794d, + 0x808e17555f3ebf11, + 0xe2bbd88bbee40bd0, + 0xa0b19d2ab70e6ed6, + 0x5b6aceaeae9d0ec4, + 0xc8de047564d20a8b, + 0xf245825a5a445275, + 0xfb158592be068d2e, + 0xeed6e2f0f0d56712, + 0x9ced737bb6c4183d, + 0x55464dd69685606b, + 0xc428d05aa4751e4c, + 0xaa97e14c3c26b886, + 0xf53304714d9265df, + 0xd53dd99f4b3066a8, + 0x993fe2c6d07b7fab, + 0xe546a8038efe4029, + 0xbf8fdb78849a5f96, + 0xde98520472bdd033, + 0xef73d256a5c0f77c, + 0x963e66858f6d4440, + 0x95a8637627989aad, + 0xdde7001379a44aa8, + 0xbb127c53b17ec159, + 0x5560c018580d5d52, + 0xe9d71b689dde71af, + 0xaab8f01e6e10b4a6, + 0x9226712162ab070d, + 0xcab3961304ca70e8, + 0xb6b00d69bb55c8d1, + 0x3d607b97c5fd0d22, + 0xe45c10c42a2b3b05, + 0x8cb89a7db77c506a, + 0x8eb98a7a9a5b04e3, + 0x77f3608e92adb242, + 0xb267ed1940f1c61c, + 0x55f038b237591ed3, + 0xdf01e85f912e37a3, + 0x6b6c46dec52f6688, + 0x8b61313bbabce2c6, + 0x2323ac4b3b3da015, + 0xae397d8aa96c1b77, + 0xabec975e0a0d081a, + 0xd9c7dced53c72255, + 0x96e7bd358c904a21, + 0x881cea14545c7575, + 0x7e50d64177da2e54, + 0xaa242499697392d2, + 0xdde50bd1d5d0b9e9, + 0xd4ad2dbfc3d07787, + 0x955e4ec64b44e864, + 0x84ec3c97da624ab4, + 0xbd5af13bef0b113e, + 0xa6274bbdd0fadd61, + 0xecb1ad8aeacdd58e, + 0xcfb11ead453994ba, + 0x67de18eda5814af2, + 0x81ceb32c4b43fcf4, + 0x80eacf948770ced7, + 0xa2425ff75e14fc31, + 0xa1258379a94d028d, + 0xcad2f7f5359a3b3e, + 0x96ee45813a04330, + 0xfd87b5f28300ca0d, + 0x8bca9d6e188853fc, + 0x9e74d1b791e07e48, + 0x775ea264cf55347e, + 0xc612062576589dda, + 0x95364afe032a819e, + 0xf79687aed3eec551, + 0x3a83ddbd83f52205, + 0x9abe14cd44753b52, + 0xc4926a9672793543, + 0xc16d9a0095928a27, + 0x75b7053c0f178294, + 0xf1c90080baf72cb1, + 0x5324c68b12dd6339, + 0x971da05074da7bee, + 0xd3f6fc16ebca5e04, + 0xbce5086492111aea, + 0x88f4bb1ca6bcf585, + 0xec1e4a7db69561a5, + 0x2b31e9e3d06c32e6, + 0x9392ee8e921d5d07, + 0x3aff322e62439fd0, + 0xb877aa3236a4b449, + 0x9befeb9fad487c3, + 0xe69594bec44de15b, + 0x4c2ebe687989a9b4, + 0x901d7cf73ab0acd9, + 0xf9d37014bf60a11, + 0xb424dc35095cd80f, + 0x538484c19ef38c95, + 0xe12e13424bb40e13, + 0x2865a5f206b06fba, + 0x8cbccc096f5088cb, + 0xf93f87b7442e45d4, + 0xafebff0bcb24aafe, + 0xf78f69a51539d749, + 0xdbe6fecebdedd5be, + 0xb573440e5a884d1c, + 0x89705f4136b4a597, + 0x31680a88f8953031, + 0xabcc77118461cefc, + 0xfdc20d2b36ba7c3e, + 0xd6bf94d5e57a42bc, + 0x3d32907604691b4d, + 0x8637bd05af6c69b5, + 0xa63f9a49c2c1b110, + 0xa7c5ac471b478423, + 0xfcf80dc33721d54, + 0xd1b71758e219652b, + 0xd3c36113404ea4a9, + 0x83126e978d4fdf3b, + 0x645a1cac083126ea, + 0xa3d70a3d70a3d70a, + 0x3d70a3d70a3d70a4, + 0xcccccccccccccccc, + 0xcccccccccccccccd, + 0x8000000000000000, + 0x0, + 0xa000000000000000, + 0x0, + 0xc800000000000000, + 0x0, + 0xfa00000000000000, + 0x0, + 0x9c40000000000000, + 0x0, + 0xc350000000000000, + 0x0, + 0xf424000000000000, + 0x0, + 0x9896800000000000, + 0x0, + 0xbebc200000000000, + 0x0, + 0xee6b280000000000, + 0x0, + 0x9502f90000000000, + 0x0, + 0xba43b74000000000, + 0x0, + 0xe8d4a51000000000, + 0x0, + 0x9184e72a00000000, + 0x0, + 0xb5e620f480000000, + 0x0, + 0xe35fa931a0000000, + 0x0, + 0x8e1bc9bf04000000, + 0x0, + 0xb1a2bc2ec5000000, + 0x0, + 0xde0b6b3a76400000, + 0x0, + 0x8ac7230489e80000, + 0x0, + 0xad78ebc5ac620000, + 0x0, + 0xd8d726b7177a8000, + 0x0, + 0x878678326eac9000, + 0x0, + 0xa968163f0a57b400, + 0x0, + 0xd3c21bcecceda100, + 0x0, + 0x84595161401484a0, + 0x0, + 0xa56fa5b99019a5c8, + 0x0, + 0xcecb8f27f4200f3a, + 0x0, + 0x813f3978f8940984, + 0x4000000000000000, + 0xa18f07d736b90be5, + 0x5000000000000000, + 0xc9f2c9cd04674ede, + 0xa400000000000000, + 0xfc6f7c4045812296, + 0x4d00000000000000, + 0x9dc5ada82b70b59d, + 0xf020000000000000, + 0xc5371912364ce305, + 0x6c28000000000000, + 0xf684df56c3e01bc6, + 0xc732000000000000, + 0x9a130b963a6c115c, + 0x3c7f400000000000, + 0xc097ce7bc90715b3, + 0x4b9f100000000000, + 0xf0bdc21abb48db20, + 0x1e86d40000000000, + 0x96769950b50d88f4, + 0x1314448000000000, + 0xbc143fa4e250eb31, + 0x17d955a000000000, + 0xeb194f8e1ae525fd, + 0x5dcfab0800000000, + 0x92efd1b8d0cf37be, + 0x5aa1cae500000000, + 0xb7abc627050305ad, + 0xf14a3d9e40000000, + 0xe596b7b0c643c719, + 0x6d9ccd05d0000000, + 0x8f7e32ce7bea5c6f, + 0xe4820023a2000000, + 0xb35dbf821ae4f38b, + 0xdda2802c8a800000, + 0xe0352f62a19e306e, + 0xd50b2037ad200000, + 0x8c213d9da502de45, + 0x4526f422cc340000, + 0xaf298d050e4395d6, + 0x9670b12b7f410000, + 0xdaf3f04651d47b4c, + 0x3c0cdd765f114000, + 0x88d8762bf324cd0f, + 0xa5880a69fb6ac800, + 0xab0e93b6efee0053, + 0x8eea0d047a457a00, + 0xd5d238a4abe98068, + 0x72a4904598d6d880, + 0x85a36366eb71f041, + 0x47a6da2b7f864750, + 0xa70c3c40a64e6c51, + 0x999090b65f67d924, + 0xd0cf4b50cfe20765, + 0xfff4b4e3f741cf6d, + 0x82818f1281ed449f, + 0xbff8f10e7a8921a4, + 0xa321f2d7226895c7, + 0xaff72d52192b6a0d, + 0xcbea6f8ceb02bb39, + 0x9bf4f8a69f764490, + 0xfee50b7025c36a08, + 0x2f236d04753d5b4, + 0x9f4f2726179a2245, + 0x1d762422c946590, + 0xc722f0ef9d80aad6, + 0x424d3ad2b7b97ef5, + 0xf8ebad2b84e0d58b, + 0xd2e0898765a7deb2, + 0x9b934c3b330c8577, + 0x63cc55f49f88eb2f, + 0xc2781f49ffcfa6d5, + 0x3cbf6b71c76b25fb, + 0xf316271c7fc3908a, + 0x8bef464e3945ef7a, + 0x97edd871cfda3a56, + 0x97758bf0e3cbb5ac, + 0xbde94e8e43d0c8ec, + 0x3d52eeed1cbea317, + 0xed63a231d4c4fb27, + 0x4ca7aaa863ee4bdd, + 0x945e455f24fb1cf8, + 0x8fe8caa93e74ef6a, + 0xb975d6b6ee39e436, + 0xb3e2fd538e122b44, + 0xe7d34c64a9c85d44, + 0x60dbbca87196b616, + 0x90e40fbeea1d3a4a, + 0xbc8955e946fe31cd, + 0xb51d13aea4a488dd, + 0x6babab6398bdbe41, + 0xe264589a4dcdab14, + 0xc696963c7eed2dd1, + 0x8d7eb76070a08aec, + 0xfc1e1de5cf543ca2, + 0xb0de65388cc8ada8, + 0x3b25a55f43294bcb, + 0xdd15fe86affad912, + 0x49ef0eb713f39ebe, + 0x8a2dbf142dfcc7ab, + 0x6e3569326c784337, + 0xacb92ed9397bf996, + 0x49c2c37f07965404, + 0xd7e77a8f87daf7fb, + 0xdc33745ec97be906, + 0x86f0ac99b4e8dafd, + 0x69a028bb3ded71a3, + 0xa8acd7c0222311bc, + 0xc40832ea0d68ce0c, + 0xd2d80db02aabd62b, + 0xf50a3fa490c30190, + 0x83c7088e1aab65db, + 0x792667c6da79e0fa, + 0xa4b8cab1a1563f52, + 0x577001b891185938, + 0xcde6fd5e09abcf26, + 0xed4c0226b55e6f86, + 0x80b05e5ac60b6178, + 0x544f8158315b05b4, + 0xa0dc75f1778e39d6, + 0x696361ae3db1c721, + 0xc913936dd571c84c, + 0x3bc3a19cd1e38e9, + 0xfb5878494ace3a5f, + 0x4ab48a04065c723, + 0x9d174b2dcec0e47b, + 0x62eb0d64283f9c76, + 0xc45d1df942711d9a, + 0x3ba5d0bd324f8394, + 0xf5746577930d6500, + 0xca8f44ec7ee36479, + 0x9968bf6abbe85f20, + 0x7e998b13cf4e1ecb, + 0xbfc2ef456ae276e8, + 0x9e3fedd8c321a67e, + 0xefb3ab16c59b14a2, + 0xc5cfe94ef3ea101e, + 0x95d04aee3b80ece5, + 0xbba1f1d158724a12, + 0xbb445da9ca61281f, + 0x2a8a6e45ae8edc97, + 0xea1575143cf97226, + 0xf52d09d71a3293bd, + 0x924d692ca61be758, + 0x593c2626705f9c56, + 0xb6e0c377cfa2e12e, + 0x6f8b2fb00c77836c, + 0xe498f455c38b997a, + 0xb6dfb9c0f956447, + 0x8edf98b59a373fec, + 0x4724bd4189bd5eac, + 0xb2977ee300c50fe7, + 0x58edec91ec2cb657, + 0xdf3d5e9bc0f653e1, + 0x2f2967b66737e3ed, + 0x8b865b215899f46c, + 0xbd79e0d20082ee74, + 0xae67f1e9aec07187, + 0xecd8590680a3aa11, + 0xda01ee641a708de9, + 0xe80e6f4820cc9495, + 0x884134fe908658b2, + 0x3109058d147fdcdd, + 0xaa51823e34a7eede, + 0xbd4b46f0599fd415, + 0xd4e5e2cdc1d1ea96, + 0x6c9e18ac7007c91a, + 0x850fadc09923329e, + 0x3e2cf6bc604ddb0, + 0xa6539930bf6bff45, + 0x84db8346b786151c, + 0xcfe87f7cef46ff16, + 0xe612641865679a63, + 0x81f14fae158c5f6e, + 0x4fcb7e8f3f60c07e, + 0xa26da3999aef7749, + 0xe3be5e330f38f09d, + 0xcb090c8001ab551c, + 0x5cadf5bfd3072cc5, + 0xfdcb4fa002162a63, + 0x73d9732fc7c8f7f6, + 0x9e9f11c4014dda7e, + 0x2867e7fddcdd9afa, + 0xc646d63501a1511d, + 0xb281e1fd541501b8, + 0xf7d88bc24209a565, + 0x1f225a7ca91a4226, + 0x9ae757596946075f, + 0x3375788de9b06958, + 0xc1a12d2fc3978937, + 0x52d6b1641c83ae, + 0xf209787bb47d6b84, + 0xc0678c5dbd23a49a, + 0x9745eb4d50ce6332, + 0xf840b7ba963646e0, + 0xbd176620a501fbff, + 0xb650e5a93bc3d898, + 0xec5d3fa8ce427aff, + 0xa3e51f138ab4cebe, + 0x93ba47c980e98cdf, + 0xc66f336c36b10137, + 0xb8a8d9bbe123f017, + 0xb80b0047445d4184, + 0xe6d3102ad96cec1d, + 0xa60dc059157491e5, + 0x9043ea1ac7e41392, + 0x87c89837ad68db2f, + 0xb454e4a179dd1877, + 0x29babe4598c311fb, + 0xe16a1dc9d8545e94, + 0xf4296dd6fef3d67a, + 0x8ce2529e2734bb1d, + 0x1899e4a65f58660c, + 0xb01ae745b101e9e4, + 0x5ec05dcff72e7f8f, + 0xdc21a1171d42645d, + 0x76707543f4fa1f73, + 0x899504ae72497eba, + 0x6a06494a791c53a8, + 0xabfa45da0edbde69, + 0x487db9d17636892, + 0xd6f8d7509292d603, + 0x45a9d2845d3c42b6, + 0x865b86925b9bc5c2, + 0xb8a2392ba45a9b2, + 0xa7f26836f282b732, + 0x8e6cac7768d7141e, + 0xd1ef0244af2364ff, + 0x3207d795430cd926, + 0x8335616aed761f1f, + 0x7f44e6bd49e807b8, + 0xa402b9c5a8d3a6e7, + 0x5f16206c9c6209a6, + 0xcd036837130890a1, + 0x36dba887c37a8c0f, + 0x802221226be55a64, + 0xc2494954da2c9789, + 0xa02aa96b06deb0fd, + 0xf2db9baa10b7bd6c, + 0xc83553c5c8965d3d, + 0x6f92829494e5acc7, + 0xfa42a8b73abbf48c, + 0xcb772339ba1f17f9, + 0x9c69a97284b578d7, + 0xff2a760414536efb, + 0xc38413cf25e2d70d, + 0xfef5138519684aba, + 0xf46518c2ef5b8cd1, + 0x7eb258665fc25d69, + 0x98bf2f79d5993802, + 0xef2f773ffbd97a61, + 0xbeeefb584aff8603, + 0xaafb550ffacfd8fa, + 0xeeaaba2e5dbf6784, + 0x95ba2a53f983cf38, + 0x952ab45cfa97a0b2, + 0xdd945a747bf26183, + 0xba756174393d88df, + 0x94f971119aeef9e4, + 0xe912b9d1478ceb17, + 0x7a37cd5601aab85d, + 0x91abb422ccb812ee, + 0xac62e055c10ab33a, + 0xb616a12b7fe617aa, + 0x577b986b314d6009, + 0xe39c49765fdf9d94, + 0xed5a7e85fda0b80b, + 0x8e41ade9fbebc27d, + 0x14588f13be847307, + 0xb1d219647ae6b31c, + 0x596eb2d8ae258fc8, + 0xde469fbd99a05fe3, + 0x6fca5f8ed9aef3bb, + 0x8aec23d680043bee, + 0x25de7bb9480d5854, + 0xada72ccc20054ae9, + 0xaf561aa79a10ae6a, + 0xd910f7ff28069da4, + 0x1b2ba1518094da04, + 0x87aa9aff79042286, + 0x90fb44d2f05d0842, + 0xa99541bf57452b28, + 0x353a1607ac744a53, + 0xd3fa922f2d1675f2, + 0x42889b8997915ce8, + 0x847c9b5d7c2e09b7, + 0x69956135febada11, + 0xa59bc234db398c25, + 0x43fab9837e699095, + 0xcf02b2c21207ef2e, + 0x94f967e45e03f4bb, + 0x8161afb94b44f57d, + 0x1d1be0eebac278f5, + 0xa1ba1ba79e1632dc, + 0x6462d92a69731732, + 0xca28a291859bbf93, + 0x7d7b8f7503cfdcfe, + 0xfcb2cb35e702af78, + 0x5cda735244c3d43e, + 0x9defbf01b061adab, + 0x3a0888136afa64a7, + 0xc56baec21c7a1916, + 0x88aaa1845b8fdd0, + 0xf6c69a72a3989f5b, + 0x8aad549e57273d45, + 0x9a3c2087a63f6399, + 0x36ac54e2f678864b, + 0xc0cb28a98fcf3c7f, + 0x84576a1bb416a7dd, + 0xf0fdf2d3f3c30b9f, + 0x656d44a2a11c51d5, + 0x969eb7c47859e743, + 0x9f644ae5a4b1b325, + 0xbc4665b596706114, + 0x873d5d9f0dde1fee, + 0xeb57ff22fc0c7959, + 0xa90cb506d155a7ea, + 0x9316ff75dd87cbd8, + 0x9a7f12442d588f2, + 0xb7dcbf5354e9bece, + 0xc11ed6d538aeb2f, + 0xe5d3ef282a242e81, + 0x8f1668c8a86da5fa, + 0x8fa475791a569d10, + 0xf96e017d694487bc, + 0xb38d92d760ec4455, + 0x37c981dcc395a9ac, + 0xe070f78d3927556a, + 0x85bbe253f47b1417, + 0x8c469ab843b89562, + 0x93956d7478ccec8e, + 0xaf58416654a6babb, + 0x387ac8d1970027b2, + 0xdb2e51bfe9d0696a, + 0x6997b05fcc0319e, + 0x88fcf317f22241e2, + 0x441fece3bdf81f03, + 0xab3c2fddeeaad25a, + 0xd527e81cad7626c3, + 0xd60b3bd56a5586f1, + 0x8a71e223d8d3b074, + 0x85c7056562757456, + 0xf6872d5667844e49, + 0xa738c6bebb12d16c, + 0xb428f8ac016561db, + 0xd106f86e69d785c7, + 0xe13336d701beba52, + 0x82a45b450226b39c, + 0xecc0024661173473, + 0xa34d721642b06084, + 0x27f002d7f95d0190, + 0xcc20ce9bd35c78a5, + 0x31ec038df7b441f4, + 0xff290242c83396ce, + 0x7e67047175a15271, + 0x9f79a169bd203e41, + 0xf0062c6e984d386, + 0xc75809c42c684dd1, + 0x52c07b78a3e60868, + 0xf92e0c3537826145, + 0xa7709a56ccdf8a82, + 0x9bbcc7a142b17ccb, + 0x88a66076400bb691, + 0xc2abf989935ddbfe, + 0x6acff893d00ea435, + 0xf356f7ebf83552fe, + 0x583f6b8c4124d43, + 0x98165af37b2153de, + 0xc3727a337a8b704a, + 0xbe1bf1b059e9a8d6, + 0x744f18c0592e4c5c, + 0xeda2ee1c7064130c, + 0x1162def06f79df73, + 0x9485d4d1c63e8be7, + 0x8addcb5645ac2ba8, + 0xb9a74a0637ce2ee1, + 0x6d953e2bd7173692, + 0xe8111c87c5c1ba99, + 0xc8fa8db6ccdd0437, + 0x910ab1d4db9914a0, + 0x1d9c9892400a22a2, + 0xb54d5e4a127f59c8, + 0x2503beb6d00cab4b, + 0xe2a0b5dc971f303a, + 0x2e44ae64840fd61d, + 0x8da471a9de737e24, + 0x5ceaecfed289e5d2, + 0xb10d8e1456105dad, + 0x7425a83e872c5f47, + 0xdd50f1996b947518, + 0xd12f124e28f77719, + 0x8a5296ffe33cc92f, + 0x82bd6b70d99aaa6f, + 0xace73cbfdc0bfb7b, + 0x636cc64d1001550b, + 0xd8210befd30efa5a, + 0x3c47f7e05401aa4e, + 0x8714a775e3e95c78, + 0x65acfaec34810a71, + 0xa8d9d1535ce3b396, + 0x7f1839a741a14d0d, + 0xd31045a8341ca07c, + 0x1ede48111209a050, + 0x83ea2b892091e44d, + 0x934aed0aab460432, + 0xa4e4b66b68b65d60, + 0xf81da84d5617853f, + 0xce1de40642e3f4b9, + 0x36251260ab9d668e, + 0x80d2ae83e9ce78f3, + 0xc1d72b7c6b426019, + 0xa1075a24e4421730, + 0xb24cf65b8612f81f, + 0xc94930ae1d529cfc, + 0xdee033f26797b627, + 0xfb9b7cd9a4a7443c, + 0x169840ef017da3b1, + 0x9d412e0806e88aa5, + 0x8e1f289560ee864e, + 0xc491798a08a2ad4e, + 0xf1a6f2bab92a27e2, + 0xf5b5d7ec8acb58a2, + 0xae10af696774b1db, + 0x9991a6f3d6bf1765, + 0xacca6da1e0a8ef29, + 0xbff610b0cc6edd3f, + 0x17fd090a58d32af3, + 0xeff394dcff8a948e, + 0xddfc4b4cef07f5b0, + 0x95f83d0a1fb69cd9, + 0x4abdaf101564f98e, + 0xbb764c4ca7a4440f, + 0x9d6d1ad41abe37f1, + 0xea53df5fd18d5513, + 0x84c86189216dc5ed, + 0x92746b9be2f8552c, + 0x32fd3cf5b4e49bb4, + 0xb7118682dbb66a77, + 0x3fbc8c33221dc2a1, + 0xe4d5e82392a40515, + 0xfabaf3feaa5334a, + 0x8f05b1163ba6832d, + 0x29cb4d87f2a7400e, + 0xb2c71d5bca9023f8, + 0x743e20e9ef511012, + 0xdf78e4b2bd342cf6, + 0x914da9246b255416, + 0x8bab8eefb6409c1a, + 0x1ad089b6c2f7548e, + 0xae9672aba3d0c320, + 0xa184ac2473b529b1, + 0xda3c0f568cc4f3e8, + 0xc9e5d72d90a2741e, + 0x8865899617fb1871, + 0x7e2fa67c7a658892, + 0xaa7eebfb9df9de8d, + 0xddbb901b98feeab7, + 0xd51ea6fa85785631, + 0x552a74227f3ea565, + 0x8533285c936b35de, + 0xd53a88958f87275f, + 0xa67ff273b8460356, + 0x8a892abaf368f137, + 0xd01fef10a657842c, + 0x2d2b7569b0432d85, + 0x8213f56a67f6b29b, + 0x9c3b29620e29fc73, + 0xa298f2c501f45f42, + 0x8349f3ba91b47b8f, + 0xcb3f2f7642717713, + 0x241c70a936219a73, + 0xfe0efb53d30dd4d7, + 0xed238cd383aa0110, + 0x9ec95d1463e8a506, + 0xf4363804324a40aa, + 0xc67bb4597ce2ce48, + 0xb143c6053edcd0d5, + 0xf81aa16fdc1b81da, + 0xdd94b7868e94050a, + 0x9b10a4e5e9913128, + 0xca7cf2b4191c8326, + 0xc1d4ce1f63f57d72, + 0xfd1c2f611f63a3f0, + 0xf24a01a73cf2dccf, + 0xbc633b39673c8cec, + 0x976e41088617ca01, + 0xd5be0503e085d813, + 0xbd49d14aa79dbc82, + 0x4b2d8644d8a74e18, + 0xec9c459d51852ba2, + 0xddf8e7d60ed1219e, + 0x93e1ab8252f33b45, + 0xcabb90e5c942b503, + 0xb8da1662e7b00a17, + 0x3d6a751f3b936243, + 0xe7109bfba19c0c9d, + 0xcc512670a783ad4, + 0x906a617d450187e2, + 0x27fb2b80668b24c5, + 0xb484f9dc9641e9da, + 0xb1f9f660802dedf6, + 0xe1a63853bbd26451, + 0x5e7873f8a0396973, + 0x8d07e33455637eb2, + 0xdb0b487b6423e1e8, + 0xb049dc016abc5e5f, + 0x91ce1a9a3d2cda62, + 0xdc5c5301c56b75f7, + 0x7641a140cc7810fb, + 0x89b9b3e11b6329ba, + 0xa9e904c87fcb0a9d, + 0xac2820d9623bf429, + 0x546345fa9fbdcd44, + 0xd732290fbacaf133, + 0xa97c177947ad4095, + 0x867f59a9d4bed6c0, + 0x49ed8eabcccc485d, + 0xa81f301449ee8c70, + 0x5c68f256bfff5a74, + 0xd226fc195c6a2f8c, + 0x73832eec6fff3111, + 0x83585d8fd9c25db7, + 0xc831fd53c5ff7eab, + 0xa42e74f3d032f525, + 0xba3e7ca8b77f5e55, + 0xcd3a1230c43fb26f, + 0x28ce1bd2e55f35eb, + 0x80444b5e7aa7cf85, + 0x7980d163cf5b81b3, + 0xa0555e361951c366, + 0xd7e105bcc332621f, + 0xc86ab5c39fa63440, + 0x8dd9472bf3fefaa7, + 0xfa856334878fc150, + 0xb14f98f6f0feb951, + 0x9c935e00d4b9d8d2, + 0x6ed1bf9a569f33d3, + 0xc3b8358109e84f07, + 0xa862f80ec4700c8, + 0xf4a642e14c6262c8, + 0xcd27bb612758c0fa, + 0x98e7e9cccfbd7dbd, + 0x8038d51cb897789c, + 0xbf21e44003acdd2c, + 0xe0470a63e6bd56c3, + 0xeeea5d5004981478, + 0x1858ccfce06cac74, + 0x95527a5202df0ccb, + 0xf37801e0c43ebc8, + 0xbaa718e68396cffd, + 0xd30560258f54e6ba, + 0xe950df20247c83fd, + 0x47c6b82ef32a2069, + 0x91d28b7416cdd27e, + 0x4cdc331d57fa5441, + 0xb6472e511c81471d, + 0xe0133fe4adf8e952, + 0xe3d8f9e563a198e5, + 0x58180fddd97723a6, + 0x8e679c2f5e44ff8f, + 0x570f09eaa7ea7648, + }; + }; + + template + constexpr uint64_t powers_template::power_of_five_128[number_of_entries]; + + using powers = powers_template<>; + +} // namespace fast_float #endif @@ -2201,181 +3064,210 @@ using powers = powers_template<>; #include #include -namespace fast_float { +namespace fast_float +{ -// This will compute or rather approximate w * 5**q and return a pair of 64-bit words approximating -// the result, with the "high" part corresponding to the most significant bits and the -// low part corresponding to the least significant bits. -// -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -value128 compute_product_approximation(int64_t q, uint64_t w) { - const int index = 2 * int(q - powers::smallest_power_of_five); - // For small values of q, e.g., q in [0,27], the answer is always exact because - // The line value128 firstproduct = full_multiplication(w, power_of_five_128[index]); - // gives the exact answer. - value128 firstproduct = full_multiplication(w, powers::power_of_five_128[index]); - static_assert((bit_precision >= 0) && (bit_precision <= 64), " precision should be in (0,64]"); - constexpr uint64_t precision_mask = (bit_precision < 64) ? - (uint64_t(0xFFFFFFFFFFFFFFFF) >> bit_precision) - : uint64_t(0xFFFFFFFFFFFFFFFF); - if((firstproduct.high & precision_mask) == precision_mask) { // could further guard with (lower + w < lower) - // regarding the second product, we only need secondproduct.high, but our expectation is that the compiler will optimize this extra work away if needed. - value128 secondproduct = full_multiplication(w, powers::power_of_five_128[index + 1]); - firstproduct.low += secondproduct.high; - if(secondproduct.high > firstproduct.low) { - firstproduct.high++; - } - } - return firstproduct; -} - -namespace detail { -/** - * For q in (0,350), we have that - * f = (((152170 + 65536) * q ) >> 16); - * is equal to - * floor(p) + q - * where - * p = log(5**q)/log(2) = q * log(5)/log(2) - * - * For negative values of q in (-400,0), we have that - * f = (((152170 + 65536) * q ) >> 16); - * is equal to - * -ceil(p) + q - * where - * p = log(5**-q)/log(2) = -q * log(5)/log(2) - */ - constexpr fastfloat_really_inline int32_t power(int32_t q) noexcept { - return (((152170 + 65536) * q) >> 16) + 63; - } -} // namespace detail - -// create an adjusted mantissa, biased by the invalid power2 -// for significant digits already multiplied by 10 ** q. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -adjusted_mantissa compute_error_scaled(int64_t q, uint64_t w, int lz) noexcept { - int hilz = int(w >> 63) ^ 1; - adjusted_mantissa answer; - answer.mantissa = w << hilz; - int bias = binary::mantissa_explicit_bits() - binary::minimum_exponent(); - answer.power2 = int32_t(detail::power(int32_t(q)) + bias - hilz - lz - 62 + invalid_am_bias); - return answer; -} - -// w * 10 ** q, without rounding the representation up. -// the power2 in the exponent will be adjusted by invalid_am_bias. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa compute_error(int64_t q, uint64_t w) noexcept { - int lz = leading_zeroes(w); - w <<= lz; - value128 product = compute_product_approximation(q, w); - return compute_error_scaled(q, product.high, lz); -} - -// w * 10 ** q -// The returned value should be a valid ieee64 number that simply need to be packed. -// However, in some very rare cases, the computation will fail. In such cases, we -// return an adjusted_mantissa with a negative power of 2: the caller should recompute -// in such cases. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa compute_float(int64_t q, uint64_t w) noexcept { - adjusted_mantissa answer; - if ((w == 0) || (q < binary::smallest_power_of_ten())) { - answer.power2 = 0; - answer.mantissa = 0; - // result should be zero - return answer; - } - if (q > binary::largest_power_of_ten()) { - // we want to get infinity: - answer.power2 = binary::infinite_power(); - answer.mantissa = 0; - return answer; - } - // At this point in time q is in [powers::smallest_power_of_five, powers::largest_power_of_five]. - - // We want the most significant bit of i to be 1. Shift if needed. - int lz = leading_zeroes(w); - w <<= lz; - - // The required precision is binary::mantissa_explicit_bits() + 3 because - // 1. We need the implicit bit - // 2. We need an extra bit for rounding purposes - // 3. We might lose a bit due to the "upperbit" routine (result too small, requiring a shift) - - value128 product = compute_product_approximation(q, w); - // The computed 'product' is always sufficient. - // Mathematical proof: - // Noble Mushtak and Daniel Lemire, Fast Number Parsing Without Fallback (to appear) - // See script/mushtak_lemire.py - - // The "compute_product_approximation" function can be slightly slower than a branchless approach: - // value128 product = compute_product(q, w); - // but in practice, we can win big with the compute_product_approximation if its additional branch - // is easily predicted. Which is best is data specific. - int upperbit = int(product.high >> 63); - - answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3); - - answer.power2 = int32_t(detail::power(int32_t(q)) + upperbit - lz - binary::minimum_exponent()); - if (answer.power2 <= 0) { // we have a subnormal? - // Here have that answer.power2 <= 0 so -answer.power2 >= 0 - if(-answer.power2 + 1 >= 64) { // if we have more than 64 bits below the minimum exponent, you have a zero for sure. - answer.power2 = 0; - answer.mantissa = 0; - // result should be zero - return answer; - } - // next line is safe because -answer.power2 + 1 < 64 - answer.mantissa >>= -answer.power2 + 1; - // Thankfully, we can't have both "round-to-even" and subnormals because - // "round-to-even" only occurs for powers close to 0. - answer.mantissa += (answer.mantissa & 1); // round up - answer.mantissa >>= 1; - // There is a weird scenario where we don't have a subnormal but just. - // Suppose we start with 2.2250738585072013e-308, we end up - // with 0x3fffffffffffff x 2^-1023-53 which is technically subnormal - // whereas 0x40000000000000 x 2^-1023-53 is normal. Now, we need to round - // up 0x3fffffffffffff x 2^-1023-53 and once we do, we are no longer - // subnormal, but we can only know this after rounding. - // So we only declare a subnormal if we are smaller than the threshold. - answer.power2 = (answer.mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) ? 0 : 1; - return answer; - } - - // usually, we round *up*, but if we fall right in between and and we have an - // even basis, we need to round down - // We are only concerned with the cases where 5**q fits in single 64-bit word. - if ((product.low <= 1) && (q >= binary::min_exponent_round_to_even()) && (q <= binary::max_exponent_round_to_even()) && - ((answer.mantissa & 3) == 1) ) { // we may fall between two floats! - // To be in-between two floats we need that in doing - // answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3); - // ... we dropped out only zeroes. But if this happened, then we can go back!!! - if((answer.mantissa << (upperbit + 64 - binary::mantissa_explicit_bits() - 3)) == product.high) { - answer.mantissa &= ~uint64_t(1); // flip it so that we do not round up - } - } - - answer.mantissa += (answer.mantissa & 1); // round up - answer.mantissa >>= 1; - if (answer.mantissa >= (uint64_t(2) << binary::mantissa_explicit_bits())) { - answer.mantissa = (uint64_t(1) << binary::mantissa_explicit_bits()); - answer.power2++; // undo previous addition - } - - answer.mantissa &= ~(uint64_t(1) << binary::mantissa_explicit_bits()); - if (answer.power2 >= binary::infinite_power()) { // infinity - answer.power2 = binary::infinite_power(); - answer.mantissa = 0; - } - return answer; -} - -} // namespace fast_float + // This will compute or rather approximate w * 5**q and return a pair of 64-bit words + // approximating the result, with the "high" part corresponding to the most significant bits and + // the low part corresponding to the least significant bits. + // + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 value128 compute_product_approximation( + int64_t q, uint64_t w) + { + const int index = 2 * int(q - powers::smallest_power_of_five); + // For small values of q, e.g., q in [0,27], the answer is always exact because + // The line value128 firstproduct = full_multiplication(w, power_of_five_128[index]); + // gives the exact answer. + value128 firstproduct = full_multiplication(w, powers::power_of_five_128[index]); + static_assert( + (bit_precision >= 0) && (bit_precision <= 64), " precision should be in (0,64]"); + constexpr uint64_t precision_mask = (bit_precision < 64) + ? (uint64_t(0xFFFFFFFFFFFFFFFF) >> bit_precision) + : uint64_t(0xFFFFFFFFFFFFFFFF); + if ((firstproduct.high & precision_mask) == precision_mask) + { // could further guard with (lower + w < lower) + // regarding the second product, we only need secondproduct.high, but our expectation is + // that the compiler will optimize this extra work away if needed. + value128 secondproduct = full_multiplication(w, powers::power_of_five_128[index + 1]); + firstproduct.low += secondproduct.high; + if (secondproduct.high > firstproduct.low) + { + firstproduct.high++; + } + } + return firstproduct; + } + + namespace detail + { + /** + * For q in (0,350), we have that + * f = (((152170 + 65536) * q ) >> 16); + * is equal to + * floor(p) + q + * where + * p = log(5**q)/log(2) = q * log(5)/log(2) + * + * For negative values of q in (-400,0), we have that + * f = (((152170 + 65536) * q ) >> 16); + * is equal to + * -ceil(p) + q + * where + * p = log(5**-q)/log(2) = -q * log(5)/log(2) + */ + constexpr fastfloat_really_inline int32_t power(int32_t q) noexcept + { + return (((152170 + 65536) * q) >> 16) + 63; + } + } // namespace detail + + // create an adjusted mantissa, biased by the invalid power2 + // for significant digits already multiplied by 10 ** q. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 adjusted_mantissa compute_error_scaled( + int64_t q, uint64_t w, int lz) noexcept + { + int hilz = int(w >> 63) ^ 1; + adjusted_mantissa answer; + answer.mantissa = w << hilz; + int bias = binary::mantissa_explicit_bits() - binary::minimum_exponent(); + answer.power2 = + int32_t(detail::power(int32_t(q)) + bias - hilz - lz - 62 + invalid_am_bias); + return answer; + } + + // w * 10 ** q, without rounding the representation up. + // the power2 in the exponent will be adjusted by invalid_am_bias. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa compute_error( + int64_t q, uint64_t w) noexcept + { + int lz = leading_zeroes(w); + w <<= lz; + value128 product = + compute_product_approximation(q, w); + return compute_error_scaled(q, product.high, lz); + } + + // w * 10 ** q + // The returned value should be a valid ieee64 number that simply need to be packed. + // However, in some very rare cases, the computation will fail. In such cases, we + // return an adjusted_mantissa with a negative power of 2: the caller should recompute + // in such cases. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa compute_float( + int64_t q, uint64_t w) noexcept + { + adjusted_mantissa answer; + if ((w == 0) || (q < binary::smallest_power_of_ten())) + { + answer.power2 = 0; + answer.mantissa = 0; + // result should be zero + return answer; + } + if (q > binary::largest_power_of_ten()) + { + // we want to get infinity: + answer.power2 = binary::infinite_power(); + answer.mantissa = 0; + return answer; + } + // At this point in time q is in [powers::smallest_power_of_five, + // powers::largest_power_of_five]. + + // We want the most significant bit of i to be 1. Shift if needed. + int lz = leading_zeroes(w); + w <<= lz; + + // The required precision is binary::mantissa_explicit_bits() + 3 because + // 1. We need the implicit bit + // 2. We need an extra bit for rounding purposes + // 3. We might lose a bit due to the "upperbit" routine (result too small, requiring a + // shift) + + value128 product = + compute_product_approximation(q, w); + // The computed 'product' is always sufficient. + // Mathematical proof: + // Noble Mushtak and Daniel Lemire, Fast Number Parsing Without Fallback (to appear) + // See script/mushtak_lemire.py + + // The "compute_product_approximation" function can be slightly slower than a branchless + // approach: value128 product = compute_product(q, w); but in practice, we can win big with + // the compute_product_approximation if its additional branch is easily predicted. Which is + // best is data specific. + int upperbit = int(product.high >> 63); + + answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3); + + answer.power2 = + int32_t(detail::power(int32_t(q)) + upperbit - lz - binary::minimum_exponent()); + if (answer.power2 <= 0) + { // we have a subnormal? + // Here have that answer.power2 <= 0 so -answer.power2 >= 0 + if (-answer.power2 + 1 >= 64) + { // if we have more than 64 bits below the minimum exponent, you have a zero for + // sure. + answer.power2 = 0; + answer.mantissa = 0; + // result should be zero + return answer; + } + // next line is safe because -answer.power2 + 1 < 64 + answer.mantissa >>= -answer.power2 + 1; + // Thankfully, we can't have both "round-to-even" and subnormals because + // "round-to-even" only occurs for powers close to 0. + answer.mantissa += (answer.mantissa & 1); // round up + answer.mantissa >>= 1; + // There is a weird scenario where we don't have a subnormal but just. + // Suppose we start with 2.2250738585072013e-308, we end up + // with 0x3fffffffffffff x 2^-1023-53 which is technically subnormal + // whereas 0x40000000000000 x 2^-1023-53 is normal. Now, we need to round + // up 0x3fffffffffffff x 2^-1023-53 and once we do, we are no longer + // subnormal, but we can only know this after rounding. + // So we only declare a subnormal if we are smaller than the threshold. + answer.power2 = + (answer.mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) ? 0 : 1; + return answer; + } + + // usually, we round *up*, but if we fall right in between and and we have an + // even basis, we need to round down + // We are only concerned with the cases where 5**q fits in single 64-bit word. + if ((product.low <= 1) && (q >= binary::min_exponent_round_to_even()) + && (q <= binary::max_exponent_round_to_even()) && ((answer.mantissa & 3) == 1)) + { // we may fall between two floats! + // To be in-between two floats we need that in doing + // answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() + // - 3); + // ... we dropped out only zeroes. But if this happened, then we can go back!!! + if ((answer.mantissa << (upperbit + 64 - binary::mantissa_explicit_bits() - 3)) + == product.high) + { + answer.mantissa &= ~uint64_t(1); // flip it so that we do not round up + } + } + + answer.mantissa += (answer.mantissa & 1); // round up + answer.mantissa >>= 1; + if (answer.mantissa >= (uint64_t(2) << binary::mantissa_explicit_bits())) + { + answer.mantissa = (uint64_t(1) << binary::mantissa_explicit_bits()); + answer.power2++; // undo previous addition + } + + answer.mantissa &= ~(uint64_t(1) << binary::mantissa_explicit_bits()); + if (answer.power2 >= binary::infinite_power()) + { // infinity + answer.power2 = binary::infinite_power(); + answer.mantissa = 0; + } + return answer; + } + +} // namespace fast_float #endif @@ -2383,12 +3275,14 @@ adjusted_mantissa compute_float(int64_t q, uint64_t w) noexcept { #define FASTFLOAT_BIGINT_H #include -#include #include +#include #include -namespace fast_float { + +namespace fast_float +{ // the limb width: we want efficient multiplication of double the bits in // limb, or for 64-bit limbs, at least 64-bit multiplication where we can @@ -2397,602 +3291,733 @@ namespace fast_float { // we might have platforms where `CHAR_BIT` is not 8, so let's avoid // doing `8 * sizeof(limb)`. #if defined(FASTFLOAT_64BIT) && !defined(__sparc) -#define FASTFLOAT_64BIT_LIMB 1 -typedef uint64_t limb; -constexpr size_t limb_bits = 64; + #define FASTFLOAT_64BIT_LIMB 1 + typedef uint64_t limb; + constexpr size_t limb_bits = 64; #else -#define FASTFLOAT_32BIT_LIMB -typedef uint32_t limb; -constexpr size_t limb_bits = 32; -#endif - -typedef span limb_span; - -// number of bits in a bigint. this needs to be at least the number -// of bits required to store the largest bigint, which is -// `log2(10**(digits + max_exp))`, or `log2(10**(767 + 342))`, or -// ~3600 bits, so we round to 4000. -constexpr size_t bigint_bits = 4000; -constexpr size_t bigint_limbs = bigint_bits / limb_bits; - -// vector-like type that is allocated on the stack. the entire -// buffer is pre-allocated, and only the length changes. -template -struct stackvec { - limb data[size]; - // we never need more than 150 limbs - uint16_t length{0}; - - stackvec() = default; - stackvec(const stackvec &) = delete; - stackvec &operator=(const stackvec &) = delete; - stackvec(stackvec &&) = delete; - stackvec &operator=(stackvec &&other) = delete; - - // create stack vector from existing limb span. - FASTFLOAT_CONSTEXPR20 stackvec(limb_span s) { - FASTFLOAT_ASSERT(try_extend(s)); - } - - FASTFLOAT_CONSTEXPR14 limb& operator[](size_t index) noexcept { - FASTFLOAT_DEBUG_ASSERT(index < length); - return data[index]; - } - FASTFLOAT_CONSTEXPR14 const limb& operator[](size_t index) const noexcept { - FASTFLOAT_DEBUG_ASSERT(index < length); - return data[index]; - } - // index from the end of the container - FASTFLOAT_CONSTEXPR14 const limb& rindex(size_t index) const noexcept { - FASTFLOAT_DEBUG_ASSERT(index < length); - size_t rindex = length - index - 1; - return data[rindex]; - } - - // set the length, without bounds checking. - FASTFLOAT_CONSTEXPR14 void set_len(size_t len) noexcept { - length = uint16_t(len); - } - constexpr size_t len() const noexcept { - return length; - } - constexpr bool is_empty() const noexcept { - return length == 0; - } - constexpr size_t capacity() const noexcept { - return size; - } - // append item to vector, without bounds checking - FASTFLOAT_CONSTEXPR14 void push_unchecked(limb value) noexcept { - data[length] = value; - length++; - } - // append item to vector, returning if item was added - FASTFLOAT_CONSTEXPR14 bool try_push(limb value) noexcept { - if (len() < capacity()) { - push_unchecked(value); - return true; - } else { - return false; - } - } - // add items to the vector, from a span, without bounds checking - FASTFLOAT_CONSTEXPR20 void extend_unchecked(limb_span s) noexcept { - limb* ptr = data + length; - std::copy_n(s.ptr, s.len(), ptr); - set_len(len() + s.len()); - } - // try to add items to the vector, returning if items were added - FASTFLOAT_CONSTEXPR20 bool try_extend(limb_span s) noexcept { - if (len() + s.len() <= capacity()) { - extend_unchecked(s); - return true; - } else { - return false; - } - } - // resize the vector, without bounds checking - // if the new size is longer than the vector, assign value to each - // appended item. - FASTFLOAT_CONSTEXPR20 - void resize_unchecked(size_t new_len, limb value) noexcept { - if (new_len > len()) { - size_t count = new_len - len(); - limb* first = data + len(); - limb* last = first + count; - ::std::fill(first, last, value); - set_len(new_len); - } else { - set_len(new_len); - } - } - // try to resize the vector, returning if the vector was resized. - FASTFLOAT_CONSTEXPR20 bool try_resize(size_t new_len, limb value) noexcept { - if (new_len > capacity()) { - return false; - } else { - resize_unchecked(new_len, value); - return true; - } - } - // check if any limbs are non-zero after the given index. - // this needs to be done in reverse order, since the index - // is relative to the most significant limbs. - FASTFLOAT_CONSTEXPR14 bool nonzero(size_t index) const noexcept { - while (index < len()) { - if (rindex(index) != 0) { - return true; - } - index++; - } - return false; - } - // normalize the big integer, so most-significant zero limbs are removed. - FASTFLOAT_CONSTEXPR14 void normalize() noexcept { - while (len() > 0 && rindex(0) == 0) { - length--; - } - } -}; - -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -uint64_t empty_hi64(bool& truncated) noexcept { - truncated = false; - return 0; -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t uint64_hi64(uint64_t r0, bool& truncated) noexcept { - truncated = false; - int shl = leading_zeroes(r0); - return r0 << shl; -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t uint64_hi64(uint64_t r0, uint64_t r1, bool& truncated) noexcept { - int shl = leading_zeroes(r0); - if (shl == 0) { - truncated = r1 != 0; - return r0; - } else { - int shr = 64 - shl; - truncated = (r1 << shl) != 0; - return (r0 << shl) | (r1 >> shr); - } -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t uint32_hi64(uint32_t r0, bool& truncated) noexcept { - return uint64_hi64(r0, truncated); -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t uint32_hi64(uint32_t r0, uint32_t r1, bool& truncated) noexcept { - uint64_t x0 = r0; - uint64_t x1 = r1; - return uint64_hi64((x0 << 32) | x1, truncated); -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -uint64_t uint32_hi64(uint32_t r0, uint32_t r1, uint32_t r2, bool& truncated) noexcept { - uint64_t x0 = r0; - uint64_t x1 = r1; - uint64_t x2 = r2; - return uint64_hi64(x0, (x1 << 32) | x2, truncated); -} - -// add two small integers, checking for overflow. -// we want an efficient operation. for msvc, where -// we don't have built-in intrinsics, this is still -// pretty fast. -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -limb scalar_add(limb x, limb y, bool& overflow) noexcept { - limb z; + #define FASTFLOAT_32BIT_LIMB + typedef uint32_t limb; + constexpr size_t limb_bits = 32; +#endif + + typedef span limb_span; + + // number of bits in a bigint. this needs to be at least the number + // of bits required to store the largest bigint, which is + // `log2(10**(digits + max_exp))`, or `log2(10**(767 + 342))`, or + // ~3600 bits, so we round to 4000. + constexpr size_t bigint_bits = 4000; + constexpr size_t bigint_limbs = bigint_bits / limb_bits; + + // vector-like type that is allocated on the stack. the entire + // buffer is pre-allocated, and only the length changes. + template + struct stackvec + { + limb data[size]; + // we never need more than 150 limbs + uint16_t length{0}; + + stackvec() = default; + stackvec(const stackvec&) = delete; + stackvec& operator=(const stackvec&) = delete; + stackvec(stackvec&&) = delete; + stackvec& operator=(stackvec&& other) = delete; + + // create stack vector from existing limb span. + FASTFLOAT_CONSTEXPR20 stackvec(limb_span s) + { + FASTFLOAT_ASSERT(try_extend(s)); + } + + FASTFLOAT_CONSTEXPR14 limb& operator[](size_t index) noexcept + { + FASTFLOAT_DEBUG_ASSERT(index < length); + return data[index]; + } + FASTFLOAT_CONSTEXPR14 const limb& operator[](size_t index) const noexcept + { + FASTFLOAT_DEBUG_ASSERT(index < length); + return data[index]; + } + // index from the end of the container + FASTFLOAT_CONSTEXPR14 const limb& rindex(size_t index) const noexcept + { + FASTFLOAT_DEBUG_ASSERT(index < length); + size_t rindex = length - index - 1; + return data[rindex]; + } + + // set the length, without bounds checking. + FASTFLOAT_CONSTEXPR14 void set_len(size_t len) noexcept + { + length = uint16_t(len); + } + constexpr size_t len() const noexcept + { + return length; + } + constexpr bool is_empty() const noexcept + { + return length == 0; + } + constexpr size_t capacity() const noexcept + { + return size; + } + // append item to vector, without bounds checking + FASTFLOAT_CONSTEXPR14 void push_unchecked(limb value) noexcept + { + data[length] = value; + length++; + } + // append item to vector, returning if item was added + FASTFLOAT_CONSTEXPR14 bool try_push(limb value) noexcept + { + if (len() < capacity()) + { + push_unchecked(value); + return true; + } + else + { + return false; + } + } + // add items to the vector, from a span, without bounds checking + FASTFLOAT_CONSTEXPR20 void extend_unchecked(limb_span s) noexcept + { + limb* ptr = data + length; + std::copy_n(s.ptr, s.len(), ptr); + set_len(len() + s.len()); + } + // try to add items to the vector, returning if items were added + FASTFLOAT_CONSTEXPR20 bool try_extend(limb_span s) noexcept + { + if (len() + s.len() <= capacity()) + { + extend_unchecked(s); + return true; + } + else + { + return false; + } + } + // resize the vector, without bounds checking + // if the new size is longer than the vector, assign value to each + // appended item. + FASTFLOAT_CONSTEXPR20 + void resize_unchecked(size_t new_len, limb value) noexcept + { + if (new_len > len()) + { + size_t count = new_len - len(); + limb* first = data + len(); + limb* last = first + count; + ::std::fill(first, last, value); + set_len(new_len); + } + else + { + set_len(new_len); + } + } + // try to resize the vector, returning if the vector was resized. + FASTFLOAT_CONSTEXPR20 bool try_resize(size_t new_len, limb value) noexcept + { + if (new_len > capacity()) + { + return false; + } + else + { + resize_unchecked(new_len, value); + return true; + } + } + // check if any limbs are non-zero after the given index. + // this needs to be done in reverse order, since the index + // is relative to the most significant limbs. + FASTFLOAT_CONSTEXPR14 bool nonzero(size_t index) const noexcept + { + while (index < len()) + { + if (rindex(index) != 0) + { + return true; + } + index++; + } + return false; + } + // normalize the big integer, so most-significant zero limbs are removed. + FASTFLOAT_CONSTEXPR14 void normalize() noexcept + { + while (len() > 0 && rindex(0) == 0) + { + length--; + } + } + }; + + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 uint64_t empty_hi64(bool& truncated) noexcept + { + truncated = false; + return 0; + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t uint64_hi64( + uint64_t r0, bool& truncated) noexcept + { + truncated = false; + int shl = leading_zeroes(r0); + return r0 << shl; + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t uint64_hi64( + uint64_t r0, uint64_t r1, bool& truncated) noexcept + { + int shl = leading_zeroes(r0); + if (shl == 0) + { + truncated = r1 != 0; + return r0; + } + else + { + int shr = 64 - shl; + truncated = (r1 << shl) != 0; + return (r0 << shl) | (r1 >> shr); + } + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t uint32_hi64( + uint32_t r0, bool& truncated) noexcept + { + return uint64_hi64(r0, truncated); + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t uint32_hi64( + uint32_t r0, uint32_t r1, bool& truncated) noexcept + { + uint64_t x0 = r0; + uint64_t x1 = r1; + return uint64_hi64((x0 << 32) | x1, truncated); + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 uint64_t uint32_hi64( + uint32_t r0, uint32_t r1, uint32_t r2, bool& truncated) noexcept + { + uint64_t x0 = r0; + uint64_t x1 = r1; + uint64_t x2 = r2; + return uint64_hi64(x0, (x1 << 32) | x2, truncated); + } + + // add two small integers, checking for overflow. + // we want an efficient operation. for msvc, where + // we don't have built-in intrinsics, this is still + // pretty fast. + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 limb scalar_add( + limb x, limb y, bool& overflow) noexcept + { + limb z; // gcc and clang #if defined(__has_builtin) - #if __has_builtin(__builtin_add_overflow) - if (!cpp20_and_in_constexpr()) { - overflow = __builtin_add_overflow(x, y, &z); - return z; - } - #endif -#endif - - // generic, this still optimizes correctly on MSVC. - z = x + y; - overflow = z < x; - return z; -} - -// multiply two small integers, getting both the high and low bits. -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -limb scalar_mul(limb x, limb y, limb& carry) noexcept { + #if __has_builtin(__builtin_add_overflow) + if (!cpp20_and_in_constexpr()) + { + overflow = __builtin_add_overflow(x, y, &z); + return z; + } + #endif +#endif + + // generic, this still optimizes correctly on MSVC. + z = x + y; + overflow = z < x; + return z; + } + + // multiply two small integers, getting both the high and low bits. + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 limb scalar_mul( + limb x, limb y, limb& carry) noexcept + { #ifdef FASTFLOAT_64BIT_LIMB - #if defined(__SIZEOF_INT128__) - // GCC and clang both define it as an extension. - __uint128_t z = __uint128_t(x) * __uint128_t(y) + __uint128_t(carry); - carry = limb(z >> limb_bits); - return limb(z); - #else - // fallback, no native 128-bit integer multiplication with carry. - // on msvc, this optimizes identically, somehow. - value128 z = full_multiplication(x, y); - bool overflow; - z.low = scalar_add(z.low, carry, overflow); - z.high += uint64_t(overflow); // cannot overflow - carry = z.high; - return z.low; - #endif + #if defined(__SIZEOF_INT128__) + // GCC and clang both define it as an extension. + __uint128_t z = __uint128_t(x) * __uint128_t(y) + __uint128_t(carry); + carry = limb(z >> limb_bits); + return limb(z); + #else + // fallback, no native 128-bit integer multiplication with carry. + // on msvc, this optimizes identically, somehow. + value128 z = full_multiplication(x, y); + bool overflow; + z.low = scalar_add(z.low, carry, overflow); + z.high += uint64_t(overflow); // cannot overflow + carry = z.high; + return z.low; + #endif #else - uint64_t z = uint64_t(x) * uint64_t(y) + uint64_t(carry); - carry = limb(z >> limb_bits); - return limb(z); -#endif -} - -// add scalar value to bigint starting from offset. -// used in grade school multiplication -template -inline FASTFLOAT_CONSTEXPR20 -bool small_add_from(stackvec& vec, limb y, size_t start) noexcept { - size_t index = start; - limb carry = y; - bool overflow; - while (carry != 0 && index < vec.len()) { - vec[index] = scalar_add(vec[index], carry, overflow); - carry = limb(overflow); - index += 1; - } - if (carry != 0) { - FASTFLOAT_TRY(vec.try_push(carry)); - } - return true; -} - -// add scalar value to bigint. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -bool small_add(stackvec& vec, limb y) noexcept { - return small_add_from(vec, y, 0); -} - -// multiply bigint by scalar value. -template -inline FASTFLOAT_CONSTEXPR20 -bool small_mul(stackvec& vec, limb y) noexcept { - limb carry = 0; - for (size_t index = 0; index < vec.len(); index++) { - vec[index] = scalar_mul(vec[index], y, carry); - } - if (carry != 0) { - FASTFLOAT_TRY(vec.try_push(carry)); - } - return true; -} - -// add bigint to bigint starting from index. -// used in grade school multiplication -template -FASTFLOAT_CONSTEXPR20 -bool large_add_from(stackvec& x, limb_span y, size_t start) noexcept { - // the effective x buffer is from `xstart..x.len()`, so exit early - // if we can't get that current range. - if (x.len() < start || y.len() > x.len() - start) { - FASTFLOAT_TRY(x.try_resize(y.len() + start, 0)); - } - - bool carry = false; - for (size_t index = 0; index < y.len(); index++) { - limb xi = x[index + start]; - limb yi = y[index]; - bool c1 = false; - bool c2 = false; - xi = scalar_add(xi, yi, c1); - if (carry) { - xi = scalar_add(xi, 1, c2); - } - x[index + start] = xi; - carry = c1 | c2; - } - - // handle overflow - if (carry) { - FASTFLOAT_TRY(small_add_from(x, 1, y.len() + start)); - } - return true; -} - -// add bigint to bigint. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -bool large_add_from(stackvec& x, limb_span y) noexcept { - return large_add_from(x, y, 0); -} - -// grade-school multiplication algorithm -template -FASTFLOAT_CONSTEXPR20 -bool long_mul(stackvec& x, limb_span y) noexcept { - limb_span xs = limb_span(x.data, x.len()); - stackvec z(xs); - limb_span zs = limb_span(z.data, z.len()); - - if (y.len() != 0) { - limb y0 = y[0]; - FASTFLOAT_TRY(small_mul(x, y0)); - for (size_t index = 1; index < y.len(); index++) { - limb yi = y[index]; - stackvec zi; - if (yi != 0) { - // re-use the same buffer throughout - zi.set_len(0); - FASTFLOAT_TRY(zi.try_extend(zs)); - FASTFLOAT_TRY(small_mul(zi, yi)); - limb_span zis = limb_span(zi.data, zi.len()); - FASTFLOAT_TRY(large_add_from(x, zis, index)); - } - } - } - - x.normalize(); - return true; -} - -// grade-school multiplication algorithm -template -FASTFLOAT_CONSTEXPR20 -bool large_mul(stackvec& x, limb_span y) noexcept { - if (y.len() == 1) { - FASTFLOAT_TRY(small_mul(x, y[0])); - } else { - FASTFLOAT_TRY(long_mul(x, y)); - } - return true; -} - -template -struct pow5_tables { - static constexpr uint32_t large_step = 135; - static constexpr uint64_t small_power_of_5[] = { - 1UL, 5UL, 25UL, 125UL, 625UL, 3125UL, 15625UL, 78125UL, 390625UL, - 1953125UL, 9765625UL, 48828125UL, 244140625UL, 1220703125UL, - 6103515625UL, 30517578125UL, 152587890625UL, 762939453125UL, - 3814697265625UL, 19073486328125UL, 95367431640625UL, 476837158203125UL, - 2384185791015625UL, 11920928955078125UL, 59604644775390625UL, - 298023223876953125UL, 1490116119384765625UL, 7450580596923828125UL, - }; + uint64_t z = uint64_t(x) * uint64_t(y) + uint64_t(carry); + carry = limb(z >> limb_bits); + return limb(z); +#endif + } + + // add scalar value to bigint starting from offset. + // used in grade school multiplication + template + inline FASTFLOAT_CONSTEXPR20 bool small_add_from( + stackvec& vec, limb y, size_t start) noexcept + { + size_t index = start; + limb carry = y; + bool overflow; + while (carry != 0 && index < vec.len()) + { + vec[index] = scalar_add(vec[index], carry, overflow); + carry = limb(overflow); + index += 1; + } + if (carry != 0) + { + FASTFLOAT_TRY(vec.try_push(carry)); + } + return true; + } + + // add scalar value to bigint. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 bool small_add( + stackvec& vec, limb y) noexcept + { + return small_add_from(vec, y, 0); + } + + // multiply bigint by scalar value. + template + inline FASTFLOAT_CONSTEXPR20 bool small_mul(stackvec& vec, limb y) noexcept + { + limb carry = 0; + for (size_t index = 0; index < vec.len(); index++) + { + vec[index] = scalar_mul(vec[index], y, carry); + } + if (carry != 0) + { + FASTFLOAT_TRY(vec.try_push(carry)); + } + return true; + } + + // add bigint to bigint starting from index. + // used in grade school multiplication + template + FASTFLOAT_CONSTEXPR20 bool large_add_from(stackvec& x, limb_span y, size_t start) noexcept + { + // the effective x buffer is from `xstart..x.len()`, so exit early + // if we can't get that current range. + if (x.len() < start || y.len() > x.len() - start) + { + FASTFLOAT_TRY(x.try_resize(y.len() + start, 0)); + } + + bool carry = false; + for (size_t index = 0; index < y.len(); index++) + { + limb xi = x[index + start]; + limb yi = y[index]; + bool c1 = false; + bool c2 = false; + xi = scalar_add(xi, yi, c1); + if (carry) + { + xi = scalar_add(xi, 1, c2); + } + x[index + start] = xi; + carry = c1 | c2; + } + + // handle overflow + if (carry) + { + FASTFLOAT_TRY(small_add_from(x, 1, y.len() + start)); + } + return true; + } + + // add bigint to bigint. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 bool large_add_from( + stackvec& x, limb_span y) noexcept + { + return large_add_from(x, y, 0); + } + + // grade-school multiplication algorithm + template + FASTFLOAT_CONSTEXPR20 bool long_mul(stackvec& x, limb_span y) noexcept + { + limb_span xs = limb_span(x.data, x.len()); + stackvec z(xs); + limb_span zs = limb_span(z.data, z.len()); + + if (y.len() != 0) + { + limb y0 = y[0]; + FASTFLOAT_TRY(small_mul(x, y0)); + for (size_t index = 1; index < y.len(); index++) + { + limb yi = y[index]; + stackvec zi; + if (yi != 0) + { + // re-use the same buffer throughout + zi.set_len(0); + FASTFLOAT_TRY(zi.try_extend(zs)); + FASTFLOAT_TRY(small_mul(zi, yi)); + limb_span zis = limb_span(zi.data, zi.len()); + FASTFLOAT_TRY(large_add_from(x, zis, index)); + } + } + } + + x.normalize(); + return true; + } + + // grade-school multiplication algorithm + template + FASTFLOAT_CONSTEXPR20 bool large_mul(stackvec& x, limb_span y) noexcept + { + if (y.len() == 1) + { + FASTFLOAT_TRY(small_mul(x, y[0])); + } + else + { + FASTFLOAT_TRY(long_mul(x, y)); + } + return true; + } + + template + struct pow5_tables + { + static constexpr uint32_t large_step = 135; + static constexpr uint64_t small_power_of_5[] = { + 1UL, + 5UL, + 25UL, + 125UL, + 625UL, + 3125UL, + 15625UL, + 78125UL, + 390625UL, + 1953125UL, + 9765625UL, + 48828125UL, + 244140625UL, + 1220703125UL, + 6103515625UL, + 30517578125UL, + 152587890625UL, + 762939453125UL, + 3814697265625UL, + 19073486328125UL, + 95367431640625UL, + 476837158203125UL, + 2384185791015625UL, + 11920928955078125UL, + 59604644775390625UL, + 298023223876953125UL, + 1490116119384765625UL, + 7450580596923828125UL, + }; #ifdef FASTFLOAT_64BIT_LIMB - constexpr static limb large_power_of_5[] = { - 1414648277510068013UL, 9180637584431281687UL, 4539964771860779200UL, - 10482974169319127550UL, 198276706040285095UL}; + constexpr static limb large_power_of_5[] = {1414648277510068013UL, 9180637584431281687UL, + 4539964771860779200UL, 10482974169319127550UL, 198276706040285095UL}; #else - constexpr static limb large_power_of_5[] = { - 4279965485U, 329373468U, 4020270615U, 2137533757U, 4287402176U, - 1057042919U, 1071430142U, 2440757623U, 381945767U, 46164893U}; + constexpr static limb large_power_of_5[] = {4279965485U, 329373468U, 4020270615U, + 2137533757U, 4287402176U, 1057042919U, 1071430142U, 2440757623U, 381945767U, 46164893U}; #endif -}; - -template -constexpr uint32_t pow5_tables::large_step; - -template -constexpr uint64_t pow5_tables::small_power_of_5[]; - -template -constexpr limb pow5_tables::large_power_of_5[]; - -// big integer type. implements a small subset of big integer -// arithmetic, using simple algorithms since asymptotically -// faster algorithms are slower for a small number of limbs. -// all operations assume the big-integer is normalized. -struct bigint : pow5_tables<> { - // storage of the limbs, in little-endian order. - stackvec vec; - - FASTFLOAT_CONSTEXPR20 bigint(): vec() {} - bigint(const bigint &) = delete; - bigint &operator=(const bigint &) = delete; - bigint(bigint &&) = delete; - bigint &operator=(bigint &&other) = delete; - - FASTFLOAT_CONSTEXPR20 bigint(uint64_t value): vec() { + }; + + template + constexpr uint32_t pow5_tables::large_step; + + template + constexpr uint64_t pow5_tables::small_power_of_5[]; + + template + constexpr limb pow5_tables::large_power_of_5[]; + + // big integer type. implements a small subset of big integer + // arithmetic, using simple algorithms since asymptotically + // faster algorithms are slower for a small number of limbs. + // all operations assume the big-integer is normalized. + struct bigint : pow5_tables<> + { + // storage of the limbs, in little-endian order. + stackvec vec; + + FASTFLOAT_CONSTEXPR20 bigint() : vec() {} + bigint(const bigint&) = delete; + bigint& operator=(const bigint&) = delete; + bigint(bigint&&) = delete; + bigint& operator=(bigint&& other) = delete; + + FASTFLOAT_CONSTEXPR20 bigint(uint64_t value) : vec() + { #ifdef FASTFLOAT_64BIT_LIMB - vec.push_unchecked(value); + vec.push_unchecked(value); #else - vec.push_unchecked(uint32_t(value)); - vec.push_unchecked(uint32_t(value >> 32)); + vec.push_unchecked(uint32_t(value)); + vec.push_unchecked(uint32_t(value >> 32)); #endif - vec.normalize(); - } + vec.normalize(); + } - // get the high 64 bits from the vector, and if bits were truncated. - // this is to get the significant digits for the float. - FASTFLOAT_CONSTEXPR20 uint64_t hi64(bool& truncated) const noexcept { + // get the high 64 bits from the vector, and if bits were truncated. + // this is to get the significant digits for the float. + FASTFLOAT_CONSTEXPR20 uint64_t hi64(bool& truncated) const noexcept + { #ifdef FASTFLOAT_64BIT_LIMB - if (vec.len() == 0) { - return empty_hi64(truncated); - } else if (vec.len() == 1) { - return uint64_hi64(vec.rindex(0), truncated); - } else { - uint64_t result = uint64_hi64(vec.rindex(0), vec.rindex(1), truncated); - truncated |= vec.nonzero(2); - return result; - } + if (vec.len() == 0) + { + return empty_hi64(truncated); + } + else if (vec.len() == 1) + { + return uint64_hi64(vec.rindex(0), truncated); + } + else + { + uint64_t result = uint64_hi64(vec.rindex(0), vec.rindex(1), truncated); + truncated |= vec.nonzero(2); + return result; + } #else - if (vec.len() == 0) { - return empty_hi64(truncated); - } else if (vec.len() == 1) { - return uint32_hi64(vec.rindex(0), truncated); - } else if (vec.len() == 2) { - return uint32_hi64(vec.rindex(0), vec.rindex(1), truncated); - } else { - uint64_t result = uint32_hi64(vec.rindex(0), vec.rindex(1), vec.rindex(2), truncated); - truncated |= vec.nonzero(3); - return result; - } -#endif - } - - // compare two big integers, returning the large value. - // assumes both are normalized. if the return value is - // negative, other is larger, if the return value is - // positive, this is larger, otherwise they are equal. - // the limbs are stored in little-endian order, so we - // must compare the limbs in ever order. - FASTFLOAT_CONSTEXPR20 int compare(const bigint& other) const noexcept { - if (vec.len() > other.vec.len()) { - return 1; - } else if (vec.len() < other.vec.len()) { - return -1; - } else { - for (size_t index = vec.len(); index > 0; index--) { - limb xi = vec[index - 1]; - limb yi = other.vec[index - 1]; - if (xi > yi) { - return 1; - } else if (xi < yi) { - return -1; - } - } - return 0; - } - } - - // shift left each limb n bits, carrying over to the new limb - // returns true if we were able to shift all the digits. - FASTFLOAT_CONSTEXPR20 bool shl_bits(size_t n) noexcept { - // Internally, for each item, we shift left by n, and add the previous - // right shifted limb-bits. - // For example, we transform (for u8) shifted left 2, to: - // b10100100 b01000010 - // b10 b10010001 b00001000 - FASTFLOAT_DEBUG_ASSERT(n != 0); - FASTFLOAT_DEBUG_ASSERT(n < sizeof(limb) * 8); - - size_t shl = n; - size_t shr = limb_bits - shl; - limb prev = 0; - for (size_t index = 0; index < vec.len(); index++) { - limb xi = vec[index]; - vec[index] = (xi << shl) | (prev >> shr); - prev = xi; - } - - limb carry = prev >> shr; - if (carry != 0) { - return vec.try_push(carry); - } - return true; - } - - // move the limbs left by `n` limbs. - FASTFLOAT_CONSTEXPR20 bool shl_limbs(size_t n) noexcept { - FASTFLOAT_DEBUG_ASSERT(n != 0); - if (n + vec.len() > vec.capacity()) { - return false; - } else if (!vec.is_empty()) { - // move limbs - limb* dst = vec.data + n; - const limb* src = vec.data; - std::copy_backward(src, src + vec.len(), dst + vec.len()); - // fill in empty limbs - limb* first = vec.data; - limb* last = first + n; - ::std::fill(first, last, 0); - vec.set_len(n + vec.len()); - return true; - } else { - return true; - } - } - - // move the limbs left by `n` bits. - FASTFLOAT_CONSTEXPR20 bool shl(size_t n) noexcept { - size_t rem = n % limb_bits; - size_t div = n / limb_bits; - if (rem != 0) { - FASTFLOAT_TRY(shl_bits(rem)); - } - if (div != 0) { - FASTFLOAT_TRY(shl_limbs(div)); - } - return true; - } - - // get the number of leading zeros in the bigint. - FASTFLOAT_CONSTEXPR20 int ctlz() const noexcept { - if (vec.is_empty()) { - return 0; - } else { + if (vec.len() == 0) + { + return empty_hi64(truncated); + } + else if (vec.len() == 1) + { + return uint32_hi64(vec.rindex(0), truncated); + } + else if (vec.len() == 2) + { + return uint32_hi64(vec.rindex(0), vec.rindex(1), truncated); + } + else + { + uint64_t result = + uint32_hi64(vec.rindex(0), vec.rindex(1), vec.rindex(2), truncated); + truncated |= vec.nonzero(3); + return result; + } +#endif + } + + // compare two big integers, returning the large value. + // assumes both are normalized. if the return value is + // negative, other is larger, if the return value is + // positive, this is larger, otherwise they are equal. + // the limbs are stored in little-endian order, so we + // must compare the limbs in ever order. + FASTFLOAT_CONSTEXPR20 int compare(const bigint& other) const noexcept + { + if (vec.len() > other.vec.len()) + { + return 1; + } + else if (vec.len() < other.vec.len()) + { + return -1; + } + else + { + for (size_t index = vec.len(); index > 0; index--) + { + limb xi = vec[index - 1]; + limb yi = other.vec[index - 1]; + if (xi > yi) + { + return 1; + } + else if (xi < yi) + { + return -1; + } + } + return 0; + } + } + + // shift left each limb n bits, carrying over to the new limb + // returns true if we were able to shift all the digits. + FASTFLOAT_CONSTEXPR20 bool shl_bits(size_t n) noexcept + { + // Internally, for each item, we shift left by n, and add the previous + // right shifted limb-bits. + // For example, we transform (for u8) shifted left 2, to: + // b10100100 b01000010 + // b10 b10010001 b00001000 + FASTFLOAT_DEBUG_ASSERT(n != 0); + FASTFLOAT_DEBUG_ASSERT(n < sizeof(limb) * 8); + + size_t shl = n; + size_t shr = limb_bits - shl; + limb prev = 0; + for (size_t index = 0; index < vec.len(); index++) + { + limb xi = vec[index]; + vec[index] = (xi << shl) | (prev >> shr); + prev = xi; + } + + limb carry = prev >> shr; + if (carry != 0) + { + return vec.try_push(carry); + } + return true; + } + + // move the limbs left by `n` limbs. + FASTFLOAT_CONSTEXPR20 bool shl_limbs(size_t n) noexcept + { + FASTFLOAT_DEBUG_ASSERT(n != 0); + if (n + vec.len() > vec.capacity()) + { + return false; + } + else if (!vec.is_empty()) + { + // move limbs + limb* dst = vec.data + n; + const limb* src = vec.data; + std::copy_backward(src, src + vec.len(), dst + vec.len()); + // fill in empty limbs + limb* first = vec.data; + limb* last = first + n; + ::std::fill(first, last, 0); + vec.set_len(n + vec.len()); + return true; + } + else + { + return true; + } + } + + // move the limbs left by `n` bits. + FASTFLOAT_CONSTEXPR20 bool shl(size_t n) noexcept + { + size_t rem = n % limb_bits; + size_t div = n / limb_bits; + if (rem != 0) + { + FASTFLOAT_TRY(shl_bits(rem)); + } + if (div != 0) + { + FASTFLOAT_TRY(shl_limbs(div)); + } + return true; + } + + // get the number of leading zeros in the bigint. + FASTFLOAT_CONSTEXPR20 int ctlz() const noexcept + { + if (vec.is_empty()) + { + return 0; + } + else + { #ifdef FASTFLOAT_64BIT_LIMB - return leading_zeroes(vec.rindex(0)); + return leading_zeroes(vec.rindex(0)); #else - // no use defining a specialized leading_zeroes for a 32-bit type. - uint64_t r0 = vec.rindex(0); - return leading_zeroes(r0 << 32); -#endif - } - } - - // get the number of bits in the bigint. - FASTFLOAT_CONSTEXPR20 int bit_length() const noexcept { - int lz = ctlz(); - return int(limb_bits * vec.len()) - lz; - } - - FASTFLOAT_CONSTEXPR20 bool mul(limb y) noexcept { - return small_mul(vec, y); - } - - FASTFLOAT_CONSTEXPR20 bool add(limb y) noexcept { - return small_add(vec, y); - } - - // multiply as if by 2 raised to a power. - FASTFLOAT_CONSTEXPR20 bool pow2(uint32_t exp) noexcept { - return shl(exp); - } - - // multiply as if by 5 raised to a power. - FASTFLOAT_CONSTEXPR20 bool pow5(uint32_t exp) noexcept { - // multiply by a power of 5 - size_t large_length = sizeof(large_power_of_5) / sizeof(limb); - limb_span large = limb_span(large_power_of_5, large_length); - while (exp >= large_step) { - FASTFLOAT_TRY(large_mul(vec, large)); - exp -= large_step; - } + // no use defining a specialized leading_zeroes for a 32-bit type. + uint64_t r0 = vec.rindex(0); + return leading_zeroes(r0 << 32); +#endif + } + } + + // get the number of bits in the bigint. + FASTFLOAT_CONSTEXPR20 int bit_length() const noexcept + { + int lz = ctlz(); + return int(limb_bits * vec.len()) - lz; + } + + FASTFLOAT_CONSTEXPR20 bool mul(limb y) noexcept + { + return small_mul(vec, y); + } + + FASTFLOAT_CONSTEXPR20 bool add(limb y) noexcept + { + return small_add(vec, y); + } + + // multiply as if by 2 raised to a power. + FASTFLOAT_CONSTEXPR20 bool pow2(uint32_t exp) noexcept + { + return shl(exp); + } + + // multiply as if by 5 raised to a power. + FASTFLOAT_CONSTEXPR20 bool pow5(uint32_t exp) noexcept + { + // multiply by a power of 5 + size_t large_length = sizeof(large_power_of_5) / sizeof(limb); + limb_span large = limb_span(large_power_of_5, large_length); + while (exp >= large_step) + { + FASTFLOAT_TRY(large_mul(vec, large)); + exp -= large_step; + } #ifdef FASTFLOAT_64BIT_LIMB - uint32_t small_step = 27; - limb max_native = 7450580596923828125UL; + uint32_t small_step = 27; + limb max_native = 7450580596923828125UL; #else - uint32_t small_step = 13; - limb max_native = 1220703125U; + uint32_t small_step = 13; + limb max_native = 1220703125U; #endif - while (exp >= small_step) { - FASTFLOAT_TRY(small_mul(vec, max_native)); - exp -= small_step; - } - if (exp != 0) { - // Work around clang bug https://godbolt.org/z/zedh7rrhc - // This is similar to https://github.com/llvm/llvm-project/issues/47746, - // except the workaround described there don't work here - FASTFLOAT_TRY( - small_mul(vec, limb(((void)small_power_of_5[0], small_power_of_5[exp]))) - ); - } - - return true; - } - - // multiply as if by 10 raised to a power. - FASTFLOAT_CONSTEXPR20 bool pow10(uint32_t exp) noexcept { - FASTFLOAT_TRY(pow5(exp)); - return pow2(exp); - } -}; - -} // namespace fast_float + while (exp >= small_step) + { + FASTFLOAT_TRY(small_mul(vec, max_native)); + exp -= small_step; + } + if (exp != 0) + { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + // This is similar to https://github.com/llvm/llvm-project/issues/47746, + // except the workaround described there don't work here + FASTFLOAT_TRY( + small_mul(vec, limb(((void)small_power_of_5[0], small_power_of_5[exp])))); + } + + return true; + } + + // multiply as if by 10 raised to a power. + FASTFLOAT_CONSTEXPR20 bool pow10(uint32_t exp) noexcept + { + FASTFLOAT_TRY(pow5(exp)); + return pow2(exp); + } + }; + +} // namespace fast_float #endif @@ -3005,418 +4030,489 @@ struct bigint : pow5_tables<> { #include -namespace fast_float { - -// 1e0 to 1e19 -constexpr static uint64_t powers_of_ten_uint64[] = { - 1UL, 10UL, 100UL, 1000UL, 10000UL, 100000UL, 1000000UL, 10000000UL, 100000000UL, - 1000000000UL, 10000000000UL, 100000000000UL, 1000000000000UL, 10000000000000UL, - 100000000000000UL, 1000000000000000UL, 10000000000000000UL, 100000000000000000UL, - 1000000000000000000UL, 10000000000000000000UL}; - -// calculate the exponent, in scientific notation, of the number. -// this algorithm is not even close to optimized, but it has no practical -// effect on performance: in order to have a faster algorithm, we'd need -// to slow down performance for faster algorithms, and this is still fast. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -int32_t scientific_exponent(parsed_number_string_t & num) noexcept { - uint64_t mantissa = num.mantissa; - int32_t exponent = int32_t(num.exponent); - while (mantissa >= 10000) { - mantissa /= 10000; - exponent += 4; - } - while (mantissa >= 100) { - mantissa /= 100; - exponent += 2; - } - while (mantissa >= 10) { - mantissa /= 10; - exponent += 1; - } - return exponent; -} - -// this converts a native floating-point number to an extended-precision float. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa to_extended(T value) noexcept { - using equiv_uint = typename binary_format::equiv_uint; - constexpr equiv_uint exponent_mask = binary_format::exponent_mask(); - constexpr equiv_uint mantissa_mask = binary_format::mantissa_mask(); - constexpr equiv_uint hidden_bit_mask = binary_format::hidden_bit_mask(); - - adjusted_mantissa am; - int32_t bias = binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); - equiv_uint bits; +namespace fast_float +{ + + // 1e0 to 1e19 + constexpr static uint64_t powers_of_ten_uint64[] = {1UL, 10UL, 100UL, 1000UL, 10000UL, 100000UL, + 1000000UL, 10000000UL, 100000000UL, 1000000000UL, 10000000000UL, 100000000000UL, + 1000000000000UL, 10000000000000UL, 100000000000000UL, 1000000000000000UL, + 10000000000000000UL, 100000000000000000UL, 1000000000000000000UL, 10000000000000000000UL}; + + // calculate the exponent, in scientific notation, of the number. + // this algorithm is not even close to optimized, but it has no practical + // effect on performance: in order to have a faster algorithm, we'd need + // to slow down performance for faster algorithms, and this is still fast. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 int32_t scientific_exponent( + parsed_number_string_t& num) noexcept + { + uint64_t mantissa = num.mantissa; + int32_t exponent = int32_t(num.exponent); + while (mantissa >= 10000) + { + mantissa /= 10000; + exponent += 4; + } + while (mantissa >= 100) + { + mantissa /= 100; + exponent += 2; + } + while (mantissa >= 10) + { + mantissa /= 10; + exponent += 1; + } + return exponent; + } + + // this converts a native floating-point number to an extended-precision float. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa to_extended(T value) noexcept + { + using equiv_uint = typename binary_format::equiv_uint; + constexpr equiv_uint exponent_mask = binary_format::exponent_mask(); + constexpr equiv_uint mantissa_mask = binary_format::mantissa_mask(); + constexpr equiv_uint hidden_bit_mask = binary_format::hidden_bit_mask(); + + adjusted_mantissa am; + int32_t bias = + binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); + equiv_uint bits; #if FASTFLOAT_HAS_BIT_CAST - bits = std::bit_cast(value); + bits = std::bit_cast(value); #else - ::memcpy(&bits, &value, sizeof(T)); -#endif - if ((bits & exponent_mask) == 0) { - // denormal - am.power2 = 1 - bias; - am.mantissa = bits & mantissa_mask; - } else { - // normal - am.power2 = int32_t((bits & exponent_mask) >> binary_format::mantissa_explicit_bits()); - am.power2 -= bias; - am.mantissa = (bits & mantissa_mask) | hidden_bit_mask; - } - - return am; -} - -// get the extended precision value of the halfway point between b and b+u. -// we are given a native float that represents b, so we need to adjust it -// halfway between b and b+u. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa to_extended_halfway(T value) noexcept { - adjusted_mantissa am = to_extended(value); - am.mantissa <<= 1; - am.mantissa += 1; - am.power2 -= 1; - return am; -} - -// round an extended-precision float to the nearest machine float. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -void round(adjusted_mantissa& am, callback cb) noexcept { - int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; - if (-am.power2 >= mantissa_shift) { - // have a denormal float - int32_t shift = -am.power2 + 1; - cb(am, std::min(shift, 64)); - // check for round-up: if rounding-nearest carried us to the hidden bit. - am.power2 = (am.mantissa < (uint64_t(1) << binary_format::mantissa_explicit_bits())) ? 0 : 1; - return; - } - - // have a normal float, use the default shift. - cb(am, mantissa_shift); - - // check for carry - if (am.mantissa >= (uint64_t(2) << binary_format::mantissa_explicit_bits())) { - am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); - am.power2++; - } - - // check for infinite: we could have carried to an infinite power - am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); - if (am.power2 >= binary_format::infinite_power()) { - am.power2 = binary_format::infinite_power(); - am.mantissa = 0; - } -} - -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -void round_nearest_tie_even(adjusted_mantissa& am, int32_t shift, callback cb) noexcept { - const uint64_t mask - = (shift == 64) - ? UINT64_MAX - : (uint64_t(1) << shift) - 1; - const uint64_t halfway - = (shift == 0) - ? 0 - : uint64_t(1) << (shift - 1); - uint64_t truncated_bits = am.mantissa & mask; - bool is_above = truncated_bits > halfway; - bool is_halfway = truncated_bits == halfway; - - // shift digits into position - if (shift == 64) { - am.mantissa = 0; - } else { - am.mantissa >>= shift; - } - am.power2 += shift; - - bool is_odd = (am.mantissa & 1) == 1; - am.mantissa += uint64_t(cb(is_odd, is_halfway, is_above)); -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -void round_down(adjusted_mantissa& am, int32_t shift) noexcept { - if (shift == 64) { - am.mantissa = 0; - } else { - am.mantissa >>= shift; - } - am.power2 += shift; -} -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void skip_zeros(UC const * & first, UC const * last) noexcept { - uint64_t val; - while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) { - ::memcpy(&val, first, sizeof(uint64_t)); - if (val != int_cmp_zeros()) { - break; - } - first += int_cmp_len(); - } - while (first != last) { - if (*first != UC('0')) { - break; - } - first++; - } -} - -// determine if any non-zero digits were truncated. -// all characters must be valid digits. -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -bool is_truncated(UC const * first, UC const * last) noexcept { - // do 8-bit optimizations, can just compare to 8 literal 0s. - uint64_t val; - while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) { - ::memcpy(&val, first, sizeof(uint64_t)); - if (val != int_cmp_zeros()) { - return true; - } - first += int_cmp_len(); - } - while (first != last) { - if (*first != UC('0')) { - return true; - } - ++first; - } - return false; -} -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -bool is_truncated(span s) noexcept { - return is_truncated(s.ptr, s.ptr + s.len()); -} - - -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void parse_eight_digits(const UC*& p, limb& value, size_t& counter, size_t& count) noexcept { - value = value * 100000000 + parse_eight_digits_unrolled(p); - p += 8; - counter += 8; - count += 8; -} - -template -fastfloat_really_inline FASTFLOAT_CONSTEXPR14 -void parse_one_digit(UC const *& p, limb& value, size_t& counter, size_t& count) noexcept { - value = value * 10 + limb(*p - UC('0')); - p++; - counter++; - count++; -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void add_native(bigint& big, limb power, limb value) noexcept { - big.mul(power); - big.add(value); -} - -fastfloat_really_inline FASTFLOAT_CONSTEXPR20 -void round_up_bigint(bigint& big, size_t& count) noexcept { - // need to round-up the digits, but need to avoid rounding - // ....9999 to ...10000, which could cause a false halfway point. - add_native(big, 10, 1); - count++; -} - -// parse the significant digits into a big integer -template -inline FASTFLOAT_CONSTEXPR20 -void parse_mantissa(bigint& result, parsed_number_string_t& num, size_t max_digits, size_t& digits) noexcept { - // try to minimize the number of big integer and scalar multiplication. - // therefore, try to parse 8 digits at a time, and multiply by the largest - // scalar value (9 or 19 digits) for each step. - size_t counter = 0; - digits = 0; - limb value = 0; + ::memcpy(&bits, &value, sizeof(T)); +#endif + if ((bits & exponent_mask) == 0) + { + // denormal + am.power2 = 1 - bias; + am.mantissa = bits & mantissa_mask; + } + else + { + // normal + am.power2 = + int32_t((bits & exponent_mask) >> binary_format::mantissa_explicit_bits()); + am.power2 -= bias; + am.mantissa = (bits & mantissa_mask) | hidden_bit_mask; + } + + return am; + } + + // get the extended precision value of the halfway point between b and b+u. + // we are given a native float that represents b, so we need to adjust it + // halfway between b and b+u. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa to_extended_halfway( + T value) noexcept + { + adjusted_mantissa am = to_extended(value); + am.mantissa <<= 1; + am.mantissa += 1; + am.power2 -= 1; + return am; + } + + // round an extended-precision float to the nearest machine float. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 void round( + adjusted_mantissa& am, callback cb) noexcept + { + int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; + if (-am.power2 >= mantissa_shift) + { + // have a denormal float + int32_t shift = -am.power2 + 1; + cb(am, std::min(shift, 64)); + // check for round-up: if rounding-nearest carried us to the hidden bit. + am.power2 = + (am.mantissa < (uint64_t(1) << binary_format::mantissa_explicit_bits())) ? 0 : 1; + return; + } + + // have a normal float, use the default shift. + cb(am, mantissa_shift); + + // check for carry + if (am.mantissa >= (uint64_t(2) << binary_format::mantissa_explicit_bits())) + { + am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); + am.power2++; + } + + // check for infinite: we could have carried to an infinite power + am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); + if (am.power2 >= binary_format::infinite_power()) + { + am.power2 = binary_format::infinite_power(); + am.mantissa = 0; + } + } + + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 void round_nearest_tie_even( + adjusted_mantissa& am, int32_t shift, callback cb) noexcept + { + const uint64_t mask = (shift == 64) ? UINT64_MAX : (uint64_t(1) << shift) - 1; + const uint64_t halfway = (shift == 0) ? 0 : uint64_t(1) << (shift - 1); + uint64_t truncated_bits = am.mantissa & mask; + bool is_above = truncated_bits > halfway; + bool is_halfway = truncated_bits == halfway; + + // shift digits into position + if (shift == 64) + { + am.mantissa = 0; + } + else + { + am.mantissa >>= shift; + } + am.power2 += shift; + + bool is_odd = (am.mantissa & 1) == 1; + am.mantissa += uint64_t(cb(is_odd, is_halfway, is_above)); + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 void round_down( + adjusted_mantissa& am, int32_t shift) noexcept + { + if (shift == 64) + { + am.mantissa = 0; + } + else + { + am.mantissa >>= shift; + } + am.power2 += shift; + } + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void skip_zeros( + UC const*& first, UC const* last) noexcept + { + uint64_t val; + while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) + { + ::memcpy(&val, first, sizeof(uint64_t)); + if (val != int_cmp_zeros()) + { + break; + } + first += int_cmp_len(); + } + while (first != last) + { + if (*first != UC('0')) + { + break; + } + first++; + } + } + + // determine if any non-zero digits were truncated. + // all characters must be valid digits. + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 bool is_truncated( + UC const* first, UC const* last) noexcept + { + // do 8-bit optimizations, can just compare to 8 literal 0s. + uint64_t val; + while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) + { + ::memcpy(&val, first, sizeof(uint64_t)); + if (val != int_cmp_zeros()) + { + return true; + } + first += int_cmp_len(); + } + while (first != last) + { + if (*first != UC('0')) + { + return true; + } + ++first; + } + return false; + } + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 bool is_truncated(span s) noexcept + { + return is_truncated(s.ptr, s.ptr + s.len()); + } + + + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void parse_eight_digits( + const UC*& p, limb& value, size_t& counter, size_t& count) noexcept + { + value = value * 100000000 + parse_eight_digits_unrolled(p); + p += 8; + counter += 8; + count += 8; + } + + template + fastfloat_really_inline FASTFLOAT_CONSTEXPR14 void parse_one_digit( + UC const*& p, limb& value, size_t& counter, size_t& count) noexcept + { + value = value * 10 + limb(*p - UC('0')); + p++; + counter++; + count++; + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void add_native( + bigint& big, limb power, limb value) noexcept + { + big.mul(power); + big.add(value); + } + + fastfloat_really_inline FASTFLOAT_CONSTEXPR20 void round_up_bigint( + bigint& big, size_t& count) noexcept + { + // need to round-up the digits, but need to avoid rounding + // ....9999 to ...10000, which could cause a false halfway point. + add_native(big, 10, 1); + count++; + } + + // parse the significant digits into a big integer + template + inline FASTFLOAT_CONSTEXPR20 void parse_mantissa( + bigint& result, parsed_number_string_t& num, size_t max_digits, size_t& digits) noexcept + { + // try to minimize the number of big integer and scalar multiplication. + // therefore, try to parse 8 digits at a time, and multiply by the largest + // scalar value (9 or 19 digits) for each step. + size_t counter = 0; + digits = 0; + limb value = 0; #ifdef FASTFLOAT_64BIT_LIMB - size_t step = 19; + size_t step = 19; #else - size_t step = 9; -#endif - - // process all integer digits. - UC const * p = num.integer.ptr; - UC const * pend = p + num.integer.len(); - skip_zeros(p, pend); - // process all digits, in increments of step per loop - while (p != pend) { - while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && (max_digits - digits >= 8)) { - parse_eight_digits(p, value, counter, digits); - } - while (counter < step && p != pend && digits < max_digits) { - parse_one_digit(p, value, counter, digits); - } - if (digits == max_digits) { - // add the temporary value, then check if we've truncated any digits - add_native(result, limb(powers_of_ten_uint64[counter]), value); - bool truncated = is_truncated(p, pend); - if (num.fraction.ptr != nullptr) { - truncated |= is_truncated(num.fraction); - } - if (truncated) { - round_up_bigint(result, digits); - } - return; - } else { - add_native(result, limb(powers_of_ten_uint64[counter]), value); - counter = 0; - value = 0; - } - } - - // add our fraction digits, if they're available. - if (num.fraction.ptr != nullptr) { - p = num.fraction.ptr; - pend = p + num.fraction.len(); - if (digits == 0) { - skip_zeros(p, pend); - } - // process all digits, in increments of step per loop - while (p != pend) { - while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && (max_digits - digits >= 8)) { - parse_eight_digits(p, value, counter, digits); - } - while (counter < step && p != pend && digits < max_digits) { - parse_one_digit(p, value, counter, digits); - } - if (digits == max_digits) { - // add the temporary value, then check if we've truncated any digits - add_native(result, limb(powers_of_ten_uint64[counter]), value); - bool truncated = is_truncated(p, pend); - if (truncated) { - round_up_bigint(result, digits); - } - return; - } else { - add_native(result, limb(powers_of_ten_uint64[counter]), value); - counter = 0; - value = 0; - } - } - } - - if (counter != 0) { - add_native(result, limb(powers_of_ten_uint64[counter]), value); - } -} - -template -inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa positive_digit_comp(bigint& bigmant, int32_t exponent) noexcept { - FASTFLOAT_ASSERT(bigmant.pow10(uint32_t(exponent))); - adjusted_mantissa answer; - bool truncated; - answer.mantissa = bigmant.hi64(truncated); - int bias = binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); - answer.power2 = bigmant.bit_length() - 64 + bias; - - round(answer, [truncated](adjusted_mantissa& a, int32_t shift) { - round_nearest_tie_even(a, shift, [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { - return is_above || (is_halfway && truncated) || (is_odd && is_halfway); - }); - }); - - return answer; -} - -// the scaling here is quite simple: we have, for the real digits `m * 10^e`, -// and for the theoretical digits `n * 2^f`. Since `e` is always negative, -// to scale them identically, we do `n * 2^f * 5^-f`, so we now have `m * 2^e`. -// we then need to scale by `2^(f- e)`, and then the two significant digits -// are of the same magnitude. -template -inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa negative_digit_comp(bigint& bigmant, adjusted_mantissa am, int32_t exponent) noexcept { - bigint& real_digits = bigmant; - int32_t real_exp = exponent; - - // get the value of `b`, rounded down, and get a bigint representation of b+h - adjusted_mantissa am_b = am; - // gcc7 buf: use a lambda to remove the noexcept qualifier bug with -Wnoexcept-type. - round(am_b, [](adjusted_mantissa&a, int32_t shift) { round_down(a, shift); }); - T b; - to_float(false, am_b, b); - adjusted_mantissa theor = to_extended_halfway(b); - bigint theor_digits(theor.mantissa); - int32_t theor_exp = theor.power2; - - // scale real digits and theor digits to be same power. - int32_t pow2_exp = theor_exp - real_exp; - uint32_t pow5_exp = uint32_t(-real_exp); - if (pow5_exp != 0) { - FASTFLOAT_ASSERT(theor_digits.pow5(pow5_exp)); - } - if (pow2_exp > 0) { - FASTFLOAT_ASSERT(theor_digits.pow2(uint32_t(pow2_exp))); - } else if (pow2_exp < 0) { - FASTFLOAT_ASSERT(real_digits.pow2(uint32_t(-pow2_exp))); - } - - // compare digits, and use it to director rounding - int ord = real_digits.compare(theor_digits); - adjusted_mantissa answer = am; - round(answer, [ord](adjusted_mantissa& a, int32_t shift) { - round_nearest_tie_even(a, shift, [ord](bool is_odd, bool _, bool __) -> bool { - (void)_; // not needed, since we've done our comparison - (void)__; // not needed, since we've done our comparison - if (ord > 0) { - return true; - } else if (ord < 0) { - return false; - } else { - return is_odd; - } - }); - }); - - return answer; -} - -// parse the significant digits as a big integer to unambiguously round the -// the significant digits. here, we are trying to determine how to round -// an extended float representation close to `b+h`, halfway between `b` -// (the float rounded-down) and `b+u`, the next positive float. this -// algorithm is always correct, and uses one of two approaches. when -// the exponent is positive relative to the significant digits (such as -// 1234), we create a big-integer representation, get the high 64-bits, -// determine if any lower bits are truncated, and use that to direct -// rounding. in case of a negative exponent relative to the significant -// digits (such as 1.2345), we create a theoretical representation of -// `b` as a big-integer type, scaled to the same binary exponent as -// the actual digits. we then compare the big integer representations -// of both, and use that to direct rounding. -template -inline FASTFLOAT_CONSTEXPR20 -adjusted_mantissa digit_comp(parsed_number_string_t& num, adjusted_mantissa am) noexcept { - // remove the invalid exponent bias - am.power2 -= invalid_am_bias; - - int32_t sci_exp = scientific_exponent(num); - size_t max_digits = binary_format::max_digits(); - size_t digits = 0; - bigint bigmant; - parse_mantissa(bigmant, num, max_digits, digits); - // can't underflow, since digits is at most max_digits. - int32_t exponent = sci_exp + 1 - int32_t(digits); - if (exponent >= 0) { - return positive_digit_comp(bigmant, exponent); - } else { - return negative_digit_comp(bigmant, am, exponent); - } -} - -} // namespace fast_float + size_t step = 9; +#endif + + // process all integer digits. + UC const* p = num.integer.ptr; + UC const* pend = p + num.integer.len(); + skip_zeros(p, pend); + // process all digits, in increments of step per loop + while (p != pend) + { + while ((std::distance(p, pend) >= 8) && (step - counter >= 8) + && (max_digits - digits >= 8)) + { + parse_eight_digits(p, value, counter, digits); + } + while (counter < step && p != pend && digits < max_digits) + { + parse_one_digit(p, value, counter, digits); + } + if (digits == max_digits) + { + // add the temporary value, then check if we've truncated any digits + add_native(result, limb(powers_of_ten_uint64[counter]), value); + bool truncated = is_truncated(p, pend); + if (num.fraction.ptr != nullptr) + { + truncated |= is_truncated(num.fraction); + } + if (truncated) + { + round_up_bigint(result, digits); + } + return; + } + else + { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + counter = 0; + value = 0; + } + } + + // add our fraction digits, if they're available. + if (num.fraction.ptr != nullptr) + { + p = num.fraction.ptr; + pend = p + num.fraction.len(); + if (digits == 0) + { + skip_zeros(p, pend); + } + // process all digits, in increments of step per loop + while (p != pend) + { + while ((std::distance(p, pend) >= 8) && (step - counter >= 8) + && (max_digits - digits >= 8)) + { + parse_eight_digits(p, value, counter, digits); + } + while (counter < step && p != pend && digits < max_digits) + { + parse_one_digit(p, value, counter, digits); + } + if (digits == max_digits) + { + // add the temporary value, then check if we've truncated any digits + add_native(result, limb(powers_of_ten_uint64[counter]), value); + bool truncated = is_truncated(p, pend); + if (truncated) + { + round_up_bigint(result, digits); + } + return; + } + else + { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + counter = 0; + value = 0; + } + } + } + + if (counter != 0) + { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + } + } + + template + inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa positive_digit_comp( + bigint& bigmant, int32_t exponent) noexcept + { + FASTFLOAT_ASSERT(bigmant.pow10(uint32_t(exponent))); + adjusted_mantissa answer; + bool truncated; + answer.mantissa = bigmant.hi64(truncated); + int bias = + binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); + answer.power2 = bigmant.bit_length() - 64 + bias; + + round(answer, [truncated](adjusted_mantissa& a, int32_t shift) { + round_nearest_tie_even( + a, shift, [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { + return is_above || (is_halfway && truncated) || (is_odd && is_halfway); + }); + }); + + return answer; + } + + // the scaling here is quite simple: we have, for the real digits `m * 10^e`, + // and for the theoretical digits `n * 2^f`. Since `e` is always negative, + // to scale them identically, we do `n * 2^f * 5^-f`, so we now have `m * 2^e`. + // we then need to scale by `2^(f- e)`, and then the two significant digits + // are of the same magnitude. + template + inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa negative_digit_comp( + bigint& bigmant, adjusted_mantissa am, int32_t exponent) noexcept + { + bigint& real_digits = bigmant; + int32_t real_exp = exponent; + + // get the value of `b`, rounded down, and get a bigint representation of b+h + adjusted_mantissa am_b = am; + // gcc7 buf: use a lambda to remove the noexcept qualifier bug with -Wnoexcept-type. + round(am_b, [](adjusted_mantissa& a, int32_t shift) { + round_down(a, shift); + }); + T b; + to_float(false, am_b, b); + adjusted_mantissa theor = to_extended_halfway(b); + bigint theor_digits(theor.mantissa); + int32_t theor_exp = theor.power2; + + // scale real digits and theor digits to be same power. + int32_t pow2_exp = theor_exp - real_exp; + uint32_t pow5_exp = uint32_t(-real_exp); + if (pow5_exp != 0) + { + FASTFLOAT_ASSERT(theor_digits.pow5(pow5_exp)); + } + if (pow2_exp > 0) + { + FASTFLOAT_ASSERT(theor_digits.pow2(uint32_t(pow2_exp))); + } + else if (pow2_exp < 0) + { + FASTFLOAT_ASSERT(real_digits.pow2(uint32_t(-pow2_exp))); + } + + // compare digits, and use it to director rounding + int ord = real_digits.compare(theor_digits); + adjusted_mantissa answer = am; + round(answer, [ord](adjusted_mantissa& a, int32_t shift) { + round_nearest_tie_even(a, shift, [ord](bool is_odd, bool _, bool __) -> bool { + (void)_; // not needed, since we've done our comparison + (void)__; // not needed, since we've done our comparison + if (ord > 0) + { + return true; + } + else if (ord < 0) + { + return false; + } + else + { + return is_odd; + } + }); + }); + + return answer; + } + + // parse the significant digits as a big integer to unambiguously round the + // the significant digits. here, we are trying to determine how to round + // an extended float representation close to `b+h`, halfway between `b` + // (the float rounded-down) and `b+u`, the next positive float. this + // algorithm is always correct, and uses one of two approaches. when + // the exponent is positive relative to the significant digits (such as + // 1234), we create a big-integer representation, get the high 64-bits, + // determine if any lower bits are truncated, and use that to direct + // rounding. in case of a negative exponent relative to the significant + // digits (such as 1.2345), we create a theoretical representation of + // `b` as a big-integer type, scaled to the same binary exponent as + // the actual digits. we then compare the big integer representations + // of both, and use that to direct rounding. + template + inline FASTFLOAT_CONSTEXPR20 adjusted_mantissa digit_comp( + parsed_number_string_t& num, adjusted_mantissa am) noexcept + { + // remove the invalid exponent bias + am.power2 -= invalid_am_bias; + + int32_t sci_exp = scientific_exponent(num); + size_t max_digits = binary_format::max_digits(); + size_t digits = 0; + bigint bigmant; + parse_mantissa(bigmant, num, max_digits, digits); + // can't underflow, since digits is at most max_digits. + int32_t exponent = sci_exp + 1 - int32_t(digits); + if (exponent >= 0) + { + return positive_digit_comp(bigmant, exponent); + } + else + { + return negative_digit_comp(bigmant, am, exponent); + } + } + +} // namespace fast_float #endif @@ -3428,293 +4524,355 @@ adjusted_mantissa digit_comp(parsed_number_string_t& num, adjusted_mantissa #include #include #include -namespace fast_float { - - -namespace detail { -/** - * Special case +inf, -inf, nan, infinity, -infinity. - * The case comparisons could be made much faster given that we know that the - * strings a null-free and fixed. - **/ -template -from_chars_result_t FASTFLOAT_CONSTEXPR14 -parse_infnan(UC const * first, UC const * last, T &value) noexcept { - from_chars_result_t answer{}; - answer.ptr = first; - answer.ec = std::errc(); // be optimistic - bool minusSign = false; - if (*first == UC('-')) { // assume first < last, so dereference without checks; C++17 20.19.3.(7.1) explicitly forbids '+' here - minusSign = true; - ++first; - } -#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default - if (*first == UC('+')) { - ++first; - } -#endif - if (last - first >= 3) { - if (fastfloat_strncasecmp(first, str_const_nan(), 3)) { - answer.ptr = (first += 3); - value = minusSign ? -std::numeric_limits::quiet_NaN() : std::numeric_limits::quiet_NaN(); - // Check for possible nan(n-char-seq-opt), C++17 20.19.3.7, C11 7.20.1.3.3. At least MSVC produces nan(ind) and nan(snan). - if(first != last && *first == UC('(')) { - for(UC const * ptr = first + 1; ptr != last; ++ptr) { - if (*ptr == UC(')')) { - answer.ptr = ptr + 1; // valid nan(n-char-seq-opt) - break; - } - else if(!((UC('a') <= *ptr && *ptr <= UC('z')) || (UC('A') <= *ptr && *ptr <= UC('Z')) || (UC('0') <= *ptr && *ptr <= UC('9')) || *ptr == UC('_'))) - break; // forbidden char, not nan(n-char-seq-opt) - } - } - return answer; - } - if (fastfloat_strncasecmp(first, str_const_inf(), 3)) { - if ((last - first >= 8) && fastfloat_strncasecmp(first + 3, str_const_inf() + 3, 5)) { - answer.ptr = first + 8; - } else { - answer.ptr = first + 3; - } - value = minusSign ? -std::numeric_limits::infinity() : std::numeric_limits::infinity(); - return answer; - } - } - answer.ec = std::errc::invalid_argument; - return answer; -} - -/** - * Returns true if the floating-pointing rounding mode is to 'nearest'. - * It is the default on most system. This function is meant to be inexpensive. - * Credit : @mwalcott3 - */ -fastfloat_really_inline bool rounds_to_nearest() noexcept { - // https://lemire.me/blog/2020/06/26/gcc-not-nearest/ -#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) - return false; -#endif - // See - // A fast function to check your floating-point rounding mode - // https://lemire.me/blog/2022/11/16/a-fast-function-to-check-your-floating-point-rounding-mode/ - // - // This function is meant to be equivalent to : - // prior: #include - // return fegetround() == FE_TONEAREST; - // However, it is expected to be much faster than the fegetround() - // function call. - // - // The volatile keywoard prevents the compiler from computing the function - // at compile-time. - // There might be other ways to prevent compile-time optimizations (e.g., asm). - // The value does not need to be std::numeric_limits::min(), any small - // value so that 1 + x should round to 1 would do (after accounting for excess - // precision, as in 387 instructions). - static volatile float fmin = std::numeric_limits::min(); - float fmini = fmin; // we copy it so that it gets loaded at most once. - // - // Explanation: - // Only when fegetround() == FE_TONEAREST do we have that - // fmin + 1.0f == 1.0f - fmin. - // - // FE_UPWARD: - // fmin + 1.0f > 1 - // 1.0f - fmin == 1 - // - // FE_DOWNWARD or FE_TOWARDZERO: - // fmin + 1.0f == 1 - // 1.0f - fmin < 1 - // - // Note: This may fail to be accurate if fast-math has been - // enabled, as rounding conventions may not apply. - #ifdef FASTFLOAT_VISUAL_STUDIO - # pragma warning(push) - // todo: is there a VS warning? - // see https://stackoverflow.com/questions/46079446/is-there-a-warning-for-floating-point-equality-checking-in-visual-studio-2013 - #elif defined(__clang__) - # pragma clang diagnostic push - # pragma clang diagnostic ignored "-Wfloat-equal" - #elif defined(__GNUC__) - # pragma GCC diagnostic push - # pragma GCC diagnostic ignored "-Wfloat-equal" - #endif - return (fmini + 1.0f == 1.0f - fmini); - #ifdef FASTFLOAT_VISUAL_STUDIO - # pragma warning(pop) - #elif defined(__clang__) - # pragma clang diagnostic pop - #elif defined(__GNUC__) - # pragma GCC diagnostic pop - #endif -} - -} // namespace detail - -template -struct from_chars_caller +namespace fast_float { - template - FASTFLOAT_CONSTEXPR20 - static from_chars_result_t call(UC const * first, UC const * last, - T &value, parse_options_t options) noexcept { - return from_chars_advanced(first, last, value, options); - } -}; - -#if __STDCPP_FLOAT32_T__ == 1 -template <> -struct from_chars_caller -{ - template - FASTFLOAT_CONSTEXPR20 - static from_chars_result_t call(UC const * first, UC const * last, - std::float32_t &value, parse_options_t options) noexcept{ - // if std::float32_t is defined, and we are in C++23 mode; macro set for float32; - // set value to float due to equivalence between float and float32_t - float val; - auto ret = from_chars_advanced(first, last, val, options); - value = val; - return ret; - } -}; -#endif - -#if __STDCPP_FLOAT64_T__ == 1 -template <> -struct from_chars_caller -{ - template - FASTFLOAT_CONSTEXPR20 - static from_chars_result_t call(UC const * first, UC const * last, - std::float64_t &value, parse_options_t options) noexcept{ - // if std::float64_t is defined, and we are in C++23 mode; macro set for float64; - // set value as double due to equivalence between double and float64_t - double val; - auto ret = from_chars_advanced(first, last, val, options); - value = val; - return ret; - } -}; -#endif - - -template -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars(UC const * first, UC const * last, - T &value, chars_format fmt /*= chars_format::general*/) noexcept { - return from_chars_caller::call(first, last, value, parse_options_t(fmt)); -} - -template -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars_advanced(UC const * first, UC const * last, - T &value, parse_options_t options) noexcept { - - static_assert (is_supported_float_type(), "only some floating-point types are supported"); - static_assert (is_supported_char_type(), "only char, wchar_t, char16_t and char32_t are supported"); - - from_chars_result_t answer; -#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default - while ((first != last) && fast_float::is_space(uint8_t(*first))) { - first++; - } -#endif - if (first == last) { - answer.ec = std::errc::invalid_argument; - answer.ptr = first; - return answer; - } - parsed_number_string_t pns = parse_number_string(first, last, options); - if (!pns.valid) { - if (options.format & chars_format::no_infnan) { - answer.ec = std::errc::invalid_argument; - answer.ptr = first; - return answer; - } else { - return detail::parse_infnan(first, last, value); - } - } - - answer.ec = std::errc(); // be optimistic - answer.ptr = pns.lastmatch; - // The implementation of the Clinger's fast path is convoluted because - // we want round-to-nearest in all cases, irrespective of the rounding mode - // selected on the thread. - // We proceed optimistically, assuming that detail::rounds_to_nearest() returns - // true. - if (binary_format::min_exponent_fast_path() <= pns.exponent && pns.exponent <= binary_format::max_exponent_fast_path() && !pns.too_many_digits) { - // Unfortunately, the conventional Clinger's fast path is only possible - // when the system rounds to the nearest float. - // - // We expect the next branch to almost always be selected. - // We could check it first (before the previous branch), but - // there might be performance advantages at having the check - // be last. - if(!cpp20_and_in_constexpr() && detail::rounds_to_nearest()) { - // We have that fegetround() == FE_TONEAREST. - // Next is Clinger's fast path. - if (pns.mantissa <=binary_format::max_mantissa_fast_path()) { - value = T(pns.mantissa); - if (pns.exponent < 0) { value = value / binary_format::exact_power_of_ten(-pns.exponent); } - else { value = value * binary_format::exact_power_of_ten(pns.exponent); } - if (pns.negative) { value = -value; } - return answer; - } - } else { - // We do not have that fegetround() == FE_TONEAREST. - // Next is a modified Clinger's fast path, inspired by Jakub Jelínek's proposal - if (pns.exponent >= 0 && pns.mantissa <=binary_format::max_mantissa_fast_path(pns.exponent)) { -#if defined(__clang__) || defined(FASTFLOAT_32BIT) - // Clang may map 0 to -0.0 when fegetround() == FE_DOWNWARD - if(pns.mantissa == 0) { - value = pns.negative ? T(-0.) : T(0.); - return answer; - } -#endif - value = T(pns.mantissa) * binary_format::exact_power_of_ten(pns.exponent); - if (pns.negative) { value = -value; } - return answer; - } - } - } - adjusted_mantissa am = compute_float>(pns.exponent, pns.mantissa); - if(pns.too_many_digits && am.power2 >= 0) { - if(am != compute_float>(pns.exponent, pns.mantissa + 1)) { - am = compute_error>(pns.exponent, pns.mantissa); - } - } - // If we called compute_float>(pns.exponent, pns.mantissa) and we have an invalid power (am.power2 < 0), - // then we need to go the long way around again. This is very uncommon. - if(am.power2 < 0) { am = digit_comp(pns, am); } - to_float(pns.negative, am, value); - // Test for over/underflow. - if ((pns.mantissa != 0 && am.mantissa == 0 && am.power2 == 0) || am.power2 == binary_format::infinite_power()) { - answer.ec = std::errc::result_out_of_range; - } - return answer; -} - - -template -FASTFLOAT_CONSTEXPR20 -from_chars_result_t from_chars(UC const* first, UC const* last, T& value, int base) noexcept { - static_assert (is_supported_char_type(), "only char, wchar_t, char16_t and char32_t are supported"); - - from_chars_result_t answer; -#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default - while ((first != last) && fast_float::is_space(uint8_t(*first))) { - first++; - } -#endif - if (first == last || base < 2 || base > 36) { - answer.ec = std::errc::invalid_argument; - answer.ptr = first; - return answer; - } - return parse_int_string(first, last, value, base); -} - -} // namespace fast_float + + namespace detail + { + /** + * Special case +inf, -inf, nan, infinity, -infinity. + * The case comparisons could be made much faster given that we know that the + * strings a null-free and fixed. + **/ + template + from_chars_result_t FASTFLOAT_CONSTEXPR14 parse_infnan( + UC const* first, UC const* last, T& value) noexcept + { + from_chars_result_t answer{}; + answer.ptr = first; + answer.ec = std::errc(); // be optimistic + bool minusSign = false; + if (*first == UC('-')) + { // assume first < last, so dereference without checks; C++17 20.19.3.(7.1) + // explicitly forbids '+' here + minusSign = true; + ++first; + } +#ifdef FASTFLOAT_ALLOWS_LEADING_PLUS // disabled by default + if (*first == UC('+')) + { + ++first; + } #endif + if (last - first >= 3) + { + if (fastfloat_strncasecmp(first, str_const_nan(), 3)) + { + answer.ptr = (first += 3); + value = minusSign ? -std::numeric_limits::quiet_NaN() + : std::numeric_limits::quiet_NaN(); + // Check for possible nan(n-char-seq-opt), C++17 20.19.3.7, C11 7.20.1.3.3. At + // least MSVC produces nan(ind) and nan(snan). + if (first != last && *first == UC('(')) + { + for (UC const* ptr = first + 1; ptr != last; ++ptr) + { + if (*ptr == UC(')')) + { + answer.ptr = ptr + 1; // valid nan(n-char-seq-opt) + break; + } + else if (!((UC('a') <= *ptr && *ptr <= UC('z')) + || (UC('A') <= *ptr && *ptr <= UC('Z')) + || (UC('0') <= *ptr && *ptr <= UC('9')) + || *ptr == UC('_'))) + break; // forbidden char, not nan(n-char-seq-opt) + } + } + return answer; + } + if (fastfloat_strncasecmp(first, str_const_inf(), 3)) + { + if ((last - first >= 8) + && fastfloat_strncasecmp(first + 3, str_const_inf() + 3, 5)) + { + answer.ptr = first + 8; + } + else + { + answer.ptr = first + 3; + } + value = minusSign ? -std::numeric_limits::infinity() + : std::numeric_limits::infinity(); + return answer; + } + } + answer.ec = std::errc::invalid_argument; + return answer; + } + + /** + * Returns true if the floating-pointing rounding mode is to 'nearest'. + * It is the default on most system. This function is meant to be inexpensive. + * Credit : @mwalcott3 + */ + fastfloat_really_inline bool rounds_to_nearest() noexcept + { + // https://lemire.me/blog/2020/06/26/gcc-not-nearest/ +#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) + return false; +#endif + // See + // A fast function to check your floating-point rounding mode + // https://lemire.me/blog/2022/11/16/a-fast-function-to-check-your-floating-point-rounding-mode/ + // + // This function is meant to be equivalent to : + // prior: #include + // return fegetround() == FE_TONEAREST; + // However, it is expected to be much faster than the fegetround() + // function call. + // + // The volatile keywoard prevents the compiler from computing the function + // at compile-time. + // There might be other ways to prevent compile-time optimizations (e.g., asm). + // The value does not need to be std::numeric_limits::min(), any small + // value so that 1 + x should round to 1 would do (after accounting for excess + // precision, as in 387 instructions). + static volatile float fmin = std::numeric_limits::min(); + float fmini = fmin; // we copy it so that it gets loaded at most once. +// +// Explanation: +// Only when fegetround() == FE_TONEAREST do we have that +// fmin + 1.0f == 1.0f - fmin. +// +// FE_UPWARD: +// fmin + 1.0f > 1 +// 1.0f - fmin == 1 +// +// FE_DOWNWARD or FE_TOWARDZERO: +// fmin + 1.0f == 1 +// 1.0f - fmin < 1 +// +// Note: This may fail to be accurate if fast-math has been +// enabled, as rounding conventions may not apply. +#ifdef FASTFLOAT_VISUAL_STUDIO + #pragma warning(push) +// todo: is there a VS warning? +// see +// https://stackoverflow.com/questions/46079446/is-there-a-warning-for-floating-point-equality-checking-in-visual-studio-2013 +#elif defined(__clang__) + #pragma clang diagnostic push + #pragma clang diagnostic ignored "-Wfloat-equal" +#elif defined(__GNUC__) + #pragma GCC diagnostic push + #pragma GCC diagnostic ignored "-Wfloat-equal" +#endif + return (fmini + 1.0f == 1.0f - fmini); +#ifdef FASTFLOAT_VISUAL_STUDIO + #pragma warning(pop) +#elif defined(__clang__) + #pragma clang diagnostic pop +#elif defined(__GNUC__) + #pragma GCC diagnostic pop +#endif + } + + } // namespace detail + + template + struct from_chars_caller + { + template + FASTFLOAT_CONSTEXPR20 static from_chars_result_t call( + UC const* first, UC const* last, T& value, parse_options_t options) noexcept + { + return from_chars_advanced(first, last, value, options); + } + }; + +#if defined(__STDCPP_FLOAT32_T__) + template<> + struct from_chars_caller + { + template + FASTFLOAT_CONSTEXPR20 static from_chars_result_t call(UC const* first, UC const* last, + std::float32_t& value, parse_options_t options) noexcept + { + // if std::float32_t is defined, and we are in C++23 mode; macro set for float32; + // set value to float due to equivalence between float and float32_t + float val; + auto ret = from_chars_advanced(first, last, val, options); + value = val; + return ret; + } + }; +#endif + +#if defined(__STDCPP_FLOAT64_T__) + template<> + struct from_chars_caller + { + template + FASTFLOAT_CONSTEXPR20 static from_chars_result_t call(UC const* first, UC const* last, + std::float64_t& value, parse_options_t options) noexcept + { + // if std::float64_t is defined, and we are in C++23 mode; macro set for float64; + // set value as double due to equivalence between double and float64_t + double val; + auto ret = from_chars_advanced(first, last, val, options); + value = val; + return ret; + } + }; +#endif + + template + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars(UC const* first, UC const* last, + T& value, chars_format fmt /*= chars_format::general*/) noexcept + { + return from_chars_caller::call(first, last, value, parse_options_t(fmt)); + } + + template + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars_advanced( + UC const* first, UC const* last, T& value, parse_options_t options) noexcept + { + static_assert(is_supported_float_type(), "only some floating-point types are supported"); + static_assert(is_supported_char_type(), + "only char, wchar_t, char16_t and char32_t are supported"); + + from_chars_result_t answer; +#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default + while ((first != last) && fast_float::is_space(uint8_t(*first))) + { + first++; + } +#endif + if (first == last) + { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + return answer; + } + parsed_number_string_t pns = parse_number_string(first, last, options); + if (!pns.valid) + { + if (options.format & chars_format::no_infnan) + { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + return answer; + } + else + { + return detail::parse_infnan(first, last, value); + } + } + + answer.ec = std::errc(); // be optimistic + answer.ptr = pns.lastmatch; + // The implementation of the Clinger's fast path is convoluted because + // we want round-to-nearest in all cases, irrespective of the rounding mode + // selected on the thread. + // We proceed optimistically, assuming that detail::rounds_to_nearest() returns + // true. + if (binary_format::min_exponent_fast_path() <= pns.exponent + && pns.exponent <= binary_format::max_exponent_fast_path() && !pns.too_many_digits) + { + // Unfortunately, the conventional Clinger's fast path is only possible + // when the system rounds to the nearest float. + // + // We expect the next branch to almost always be selected. + // We could check it first (before the previous branch), but + // there might be performance advantages at having the check + // be last. + if (!cpp20_and_in_constexpr() && detail::rounds_to_nearest()) + { + // We have that fegetround() == FE_TONEAREST. + // Next is Clinger's fast path. + if (pns.mantissa <= binary_format::max_mantissa_fast_path()) + { + value = T(pns.mantissa); + if (pns.exponent < 0) + { + value = value / binary_format::exact_power_of_ten(-pns.exponent); + } + else + { + value = value * binary_format::exact_power_of_ten(pns.exponent); + } + if (pns.negative) + { + value = -value; + } + return answer; + } + } + else + { + // We do not have that fegetround() == FE_TONEAREST. + // Next is a modified Clinger's fast path, inspired by Jakub Jelínek's proposal + if (pns.exponent >= 0 + && pns.mantissa <= binary_format::max_mantissa_fast_path(pns.exponent)) + { +#if defined(__clang__) || defined(FASTFLOAT_32BIT) + // Clang may map 0 to -0.0 when fegetround() == FE_DOWNWARD + if (pns.mantissa == 0) + { + value = pns.negative ? T(-0.) : T(0.); + return answer; + } +#endif + value = T(pns.mantissa) * binary_format::exact_power_of_ten(pns.exponent); + if (pns.negative) + { + value = -value; + } + return answer; + } + } + } + adjusted_mantissa am = compute_float>(pns.exponent, pns.mantissa); + if (pns.too_many_digits && am.power2 >= 0) + { + if (am != compute_float>(pns.exponent, pns.mantissa + 1)) + { + am = compute_error>(pns.exponent, pns.mantissa); + } + } + // If we called compute_float>(pns.exponent, pns.mantissa) and we have an + // invalid power (am.power2 < 0), then we need to go the long way around again. This is very + // uncommon. + if (am.power2 < 0) + { + am = digit_comp(pns, am); + } + to_float(pns.negative, am, value); + // Test for over/underflow. + if ((pns.mantissa != 0 && am.mantissa == 0 && am.power2 == 0) + || am.power2 == binary_format::infinite_power()) + { + answer.ec = std::errc::result_out_of_range; + } + return answer; + } + + + template + FASTFLOAT_CONSTEXPR20 from_chars_result_t from_chars( + UC const* first, UC const* last, T& value, int base) noexcept + { + static_assert(is_supported_char_type(), + "only char, wchar_t, char16_t and char32_t are supported"); + + from_chars_result_t answer; +#ifdef FASTFLOAT_SKIP_WHITE_SPACE // disabled by default + while ((first != last) && fast_float::is_space(uint8_t(*first))) + { + first++; + } +#endif + if (first == last || base < 2 || base > 36) + { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + return answer; + } + return parse_int_string(first, last, value, base); + } + +} // namespace fast_float + +#endif diff --git a/Include/Pipe/Extern/portable-file-dialogs.h b/Include/Pipe/Extern/portable-file-dialogs.h index 1fc79a29..5b9861ca 100644 --- a/Include/Pipe/Extern/portable-file-dialogs.h +++ b/Include/Pipe/Extern/portable-file-dialogs.h @@ -13,1875 +13,1911 @@ #pragma once #if _WIN32 -#ifndef WIN32_LEAN_AND_MEAN -# define WIN32_LEAN_AND_MEAN 1 -#endif -#include -#include -#include -#include // IFileDialog -#include -#include -#include // std::async -#include // GetUserProfileDirectory() + #ifndef WIN32_LEAN_AND_MEAN + #define WIN32_LEAN_AND_MEAN 1 + #endif + #include + #include + #include + #include // IFileDialog + #include + #include // GetUserProfileDirectory() + #include + + #include // std::async + #elif __EMSCRIPTEN__ -#include + #include #else -#ifndef _POSIX_C_SOURCE -# define _POSIX_C_SOURCE 2 // for popen() -#endif -#ifdef __APPLE__ -# ifndef _DARWIN_C_SOURCE -# define _DARWIN_C_SOURCE -# endif -#endif -#include // popen() -#include // std::getenv() -#include // fcntl() -#include // read(), pipe(), dup2(), getuid() -#include // ::kill, std::signal -#include // stat() -#include // waitpid() -#include // getpwnam() + #ifndef _POSIX_C_SOURCE + #define _POSIX_C_SOURCE 2 // for popen() + #endif + #ifdef __APPLE__ + #ifndef _DARWIN_C_SOURCE + #define _DARWIN_C_SOURCE + #endif + #endif + #include // fcntl() + #include // getpwnam() + #include // stat() + #include // waitpid() + #include // read(), pipe(), dup2(), getuid() + + #include // ::kill, std::signal + #include // popen() + #include // std::getenv() + #endif -#include // std::string -#include // std::shared_ptr -#include // std::ostream -#include // std::map -#include // std::set -#include // std::regex -#include // std::mutex, std::this_thread -#include // std::chrono +#include // std::chrono +#include // std::ostream +#include // std::map +#include // std::shared_ptr +#include // std::regex +#include // std::set +#include // std::string +#include // std::mutex, std::this_thread + // Versions of mingw64 g++ up to 9.3.0 do not have a complete IFileDialog #ifndef PFD_HAS_IFILEDIALOG -# define PFD_HAS_IFILEDIALOG 1 -# if (defined __MINGW64__ || defined __MINGW32__) && defined __GXX_ABI_VERSION -# if __GXX_ABI_VERSION <= 1013 -# undef PFD_HAS_IFILEDIALOG -# define PFD_HAS_IFILEDIALOG 0 -# endif -# endif + #define PFD_HAS_IFILEDIALOG 1 + #if (defined __MINGW64__ || defined __MINGW32__) && defined __GXX_ABI_VERSION + #if __GXX_ABI_VERSION <= 1013 + #undef PFD_HAS_IFILEDIALOG + #define PFD_HAS_IFILEDIALOG 0 + #endif + #endif #endif namespace pfd { -enum class button -{ - cancel = -1, - ok, - yes, - no, - abort, - retry, - ignore, -}; - -enum class choice -{ - ok = 0, - ok_cancel, - yes_no, - yes_no_cancel, - retry_cancel, - abort_retry_ignore, -}; - -enum class icon -{ - info = 0, - warning, - error, - question, -}; - -// Additional option flags for various dialog constructors -enum class opt : uint8_t -{ - none = 0, - // For file open, allow multiselect. - multiselect = 0x1, - // For file save, force overwrite and disable the confirmation dialog. - force_overwrite = 0x2, - // For folder select, force path to be the provided argument instead - // of the last opened directory, which is the Microsoft-recommended, - // user-friendly behaviour. - force_path = 0x4, -}; - -inline opt operator |(opt a, opt b) { return opt(uint8_t(a) | uint8_t(b)); } -inline bool operator &(opt a, opt b) { return bool(uint8_t(a) & uint8_t(b)); } - -// The settings class, only exposing to the user a way to set verbose mode -// and to force a rescan of installed desktop helpers (zenity, kdialog…). -class settings -{ -public: - static bool available(); - - static void verbose(bool value); - static void rescan(); - -protected: - explicit settings(bool resync = false); - - bool check_program(std::string const &program); - - inline bool is_osascript() const; - inline bool is_zenity() const; - inline bool is_kdialog() const; - - enum class flag - { - is_scanned = 0, - is_verbose, - - has_zenity, - has_matedialog, - has_qarma, - has_kdialog, - is_vista, - - max_flag, - }; - - // Static array of flags for internal state - bool const &flags(flag in_flag) const; - - // Non-const getter for the static array of flags - bool &flags(flag in_flag); -}; - -// Internal classes, not to be used by client applications -namespace internal -{ - -// Process wait timeout, in milliseconds -static int const default_wait_timeout = 20; - -class executor -{ - friend class dialog; - -public: - // High level function to get the result of a command - std::string result(int *exit_code = nullptr); - - // High level function to abort - bool kill(); + enum class button + { + cancel = -1, + ok, + yes, + no, + abort, + retry, + ignore, + }; + + enum class choice + { + ok = 0, + ok_cancel, + yes_no, + yes_no_cancel, + retry_cancel, + abort_retry_ignore, + }; + + enum class icon + { + info = 0, + warning, + error, + question, + }; + + // Additional option flags for various dialog constructors + enum class opt : uint8_t + { + none = 0, + // For file open, allow multiselect. + multiselect = 0x1, + // For file save, force overwrite and disable the confirmation dialog. + force_overwrite = 0x2, + // For folder select, force path to be the provided argument instead + // of the last opened directory, which is the Microsoft-recommended, + // user-friendly behaviour. + force_path = 0x4, + }; + + inline opt operator|(opt a, opt b) + { + return opt(uint8_t(a) | uint8_t(b)); + } + inline bool operator&(opt a, opt b) + { + return bool(uint8_t(a) & uint8_t(b)); + } + + // The settings class, only exposing to the user a way to set verbose mode + // and to force a rescan of installed desktop helpers (zenity, kdialog…). + class settings + { + public: + static bool available(); + + static void verbose(bool value); + static void rescan(); + + protected: + explicit settings(bool resync = false); + + bool check_program(std::string const& program); + + inline bool is_osascript() const; + inline bool is_zenity() const; + inline bool is_kdialog() const; + + enum class flag + { + is_scanned = 0, + is_verbose, + + has_zenity, + has_matedialog, + has_qarma, + has_kdialog, + is_vista, + + max_flag, + }; + + // Static array of flags for internal state + bool const& flags(flag in_flag) const; + + // Non-const getter for the static array of flags + bool& flags(flag in_flag); + }; + + // Internal classes, not to be used by client applications + namespace internal + { + + // Process wait timeout, in milliseconds + static int const default_wait_timeout = 20; + + class executor + { + friend class dialog; + + public: + // High level function to get the result of a command + std::string result(int* exit_code = nullptr); + + // High level function to abort + bool kill(); #if _WIN32 - void start_func(std::function const &fun); - static BOOL CALLBACK enum_windows_callback(HWND hwnd, LPARAM lParam); + void start_func(std::function const& fun); + static BOOL CALLBACK enum_windows_callback(HWND hwnd, LPARAM lParam); #elif __EMSCRIPTEN__ - void start(int exit_code); + void start(int exit_code); #else - void start_process(std::vector const &command); + void start_process(std::vector const& command); #endif - ~executor(); + ~executor(); -protected: - bool ready(int timeout = default_wait_timeout); - void stop(); + protected: + bool ready(int timeout = default_wait_timeout); + void stop(); -private: - bool m_running = false; - std::string m_stdout; - int m_exit_code = -1; + private: + bool m_running = false; + std::string m_stdout; + int m_exit_code = -1; #if _WIN32 - std::future m_future; - std::set m_windows; - std::condition_variable m_cond; - std::mutex m_mutex; - DWORD m_tid; + std::future m_future; + std::set m_windows; + std::condition_variable m_cond; + std::mutex m_mutex; + DWORD m_tid; #elif __EMSCRIPTEN__ || __NX__ - // FIXME: do something + // FIXME: do something #else - pid_t m_pid = 0; - int m_fd = -1; + pid_t m_pid = 0; + int m_fd = -1; #endif -}; + }; -class platform -{ -protected: + class platform + { + protected: #if _WIN32 - // Helper class around LoadLibraryA() and GetProcAddress() with some safety - class dll - { - public: - dll(std::string const &name); - ~dll(); - - template class proc - { - public: - proc(dll const &lib, std::string const &sym) - : m_proc(reinterpret_cast((void *)::GetProcAddress(lib.handle, sym.c_str()))) - {} - - operator bool() const { return m_proc != nullptr; } - operator T *() const { return m_proc; } - - private: - T *m_proc; - }; - - private: - HMODULE handle; - }; - - // Helper class around CoInitialize() and CoUnInitialize() - class ole32_dll : public dll - { - public: - ole32_dll(); - ~ole32_dll(); - bool is_initialized(); - - private: - HRESULT m_state; - }; - - // Helper class around CreateActCtx() and ActivateActCtx() - class new_style_context - { - public: - new_style_context(); - ~new_style_context(); - - private: - HANDLE create(); - ULONG_PTR m_cookie = 0; - }; + // Helper class around LoadLibraryA() and GetProcAddress() with some safety + class dll + { + public: + dll(std::string const& name); + ~dll(); + + template + class proc + { + public: + proc(dll const& lib, std::string const& sym) + : m_proc( + reinterpret_cast((void*)::GetProcAddress(lib.handle, sym.c_str()))) + {} + + operator bool() const + { + return m_proc != nullptr; + } + operator T*() const + { + return m_proc; + } + + private: + T* m_proc; + }; + + private: + HMODULE handle; + }; + + // Helper class around CoInitialize() and CoUnInitialize() + class ole32_dll : public dll + { + public: + ole32_dll(); + ~ole32_dll(); + bool is_initialized(); + + private: + HRESULT m_state; + }; + + // Helper class around CreateActCtx() and ActivateActCtx() + class new_style_context + { + public: + new_style_context(); + ~new_style_context(); + + private: + HANDLE create(); + ULONG_PTR m_cookie = 0; + }; #endif -}; - -class dialog : protected settings, protected platform -{ -public: - bool ready(int timeout = default_wait_timeout) const; - bool kill() const; - -protected: - explicit dialog(); - - std::vector desktop_helper() const; - static std::string buttons_to_name(choice _choice); - static std::string get_icon_name(icon _icon); - - std::string powershell_quote(std::string const &str) const; - std::string osascript_quote(std::string const &str) const; - std::string shell_quote(std::string const &str) const; - - // Keep handle to executing command - std::shared_ptr m_async; -}; - -class file_dialog : public dialog -{ -protected: - enum type - { - open, - save, - folder, - }; - - file_dialog(type in_type, - std::string const &title, - std::string const &default_path = "", - std::vector const &filters = {}, - opt options = opt::none); - -protected: - std::string string_result(); - std::vector vector_result(); + }; + + class dialog : protected settings, + protected platform + { + public: + bool ready(int timeout = default_wait_timeout) const; + bool kill() const; + + protected: + explicit dialog(); + + std::vector desktop_helper() const; + static std::string buttons_to_name(choice _choice); + static std::string get_icon_name(icon _icon); + + std::string powershell_quote(std::string const& str) const; + std::string osascript_quote(std::string const& str) const; + std::string shell_quote(std::string const& str) const; + + // Keep handle to executing command + std::shared_ptr m_async; + }; + + class file_dialog : public dialog + { + protected: + enum type + { + open, + save, + folder, + }; + + file_dialog(type in_type, std::string const& title, + std::string const& default_path = "", std::vector const& filters = {}, + opt options = opt::none); + + protected: + std::string string_result(); + std::vector vector_result(); #if _WIN32 - static int CALLBACK bffcallback(HWND hwnd, UINT uMsg, LPARAM, LPARAM pData); -#if PFD_HAS_IFILEDIALOG - std::string select_folder_vista(IFileDialog *ifd, bool force_path); -#endif + static int CALLBACK bffcallback(HWND hwnd, UINT uMsg, LPARAM, LPARAM pData); + #if PFD_HAS_IFILEDIALOG + std::string select_folder_vista(IFileDialog* ifd, bool force_path); + #endif - std::wstring m_wtitle; - std::wstring m_wdefault_path; + std::wstring m_wtitle; + std::wstring m_wdefault_path; - std::vector m_vector_result; + std::vector m_vector_result; #endif -}; - -} // namespace internal - -// -// The path class provides some platform-specific path constants -// - -class path : protected internal::platform -{ -public: - static std::string home(); - static std::string separator(); -}; - -// -// The notify widget -// - -class notify : public internal::dialog -{ -public: - notify(std::string const &title, - std::string const &message, - icon _icon = icon::info); -}; - -// -// The message widget -// - -class message : public internal::dialog -{ -public: - message(std::string const &title, - std::string const &text, - choice _choice = choice::ok_cancel, - icon _icon = icon::info); - - button result(); - -private: - // Some extra logic to map the exit code to button number - std::map m_mappings; -}; - -// -// The open_file, save_file, and open_folder widgets -// - -class open_file : public internal::file_dialog -{ -public: - open_file(std::string const &title, - std::string const &default_path = "", - std::vector const &filters = { "All Files", "*" }, - opt options = opt::none); + }; + + } // namespace internal + + // + // The path class provides some platform-specific path constants + // + + class path : protected internal::platform + { + public: + static std::string home(); + static std::string separator(); + }; + + // + // The notify widget + // + + class notify : public internal::dialog + { + public: + notify(std::string const& title, std::string const& message, icon _icon = icon::info); + }; + + // + // The message widget + // + + class message : public internal::dialog + { + public: + message(std::string const& title, std::string const& text, + choice _choice = choice::ok_cancel, icon _icon = icon::info); + + button result(); + + private: + // Some extra logic to map the exit code to button number + std::map m_mappings; + }; + + // + // The open_file, save_file, and open_folder widgets + // + + class open_file : public internal::file_dialog + { + public: + open_file(std::string const& title, std::string const& default_path = "", + std::vector const& filters = {"All Files", "*"}, opt options = opt::none); #if defined(__has_cpp_attribute) -#if __has_cpp_attribute(deprecated) - // Backwards compatibility - [[deprecated("Use pfd::opt::multiselect instead of allow_multiselect")]] + #if __has_cpp_attribute(deprecated) + // Backwards compatibility + [[deprecated("Use pfd::opt::multiselect instead of allow_multiselect")]] + #endif #endif -#endif - open_file(std::string const &title, - std::string const &default_path, - std::vector const &filters, - bool allow_multiselect); + open_file(std::string const& title, std::string const& default_path, + std::vector const& filters, bool allow_multiselect); - std::vector result(); -}; + std::vector result(); + }; -class save_file : public internal::file_dialog -{ -public: - save_file(std::string const &title, - std::string const &default_path = "", - std::vector const &filters = { "All Files", "*" }, - opt options = opt::none); + class save_file : public internal::file_dialog + { + public: + save_file(std::string const& title, std::string const& default_path = "", + std::vector const& filters = {"All Files", "*"}, opt options = opt::none); #if defined(__has_cpp_attribute) -#if __has_cpp_attribute(deprecated) - // Backwards compatibility - [[deprecated("Use pfd::opt::force_overwrite instead of confirm_overwrite")]] + #if __has_cpp_attribute(deprecated) + // Backwards compatibility + [[deprecated("Use pfd::opt::force_overwrite instead of confirm_overwrite")]] + #endif #endif -#endif - save_file(std::string const &title, - std::string const &default_path, - std::vector const &filters, - bool confirm_overwrite); + save_file(std::string const& title, std::string const& default_path, + std::vector const& filters, bool confirm_overwrite); - std::string result(); -}; + std::string result(); + }; -class select_folder : public internal::file_dialog -{ -public: - select_folder(std::string const &title, - std::string const &default_path = "", - opt options = opt::none); + class select_folder : public internal::file_dialog + { + public: + select_folder(std::string const& title, std::string const& default_path = "", + opt options = opt::none); - std::string result(); -}; + std::string result(); + }; -// -// Below this are all the method implementations. You may choose to define the -// macro PFD_SKIP_IMPLEMENTATION everywhere before including this header except -// in one place. This may reduce compilation times. -// + // + // Below this are all the method implementations. You may choose to define the + // macro PFD_SKIP_IMPLEMENTATION everywhere before including this header except + // in one place. This may reduce compilation times. + // #if !defined PFD_SKIP_IMPLEMENTATION -// internal free functions implementations - -namespace internal -{ - -#if _WIN32 -static inline std::wstring str2wstr(std::string const &str) -{ - int len = MultiByteToWideChar(CP_UTF8, 0, str.c_str(), (int)str.size(), nullptr, 0); - std::wstring ret(len, '\0'); - MultiByteToWideChar(CP_UTF8, 0, str.c_str(), (int)str.size(), (LPWSTR)ret.data(), (int)ret.size()); - return ret; -} - -static inline std::string wstr2str(std::wstring const &str) -{ - int len = WideCharToMultiByte(CP_UTF8, 0, str.c_str(), (int)str.size(), nullptr, 0, nullptr, nullptr); - std::string ret(len, '\0'); - WideCharToMultiByte(CP_UTF8, 0, str.c_str(), (int)str.size(), (LPSTR)ret.data(), (int)ret.size(), nullptr, nullptr); - return ret; -} - -static inline bool is_vista() -{ - OSVERSIONINFOEXW osvi; - memset(&osvi, 0, sizeof(osvi)); - DWORDLONG const mask = VerSetConditionMask( - VerSetConditionMask( - VerSetConditionMask( - 0, VER_MAJORVERSION, VER_GREATER_EQUAL), - VER_MINORVERSION, VER_GREATER_EQUAL), - VER_SERVICEPACKMAJOR, VER_GREATER_EQUAL); - osvi.dwOSVersionInfoSize = sizeof(osvi); - osvi.dwMajorVersion = HIBYTE(_WIN32_WINNT_VISTA); - osvi.dwMinorVersion = LOBYTE(_WIN32_WINNT_VISTA); - osvi.wServicePackMajor = 0; - - return VerifyVersionInfoW(&osvi, VER_MAJORVERSION | VER_MINORVERSION | VER_SERVICEPACKMAJOR, mask) != FALSE; -} -#endif - -// This is necessary until C++20 which will have std::string::ends_with() etc. - -static inline bool ends_with(std::string const &str, std::string const &suffix) -{ - return suffix.size() <= str.size() && - str.compare(str.size() - suffix.size(), suffix.size(), suffix) == 0; -} - -static inline bool starts_with(std::string const &str, std::string const &prefix) -{ - return prefix.size() <= str.size() && - str.compare(0, prefix.size(), prefix) == 0; -} - -// This is necessary until C++17 which will have std::filesystem::is_directory - -static inline bool is_directory(std::string const &path) -{ -#if _WIN32 - auto attr = GetFileAttributesA(path.c_str()); - return attr != INVALID_FILE_ATTRIBUTES && (attr & FILE_ATTRIBUTE_DIRECTORY); -#elif __EMSCRIPTEN__ - // TODO - return false; -#else - struct stat s; - return stat(path.c_str(), &s) == 0 && S_ISDIR(s.st_mode); -#endif -} - -// This is necessary because getenv is not thread-safe - -static inline std::string getenv(std::string const &str) -{ -#if _MSC_VER - char *buf = nullptr; - size_t size = 0; - if (_dupenv_s(&buf, &size, str.c_str()) == 0 && buf) - { - std::string ret(buf); - free(buf); - return ret; - } - return ""; -#else - auto buf = std::getenv(str.c_str()); - return buf ? buf : ""; -#endif -} - -} // namespace internal - -// settings implementation - -inline settings::settings(bool resync) -{ - flags(flag::is_scanned) &= !resync; - - if (flags(flag::is_scanned)) - return; - - auto pfd_verbose = internal::getenv("PFD_VERBOSE"); - auto match_no = std::regex("(|0|no|false)", std::regex_constants::icase); - if (!std::regex_match(pfd_verbose, match_no)) - flags(flag::is_verbose) = true; - -#if _WIN32 - flags(flag::is_vista) = internal::is_vista(); -#elif !__APPLE__ - flags(flag::has_zenity) = check_program("zenity"); - flags(flag::has_matedialog) = check_program("matedialog"); - flags(flag::has_qarma) = check_program("qarma"); - flags(flag::has_kdialog) = check_program("kdialog"); - - // If multiple helpers are available, try to default to the best one - if (flags(flag::has_zenity) && flags(flag::has_kdialog)) - { - auto desktop_name = internal::getenv("XDG_SESSION_DESKTOP"); - if (desktop_name == std::string("gnome")) - flags(flag::has_kdialog) = false; - else if (desktop_name == std::string("KDE")) - flags(flag::has_zenity) = false; - } -#endif - - flags(flag::is_scanned) = true; -} - -inline bool settings::available() -{ -#if _WIN32 - return true; -#elif __APPLE__ - return true; -#elif __EMSCRIPTEN__ - // FIXME: Return true after implementation is complete. - return false; -#else - settings tmp; - return tmp.flags(flag::has_zenity) || - tmp.flags(flag::has_matedialog) || - tmp.flags(flag::has_qarma) || - tmp.flags(flag::has_kdialog); -#endif -} - -inline void settings::verbose(bool value) -{ - settings().flags(flag::is_verbose) = value; -} - -inline void settings::rescan() -{ - settings(/* resync = */ true); -} - -// Check whether a program is present using “which”. -inline bool settings::check_program(std::string const &program) -{ -#if _WIN32 - (void)program; - return false; -#elif __EMSCRIPTEN__ - (void)program; - return false; -#else - int exit_code = -1; - internal::executor async; - async.start_process({"/bin/sh", "-c", "which " + program}); - async.result(&exit_code); - return exit_code == 0; -#endif -} - -inline bool settings::is_osascript() const -{ -#if __APPLE__ - return true; -#else - return false; -#endif -} - -inline bool settings::is_zenity() const -{ - return flags(flag::has_zenity) || - flags(flag::has_matedialog) || - flags(flag::has_qarma); -} - -inline bool settings::is_kdialog() const -{ - return flags(flag::has_kdialog); -} - -inline bool const &settings::flags(flag in_flag) const -{ - static bool flags[size_t(flag::max_flag)]; - return flags[size_t(in_flag)]; -} - -inline bool &settings::flags(flag in_flag) -{ - return const_cast(static_cast(this)->flags(in_flag)); -} - -// path implementation -inline std::string path::home() -{ -#if _WIN32 - // First try the USERPROFILE environment variable - auto user_profile = internal::getenv("USERPROFILE"); - if (user_profile.size() > 0) - return user_profile; - // Otherwise, try GetUserProfileDirectory() - HANDLE token = nullptr; - DWORD len = MAX_PATH; - char buf[MAX_PATH] = { '\0' }; - if (OpenProcessToken(GetCurrentProcess(), TOKEN_QUERY, &token)) - { - dll userenv("userenv.dll"); - dll::proc get_user_profile_directory(userenv, "GetUserProfileDirectoryA"); - get_user_profile_directory(token, buf, &len); - CloseHandle(token); - if (*buf) - return buf; - } -#elif __EMSCRIPTEN__ - return "/"; -#else - // First try the HOME environment variable - auto home = internal::getenv("HOME"); - if (home.size() > 0) - return home; - // Otherwise, try getpwuid_r() - size_t len = 4096; -#if defined(_SC_GETPW_R_SIZE_MAX) - auto size_max = sysconf(_SC_GETPW_R_SIZE_MAX); - if (size_max != -1) - len = size_t(size_max); -#endif - std::vector buf(len); - struct passwd pwd, *result; - if (getpwuid_r(getuid(), &pwd, buf.data(), buf.size(), &result) == 0) - return result->pw_dir; -#endif - return "/"; -} - -inline std::string path::separator() -{ -#if _WIN32 - return "\\"; -#else - return "/"; -#endif -} - -// executor implementation - -inline std::string internal::executor::result(int *exit_code /* = nullptr */) -{ - stop(); - if (exit_code) - *exit_code = m_exit_code; - return m_stdout; -} - -inline bool internal::executor::kill() -{ -#if _WIN32 - if (m_future.valid()) - { - // Close all windows that weren’t open when we started the future - auto previous_windows = m_windows; - EnumWindows(&enum_windows_callback, (LPARAM)this); - for (auto hwnd : m_windows) - if (previous_windows.find(hwnd) == previous_windows.end()) - { - SendMessage(hwnd, WM_CLOSE, 0, 0); - // Also send IDNO in case of a Yes/No or Abort/Retry/Ignore messagebox - SendMessage(hwnd, WM_COMMAND, IDNO, 0); - } - } -#elif __EMSCRIPTEN__ || __NX__ - // FIXME: do something - return false; // cannot kill -#else - ::kill(m_pid, SIGKILL); -#endif - stop(); - return true; -} - -#if _WIN32 -inline BOOL CALLBACK internal::executor::enum_windows_callback(HWND hwnd, LPARAM lParam) -{ - auto that = (executor *)lParam; - - DWORD pid; - auto tid = GetWindowThreadProcessId(hwnd, &pid); - if (tid == that->m_tid) - that->m_windows.insert(hwnd); - return TRUE; -} -#endif - -#if _WIN32 -inline void internal::executor::start_func(std::function const &fun) -{ - stop(); - - auto trampoline = [fun, this]() - { - // Save our thread id so that the caller can cancel us - m_tid = GetCurrentThreadId(); - EnumWindows(&enum_windows_callback, (LPARAM)this); - m_cond.notify_all(); - return fun(&m_exit_code); - }; - - std::unique_lock lock(m_mutex); - m_future = std::async(std::launch::async, trampoline); - m_cond.wait(lock); - m_running = true; -} - -#elif __EMSCRIPTEN__ -inline void internal::executor::start(int exit_code) -{ - m_exit_code = exit_code; -} - -#else -inline void internal::executor::start_process(std::vector const &command) -{ - stop(); - m_stdout.clear(); - m_exit_code = -1; - - int in[2], out[2]; - if (pipe(in) != 0 || pipe(out) != 0) - return; - - m_pid = fork(); - if (m_pid < 0) - return; - - close(in[m_pid ? 0 : 1]); - close(out[m_pid ? 1 : 0]); - - if (m_pid == 0) - { - dup2(in[0], STDIN_FILENO); - dup2(out[1], STDOUT_FILENO); - - // Ignore stderr so that it doesn’t pollute the console (e.g. GTK+ errors from zenity) - int fd = open("/dev/null", O_WRONLY); - dup2(fd, STDERR_FILENO); - close(fd); - - std::vector args; - std::transform(command.cbegin(), command.cend(), std::back_inserter(args), - [](std::string const &s) { return const_cast(s.c_str()); }); - args.push_back(nullptr); // null-terminate argv[] - - execvp(args[0], args.data()); - exit(1); - } - - close(in[1]); - m_fd = out[0]; - auto flags = fcntl(m_fd, F_GETFL); - fcntl(m_fd, F_SETFL, flags | O_NONBLOCK); - - m_running = true; -} -#endif - -inline internal::executor::~executor() -{ - stop(); -} - -inline bool internal::executor::ready(int timeout /* = default_wait_timeout */) -{ - if (!m_running) - return true; - -#if _WIN32 - if (m_future.valid()) - { - auto status = m_future.wait_for(std::chrono::milliseconds(timeout)); - if (status != std::future_status::ready) - { - // On Windows, we need to run the message pump. If the async - // thread uses a Windows API dialog, it may be attached to the - // main thread and waiting for messages that only we can dispatch. - MSG msg; - while (PeekMessage(&msg, nullptr, 0, 0, PM_REMOVE)) - { - TranslateMessage(&msg); - DispatchMessage(&msg); - } - return false; - } - - m_stdout = m_future.get(); - } -#elif __EMSCRIPTEN__ || __NX__ - // FIXME: do something - (void)timeout; -#else - char buf[BUFSIZ]; - ssize_t received = read(m_fd, buf, BUFSIZ); // Flawfinder: ignore - if (received > 0) - { - m_stdout += std::string(buf, received); - return false; - } - - // Reap child process if it is dead. It is possible that the system has already reaped it - // (this happens when the calling application handles or ignores SIG_CHLD) and results in - // waitpid() failing with ECHILD. Otherwise we assume the child is running and we sleep for - // a little while. - int status; - pid_t child = waitpid(m_pid, &status, WNOHANG); - if (child != m_pid && (child >= 0 || errno != ECHILD)) - { - // FIXME: this happens almost always at first iteration - std::this_thread::sleep_for(std::chrono::milliseconds(timeout)); - return false; - } - - close(m_fd); - m_exit_code = WEXITSTATUS(status); -#endif - - m_running = false; - return true; -} - -inline void internal::executor::stop() -{ - // Loop until the user closes the dialog - while (!ready()) - ; -} - -// dll implementation - -#if _WIN32 -inline internal::platform::dll::dll(std::string const &name) - : handle(::LoadLibraryA(name.c_str())) -{} - -inline internal::platform::dll::~dll() -{ - if (handle) - ::FreeLibrary(handle); -} -#endif // _WIN32 - -// ole32_dll implementation - -#if _WIN32 -inline internal::platform::ole32_dll::ole32_dll() - : dll("ole32.dll") -{ - // Use COINIT_MULTITHREADED because COINIT_APARTMENTTHREADED causes crashes. - // See https://github.com/samhocevar/portable-file-dialogs/issues/51 - auto coinit = proc(*this, "CoInitializeEx"); - m_state = coinit(nullptr, COINIT_MULTITHREADED); -} - -inline internal::platform::ole32_dll::~ole32_dll() -{ - if (is_initialized()) - proc(*this, "CoUninitialize")(); -} - -inline bool internal::platform::ole32_dll::is_initialized() -{ - return m_state == S_OK || m_state == S_FALSE; -} -#endif - -// new_style_context implementation - -#if _WIN32 -inline internal::platform::new_style_context::new_style_context() -{ - // Only create one activation context for the whole app lifetime. - static HANDLE hctx = create(); - - if (hctx != INVALID_HANDLE_VALUE) - ActivateActCtx(hctx, &m_cookie); -} - -inline internal::platform::new_style_context::~new_style_context() -{ - DeactivateActCtx(0, m_cookie); -} - -inline HANDLE internal::platform::new_style_context::create() -{ - // This “hack” seems to be necessary for this code to work on windows XP. - // Without it, dialogs do not show and close immediately. GetError() - // returns 0 so I don’t know what causes this. I was not able to reproduce - // this behavior on Windows 7 and 10 but just in case, let it be here for - // those versions too. - // This hack is not required if other dialogs are used (they load comdlg32 - // automatically), only if message boxes are used. - dll comdlg32("comdlg32.dll"); - - // Using approach as shown here: https://stackoverflow.com/a/10444161 - UINT len = ::GetSystemDirectoryA(nullptr, 0); - std::string sys_dir(len, '\0'); - ::GetSystemDirectoryA(&sys_dir[0], len); - - ACTCTXA act_ctx = - { - // Do not set flag ACTCTX_FLAG_SET_PROCESS_DEFAULT, since it causes a - // crash with error “default context is already set”. - sizeof(act_ctx), - ACTCTX_FLAG_RESOURCE_NAME_VALID | ACTCTX_FLAG_ASSEMBLY_DIRECTORY_VALID, - "shell32.dll", 0, 0, sys_dir.c_str(), (LPCSTR)124, nullptr, 0, - }; - - return ::CreateActCtxA(&act_ctx); -} -#endif // _WIN32 - -// dialog implementation - -inline bool internal::dialog::ready(int timeout /* = default_wait_timeout */) const -{ - return m_async->ready(timeout); -} - -inline bool internal::dialog::kill() const -{ - return m_async->kill(); -} - -inline internal::dialog::dialog() - : m_async(std::make_shared()) -{ -} - -inline std::vector internal::dialog::desktop_helper() const -{ -#if __APPLE__ - return { "osascript" }; -#else - return { flags(flag::has_zenity) ? "zenity" - : flags(flag::has_matedialog) ? "matedialog" - : flags(flag::has_qarma) ? "qarma" - : flags(flag::has_kdialog) ? "kdialog" - : "echo" }; -#endif -} - -inline std::string internal::dialog::buttons_to_name(choice _choice) -{ - switch (_choice) - { - case choice::ok_cancel: return "okcancel"; - case choice::yes_no: return "yesno"; - case choice::yes_no_cancel: return "yesnocancel"; - case choice::retry_cancel: return "retrycancel"; - case choice::abort_retry_ignore: return "abortretryignore"; - /* case choice::ok: */ default: return "ok"; - } -} - -inline std::string internal::dialog::get_icon_name(icon _icon) -{ - switch (_icon) - { - case icon::warning: return "warning"; - case icon::error: return "error"; - case icon::question: return "question"; - // Zenity wants "information" but WinForms wants "info" - /* case icon::info: */ default: -#if _WIN32 - return "info"; -#else - return "information"; -#endif - } -} - -// This is only used for debugging purposes -inline std::ostream& operator <<(std::ostream &s, std::vector const &v) -{ - int not_first = 0; - for (auto &e : v) - s << (not_first++ ? " " : "") << e; - return s; -} - -// Properly quote a string for Powershell: replace ' or " with '' or "" -// FIXME: we should probably get rid of newlines! -// FIXME: the \" sequence seems unsafe, too! -// XXX: this is no longer used but I would like to keep it around just in case -inline std::string internal::dialog::powershell_quote(std::string const &str) const -{ - return "'" + std::regex_replace(str, std::regex("['\"]"), "$&$&") + "'"; -} - -// Properly quote a string for osascript: replace \ or " with \\ or \" -// XXX: this also used to replace ' with \' when popen was used, but it would be -// smarter to do shell_quote(osascript_quote(...)) if this is needed again. -inline std::string internal::dialog::osascript_quote(std::string const &str) const -{ - return "\"" + std::regex_replace(str, std::regex("[\\\\\"]"), "\\$&") + "\""; -} - -// Properly quote a string for the shell: just replace ' with '\'' -// XXX: this is no longer used but I would like to keep it around just in case -inline std::string internal::dialog::shell_quote(std::string const &str) const -{ - return "'" + std::regex_replace(str, std::regex("'"), "'\\''") + "'"; -} - -// file_dialog implementation - -inline internal::file_dialog::file_dialog(type in_type, - std::string const &title, - std::string const &default_path /* = "" */, - std::vector const &filters /* = {} */, - opt options /* = opt::none */) -{ -#if _WIN32 - std::string filter_list; - std::regex whitespace(" *"); - for (size_t i = 0; i + 1 < filters.size(); i += 2) - { - filter_list += filters[i] + '\0'; - filter_list += std::regex_replace(filters[i + 1], whitespace, ";") + '\0'; - } - filter_list += '\0'; - - m_async->start_func([this, in_type, title, default_path, filter_list, - options](int *exit_code) -> std::string - { - (void)exit_code; - m_wtitle = internal::str2wstr(title); - m_wdefault_path = internal::str2wstr(default_path); - auto wfilter_list = internal::str2wstr(filter_list); - - // Initialise COM. This is required for the new folder selection window, - // (see https://github.com/samhocevar/portable-file-dialogs/pull/21) - // and to avoid random crashes with GetOpenFileNameW() (see - // https://github.com/samhocevar/portable-file-dialogs/issues/51) - ole32_dll ole32; - - // Folder selection uses a different method - if (in_type == type::folder) - { -#if PFD_HAS_IFILEDIALOG - if (flags(flag::is_vista)) - { - // On Vista and higher we should be able to use IFileDialog for folder selection - IFileDialog *ifd; - HRESULT hr = dll::proc(ole32, "CoCreateInstance") - (CLSID_FileOpenDialog, nullptr, CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&ifd)); - - // In case CoCreateInstance fails (which it should not), try legacy approach - if (SUCCEEDED(hr)) - return select_folder_vista(ifd, options & opt::force_path); - } -#endif - - BROWSEINFOW bi; - memset(&bi, 0, sizeof(bi)); - - bi.lpfn = &bffcallback; - bi.lParam = (LPARAM)this; - - if (flags(flag::is_vista)) - { - if (ole32.is_initialized()) - bi.ulFlags |= BIF_NEWDIALOGSTYLE; - bi.ulFlags |= BIF_EDITBOX; - bi.ulFlags |= BIF_STATUSTEXT; - } - - auto *list = SHBrowseForFolderW(&bi); - std::string ret; - if (list) - { - auto buffer = new wchar_t[MAX_PATH]; - SHGetPathFromIDListW(list, buffer); - dll::proc(ole32, "CoTaskMemFree")(list); - ret = internal::wstr2str(buffer); - delete[] buffer; - } - return ret; - } - - OPENFILENAMEW ofn; - memset(&ofn, 0, sizeof(ofn)); - ofn.lStructSize = sizeof(OPENFILENAMEW); - ofn.hwndOwner = GetActiveWindow(); - - ofn.lpstrFilter = wfilter_list.c_str(); - - auto woutput = std::wstring(MAX_PATH * 256, L'\0'); - ofn.lpstrFile = (LPWSTR)woutput.data(); - ofn.nMaxFile = (DWORD)woutput.size(); - if (!m_wdefault_path.empty()) - { - // If a directory was provided, use it as the initial directory. If - // a valid path was provided, use it as the initial file. Otherwise, - // let the Windows API decide. - auto path_attr = GetFileAttributesW(m_wdefault_path.c_str()); - if (path_attr != INVALID_FILE_ATTRIBUTES && (path_attr & FILE_ATTRIBUTE_DIRECTORY)) - ofn.lpstrInitialDir = m_wdefault_path.c_str(); - else if (m_wdefault_path.size() <= woutput.size()) - //second argument is size of buffer, not length of string - StringCchCopyW(ofn.lpstrFile, MAX_PATH*256+1, m_wdefault_path.c_str()); - else - { - ofn.lpstrFileTitle = (LPWSTR)m_wdefault_path.data(); - ofn.nMaxFileTitle = (DWORD)m_wdefault_path.size(); - } - } - ofn.lpstrTitle = m_wtitle.c_str(); - ofn.Flags = OFN_NOCHANGEDIR | OFN_EXPLORER; - - dll comdlg32("comdlg32.dll"); - - // Apply new visual style (required for windows XP) - new_style_context ctx; - - if (in_type == type::save) - { - if (!(options & opt::force_overwrite)) - ofn.Flags |= OFN_OVERWRITEPROMPT; - - dll::proc get_save_file_name(comdlg32, "GetSaveFileNameW"); - if (get_save_file_name(&ofn) == 0) - return ""; - return internal::wstr2str(woutput.c_str()); - } - else - { - if (options & opt::multiselect) - ofn.Flags |= OFN_ALLOWMULTISELECT; - ofn.Flags |= OFN_PATHMUSTEXIST; - - dll::proc get_open_file_name(comdlg32, "GetOpenFileNameW"); - if (get_open_file_name(&ofn) == 0) - return ""; - } - - std::string prefix; - for (wchar_t const *p = woutput.c_str(); *p; ) - { - auto filename = internal::wstr2str(p); - p += wcslen(p); - // In multiselect mode, we advance p one wchar further and - // check for another filename. If there is one and the - // prefix is empty, it means we just read the prefix. - if ((options & opt::multiselect) && *++p && prefix.empty()) - { - prefix = filename + "/"; - continue; - } - - m_vector_result.push_back(prefix + filename); - } - - return ""; - }); -#elif __EMSCRIPTEN__ - // FIXME: do something - (void)in_type; - (void)title; - (void)default_path; - (void)filters; - (void)options; -#else - auto command = desktop_helper(); - - if (is_osascript()) - { - std::string script = "set ret to choose"; - switch (in_type) - { - case type::save: - script += " file name"; - break; - case type::open: default: - script += " file"; - if (options & opt::multiselect) - script += " with multiple selections allowed"; - break; - case type::folder: - script += " folder"; - break; - } - - if (default_path.size()) - { - if (in_type == type::folder || is_directory(default_path)) - script += " default location "; - else - script += " default name "; - script += osascript_quote(default_path); - } - - script += " with prompt " + osascript_quote(title); - - if (in_type == type::open) - { - // Concatenate all user-provided filter patterns - std::string patterns; - for (size_t i = 0; i < filters.size() / 2; ++i) - patterns += " " + filters[2 * i + 1]; - - // Split the pattern list to check whether "*" is in there; if it - // is, we have to disable filters because there is no mechanism in - // OS X for the user to override the filter. - std::regex sep("\\s+"); - std::string filter_list; - bool has_filter = true; - std::sregex_token_iterator iter(patterns.begin(), patterns.end(), sep, -1); - std::sregex_token_iterator end; - for ( ; iter != end; ++iter) - { - auto pat = iter->str(); - if (pat == "*" || pat == "*.*") - has_filter = false; - else if (internal::starts_with(pat, "*.")) - filter_list += "," + osascript_quote(pat.substr(2, pat.size() - 2)); - } - - if (has_filter && filter_list.size() > 0) - { - // There is a weird AppleScript bug where file extensions of length != 3 are - // ignored, e.g. type{"txt"} works, but type{"json"} does not. Fortunately if - // the whole list starts with a 3-character extension, everything works again. - // We use "///" for such an extension because we are sure it cannot appear in - // an actual filename. - script += " of type {\"///\"" + filter_list + "}"; - } - } - - if (in_type == type::open && (options & opt::multiselect)) - { - script += "\nset s to \"\""; - script += "\nrepeat with i in ret"; - script += "\n set s to s & (POSIX path of i) & \"\\n\""; - script += "\nend repeat"; - script += "\ncopy s to stdout"; - } - else - { - script += "\nPOSIX path of ret"; - } - - command.push_back("-e"); - command.push_back(script); - } - else if (is_zenity()) - { - command.push_back("--file-selection"); - - // If the default path is a directory, make sure it ends with "/" otherwise zenity will - // open the file dialog in the parent directory. - auto filename_arg = "--filename=" + default_path; - if (in_type != type::folder && !ends_with(default_path, "/") && internal::is_directory(default_path)) - filename_arg += "/"; - command.push_back(filename_arg); - - command.push_back("--title"); - command.push_back(title); - command.push_back("--separator=\n"); - - for (size_t i = 0; i < filters.size() / 2; ++i) - { - command.push_back("--file-filter"); - command.push_back(filters[2 * i] + "|" + filters[2 * i + 1]); - } - - if (in_type == type::save) - command.push_back("--save"); - if (in_type == type::folder) - command.push_back("--directory"); - if (!(options & opt::force_overwrite)) - command.push_back("--confirm-overwrite"); - if (options & opt::multiselect) - command.push_back("--multiple"); - } - else if (is_kdialog()) - { - switch (in_type) - { - case type::save: command.push_back("--getsavefilename"); break; - case type::open: command.push_back("--getopenfilename"); break; - case type::folder: command.push_back("--getexistingdirectory"); break; - } - if (options & opt::multiselect) - { - command.push_back("--multiple"); - command.push_back("--separate-output"); - } - - command.push_back(default_path); - - std::string filter; - for (size_t i = 0; i < filters.size() / 2; ++i) - filter += (i == 0 ? "" : " | ") + filters[2 * i] + "(" + filters[2 * i + 1] + ")"; - command.push_back(filter); - - command.push_back("--title"); - command.push_back(title); - } - - if (flags(flag::is_verbose)) - std::cerr << "pfd: " << command << std::endl; - - m_async->start_process(command); -#endif -} - -inline std::string internal::file_dialog::string_result() -{ -#if _WIN32 - return m_async->result(); -#else - auto ret = m_async->result(); - // Strip potential trailing newline (zenity). Also strip trailing slash - // added by osascript for consistency with other backends. - while (!ret.empty() && (ret.back() == '\n' || ret.back() == '/')) - ret.pop_back(); - return ret; -#endif -} - -inline std::vector internal::file_dialog::vector_result() -{ -#if _WIN32 - m_async->result(); - return m_vector_result; -#else - std::vector ret; - auto result = m_async->result(); - for (;;) - { - // Split result along newline characters - auto i = result.find('\n'); - if (i == 0 || i == std::string::npos) - break; - ret.push_back(result.substr(0, i)); - result = result.substr(i + 1, result.size()); - } - return ret; -#endif -} - -#if _WIN32 -// Use a static function to pass as BFFCALLBACK for legacy folder select -inline int CALLBACK internal::file_dialog::bffcallback(HWND hwnd, UINT uMsg, - LPARAM, LPARAM pData) -{ - auto inst = (file_dialog *)pData; - switch (uMsg) - { - case BFFM_INITIALIZED: - SendMessage(hwnd, BFFM_SETSELECTIONW, TRUE, (LPARAM)inst->m_wdefault_path.c_str()); - break; - } - return 0; -} - -#if PFD_HAS_IFILEDIALOG -inline std::string internal::file_dialog::select_folder_vista(IFileDialog *ifd, bool force_path) -{ - std::string result; - - IShellItem *folder; - - // Load library at runtime so app doesn't link it at load time (which will fail on windows XP) - dll shell32("shell32.dll"); - dll::proc - create_item(shell32, "SHCreateItemFromParsingName"); - - if (!create_item) - return ""; - - auto hr = create_item(m_wdefault_path.c_str(), - nullptr, - IID_PPV_ARGS(&folder)); - - // Set default folder if found. This only sets the default folder. If - // Windows has any info about the most recently selected folder, it - // will display it instead. Generally, calling SetFolder() to set the - // current directory “is not a good or expected user experience and - // should therefore be avoided”: - // https://docs.microsoft.com/windows/win32/api/shobjidl_core/nf-shobjidl_core-ifiledialog-setfolder - if (SUCCEEDED(hr)) - { - if (force_path) - ifd->SetFolder(folder); - else - ifd->SetDefaultFolder(folder); - folder->Release(); - } - - // Set the dialog title and option to select folders - ifd->SetOptions(FOS_PICKFOLDERS | FOS_FORCEFILESYSTEM); - ifd->SetTitle(m_wtitle.c_str()); - - hr = ifd->Show(GetActiveWindow()); - if (SUCCEEDED(hr)) - { - IShellItem* item; - hr = ifd->GetResult(&item); - if (SUCCEEDED(hr)) - { - wchar_t* wname = nullptr; - // This is unlikely to fail because we use FOS_FORCEFILESYSTEM, but try - // to output a debug message just in case. - if (SUCCEEDED(item->GetDisplayName(SIGDN_FILESYSPATH, &wname))) - { - result = internal::wstr2str(std::wstring(wname)); - dll::proc(ole32_dll(), "CoTaskMemFree")(wname); - } - else - { - if (SUCCEEDED(item->GetDisplayName(SIGDN_NORMALDISPLAY, &wname))) - { - auto name = internal::wstr2str(std::wstring(wname)); - dll::proc(ole32_dll(), "CoTaskMemFree")(wname); - std::cerr << "pfd: failed to get path for " << name << std::endl; - } - else - std::cerr << "pfd: item of unknown type selected" << std::endl; - } - - item->Release(); - } - } - - ifd->Release(); - - return result; -} -#endif -#endif - -// notify implementation - -inline notify::notify(std::string const &title, - std::string const &message, - icon _icon /* = icon::info */) -{ - if (_icon == icon::question) // Not supported by notifications - _icon = icon::info; - -#if _WIN32 - // Use a static shared pointer for notify_icon so that we can delete - // it whenever we need to display a new one, and we can also wait - // until the program has finished running. - struct notify_icon_data : public NOTIFYICONDATAW - { - ~notify_icon_data() { Shell_NotifyIconW(NIM_DELETE, this); } - }; - - static std::shared_ptr nid; - - // Release the previous notification icon, if any, and allocate a new - // one. Note that std::make_shared() does value initialization, so there - // is no need to memset the structure. - nid = nullptr; - nid = std::make_shared(); - - // For XP support - nid->cbSize = NOTIFYICONDATAW_V2_SIZE; - nid->hWnd = nullptr; - nid->uID = 0; - - // Flag Description: - // - NIF_ICON The hIcon member is valid. - // - NIF_MESSAGE The uCallbackMessage member is valid. - // - NIF_TIP The szTip member is valid. - // - NIF_STATE The dwState and dwStateMask members are valid. - // - NIF_INFO Use a balloon ToolTip instead of a standard ToolTip. The szInfo, uTimeout, szInfoTitle, and dwInfoFlags members are valid. - // - NIF_GUID Reserved. - nid->uFlags = NIF_MESSAGE | NIF_ICON | NIF_INFO; - - // Flag Description - // - NIIF_ERROR An error icon. - // - NIIF_INFO An information icon. - // - NIIF_NONE No icon. - // - NIIF_WARNING A warning icon. - // - NIIF_ICON_MASK Version 6.0. Reserved. - // - NIIF_NOSOUND Version 6.0. Do not play the associated sound. Applies only to balloon ToolTips - switch (_icon) - { - case icon::warning: nid->dwInfoFlags = NIIF_WARNING; break; - case icon::error: nid->dwInfoFlags = NIIF_ERROR; break; - /* case icon::info: */ default: nid->dwInfoFlags = NIIF_INFO; break; - } - - ENUMRESNAMEPROC icon_enum_callback = [](HMODULE, LPCTSTR, LPTSTR lpName, LONG_PTR lParam) -> BOOL - { - ((NOTIFYICONDATAW *)lParam)->hIcon = ::LoadIcon(GetModuleHandle(nullptr), lpName); - return false; - }; - - nid->hIcon = ::LoadIcon(nullptr, IDI_APPLICATION); - ::EnumResourceNames(nullptr, RT_GROUP_ICON, icon_enum_callback, (LONG_PTR)nid.get()); - - nid->uTimeout = 5000; - - StringCchCopyW(nid->szInfoTitle, ARRAYSIZE(nid->szInfoTitle), internal::str2wstr(title).c_str()); - StringCchCopyW(nid->szInfo, ARRAYSIZE(nid->szInfo), internal::str2wstr(message).c_str()); - - // Display the new icon - Shell_NotifyIconW(NIM_ADD, nid.get()); -#elif __EMSCRIPTEN__ - // FIXME: do something - (void)title; - (void)message; -#else - auto command = desktop_helper(); - - if (is_osascript()) - { - command.push_back("-e"); - command.push_back("display notification " + osascript_quote(message) + - " with title " + osascript_quote(title)); - } - else if (is_zenity()) - { - command.push_back("--notification"); - command.push_back("--window-icon"); - command.push_back(get_icon_name(_icon)); - command.push_back("--text"); - command.push_back(title + "\n" + message); - } - else if (is_kdialog()) - { - command.push_back("--icon"); - command.push_back(get_icon_name(_icon)); - command.push_back("--title"); - command.push_back(title); - command.push_back("--passivepopup"); - command.push_back(message); - command.push_back("5"); - } - - if (flags(flag::is_verbose)) - std::cerr << "pfd: " << command << std::endl; - - m_async->start_process(command); -#endif -} - -// message implementation - -inline message::message(std::string const &title, - std::string const &text, - choice _choice /* = choice::ok_cancel */, - icon _icon /* = icon::info */) -{ -#if _WIN32 - // Use MB_SYSTEMMODAL rather than MB_TOPMOST to ensure the message window is brought - // to front. See https://github.com/samhocevar/portable-file-dialogs/issues/52 - UINT style = MB_SYSTEMMODAL; - switch (_icon) - { - case icon::warning: style |= MB_ICONWARNING; break; - case icon::error: style |= MB_ICONERROR; break; - case icon::question: style |= MB_ICONQUESTION; break; - /* case icon::info: */ default: style |= MB_ICONINFORMATION; break; - } - - switch (_choice) - { - case choice::ok_cancel: style |= MB_OKCANCEL; break; - case choice::yes_no: style |= MB_YESNO; break; - case choice::yes_no_cancel: style |= MB_YESNOCANCEL; break; - case choice::retry_cancel: style |= MB_RETRYCANCEL; break; - case choice::abort_retry_ignore: style |= MB_ABORTRETRYIGNORE; break; - /* case choice::ok: */ default: style |= MB_OK; break; - } - - m_mappings[IDCANCEL] = button::cancel; - m_mappings[IDOK] = button::ok; - m_mappings[IDYES] = button::yes; - m_mappings[IDNO] = button::no; - m_mappings[IDABORT] = button::abort; - m_mappings[IDRETRY] = button::retry; - m_mappings[IDIGNORE] = button::ignore; - - m_async->start_func([text, title, style](int* exit_code) -> std::string - { - auto wtext = internal::str2wstr(text); - auto wtitle = internal::str2wstr(title); - // Apply new visual style (required for all Windows versions) - new_style_context ctx; - *exit_code = MessageBoxW(GetActiveWindow(), wtext.c_str(), wtitle.c_str(), style); - return ""; - }); - -#elif __EMSCRIPTEN__ - std::string full_message; - switch (_icon) - { - case icon::warning: full_message = "⚠️"; break; - case icon::error: full_message = "⛔"; break; - case icon::question: full_message = "❓"; break; - /* case icon::info: */ default: full_message = "ℹ"; break; - } - - full_message += ' ' + title + "\n\n" + text; - - // This does not really start an async task; it just passes the - // EM_ASM_INT return value to a fake start() function. - m_async->start(EM_ASM_INT( - { - if ($1) - return window.confirm(UTF8ToString($0)) ? 0 : -1; - alert(UTF8ToString($0)); - return 0; - }, full_message.c_str(), _choice == choice::ok_cancel)); -#else - auto command = desktop_helper(); - - if (is_osascript()) - { - std::string script = "display dialog " + osascript_quote(text) + - " with title " + osascript_quote(title); - auto if_cancel = button::cancel; - switch (_choice) - { - case choice::ok_cancel: - script += "buttons {\"OK\", \"Cancel\"}" - " default button \"OK\"" - " cancel button \"Cancel\""; - break; - case choice::yes_no: - script += "buttons {\"Yes\", \"No\"}" - " default button \"Yes\"" - " cancel button \"No\""; - if_cancel = button::no; - break; - case choice::yes_no_cancel: - script += "buttons {\"Yes\", \"No\", \"Cancel\"}" - " default button \"Yes\"" - " cancel button \"Cancel\""; - break; - case choice::retry_cancel: - script += "buttons {\"Retry\", \"Cancel\"}" - " default button \"Retry\"" - " cancel button \"Cancel\""; - break; - case choice::abort_retry_ignore: - script += "buttons {\"Abort\", \"Retry\", \"Ignore\"}" - " default button \"Abort\"" - " cancel button \"Retry\""; - if_cancel = button::retry; - break; - case choice::ok: default: - script += "buttons {\"OK\"}" - " default button \"OK\"" - " cancel button \"OK\""; - if_cancel = button::ok; - break; - } - m_mappings[1] = if_cancel; - m_mappings[256] = if_cancel; // XXX: I think this was never correct - script += " with icon "; - switch (_icon) - { - #define PFD_OSX_ICON(n) "alias ((path to library folder from system domain) as text " \ - "& \"CoreServices:CoreTypes.bundle:Contents:Resources:" n ".icns\")" - case icon::info: default: script += PFD_OSX_ICON("ToolBarInfo"); break; - case icon::warning: script += "caution"; break; - case icon::error: script += "stop"; break; - case icon::question: script += PFD_OSX_ICON("GenericQuestionMarkIcon"); break; - #undef PFD_OSX_ICON - } - - command.push_back("-e"); - command.push_back(script); - } - else if (is_zenity()) - { - switch (_choice) - { - case choice::ok_cancel: - command.insert(command.end(), { "--question", "--cancel-label=Cancel", "--ok-label=OK" }); break; - case choice::yes_no: - // Do not use standard --question because it causes “No” to return -1, - // which is inconsistent with the “Yes/No/Cancel” mode below. - command.insert(command.end(), { "--question", "--switch", "--extra-button=No", "--extra-button=Yes" }); break; - case choice::yes_no_cancel: - command.insert(command.end(), { "--question", "--switch", "--extra-button=Cancel", "--extra-button=No", "--extra-button=Yes" }); break; - case choice::retry_cancel: - command.insert(command.end(), { "--question", "--switch", "--extra-button=Cancel", "--extra-button=Retry" }); break; - case choice::abort_retry_ignore: - command.insert(command.end(), { "--question", "--switch", "--extra-button=Ignore", "--extra-button=Abort", "--extra-button=Retry" }); break; - case choice::ok: - default: - switch (_icon) - { - case icon::error: command.push_back("--error"); break; - case icon::warning: command.push_back("--warning"); break; - default: command.push_back("--info"); break; - } - } - - command.insert(command.end(), { "--title", title, - "--width=300", "--height=0", // sensible defaults - "--no-markup", // do not interpret text as Pango markup - "--text", text, - "--icon-name=dialog-" + get_icon_name(_icon) }); - } - else if (is_kdialog()) - { - if (_choice == choice::ok) - { - switch (_icon) - { - case icon::error: command.push_back("--error"); break; - case icon::warning: command.push_back("--sorry"); break; - default: command.push_back("--msgbox"); break; - } - } - else - { - std::string flag = "--"; - if (_icon == icon::warning || _icon == icon::error) - flag += "warning"; - flag += "yesno"; - if (_choice == choice::yes_no_cancel) - flag += "cancel"; - command.push_back(flag); - if (_choice == choice::yes_no || _choice == choice::yes_no_cancel) - { - m_mappings[0] = button::yes; - m_mappings[256] = button::no; - } - } - - command.push_back(text); - command.push_back("--title"); - command.push_back(title); - - // Must be after the above part - if (_choice == choice::ok_cancel) - command.insert(command.end(), { "--yes-label", "OK", "--no-label", "Cancel" }); - } - - if (flags(flag::is_verbose)) - std::cerr << "pfd: " << command << std::endl; - - m_async->start_process(command); -#endif -} - -inline button message::result() -{ - int exit_code; - auto ret = m_async->result(&exit_code); - // osascript will say "button returned:Cancel\n" - // and others will just say "Cancel\n" - if (internal::ends_with(ret, "Cancel\n")) - return button::cancel; - if (internal::ends_with(ret, "OK\n")) - return button::ok; - if (internal::ends_with(ret, "Yes\n")) - return button::yes; - if (internal::ends_with(ret, "No\n")) - return button::no; - if (internal::ends_with(ret, "Abort\n")) - return button::abort; - if (internal::ends_with(ret, "Retry\n")) - return button::retry; - if (internal::ends_with(ret, "Ignore\n")) - return button::ignore; - if (m_mappings.count(exit_code) != 0) - return m_mappings[exit_code]; - return exit_code == 0 ? button::ok : button::cancel; -} - -// open_file implementation - -inline open_file::open_file(std::string const &title, - std::string const &default_path /* = "" */, - std::vector const &filters /* = { "All Files", "*" } */, - opt options /* = opt::none */) - : file_dialog(type::open, title, default_path, filters, options) -{ -} - -inline open_file::open_file(std::string const &title, - std::string const &default_path, - std::vector const &filters, - bool allow_multiselect) - : open_file(title, default_path, filters, - (allow_multiselect ? opt::multiselect : opt::none)) -{ -} - -inline std::vector open_file::result() -{ - return vector_result(); -} - -// save_file implementation - -inline save_file::save_file(std::string const &title, - std::string const &default_path /* = "" */, - std::vector const &filters /* = { "All Files", "*" } */, - opt options /* = opt::none */) - : file_dialog(type::save, title, default_path, filters, options) -{ -} - -inline save_file::save_file(std::string const &title, - std::string const &default_path, - std::vector const &filters, - bool confirm_overwrite) - : save_file(title, default_path, filters, - (confirm_overwrite ? opt::none : opt::force_overwrite)) -{ -} - -inline std::string save_file::result() -{ - return string_result(); -} - -// select_folder implementation - -inline select_folder::select_folder(std::string const &title, - std::string const &default_path /* = "" */, - opt options /* = opt::none */) - : file_dialog(type::folder, title, default_path, {}, options) -{ -} - -inline std::string select_folder::result() -{ - return string_result(); -} - -#endif // PFD_SKIP_IMPLEMENTATION - -} // namespace pfd + // internal free functions implementations + + namespace internal + { + + #if _WIN32 + static inline std::wstring str2wstr(std::string const& str) + { + int len = MultiByteToWideChar(CP_UTF8, 0, str.c_str(), (int)str.size(), nullptr, 0); + std::wstring ret(len, '\0'); + MultiByteToWideChar( + CP_UTF8, 0, str.c_str(), (int)str.size(), (LPWSTR)ret.data(), (int)ret.size()); + return ret; + } + + static inline std::string wstr2str(std::wstring const& str) + { + int len = WideCharToMultiByte( + CP_UTF8, 0, str.c_str(), (int)str.size(), nullptr, 0, nullptr, nullptr); + std::string ret(len, '\0'); + WideCharToMultiByte(CP_UTF8, 0, str.c_str(), (int)str.size(), (LPSTR)ret.data(), + (int)ret.size(), nullptr, nullptr); + return ret; + } + + static inline bool is_vista() + { + OSVERSIONINFOEXW osvi; + memset(&osvi, 0, sizeof(osvi)); + DWORDLONG const mask = VerSetConditionMask( + VerSetConditionMask(VerSetConditionMask(0, VER_MAJORVERSION, VER_GREATER_EQUAL), + VER_MINORVERSION, VER_GREATER_EQUAL), + VER_SERVICEPACKMAJOR, VER_GREATER_EQUAL); + osvi.dwOSVersionInfoSize = sizeof(osvi); + osvi.dwMajorVersion = HIBYTE(_WIN32_WINNT_VISTA); + osvi.dwMinorVersion = LOBYTE(_WIN32_WINNT_VISTA); + osvi.wServicePackMajor = 0; + + return VerifyVersionInfoW( + &osvi, VER_MAJORVERSION | VER_MINORVERSION | VER_SERVICEPACKMAJOR, mask) + != FALSE; + } + #endif + + // This is necessary until C++20 which will have std::string::ends_with() etc. + + static inline bool ends_with(std::string const& str, std::string const& suffix) + { + return suffix.size() <= str.size() + && str.compare(str.size() - suffix.size(), suffix.size(), suffix) == 0; + } + + static inline bool starts_with(std::string const& str, std::string const& prefix) + { + return prefix.size() <= str.size() && str.compare(0, prefix.size(), prefix) == 0; + } + + // This is necessary until C++17 which will have std::filesystem::is_directory + + static inline bool is_directory(std::string const& path) + { + #if _WIN32 + auto attr = GetFileAttributesA(path.c_str()); + return attr != INVALID_FILE_ATTRIBUTES && (attr & FILE_ATTRIBUTE_DIRECTORY); + #elif __EMSCRIPTEN__ + // TODO + return false; + #else + struct stat s; + return stat(path.c_str(), &s) == 0 && S_ISDIR(s.st_mode); + #endif + } + + // This is necessary because getenv is not thread-safe + + static inline std::string getenv(std::string const& str) + { + #if _MSC_VER + char* buf = nullptr; + size_t size = 0; + if (_dupenv_s(&buf, &size, str.c_str()) == 0 && buf) + { + std::string ret(buf); + free(buf); + return ret; + } + return ""; + #else + auto buf = std::getenv(str.c_str()); + return buf ? buf : ""; + #endif + } + + } // namespace internal + + // settings implementation + + inline settings::settings(bool resync) + { + flags(flag::is_scanned) &= !resync; + + if (flags(flag::is_scanned)) + return; + + auto pfd_verbose = internal::getenv("PFD_VERBOSE"); + auto match_no = std::regex("(|0|no|false)", std::regex_constants::icase); + if (!std::regex_match(pfd_verbose, match_no)) + flags(flag::is_verbose) = true; + + #if _WIN32 + flags(flag::is_vista) = internal::is_vista(); + #elif !__APPLE__ + flags(flag::has_zenity) = check_program("zenity"); + flags(flag::has_matedialog) = check_program("matedialog"); + flags(flag::has_qarma) = check_program("qarma"); + flags(flag::has_kdialog) = check_program("kdialog"); + + // If multiple helpers are available, try to default to the best one + if (flags(flag::has_zenity) && flags(flag::has_kdialog)) + { + auto desktop_name = internal::getenv("XDG_SESSION_DESKTOP"); + if (desktop_name == std::string("gnome")) + flags(flag::has_kdialog) = false; + else if (desktop_name == std::string("KDE")) + flags(flag::has_zenity) = false; + } + #endif + + flags(flag::is_scanned) = true; + } + + inline bool settings::available() + { + #if _WIN32 + return true; + #elif __APPLE__ + return true; + #elif __EMSCRIPTEN__ + // FIXME: Return true after implementation is complete. + return false; + #else + settings tmp; + return tmp.flags(flag::has_zenity) || tmp.flags(flag::has_matedialog) + || tmp.flags(flag::has_qarma) || tmp.flags(flag::has_kdialog); + #endif + } + + inline void settings::verbose(bool value) + { + settings().flags(flag::is_verbose) = value; + } + + inline void settings::rescan() + { + settings(/* resync = */ true); + } + + // Check whether a program is present using “which”. + inline bool settings::check_program(std::string const& program) + { + #if _WIN32 + (void)program; + return false; + #elif __EMSCRIPTEN__ + (void)program; + return false; + #else + int exit_code = -1; + internal::executor async; + async.start_process({"/bin/sh", "-c", "which " + program}); + async.result(&exit_code); + return exit_code == 0; + #endif + } + + inline bool settings::is_osascript() const + { + #ifdef __APPLE__ + return true; + #else + return false; + #endif + } + + inline bool settings::is_zenity() const + { + return flags(flag::has_zenity) || flags(flag::has_matedialog) || flags(flag::has_qarma); + } + + inline bool settings::is_kdialog() const + { + return flags(flag::has_kdialog); + } + + inline bool const& settings::flags(flag in_flag) const + { + static bool flags[size_t(flag::max_flag)]; + return flags[size_t(in_flag)]; + } + + inline bool& settings::flags(flag in_flag) + { + return const_cast(static_cast(this)->flags(in_flag)); + } + + // path implementation + inline std::string path::home() + { + #if _WIN32 + // First try the USERPROFILE environment variable + auto user_profile = internal::getenv("USERPROFILE"); + if (user_profile.size() > 0) + return user_profile; + // Otherwise, try GetUserProfileDirectory() + HANDLE token = nullptr; + DWORD len = MAX_PATH; + char buf[MAX_PATH] = {'\0'}; + if (OpenProcessToken(GetCurrentProcess(), TOKEN_QUERY, &token)) + { + dll userenv("userenv.dll"); + dll::proc get_user_profile_directory( + userenv, "GetUserProfileDirectoryA"); + get_user_profile_directory(token, buf, &len); + CloseHandle(token); + if (*buf) + return buf; + } + #elif __EMSCRIPTEN__ + return "/"; + #else + // First try the HOME environment variable + auto home = internal::getenv("HOME"); + if (home.size() > 0) + return home; + // Otherwise, try getpwuid_r() + size_t len = 4096; + #if defined(_SC_GETPW_R_SIZE_MAX) + auto size_max = sysconf(_SC_GETPW_R_SIZE_MAX); + if (size_max != -1) + len = size_t(size_max); + #endif + std::vector buf(len); + struct passwd pwd, *result; + if (getpwuid_r(getuid(), &pwd, buf.data(), buf.size(), &result) == 0) + return result->pw_dir; + #endif + return "/"; + } + + inline std::string path::separator() + { + #if _WIN32 + return "\\"; + #else + return "/"; + #endif + } + + // executor implementation + + inline std::string internal::executor::result(int* exit_code /* = nullptr */) + { + stop(); + if (exit_code) + *exit_code = m_exit_code; + return m_stdout; + } + + inline bool internal::executor::kill() + { + #if _WIN32 + if (m_future.valid()) + { + // Close all windows that weren’t open when we started the future + auto previous_windows = m_windows; + EnumWindows(&enum_windows_callback, (LPARAM)this); + for (auto hwnd : m_windows) + if (previous_windows.find(hwnd) == previous_windows.end()) + { + SendMessage(hwnd, WM_CLOSE, 0, 0); + // Also send IDNO in case of a Yes/No or Abort/Retry/Ignore messagebox + SendMessage(hwnd, WM_COMMAND, IDNO, 0); + } + } + #elif __EMSCRIPTEN__ || __NX__ + // FIXME: do something + return false; // cannot kill + #else + ::kill(m_pid, SIGKILL); + #endif + stop(); + return true; + } + + #if _WIN32 + inline BOOL CALLBACK internal::executor::enum_windows_callback(HWND hwnd, LPARAM lParam) + { + auto that = (executor*)lParam; + + DWORD pid; + auto tid = GetWindowThreadProcessId(hwnd, &pid); + if (tid == that->m_tid) + that->m_windows.insert(hwnd); + return TRUE; + } + #endif + + #if _WIN32 + inline void internal::executor::start_func(std::function const& fun) + { + stop(); + + auto trampoline = [fun, this]() { + // Save our thread id so that the caller can cancel us + m_tid = GetCurrentThreadId(); + EnumWindows(&enum_windows_callback, (LPARAM)this); + m_cond.notify_all(); + return fun(&m_exit_code); + }; + + std::unique_lock lock(m_mutex); + m_future = std::async(std::launch::async, trampoline); + m_cond.wait(lock); + m_running = true; + } + + #elif __EMSCRIPTEN__ + inline void internal::executor::start(int exit_code) + { + m_exit_code = exit_code; + } + + #else + inline void internal::executor::start_process(std::vector const& command) + { + stop(); + m_stdout.clear(); + m_exit_code = -1; + + int in[2], out[2]; + if (pipe(in) != 0 || pipe(out) != 0) + return; + + m_pid = fork(); + if (m_pid < 0) + return; + + close(in[m_pid ? 0 : 1]); + close(out[m_pid ? 1 : 0]); + + if (m_pid == 0) + { + dup2(in[0], STDIN_FILENO); + dup2(out[1], STDOUT_FILENO); + + // Ignore stderr so that it doesn’t pollute the console (e.g. GTK+ errors from zenity) + int fd = open("/dev/null", O_WRONLY); + dup2(fd, STDERR_FILENO); + close(fd); + + std::vector args; + std::transform(command.cbegin(), command.cend(), std::back_inserter(args), + [](std::string const& s) { + return const_cast(s.c_str()); + }); + args.push_back(nullptr); // null-terminate argv[] + + execvp(args[0], args.data()); + exit(1); + } + + close(in[1]); + m_fd = out[0]; + auto flags = fcntl(m_fd, F_GETFL); + fcntl(m_fd, F_SETFL, flags | O_NONBLOCK); + + m_running = true; + } + #endif + + inline internal::executor::~executor() + { + stop(); + } + + inline bool internal::executor::ready(int timeout /* = default_wait_timeout */) + { + if (!m_running) + return true; + + #if _WIN32 + if (m_future.valid()) + { + auto status = m_future.wait_for(std::chrono::milliseconds(timeout)); + if (status != std::future_status::ready) + { + // On Windows, we need to run the message pump. If the async + // thread uses a Windows API dialog, it may be attached to the + // main thread and waiting for messages that only we can dispatch. + MSG msg; + while (PeekMessage(&msg, nullptr, 0, 0, PM_REMOVE)) + { + TranslateMessage(&msg); + DispatchMessage(&msg); + } + return false; + } + + m_stdout = m_future.get(); + } + #elif __EMSCRIPTEN__ || __NX__ + // FIXME: do something + (void)timeout; + #else + char buf[BUFSIZ]; + ssize_t received = read(m_fd, buf, BUFSIZ); // Flawfinder: ignore + if (received > 0) + { + m_stdout += std::string(buf, received); + return false; + } + + // Reap child process if it is dead. It is possible that the system has already reaped it + // (this happens when the calling application handles or ignores SIG_CHLD) and results in + // waitpid() failing with ECHILD. Otherwise we assume the child is running and we sleep for + // a little while. + int status; + pid_t child = waitpid(m_pid, &status, WNOHANG); + if (child != m_pid && (child >= 0 || errno != ECHILD)) + { + // FIXME: this happens almost always at first iteration + std::this_thread::sleep_for(std::chrono::milliseconds(timeout)); + return false; + } + + close(m_fd); + m_exit_code = WEXITSTATUS(status); + #endif + + m_running = false; + return true; + } + + inline void internal::executor::stop() + { + // Loop until the user closes the dialog + while (!ready()) + ; + } + + // dll implementation + + #if _WIN32 + inline internal::platform::dll::dll(std::string const& name) + : handle(::LoadLibraryA(name.c_str())) + {} + + inline internal::platform::dll::~dll() + { + if (handle) + ::FreeLibrary(handle); + } + #endif // _WIN32 + + // ole32_dll implementation + + #if _WIN32 + inline internal::platform::ole32_dll::ole32_dll() : dll("ole32.dll") + { + // Use COINIT_MULTITHREADED because COINIT_APARTMENTTHREADED causes crashes. + // See https://github.com/samhocevar/portable-file-dialogs/issues/51 + auto coinit = proc(*this, "CoInitializeEx"); + m_state = coinit(nullptr, COINIT_MULTITHREADED); + } + + inline internal::platform::ole32_dll::~ole32_dll() + { + if (is_initialized()) + proc(*this, "CoUninitialize")(); + } + + inline bool internal::platform::ole32_dll::is_initialized() + { + return m_state == S_OK || m_state == S_FALSE; + } + #endif + + // new_style_context implementation + + #if _WIN32 + inline internal::platform::new_style_context::new_style_context() + { + // Only create one activation context for the whole app lifetime. + static HANDLE hctx = create(); + + if (hctx != INVALID_HANDLE_VALUE) + ActivateActCtx(hctx, &m_cookie); + } + + inline internal::platform::new_style_context::~new_style_context() + { + DeactivateActCtx(0, m_cookie); + } + + inline HANDLE internal::platform::new_style_context::create() + { + // This “hack” seems to be necessary for this code to work on windows XP. + // Without it, dialogs do not show and close immediately. GetError() + // returns 0 so I don’t know what causes this. I was not able to reproduce + // this behavior on Windows 7 and 10 but just in case, let it be here for + // those versions too. + // This hack is not required if other dialogs are used (they load comdlg32 + // automatically), only if message boxes are used. + dll comdlg32("comdlg32.dll"); + + // Using approach as shown here: https://stackoverflow.com/a/10444161 + UINT len = ::GetSystemDirectoryA(nullptr, 0); + std::string sys_dir(len, '\0'); + ::GetSystemDirectoryA(&sys_dir[0], len); + + ACTCTXA act_ctx = { + // Do not set flag ACTCTX_FLAG_SET_PROCESS_DEFAULT, since it causes a + // crash with error “default context is already set”. + sizeof(act_ctx), + ACTCTX_FLAG_RESOURCE_NAME_VALID | ACTCTX_FLAG_ASSEMBLY_DIRECTORY_VALID, + "shell32.dll", + 0, + 0, + sys_dir.c_str(), + (LPCSTR)124, + nullptr, + 0, + }; + + return ::CreateActCtxA(&act_ctx); + } + #endif // _WIN32 + + // dialog implementation + + inline bool internal::dialog::ready(int timeout /* = default_wait_timeout */) const + { + return m_async->ready(timeout); + } + + inline bool internal::dialog::kill() const + { + return m_async->kill(); + } + + inline internal::dialog::dialog() : m_async(std::make_shared()) {} + + inline std::vector internal::dialog::desktop_helper() const + { + #ifdef __APPLE__ + return {"osascript"}; + #else + return {flags(flag::has_zenity) ? "zenity" + : flags(flag::has_matedialog) ? "matedialog" + : flags(flag::has_qarma) ? "qarma" + : flags(flag::has_kdialog) ? "kdialog" + : "echo"}; + #endif + } + + inline std::string internal::dialog::buttons_to_name(choice _choice) + { + switch (_choice) + { + case choice::ok_cancel: return "okcancel"; + case choice::yes_no: return "yesno"; + case choice::yes_no_cancel: return "yesnocancel"; + case choice::retry_cancel: return "retrycancel"; + case choice::abort_retry_ignore: + return "abortretryignore"; + /* case choice::ok: */ default: + return "ok"; + } + } + + inline std::string internal::dialog::get_icon_name(icon _icon) + { + switch (_icon) + { + case icon::warning: return "warning"; + case icon::error: return "error"; + case icon::question: return "question"; + // Zenity wants "information" but WinForms wants "info" + /* case icon::info: */ default: + #if _WIN32 + return "info"; + #else + return "information"; + #endif + } + } + + // This is only used for debugging purposes + inline std::ostream& operator<<(std::ostream& s, std::vector const& v) + { + int not_first = 0; + for (auto& e : v) + s << (not_first++ ? " " : "") << e; + return s; + } + + // Properly quote a string for Powershell: replace ' or " with '' or "" + // FIXME: we should probably get rid of newlines! + // FIXME: the \" sequence seems unsafe, too! + // XXX: this is no longer used but I would like to keep it around just in case + inline std::string internal::dialog::powershell_quote(std::string const& str) const + { + return "'" + std::regex_replace(str, std::regex("['\"]"), "$&$&") + "'"; + } + + // Properly quote a string for osascript: replace \ or " with \\ or \" + // XXX: this also used to replace ' with \' when popen was used, but it would be + // smarter to do shell_quote(osascript_quote(...)) if this is needed again. + inline std::string internal::dialog::osascript_quote(std::string const& str) const + { + return "\"" + std::regex_replace(str, std::regex("[\\\\\"]"), "\\$&") + "\""; + } + + // Properly quote a string for the shell: just replace ' with '\'' + // XXX: this is no longer used but I would like to keep it around just in case + inline std::string internal::dialog::shell_quote(std::string const& str) const + { + return "'" + std::regex_replace(str, std::regex("'"), "'\\''") + "'"; + } + + // file_dialog implementation + + inline internal::file_dialog::file_dialog(type in_type, std::string const& title, + std::string const& default_path /* = "" */, + std::vector const& filters /* = {} */, opt options /* = opt::none */) + { + #if _WIN32 + std::string filter_list; + std::regex whitespace(" *"); + for (size_t i = 0; i + 1 < filters.size(); i += 2) + { + filter_list += filters[i] + '\0'; + filter_list += std::regex_replace(filters[i + 1], whitespace, ";") + '\0'; + } + filter_list += '\0'; + + m_async->start_func([this, in_type, title, default_path, filter_list, options]( + int* exit_code) -> std::string { + (void)exit_code; + m_wtitle = internal::str2wstr(title); + m_wdefault_path = internal::str2wstr(default_path); + auto wfilter_list = internal::str2wstr(filter_list); + + // Initialise COM. This is required for the new folder selection window, + // (see https://github.com/samhocevar/portable-file-dialogs/pull/21) + // and to avoid random crashes with GetOpenFileNameW() (see + // https://github.com/samhocevar/portable-file-dialogs/issues/51) + ole32_dll ole32; + + // Folder selection uses a different method + if (in_type == type::folder) + { + #if PFD_HAS_IFILEDIALOG + if (flags(flag::is_vista)) + { + // On Vista and higher we should be able to use IFileDialog for folder selection + IFileDialog* ifd; + HRESULT hr = + dll::proc( + ole32, "CoCreateInstance")(CLSID_FileOpenDialog, nullptr, + CLSCTX_INPROC_SERVER, IID_PPV_ARGS(&ifd)); + + // In case CoCreateInstance fails (which it should not), try legacy approach + if (SUCCEEDED(hr)) + return select_folder_vista(ifd, options & opt::force_path); + } + #endif + + BROWSEINFOW bi; + memset(&bi, 0, sizeof(bi)); + + bi.lpfn = &bffcallback; + bi.lParam = (LPARAM)this; + + if (flags(flag::is_vista)) + { + if (ole32.is_initialized()) + bi.ulFlags |= BIF_NEWDIALOGSTYLE; + bi.ulFlags |= BIF_EDITBOX; + bi.ulFlags |= BIF_STATUSTEXT; + } + + auto* list = SHBrowseForFolderW(&bi); + std::string ret; + if (list) + { + auto buffer = new wchar_t[MAX_PATH]; + SHGetPathFromIDListW(list, buffer); + dll::proc(ole32, "CoTaskMemFree")(list); + ret = internal::wstr2str(buffer); + delete[] buffer; + } + return ret; + } + + OPENFILENAMEW ofn; + memset(&ofn, 0, sizeof(ofn)); + ofn.lStructSize = sizeof(OPENFILENAMEW); + ofn.hwndOwner = GetActiveWindow(); + + ofn.lpstrFilter = wfilter_list.c_str(); + + auto woutput = std::wstring(MAX_PATH * 256, L'\0'); + ofn.lpstrFile = (LPWSTR)woutput.data(); + ofn.nMaxFile = (DWORD)woutput.size(); + if (!m_wdefault_path.empty()) + { + // If a directory was provided, use it as the initial directory. If + // a valid path was provided, use it as the initial file. Otherwise, + // let the Windows API decide. + auto path_attr = GetFileAttributesW(m_wdefault_path.c_str()); + if (path_attr != INVALID_FILE_ATTRIBUTES && (path_attr & FILE_ATTRIBUTE_DIRECTORY)) + ofn.lpstrInitialDir = m_wdefault_path.c_str(); + else if (m_wdefault_path.size() <= woutput.size()) + // second argument is size of buffer, not length of string + StringCchCopyW(ofn.lpstrFile, MAX_PATH * 256 + 1, m_wdefault_path.c_str()); + else + { + ofn.lpstrFileTitle = (LPWSTR)m_wdefault_path.data(); + ofn.nMaxFileTitle = (DWORD)m_wdefault_path.size(); + } + } + ofn.lpstrTitle = m_wtitle.c_str(); + ofn.Flags = OFN_NOCHANGEDIR | OFN_EXPLORER; + + dll comdlg32("comdlg32.dll"); + + // Apply new visual style (required for windows XP) + new_style_context ctx; + + if (in_type == type::save) + { + if (!(options & opt::force_overwrite)) + ofn.Flags |= OFN_OVERWRITEPROMPT; + + dll::proc get_save_file_name( + comdlg32, "GetSaveFileNameW"); + if (get_save_file_name(&ofn) == 0) + return ""; + return internal::wstr2str(woutput.c_str()); + } + else + { + if (options & opt::multiselect) + ofn.Flags |= OFN_ALLOWMULTISELECT; + ofn.Flags |= OFN_PATHMUSTEXIST; + + dll::proc get_open_file_name( + comdlg32, "GetOpenFileNameW"); + if (get_open_file_name(&ofn) == 0) + return ""; + } + + std::string prefix; + for (wchar_t const* p = woutput.c_str(); *p;) + { + auto filename = internal::wstr2str(p); + p += wcslen(p); + // In multiselect mode, we advance p one wchar further and + // check for another filename. If there is one and the + // prefix is empty, it means we just read the prefix. + if ((options & opt::multiselect) && *++p && prefix.empty()) + { + prefix = filename + "/"; + continue; + } + + m_vector_result.push_back(prefix + filename); + } + + return ""; + }); + #elif __EMSCRIPTEN__ + // FIXME: do something + (void)in_type; + (void)title; + (void)default_path; + (void)filters; + (void)options; + #else + auto command = desktop_helper(); + + if (is_osascript()) + { + std::string script = "set ret to choose"; + switch (in_type) + { + case type::save: script += " file name"; break; + case type::open: + default: + script += " file"; + if (options & opt::multiselect) + script += " with multiple selections allowed"; + break; + case type::folder: script += " folder"; break; + } + + if (default_path.size()) + { + if (in_type == type::folder || is_directory(default_path)) + script += " default location "; + else + script += " default name "; + script += osascript_quote(default_path); + } + + script += " with prompt " + osascript_quote(title); + + if (in_type == type::open) + { + // Concatenate all user-provided filter patterns + std::string patterns; + for (size_t i = 0; i < filters.size() / 2; ++i) + patterns += " " + filters[2 * i + 1]; + + // Split the pattern list to check whether "*" is in there; if it + // is, we have to disable filters because there is no mechanism in + // OS X for the user to override the filter. + std::regex sep("\\s+"); + std::string filter_list; + bool has_filter = true; + std::sregex_token_iterator iter(patterns.begin(), patterns.end(), sep, -1); + std::sregex_token_iterator end; + for (; iter != end; ++iter) + { + auto pat = iter->str(); + if (pat == "*" || pat == "*.*") + has_filter = false; + else if (internal::starts_with(pat, "*.")) + filter_list += "," + osascript_quote(pat.substr(2, pat.size() - 2)); + } + + if (has_filter && filter_list.size() > 0) + { + // There is a weird AppleScript bug where file extensions of length != 3 are + // ignored, e.g. type{"txt"} works, but type{"json"} does not. Fortunately if + // the whole list starts with a 3-character extension, everything works again. + // We use "///" for such an extension because we are sure it cannot appear in + // an actual filename. + script += " of type {\"///\"" + filter_list + "}"; + } + } + + if (in_type == type::open && (options & opt::multiselect)) + { + script += "\nset s to \"\""; + script += "\nrepeat with i in ret"; + script += "\n set s to s & (POSIX path of i) & \"\\n\""; + script += "\nend repeat"; + script += "\ncopy s to stdout"; + } + else + { + script += "\nPOSIX path of ret"; + } + + command.push_back("-e"); + command.push_back(script); + } + else if (is_zenity()) + { + command.push_back("--file-selection"); + + // If the default path is a directory, make sure it ends with "/" otherwise zenity will + // open the file dialog in the parent directory. + auto filename_arg = "--filename=" + default_path; + if (in_type != type::folder && !ends_with(default_path, "/") + && internal::is_directory(default_path)) + filename_arg += "/"; + command.push_back(filename_arg); + + command.push_back("--title"); + command.push_back(title); + command.push_back("--separator=\n"); + + for (size_t i = 0; i < filters.size() / 2; ++i) + { + command.push_back("--file-filter"); + command.push_back(filters[2 * i] + "|" + filters[2 * i + 1]); + } + + if (in_type == type::save) + command.push_back("--save"); + if (in_type == type::folder) + command.push_back("--directory"); + if (!(options & opt::force_overwrite)) + command.push_back("--confirm-overwrite"); + if (options & opt::multiselect) + command.push_back("--multiple"); + } + else if (is_kdialog()) + { + switch (in_type) + { + case type::save: command.push_back("--getsavefilename"); break; + case type::open: command.push_back("--getopenfilename"); break; + case type::folder: command.push_back("--getexistingdirectory"); break; + } + if (options & opt::multiselect) + { + command.push_back("--multiple"); + command.push_back("--separate-output"); + } + + command.push_back(default_path); + + std::string filter; + for (size_t i = 0; i < filters.size() / 2; ++i) + filter += (i == 0 ? "" : " | ") + filters[2 * i] + "(" + filters[2 * i + 1] + ")"; + command.push_back(filter); + + command.push_back("--title"); + command.push_back(title); + } + + if (flags(flag::is_verbose)) + std::cerr << "pfd: " << command << std::endl; + + m_async->start_process(command); + #endif + } + + inline std::string internal::file_dialog::string_result() + { + #if _WIN32 + return m_async->result(); + #else + auto ret = m_async->result(); + // Strip potential trailing newline (zenity). Also strip trailing slash + // added by osascript for consistency with other backends. + while (!ret.empty() && (ret.back() == '\n' || ret.back() == '/')) + ret.pop_back(); + return ret; + #endif + } + + inline std::vector internal::file_dialog::vector_result() + { + #if _WIN32 + m_async->result(); + return m_vector_result; + #else + std::vector ret; + auto result = m_async->result(); + for (;;) + { + // Split result along newline characters + auto i = result.find('\n'); + if (i == 0 || i == std::string::npos) + break; + ret.push_back(result.substr(0, i)); + result = result.substr(i + 1, result.size()); + } + return ret; + #endif + } + + #if _WIN32 + // Use a static function to pass as BFFCALLBACK for legacy folder select + inline int CALLBACK internal::file_dialog::bffcallback( + HWND hwnd, UINT uMsg, LPARAM, LPARAM pData) + { + auto inst = (file_dialog*)pData; + switch (uMsg) + { + case BFFM_INITIALIZED: + SendMessage(hwnd, BFFM_SETSELECTIONW, TRUE, (LPARAM)inst->m_wdefault_path.c_str()); + break; + } + return 0; + } + + #if PFD_HAS_IFILEDIALOG + inline std::string internal::file_dialog::select_folder_vista(IFileDialog* ifd, bool force_path) + { + std::string result; + + IShellItem* folder; + + // Load library at runtime so app doesn't link it at load time (which will fail on windows + // XP) + dll shell32("shell32.dll"); + dll::proc create_item( + shell32, "SHCreateItemFromParsingName"); + + if (!create_item) + return ""; + + auto hr = create_item(m_wdefault_path.c_str(), nullptr, IID_PPV_ARGS(&folder)); + + // Set default folder if found. This only sets the default folder. If + // Windows has any info about the most recently selected folder, it + // will display it instead. Generally, calling SetFolder() to set the + // current directory “is not a good or expected user experience and + // should therefore be avoided”: + // https://docs.microsoft.com/windows/win32/api/shobjidl_core/nf-shobjidl_core-ifiledialog-setfolder + if (SUCCEEDED(hr)) + { + if (force_path) + ifd->SetFolder(folder); + else + ifd->SetDefaultFolder(folder); + folder->Release(); + } + + // Set the dialog title and option to select folders + ifd->SetOptions(FOS_PICKFOLDERS | FOS_FORCEFILESYSTEM); + ifd->SetTitle(m_wtitle.c_str()); + + hr = ifd->Show(GetActiveWindow()); + if (SUCCEEDED(hr)) + { + IShellItem* item; + hr = ifd->GetResult(&item); + if (SUCCEEDED(hr)) + { + wchar_t* wname = nullptr; + // This is unlikely to fail because we use FOS_FORCEFILESYSTEM, but try + // to output a debug message just in case. + if (SUCCEEDED(item->GetDisplayName(SIGDN_FILESYSPATH, &wname))) + { + result = internal::wstr2str(std::wstring(wname)); + dll::proc(ole32_dll(), "CoTaskMemFree")(wname); + } + else + { + if (SUCCEEDED(item->GetDisplayName(SIGDN_NORMALDISPLAY, &wname))) + { + auto name = internal::wstr2str(std::wstring(wname)); + dll::proc(ole32_dll(), "CoTaskMemFree")(wname); + std::cerr << "pfd: failed to get path for " << name << std::endl; + } + else + std::cerr << "pfd: item of unknown type selected" << std::endl; + } + + item->Release(); + } + } + + ifd->Release(); + + return result; + } + #endif + #endif + + // notify implementation + + inline notify::notify( + std::string const& title, std::string const& message, icon _icon /* = icon::info */) + { + if (_icon == icon::question) // Not supported by notifications + _icon = icon::info; + + #if _WIN32 + // Use a static shared pointer for notify_icon so that we can delete + // it whenever we need to display a new one, and we can also wait + // until the program has finished running. + struct notify_icon_data : public NOTIFYICONDATAW + { + ~notify_icon_data() + { + Shell_NotifyIconW(NIM_DELETE, this); + } + }; + + static std::shared_ptr nid; + + // Release the previous notification icon, if any, and allocate a new + // one. Note that std::make_shared() does value initialization, so there + // is no need to memset the structure. + nid = nullptr; + nid = std::make_shared(); + + // For XP support + nid->cbSize = NOTIFYICONDATAW_V2_SIZE; + nid->hWnd = nullptr; + nid->uID = 0; + + // Flag Description: + // - NIF_ICON The hIcon member is valid. + // - NIF_MESSAGE The uCallbackMessage member is valid. + // - NIF_TIP The szTip member is valid. + // - NIF_STATE The dwState and dwStateMask members are valid. + // - NIF_INFO Use a balloon ToolTip instead of a standard ToolTip. The szInfo, uTimeout, + // szInfoTitle, and dwInfoFlags members are valid. + // - NIF_GUID Reserved. + nid->uFlags = NIF_MESSAGE | NIF_ICON | NIF_INFO; + + // Flag Description + // - NIIF_ERROR An error icon. + // - NIIF_INFO An information icon. + // - NIIF_NONE No icon. + // - NIIF_WARNING A warning icon. + // - NIIF_ICON_MASK Version 6.0. Reserved. + // - NIIF_NOSOUND Version 6.0. Do not play the associated sound. Applies only to balloon + // ToolTips + switch (_icon) + { + case icon::warning: nid->dwInfoFlags = NIIF_WARNING; break; + case icon::error: + nid->dwInfoFlags = NIIF_ERROR; + break; + /* case icon::info: */ default: + nid->dwInfoFlags = NIIF_INFO; + break; + } + + ENUMRESNAMEPROC icon_enum_callback = [](HMODULE, LPCTSTR, LPTSTR lpName, + LONG_PTR lParam) -> BOOL { + ((NOTIFYICONDATAW*)lParam)->hIcon = ::LoadIcon(GetModuleHandle(nullptr), lpName); + return false; + }; + + nid->hIcon = ::LoadIcon(nullptr, IDI_APPLICATION); + ::EnumResourceNames(nullptr, RT_GROUP_ICON, icon_enum_callback, (LONG_PTR)nid.get()); + + nid->uTimeout = 5000; + + StringCchCopyW( + nid->szInfoTitle, ARRAYSIZE(nid->szInfoTitle), internal::str2wstr(title).c_str()); + StringCchCopyW(nid->szInfo, ARRAYSIZE(nid->szInfo), internal::str2wstr(message).c_str()); + + // Display the new icon + Shell_NotifyIconW(NIM_ADD, nid.get()); + #elif __EMSCRIPTEN__ + // FIXME: do something + (void)title; + (void)message; + #else + auto command = desktop_helper(); + + if (is_osascript()) + { + command.push_back("-e"); + command.push_back("display notification " + osascript_quote(message) + " with title " + + osascript_quote(title)); + } + else if (is_zenity()) + { + command.push_back("--notification"); + command.push_back("--window-icon"); + command.push_back(get_icon_name(_icon)); + command.push_back("--text"); + command.push_back(title + "\n" + message); + } + else if (is_kdialog()) + { + command.push_back("--icon"); + command.push_back(get_icon_name(_icon)); + command.push_back("--title"); + command.push_back(title); + command.push_back("--passivepopup"); + command.push_back(message); + command.push_back("5"); + } + + if (flags(flag::is_verbose)) + std::cerr << "pfd: " << command << std::endl; + + m_async->start_process(command); + #endif + } + + // message implementation + + inline message::message(std::string const& title, std::string const& text, + choice _choice /* = choice::ok_cancel */, icon _icon /* = icon::info */) + { + #if _WIN32 + // Use MB_SYSTEMMODAL rather than MB_TOPMOST to ensure the message window is brought + // to front. See https://github.com/samhocevar/portable-file-dialogs/issues/52 + UINT style = MB_SYSTEMMODAL; + switch (_icon) + { + case icon::warning: style |= MB_ICONWARNING; break; + case icon::error: style |= MB_ICONERROR; break; + case icon::question: + style |= MB_ICONQUESTION; + break; + /* case icon::info: */ default: + style |= MB_ICONINFORMATION; + break; + } + + switch (_choice) + { + case choice::ok_cancel: style |= MB_OKCANCEL; break; + case choice::yes_no: style |= MB_YESNO; break; + case choice::yes_no_cancel: style |= MB_YESNOCANCEL; break; + case choice::retry_cancel: style |= MB_RETRYCANCEL; break; + case choice::abort_retry_ignore: + style |= MB_ABORTRETRYIGNORE; + break; + /* case choice::ok: */ default: + style |= MB_OK; + break; + } + + m_mappings[IDCANCEL] = button::cancel; + m_mappings[IDOK] = button::ok; + m_mappings[IDYES] = button::yes; + m_mappings[IDNO] = button::no; + m_mappings[IDABORT] = button::abort; + m_mappings[IDRETRY] = button::retry; + m_mappings[IDIGNORE] = button::ignore; + + m_async->start_func([text, title, style](int* exit_code) -> std::string { + auto wtext = internal::str2wstr(text); + auto wtitle = internal::str2wstr(title); + // Apply new visual style (required for all Windows versions) + new_style_context ctx; + *exit_code = MessageBoxW(GetActiveWindow(), wtext.c_str(), wtitle.c_str(), style); + return ""; + }); + + #elif __EMSCRIPTEN__ + std::string full_message; + switch (_icon) + { + case icon::warning: full_message = "⚠️"; break; + case icon::error: full_message = "⛔"; break; + case icon::question: + full_message = "❓"; + break; + /* case icon::info: */ default: + full_message = "ℹ"; + break; + } + + full_message += ' ' + title + "\n\n" + text; + + // This does not really start an async task; it just passes the + // EM_ASM_INT return value to a fake start() function. + m_async->start(EM_ASM_INT( + { + if ($1) + return window.confirm(UTF8ToString($0)) ? 0 : -1; + alert(UTF8ToString($0)); + return 0; + }, + full_message.c_str(), _choice == choice::ok_cancel)); + #else + auto command = desktop_helper(); + + if (is_osascript()) + { + std::string script = + "display dialog " + osascript_quote(text) + " with title " + osascript_quote(title); + auto if_cancel = button::cancel; + switch (_choice) + { + case choice::ok_cancel: + script += + "buttons {\"OK\", \"Cancel\"}" + " default button \"OK\"" + " cancel button \"Cancel\""; + break; + case choice::yes_no: + script += + "buttons {\"Yes\", \"No\"}" + " default button \"Yes\"" + " cancel button \"No\""; + if_cancel = button::no; + break; + case choice::yes_no_cancel: + script += + "buttons {\"Yes\", \"No\", \"Cancel\"}" + " default button \"Yes\"" + " cancel button \"Cancel\""; + break; + case choice::retry_cancel: + script += + "buttons {\"Retry\", \"Cancel\"}" + " default button \"Retry\"" + " cancel button \"Cancel\""; + break; + case choice::abort_retry_ignore: + script += + "buttons {\"Abort\", \"Retry\", \"Ignore\"}" + " default button \"Abort\"" + " cancel button \"Retry\""; + if_cancel = button::retry; + break; + case choice::ok: + default: + script += + "buttons {\"OK\"}" + " default button \"OK\"" + " cancel button \"OK\""; + if_cancel = button::ok; + break; + } + m_mappings[1] = if_cancel; + m_mappings[256] = if_cancel; // XXX: I think this was never correct + script += " with icon "; + switch (_icon) + { + #define PFD_OSX_ICON(n) \ + "alias ((path to library folder from system domain) as text " \ + "& \"CoreServices:CoreTypes.bundle:Contents:Resources:" n ".icns\")" + case icon::info: + default: script += PFD_OSX_ICON("ToolBarInfo"); break; + case icon::warning: script += "caution"; break; + case icon::error: script += "stop"; break; + case icon::question: script += PFD_OSX_ICON("GenericQuestionMarkIcon"); break; + #undef PFD_OSX_ICON + } + + command.push_back("-e"); + command.push_back(script); + } + else if (is_zenity()) + { + switch (_choice) + { + case choice::ok_cancel: + command.insert( + command.end(), {"--question", "--cancel-label=Cancel", "--ok-label=OK"}); + break; + case choice::yes_no: + // Do not use standard --question because it causes “No” to return -1, + // which is inconsistent with the “Yes/No/Cancel” mode below. + command.insert(command.end(), + {"--question", "--switch", "--extra-button=No", "--extra-button=Yes"}); + break; + case choice::yes_no_cancel: + command.insert( + command.end(), {"--question", "--switch", "--extra-button=Cancel", + "--extra-button=No", "--extra-button=Yes"}); + break; + case choice::retry_cancel: + command.insert( + command.end(), {"--question", "--switch", "--extra-button=Cancel", + "--extra-button=Retry"}); + break; + case choice::abort_retry_ignore: + command.insert( + command.end(), {"--question", "--switch", "--extra-button=Ignore", + "--extra-button=Abort", "--extra-button=Retry"}); + break; + case choice::ok: + default: + switch (_icon) + { + case icon::error: command.push_back("--error"); break; + case icon::warning: command.push_back("--warning"); break; + default: command.push_back("--info"); break; + } + } + + command.insert(command.end(), + {"--title", title, "--width=300", "--height=0", // sensible defaults + "--no-markup", // do not interpret text as Pango markup + "--text", text, "--icon-name=dialog-" + get_icon_name(_icon)}); + } + else if (is_kdialog()) + { + if (_choice == choice::ok) + { + switch (_icon) + { + case icon::error: command.push_back("--error"); break; + case icon::warning: command.push_back("--sorry"); break; + default: command.push_back("--msgbox"); break; + } + } + else + { + std::string flag = "--"; + if (_icon == icon::warning || _icon == icon::error) + flag += "warning"; + flag += "yesno"; + if (_choice == choice::yes_no_cancel) + flag += "cancel"; + command.push_back(flag); + if (_choice == choice::yes_no || _choice == choice::yes_no_cancel) + { + m_mappings[0] = button::yes; + m_mappings[256] = button::no; + } + } + + command.push_back(text); + command.push_back("--title"); + command.push_back(title); + + // Must be after the above part + if (_choice == choice::ok_cancel) + command.insert(command.end(), {"--yes-label", "OK", "--no-label", "Cancel"}); + } + + if (flags(flag::is_verbose)) + std::cerr << "pfd: " << command << std::endl; + + m_async->start_process(command); + #endif + } + + inline button message::result() + { + int exit_code; + auto ret = m_async->result(&exit_code); + // osascript will say "button returned:Cancel\n" + // and others will just say "Cancel\n" + if (internal::ends_with(ret, "Cancel\n")) + return button::cancel; + if (internal::ends_with(ret, "OK\n")) + return button::ok; + if (internal::ends_with(ret, "Yes\n")) + return button::yes; + if (internal::ends_with(ret, "No\n")) + return button::no; + if (internal::ends_with(ret, "Abort\n")) + return button::abort; + if (internal::ends_with(ret, "Retry\n")) + return button::retry; + if (internal::ends_with(ret, "Ignore\n")) + return button::ignore; + if (m_mappings.count(exit_code) != 0) + return m_mappings[exit_code]; + return exit_code == 0 ? button::ok : button::cancel; + } + + // open_file implementation + + inline open_file::open_file(std::string const& title, + std::string const& default_path /* = "" */, + std::vector const& filters /* = { "All Files", "*" } */, + opt options /* = opt::none */) + : file_dialog(type::open, title, default_path, filters, options) + {} + + inline open_file::open_file(std::string const& title, std::string const& default_path, + std::vector const& filters, bool allow_multiselect) + : open_file( + title, default_path, filters, (allow_multiselect ? opt::multiselect : opt::none)) + {} + + inline std::vector open_file::result() + { + return vector_result(); + } + + // save_file implementation + + inline save_file::save_file(std::string const& title, + std::string const& default_path /* = "" */, + std::vector const& filters /* = { "All Files", "*" } */, + opt options /* = opt::none */) + : file_dialog(type::save, title, default_path, filters, options) + {} + + inline save_file::save_file(std::string const& title, std::string const& default_path, + std::vector const& filters, bool confirm_overwrite) + : save_file( + title, default_path, filters, (confirm_overwrite ? opt::none : opt::force_overwrite)) + {} + + inline std::string save_file::result() + { + return string_result(); + } + + // select_folder implementation + + inline select_folder::select_folder(std::string const& title, + std::string const& default_path /* = "" */, opt options /* = opt::none */) + : file_dialog(type::folder, title, default_path, {}, options) + {} + + inline std::string select_folder::result() + { + return string_result(); + } + +#endif // PFD_SKIP_IMPLEMENTATION + +} // namespace pfd diff --git a/Include/Pipe/Files/Paths.h b/Include/Pipe/Files/Paths.h index 76c48429..de3ebb72 100644 --- a/Include/Pipe/Files/Paths.h +++ b/Include/Pipe/Files/Paths.h @@ -12,21 +12,23 @@ namespace p { - constexpr TChar separator{'/'}; + namespace details + { + constexpr char separator{'/'}; #if P_PLATFORM_WINDOWS - constexpr TChar preferredSeparator{'\\'}; + constexpr char preferredSeparator{'\\'}; #else - constexpr TChar preferredSeparator{'/'}; + constexpr char preferredSeparator{'/'}; #endif - constexpr TChar dot{'.'}; - constexpr TChar colon{':'}; - + constexpr char dot{'.'}; + constexpr char colon{':'}; + } // namespace details - PIPE_API const TChar* FindRelativeChar(const TChar* const first, const TChar* const last); - PIPE_API const TChar* FindRelativeChar( - const TChar* const first, const TChar* const last, const TChar*& outNameEnd); - PIPE_API const TChar* FindFilename(const TChar* const first, const TChar* last); - PIPE_API const TChar* FindExtension(const TChar* const first, const TChar* last); + PIPE_API const char* FindRelativeChar(const char* const first, const char* const last); + PIPE_API const char* FindRelativeChar( + const char* const first, const char* const last, const char*& outNameEnd); + PIPE_API const char* FindFilename(const char* const first, const char* last); + PIPE_API const char* FindExtension(const char* const first, const char* last); // @return root name of a path, or an empty view if missing // E.g: "C:\Folder" -> "C:" @@ -85,11 +87,11 @@ namespace p PIPE_API void SetCanonical(String& path); PIPE_API void SetWeaklyCanonical(String& path); - inline PIPE_API constexpr bool IsSeparator(TChar c) + inline PIPE_API constexpr bool IsSeparator(char c) { - return c == separator + return c == details::separator #if P_PLATFORM_WINDOWS - || c == preferredSeparator + || c == details::preferredSeparator #endif ; } @@ -98,11 +100,11 @@ namespace p // a forward slash is the only valid directory separator and also the only valid // element separator. For Windows, forward slash and back slash are the possible // directory separators, but colon (example: "c:foo") is also an element separator. - inline PIPE_API constexpr bool IsElementSeparator(TChar c) + inline PIPE_API constexpr bool IsElementSeparator(char c) { - return c == separator + return c == details::separator #if P_PLATFORM_WINDOWS - || c == preferredSeparator || c == colon + || c == details::preferredSeparator || c == details::colon #endif ; } @@ -142,7 +144,7 @@ namespace p static PathIterator CreateBegin(StringView p) noexcept; static PathIterator CreateEnd(StringView p) noexcept; - const TChar* Peek() const noexcept; + const char* Peek() const noexcept; void Increment() noexcept; void Decrement() noexcept; @@ -162,22 +164,22 @@ namespace p bool InRootPath() const noexcept; private: - void MakeState(State newState, const TChar* start, const TChar* end) noexcept; + void MakeState(State newState, const char* start, const char* end) noexcept; void MakeState(State newState) noexcept; - const TChar* GetAfterBack() const noexcept; - const TChar* GetBeforeFront() const noexcept; + const char* GetAfterBack() const noexcept; + const char* GetBeforeFront() const noexcept; /// @return a pointer to the first character after the currently lexed element. - const TChar* GetNextTokenStartPos() const noexcept; + const char* GetNextTokenStartPos() const noexcept; /// @return a pointer to the first character in the currently lexed element. - const TChar* GetCurrentTokenStartPos() const noexcept; + const char* GetCurrentTokenStartPos() const noexcept; // Consume all consecutive separators - const TChar* ConsumeAllSeparators(const TChar* p, const TChar* end) const noexcept; + const char* ConsumeAllSeparators(const char* p, const char* end) const noexcept; // Consume exactly N separators, or return nullptr. - const TChar* ConsumeNSeparators(const TChar* p, const TChar* end, int N) const noexcept; - const TChar* ConsumeName(const TChar* p, const TChar* end) const noexcept; - const TChar* ConsumeDriveLetter(const TChar* p, const TChar* end) const noexcept; - const TChar* ConsumeNetworkRoot(const TChar* p, const TChar* end) const noexcept; - const TChar* ConsumeRootName(const TChar* p, const TChar* end) const noexcept; + const char* ConsumeNSeparators(const char* p, const char* end, int N) const noexcept; + const char* ConsumeName(const char* p, const char* end) const noexcept; + const char* ConsumeDriveLetter(const char* p, const char* end) const noexcept; + const char* ConsumeNetworkRoot(const char* p, const char* end) const noexcept; + const char* ConsumeRootName(const char* p, const char* end) const noexcept; }; #pragma endregion PathIterator } // namespace p diff --git a/Include/Pipe/Memory/BigBestFitArena.h b/Include/Pipe/Memory/BigBestFitArena.h index b9bc72f1..c1cb1901 100644 --- a/Include/Pipe/Memory/BigBestFitArena.h +++ b/Include/Pipe/Memory/BigBestFitArena.h @@ -98,7 +98,7 @@ namespace p void ReduceSlot(i32 slotIndex, Slot& slot, u32 allocationStart, u32 allocationEnd); void AbsorbFreeSpace(u32 allocationStart, u32 allocationEnd); - u32 ToOffset(void* data, void* block); + static u32 ToOffset(void* data, void* block); }; diff --git a/Include/Pipe/Memory/MemoryStats.h b/Include/Pipe/Memory/MemoryStats.h index 594d654b..c74413c7 100644 --- a/Include/Pipe/Memory/MemoryStats.h +++ b/Include/Pipe/Memory/MemoryStats.h @@ -44,11 +44,11 @@ namespace p { const char* name = "Arena"; - sizet used = 0; + sizet used = 0; sizet available = 0; mutable std::shared_mutex mutex; TArray allocations; -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS TArray stacks; #endif TArray freedAllocations; diff --git a/Include/Pipe/Memory/MultiLinearArena.h b/Include/Pipe/Memory/MultiLinearArena.h index 5612ff49..4cdf1109 100644 --- a/Include/Pipe/Memory/MultiLinearArena.h +++ b/Include/Pipe/Memory/MultiLinearArena.h @@ -81,7 +81,7 @@ namespace p * Individual allocations can't be freed. It can * be resized, but never smaller than its used size. */ - class PIPE_API MultiLinearArena : public ChildArena + struct PIPE_API MultiLinearArena : public ChildArena { protected: LinearSmallPool smallPool; diff --git a/Include/Pipe/Memory/OwnPtr.h b/Include/Pipe/Memory/OwnPtr.h index 28904d73..3eaa07e3 100644 --- a/Include/Pipe/Memory/OwnPtr.h +++ b/Include/Pipe/Memory/OwnPtr.h @@ -54,12 +54,12 @@ namespace p public: BaseOwnPtr(BaseOwnPtr&& other) noexcept { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); } BaseOwnPtr& operator=(BaseOwnPtr&& other) noexcept { Delete(); - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); return *this; } ~BaseOwnPtr() @@ -93,6 +93,14 @@ namespace p return value; } + void MoveFromUnsafe(BaseOwnPtr&& other) + { + value = other.value; + counter = other.counter; + other.value = nullptr; + other.counter = nullptr; + } + protected: BaseOwnPtr() = default; // Initialization from parent @@ -104,15 +112,6 @@ namespace p Internal::PtrWeakCounter(arena, deleter); } } - - - void MoveFrom(BaseOwnPtr&& other) - { - value = other.value; - counter = other.counter; - other.value = nullptr; - other.counter = nullptr; - } }; @@ -165,9 +164,8 @@ namespace p return value; } - protected: - void MoveFrom(Ptr&& other); - void CopyFrom(const Ptr& other); + void MoveFromUnsafe(Ptr&& other); + void CopyFromUnsafe(const Ptr& other); private: void ResetNoCheck(const bool bIsSet); @@ -211,14 +209,14 @@ namespace p TOwnPtr(TOwnPtr&& other) noexcept { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); } TOwnPtr(OwnPtr&& other) noexcept; TOwnPtr& operator=(TOwnPtr&& other) noexcept { Delete(); - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); return *this; } @@ -228,13 +226,13 @@ namespace p template TOwnPtr(TOwnPtr&& other) noexcept requires Derived { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); } template TOwnPtr& operator=(TOwnPtr&& other) noexcept requires Derived { Delete(); - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); return *this; } @@ -258,24 +256,12 @@ namespace p if (IsValid() && (Convertible || dynamic_cast(GetUnsafe()) != nullptr)) { TOwnPtr newPtr{}; - newPtr.MoveFrom(Move(*this)); + newPtr.MoveFromUnsafe(Move(*this)); return newPtr; } return {}; } - template - TPtr Cast() const - { - if constexpr (Derived) // Is T2 is T or its base - { - return TPtr{*this}; - } - - TPtr ptr{*this}; - return ptr.template Cast(); - } - TPtr AsPtr() const { return TPtr{*this}; @@ -341,12 +327,10 @@ namespace p return Move(ptr); } - private: - template - void MoveFrom(TOwnPtr&& other) + void MoveFromUnsafe(TOwnPtr&& other) { - Super::MoveFrom(Move(other)); + Super::MoveFromUnsafe(Move(other)); #if P_DEBUG instance = static_cast(value); other.instance = nullptr; @@ -374,13 +358,13 @@ namespace p TPtr& operator=(const TPtr& other) { - CopyFrom(other); + CopyFromUnsafe(other); return *this; } TPtr& operator=(TPtr&& other) noexcept { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); return *this; } @@ -405,14 +389,14 @@ namespace p template TPtr& operator=(const TPtr& other) requires Derived { - CopyFrom(other); + CopyFromUnsafe(other); return *this; } template TPtr& operator=(TPtr&& other) noexcept requires Derived { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); return *this; } @@ -426,19 +410,6 @@ namespace p return static_cast(value); } - template - TPtr Cast() const - { - if (IsValid() && (Convertible || dynamic_cast(GetUnsafe()) != nullptr)) - { - TPtr ptr{}; - ptr.CopyFrom(*this); - return ptr; - } - return {}; - } - - T& operator*() const { return *GetUnsafe(); @@ -497,12 +468,12 @@ namespace p template OwnPtr(TOwnPtr&& other) noexcept { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); typeId = GetTypeId(); } OwnPtr(OwnPtr&& other) noexcept { - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); typeId = Move(other.typeId); other.typeId = TypeId::None(); } @@ -511,7 +482,7 @@ namespace p OwnPtr& operator=(TOwnPtr&& other) noexcept { Delete(); - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); typeId = GetTypeId(); return *this; } @@ -519,7 +490,7 @@ namespace p OwnPtr& operator=(OwnPtr&& other) noexcept { Delete(); - MoveFrom(Move(other)); + MoveFromUnsafe(Move(other)); typeId = Move(other.typeId); other.typeId = TypeId::None(); return *this; @@ -578,7 +549,7 @@ namespace p inline TOwnPtr::TOwnPtr(OwnPtr&& other) noexcept { P_CheckMsg(other.IsType(), "Type doesn't match!"); - Super::MoveFrom(Move(other)); + Super::MoveFromUnsafe(Move(other)); #if P_DEBUG instance = static_cast(value); #endif @@ -589,7 +560,7 @@ namespace p { P_CheckMsg(other.IsType(), "Type doesn't match!"); Delete(); - Super::MoveFrom(Move(other)); + Super::MoveFromUnsafe(Move(other)); #if P_DEBUG instance = static_cast(value); #endif diff --git a/Include/PipeECS.h b/Include/PipeECS.h index cf51fbfb..7cd52822 100644 --- a/Include/PipeECS.h +++ b/Include/PipeECS.h @@ -1220,7 +1220,7 @@ namespace p void CopyFrom(const EntityContext& other); void MoveFrom(EntityContext&& other); - OwnPtr& FindOrAddStaticPtr( + static OwnPtr& FindOrAddStaticPtr( TArray& statics, const TypeId typeId, bool* bAdded = nullptr); template diff --git a/Include/PipeReflect.h b/Include/PipeReflect.h index 0ae5b46f..20095fd2 100644 --- a/Include/PipeReflect.h +++ b/Include/PipeReflect.h @@ -739,8 +739,8 @@ P_NATIVE_NAMED(p::u64, "u64") P_NATIVE_NAMED(p::i64, "i64") P_NATIVE(float) P_NATIVE(double) -P_NATIVE_NAMED(p::TChar, "TChar") -P_NATIVE_NAMED(p::TChar*, "StringLiteral") +P_NATIVE(char) +P_NATIVE_NAMED(char*, "StringLiteral") P_NATIVE_NAMED(p::StringView, "StringView") P_NATIVE_NAMED(p::String, "String") P_NATIVE_NAMED(p::Path, "Path"); @@ -906,13 +906,61 @@ namespace p template TPtr AsPtr() const { - return ownership.AsPtr().Cast(); + return Cast(ownership.AsPtr()); } template TPtr GetOwner() const { - return ownership.GetOwner().Cast(); + return Cast(ownership.GetOwner()); } }; #pragma endregion Objects + + +#pragma region Casts + + // Equal and Down-casting + template> + ToValue* Cast(From* value) requires(Derived) + { + return value; + } + + // Up-casting + template> + ToValue* Cast(From* value) requires(Derived) + { + if constexpr (Derived) + { + const TypeId toId = GetTypeId(); + const TypeId fromId = value->GetTypeId(); + return IsTypeParentOf(toId, fromId) ? static_cast(value) : nullptr; + } + return nullptr; // TODO: Implement non-object up casting + } + + template + TPtr Cast(const TPtr& value) + { + if (value.IsValid() && (Convertible || Cast(value.GetUnsafe()) != nullptr)) + { + TPtr ptr{}; + ptr.CopyFromUnsafe(value); + return ptr; + } + return {}; + } + + template + TPtr Cast(const TOwnPtr& value) + { + if constexpr (Derived) // Is T2 is T or its base + { + return TPtr{*this}; + } + + TPtr ptr{*this}; + return Cast(ptr); + } +#pragma endregion Casts }; // namespace p diff --git a/Include/PipeSerialize.h b/Include/PipeSerialize.h index 4fd414c7..1cbd4a05 100644 --- a/Include/PipeSerialize.h +++ b/Include/PipeSerialize.h @@ -814,8 +814,8 @@ namespace p private: Arena& arena; u8* data = nullptr; - i32 size = 0; - i32 capacity = 0; + u32 size = 0; + u32 capacity = 0; public: diff --git a/Include/PipeTime.h b/Include/PipeTime.h index 788c86dc..07839bd7 100644 --- a/Include/PipeTime.h +++ b/Include/PipeTime.h @@ -621,8 +621,8 @@ namespace p * @return String representation. * @see Parse */ - String ToString(const TChar* Format) const; - void ToString(const TChar* format, String& result) const; + String ToString(const char* Format) const; + void ToString(const char* format, String& result) const; public: /** @@ -1138,8 +1138,8 @@ namespace p * @return String representation. * @see Parse, ToIso8601 */ - String ToString(const TChar* Format) const; - void ToString(const TChar* format, String& result) const; + String ToString(const char* Format) const; + void ToString(const char* format, String& result) const; /** * Returns this date as the number of seconds since the Unix Epoch (January @@ -1296,7 +1296,7 @@ namespace p * @return true if the string was converted successfully, false otherwise. * @see Parse, ParseHttpDate, ToIso8601 */ - static bool ParseIso8601(const TChar* DateTimeString, DateTime& OutDateTime); + static bool ParseIso8601(const char* DateTimeString, DateTime& OutDateTime); /** * Gets the local date on this computer. diff --git a/Src/Core/Hash.cpp b/Src/Core/Hash.cpp index e02a7a6b..4d42179e 100644 --- a/Src/Core/Hash.cpp +++ b/Src/Core/Hash.cpp @@ -8,12 +8,14 @@ namespace p { -#if __has_cpp_attribute(clang::fallthrough) - #define P_FALLTHROUGH() [[clang::fallthrough]] -#elif __has_cpp_attribute(gnu::fallthrough) - #define P_FALLTHROUGH() [[gnu::fallthrough]] -#else - #define P_FALLTHROUGH() +#ifndef P_FALLTHROUGH + #if __has_cpp_attribute(clang::fallthrough) + #define P_FALLTHROUGH [[clang::fallthrough]] + #elif __has_cpp_attribute(gnu::fallthrough) + #define P_FALLTHROUGH [[gnu::fallthrough]] + #else + #define P_FALLTHROUGH + #endif #endif @@ -52,16 +54,16 @@ namespace p const auto* const data8 = reinterpret_cast(data64 + n_blocks); switch (len & 7U) { - case 7: h ^= static_cast(data8[6]) << 48U; P_FALLTHROUGH(); - case 6: h ^= static_cast(data8[5]) << 40U; P_FALLTHROUGH(); - case 5: h ^= static_cast(data8[4]) << 32U; P_FALLTHROUGH(); - case 4: h ^= static_cast(data8[3]) << 24U; P_FALLTHROUGH(); - case 3: h ^= static_cast(data8[2]) << 16U; P_FALLTHROUGH(); - case 2: h ^= static_cast(data8[1]) << 8U; P_FALLTHROUGH(); + case 7: h ^= static_cast(data8[6]) << 48U; P_FALLTHROUGH; + case 6: h ^= static_cast(data8[5]) << 40U; P_FALLTHROUGH; + case 5: h ^= static_cast(data8[4]) << 32U; P_FALLTHROUGH; + case 4: h ^= static_cast(data8[3]) << 24U; P_FALLTHROUGH; + case 3: h ^= static_cast(data8[2]) << 16U; P_FALLTHROUGH; + case 2: h ^= static_cast(data8[1]) << 8U; P_FALLTHROUGH; case 1: h ^= static_cast(data8[0]); h *= m; - P_FALLTHROUGH(); + P_FALLTHROUGH; default: break; } diff --git a/Src/Core/String.cpp b/Src/Core/String.cpp index 90e9f1c6..b7f2f5fa 100644 --- a/Src/Core/String.cpp +++ b/Src/Core/String.cpp @@ -19,12 +19,12 @@ namespace p::Strings String result; result.reserve(value.size()); - const TChar* p = value.data(); - const TChar* end = value.data() + value.size(); - const TChar* last = end - 1; + const char* p = value.data(); + const char* end = value.data() + value.size(); + const char* last = end - 1; for (; p < last; ++p) { - const TChar* next = p + 1; + const char* next = p + 1; if (FChar::IsAlpha(*p) && (FChar::IsUpper(*next) || FChar::IsDigit(*next))) { result.push_back(*p); @@ -57,7 +57,7 @@ namespace p::Strings } } - bool RemoveCharFromEnd(String& str, TChar c) + bool RemoveCharFromEnd(String& str, char c) { if (EndsWith(str, c)) { @@ -67,7 +67,7 @@ namespace p::Strings return false; } - i32 Split(const String& str, TArray& tokens, const TChar delim) + i32 Split(const String& str, TArray& tokens, const char delim) { sizet current, previous = 0; current = str.find(delim); @@ -81,7 +81,7 @@ namespace p::Strings return tokens.Size(); } - bool Split(const String& str, String& a, String& b, const TChar* delim) + bool Split(const String& str, String& a, String& b, const char* delim) { const sizet pos = str.find(delim); if (pos != String::npos) @@ -98,7 +98,7 @@ namespace p::Strings return IsNumeric(str.data()); } - bool IsNumeric(const TChar* Str) + bool IsNumeric(const char* Str) { if (*Str == TX('-') || *Str == TX('+')) { diff --git a/Src/Core/Subprocess.cpp b/Src/Core/Subprocess.cpp index ecb37827..5587af51 100644 --- a/Src/Core/Subprocess.cpp +++ b/Src/Core/Subprocess.cpp @@ -81,20 +81,20 @@ namespace p Subprocess::Subprocess(Subprocess&& other) noexcept { - Swap(cinFile, other.cinFile); - Swap(coutFile, other.coutFile); - Swap(cerrFile, other.cerrFile); + p::Swap(cinFile, other.cinFile); + p::Swap(coutFile, other.coutFile); + p::Swap(cerrFile, other.cerrFile); #if defined(_MSC_VER) - Swap(hProcess, other.hProcess); - Swap(hStdInput, other.hStdInput); - Swap(hEventOutput, other.hEventOutput); - Swap(hEventError, other.hEventError); + p::Swap(hProcess, other.hProcess); + p::Swap(hStdInput, other.hStdInput); + p::Swap(hEventOutput, other.hEventOutput); + p::Swap(hEventError, other.hEventError); #else - Swap(child, other.child); - Swap(returnStatus, other.returnStatus); + p::Swap(child, other.child); + p::Swap(returnStatus, other.returnStatus); #endif - Swap(options, other.options); - Swap(alive, other.alive); + p::Swap(options, other.options); + p::Swap(alive, other.alive); } Subprocess::~Subprocess() @@ -164,7 +164,6 @@ namespace p instance.options = options; #if defined(_MSC_VER) - sizet len; i32 i, j; u64 flags = 0; static constexpr u64 startFUseStdHandles = 0x00000100; @@ -360,7 +359,7 @@ namespace p reinterpret_cast<_PROCESS_INFORMATION*>(&processInfo))) { DWORD errorCode = GetLastError(); - TChar errorMessage[512]; + char errorMessage[512]; PlatformMisc::GetSystemErrorMessage(errorMessage, 512, errorCode); Error("RunProcess failed: {} (0x{:08x})", errorMessage, errorCode); return {}; diff --git a/Src/Core/Tag.cpp b/Src/Core/Tag.cpp index a55d93e9..4e1bba87 100644 --- a/Src/Core/Tag.cpp +++ b/Src/Core/Tag.cpp @@ -17,15 +17,15 @@ namespace p u32 size; TagHeader(const TagHeader&) = delete; - const TChar* Data() const + const char* Data() const { - return reinterpret_cast(this + 1); + return reinterpret_cast(this + 1); }; }; - TagHeader* GetTagHeader(const TChar* data) + TagHeader* GetTagHeader(const char* data) { - return reinterpret_cast(const_cast(data)) - 1; + return reinterpret_cast(const_cast(data)) - 1; } struct TagHeaderRef @@ -113,7 +113,7 @@ namespace p InternalReset(); } - const TChar* Tag::Data() const + const char* Tag::Data() const { return str; } @@ -133,7 +133,7 @@ namespace p constexpr sizet GetAllocSize(sizet dataSize) { // +1 for the end character of the string - return sizeof(TagHeader) + sizeof(TChar) * (dataSize + 1); + return sizeof(TagHeader) + sizeof(char) * (dataSize + 1); } i32 Tag::FlushInactiveTags() @@ -213,8 +213,8 @@ namespace p header->activeTags = 0; header->size = size; // Copy string data - auto* const data = const_cast(header->Data()); - p::CopyMem(data, (void*)value.data(), sizeof(TChar) * size); + auto* const data = const_cast(header->Data()); + p::CopyMem(data, (void*)value.data(), sizeof(char) * size); data[header->size] = '\0'; std::unique_lock lock{stringsListMutex}; diff --git a/Src/Core/WindowsPlatformMisc.cpp b/Src/Core/WindowsPlatformMisc.cpp index 5fe2b175..361a3522 100644 --- a/Src/Core/WindowsPlatformMisc.cpp +++ b/Src/Core/WindowsPlatformMisc.cpp @@ -11,7 +11,7 @@ namespace p { - const TChar* WindowsPlatformMisc::GetSystemErrorMessage(TChar* buffer, i32 size, i32 error) + const char* WindowsPlatformMisc::GetSystemErrorMessage(char* buffer, i32 size, i32 error) { P_Check(buffer && size); @@ -20,9 +20,9 @@ namespace p { error = ::GetLastError(); } - FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, nullptr, error, + FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM, nullptr, error, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), buffer, size, nullptr); - TChar* found = std::strchr(buffer, '\r'); + char* found = std::strchr(buffer, '\r'); if (found) { *found = '\0'; diff --git a/Src/Files/Files.cpp b/Src/Files/Files.cpp index 1e7a59fa..86d836c4 100644 --- a/Src/Files/Files.cpp +++ b/Src/Files/Files.cpp @@ -108,7 +108,7 @@ namespace p result.reserve(size + extraPadding); file.seekg(0, std::ios::beg); - result.assign(std::istreambuf_iterator(file), std::istreambuf_iterator()); + result.assign(std::istreambuf_iterator(file), std::istreambuf_iterator()); } return !result.empty(); } @@ -120,7 +120,7 @@ namespace p return false; } - std::basic_ofstream file(String{path}); + std::basic_ofstream file(String{path}); file.write(data.data(), data.size()); file.close(); return true; diff --git a/Src/Files/Paths.cpp b/Src/Files/Paths.cpp index 263e7f11..a1d9474a 100644 --- a/Src/Files/Paths.cpp +++ b/Src/Files/Paths.cpp @@ -19,7 +19,7 @@ #include #endif -/** Remote file systems codes */ + /** Remote file systems codes */ #define P_MAGIC_AFS 0x5346414F #define P_MAGIC_AUFS 0x61756673 #define P_MAGIC_CEPH 0x00C36400 @@ -56,7 +56,7 @@ namespace p #pragma region Internal namespace details { - bool IsDriveLetter(const TChar c) + bool IsDriveLetter(const char c) { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); } @@ -77,7 +77,7 @@ namespace p #if P_PLATFORM_WINDOWS - bool HasDriveLetterPrefix(const TChar* const first, const TChar* const last) + bool HasDriveLetterPrefix(const char* const first, const char* const last) { // test if [first, last) has a prefix of the form X: if (last - first >= 2 && FChar::ToUpper(first[0]) >= 'A' @@ -89,7 +89,7 @@ namespace p } #endif - const TChar* FindRootNameEnd(const TChar* const first, const TChar* const last) + const char* FindRootNameEnd(const char* const first, const char* const last) { const sizet len = last - first; #if P_PLATFORM_WINDOWS @@ -163,7 +163,7 @@ namespace p if (len > 2 && IsSeparator(first[0]) && IsSeparator(first[1]) && !IsSeparator(first[2]) && std::isprint(first[2])) { - const TChar* c = first + 3; + const char* c = first + 3; while (c <= last) { if (IsSeparator(*c)) @@ -183,21 +183,21 @@ namespace p #pragma endregion Internal - const TChar* FindRelativeChar(const TChar* const first, const TChar* const last) + const char* FindRelativeChar(const char* const first, const char* const last) { - const TChar* nameEnd; + const char* nameEnd; return FindRelativeChar(first, last, nameEnd); } - const TChar* FindRelativeChar( - const TChar* const first, const TChar* const last, const TChar*& outNameEnd) + const char* FindRelativeChar( + const char* const first, const char* const last, const char*& outNameEnd) { outNameEnd = details::FindRootNameEnd(first, last); // attempt to parse [first, last) as a path and return the start of relative-path return std::find_if_not(outNameEnd, last, IsSeparator); } - const TChar* FindFilename(const TChar* const first, const TChar* last) + const char* FindFilename(const char* const first, const char* last) { // attempt to parse [first, last) as a path and return the start of filename if it // exists; otherwise, last @@ -209,17 +209,17 @@ namespace p return last; } - const TChar* FindExtension(const TChar* const first, const TChar* const last) + const char* FindExtension(const char* const first, const char* const last) { - const TChar* filenameFirst = FindFilename(first, last); - const sizet filenameSize = last - filenameFirst; + const char* filenameFirst = FindFilename(first, last); + const sizet filenameSize = last - filenameFirst; if (filenameSize > 0u && // Check for "." and ".." filenames !(filenameFirst[0] == '.' && (filenameSize == 1u || (filenameSize == 2u && filenameFirst[1u] == '.')))) { - const TChar* extensionFirst = last; + const char* extensionFirst = last; while (extensionFirst > filenameFirst) { --extensionFirst; @@ -288,9 +288,9 @@ namespace p { // attempt to parse path as a path and return the filename if it exists; otherwise, an // empty view - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* filename = FindFilename(first, last); + const char* first = path.data(); + const char* last = first + path.size(); + const char* filename = FindFilename(first, last); return StringView{filename, static_cast(last - filename)}; } @@ -301,25 +301,25 @@ namespace p void RemoveFilename(String& path) { - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* filename = FindFilename(first, last); + const char* first = path.data(); + const char* last = first + path.size(); + const char* filename = FindFilename(first, last); path.erase(static_cast(filename - first)); } void RemoveFilename(StringView& path) { - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* filename = FindFilename(first, last); - path = StringView{first, static_cast(filename - first)}; + const char* first = path.data(); + const char* last = first + path.size(); + const char* filename = FindFilename(first, last); + path = StringView{first, static_cast(filename - first)}; } StringView GetStem(StringView path) { - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* stemFirst = FindFilename(first, last); + const char* first = path.data(); + const char* last = first + path.size(); + const char* stemFirst = FindFilename(first, last); const sizet filenameSize = last - stemFirst; // Check for "." and ".." filenames @@ -327,7 +327,7 @@ namespace p && !(stemFirst[0] == '.' && (filenameSize == 1 || (filenameSize == 2 && stemFirst[1] == '.')))) { - const TChar* stemLast = last; + const char* stemLast = last; while (stemLast > stemFirst) { --stemLast; @@ -350,23 +350,23 @@ namespace p StringView GetExtension(StringView path) { - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* extension = FindExtension(first, last); + const char* first = path.data(); + const char* last = first + path.size(); + const char* extension = FindExtension(first, last); return StringView{extension, static_cast(last - extension)}; } void ReplaceExtension(String& path, StringView newExtension) { - const TChar* first = path.data(); - const TChar* last = first + path.size(); - const TChar* extension = FindExtension(first, last); + const char* first = path.data(); + const char* last = first + path.size(); + const char* extension = FindExtension(first, last); path.erase(extension - first, last - extension); if (!newExtension.empty()) { - if (newExtension[0] != dot) - path.push_back(dot); + if (newExtension[0] != details::dot) + path.push_back(details::dot); path.append(newExtension); } } @@ -488,9 +488,9 @@ namespace p return; } - const TChar* const otherEnd = other.data() + other.size(); - const TChar* otherRootNameEnd; - const TChar* otherRootEnd = FindRelativeChar(other.data(), otherEnd, otherRootNameEnd); + const char* const otherEnd = other.data() + other.size(); + const char* otherRootNameEnd; + const char* otherRootEnd = FindRelativeChar(other.data(), otherEnd, otherRootNameEnd); // Is absolute? if (otherRootEnd != other.data()) @@ -507,7 +507,7 @@ namespace p } else if (HasFilename(base)) { - base.push_back(preferredSeparator); + base.push_back(details::preferredSeparator); } } @@ -515,7 +515,7 @@ namespace p { if (!path.empty() && !IsElementSeparator(*(path.end() - 1))) { - path += preferredSeparator; + path += details::preferredSeparator; return true; } return false; @@ -629,7 +629,7 @@ namespace p String ToString(const Path& path) { - return path.string, std::allocator>(); + return path.string, std::allocator>(); } Path ToSTDPath(StringView pathStr) @@ -653,7 +653,7 @@ namespace p return {p, State::AtEnd}; } - const TChar* PathIterator::Peek() const noexcept + const char* PathIterator::Peek() const noexcept { auto tkEnd = GetNextTokenStartPos(); auto end = GetAfterBack(); @@ -662,8 +662,8 @@ namespace p void PathIterator::Increment() noexcept { - const TChar* const end = GetAfterBack(); - const TChar* const start = GetNextTokenStartPos(); + const char* const end = GetAfterBack(); + const char* const start = GetNextTokenStartPos(); if (start == end) { MakeState(State::AtEnd); @@ -673,7 +673,7 @@ namespace p switch (state) { case State::BeforeBegin: { - if (const TChar* tkEnd = ConsumeRootName(start, end)) + if (const char* tkEnd = ConsumeRootName(start, end)) { MakeState(State::InRootName, start, tkEnd); return; @@ -681,7 +681,7 @@ namespace p P_FALLTHROUGH; } case State::InRootName: { - const TChar* tkEnd = ConsumeAllSeparators(start, end); + const char* tkEnd = ConsumeAllSeparators(start, end); if (tkEnd) MakeState(State::InRootDir, start, tkEnd); else @@ -693,10 +693,10 @@ namespace p break; case State::InFilenames: { - const TChar* sepEnd = ConsumeAllSeparators(start, end); + const char* sepEnd = ConsumeAllSeparators(start, end); if (sepEnd != end) { - const TChar* tkEnd = ConsumeName(sepEnd, end); + const char* tkEnd = ConsumeName(sepEnd, end); if (tkEnd) { MakeState(State::InFilenames, sepEnd, tkEnd); @@ -714,8 +714,8 @@ namespace p void PathIterator::Decrement() noexcept { - const TChar* rEnd = GetBeforeFront(); - const TChar* rStart = GetCurrentTokenStartPos() - 1; + const char* rEnd = GetBeforeFront(); + const char* rStart = GetCurrentTokenStartPos() - 1; if (rStart == rEnd) // we're decrementing the begin { MakeState(State::BeforeBegin); @@ -726,14 +726,14 @@ namespace p { case State::AtEnd: { // Try to Consume a trailing separator or root directory first. - if (const TChar* sepEnd = ConsumeAllSeparators(rStart, rEnd)) + if (const char* sepEnd = ConsumeAllSeparators(rStart, rEnd)) { if (sepEnd == rEnd) { MakeState(State::InRootDir, path.data(), rStart + 1); return; } - const TChar* tkStart = ConsumeRootName(sepEnd, rEnd); + const char* tkStart = ConsumeRootName(sepEnd, rEnd); if (tkStart == rEnd) { MakeState(State::InRootDir, rStart, rStart + 1); @@ -745,7 +745,7 @@ namespace p } else { - const TChar* tkStart = ConsumeRootName(rStart, rEnd); + const char* tkStart = ConsumeRootName(rStart, rEnd); if (tkStart == rEnd) { MakeState(State::InRootName, tkStart + 1, rStart + 1); @@ -762,13 +762,13 @@ namespace p MakeState(State::InFilenames, ConsumeName(rStart, rEnd) + 1, rStart + 1); break; case State::InFilenames: { - const TChar* sepEnd = ConsumeAllSeparators(rStart, rEnd); + const char* sepEnd = ConsumeAllSeparators(rStart, rEnd); if (sepEnd == rEnd) { MakeState(State::InRootDir, path.data(), rStart + 1); break; } - const TChar* tkStart = ConsumeRootName(sepEnd ? sepEnd : rStart, rEnd); + const char* tkStart = ConsumeRootName(sepEnd ? sepEnd : rStart, rEnd); if (tkStart == rEnd) { if (sepEnd) @@ -866,7 +866,7 @@ namespace p return InRootName() || InRootDir(); } - void PathIterator::MakeState(State newState, const TChar* start, const TChar* end) noexcept + void PathIterator::MakeState(State newState, const char* start, const char* end) noexcept { state = newState; rawEntry = StringView(start, end - start); @@ -877,19 +877,19 @@ namespace p rawEntry = {}; } - const TChar* PathIterator::GetAfterBack() const noexcept + const char* PathIterator::GetAfterBack() const noexcept { return path.data() + path.size(); } - const TChar* PathIterator::GetBeforeFront() const noexcept + const char* PathIterator::GetBeforeFront() const noexcept { return path.data() - 1; } /// \brief Return a pointer to the first character after the currently /// lexed element. - const TChar* PathIterator::GetNextTokenStartPos() const noexcept + const char* PathIterator::GetNextTokenStartPos() const noexcept { switch (state) { @@ -905,7 +905,7 @@ namespace p /// \brief Return a pointer to the first character in the currently lexed /// element. - const TChar* PathIterator::GetCurrentTokenStartPos() const noexcept + const char* PathIterator::GetCurrentTokenStartPos() const noexcept { switch (state) { @@ -920,7 +920,7 @@ namespace p } // Consume all consecutive separators - const TChar* PathIterator::ConsumeAllSeparators(const TChar* p, const TChar* end) const noexcept + const char* PathIterator::ConsumeAllSeparators(const char* p, const char* end) const noexcept { if (p == nullptr || p == end || !IsSeparator(*p)) return nullptr; @@ -932,10 +932,10 @@ namespace p } // Consume exactly N separators, or return nullptr. - const TChar* PathIterator::ConsumeNSeparators( - const TChar* p, const TChar* end, int N) const noexcept + const char* PathIterator::ConsumeNSeparators( + const char* p, const char* end, int N) const noexcept { - const TChar* ret = ConsumeAllSeparators(p, end); + const char* ret = ConsumeAllSeparators(p, end); if (ret == nullptr) return nullptr; if (p < end) @@ -951,9 +951,9 @@ namespace p return nullptr; } - const TChar* PathIterator::ConsumeName(const TChar* p, const TChar* end) const noexcept + const char* PathIterator::ConsumeName(const char* p, const char* end) const noexcept { - const TChar* start = p; + const char* start = p; if (p == nullptr || p == end || IsSeparator(*p)) return nullptr; const int inc = p < end ? 1 : -1; @@ -965,14 +965,14 @@ namespace p // Iterating backwards and Consumed all the rest of the input. // Check if the start of the string would have been considered // a root name. - const TChar* rootEnd = ConsumeRootName(end + 1, start); + const char* rootEnd = ConsumeRootName(end + 1, start); if (rootEnd) return rootEnd - 1; } return p; } - const TChar* PathIterator::ConsumeDriveLetter(const TChar* p, const TChar* end) const noexcept + const char* PathIterator::ConsumeDriveLetter(const char* p, const char* end) const noexcept { if (p == end) return nullptr; @@ -990,7 +990,7 @@ namespace p } } - const TChar* PathIterator::ConsumeNetworkRoot(const TChar* p, const TChar* end) const noexcept + const char* PathIterator::ConsumeNetworkRoot(const char* p, const char* end) const noexcept { if (p == end) return nullptr; @@ -1000,12 +1000,12 @@ namespace p return ConsumeNSeparators(ConsumeName(p, end), end, 2); } - const TChar* PathIterator::ConsumeRootName(const TChar* p, const TChar* end) const noexcept + const char* PathIterator::ConsumeRootName(const char* p, const char* end) const noexcept { #if P_PLATFORM_WINDOWS - if (const TChar* ret = ConsumeDriveLetter(p, end)) + if (const char* ret = ConsumeDriveLetter(p, end)) return ret; - if (const TChar* ret = ConsumeNetworkRoot(p, end)) + if (const char* ret = ConsumeNetworkRoot(p, end)) return ret; #endif return nullptr; diff --git a/Src/Files/PlatformPaths.cpp b/Src/Files/PlatformPaths.cpp index 7b967277..1dbded4e 100644 --- a/Src/Files/PlatformPaths.cpp +++ b/Src/Files/PlatformPaths.cpp @@ -158,12 +158,12 @@ namespace p char tempPath[MAX_PATH]; ZeroMemory(tempPath, sizeof(char) * MAX_PATH); - ::GetTempPath(MAX_PATH, tempPath); + ::GetTempPathA(MAX_PATH, tempPath); // Always expand the temp path in case windows returns short directory names. char fullTempPath[MAX_PATH]; ZeroMemory(fullTempPath, sizeof(char) * MAX_PATH); - ::GetLongPathName(tempPath, fullTempPath, MAX_PATH); + ::GetLongPathNameA(tempPath, fullTempPath, MAX_PATH); userTempPath = Strings::Convert(TStringView{fullTempPath}); std::replace(userTempPath.begin(), userTempPath.end(), '\\', '/'); diff --git a/Src/Memory/MemoryStats.cpp b/Src/Memory/MemoryStats.cpp index 6a0d91a2..4b5c0590 100644 --- a/Src/Memory/MemoryStats.cpp +++ b/Src/Memory/MemoryStats.cpp @@ -50,7 +50,7 @@ namespace p MemoryStats::MemoryStats() : allocations{GetStateArena()} -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS , stacks{arena} #endif , freedAllocations{GetStateArena()} @@ -94,7 +94,7 @@ namespace p const AllocationStats item{static_cast(ptr), size}; i32 index = allocations.AddSorted(item, SortLessAllocationStats{}); -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS auto& stack = stacks.InsertRef(index); backward::StackTrace stack{arena}; stack.load_here(14 + 3); @@ -116,10 +116,11 @@ namespace p if (index != NO_INDEX) { AllocationStats& allocation = allocations[index]; - P_CheckMsg(size == allocation.size, "Freed an allocation with a different size to which it got allocated with."); + P_CheckMsg(size == allocation.size, + "Freed an allocation with a different size to which it got allocated with."); freedAllocations.AddSorted(Move(allocation), SortLessAllocationStats{}); allocations.RemoveAt(index); -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS stacks.RemoveAt(index); #endif } @@ -140,7 +141,7 @@ namespace p { if (allocations.Size() > 0) { - TString errorMsg; + TString errorMsg; Strings::FormatTo( errorMsg, "{}: {} allocations were not freed!", name, allocations.Size()); @@ -148,7 +149,7 @@ namespace p for (i32 i = 0; i < shown; ++i) { PrintAllocationError("", &allocations[i], nullptr); -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS PrintAllocationError("", &allocations[i], &stacks[i]); #endif } @@ -161,9 +162,9 @@ namespace p std::puts(errorMsg.data()); } allocations.Clear(); -#if P_ENABLE_ALLOCATION_STACKS +#ifdef P_ENABLE_ALLOCATION_STACKS stacks.Clear(); -#endif // P_ENABLE_ALLOCATION_STACKS +#endif // P_ENABLE_ALLOCATION_STACKS used = 0; } } // namespace p diff --git a/Src/Memory/OwnPtr.cpp b/Src/Memory/OwnPtr.cpp index b39d8b23..a0544290 100644 --- a/Src/Memory/OwnPtr.cpp +++ b/Src/Memory/OwnPtr.cpp @@ -72,7 +72,7 @@ namespace p other.counter = nullptr; } - void Ptr::MoveFrom(Ptr&& other) + void Ptr::MoveFromUnsafe(Ptr&& other) { if (counter != other.counter) { @@ -87,7 +87,7 @@ namespace p } } - void Ptr::CopyFrom(const Ptr& other) + void Ptr::CopyFromUnsafe(const Ptr& other) { if (counter != other.counter) { diff --git a/Src/Pipe.cpp b/Src/Pipe.cpp index 183d4e01..da56a142 100644 --- a/Src/Pipe.cpp +++ b/Src/Pipe.cpp @@ -1,9 +1,10 @@ // Copyright 2015-2024 Piperift - All rights reserved -#include "Pipe/Memory/NewDelete.h" -// Override as first include +// #include "Pipe/Memory/NewDelete.h" +// Override as first include #include "Pipe.h" + #include "Pipe/Core/Log.h" #include "Pipe/Files/Paths.h" #include "Pipe/Memory/Alloc.h" diff --git a/Src/PipeECS.cpp b/Src/PipeECS.cpp index 102fee5b..f41ea9bd 100644 --- a/Src/PipeECS.cpp +++ b/Src/PipeECS.cpp @@ -287,7 +287,7 @@ namespace p void Read(Reader& r, Id& val) { - auto* entityReader = dynamic_cast(&r); + auto* entityReader = p::Cast(&r); if (P_EnsureMsg(entityReader, "Serializing an ecs Id without an EntityReader")) [[likely]] { i32 dataId; @@ -298,7 +298,7 @@ namespace p void Write(Writer& w, Id val) { - auto* entityWriter = dynamic_cast(&w); + auto* entityWriter = p::Cast(&w); if (P_EnsureMsg(entityWriter, "Serializing an ecs Id without an EntityWriter")) [[likely]] { const i32* dataId = entityWriter->GetIdToIndexes().Find(val); diff --git a/Src/PipeSerialize.cpp b/Src/PipeSerialize.cpp index de64085e..12e4e442 100644 --- a/Src/PipeSerialize.cpp +++ b/Src/PipeSerialize.cpp @@ -754,7 +754,7 @@ namespace p if (asString.data()) { - yyjsonAllocator.free(yyjsonAllocator.ctx, const_cast(asString.data())); + yyjsonAllocator.free(yyjsonAllocator.ctx, const_cast(asString.data())); } } @@ -941,7 +941,7 @@ namespace p if (asString.data()) { // Free previous string value - yyjsonAllocator.free(yyjsonAllocator.ctx, const_cast(asString.data())); + yyjsonAllocator.free(yyjsonAllocator.ctx, const_cast(asString.data())); } yyjson_write_flag flags = pretty ? YYJSON_WRITE_PRETTY : 0; @@ -977,7 +977,7 @@ namespace p void BinaryFormatReader::Read(bool& val) { - val = *pointer; + val = bool(*pointer); ++pointer; P_CheckMsg(pointer <= data.EndData(), "The read buffer has been exceeded"); } @@ -1077,11 +1077,11 @@ namespace p { i32 size = 0; Read(size); - const sizet sizeInBytes = size * sizeof(TChar); + const sizet sizeInBytes = size * sizeof(char); if (P_EnsureMsg(pointer + sizeInBytes <= data.EndData(), "The size of a string readen exceeds the read buffer!")) [[likely]] { - val = StringView{reinterpret_cast(pointer), sizeInBytes}; + val = StringView{reinterpret_cast(pointer), sizeInBytes}; pointer += sizeInBytes; P_CheckMsg(pointer <= data.EndData(), "The read buffer has been exceeded"); } @@ -1114,9 +1114,9 @@ namespace p Free(arena, data, capacity); } - void BinaryFormatWriter::BeginArray(u32 size) + void BinaryFormatWriter::BeginArray(u32 arraySize) { - Write(size); + Write(arraySize); } bool BinaryFormatWriter::EnterNext(StringView) @@ -1227,11 +1227,11 @@ namespace p } void BinaryFormatWriter::Write(StringView val) { - const i32 valSize = i32(val.size() * sizeof(TChar)); + const i32 valSize = i32(val.size() * sizeof(char)); PreAlloc(valSize + sizeof(i32)); Write(i32(val.size())); - CopyMem(data + size, const_cast(val.data()), valSize); + CopyMem(data + size, const_cast(val.data()), valSize); size += valSize; } diff --git a/Src/PipeTime.cpp b/Src/PipeTime.cpp index e04ab4bb..81dc8bad 100644 --- a/Src/PipeTime.cpp +++ b/Src/PipeTime.cpp @@ -7,6 +7,8 @@ #include +// Prevent errors with chrono duration::max() +#undef max namespace p { @@ -20,14 +22,14 @@ namespace p return ToString("%d.%h:%m:%s.%f"); } - String Timespan::ToString(const TChar* format) const + String Timespan::ToString(const char* format) const { String result; ToString(format, result); return result; } - void Timespan::ToString(const TChar* format, String& result) const + void Timespan::ToString(const char* format, String& result) const { result += (*this < Timespan::Zero()) ? '-' : '+'; @@ -126,7 +128,7 @@ namespace p const i32 fractionNano = *Strings::ToI32(Tokens[4]); // Max days - if ((days > Chrono::floor(DecMicroseconds::max()).count() - 1)) + if (days > (Days::max().count() - 1)) { return false; } @@ -306,7 +308,7 @@ namespace p return ToString("%Y.%m.%d-%H.%M.%S"); } - String DateTime::ToString(const TChar* format) const + String DateTime::ToString(const char* format) const { // return Strings::Format(format, *value); String result; @@ -314,7 +316,7 @@ namespace p return result; } - void DateTime::ToString(const TChar* format, String& result) const + void DateTime::ToString(const char* format, String& result) const { if (format) { @@ -423,13 +425,13 @@ namespace p return true; } - bool DateTime::ParseIso8601(const TChar* DateTimeString, DateTime& OutDateTime) + bool DateTime::ParseIso8601(const char* DateTimeString, DateTime& OutDateTime) { // DateOnly: YYYY-MM-DD // DateTime: YYYY-mm-ddTHH:MM:SS(.ssss)(Z|+th:tm|-th:tm) - const TChar* ptr = DateTimeString; - TChar* Next = nullptr; + const char* ptr = DateTimeString; + char* Next = nullptr; i32 Year = 0, Month = 0, Day = 0; i32 Hour = 0, Minute = 0, Second = 0, Millisecond = 0; diff --git a/Src/PipeVectors.cpp b/Src/PipeVectors.cpp index a3ae10d6..baf971e7 100644 --- a/Src/PipeVectors.cpp +++ b/Src/PipeVectors.cpp @@ -200,14 +200,6 @@ namespace p Quat RotationQuat{CR * CP * CY + SR * SP * SY, CR * SP * SY - SR * CP * CY, -CR * SP * CY - SR * CP * SY, CR * CP * SY - SR * SP * CY}; - -#if ENABLE_NAN_DIAGNOSTIC || DO_CHECK - // Very large inputs can cause NaN's. Want to catch this here - ensureMsgf(!RotationQuat.ContainsNaN(), - TEXT("Invalid input to FRotator::Quaternion - generated NaN output: %s"), - *RotationQuat.ToString()); -#endif - return RotationQuat; } diff --git a/Tests/Reflection/TypeName.spec.cpp b/Tests/Reflection/TypeName.spec.cpp index 32112ea6..13409e45 100644 --- a/Tests/Reflection/TypeName.spec.cpp +++ b/Tests/Reflection/TypeName.spec.cpp @@ -9,7 +9,6 @@ #include - using namespace snowhouse; using namespace bandit; using namespace p; @@ -39,7 +38,7 @@ go_bandit([]() { AssertThat(GetTypeName(), Equals("i16")); AssertThat(GetTypeName(), Equals("i32")); AssertThat(GetTypeName(), Equals("i64")); - AssertThat(GetTypeName(), Equals("TChar")); + AssertThat(GetTypeName(), Equals("TChar")); AssertThat(GetTypeName(), Equals("StringView")); AssertThat(GetTypeName(), Equals("String")); });