[ { "path": ".clang-format", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# https://releases.llvm.org/20.1.0/tools/clang/docs/ClangFormatStyleOptions.html\r\n\r\n# To update this .clang-format file for a new clang-format version:\r\n# 1. Update the documentation link above.\r\n# 2. Copy the output of `clang-format -dump-config --style=LLVM` into a temporary file.\r\n# a. Comment out all of its lines.\r\n# 3. Compare that temporary file to this .clang-format file.\r\n# 4. Adjust this .clang-format file to record new and updated options.\r\n# a. Read the new documentation to understand such changes.\r\n# 5. The goal is for the comparison from the temporary file to this .clang-format file to be pure additions (green).\r\n# a. That is, comments here are recording the defaults, while added lines are our customized settings.\r\n\r\n---\r\n# Language: Cpp\r\nBasedOnStyle: LLVM\r\n# AccessModifierOffset: -2\r\nAccessModifierOffset: -4\r\n# AlignAfterOpenBracket: Align\r\nAlignAfterOpenBracket: DontAlign\r\n# AlignArrayOfStructures: None\r\n# AlignConsecutiveAssignments:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: true\r\nAlignConsecutiveAssignments: Consecutive\r\n# AlignConsecutiveBitFields:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\n# AlignConsecutiveDeclarations:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: true\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\n# AlignConsecutiveMacros:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\nAlignConsecutiveMacros: Consecutive\r\n# AlignConsecutiveShortCaseStatements:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCaseArrows: false\r\n# AlignCaseColons: false\r\n# AlignConsecutiveTableGenBreakingDAGArgColons:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\n# AlignConsecutiveTableGenCondOperatorColons:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\n# AlignConsecutiveTableGenDefinitionColons:\r\n# Enabled: false\r\n# AcrossEmptyLines: false\r\n# AcrossComments: false\r\n# AlignCompound: false\r\n# AlignFunctionDeclarations: false\r\n# AlignFunctionPointers: false\r\n# PadOperators: false\r\n# AlignEscapedNewlines: Right\r\nAlignEscapedNewlines: Left\r\n# AlignOperands: Align\r\nAlignOperands: AlignAfterOperator\r\n# AlignTrailingComments:\r\n# Kind: Always\r\n# OverEmptyLines: 0\r\nAlignTrailingComments:\r\n Kind: Never\r\n# AllowAllArgumentsOnNextLine: true\r\n# AllowAllParametersOfDeclarationOnNextLine: true\r\n# AllowBreakBeforeNoexceptSpecifier: Never\r\nAllowBreakBeforeNoexceptSpecifier: OnlyWithParen\r\n# AllowShortBlocksOnASingleLine: Never\r\n# AllowShortCaseExpressionOnASingleLine: true\r\n# AllowShortCaseLabelsOnASingleLine: false\r\n# AllowShortCompoundRequirementOnASingleLine: true\r\n# AllowShortEnumsOnASingleLine: true\r\n# AllowShortFunctionsOnASingleLine: All\r\nAllowShortFunctionsOnASingleLine: Empty\r\n# AllowShortIfStatementsOnASingleLine: Never\r\n# AllowShortLambdasOnASingleLine: All\r\n# AllowShortLoopsOnASingleLine: false\r\n# AllowShortNamespacesOnASingleLine: false\r\n# AlwaysBreakAfterDefinitionReturnType: None\r\n# AlwaysBreakBeforeMultilineStrings: false\r\n# AttributeMacros:\r\n# - __capability\r\n# BinPackArguments: true\r\n# BinPackParameters: BinPack\r\n# BitFieldColonSpacing: Both\r\n# BraceWrapping:\r\n# AfterCaseLabel: false\r\n# AfterClass: false\r\n# AfterControlStatement: Never\r\n# AfterEnum: false\r\n# AfterExternBlock: false\r\n# AfterFunction: false\r\n# AfterNamespace: false\r\n# AfterObjCDeclaration: false\r\n# AfterStruct: false\r\n# AfterUnion: false\r\n# BeforeCatch: false\r\n# BeforeElse: false\r\n# BeforeLambdaBody: false\r\n# BeforeWhile: false\r\n# IndentBraces: false\r\n# SplitEmptyFunction: true\r\n# SplitEmptyRecord: true\r\n# SplitEmptyNamespace: true\r\n# BreakAdjacentStringLiterals: true\r\n# BreakAfterAttributes: Leave\r\nBreakAfterAttributes: Never\r\n# BreakAfterJavaFieldAnnotations: false\r\n# BreakAfterReturnType: None\r\n# BreakArrays: true\r\n# BreakBeforeBinaryOperators: None\r\nBreakBeforeBinaryOperators: NonAssignment\r\n# BreakBeforeConceptDeclarations: Always\r\n# BreakBeforeBraces: Attach\r\n# BreakBeforeInlineASMColon: OnlyMultiline\r\n# BreakBeforeTernaryOperators: true\r\n# BreakBinaryOperations: Never\r\n# BreakConstructorInitializers: BeforeColon\r\n# BreakFunctionDefinitionParameters: false\r\n# BreakInheritanceList: BeforeColon\r\n# BreakStringLiterals: true\r\n# BreakTemplateDeclarations: MultiLine\r\nBreakTemplateDeclarations: Yes\r\n# ColumnLimit: 80\r\nColumnLimit: 120\r\n# CommentPragmas: '^ IWYU pragma:'\r\n# CompactNamespaces: false\r\n# ConstructorInitializerIndentWidth: 4\r\n# ContinuationIndentWidth: 4\r\n# Cpp11BracedListStyle: true\r\n# DerivePointerAlignment: false\r\n# DisableFormat: false\r\n# EmptyLineAfterAccessModifier: Never\r\n# EmptyLineBeforeAccessModifier: LogicalBlock\r\n# ExperimentalAutoDetectBinPacking: false\r\n# FixNamespaceComments: true\r\n# ForEachMacros:\r\n# - foreach\r\n# - Q_FOREACH\r\n# - BOOST_FOREACH\r\n# IfMacros:\r\n# - KJ_IF_MAYBE\r\n# IncludeBlocks: Preserve\r\nIncludeBlocks: Regroup\r\n# IncludeCategories:\r\n# - Regex: '^\"(llvm|llvm-c|clang|clang-c)/'\r\n# Priority: 2\r\n# SortPriority: 0\r\n# CaseSensitive: false\r\n# - Regex: '^(<|\"(gtest|gmock|isl|json)/)'\r\n# Priority: 3\r\n# SortPriority: 0\r\n# CaseSensitive: false\r\n# - Regex: '.*'\r\n# Priority: 1\r\n# SortPriority: 0\r\n# CaseSensitive: false\r\nIncludeCategories:\r\n - Regex: '^<(yvals|yvals_core)\\.h>$'\r\n Priority: 10\r\n - Regex: '^<__msvc_.*\\.hpp>$'\r\n Priority: 20\r\n - Regex: '^$' # should be included before any header that includes \r\n Priority: 30\r\n SortPriority: 30\r\n - Regex: '^<(DbgEng|DbgHelp|Shlwapi|Windows)\\.h>$'\r\n Priority: 30\r\n SortPriority: 31\r\n - Regex: '^$'\r\n Priority: 30\r\n SortPriority: 32\r\n - Regex: '\\.hpp[>\"]$'\r\n Priority: 40\r\n - Regex: '.*'\r\n Priority: 20\r\n# IncludeIsMainRegex: '(Test)?$'\r\n# IncludeIsMainSourceRegex: ''\r\n# IndentAccessModifiers: false\r\n# IndentCaseBlocks: false\r\nIndentCaseBlocks: true\r\n# IndentCaseLabels: false\r\n# IndentExportBlock: true\r\n# IndentExternBlock: AfterExternBlock\r\n# IndentGotoLabels: true\r\n# IndentPPDirectives: None\r\n# IndentRequiresClause: true\r\n# IndentWidth: 2\r\nIndentWidth: 4\r\n# IndentWrappedFunctionNames: false\r\nIndentWrappedFunctionNames: true\r\n# InsertBraces: false\r\nInsertBraces: true\r\n# InsertNewlineAtEOF: false\r\nInsertNewlineAtEOF: true\r\n# InsertTrailingCommas: None\r\n# IntegerLiteralSeparator:\r\n# Binary: 0\r\n# BinaryMinDigits: 0\r\n# Decimal: 0\r\n# DecimalMinDigits: 0\r\n# Hex: 0\r\n# HexMinDigits: 0\r\n# JavaScriptQuotes: Leave\r\n# JavaScriptWrapImports: true\r\n# KeepEmptyLines:\r\n# AtEndOfFile: false\r\n# AtStartOfBlock: true\r\n# AtStartOfFile: true\r\nKeepEmptyLines:\r\n AtStartOfFile: false\r\n# KeepFormFeed: false\r\n# LambdaBodyIndentation: Signature\r\n# LineEnding: DeriveLF\r\nLineEnding: CRLF\r\n# NOTE: MacroBlockBegin/MacroBlockEnd don't work with _CATCH_ALL.\r\n# MacroBlockBegin: ''\r\n# MacroBlockEnd: ''\r\n# MainIncludeChar: Quote\r\n# MaxEmptyLinesToKeep: 1\r\nMaxEmptyLinesToKeep: 2\r\n# NamespaceIndentation: None\r\nNamespaceIndentation: All\r\n# ObjCBinPackProtocolList: Auto\r\n# ObjCBlockIndentWidth: 2\r\n# ObjCBreakBeforeNestedBlockParam: true\r\n# ObjCSpaceAfterProperty: false\r\n# ObjCSpaceBeforeProtocolList: true\r\n# PackConstructorInitializers: BinPack\r\n# PenaltyBreakAssignment: 2\r\n# PenaltyBreakBeforeFirstCallParameter: 19\r\n# PenaltyBreakBeforeMemberAccess: 150\r\n# PenaltyBreakComment: 300\r\n# PenaltyBreakFirstLessLess: 120\r\n# PenaltyBreakOpenParenthesis: 0\r\n# PenaltyBreakScopeResolution: 500\r\n# PenaltyBreakString: 1000\r\n# PenaltyBreakTemplateDeclaration: 10\r\n# PenaltyExcessCharacter: 1000000\r\n# PenaltyIndentedWhitespace: 0\r\n# PenaltyReturnTypeOnItsOwnLine: 60\r\n# PointerAlignment: Right\r\nPointerAlignment: Left\r\n# PPIndentWidth: -1\r\n# QualifierAlignment: Leave\r\n# ReferenceAlignment: Pointer\r\n# ReflowComments: Always\r\n# RemoveBracesLLVM: false\r\n# RemoveEmptyLinesInUnwrappedLines: false\r\n# RemoveParentheses: Leave\r\n# RemoveSemicolon: false\r\nRemoveSemicolon: true\r\n# RequiresClausePosition: OwnLine\r\n# RequiresExpressionIndentation: OuterScope\r\n# SeparateDefinitionBlocks: Leave\r\n# ShortNamespaceLines: 1\r\n# SkipMacroDefinitionBody: false\r\n# SortIncludes: CaseSensitive\r\n# SortJavaStaticImport: Before\r\n# SortUsingDeclarations: LexicographicNumeric\r\n# SpaceAfterCStyleCast: false\r\nSpaceAfterCStyleCast: true\r\n# SpaceAfterLogicalNot: false\r\n# SpaceAfterTemplateKeyword: true\r\n# SpaceAroundPointerQualifiers: Default\r\n# SpaceBeforeAssignmentOperators: true\r\n# SpaceBeforeCaseColon: false\r\n# SpaceBeforeCpp11BracedList: false\r\n# SpaceBeforeCtorInitializerColon: true\r\n# SpaceBeforeInheritanceColon: true\r\n# SpaceBeforeJsonColon: false\r\n# SpaceBeforeParens: ControlStatements\r\n# SpaceBeforeParensOptions:\r\n# AfterControlStatements: true\r\n# AfterForeachMacros: true\r\n# AfterFunctionDefinitionName: false\r\n# AfterFunctionDeclarationName: false\r\n# AfterIfMacros: true\r\n# AfterOverloadedOperator: false\r\n# AfterPlacementOperator: true\r\n# AfterRequiresInClause: false\r\n# AfterRequiresInExpression: false\r\n# BeforeNonEmptyParentheses: false\r\nSpaceBeforeParens: Custom\r\nSpaceBeforeParensOptions:\r\n AfterRequiresInClause: true\r\n# SpaceBeforeRangeBasedForLoopColon: true\r\n# SpaceBeforeSquareBrackets: false\r\n# SpaceInEmptyBlock: false\r\n# SpacesBeforeTrailingComments: 1\r\n# SpacesInAngles: Never\r\n# SpacesInContainerLiterals: true\r\n# SpacesInLineCommentPrefix:\r\n# Minimum: 1\r\n# Maximum: -1\r\n# SpacesInParens: Never\r\n# SpacesInParensOptions:\r\n# ExceptDoubleParentheses: false\r\n# InCStyleCasts: false\r\n# InConditionalStatements: false\r\n# InEmptyParentheses: false\r\n# Other: false\r\n# SpacesInSquareBrackets: false\r\n# Standard: Latest\r\n# StatementAttributeLikeMacros:\r\n# - Q_EMIT\r\n# StatementMacros:\r\n# - Q_UNUSED\r\n# - QT_REQUIRE_VERSION\r\n# NOTE: _STD_BEGIN, _STD_END, etc. aren't macros for complete statements, but telling\r\n# clang-format that they are produces the behavior that we want (with no block indentation).\r\nStatementMacros:\r\n - _EXTERN_CXX_WORKAROUND\r\n - _END_EXTERN_CXX_WORKAROUND\r\n - _STD_BEGIN\r\n - _STD_END\r\n - _STDEXT_BEGIN\r\n - _STDEXT_END\r\n - _FMT_P2286_BEGIN\r\n - _FMT_P2286_END\r\n - _EXTERN_C_UNLESS_PURE\r\n - _END_EXTERN_C_UNLESS_PURE\r\n# TableGenBreakInsideDAGArg: DontBreak\r\n# TabWidth: 8\r\n# UseTab: Never\r\n# VerilogBreakBetweenInstancePorts: true\r\n# WhitespaceSensitiveMacros:\r\n# - BOOST_PP_STRINGIZE\r\n# - CF_SWIFT_NAME\r\n# - NS_SWIFT_NAME\r\n# - PP_STRINGIZE\r\n# - STRINGIZE\r\n# WrapNamespaceBodyWithEmptyLines: Leave\r\n...\r\n" }, { "path": ".gitattributes", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# Disable CRLF-mapping for all files.\r\n* -text\r\n\r\n# Ensure GitHub detects our C++ code as C++ code.\r\n/stl/inc/** linguist-language=C++\r\n/stl/modules/** linguist-language=C++\r\n/stl/src/** linguist-language=C++\r\n*.h linguist-language=C++\r\n\r\n# Ensure GitHub detects lit.cfg and lit.local.cfg as Python instead of HAProxy.\r\n*.cfg linguist-language=Python\r\n\r\n# Ensure GitHub detects our Perl legacy test harness code as Perl code instead of Raku.\r\n*.pl linguist-language=Perl\r\n" }, { "path": ".github/CODEOWNERS", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n* @microsoft/vclibs\r\n" }, { "path": ".github/ISSUE_TEMPLATE/bug-report.md", "content": "---\r\nname: Bug Report\r\nabout: Report a bug in the STL\r\ntitle: \"`
`: Problem\"\r\nlabels: ''\r\nassignees: ''\r\n\r\n---\r\n\r\n# Describe the bug\r\nA clear and concise description of what the bug is. Please check that you've\r\nread the guidelines for submitting STL bug reports in `README.md`. If you are\r\nhaving problems with any component that is not the STL, instructions to get\r\nto the right place are there.\r\n\r\nEven if your project is using an older version of the MSVC Build Tools, please\r\ncheck the Latest production release (or better yet, the Preview release) before\r\nreporting bugs. This will save time by avoiding reports of already-fixed bugs.\r\n\r\n# Command-line test case\r\n```\r\nC:\\Temp>type repro.cpp\r\n#include \r\n\r\nint main() {\r\n // Replace this program with one demonstrating your actual bug report,\r\n // along with the following compilation command. Please leave compiler\r\n // version banners in the output (don't use /nologo), and include output\r\n // of your test program, if any.\r\n std::cout << \"test failure\\n\";\r\n}\r\n\r\nC:\\Temp>cl /EHsc /W4 /WX /std:c++latest .\\repro.cpp\r\nMicrosoft (R) C/C++ Optimizing Compiler Version 19.36.32522 for x64\r\nCopyright (C) Microsoft Corporation. All rights reserved.\r\n\r\n/std:c++latest is provided as a preview of language features from the latest C++\r\nworking draft, and we're eager to hear about bugs and suggestions for improvements.\r\nHowever, note that these features are provided as-is without support, and subject\r\nto changes or removal as the working draft evolves. See\r\nhttps://go.microsoft.com/fwlink/?linkid=2045807 for details.\r\n\r\nrepro.cpp\r\nMicrosoft (R) Incremental Linker Version 14.36.32522.0\r\nCopyright (C) Microsoft Corporation. All rights reserved.\r\n\r\n/out:repro.exe\r\nrepro.obj\r\n\r\nC:\\Temp>.\\repro.exe\r\ntest failure\r\n```\r\n\r\n# Expected behavior\r\nA clear and concise description of what you expected to happen.\r\nAlternatively, include `static_assert` or `assert` lines in your\r\ntest case above whose failure clearly indicates the problem.\r\n\r\n# STL version\r\n* Option 1: MSVC Compiler version\r\n + Example:\r\n ```\r\n C:\\Temp>cl.exe\r\n Microsoft (R) C/C++ Optimizing Compiler Version 19.50.35503 for x64\r\n Copyright (C) Microsoft Corporation. All rights reserved.\r\n\r\n usage: cl [ option... ] filename... [ /link linkoption... ]\r\n ```\r\n* Option 2: `_MSVC_STL_UPDATE` value\r\n + Example:\r\n ```\r\n C:\\Temp>type meow.cpp\r\n #include \r\n int main() {\r\n std::cout << _MSVC_STL_UPDATE << \"\\n\";\r\n }\r\n\r\n C:\\Temp>cl /EHsc /nologo /W4 meow.cpp && meow\r\n meow.cpp\r\n 202507\r\n ```\r\n* Option 3: git commit hash\r\n + Example:\r\n ```\r\n https://github.com/microsoft/STL/commit/219514876ea86491de191ceaa88632616bbc0f19\r\n ```\r\n\r\n# Additional context\r\nAdd any other context about the problem here.\r\n" }, { "path": ".github/ISSUE_TEMPLATE/question.md", "content": "---\r\nname: Question\r\nabout: Ask a question about this STL implementation\r\ntitle: \"\"\r\nlabels: question\r\nassignees: ''\r\n\r\n---\r\n\r\nInstructions\r\n============\r\nHere, you can ask a question about this STL implementation, and a maintainer\r\nwill answer. Please read the examples below, then delete all of this text and\r\nreplace it with your question. If you aren't sure whether a question is\r\non-topic, just go ahead and ask it! :-)\r\n\r\nOn-Topic Examples\r\n-----------------\r\n* What is this code in the STL doing? You can link to the relevant code:\r\nhttps://help.github.com/en/github/managing-your-work-on-github/creating-a-permanent-link-to-a-code-snippet\r\n* What are the preferred conventions for writing something?\r\n* What are the maintainers planning to do in the future?\r\n* Would the maintainers be interested in specific enhancements?\r\n\r\nOff-Topic Examples\r\n------------------\r\n* Questions about non-STL components, such as the compiler, the CRT,\r\nthe Windows API, the Visual Studio IDE, etc.\r\n* Questions about how to use the STL or C++ in general. For such questions,\r\nconsider https://stackoverflow.com or https://www.reddit.com/r/cpp_questions/ .\r\n* Questions about whether you've encountered a bug in the STL. Instead of this\r\nQuestion template, please use the Bug Report template, because we'll need\r\na command-line test case and the other information requested there.\r\n" }, { "path": ".github/pull_request_template.md", "content": "\r\n" }, { "path": ".github/workflows/update-status-chart.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nname: Update Status Chart\r\non:\r\n schedule:\r\n - cron: \"0 7 * * *\"\r\n workflow_dispatch:\r\npermissions:\r\n contents: write\r\njobs:\r\n build:\r\n if: ${{ github.repository == 'microsoft/STL' }}\r\n runs-on: ubuntu-latest\r\n steps:\r\n - name: Checkout gh-pages\r\n uses: actions/checkout@v6\r\n with:\r\n ref: gh-pages\r\n - name: Setup Node.js\r\n uses: actions/setup-node@v6\r\n with:\r\n node-version: \">=25.2.1\"\r\n - name: Install Packages\r\n run: |\r\n npm ci\r\n - name: Compile And Run gather_stats.mts\r\n run: |\r\n SECRET_GITHUB_PERSONAL_ACCESS_TOKEN=\"${{ github.token }}\" npm run gather\r\n - name: Compile And Bundle status_chart.mts\r\n run: |\r\n npm run make\r\n - name: Commit Changes\r\n run: |\r\n git config user.name \"github-actions[bot]\"\r\n git config user.email \"41898282+github-actions[bot]@users.noreply.github.com\"\r\n git add src/daily_table.mts src/monthly_table.mts built/status_chart.mjs\r\n git diff-index --quiet HEAD || git commit -m \"Automated update.\"\r\n git push origin gh-pages\r\n" }, { "path": ".gitignore", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n__pycache__/\r\n.vs/\r\n.vscode/\r\n/build/\r\n/out/\r\n/tools/out/\r\n/CMakeLists.txt.user\r\n*.log\r\n" }, { "path": ".gitmodules", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n[submodule \"llvm-project\"]\r\n\tpath = llvm-project\r\n\turl = https://github.com/llvm/llvm-project.git\r\n[submodule \"boost-math\"]\r\n\tpath = boost-math\r\n\turl = https://github.com/boostorg/math.git\r\n[submodule \"benchmarks/google-benchmark\"]\r\n\tpath = benchmarks/google-benchmark\r\n\turl = https://github.com/google/benchmark.git\r\n" }, { "path": ".mailmap", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# This file maps author and committer email addresses to canonical names and email\r\n# addresses for display in the output of `git log` and `git blame`.\r\n# Format:\r\n# Canonical Name \r\n\r\n\r\nAmy Wishnousky \r\nAnju del Moral Gonzalez \r\n" }, { "path": "CMakeLists.txt", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\ncmake_minimum_required(VERSION 4.2.3)\r\n\r\nset(CMAKE_TRY_COMPILE_TARGET_TYPE STATIC_LIBRARY)\r\nproject(msvc_standard_libraries LANGUAGES CXX)\r\n\r\nif(CMAKE_CXX_COMPILER_VERSION VERSION_LESS \"19.51.36122\")\r\n message(FATAL_ERROR \"The STL must be built with MSVC Compiler 19.51.36122 or later. Follow the README instructions.\")\r\nendif()\r\n\r\ninclude(CheckCXXSourceCompiles)\r\ncheck_cxx_source_compiles([=[\r\n#include \r\nstatic_assert(WDK_NTDDI_VERSION >= NTDDI_WIN11_GE, \"Inspecting WDK_NTDDI_VERSION, the Windows SDK version.\");\r\nint main() {}\r\n]=] WINDOWS_SDK_VERSION_CHECK)\r\n\r\nif(NOT WINDOWS_SDK_VERSION_CHECK)\r\n message(FATAL_ERROR \"The STL must be built with the Windows 11 SDK (10.0.26100) or later. Follow the README instructions.\")\r\nendif()\r\n\r\nif(NOT DEFINED VCLIBS_TARGET_ARCHITECTURE)\r\n set(VCLIBS_TARGET_ARCHITECTURE \"${CMAKE_CXX_COMPILER_ARCHITECTURE_ID}\")\r\nendif()\r\n\r\nstring(TOLOWER \"${VCLIBS_TARGET_ARCHITECTURE}\" VCLIBS_TARGET_ARCHITECTURE)\r\n\r\nif(VCLIBS_TARGET_ARCHITECTURE MATCHES \"^(x86|x64)$\")\r\n enable_language(ASM_MASM)\r\nendif()\r\n\r\n# add the tools subdirectory _before_ we change all the flags\r\nadd_subdirectory(tools EXCLUDE_FROM_ALL)\r\n\r\n# these allow the targets to show up in the top-level\r\n# (as opposed to under the tools subdirectory)\r\nif(TARGET run-format)\r\n add_custom_target(format)\r\n add_dependencies(format run-format)\r\nendif()\r\n\r\nif(TARGET run-validate)\r\n add_custom_target(validate)\r\n add_dependencies(validate run-validate)\r\nendif()\r\n\r\noption(CONFIGURE_TESTING \"Enable testing\" ON)\r\nset(VCLIBS_SUFFIX \"_oss\" CACHE STRING \"suffix for built DLL names to avoid conflicts with distributed DLLs\")\r\n\r\noption(STL_USE_ANALYZE \"Pass the /analyze flag to MSVC\" OFF)\r\noption(STL_ASAN_BUILD \"Build the STL with ASan enabled\" OFF)\r\n\r\nset(VCLIBS_EXPLICIT_MACHINE \"\")\r\n\r\nif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"x86\")\r\n set(VCLIBS_TARGET_ARCHITECTURE \"x86\")\r\n set(VCLIBS_I386_OR_AMD64 \"i386\")\r\n set(VCLIBS_X86_OR_X64 \"x86\")\r\nelseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"x64\")\r\n set(VCLIBS_TARGET_ARCHITECTURE \"x64\")\r\n set(VCLIBS_I386_OR_AMD64 \"amd64\")\r\n set(VCLIBS_X86_OR_X64 \"x64\")\r\nelseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"arm64\")\r\n set(VCLIBS_TARGET_ARCHITECTURE \"arm64\")\r\n set(VCLIBS_I386_OR_AMD64 \"arm64\")\r\n set(VCLIBS_X86_OR_X64 \"arm64\")\r\nelseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"arm64ec\")\r\n set(VCLIBS_TARGET_ARCHITECTURE \"arm64ec\")\r\n set(VCLIBS_I386_OR_AMD64 \"arm64ec\")\r\n set(VCLIBS_X86_OR_X64 \"arm64\") # Yes, really: `%VCToolsInstallDir%lib\\arm64ec` only contains the Link Options\r\n add_compile_options($<$:/arm64EC>)\r\n set(VCLIBS_EXPLICIT_MACHINE \"/machine:arm64ec\")\r\nelse()\r\n message(FATAL_ERROR \"Could not determine target architecture: VCLIBS_TARGET_ARCHITECTURE: ${VCLIBS_TARGET_ARCHITECTURE}\")\r\nendif()\r\n\r\nget_filename_component(TOOLSET_BINARIES_DIR \"${CMAKE_CXX_COMPILER}\" DIRECTORY) # Example: $\\VC\\Tools\\MSVC\\14.23.27931\\bin\\Hostx86\\x86\r\nget_filename_component(TOOLSET_ROOT_DIR \"${TOOLSET_BINARIES_DIR}\" DIRECTORY) # $\\VC\\Tools\\MSVC\\14.23.27931\\bin\\Hostx86\r\nget_filename_component(TOOLSET_ROOT_DIR \"${TOOLSET_ROOT_DIR}\" DIRECTORY) # $\\VC\\Tools\\MSVC\\14.23.27931\\bin\r\nget_filename_component(TOOLSET_ROOT_DIR \"${TOOLSET_ROOT_DIR}\" DIRECTORY) # $\\VC\\Tools\\MSVC\\14.23.27931\r\nset(TOOLSET_LIB \"${TOOLSET_ROOT_DIR}/lib/${VCLIBS_X86_OR_X64}\")\r\nset(STL_ARCHIVE_OUTPUT_DIRECTORY \"${PROJECT_BINARY_DIR}/out/lib/${VCLIBS_I386_OR_AMD64}\")\r\nset(STL_LIBRARY_OUTPUT_DIRECTORY \"${PROJECT_BINARY_DIR}/out/lib/${VCLIBS_I386_OR_AMD64}\")\r\nset(STL_RUNTIME_OUTPUT_DIRECTORY \"${PROJECT_BINARY_DIR}/out/bin/${VCLIBS_I386_OR_AMD64}\")\r\n\r\n# Note that we set _WIN32_WINNT to a high level to make declarations available.\r\nadd_compile_definitions(\r\n _ALLOW_ITERATOR_DEBUG_LEVEL_MISMATCH WIN32_LEAN_AND_MEAN STRICT _CRT_STDIO_ARBITRARY_WIDE_SPECIFIERS\r\n _WIN32_WINNT=0x0A00 NTDDI_VERSION=NTDDI_WIN11_GE)\r\n\r\nif(STL_USE_ANALYZE)\r\n # TRANSITION, Windows SDK 10.0.26100 emits\r\n # \"warning C6553: The annotation for function 'LCMapStringEx' on _Param_(9) does not apply to a value type.\"\r\n # Reported as OS-40109504 \"Windows SDK: incorrect SAL annotations on functions the STL uses\".\r\n add_compile_options(\"$<$:/analyze:autolog-;/wd6553>\")\r\n\r\n if(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"arm64ec\")\r\n # TRANSITION, Windows SDK 10.0.26100 emits\r\n # \"warning C28301: No annotations for first declaration of 'meow'\"\r\n # for various intrinsics when building for ARM64EC.\r\n add_compile_options(\"$<$:/wd28301>\")\r\n endif()\r\nendif()\r\n\r\nset(VCLIBS_DEBUG_OPTIONS \"$<$:/Od>\")\r\nset(VCLIBS_RELEASE_OPTIONS \"$<$:/O2>\")\r\n\r\nif(CONFIGURE_TESTING)\r\n add_subdirectory(tests)\r\nendif()\r\n\r\nif(STL_ASAN_BUILD)\r\n message(STATUS \"Building with ASan enabled\")\r\n add_compile_options(\"$<$:-fsanitize=address;-fno-sanitize-address-vcasan-lib>\")\r\nendif()\r\n\r\nadd_subdirectory(boost-math)\r\nadd_subdirectory(stl)\r\n" }, { "path": "CMakePresets.json", "content": "{\r\n \"version\": 5,\r\n \"cmakeMinimumRequired\": {\r\n \"major\": 3,\r\n \"minor\": 26,\r\n \"patch\": 0\r\n },\r\n \"configurePresets\": [\r\n {\r\n \"name\": \"base\",\r\n \"hidden\": true,\r\n \"generator\": \"Ninja\",\r\n \"binaryDir\": \"${sourceDir}/out/${presetName}\",\r\n \"toolset\": {\r\n \"strategy\": \"external\",\r\n \"value\": \"version=preview\"\r\n }\r\n },\r\n {\r\n \"name\": \"x64\",\r\n \"inherits\": \"base\",\r\n \"description\": \"x64 Ninja Config\",\r\n \"architecture\": {\r\n \"strategy\": \"external\",\r\n \"value\": \"x64\"\r\n },\r\n \"condition\": {\r\n \"type\": \"inList\",\r\n \"string\": \"$env{VSCMD_ARG_TGT_ARCH}\",\r\n \"list\": [\r\n \"x64\",\r\n \"\"\r\n ]\r\n }\r\n },\r\n {\r\n \"name\": \"x86\",\r\n \"inherits\": \"base\",\r\n \"description\": \"x86 Ninja Config\",\r\n \"architecture\": {\r\n \"strategy\": \"external\",\r\n \"value\": \"x86\"\r\n },\r\n \"condition\": {\r\n \"type\": \"inList\",\r\n \"string\": \"$env{VSCMD_ARG_TGT_ARCH}\",\r\n \"list\": [\r\n \"x86\",\r\n \"\"\r\n ]\r\n }\r\n },\r\n {\r\n \"name\": \"ARM64\",\r\n \"inherits\": \"base\",\r\n \"description\": \"ARM64 Ninja Config\",\r\n \"architecture\": {\r\n \"strategy\": \"external\",\r\n \"value\": \"ARM64\"\r\n },\r\n \"condition\": {\r\n \"type\": \"inList\",\r\n \"string\": \"$env{VSCMD_ARG_TGT_ARCH}\",\r\n \"list\": [\r\n \"arm64\",\r\n \"\"\r\n ]\r\n },\r\n \"cacheVariables\": {\r\n \"TESTS_BUILD_ONLY\": true\r\n }\r\n },\r\n {\r\n \"name\": \"ARM64EC\",\r\n \"inherits\": \"base\",\r\n \"description\": \"ARM64EC Ninja Config\",\r\n \"architecture\": {\r\n \"strategy\": \"external\",\r\n \"value\": \"ARM64EC\"\r\n },\r\n \"condition\": {\r\n \"type\": \"inList\",\r\n \"string\": \"$env{VSCMD_ARG_TGT_ARCH}\",\r\n \"list\": [\r\n \"arm64\",\r\n \"\"\r\n ]\r\n },\r\n \"cacheVariables\": {\r\n \"TESTS_BUILD_ONLY\": true,\r\n \"VCLIBS_TARGET_ARCHITECTURE\": \"ARM64EC\"\r\n }\r\n }\r\n ],\r\n \"buildPresets\": [\r\n {\r\n \"name\": \"x64\",\r\n \"configurePreset\": \"x64\",\r\n \"description\": \"Build x64 STL\"\r\n },\r\n {\r\n \"name\": \"x86\",\r\n \"configurePreset\": \"x86\",\r\n \"description\": \"Build x86 STL\"\r\n },\r\n {\r\n \"name\": \"ARM64\",\r\n \"configurePreset\": \"ARM64\",\r\n \"description\": \"Build ARM64 STL\"\r\n },\r\n {\r\n \"name\": \"ARM64EC\",\r\n \"configurePreset\": \"ARM64EC\",\r\n \"description\": \"Build ARM64EC STL\"\r\n }\r\n ]\r\n}\r\n" }, { "path": "CODE_OF_CONDUCT.md", "content": "# Microsoft Open Source Code of Conduct\n\nThis project has adopted the [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/).\n\nResources:\n\n- [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/)\n- [Microsoft Code of Conduct FAQ](https://opensource.microsoft.com/codeofconduct/faq/)\n- Contact [opencode@microsoft.com](mailto:opencode@microsoft.com) with questions or concerns\n- Employees can reach out at [aka.ms/opensource/moderation-support](https://aka.ms/opensource/moderation-support)\n" }, { "path": "CONTRIBUTING.md", "content": "# Contributing\r\n\r\nThis project welcomes contributions and suggestions. Most contributions require you to agree to a\r\nContributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us\r\nthe rights to use your contribution. For details, visit https://cla.opensource.microsoft.com.\r\n\r\nWhen you submit a pull request, a CLA bot will automatically determine whether you need to provide\r\na CLA and decorate the PR appropriately (e.g., status check, comment). Simply follow the instructions\r\nprovided by the bot. You will only need to do this once across all repos using our CLA.\r\n\r\n## Types of Contributions\r\n\r\n### Submitting a Pull Request\r\n\r\nThe STL repo has many open issues that track work which needs to be completed.\r\nIf you're unsure of where to start, you may want to:\r\n\r\n* look for pinned issues, or\r\n* check issues under the labels [`good first issue`][label:\"good first issue\"],\r\n [`high priority`][label:\"high priority\"], or [`help wanted`][label:\"help wanted\"].\r\n\r\n### Reviewing a Pull Request\r\n\r\nWe love code reviews from contributors! Reviews from other contributors can often accelerate the reviewing process\r\nby helping a PR reach a more finished state before maintainers review the changes. As a result, such a PR may require\r\nfewer maintainer review iterations before reaching a \"Ready to Merge\" state.\r\n\r\nTo gain insight into our Code Review process, you can check out:\r\n\r\n* pull requests which are [undergoing review][review:changes-requested],\r\n* [Advice for Reviewing Pull Requests][wiki:advice-for-reviewing], and\r\n* [Code Review Videos][wiki:videos].\r\n\r\n## PR Checklist\r\n\r\nBefore submitting a pull request, please ensure:\r\n\r\n1. Any non-standard identifiers in product code (including local variables, exposition-only members, etc.)\r\n begin with an underscore and a capital letter, as per [\\[lex.name\\]/3.1][].\r\n\r\n2. Your changes don't affect the ABI for any type or function that a user may use (including adding or removing\r\n non-static data members, adding or removing virtual member functions, changing whether a type is an aggregate\r\n or trivially copyable, etc.).\r\n\r\n3. Your changes are written from scratch using only acceptable sources:\r\n * this repository,\r\n * the C++ Working Draft (including any cited standards),\r\n * other WG21 papers (excluding reference implementations outside of proposed standard wording),\r\n * LWG issues, or\r\n * a project listed in [NOTICE.txt][] (make sure to cite the project in the PR description!).\r\n\r\nIf your changes are derived from any other project, you _must_ mention it in the pull request description,\r\nso we can determine whether the license is compatible and whether any other steps need to be taken.\r\n\r\n# Code of Conduct\r\n\r\nThis project has adopted the [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/).\r\n\r\nSee [CODE_OF_CONDUCT.md](CODE_OF_CONDUCT.md) for more information.\r\n\r\n[label:\"good first issue\"]:\r\n https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3A%22good+first+issue%22\r\n[label:\"high priority\"]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3A%22high+priority%22\r\n[label:\"help wanted\"]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3A%22help+wanted%22\r\n[review:changes-requested]: https://github.com/microsoft/STL/pulls?q=is%3Apr+is%3Aopen+review%3Achanges-requested\r\n[wiki:advice-for-reviewing]: https://github.com/microsoft/STL/wiki/Advice-for-Reviewing-Pull-Requests\r\n[NOTICE.txt]: https://github.com/microsoft/STL/blob/main/NOTICE.txt\r\n[wiki:videos]: https://github.com/microsoft/STL/wiki/Code-Review-Videos\r\n[\\[lex.name\\]/3.1]: https://eel.is/c++draft/lex.name#3.1\r\n" }, { "path": "LICENSE.txt", "content": "The Microsoft C++ Standard Library is under the Apache License v2.0 with LLVM Exception:\r\n\r\n Apache License\r\n Version 2.0, January 2004\r\n http://www.apache.org/licenses/\r\n\r\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\r\n\r\n 1. Definitions.\r\n\r\n \"License\" shall mean the terms and conditions for use, reproduction,\r\n and distribution as defined by Sections 1 through 9 of this document.\r\n\r\n \"Licensor\" shall mean the copyright owner or entity authorized by\r\n the copyright owner that is granting the License.\r\n\r\n \"Legal Entity\" shall mean the union of the acting entity and all\r\n other entities that control, are controlled by, or are under common\r\n control with that entity. For the purposes of this definition,\r\n \"control\" means (i) the power, direct or indirect, to cause the\r\n direction or management of such entity, whether by contract or\r\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\r\n outstanding shares, or (iii) beneficial ownership of such entity.\r\n\r\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\r\n exercising permissions granted by this License.\r\n\r\n \"Source\" form shall mean the preferred form for making modifications,\r\n including but not limited to software source code, documentation\r\n source, and configuration files.\r\n\r\n \"Object\" form shall mean any form resulting from mechanical\r\n transformation or translation of a Source form, including but\r\n not limited to compiled object code, generated documentation,\r\n and conversions to other media types.\r\n\r\n \"Work\" shall mean the work of authorship, whether in Source or\r\n Object form, made available under the License, as indicated by a\r\n copyright notice that is included in or attached to the work\r\n (an example is provided in the Appendix below).\r\n\r\n \"Derivative Works\" shall mean any work, whether in Source or Object\r\n form, that is based on (or derived from) the Work and for which the\r\n editorial revisions, annotations, elaborations, or other modifications\r\n represent, as a whole, an original work of authorship. For the purposes\r\n of this License, Derivative Works shall not include works that remain\r\n separable from, or merely link (or bind by name) to the interfaces of,\r\n the Work and Derivative Works thereof.\r\n\r\n \"Contribution\" shall mean any work of authorship, including\r\n the original version of the Work and any modifications or additions\r\n to that Work or Derivative Works thereof, that is intentionally\r\n submitted to Licensor for inclusion in the Work by the copyright owner\r\n or by an individual or Legal Entity authorized to submit on behalf of\r\n the copyright owner. For the purposes of this definition, \"submitted\"\r\n means any form of electronic, verbal, or written communication sent\r\n to the Licensor or its representatives, including but not limited to\r\n communication on electronic mailing lists, source code control systems,\r\n and issue tracking systems that are managed by, or on behalf of, the\r\n Licensor for the purpose of discussing and improving the Work, but\r\n excluding communication that is conspicuously marked or otherwise\r\n designated in writing by the copyright owner as \"Not a Contribution.\"\r\n\r\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\r\n on behalf of whom a Contribution has been received by Licensor and\r\n subsequently incorporated within the Work.\r\n\r\n 2. Grant of Copyright License. Subject to the terms and conditions of\r\n this License, each Contributor hereby grants to You a perpetual,\r\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\r\n copyright license to reproduce, prepare Derivative Works of,\r\n publicly display, publicly perform, sublicense, and distribute the\r\n Work and such Derivative Works in Source or Object form.\r\n\r\n 3. Grant of Patent License. Subject to the terms and conditions of\r\n this License, each Contributor hereby grants to You a perpetual,\r\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\r\n (except as stated in this section) patent license to make, have made,\r\n use, offer to sell, sell, import, and otherwise transfer the Work,\r\n where such license applies only to those patent claims licensable\r\n by such Contributor that are necessarily infringed by their\r\n Contribution(s) alone or by combination of their Contribution(s)\r\n with the Work to which such Contribution(s) was submitted. If You\r\n institute patent litigation against any entity (including a\r\n cross-claim or counterclaim in a lawsuit) alleging that the Work\r\n or a Contribution incorporated within the Work constitutes direct\r\n or contributory patent infringement, then any patent licenses\r\n granted to You under this License for that Work shall terminate\r\n as of the date such litigation is filed.\r\n\r\n 4. Redistribution. You may reproduce and distribute copies of the\r\n Work or Derivative Works thereof in any medium, with or without\r\n modifications, and in Source or Object form, provided that You\r\n meet the following conditions:\r\n\r\n (a) You must give any other recipients of the Work or\r\n Derivative Works a copy of this License; and\r\n\r\n (b) You must cause any modified files to carry prominent notices\r\n stating that You changed the files; and\r\n\r\n (c) You must retain, in the Source form of any Derivative Works\r\n that You distribute, all copyright, patent, trademark, and\r\n attribution notices from the Source form of the Work,\r\n excluding those notices that do not pertain to any part of\r\n the Derivative Works; and\r\n\r\n (d) If the Work includes a \"NOTICE\" text file as part of its\r\n distribution, then any Derivative Works that You distribute must\r\n include a readable copy of the attribution notices contained\r\n within such NOTICE file, excluding those notices that do not\r\n pertain to any part of the Derivative Works, in at least one\r\n of the following places: within a NOTICE text file distributed\r\n as part of the Derivative Works; within the Source form or\r\n documentation, if provided along with the Derivative Works; or,\r\n within a display generated by the Derivative Works, if and\r\n wherever such third-party notices normally appear. The contents\r\n of the NOTICE file are for informational purposes only and\r\n do not modify the License. You may add Your own attribution\r\n notices within Derivative Works that You distribute, alongside\r\n or as an addendum to the NOTICE text from the Work, provided\r\n that such additional attribution notices cannot be construed\r\n as modifying the License.\r\n\r\n You may add Your own copyright statement to Your modifications and\r\n may provide additional or different license terms and conditions\r\n for use, reproduction, or distribution of Your modifications, or\r\n for any such Derivative Works as a whole, provided Your use,\r\n reproduction, and distribution of the Work otherwise complies with\r\n the conditions stated in this License.\r\n\r\n 5. Submission of Contributions. Unless You explicitly state otherwise,\r\n any Contribution intentionally submitted for inclusion in the Work\r\n by You to the Licensor shall be under the terms and conditions of\r\n this License, without any additional terms or conditions.\r\n Notwithstanding the above, nothing herein shall supersede or modify\r\n the terms of any separate license agreement you may have executed\r\n with Licensor regarding such Contributions.\r\n\r\n 6. Trademarks. This License does not grant permission to use the trade\r\n names, trademarks, service marks, or product names of the Licensor,\r\n except as required for reasonable and customary use in describing the\r\n origin of the Work and reproducing the content of the NOTICE file.\r\n\r\n 7. Disclaimer of Warranty. Unless required by applicable law or\r\n agreed to in writing, Licensor provides the Work (and each\r\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\r\n implied, including, without limitation, any warranties or conditions\r\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\r\n PARTICULAR PURPOSE. You are solely responsible for determining the\r\n appropriateness of using or redistributing the Work and assume any\r\n risks associated with Your exercise of permissions under this License.\r\n\r\n 8. Limitation of Liability. In no event and under no legal theory,\r\n whether in tort (including negligence), contract, or otherwise,\r\n unless required by applicable law (such as deliberate and grossly\r\n negligent acts) or agreed to in writing, shall any Contributor be\r\n liable to You for damages, including any direct, indirect, special,\r\n incidental, or consequential damages of any character arising as a\r\n result of this License or out of the use or inability to use the\r\n Work (including but not limited to damages for loss of goodwill,\r\n work stoppage, computer failure or malfunction, or any and all\r\n other commercial damages or losses), even if such Contributor\r\n has been advised of the possibility of such damages.\r\n\r\n 9. Accepting Warranty or Additional Liability. While redistributing\r\n the Work or Derivative Works thereof, You may choose to offer,\r\n and charge a fee for, acceptance of support, warranty, indemnity,\r\n or other liability obligations and/or rights consistent with this\r\n License. However, in accepting such obligations, You may act only\r\n on Your own behalf and on Your sole responsibility, not on behalf\r\n of any other Contributor, and only if You agree to indemnify,\r\n defend, and hold each Contributor harmless for any liability\r\n incurred by, or claims asserted against, such Contributor by reason\r\n of your accepting any such warranty or additional liability.\r\n\r\n END OF TERMS AND CONDITIONS\r\n\r\n APPENDIX: How to apply the Apache License to your work.\r\n\r\n To apply the Apache License to your work, attach the following\r\n boilerplate notice, with the fields enclosed by brackets \"[]\"\r\n replaced with your own identifying information. (Don't include\r\n the brackets!) The text should be enclosed in the appropriate\r\n comment syntax for the file format. We also recommend that a\r\n file or class name and description of purpose be included on the\r\n same \"printed page\" as the copyright notice for easier\r\n identification within third-party archives.\r\n\r\n Copyright [yyyy] [name of copyright owner]\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http://www.apache.org/licenses/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n\r\n---- LLVM Exceptions to the Apache 2.0 License ----\r\n\r\nAs an exception, if, as a result of your compiling your source code, portions\r\nof this Software are embedded into an Object form of such source code, you\r\nmay redistribute such embedded portions in such Object form without complying\r\nwith the conditions of Sections 4(a), 4(b) and 4(d) of the License.\r\n\r\nIn addition, if you combine or link compiled forms of this Software with\r\nsoftware that is licensed under the GPLv2 (\"Combined Software\") and if a\r\ncourt of competent jurisdiction determines that the patent provision (Section\r\n3), the indemnity provision (Section 9) or other Section of the License\r\nconflicts with the conditions of the GPLv2, you may retroactively and\r\nprospectively choose to deem waived or otherwise exclude such Section(s) of\r\nthe License, but only in their entirety and only with respect to the Combined\r\nSoftware.\r\n" }, { "path": "NOTICE.txt", "content": "Microsoft C++ Standard Library\r\n\r\nCopyright (c) Microsoft Corporation\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n\r\n\r\n---- LLVM Exceptions to the Apache 2.0 License ----\r\n\r\nAs an exception, if, as a result of your compiling your source code, portions\r\nof this Software are embedded into an Object form of such source code, you\r\nmay redistribute such embedded portions in such Object form without complying\r\nwith the conditions of Sections 4(a), 4(b) and 4(d) of the License.\r\n\r\nIn addition, if you combine or link compiled forms of this Software with\r\nsoftware that is licensed under the GPLv2 (\"Combined Software\") and if a\r\ncourt of competent jurisdiction determines that the patent provision (Section\r\n3), the indemnity provision (Section 9) or other Section of the License\r\nconflicts with the conditions of the GPLv2, you may retroactively and\r\nprospectively choose to deem waived or otherwise exclude such Section(s) of\r\nthe License, but only in their entirety and only with respect to the Combined\r\nSoftware.\r\n\r\n----------------------------------------------------\r\n\r\nIn addition, certain files include the notices provided below.\r\n\r\n\r\n\r\n// Copyright 2018 Ulf Adams\r\n// Copyright (c) Microsoft Corporation. All rights reserved.\r\n\r\n// Boost Software License - Version 1.0 - August 17th, 2003\r\n\r\n// Permission is hereby granted, free of charge, to any person or organization\r\n// obtaining a copy of the software and accompanying documentation covered by\r\n// this license (the \"Software\") to use, reproduce, display, distribute,\r\n// execute, and transmit the Software, and to prepare derivative works of the\r\n// Software, and to permit third-parties to whom the Software is furnished to\r\n// do so, all subject to the following:\r\n\r\n// The copyright notices in the Software and this entire statement, including\r\n// the above license grant, this restriction and the following disclaimer,\r\n// must be included in all copies of the Software, in whole or in part, and\r\n// all derivative works of the Software, unless such copies or derivative\r\n// works are solely in the form of machine-executable object code generated by\r\n// a source language processor.\r\n\r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\r\n// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\r\n// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\r\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\r\n// DEALINGS IN THE SOFTWARE.\r\n\r\n----------------------\r\n\r\n/*\r\n* This file is derived from software bearing the following\r\n* restrictions:\r\n*\r\n* (c) Copyright William E. Kempf 2001\r\n*\r\n* Permission to use, copy, modify, distribute and sell this\r\n* software and its documentation for any purpose is hereby\r\n* granted without fee, provided that the above copyright\r\n* notice appear in all copies and that both that copyright\r\n* notice and this permission notice appear in supporting\r\n* documentation. William E. Kempf makes no representations\r\n* about the suitability of this software for any purpose.\r\n* It is provided \"as is\" without express or implied warranty.\r\n*/\r\n\r\n----------------------\r\n\r\n// NOTE:\r\n// The conversion data in this header has been derived by Dinkumware\r\n// from a Unicode, Inc. file with the preamble reproduced below, under\r\n// the grant of right described in that preamble. This header contains\r\n// no other material from that file.\r\n//\r\n// Copyright (c) 1994-2011 Unicode, Inc. All Rights reserved.\r\n//\r\n// This file is provided as-is by Unicode, Inc. (The Unicode Consortium).\r\n// No claims are made as to fitness for any particular purpose. No\r\n// warranties of any kind are expressed or implied. The recipient\r\n// agrees to determine applicability of information provided. If this\r\n// file has been provided on magnetic media by Unicode, Inc., the sole\r\n// remedy for any claim will be exchange of defective media within 90\r\n// days of receipt.\r\n//\r\n// Unicode, Inc. hereby grants the right to freely use the information\r\n// supplied in this file in the creation of products supporting the\r\n// Unicode Standard, and to make copies of this file in any form for\r\n// internal or external distribution as long as this notice remains\r\n// attached.\r\n\r\n----------------------\r\n\r\n/// NOTE:\r\n// The conversion data in this header has been derived by Dinkumware\r\n// from a Unicode, Inc. file with the preamble reproduced below, under\r\n// the grant of right described in that preamble. This header contains\r\n// no other material from that file.\r\n//\r\n// Copyright (c) 1991-1994 Unicode, Inc. All Rights reserved.\r\n//\r\n// This file is provided as-is by Unicode, Inc. (The Unicode Consortium).\r\n// No claims are made as to fitness for any particular purpose. No\r\n// warranties of any kind are expressed or implied. The recipient\r\n// agrees to determine applicability of information provided. If this\r\n// file has been provided on magnetic media by Unicode, Inc., the sole\r\n// remedy for any claim will be exchange of defective media within 90\r\n// days of receipt.\r\n//\r\n// Recipient is granted the right to make copies in any form for\r\n// internal distribution and to freely use the information supplied\r\n// in the creation of products supporting Unicode.\r\n\r\n----------------------\r\n\r\n//===----------------------------------------------------------------------===//\r\n//\r\n// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\r\n// See https://llvm.org/LICENSE.txt for license information.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n//\r\n//===----------------------------------------------------------------------===//\r\n\r\n----------------------\r\n\r\n// Copyright (c) 2012 - present, Victor Zverovich\r\n//\r\n// Permission is hereby granted, free of charge, to any person obtaining\r\n// a copy of this software and associated documentation files (the\r\n// \"Software\"), to deal in the Software without restriction, including\r\n// without limitation the rights to use, copy, modify, merge, publish,\r\n// distribute, sublicense, and/or sell copies of the Software, and to\r\n// permit persons to whom the Software is furnished to do so, subject to\r\n// the following conditions:\r\n//\r\n// The above copyright notice and this permission notice shall be\r\n// included in all copies or substantial portions of the Software.\r\n\r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\r\n// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\r\n// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\r\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n//\r\n// --- Optional exception to the license ---\r\n//\r\n// As an exception, if, as a result of your compiling your source code, portions\r\n// of this Software are embedded into a machine-executable object form of such\r\n// source code, you may redistribute such embedded portions in such object form\r\n// without including the above copyright and permission notices.\r\n\r\n----------------------\r\n\r\n// UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE\r\n//\r\n// See Terms of Use \r\n// for definitions of Unicode Inc.'s Data Files and Software.\r\n//\r\n// NOTICE TO USER: Carefully read the following legal agreement.\r\n// BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S\r\n// DATA FILES (\"DATA FILES\"), AND/OR SOFTWARE (\"SOFTWARE\"),\r\n// YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE\r\n// TERMS AND CONDITIONS OF THIS AGREEMENT.\r\n// IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE\r\n// THE DATA FILES OR SOFTWARE.\r\n//\r\n// COPYRIGHT AND PERMISSION NOTICE\r\n//\r\n// Copyright (c) 1991-2022 Unicode, Inc. All rights reserved.\r\n// Distributed under the Terms of Use in https://www.unicode.org/copyright.html.\r\n//\r\n// Permission is hereby granted, free of charge, to any person obtaining\r\n// a copy of the Unicode data files and any associated documentation\r\n// (the \"Data Files\") or Unicode software and any associated documentation\r\n// (the \"Software\") to deal in the Data Files or Software\r\n// without restriction, including without limitation the rights to use,\r\n// copy, modify, merge, publish, distribute, and/or sell copies of\r\n// the Data Files or Software, and to permit persons to whom the Data Files\r\n// or Software are furnished to do so, provided that either\r\n// (a) this copyright and permission notice appear with all copies\r\n// of the Data Files or Software, or\r\n// (b) this copyright and permission notice appear in associated\r\n// Documentation.\r\n//\r\n// THE DATA FILES AND SOFTWARE ARE PROVIDED \"AS IS\", WITHOUT WARRANTY OF\r\n// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE\r\n// WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n// NONINFRINGEMENT OF THIRD PARTY RIGHTS.\r\n// IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS\r\n// NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL\r\n// DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,\r\n// DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\r\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\n// PERFORMANCE OF THE DATA FILES OR SOFTWARE.\r\n//\r\n// Except as contained in this notice, the name of a copyright holder\r\n// shall not be used in advertising or otherwise to promote the sale,\r\n// use or other dealings in these Data Files or Software without prior\r\n// written authorization of the copyright holder.\r\n" }, { "path": "README.md", "content": "# Microsoft's C++ Standard Library\r\n\r\nThis is the official repository for Microsoft's implementation of the C++ Standard Library (also known as the STL),\r\nwhich ships as part of the MSVC toolset and the Visual Studio IDE.\r\n\r\n* Our [Changelog][] tracks which updates to this repository appear in each VS release.\r\n* Our [Status Chart][] displays our overall progress over time.\r\n* Join our [Discord server][].\r\n* [![CI Status Badge][STL-CI-badge]][STL-CI-link] (STL-CI build status)\r\n* [![ASan CI Status Badge][STL-ASan-CI-badge]][STL-ASan-CI-link] (STL-ASan-CI build status)\r\n\r\n# What This Repo Is Useful For\r\n\r\nIf you're a programmer who just wants to use the STL, you **don't** need this repo. Simply install the Visual Studio IDE\r\nand select the \"Desktop development with C++\" workload.\r\n\r\nIf you want to participate in the STL's development, welcome! You can report issues, comment on pull requests, and learn\r\nabout what we're working on. You can also submit pull requests to fix bugs or add features: see [CONTRIBUTING.md][] for\r\nmore information.\r\n\r\nFinally, you can take our code and use it in other apps and libraries (according to the terms of our license, like\r\neverything else).\r\n\r\n# GitHub Migration Status\r\n\r\nWe're in the process of moving all of our work on the STL to GitHub. Current status:\r\n\r\n* Code: **Done.** Our source code is available under the Apache License v2.0 with LLVM Exception. (See\r\n[LICENSE.txt][] and [NOTICE.txt][] for more information.)\r\n\r\n* Build System: **In progress.** We're working on a CMake build system, which is currently capable of building one\r\nflavor of the STL (native desktop). We need to extend this to build all of the flavors required for the MSVC toolset\r\n(e.g. `/clr`, `/clr:pure`, OneCore, Spectre). Until that's done, we're keeping our legacy build system around in the\r\n`stl/msbuild` subdirectory. (We're keeping those files in this repo, even though they're unusable outside of Microsoft,\r\nbecause they need to be updated whenever source files are added/renamed/deleted. We'll delete the legacy machinery as\r\nsoon as possible.)\r\n\r\n* Tests: **In progress.** We rely on three test suites: std, tr1, and [libcxx][]. We've partially ported std and tr1,\r\nand fully ported libcxx to run under [lit][] using the various configurations/compilers we test internally.\r\n\r\n* Continuous Integration: **In progress.** We've set up Azure Pipelines to validate changes to the repository.\r\nCurrently, it builds the STL for x64, x86, ARM64, and ARM64EC. Also, it strictly verifies that all of our\r\nfiles have been formatted with [clang-format][] and follow our other whitespace conventions.\r\n\r\n* Contribution Guidelines: **Coming soon.** Working on the STL's code involves following many rules. We have codebase\r\nconventions, Standard requirements, Microsoft-specific requirements, binary compatibility (ABI) requirements, and more.\r\nWe're eager to begin accepting features and fixes from the community, but in addition to setting up a CI system, we need\r\nto write down all of the rules that are currently stored in our brains. (The ABI rules may be useful to other C++\r\nlibraries.)\r\n\r\n* Issues: **In progress.** We're going to use GitHub issues to track all of the things that we need to work on. This\r\nincludes C++20 features, [LWG issues][], conformance bugs, performance improvements, and other todos. There are\r\napproximately 200 active bugs in the STL's Microsoft-internal database; we need to manually replicate all of them to\r\nGitHub issues. Currently, the [cxx20 tag][] and [LWG tag][] are done; every remaining work item is tracked by a GitHub\r\nissue. The [bug tag][] and [enhancement tag][] are being populated.\r\n\r\n* Plans: **In progress.** We're writing up our [Roadmap][].\r\n\r\n# Goals\r\n\r\nWe're implementing the latest C++ Working Draft, currently [N5032][], which will eventually become the next C++\r\nInternational Standard. The terms Working Draft (WD) and Working Paper (WP) are interchangeable; we often\r\ninformally refer to these drafts as \"the Standard\" while being aware of the difference. (There are other relevant\r\nStandards; for example, supporting `/std:c++14` and `/std:c++17` involves understanding how the C++14 and C++17\r\nStandards differ from the Working Paper, and we often need to refer to the C Standard Library and ECMAScript regular\r\nexpression specifications.)\r\n\r\nOur primary goals are conformance, performance, usability, and compatibility.\r\n\r\n* Conformance: The Working Paper is a moving target; as features and LWG issue resolutions are added, we need to\r\nimplement them. That can involve a lot of work because the STL is required to behave in very specific ways and to\r\nhandle users doing very unusual things.\r\n\r\n* Performance: The STL needs to be extremely fast at runtime; speed is one of C++'s core strengths and most C++\r\nprograms use the STL extensively. As a result, we spend more time on optimization than most general-purpose libraries.\r\n(However, we're wary of changes that improve some scenarios at the expense of others, or changes that make code\r\nsignificantly more complicated and fragile. That is, there's a \"complexity budget\" that must be spent carefully.)\r\n\r\n* Usability: This includes parts of the programming experience like compiler throughput, diagnostic messages, and\r\ndebugging checks. For example, we've extensively marked the STL with `[[nodiscard]]` attributes because this helps\r\nprogrammers avoid bugs.\r\n\r\n* Compatibility: This includes binary compatibility and source compatibility. We're keeping VS 2026 binary-compatible\r\nwith VS 2015-2022, which restricts what we can change in VS 2026 updates. (We've found that significant changes\r\nare possible even though other changes are impossible, which we'll be documenting in our Contribution Guidelines soon.)\r\nWhile there are a few exceptions to this rule (e.g. if a feature is added to the Working Paper, we implement it, and\r\nthen the feature is significantly changed before the International Standard is finalized, we reserve the right to break\r\nbinary compatibility because `/std:c++latest` offers an experimental preview of such features), binary compatibility\r\ngenerally overrides all other considerations, even conformance. Source compatibility refers to being able to\r\nsuccessfully recompile user code without changes. We consider source compatibility to be important, but not\r\nall-important; breaking source compatibility can be an acceptable cost if done for the right reasons in the right way\r\n(e.g. in a controlled manner with escape hatches).\r\n\r\n# Non-Goals\r\n\r\nThere are things that we aren't interested in doing with this project, for various reasons (most importantly, we need to\r\nfocus development effort on our goals). Some examples:\r\n\r\n* Non-goal: Porting to other platforms.\r\n\r\n* Non-goal: Adding non-Standard extensions.\r\n\r\n* Non-goal: Implementing Technical Specifications. (We're prioritizing features in the Working Paper. Occasionally, we\r\nmight implement some or all of a TS, often when we're working on the specification itself.)\r\n\r\nIf you're proposing a feature to WG21 (the C++ Standardization Committee), you're welcome (and encouraged!) to use our\r\ncode as a base for a proof-of-concept implementation. These non-goals simply mean that we're unable to consider pull\r\nrequests for a proposed feature until it has been voted into a Working Paper. After that happens, we'll be delighted to\r\nreview a production-ready pull request.\r\n\r\n# Reporting Issues\r\n\r\nYou can report STL bugs here, where they'll be directly reviewed by maintainers. You can also report STL bugs through\r\n[Developer Community][], or the VS IDE (Help > Send Feedback > Report a Problem...).\r\n\r\n**Please help us** efficiently process bug reports by following these rules:\r\n\r\n* Only STL bugs should be reported here. If it's a bug in the compiler, CRT, or IDE, please report it through Developer\r\nCommunity or Report A Problem. If it's a bug in the Windows SDK, please report it through the [Feedback Hub][hub] app.\r\nIf you aren't sure, try to reduce your test case and see if you can eliminate the STL's involvement while still\r\nreproducing the bug.\r\n\r\n* You should be reasonably confident that you're looking at an actual implementation bug, instead of undefined behavior\r\nor surprising-yet-Standard behavior. Comparing against other implementations can help (but remember that implementations\r\ncan differ while conforming to the Standard); try [Compiler Explorer][]. If you still aren't\r\nsure, ask the nearest C++ expert.\r\n\r\n* You should prepare a self-contained command-line test case, ideally as small as possible. We need a source file, a\r\ncommand line, what happened (e.g. a compiler error, runtime misbehavior), and what you expected to happen. By\r\n\"self-contained\", we mean that your source file has to avoid including code that we don't have. Ideally, only CRT and\r\nSTL headers should be included. If you have to include other MSVC libraries, or the Windows SDK, to trigger an STL bug,\r\nthat's okay. But if you need parts of your own source code to trigger the STL bug, you need to extract that for us. (On\r\nDeveloper Community, we'll accept zipped IDE projects if you have no other way to reproduce a bug, but this is very\r\ntime-consuming for us to reduce.)\r\n\r\n* A good title is helpful. We prefer \"``: Short description of your issue\". You don't usually need to\r\nmention `std::` or C++. For example, \"``: `is_cute` should be true for `enum class FluffyKittens`\".\r\n\r\nIt's okay if you report an apparent STL bug that turns out to be a compiler bug or surprising-yet-Standard behavior.\r\nJust try to follow these rules, so we can spend more time fixing bugs and implementing features.\r\n\r\n# Visual Studio Installer Prerequisites\r\n\r\n* Install [VS 2026 Insiders][] and keep it up to date.\r\n + **You must install the Insiders IDE and the Preview build tools for STL development.** *See Note 1 below.*\r\n + Select the \"Desktop development with C++\" workload.\r\n + Select the following components at a minimum:\r\n - \"MSVC Build Tools for x64/x86 (Preview)\"\r\n - \"C++ CMake tools for Windows\"\r\n - \"MSVC AddressSanitizer\"\r\n - \"Windows 11 SDK (10.0.26100)\" or later\r\n - \"C++ Clang tools for Windows (20.1.8 - x64/x86)\"\r\n - *Optional, see Note 2 below:* \"MSVC Build Tools for ARM64/ARM64EC (Preview)\"\r\n* Install [Python][] 3.14.3 or later.\r\n + Select \"Add python.exe to PATH\" if you want to follow the instructions below that invoke `python`.\r\n Otherwise, you should be familiar with alternative methods.\r\n\r\n*Note 1:* The STL and the compiler ship together, and we frequently need recently implemented\r\ncompiler fixes and features, so the Latest build tools (i.e. latest production) are too old.\r\nBecause the Insiders IDE supports having the Latest and Preview build tools installed simultaneously,\r\nyou need to ensure that you're using the Preview build tools. If you build with the IDE, we've arranged for\r\nthis to happen automatically. If you build with the Command Prompt, you need to pass `-vcvars_ver=preview`\r\nas explained below. For more info, read the [C++ Team Blog post][preview] that announced this release process.\r\n\r\n*Note 2:* The x64/x86 build tools are usually sufficient.\r\nYou'll need the ARM64/ARM64EC build tools if you're working with architecture-sensitive code.\r\nFor example, `` has conditionally compiled code for the `_M_ARM64` and `_M_ARM64EC` predefined macros.\r\n\r\n# How To Build With The Visual Studio IDE\r\n\r\n1. Open Visual Studio and select \"Clone a repository\".\r\n2. Enter `https://github.com/microsoft/STL.git` as the repository location. Choose a local path. Click \"Clone\".\r\n3. File > Open > Folder... > Select the folder that you just cloned the repository into.\r\n4. Use the IDE's dropdown menu to choose the architecture you want to build. We recommend x64 for general development.\r\n5. Build > Build All.\r\n\r\n# How To Build With The Command Prompt\r\n\r\n1. Open a command prompt.\r\n2. Change directories to a location where you'd like a clone of this STL repository.\r\n3. `git clone https://github.com/microsoft/STL.git --recurse-submodules`\r\n4. `pushd STL`\r\n\r\nThe following instructions assume that you're starting in the previously cloned `STL` directory.\r\nIf you installed VS to a non-default location, change the `vcvarsall.bat` paths below accordingly.\r\n\r\nTo build the x64 target (recommended):\r\n\r\n1. `pushd \"%ProgramFiles%\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build\"`\r\n1. `vcvarsall.bat x64 -vcvars_ver=preview`\r\n1. `popd`\r\n1. `cmake --preset x64`\r\n1. `cmake --build --preset x64`\r\n\r\nTo build the x86 target:\r\n\r\n1. `pushd \"%ProgramFiles%\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build\"`\r\n1. `vcvarsall.bat x86 -vcvars_ver=preview`\r\n1. `popd`\r\n1. `cmake --preset x86`\r\n1. `cmake --build --preset x86`\r\n\r\nTo build the ARM64 target:\r\n\r\n1. `pushd \"%ProgramFiles%\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build\"`\r\n1. `vcvarsall.bat x64_arm64 -vcvars_ver=preview`\r\n1. `popd`\r\n1. `cmake --preset ARM64`\r\n1. `cmake --build --preset ARM64`\r\n\r\nTo build the ARM64EC target:\r\n\r\n1. `pushd \"%ProgramFiles%\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build\"`\r\n1. `vcvarsall.bat x64_arm64 -vcvars_ver=preview`\r\n1. `popd`\r\n1. `cmake --preset ARM64EC`\r\n1. `cmake --build --preset ARM64EC`\r\n\r\n# How To Consume\r\n\r\nConsumption of the built library is largely based on the build system you're using. There are at least 2 directories\r\nyou need to hook up. Assuming you built the x64 target with the Visual Studio IDE, with the STL repository cloned to\r\n`C:\\Dev\\STL`, build outputs will end up at `C:\\Dev\\STL\\out\\x64\\out`. Ensure that the `inc` directory is searched\r\nfor headers, and that `lib\\{architecture}` is searched for link libraries, before any defaults supplied by MSVC. The\r\nnames of the import and static libraries are the same as those that ship with MSVC. As a result, the compiler `/MD`,\r\n`/MDd`, `/MT`, or `/MTd` switches will work without modification of your build scripts or command-line muscle memory.\r\n\r\nShould you choose to use the DLL flavors, the DLLs to deploy are built to `bin\\{architecture}`. Note that the DLLs\r\ngenerated by the CMake build system here have a suffix, defaulting to `_oss`, which distinguishes them from the binaries\r\nthat ship with MSVC. That avoids any conflict with the DLLs installed by the [redistributables][] into System32 and\r\nensures that other components wanting to be a \"guest in your process\", like print drivers and shell extensions, see the\r\nexport surface of the STL they were built with. Otherwise, the \"`msvcp140.dll`\" you deployed in the same directory as\r\nyour .exe would \"win\" over the versions in System32.\r\n\r\nThe compiler looks for include directories according to the `INCLUDE` environment variable, and the linker looks for\r\nimport library directories according to the `LIB` environment variable, and the Windows loader will (eventually) look\r\nfor DLL dependencies according to directories in the `PATH` environment variable.\r\nThe build generates a batch script named `set_environment.bat` in the output directory. If you run this script,\r\nit will insert the proper directories into the `INCLUDE`, `LIB`, and `PATH` environment\r\nvariables to ensure that the built headers and libraries are used.\r\n\r\n## Complete Example Using x64 DLL Flavor\r\n\r\n```\r\nC:\\Temp>pushd D:\\GitHub\\STL\r\n\r\nD:\\GitHub\\STL>pushd \"%ProgramFiles%\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build\"\r\n\r\nC:\\Program Files\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build>vcvarsall.bat x64 -vcvars_ver=preview\r\n**********************************************************************\r\n** Visual Studio 2026 Developer Command Prompt v18.4.0-insiders\r\n** Copyright (c) 2026 Microsoft Corporation\r\n**********************************************************************\r\n[vcvarsall.bat] Environment initialized for: 'x64'\r\n\r\nC:\\Program Files\\Microsoft Visual Studio\\18\\Insiders\\VC\\Auxiliary\\Build>popd\r\n\r\nD:\\GitHub\\STL>cmake --preset x64\r\n[...]\r\n-- Build files have been written to: D:/GitHub/STL/out/x64\r\n\r\nD:\\GitHub\\STL>cmake --build --preset x64\r\n[762/762] Linking CXX static library out\\lib\\amd64\\libcpmtd0.lib\r\n\r\nD:\\GitHub\\STL>out\\x64\\set_environment.bat\r\n\r\nD:\\GitHub\\STL>popd\r\n\r\nC:\\Temp>type .\\example.cpp\r\n```\r\n```cpp\r\n#include \r\n\r\nint main() {\r\n std::println(\"Hello STL OSS world!\");\r\n}\r\n```\r\n```\r\nC:\\Temp>cl /EHsc /nologo /W4 /WX /MDd /std:c++latest .\\example.cpp\r\nexample.cpp\r\n\r\nC:\\Temp>.\\example.exe\r\nHello STL OSS world!\r\n\r\nC:\\Temp>dumpbin /DEPENDENTS .\\example.exe | findstr msvcp\r\n msvcp140d_oss.dll\r\n```\r\n\r\n# How To Run The Tests\r\n\r\nOur tests are currently split across three test suites that are located at `tests\\std`, `tests\\tr1`, and\r\n`llvm-project\\libcxx\\test\\std`. The test runner `${PROJECT_BINARY_DIR}\\tests\\utils\\stl-lit\\stl-lit.py` accepts paths to\r\ndirectories in the test suites and runs all tests located in the subtree rooted at those paths. This can mean executing\r\nthe entirety of a single test suite, running all tests under a category in `libcxx`, or running a single test in `std`\r\nand `tr1`.\r\n\r\nSome useful `stl-lit.py` options:\r\n* `-v` (verbose) tells `stl-lit.py` to show us output from failed test cases.\r\n* `-Dnotags=ASAN` disables the \"extra ASan configs\" that we typically run only in CI. This is useful to limit runtime\r\n for full validation runs, but often omitted when running just a few test cases to enable the extra ASan coverage.\r\n\r\n## Examples\r\n\r\nThese examples assume that your current directory is `C:\\Dev\\STL\\out\\x64`.\r\n\r\n* This command will run all of the test suites:\r\n + `python tests\\utils\\stl-lit\\stl-lit.py -Dnotags=ASAN ..\\..\\llvm-project\\libcxx\\test ..\\..\\tests\\std ..\\..\\tests\\tr1`\r\n* This command will run only the std test suite.\r\n + `python tests\\utils\\stl-lit\\stl-lit.py -Dnotags=ASAN ..\\..\\tests\\std`\r\n* If you want to run a subset of a test suite, you need to point it to the right place in the sources. The following\r\nwill run the single test found under `VSO_0000000_any_calling_conventions`.\r\n + `python tests\\utils\\stl-lit\\stl-lit.py -Dnotags=ASAN ..\\..\\tests\\std\\tests\\VSO_0000000_any_calling_conventions`\r\n* You can invoke `stl-lit` with any arbitrary subdirectory of a test suite. In libcxx this allows you to have finer\r\ncontrol over what category of tests you would like to run. The following will run all the libcxx map tests.\r\n + `python tests\\utils\\stl-lit\\stl-lit.py -Dnotags=ASAN ..\\..\\llvm-project\\libcxx\\test\\std\\containers\\associative\\map`\r\n* You can also use the `--filter` option to include tests whose names match a regular expression. The following\r\n command will run tests with \"atomic_wait\" in their names in both the std and libcxx test suites.\r\n + `python tests\\utils\\stl-lit\\stl-lit.py ..\\..\\llvm-project\\libcxx\\test ..\\..\\tests\\std --filter=atomic_wait`\r\n* There's also a `--filter-out` option to exclude tests matching a regular expression;\r\n `--filter=iota --filter-out=view` would run tests with names matching \"iota\" but not \"view\".\r\n\r\n## Interpreting The Results Of Tests\r\n\r\n`stl-lit.py` prints the result of each test. The format of each result is\r\n`{Result Code}: {Test Suite Name} :: {Test Name}:{Configuration Number}`.\r\n\r\nExample:\r\n```\r\n-- Testing: 28 tests, 12 workers --\r\nPASS: tr1 :: tests/cwchar1:01 (1 of 28)\r\nPASS: tr1 :: tests/cwchar1:11 (2 of 28)\r\nPASS: tr1 :: tests/cwchar1:02 (3 of 28)\r\nPASS: tr1 :: tests/cwchar1:03 (4 of 28)\r\nPASS: tr1 :: tests/cwchar1:00 (5 of 28)\r\nPASS: tr1 :: tests/cwchar1:04 (6 of 28)\r\nPASS: tr1 :: tests/cwchar1:05 (7 of 28)\r\nPASS: tr1 :: tests/cwchar1:09 (8 of 28)\r\nPASS: tr1 :: tests/cwchar1:06 (9 of 28)\r\nUNSUPPORTED: tr1 :: tests/cwchar1:20 (10 of 28)\r\nUNSUPPORTED: tr1 :: tests/cwchar1:21 (11 of 28)\r\nUNSUPPORTED: tr1 :: tests/cwchar1:22 (12 of 28)\r\nUNSUPPORTED: tr1 :: tests/cwchar1:23 (13 of 28)\r\nUNSUPPORTED: tr1 :: tests/cwchar1:24 (14 of 28)\r\nPASS: tr1 :: tests/cwchar1:07 (15 of 28)\r\nPASS: tr1 :: tests/cwchar1:08 (16 of 28)\r\nPASS: tr1 :: tests/cwchar1:10 (17 of 28)\r\nPASS: tr1 :: tests/cwchar1:16 (18 of 28)\r\nPASS: tr1 :: tests/cwchar1:17 (19 of 28)\r\nPASS: tr1 :: tests/cwchar1:14 (20 of 28)\r\nPASS: tr1 :: tests/cwchar1:12 (21 of 28)\r\nPASS: tr1 :: tests/cwchar1:13 (22 of 28)\r\nPASS: tr1 :: tests/cwchar1:19 (23 of 28)\r\nPASS: tr1 :: tests/cwchar1:18 (24 of 28)\r\nPASS: tr1 :: tests/cwchar1:15 (25 of 28)\r\nPASS: tr1 :: tests/cwchar1:25 (26 of 28)\r\nPASS: tr1 :: tests/cwchar1:26 (27 of 28)\r\nPASS: tr1 :: tests/cwchar1:27 (28 of 28)\r\n\r\nTesting Time: 3.96s\r\n Expected Passes : 23\r\n Unsupported Tests : 5\r\n```\r\n\r\nIn the above example, we see that 23 tests succeeded and 5 were unsupported.\r\n\r\n### Result Code Values\r\n\r\nOur tests use the standard [lit result codes][], and an undocumented result code: `SKIPPED`. For our tests, only the\r\n`PASS`, `XFAIL`, `XPASS`, `FAIL`, `UNSUPPORTED`, and `SKIPPED` result codes are relevant.\r\n\r\nThe `PASS` and `FAIL` result codes are self-explanatory. We want our tests to `PASS` and not `FAIL`.\r\n\r\nThe `XPASS` and `XFAIL` result codes are less obvious. `XPASS` is actually a failure result and indicates that we\r\nexpected a test to fail but it passed. `XFAIL` is a successful result and indicates that we expected the test to fail\r\nand it did. Typically an `XPASS` result means that the `expected_results.txt` file for the test suite needs to be\r\nmodified. If the `XPASS` result is a test legitimately passing, the usual course of action would be to remove a `FAIL`\r\nentry from the `expected_results.txt`. However, some tests from `libcxx` mark themselves as `XFAIL` (meaning they\r\nexpect to fail) for features they have added tests for but have yet to implement in `libcxx`. If the STL implements\r\nthose features first the tests will begin passing unexpectedly for us and return `XPASS` results. In order to resolve\r\nthis it is necessary to add a `PASS` entry to the `expected_results.txt` of the test suite in question.\r\n\r\nThe `UNSUPPORTED` result code means that the requirements for a test are not met and so it will not be run. Currently,\r\nall tests which use the `/clr` or `/clr:pure` options are unsupported. Also, the `/BE` option is unsupported for x86.\r\n\r\nThe `SKIPPED` result code indicates that a given test was explicitly skipped by adding a `SKIPPED` entry to the\r\n`expected_results.txt`. A test may be skipped for a number of reasons, which include, but are not limited to:\r\n* being an incorrect test\r\n* taking a very long time to run\r\n* failing or passing for an incorrect reason\r\n\r\n### Debugging Individual Tests\r\n\r\nWhile `stl-lit` is super awesome in finding out that *something* is wrong or not even compiling, it is not really\r\nhelpful in debugging *what* is going wrong. However, debugging individual tests is rather simple given some additional\r\nsteps. Let's assume we want to debug a new feature with tests located in `tests\\std\\tests\\GH_XXXX_meow`.\r\n\r\nAs always, build the STL from your branch and run the tests:\r\n```\r\nC:\\Dev\\STL\\out\\x64> ninja\r\nC:\\Dev\\STL\\out\\x64> python tests\\utils\\stl-lit\\stl-lit.py -v C:\\Dev\\STL\\tests\\std\\tests\\GH_XXXX_meow\r\n```\r\n\r\nLet's assume one of the tests fails an assert and we want to debug that configuration. `stl-lit` will conveniently print\r\nthe build command, which is far too long to provide here in full. The important part is to add the following options to\r\nprovide debug symbols: `/Zi /Fdbark.pdb`.\r\n\r\nYou can replace `bark` with any descriptive name you like. Add these before the `\"-link\"` option in the command line\r\nand recompile. Example:\r\n```\r\nC:\\Dev\\STL\\out\\x64>cl \"C:\\Dev\\STL\\tests\\std\\tests\\GH_XXXX_meow\\test.cpp\" [... more arguments ...]\r\n\"-FeC:\\Dev\\STL\\out\\x64\\tests\\std\\tests\\GH_XXXX_meow\\Output\\02\\GH_XXXX_meow.exe\" /Zi /Fdbark.pdb \"-link\"\r\n[... more arguments ...]\r\n```\r\n\r\nYou can now start debugging the test via:\r\n```\r\ndevenv \"C:\\Dev\\STL\\out\\x64\\tests\\std\\tests\\GH_XXXX_meow\\Output\\02\\GH_XXXX_meow.exe\"\r\n \"C:\\Dev\\STL\\tests\\std\\tests\\GH_XXXX_meow\\test.cpp\"\r\n```\r\n\r\nHowever, this might not work right away, as Visual Studio may complain about a missing `msvcp140_oss.dll`. The reason\r\nis that the STL builds those and other DLLs itself and we should under no circumstances overwrite the installed ones.\r\nIf you are testing one of the configurations with dynamic linkage (`/MD` or `/MDd`) the easiest solution is to add the\r\nbuild folder to your path:\r\n```\r\nset PATH=C:\\Dev\\STL\\out\\x64\\out\\bin\\amd64;%PATH%\r\n```\r\n\r\n## Running Tests With Address Sanitizer (ASan)\r\n\r\nYou don't need any extra steps to run with test code and the code in STL headers instrumented with [ASan][].\r\nThe test matrices include both ASan and non-ASan configurations if you don't pass `-Dtags=ASAN` or `-Dnotags=ASAN`\r\nto exclude one or the other.\r\n\r\nHowever, to instrument the separately-compiled code (the DLL, the satellites, the [Import Library][] - everything that's\r\nin `stl\\src`), you need to build the STL with ASan. Change the build steps to add `-DSTL_ASAN_BUILD=ON`:\r\n\r\n```\r\ncmake --preset x64 -DSTL_ASAN_BUILD=ON\r\ncmake --build --preset x64\r\n```\r\n\r\nASan-instrumented STL binaries require that the executable be instrumented as well, so you'll have to skip the non-ASan\r\nconfigurations by passing `-Dtags=ASAN` to `stl-lit.py`:\r\n\r\n(This example assumes that your current directory is `C:\\Dev\\STL\\out\\x64`.)\r\n\r\n```\r\npython tests\\utils\\stl-lit\\stl-lit.py ..\\..\\tests\\std\\tests\\VSO_0000000_vector_algorithms -Dtags=ASAN -v\r\n```\r\n\r\n# Benchmarking\r\n\r\nFor performance-sensitive code (e.g. containers and algorithms)\r\nyou may wish to write and/or run benchmarks, and the STL team will likely\r\nrun any benchmarks we do have in our PR process. Additionally,\r\nif you are writing a \"performance improvement\" PR, please add and run benchmarks\r\nto show that the PR does, in fact, improve performance.\r\n\r\nThe benchmarking code is located in `benchmarks`. Adding a new benchmark is as easy as adding a new file\r\nto `benchmarks/src`, and then adding `add_benchmark( )`\r\nto `benchmarks/CMakeLists.txt`.\r\nYou may also modify an existing benchmark file. We use Google's [Benchmark][gbenchmark] library,\r\nso you may find [their documentation][gbenchmark:docs] helpful, and you can also read the existing code\r\nfor how _we_ use it.\r\n\r\nTo run benchmarks, you'll need to first build the STL, then build the benchmarks:\r\n\r\n```cmd\r\ncmake --preset x64\r\ncmake --build --preset x64\r\ncmake -B out\\bench -S benchmarks -G Ninja -DSTL_BINARY_DIR=out\\x64\r\ncmake --build out\\bench\r\n```\r\n\r\nYou can then run your benchmark with:\r\n\r\n```cmd\r\nout\\bench\\benchmark- --benchmark_out= --benchmark_out_format=csv\r\n```\r\n\r\nAnd then you can copy this CSV file into Excel, or another spreadsheet program. For example:\r\n\r\n```cmd\r\nout\\bench\\benchmark-std_copy --benchmark_out=benchmark-std_copy-results.csv --benchmark_out_format=csv\r\n```\r\n\r\nIf you want to see all the other flags you can pass, run:\r\n\r\n```cmd\r\nout\\bench\\benchmark- --help\r\n```\r\n\r\n## Other Useful Incantations\r\n\r\nTo compile the benchmarks with additional compiler options, use the [`CXXFLAGS` environment variable][CXXFLAGS].\r\nSet it after configuring and building the STL, but before configuring and building the benchmarks.\r\nFor example, to examine how the `/arch:AVX2` option affects auto-vectorization and bit algorithm intrinsics:\r\n\r\n```\r\nset CXXFLAGS=/arch:AVX2\r\ncmake -B out\\bench -S benchmarks -G Ninja -DSTL_BINARY_DIR=out\\x64\r\ncmake --build out\\bench\r\n```\r\n\r\nTo compile the benchmarks with Clang, use `-DCMAKE_CXX_COMPILER=clang-cl`:\r\n\r\n```\r\ncmake -B out\\bench -S benchmarks -G Ninja -DSTL_BINARY_DIR=out\\x64 -DCMAKE_CXX_COMPILER=clang-cl\r\ncmake --build out\\bench\r\n```\r\n\r\nTo run a benchmark on specific cores (e.g. P-cores vs. E-cores) and with higher priority\r\n(to avoid interference), use the [`start` command][start-command]:\r\n\r\n```\r\nstart /b /wait /high /affinity 0F out\\bench\\benchmark-std_copy\r\n```\r\n\r\n# Editing And Testing The Debugger Visualizer\r\n\r\n### Modify The Visualizer\r\n\r\nTo modify how components are visualized in the debugger, edit the file `stl\\debugger\\STL.natvis`. For more information\r\non how to modify this file, check the [natvis documentation][].\r\n\r\n### Test Your Changes\r\n\r\nYou can add the natvis file to any Visual Studio C++ project if you right-click your project > Add > Existing Item and\r\nselect the STL.natvis file. After doing this you should be able to see your changes in a Visual Studio debugging\r\nsession.\r\n\r\n# Block Diagram\r\n\r\nThe STL is built atop other compiler support libraries that ship with Windows and Visual Studio, like the UCRT,\r\nVCRuntime, and VCStartup. The following diagram describes the dependencies between those components and their ship\r\nvehicles.\r\n\r\n```mermaid\r\nflowchart TB\r\n%%{ init: {\"flowchart\": {\"htmlLabels\": true}} }%%\r\n classDef default text-align:left\r\n subgraph VisualStudioSubgraph[Visual Studio]\r\n direction TB\r\n STLNode(\"STL\r\n This repo; provides C++ Standard Library headers, separately\r\n compiled implementations of most of the iostreams functionality,\r\n and a few runtime support components like std::exception_ptr.\")\r\n subgraph VCRuntimeSubgraph[VCRuntime]\r\n direction TB\r\n VCStartupNode(\"VCStartup\r\n Provides compiler support mechanisms that\r\n live in each binary; such as machinery to\r\n call constructors and destructors for global\r\n variables, the entry point, and the /GS cookie.
\r\n Merged into static and import libraries of VCRuntime.\")\r\n VCRuntimeNode(\"VCRuntime\r\n Provides compiler support mechanisms that can be\r\n shared between binaries; code that the compiler calls\r\n on your behalf, such as the C++ exception handling\r\n runtime, string.h intrinsics, math intrinsics, and\r\n declarations for CPU-vendor-specific intrinsics.\")\r\n end\r\n end\r\n subgraph WindowsSDKSubgraph[Windows SDK]\r\n UniversalCRTNode(\"Universal CRT\r\n Windows component that provides C library support, such as printf,\r\n C locales, and some POSIX-like shims for the Windows API, like _stat.\")\r\n end\r\n STLNode ==> VCRuntimeSubgraph & UniversalCRTNode\r\n VCStartupNode ==> VCRuntimeNode ==> UniversalCRTNode\r\n```\r\n\r\n# Contributing\r\n\r\nThis project welcomes contributions and suggestions. Most contributions require you to agree to a\r\nContributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us\r\nthe rights to use your contribution. For details, visit https://cla.opensource.microsoft.com.\r\n\r\nWhen you submit a pull request, a CLA bot will automatically determine whether you need to provide\r\na CLA and decorate the PR appropriately (e.g., status check, comment). Simply follow the instructions\r\nprovided by the bot. You will only need to do this once across all repos using our CLA.\r\n\r\nSee [CONTRIBUTING.md][] for more information.\r\n\r\n# Code Of Conduct\r\n\r\nThis project has adopted the [Microsoft Open Source Code of Conduct][].\r\n\r\nSee [CODE_OF_CONDUCT.md][] for more information.\r\n\r\n# License\r\n\r\nCopyright (c) Microsoft Corporation.\r\n\r\nSPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n[Changelog]: https://github.com/microsoft/STL/wiki/Changelog\r\n[clang-format]: https://clang.llvm.org/docs/ClangFormat.html\r\n[CODE_OF_CONDUCT.md]: CODE_OF_CONDUCT.md\r\n[Compiler Explorer]: https://godbolt.org\r\n[CONTRIBUTING.md]: CONTRIBUTING.md\r\n[Developer Community]: https://aka.ms/feedback/report?space=62\r\n[Discord server]: https://discord.gg/XWanNww\r\n[LICENSE.txt]: LICENSE.txt\r\n[LWG issues]: https://cplusplus.github.io/LWG/lwg-toc.html\r\n[LWG tag]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3ALWG\r\n[Microsoft Open Source Code of Conduct]: https://opensource.microsoft.com/codeofconduct/\r\n[N5032]: https://wg21.link/N5032\r\n[NOTICE.txt]: NOTICE.txt\r\n[STL-CI-badge]: https://dev.azure.com/vclibs/STL/_apis/build/status%2FSTL-CI?branchName=main \"STL-CI\"\r\n[STL-CI-link]: https://dev.azure.com/vclibs/STL/_build/latest?definitionId=4&branchName=main\r\n[STL-ASan-CI-badge]: https://dev.azure.com/vclibs/STL/_apis/build/status%2FSTL-ASan-CI?branchName=main \"STL-ASan-CI\"\r\n[STL-ASan-CI-link]: https://dev.azure.com/vclibs/STL/_build/latest?definitionId=5&branchName=main\r\n[Python]: https://www.python.org/downloads/windows/\r\n[Roadmap]: https://github.com/microsoft/STL/wiki/Roadmap\r\n[Status Chart]: https://microsoft.github.io/STL/\r\n[bug tag]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3Abug\r\n[cxx20 tag]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3Acxx20\r\n[enhancement tag]: https://github.com/microsoft/STL/issues?q=is%3Aopen+is%3Aissue+label%3Aenhancement\r\n[gbenchmark]: https://github.com/google/benchmark\r\n[gbenchmark:docs]: https://github.com/google/benchmark/blob/main/docs/user_guide.md\r\n[hub]: https://support.microsoft.com/help/4021566\r\n[libcxx]: https://libcxx.llvm.org\r\n[lit]: https://llvm.org/docs/CommandGuide/lit.html\r\n[lit result codes]: https://llvm.org/docs/CommandGuide/lit.html#test-status-results\r\n[redistributables]: https://learn.microsoft.com/cpp/windows/latest-supported-vc-redist\r\n[natvis documentation]: https://learn.microsoft.com/visualstudio/debugger/create-custom-views-of-native-objects\r\n[ASan]: https://learn.microsoft.com/cpp/sanitizers/asan\r\n[Import Library]: /docs/import_library.md\r\n[VS 2026 Insiders]: https://visualstudio.microsoft.com/insiders/\r\n[CXXFLAGS]: https://cmake.org/cmake/help/latest/envvar/CXXFLAGS.html\r\n[start-command]: https://learn.microsoft.com/windows-server/administration/windows-commands/start\r\n[preview]: https://devblogs.microsoft.com/cppblog/microsoft-c-msvc-build-tools-v14-51-preview-released-how-to-opt-in/\r\n" }, { "path": "SECURITY.md", "content": "\n\n## Security\n\nMicrosoft takes the security of our software products and services seriously, which includes all source code repositories managed through our GitHub organizations, which include [Microsoft](https://github.com/Microsoft), [Azure](https://github.com/Azure), [DotNet](https://github.com/dotnet), [AspNet](https://github.com/aspnet) and [Xamarin](https://github.com/xamarin).\n\nIf you believe you have found a security vulnerability in any Microsoft-owned repository that meets [Microsoft's definition of a security vulnerability](https://aka.ms/security.md/definition), please report it to us as described below.\n\n## Reporting Security Issues\n\n**Please do not report security vulnerabilities through public GitHub issues.**\n\nInstead, please report them to the Microsoft Security Response Center (MSRC) at [https://msrc.microsoft.com/create-report](https://aka.ms/security.md/msrc/create-report).\n\nIf you prefer to submit without logging in, send email to [secure@microsoft.com](mailto:secure@microsoft.com). If possible, encrypt your message with our PGP key; please download it from the [Microsoft Security Response Center PGP Key page](https://aka.ms/security.md/msrc/pgp).\n\nYou should receive a response within 24 hours. If for some reason you do not, please follow up via email to ensure we received your original message. Additional information can be found at [microsoft.com/msrc](https://www.microsoft.com/msrc). \n\nPlease include the requested information listed below (as much as you can provide) to help us better understand the nature and scope of the possible issue:\n\n * Type of issue (e.g. buffer overflow, SQL injection, cross-site scripting, etc.)\n * Full paths of source file(s) related to the manifestation of the issue\n * The location of the affected source code (tag/branch/commit or direct URL)\n * Any special configuration required to reproduce the issue\n * Step-by-step instructions to reproduce the issue\n * Proof-of-concept or exploit code (if possible)\n * Impact of the issue, including how an attacker might exploit the issue\n\nThis information will help us triage your report more quickly.\n\nIf you are reporting for a bug bounty, more complete reports can contribute to a higher bounty award. Please visit our [Microsoft Bug Bounty Program](https://aka.ms/security.md/msrc/bounty) page for more details about our active programs.\n\n## Preferred Languages\n\nWe prefer all communications to be in English.\n\n## Policy\n\nMicrosoft follows the principle of [Coordinated Vulnerability Disclosure](https://aka.ms/security.md/cvd).\n\n\n" }, { "path": "azure-devops/asan-pipeline.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# Build STL targeting x64, x86, and arm64, then run extra ASan testing\r\n\r\nvariables:\r\n - template: config.yml\r\n\r\ntrigger: none\r\n\r\nschedules:\r\n- cron: '0 2 * * *'\r\n displayName: ASan-Daily-CI\r\n branches:\r\n include:\r\n - main\r\n\r\nstages:\r\n - stage: Test_x64_ASan\r\n displayName: 'Test x64 ASan'\r\n dependsOn: []\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: x64\r\n targetPlatform: x64\r\n asanBuild: true\r\n testTargets: STL-ASan-CI\r\n\r\n - stage: Test_x86_ASan\r\n displayName: 'Test x86 ASan'\r\n dependsOn: []\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: build-and-test.yml\r\n parameters:\r\n hostArch: x86\r\n targetArch: x86\r\n targetPlatform: x86\r\n asanBuild: true\r\n testTargets: STL-ASan-CI\r\n\r\n - stage: Test_ARM64_ASan\r\n displayName: 'Test ARM64 ASan'\r\n dependsOn: []\r\n pool:\r\n name: ${{ variables.arm64PoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: build-and-test.yml\r\n parameters:\r\n hostArch: arm64\r\n targetArch: arm64\r\n targetPlatform: arm64\r\n asanBuild: true\r\n testTargets: STL-ASan-CI\r\n" }, { "path": "azure-devops/build-and-test.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nparameters:\r\n- name: hostArch\r\n type: string\r\n- name: targetArch\r\n type: string\r\n- name: targetPlatform\r\n type: string\r\n- name: analyzeBuild\r\n type: boolean\r\n default: false\r\n- name: asanBuild\r\n type: boolean\r\n default: false\r\n- name: buildBenchmarks\r\n type: boolean\r\n default: false\r\n- name: testTargets\r\n type: string\r\n default: 'STL-CI'\r\n- name: numShards\r\n type: number\r\n default: 10\r\n- name: configureTesting\r\n type: boolean\r\n default: true\r\n- name: buildStl\r\n type: boolean\r\n default: true\r\n- name: runTesting\r\n type: boolean\r\n default: true\r\n- name: testsBuildOnly\r\n type: boolean\r\n default: false\r\njobs:\r\n- job: '${{ parameters.targetPlatform }}'\r\n strategy:\r\n parallel: ${{ parameters.numShards }}\r\n timeoutInMinutes: 30\r\n steps:\r\n - template: checkout-self.yml\r\n - template: checkout-submodule.yml\r\n parameters:\r\n enabled: ${{ parameters.configureTesting }}\r\n path: 'llvm-project'\r\n url: 'https://github.com/llvm/llvm-project.git'\r\n - template: checkout-submodule.yml\r\n parameters:\r\n enabled: true\r\n path: 'boost-math'\r\n url: 'https://github.com/boostorg/math.git'\r\n - template: checkout-submodule.yml\r\n parameters:\r\n enabled: ${{ parameters.buildBenchmarks }}\r\n path: 'benchmarks/google-benchmark'\r\n url: 'https://github.com/google/benchmark.git'\r\n - template: cmake-configure-build.yml\r\n parameters:\r\n hostArch: ${{ parameters.hostArch }}\r\n targetArch: ${{ parameters.targetArch }}\r\n targetPlatform: ${{ parameters.targetPlatform }}\r\n analyzeBuild: ${{ parameters.analyzeBuild }}\r\n asanBuild: ${{ parameters.asanBuild }}\r\n configureTesting: ${{ parameters.configureTesting }}\r\n buildStl: ${{ parameters.buildStl }}\r\n testsBuildOnly: ${{ parameters.testsBuildOnly }}\r\n - template: build-benchmarks.yml\r\n parameters:\r\n hostArch: ${{ parameters.hostArch }}\r\n targetArch: ${{ parameters.targetArch }}\r\n targetPlatform: ${{ parameters.targetPlatform }}\r\n buildBenchmarks: ${{ parameters.buildBenchmarks }}\r\n compiler: cl\r\n - template: build-benchmarks.yml\r\n parameters:\r\n hostArch: ${{ parameters.hostArch }}\r\n targetArch: ${{ parameters.targetArch }}\r\n targetPlatform: ${{ parameters.targetPlatform }}\r\n buildBenchmarks: ${{ parameters.buildBenchmarks }}\r\n compiler: clang-cl\r\n - template: run-tests.yml\r\n parameters:\r\n hostArch: ${{ parameters.hostArch }}\r\n targetArch: ${{ parameters.targetArch }}\r\n targetPlatform: ${{ parameters.targetPlatform }}\r\n testTargets: ${{ parameters.testTargets }}\r\n runTesting: ${{ parameters.runTesting }}\r\n" }, { "path": "azure-devops/build-benchmarks.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nparameters:\r\n- name: hostArch\r\n type: string\r\n- name: targetArch\r\n type: string\r\n- name: targetPlatform\r\n type: string\r\n- name: buildBenchmarks\r\n type: boolean\r\n- name: compiler\r\n type: string\r\n\r\nsteps:\r\n- task: PowerShell@2\r\n displayName: 'Configure Benchmarks for ${{ parameters.compiler }}'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n if (Test-Path -LiteralPath \"$(benchmarkBuildOutputLocation)\\${{ parameters.compiler }}\") {\r\n Remove-Item -LiteralPath \"$(benchmarkBuildOutputLocation)\\${{ parameters.compiler }}\" -Recurse -Force\r\n }\r\n & \"$(launchVsDevShell)\" -HostArch ${{ parameters.hostArch }} -Arch ${{ parameters.targetArch }}\r\n cmake -G Ninja `\r\n -DCMAKE_CXX_COMPILER=${{ parameters.compiler }} `\r\n -DCMAKE_BUILD_TYPE=Release `\r\n -DSTL_BINARY_DIR=\"$(buildOutputLocation)\" `\r\n -DVCLIBS_TARGET_ARCHITECTURE=${{ parameters.targetPlatform }} `\r\n -S $(Build.SourcesDirectory)/benchmarks -B \"$(benchmarkBuildOutputLocation)\\${{ parameters.compiler }}\"\r\n timeoutInMinutes: 2\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n # TRANSITION, we currently only build the benchmarks with Clang for x64\r\n condition: >\r\n and(succeeded(), ${{ parameters.buildBenchmarks }},\r\n not(and(eq('${{ parameters.compiler }}', 'clang-cl'),\r\n not(eq('${{ parameters.targetPlatform }}', 'x64')))))\r\n- task: PowerShell@2\r\n displayName: 'Build Benchmarks for ${{ parameters.compiler }}'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n & \"$(launchVsDevShell)\" -HostArch ${{ parameters.hostArch }} -Arch ${{ parameters.targetArch }}\r\n cmake --build \"$(benchmarkBuildOutputLocation)\\${{ parameters.compiler }}\"\r\n timeoutInMinutes: 2\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n # TRANSITION, we currently only build the benchmarks with Clang for x64\r\n condition: >\r\n and(succeeded(), ${{ parameters.buildBenchmarks }},\r\n not(and(eq('${{ parameters.compiler }}', 'clang-cl'),\r\n not(eq('${{ parameters.targetPlatform }}', 'x64')))))\r\n" }, { "path": "azure-devops/checkout-self.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nsteps:\r\n- checkout: self\r\n clean: true\r\n submodules: false\r\n fetchDepth: 1\r\n fetchTags: false\r\n retryCountOnTaskFailure: 4\r\n- task: PowerShell@2\r\n displayName: 'Clean After Checkout'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n git clean --quiet -x -d -f -f\r\n if (Test-Path -LiteralPath \"$(tmpDir)\") {\r\n Remove-Item -LiteralPath \"$(tmpDir)\" -Recurse -Force\r\n }\r\n mkdir \"$(tmpDir)\" -Force | Out-Null\r\n" }, { "path": "azure-devops/checkout-submodule.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nparameters:\r\n- name: enabled\r\n type: boolean\r\n- name: path\r\n type: string\r\n- name: url\r\n type: string\r\nsteps:\r\n- task: PowerShell@2\r\n displayName: 'Checkout ${{ parameters.path }} Submodule'\r\n condition: and(succeeded(), ${{ parameters.enabled }})\r\n retryCountOnTaskFailure: 4\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n $submodule = '${{ parameters.path }}'\r\n $rawStatus = git submodule status --cached $submodule\r\n $sha = $rawStatus -creplace '^[ \\-+]([0-9a-f]+) .*$', '$1'\r\n cd $submodule\r\n git init\r\n if ((git remote) -eq $null) {\r\n git remote add submodule-upstream ${{ parameters.url }}\r\n }\r\n git fetch --filter=tree:0 --depth=1 submodule-upstream $sha\r\n if ($submodule -ceq 'llvm-project') {\r\n git sparse-checkout set --sparse-index libcxx/test libcxx/utils/libcxx llvm/utils/lit\r\n }\r\n git reset --quiet --hard FETCH_HEAD\r\n git clean --quiet -x -d -f -f\r\n" }, { "path": "azure-devops/cmake-configure-build.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nparameters:\r\n- name: hostArch\r\n type: string\r\n- name: targetArch\r\n type: string\r\n- name: targetPlatform\r\n type: string\r\n- name: analyzeBuild\r\n type: boolean\r\n- name: asanBuild\r\n type: boolean\r\n- name: configureTesting\r\n type: boolean\r\n- name: buildStl\r\n type: boolean\r\n- name: testsBuildOnly\r\n type: boolean\r\n- name: litFlags\r\n type: object\r\n default:\r\n - '--xunit-xml-output=$(buildOutputLocation)/test-results.xml'\r\n - '--order=lexical'\r\n - '--num-shards=$(System.TotalJobsInPhase)'\r\n - '--run-shard=$(System.JobPositionInPhase)'\r\n\r\nsteps:\r\n- task: PowerShell@2\r\n displayName: 'Configure STL'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n if (Test-Path -LiteralPath \"$(buildOutputLocation)\") {\r\n Remove-Item -LiteralPath \"$(buildOutputLocation)\" -Recurse -Force\r\n }\r\n & \"$(launchVsDevShell)\" -HostArch ${{ parameters.hostArch }} -Arch ${{ parameters.targetArch }}\r\n cmake -G Ninja `\r\n -DCMAKE_CXX_COMPILER=cl `\r\n -DCMAKE_BUILD_TYPE=Release `\r\n -DLIT_FLAGS=\"${{ join(';', parameters.litFlags) }}\" `\r\n -DSTL_USE_ANALYZE=${{ parameters.analyzeBuild }} `\r\n -DSTL_ASAN_BUILD=${{ parameters.asanBuild }} `\r\n -DCONFIGURE_TESTING=${{ parameters.configureTesting }} `\r\n -DTESTS_BUILD_ONLY=${{ parameters.testsBuildOnly }} `\r\n -DVCLIBS_TARGET_ARCHITECTURE=${{ parameters.targetPlatform }} `\r\n -S $(Build.SourcesDirectory) -B \"$(buildOutputLocation)\"\r\n timeoutInMinutes: 2\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n- task: PowerShell@2\r\n displayName: 'Build STL'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n & \"$(launchVsDevShell)\" -HostArch ${{ parameters.hostArch }} -Arch ${{ parameters.targetArch }}\r\n cmake --build \"$(buildOutputLocation)\"\r\n timeoutInMinutes: 5\r\n condition: and(succeeded(), ${{ parameters.buildStl }})\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n" }, { "path": "azure-devops/config.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# Common configuration used by both pipelines\r\n\r\nvariables:\r\n- name: x64SlowPoolName\r\n value: 'Stl-2026-03-11T0936-x64-Fasv6-Pool'\r\n readonly: true\r\n- name: x64FastPoolName\r\n value: 'Stl-2026-03-11T0936-x64-Fasv7-Pool'\r\n readonly: true\r\n- name: arm64PoolName\r\n value: 'Stl-2026-03-11T0936-arm64-Dpsv6-Pool'\r\n readonly: true\r\n- name: poolDemands\r\n value: 'EnableSpotVM -equals false'\r\n readonly: true\r\n- name: launchVsDevShell\r\n value: 'C:\\Program Files\\Microsoft Visual Studio\\18\\Insiders\\Common7\\Tools\\Launch-VsDevShell.ps1'\r\n readonly: true\r\n- name: tmpDir\r\n value: 'C:\\stlTemp'\r\n readonly: true\r\n- name: buildOutputLocation\r\n value: 'C:\\stlBuild'\r\n readonly: true\r\n- name: benchmarkBuildOutputLocation\r\n value: 'C:\\stlBenchmark'\r\n readonly: true\r\n- name: validationBuildOutputLocation\r\n value: 'C:\\stlValidation'\r\n readonly: true\r\n- name: Codeql.SkipTaskAutoInjection\r\n value: true\r\n readonly: true\r\n- name: skipComponentGovernanceDetection\r\n value: true\r\n readonly: true\r\n" }, { "path": "azure-devops/create-1es-hosted-pool.ps1", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n<#\r\n.SYNOPSIS\r\nCreates a 1ES Hosted Pool, set up for the STL's CI.\r\n\r\n.DESCRIPTION\r\nSee https://github.com/microsoft/STL/wiki/Checklist-for-Toolset-Updates for more information.\r\n\r\n.PARAMETER VMSku\r\nThe VM SKU can be Fasv6, Fasv7, or Dpsv6.\r\n#>\r\n[CmdletBinding(PositionalBinding=$false)]\r\nParam(\r\n [Parameter(Mandatory)][ValidateSet('Fasv6', 'Fasv7', 'Dpsv6')][String]$VMSku\r\n)\r\n\r\n$ErrorActionPreference = 'Stop'\r\n\r\n$CurrentDate = Get-Date\r\n$Timestamp = $CurrentDate.ToString('yyyy-MM-ddTHHmm')\r\n\r\n# | SKU | Location | Cores | Notes |\r\n# |-------|---------------|------:|--------------------|\r\n# | Fasv6 | eastus2 | 4096 | |\r\n# | Fasv7 | australiaeast | 740 | |\r\n# | Fasv7 | northeurope | 640 | |\r\n# | Fasv7 | southeastasia | 640 | |\r\n# | Dpsv6 | eastus2 | 1024 | |\r\n# | Dpsv6 | northeurope | 1024 | |\r\n# | Dpsv6 | westcentralus | 672 | Not currently used |\r\n\r\nif ($VMSku -ieq 'Fasv6') {\r\n $Arch = 'x64'\r\n $VMSize = 'Standard_F32as_v6'\r\n $PoolSize = 64\r\n $AvailableLocations = @('eastus2')\r\n} elseif ($VMSku -ieq 'Fasv7') {\r\n $Arch = 'x64'\r\n $VMSize = 'Standard_F32as_v7'\r\n $PoolSize = 20\r\n $AvailableLocations = @('australiaeast', 'northeurope', 'southeastasia')\r\n} elseif ($VMSku -ieq 'Dpsv6') {\r\n $Arch = 'arm64'\r\n $VMSize = 'Standard_D32ps_v6'\r\n $PoolSize = 32\r\n $AvailableLocations = @('eastus2', 'northeurope') # Locations where CPP_STL_GitHub has quota for 1024 cores (32 VMs).\r\n}\r\n\r\n$AvailableLocationIdx = 6 # Increment for each new set of pools, to cycle through the available locations.\r\n$Location = $AvailableLocations[$AvailableLocationIdx % $AvailableLocations.Length]\r\n\r\nif ($Arch -ieq 'x64') {\r\n $ImagePublisher = 'MicrosoftWindowsServer'\r\n $ImageOffer = 'WindowsServer'\r\n $ImageSku = '2025-datacenter-azure-edition'\r\n} else {\r\n $ImageId = '/SharedGalleries/WindowsServer.1P/Images/2025-datacenter-azure-edition-arm64/Versions/latest'\r\n}\r\n\r\n$ProtoVMName = 'PROTOTYPE'\r\n\r\n$LogFile = \"1es-hosted-pool-$Timestamp-$Arch-$VMSku.log\"\r\n$ProgressActivity = 'Preparing STL CI pool'\r\n$TotalProgress = 38\r\n$CurrentProgress = 1\r\n\r\n<#\r\n.SYNOPSIS\r\nDisplays an updated progress bar.\r\n\r\n.DESCRIPTION\r\nDisplay-ProgressBar increments $CurrentProgress and displays $Status in the progress bar.\r\n\r\n.PARAMETER Status\r\nA message describing the current operation being performed.\r\n#>\r\nfunction Display-ProgressBar {\r\n [CmdletBinding(PositionalBinding=$false)]\r\n Param([Parameter(Mandatory)][string]$Status)\r\n\r\n Write-Progress `\r\n -Activity $ProgressActivity `\r\n -Status $Status `\r\n -PercentComplete (100 * $script:CurrentProgress++ / $TotalProgress)\r\n}\r\n\r\n<#\r\n.SYNOPSIS\r\nGenerates a random password.\r\n\r\n.DESCRIPTION\r\nNew-Password generates a password, randomly, of length $Length, containing\r\nonly alphanumeric characters, underscore, and dash.\r\n\r\n.PARAMETER Length\r\nThe length of the returned password.\r\n#>\r\nfunction New-Password {\r\n [CmdletBinding(PositionalBinding=$false)]\r\n Param([int]$Length = 32)\r\n\r\n # This 64-character alphabet generates 6 bits of entropy per character.\r\n $alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_-'.ToCharArray()\r\n\r\n [SecureString] $result = [SecureString]::new()\r\n for ($idx = 0; $idx -lt $Length; $idx++) {\r\n $result.AppendChar((Get-SecureRandom -InputObject $alphabet))\r\n }\r\n\r\n return $result\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Silencing breaking change warnings'\r\n\r\n# https://aka.ms/azps-changewarnings\r\n$Env:SuppressAzurePowerShellBreakingChangeWarnings = 'true'\r\n\r\nUpdate-AzConfig `\r\n -DisplayBreakingChangeWarning $false `\r\n -Scope 'Process' >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Getting the subscription context'\r\n\r\nif ((Get-AzContext).Subscription.Name -cne 'CPP_STL_GitHub') {\r\n Write-Error 'Please sign in with `Connect-AzAccount -Subscription ''CPP_STL_GitHub''` before running this script.'\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating resource group'\r\n\r\n$ResourceGroupName = \"Stl-$Timestamp-$Arch-$VMSku\"\r\n\r\nNew-AzResourceGroup `\r\n -Name $ResourceGroupName `\r\n -Location $Location >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating credentials'\r\n\r\n$AdminPWSecure = New-Password\r\n$Credential = New-Object System.Management.Automation.PSCredential ('AdminUser', $AdminPWSecure)\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating public IP address'\r\n\r\n$PublicIpAddressName = \"$ResourceGroupName-PublicIpAddress\"\r\n$PublicIpAddress = New-AzPublicIpAddress `\r\n -Name $PublicIpAddressName `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location `\r\n -Sku 'Standard' `\r\n -AllocationMethod 'Static'\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating NAT gateway'\r\n\r\n$NatGatewayName = \"$ResourceGroupName-NatGateway\"\r\n$NatGateway = New-AzNatGateway `\r\n -Name $NatGatewayName `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location `\r\n -IdleTimeoutInMinutes 10 `\r\n -Sku 'Standard' `\r\n -PublicIpAddress $PublicIpAddress\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating network security group'\r\n\r\n$NetworkSecurityGroupName = \"$ResourceGroupName-NetworkSecurity\"\r\n$NetworkSecurityGroup = New-AzNetworkSecurityGroup `\r\n -Name $NetworkSecurityGroupName `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating virtual network subnet config'\r\n\r\n# TRANSITION, 2026-03-31: \"After March 31, 2026, new virtual networks will default to using private subnets,\r\n# meaning that an explicit outbound method must be enabled in order to reach public endpoints on the Internet\r\n# and within Microsoft.\"\r\n# https://learn.microsoft.com/azure/virtual-network/ip-services/default-outbound-access\r\n# We're using `-DefaultOutboundAccess $false` to opt-in early.\r\n$SubnetName = \"$ResourceGroupName-Subnet\"\r\n$Subnet = New-AzVirtualNetworkSubnetConfig `\r\n -Name $SubnetName `\r\n -AddressPrefix '10.0.0.0/16' `\r\n -DefaultOutboundAccess $false `\r\n -NatGateway $NatGateway `\r\n -NetworkSecurityGroup $NetworkSecurityGroup\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating virtual network'\r\n\r\n$VirtualNetworkName = \"$ResourceGroupName-Network\"\r\n$VirtualNetwork = New-AzVirtualNetwork `\r\n -Name $VirtualNetworkName `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location `\r\n -AddressPrefix '10.0.0.0/16' `\r\n -Subnet $Subnet\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating network interface'\r\n\r\n$NicName = \"$ResourceGroupName-NIC\"\r\n$Nic = New-AzNetworkInterface `\r\n -Name $NicName `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location `\r\n -Subnet $VirtualNetwork.Subnets[0]\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating prototype VM config'\r\n\r\nif ($Arch -ieq 'x64') {\r\n $VM = New-AzVMConfig `\r\n -VMName $ProtoVMName `\r\n -VMSize $VMSize `\r\n -DiskControllerType 'NVMe' `\r\n -Priority 'Regular'\r\n} else {\r\n $VM = New-AzVMConfig `\r\n -VMName $ProtoVMName `\r\n -VMSize $VMSize `\r\n -DiskControllerType 'SCSI' `\r\n -Priority 'Regular' `\r\n -SecurityType 'TrustedLaunch' `\r\n -SharedGalleryImageId $ImageId\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Setting prototype VM OS'\r\n\r\n$VM = Set-AzVMOperatingSystem `\r\n -VM $VM `\r\n -Windows `\r\n -ComputerName $ProtoVMName `\r\n -Credential $Credential `\r\n -ProvisionVMAgent\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Adding prototype VM network interface'\r\n\r\n$VM = Add-AzVMNetworkInterface `\r\n -VM $VM `\r\n -Id $Nic.Id\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Setting prototype VM source image'\r\n\r\nif ($Arch -ieq 'x64') {\r\n $VM = Set-AzVMSourceImage `\r\n -VM $VM `\r\n -PublisherName $ImagePublisher `\r\n -Offer $ImageOffer `\r\n -Skus $ImageSku `\r\n -Version 'latest'\r\n} else {\r\n # We passed -SharedGalleryImageId to New-AzVMConfig above.\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Setting prototype VM boot diagnostic'\r\n\r\n$VM = Set-AzVMBootDiagnostic `\r\n -VM $VM `\r\n -Disable\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating prototype VM'\r\n\r\nNew-AzVm `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Location $Location `\r\n -VM $VM >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Getting prototype VM OS disk name'\r\n\r\n$VM = Get-AzVM `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $ProtoVMName\r\n\r\n$PrototypeOSDiskName = $VM.StorageProfile.OsDisk.Name\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Running provision-image.ps1 in VM'\r\n\r\n$ProvisionImageResult = Invoke-AzVMRunCommand `\r\n -ResourceId $VM.ID `\r\n -CommandId 'RunPowerShellScript' `\r\n -ScriptPath \"$PSScriptRoot\\provision-image.ps1\" `\r\n -Parameter @{ 'Arch' = $Arch; }\r\n\r\nWrite-Host $ProvisionImageResult.value.Message\r\n\r\nif ($ProvisionImageResult.value.Message -cnotmatch 'PROVISION_IMAGE_SUCCEEDED') {\r\n Write-Host 'provision-image.ps1 failed, stopping VM...'\r\n\r\n Stop-AzVM `\r\n -Id $VM.ID `\r\n -Force >> $LogFile\r\n\r\n Write-Error \"VM stopped. Remember to delete unusable resource group: $ResourceGroupName\"\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Restarting VM'\r\n\r\nRestart-AzVM `\r\n -Id $VM.ID >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Sleeping after restart'\r\n\r\n# The VM appears to be busy immediately after restarting.\r\n# This workaround waits for a minute before attempting to run sysprep.\r\nStart-Sleep -Seconds 60\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Running sysprep in VM'\r\n\r\nInvoke-AzVMRunCommand `\r\n -ResourceId $VM.ID `\r\n -CommandId 'RunPowerShellScript' `\r\n -ScriptString 'C:\\Windows\\system32\\sysprep\\sysprep.exe /oobe /generalize /mode:vm /shutdown' >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Waiting for VM to shut down'\r\n\r\nwhile ('PowerState/stopped' -notin (Get-AzVM -ResourceId $VM.ID -Status).Statuses.Code) {\r\n Start-Sleep -Seconds 10\r\n}\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Stopping VM'\r\n\r\nStop-AzVM `\r\n -Id $VM.ID `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Generalizing VM'\r\n\r\nSet-AzVM `\r\n -Id $VM.ID `\r\n -Generalized >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating gallery'\r\n\r\n$GalleryName = \"$ResourceGroupName-Gallery\" -replace '-', '_'\r\n$Gallery = New-AzGallery `\r\n -Location $Location `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $GalleryName\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Granting access to 1ES Resource Management'\r\n\r\n$ServicePrincipalObjectId = (Get-AzADServicePrincipal -DisplayName '1ES Resource Management' -First 1).Id\r\n\r\nNew-AzRoleAssignment `\r\n -ObjectId $ServicePrincipalObjectId `\r\n -RoleDefinitionName 'Reader' `\r\n -Scope $Gallery.Id >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating image definition'\r\n\r\n$ImageDefinitionName = \"$ResourceGroupName-ImageDefinition\"\r\n$FeatureTrustedLaunch = @{ Name = 'SecurityType'; Value = 'TrustedLaunch'; }\r\nif ($Arch -ieq 'x64') {\r\n $FeatureNVMe = @{ Name = 'DiskControllerTypes'; Value = 'SCSI, NVMe'; }\r\n} else {\r\n $FeatureNVMe = @{ Name = 'DiskControllerTypes'; Value = 'SCSI'; }\r\n}\r\n$ImageDefinitionFeatures = @($FeatureTrustedLaunch, $FeatureNVMe)\r\nNew-AzGalleryImageDefinition `\r\n -Location $Location `\r\n -ResourceGroupName $ResourceGroupName `\r\n -GalleryName $GalleryName `\r\n -Name $ImageDefinitionName `\r\n -OsState 'Generalized' `\r\n -OsType 'Windows' `\r\n -Publisher 'StlPublisher' `\r\n -Offer 'StlOffer' `\r\n -Sku 'StlSku' `\r\n -Architecture $Arch `\r\n -Feature $ImageDefinitionFeatures `\r\n -HyperVGeneration 'V2' >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating image version'\r\n\r\n$ImageVersionName = $CurrentDate.ToString('yyyyMMdd.HHmm.0')\r\n$ImageVersion = New-AzGalleryImageVersion `\r\n -Location $Location `\r\n -ResourceGroupName $ResourceGroupName `\r\n -GalleryName $GalleryName `\r\n -GalleryImageDefinitionName $ImageDefinitionName `\r\n -Name $ImageVersionName `\r\n -SourceImageVMId $VM.ID\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Registering CloudTest resource provider'\r\n\r\nRegister-AzResourceProvider `\r\n -ProviderNamespace 'Microsoft.CloudTest' >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating 1ES image'\r\n\r\n$ImageName = \"$ResourceGroupName-Image\"\r\nNew-AzResource `\r\n -Location $Location `\r\n -ResourceGroupName $ResourceGroupName `\r\n -ResourceType 'Microsoft.CloudTest/Images' `\r\n -ResourceName $ImageName `\r\n -Properties @{ 'imageType' = 'SharedImageGallery'; 'resourceId' = $ImageVersion.Id; } `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Creating 1ES Hosted Pool'\r\n\r\n$PoolName = \"$ResourceGroupName-Pool\"\r\n\r\n$PoolProperties = @{\r\n 'organization' = 'https://dev.azure.com/vclibs'\r\n 'projects' = @('STL')\r\n 'sku' = @{ 'name' = $VMSize; 'tier' = 'StandardSSD'; 'enableSpot' = $false; }\r\n 'images' = @(@{ 'imageName' = $ImageName; 'poolBufferPercentage' = '100'; })\r\n 'maxPoolSize' = $PoolSize\r\n 'agentProfile' = @{ 'type' = 'Stateless'; }\r\n}\r\n\r\nNew-AzResource `\r\n -Location $Location `\r\n -ResourceGroupName $ResourceGroupName `\r\n -ResourceType 'Microsoft.CloudTest/hostedpools' `\r\n -ResourceName $PoolName `\r\n -Properties $PoolProperties `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused VM'\r\n\r\nRemove-AzVM `\r\n -Id $VM.ID `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused disk'\r\n\r\nRemove-AzDisk `\r\n -ResourceGroupName $ResourceGroupName `\r\n -DiskName $PrototypeOSDiskName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused network interface'\r\n\r\nRemove-AzNetworkInterface `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $NicName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused virtual network'\r\n\r\nRemove-AzVirtualNetwork `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $VirtualNetworkName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused network security group'\r\n\r\nRemove-AzNetworkSecurityGroup `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $NetworkSecurityGroupName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused NAT gateway'\r\n\r\nRemove-AzNatGateway `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $NatGatewayName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nDisplay-ProgressBar -Status 'Deleting unused public IP address'\r\n\r\nRemove-AzPublicIpAddress `\r\n -ResourceGroupName $ResourceGroupName `\r\n -Name $PublicIpAddressName `\r\n -Force >> $LogFile\r\n\r\n####################################################################################################\r\nWrite-Progress -Activity $ProgressActivity -Completed\r\n\r\nWrite-Host \"Elapsed time: $(((Get-Date) - $CurrentDate).ToString('hh\\:mm\\:ss'))\"\r\n\r\nif ((Get-AzResource -ResourceGroupName $ResourceGroupName -Name $PoolName) -ne $null) {\r\n Write-Host \"Created pool: $PoolName\"\r\n} else {\r\n Write-Error \"Failed to create pool: $PoolName\"\r\n}\r\n" }, { "path": "azure-devops/format-validation.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# run the `validator` tool, and ensure code is properly clang-formatted\r\n\r\njobs:\r\n- job: Code_Format_Validation\r\n timeoutInMinutes: 5\r\n displayName: 'Validation'\r\n steps:\r\n - template: checkout-self.yml\r\n - task: PowerShell@2\r\n displayName: 'Build Validation Tools'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n if (Test-Path -LiteralPath \"$(validationBuildOutputLocation)\") {\r\n Remove-Item -LiteralPath \"$(validationBuildOutputLocation)\" -Recurse -Force\r\n }\r\n & \"$(launchVsDevShell)\" -HostArch x64 -Arch x64\r\n cmake -G Ninja -S $(Build.SourcesDirectory)/tools -B \"$(validationBuildOutputLocation)\"\r\n cmake --build \"$(validationBuildOutputLocation)\"\r\n timeoutInMinutes: 5\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n - task: PowerShell@2\r\n displayName: 'clang-format Files'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n & \"$(launchVsDevShell)\" -HostArch x64 -Arch x64\r\n cmake --build \"$(validationBuildOutputLocation)\" --target run-format\r\n timeoutInMinutes: 5\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n - task: PowerShell@2\r\n displayName: 'Validate Files'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n & \"$(launchVsDevShell)\" -HostArch x64 -Arch x64\r\n cmake --build \"$(validationBuildOutputLocation)\" --target run-validate\r\n timeoutInMinutes: 2\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n - task: PowerShell@2\r\n displayName: 'Create Diff'\r\n inputs:\r\n pwsh: true\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n $TempSubDir = Join-Path ([System.IO.Path]::GetTempPath()) ([System.IO.Path]::GetRandomFileName())\r\n mkdir $TempSubDir -Force | Out-Null\r\n $DiffFile = Join-Path $TempSubDir 'format.diff'\r\n git diff --ignore-submodules > $DiffFile\r\n if ((Get-Item -LiteralPath $DiffFile).Length -ne 0) {\r\n $message = @(\r\n '##vso[task.logissue type=error]The files in the repo need to be properly formatted.'\r\n ''\r\n '##[section]To fix this, you can clang-format the entire repo with:'\r\n ' cmake --preset x64'\r\n ' cmake --build --preset x64 --target format'\r\n ''\r\n '##[section]Please avoid this in the future by configuring your editor to format-on-save.'\r\n ''\r\n '##[section]View expected formatting:'\r\n '##[group] >>>>> Click this line to expand the diff: <<<<<'\r\n Get-Content -LiteralPath $DiffFile -Raw\r\n '##[endgroup]'\r\n ''\r\n '##[section]You can also download this as format.diff and apply it with `git apply`:'\r\n ' 1. Click the failed Validation job (upper left, marked with a red X)'\r\n ' 2. Click \"1 artifact produced\"'\r\n ' 3. Click the \">\" chevron to the left of \"format-artifact\"'\r\n ' 4. Hover over \"format.diff\"'\r\n ' 5. Click the three dots that appear on the right'\r\n ' 6. Click \"Download artifacts\"'\r\n ''\r\n \"##vso[artifact.upload artifactname=format-artifact]$DiffFile\"\r\n '##vso[task.complete result=Failed]'\r\n )\r\n Write-Host ($message -join \"`n\")\r\n }\r\n condition: succeededOrFailed()\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n" }, { "path": "azure-devops/provision-image.ps1", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n<#\r\n.SYNOPSIS\r\nSets up a virtual machine to be an image for a hosted pool.\r\n\r\n.DESCRIPTION\r\ncreate-1es-hosted-pool.ps1 (running on an STL maintainer's machine) creates a \"prototype\" virtual machine in Azure,\r\nthen runs provision-image.ps1 on that VM. This gives us full control over what we install for building and testing\r\nthe STL. After provision-image.ps1 is done, create-1es-hosted-pool.ps1 makes an image of the prototype VM,\r\ncreates a 1ES Hosted Pool that will spin up copies of the image as worker VMs, and finally deletes the prototype VM.\r\n\r\n.PARAMETER Arch\r\nThe architecture can be either x64 or arm64.\r\n#>\r\n[CmdletBinding(PositionalBinding=$false)]\r\nParam(\r\n [Parameter(Mandatory)][ValidateSet('x64', 'arm64')][String]$Arch\r\n)\r\n\r\n$ErrorActionPreference = 'Stop'\r\n$ProgressPreference = 'SilentlyContinue'\r\n\r\nif ($Env:COMPUTERNAME -cne 'PROTOTYPE') {\r\n Write-Error 'You should not run provision-image.ps1 on your local machine.'\r\n}\r\n\r\nif ($Arch -ieq 'x64') {\r\n Write-Host 'Provisioning x64.'\r\n $Provisioning_x64 = $true\r\n} else {\r\n Write-Host 'Provisioning ARM64.'\r\n $Provisioning_x64 = $false\r\n}\r\n\r\n$VisualStudioWorkloads = @(\r\n 'Microsoft.VisualStudio.Component.VC.ASAN',\r\n 'Microsoft.VisualStudio.Component.VC.CMake.Project',\r\n 'Microsoft.VisualStudio.Component.VC.CoreIde',\r\n 'Microsoft.VisualStudio.Component.VC.Llvm.Clang',\r\n 'Microsoft.VisualStudio.Component.VC.Preview.ARM64',\r\n 'Microsoft.VisualStudio.Component.VC.Preview.CLI.Support',\r\n 'Microsoft.VisualStudio.Component.VC.Preview.Tools.x86.x64',\r\n 'Microsoft.VisualStudio.Component.Windows11SDK.26100'\r\n)\r\n\r\n# https://learn.microsoft.com/visualstudio/install/visual-studio-on-arm-devices\r\n# \"There's a single installer for both Visual Studio x64 and Visual Studio Arm64 architectures.\r\n# The Visual Studio Installer detects whether the system architecture is Arm64.\r\n# If it is, the installer downloads and installs the Arm64 version of Visual Studio.\"\r\n$VisualStudioUrl = 'https://aka.ms/vs/18/insiders/vs_Community.exe'\r\n$VisualStudioArgs = @('--quiet', '--norestart', '--wait', '--nocache')\r\nforeach ($workload in $VisualStudioWorkloads) {\r\n $VisualStudioArgs += '--add'\r\n $VisualStudioArgs += $workload\r\n}\r\n\r\n# https://github.com/PowerShell/PowerShell/releases/latest\r\nif ($Provisioning_x64) {\r\n $PowerShellUrl = 'https://github.com/PowerShell/PowerShell/releases/download/v7.5.4/PowerShell-7.5.4-win-x64.msi'\r\n} else {\r\n $PowerShellUrl = 'https://github.com/PowerShell/PowerShell/releases/download/v7.5.4/PowerShell-7.5.4-win-arm64.msi'\r\n}\r\n$PowerShellArgs = @('/quiet', '/norestart')\r\n\r\n# https://www.python.org\r\nif ($Provisioning_x64) {\r\n $PythonUrl = 'https://www.python.org/ftp/python/3.14.3/python-3.14.3-amd64.exe'\r\n} else {\r\n $PythonUrl = 'https://www.python.org/ftp/python/3.14.3/python-3.14.3-arm64.exe'\r\n}\r\n$PythonArgs = @('/quiet', 'InstallAllUsers=1', 'PrependPath=1', 'CompileAll=1', 'Include_doc=0')\r\n\r\n# https://developer.nvidia.com/cuda-toolkit\r\nif ($Provisioning_x64) {\r\n $CudaUrl = 'https://developer.download.nvidia.com/compute/cuda/13.2.0/local_installers/cuda_13.2.0_windows.exe'\r\n} else {\r\n $CudaUrl = 'CUDA is not installed for ARM64'\r\n}\r\n$CudaArgs = @('-s', '-n')\r\n\r\n<#\r\n.SYNOPSIS\r\nDownload and install a component.\r\n\r\n.DESCRIPTION\r\nDownloadAndInstall downloads an executable from the given URL, and runs it with the given command-line arguments.\r\n\r\n.PARAMETER Name\r\nThe name of the component, to be displayed in logging messages.\r\n\r\n.PARAMETER Url\r\nThe URL of the installer.\r\n\r\n.PARAMETER Args\r\nThe command-line arguments to pass to the installer.\r\n#>\r\nFunction DownloadAndInstall {\r\n [CmdletBinding(PositionalBinding=$false)]\r\n Param(\r\n [Parameter(Mandatory)][String]$Name,\r\n [Parameter(Mandatory)][String]$Url,\r\n [Parameter(Mandatory)][String[]]$Args\r\n )\r\n\r\n try {\r\n Write-Host \"Downloading $Name...\"\r\n $tempPath = 'C:\\installerTemp'\r\n mkdir $tempPath -Force | Out-Null\r\n $fileName = [uri]::new($Url).Segments[-1]\r\n $installerPath = Join-Path $tempPath $fileName\r\n curl.exe -L -o $installerPath -s -S $Url\r\n\r\n Write-Host \"Installing $Name...\"\r\n $proc = Start-Process -FilePath $installerPath -ArgumentList $Args -Wait -PassThru\r\n $exitCode = $proc.ExitCode\r\n\r\n if ($exitCode -eq 0) {\r\n Write-Host 'Installation successful!'\r\n } elseif ($exitCode -eq 3010) {\r\n Write-Host 'Installation successful! Exited with 3010 (ERROR_SUCCESS_REBOOT_REQUIRED).'\r\n } else {\r\n Write-Error \"Installation failed! Exited with $exitCode.\"\r\n }\r\n } catch {\r\n Write-Error \"Installation failed! Exception: $($_.Exception.Message)\"\r\n }\r\n\r\n try {\r\n # Briefly sleep before removing the installer, attempting to avoid \"Access to the path '$installerPath' is denied.\"\r\n Start-Sleep -Seconds 5\r\n Remove-Item -Path $installerPath\r\n } catch {\r\n Write-Error \"Remove-Item failed! Exception: $($_.Exception.Message)\"\r\n }\r\n}\r\n\r\n<#\r\n.SYNOPSIS\r\nEnables native NVMe support.\r\n\r\n.DESCRIPTION\r\nNative NVMe support is opt-in for Windows Server 2025.\r\nTRANSITION, this will be enabled by default for the next version of Windows Server.\r\n#>\r\nFunction EnableNativeNVMe {\r\n $registryKey = 'HKLM:\\SYSTEM\\CurrentControlSet\\Policies\\Microsoft\\FeatureManagement\\Overrides'\r\n $valueName = '1176759950'\r\n $valueData = 1\r\n\r\n if (!(Test-Path $registryKey)) {\r\n New-Item -Path $registryKey -Force | Out-Null\r\n }\r\n\r\n New-ItemProperty -Path $registryKey -Name $valueName -Value $valueData -PropertyType DWORD -Force | Out-Null\r\n}\r\n\r\nWrite-Host \"Old PowerShell version: $($PSVersionTable.PSVersion)\"\r\n\r\n# Print the Windows version, so we can verify whether Patch Tuesday has been picked up.\r\n# Skip a blank line to improve the output.\r\n(cmd /c ver)[1]\r\n\r\nDownloadAndInstall -Name 'PowerShell' -Url $PowerShellUrl -Args $PowerShellArgs\r\nDownloadAndInstall -Name 'Python' -Url $PythonUrl -Args $PythonArgs\r\nDownloadAndInstall -Name 'Visual Studio' -Url $VisualStudioUrl -Args $VisualStudioArgs\r\nif ($Provisioning_x64) {\r\n DownloadAndInstall -Name 'CUDA' -Url $CudaUrl -Args $CudaArgs\r\n}\r\n\r\nWrite-Host 'Setting environment variables...'\r\n\r\n# The STL's PR/CI builds are totally unrepresentative of customer usage.\r\n[Environment]::SetEnvironmentVariable('VSCMD_SKIP_SENDTELEMETRY', '1', 'Machine')\r\n\r\nWrite-Host 'Enabling long paths...'\r\n\r\n# https://learn.microsoft.com/windows/win32/fileio/maximum-file-path-limitation\r\nNew-ItemProperty -Path 'HKLM:\\SYSTEM\\CurrentControlSet\\Control\\FileSystem' -Name 'LongPathsEnabled' `\r\n -Value 1 -PropertyType DWORD -Force | Out-Null\r\n\r\nif ($Provisioning_x64) {\r\n Write-Host 'Enabling native NVMe...'\r\n EnableNativeNVMe\r\n}\r\n\r\n# TRANSITION, patch Launch-VsDevShell.ps1 to pass `-vcvars_ver=preview` before a proper parameter is available.\r\nWrite-Host 'Patching Launch-VsDevShell.ps1...'\r\n$launchVsDevShell = 'C:\\Program Files\\Microsoft Visual Studio\\18\\Insiders\\Common7\\Tools\\Launch-VsDevShell.ps1'\r\n$paramRegex = 'VsInstanceId = \\$instanceId'\r\n$paramSubst = '$&; DevCmdArguments = \"-vcvars_ver=preview\";'\r\n(Get-Content -Raw $launchVsDevShell) -creplace $paramRegex, $paramSubst | Set-Content -NoNewLine $launchVsDevShell\r\n\r\n# Tell create-1es-hosted-pool.ps1 that we succeeded.\r\nWrite-Host 'PROVISION_IMAGE_SUCCEEDED'\r\n\r\nexit\r\n" }, { "path": "azure-devops/run-tests.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\nparameters:\r\n- name: hostArch\r\n type: string\r\n- name: targetArch\r\n type: string\r\n- name: targetPlatform\r\n type: string\r\n- name: testTargets\r\n type: string\r\n- name: runTesting\r\n type: boolean\r\nsteps:\r\n- task: PowerShell@2\r\n displayName: 'Run Tests'\r\n inputs:\r\n pwsh: true\r\n workingDirectory: $(buildOutputLocation)\r\n targetType: inline\r\n script: |\r\n $PSNativeCommandUseErrorActionPreference = $true\r\n & \"$(launchVsDevShell)\" -HostArch ${{ parameters.hostArch }} -Arch ${{ parameters.targetArch }}\r\n ninja --verbose -k 0 ${{ parameters.testTargets }}\r\n timeoutInMinutes: 30\r\n condition: and(succeeded(), ${{ parameters.runTesting }})\r\n env: { TMP: $(tmpDir), TEMP: $(tmpDir) }\r\n- task: PublishTestResults@2\r\n displayName: 'Publish Tests'\r\n timeoutInMinutes: 5\r\n condition: and(succeededOrFailed(), ${{ parameters.runTesting }})\r\n inputs:\r\n searchFolder: $(buildOutputLocation)\r\n testResultsFormat: JUnit\r\n testResultsFiles: '**/test-results.xml'\r\n testRunTitle: 'test-${{ parameters.targetPlatform }}-$(System.JobPositionInPhase)'\r\n- publish: $(buildOutputLocation)/test-results.xml\r\n artifact: '${{ parameters.targetPlatform }}-$(System.JobPositionInPhase)-xml-$(System.JobId)'\r\n condition: and(failed(), ${{ parameters.runTesting }})\r\n displayName: 'Publish XML Artifact'\r\n" }, { "path": "azure-pipelines.yml", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n# Build STL targeting x64, x86, arm64, arm64ec\r\n\r\nvariables:\r\n - template: azure-devops/config.yml\r\n\r\npr:\r\n drafts: false\r\n\r\nstages:\r\n - stage: Code_Format\r\n dependsOn: []\r\n displayName: 'Code Format'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/format-validation.yml\r\n\r\n - stage: Build_x64\r\n dependsOn: []\r\n displayName: 'Build x64'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: x64\r\n targetPlatform: x64\r\n analyzeBuild: true\r\n buildBenchmarks: true\r\n numShards: 1\r\n configureTesting: false\r\n runTesting: false\r\n\r\n - stage: Build_x86\r\n dependsOn: []\r\n displayName: 'Build x86'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x86\r\n targetArch: x86\r\n targetPlatform: x86\r\n analyzeBuild: true\r\n buildBenchmarks: true\r\n numShards: 1\r\n configureTesting: false\r\n runTesting: false\r\n\r\n - stage: Build_ARM64_Cross\r\n dependsOn: []\r\n displayName: 'Build ARM64 (Cross)'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: arm64\r\n targetPlatform: arm64\r\n analyzeBuild: true\r\n buildBenchmarks: true\r\n numShards: 1\r\n configureTesting: false\r\n runTesting: false\r\n\r\n - stage: Build_ARM64EC_Cross\r\n dependsOn: []\r\n displayName: 'Build ARM64EC (Cross)'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: arm64\r\n targetPlatform: arm64ec\r\n analyzeBuild: true\r\n buildBenchmarks: true\r\n numShards: 1\r\n configureTesting: false\r\n runTesting: false\r\n\r\n # This ARM64-native build will detect problems with the ARM64 pool as early as possible.\r\n # The stage dependencies are structured to optimize the critical path.\r\n - stage: Build_ARM64_Native\r\n dependsOn: []\r\n displayName: 'Build ARM64 (Native)'\r\n pool:\r\n name: ${{ variables.arm64PoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: arm64\r\n targetArch: arm64\r\n targetPlatform: arm64\r\n analyzeBuild: true\r\n buildBenchmarks: true\r\n numShards: 1\r\n configureTesting: false\r\n runTesting: false\r\n\r\n - stage: Configure_Tests\r\n dependsOn: []\r\n displayName: 'Configure Tests'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: x64\r\n targetPlatform: x64\r\n numShards: 1\r\n buildStl: false\r\n runTesting: false\r\n\r\n - stage: Test_x64\r\n dependsOn:\r\n - Code_Format\r\n - Build_x64\r\n - Build_x86\r\n - Build_ARM64_Cross\r\n - Build_ARM64EC_Cross\r\n - Configure_Tests\r\n displayName: 'Test x64'\r\n pool:\r\n name: ${{ variables.x64FastPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x64\r\n targetArch: x64\r\n targetPlatform: x64\r\n\r\n - stage: Test_x86\r\n dependsOn: Test_x64\r\n displayName: 'Test x86'\r\n pool:\r\n name: ${{ variables.x64SlowPoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: x86\r\n targetArch: x86\r\n targetPlatform: x86\r\n\r\n - stage: Test_ARM64\r\n dependsOn:\r\n - Build_ARM64_Native\r\n - Test_x64\r\n displayName: 'Test ARM64'\r\n pool:\r\n name: ${{ variables.arm64PoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: arm64\r\n targetArch: arm64\r\n targetPlatform: arm64\r\n\r\n - stage: Test_ARM64EC\r\n dependsOn:\r\n - Build_ARM64_Native\r\n - Test_x64\r\n displayName: 'Test ARM64EC'\r\n pool:\r\n name: ${{ variables.arm64PoolName }}\r\n demands: ${{ variables.poolDemands }}\r\n jobs:\r\n - template: azure-devops/build-and-test.yml\r\n parameters:\r\n hostArch: arm64\r\n targetArch: arm64\r\n targetPlatform: arm64ec\r\n" }, { "path": "benchmarks/CMakeLists.txt", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\ncmake_minimum_required(VERSION 4.2.3)\r\nproject(msvc_standard_libraries_benchmarks LANGUAGES CXX)\r\n\r\nif(DEFINED STL_BINARY_DIR)\r\n cmake_path(ABSOLUTE_PATH STL_BINARY_DIR\r\n BASE_DIRECTORY \"${CMAKE_CURRENT_SOURCE_DIR}/..\"\r\n NORMALIZE\r\n )\r\n if(NOT EXISTS \"${STL_BINARY_DIR}/out\")\r\n message(FATAL_ERROR \"Invalid STL_BINARY_DIR '${STL_BINARY_DIR}'\")\r\n endif()\r\n\r\n if(NOT DEFINED VCLIBS_TARGET_ARCHITECTURE)\r\n set(VCLIBS_TARGET_ARCHITECTURE \"${CMAKE_CXX_COMPILER_ARCHITECTURE_ID}\")\r\n endif()\r\n\r\n string(TOLOWER \"${VCLIBS_TARGET_ARCHITECTURE}\" VCLIBS_TARGET_ARCHITECTURE)\r\n\r\n if(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"x86\")\r\n set(VCLIBS_I386_OR_AMD64 \"i386\")\r\n elseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"x64\")\r\n set(VCLIBS_I386_OR_AMD64 \"amd64\")\r\n elseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"arm64\")\r\n set(VCLIBS_I386_OR_AMD64 \"arm64\")\r\n elseif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"arm64ec\")\r\n set(VCLIBS_I386_OR_AMD64 \"arm64ec\")\r\n add_compile_options($<$:/arm64EC>)\r\n add_link_options(\"/machine:arm64ec\")\r\n set(CMAKE_STATIC_LINKER_FLAGS \"/machine:arm64ec\")\r\n else()\r\n message(FATAL_ERROR \"Could not determine target architecture: VCLIBS_TARGET_ARCHITECTURE: ${VCLIBS_TARGET_ARCHITECTURE}\")\r\n endif()\r\n\r\n include_directories(BEFORE \"${STL_BINARY_DIR}/out/inc\")\r\n link_directories(BEFORE \"${STL_BINARY_DIR}/out/lib/${VCLIBS_I386_OR_AMD64}\")\r\nelse()\r\n message(WARNING \"STL_BINARY_DIR not set; benchmarking the globally installed standard library\")\r\nendif()\r\n\r\nset(STL_BENCHMARK_MSVC_RUNTIME_LIBRARY\r\n MultiThreaded\r\n CACHE STRING \"The flavor of the standard library to use; see https://cmake.org/cmake/help/latest/variable/CMAKE_MSVC_RUNTIME_LIBRARY.html for more information.\")\r\nset_property(CACHE STL_BENCHMARK_MSVC_RUNTIME_LIBRARY\r\n PROPERTY STRINGS\r\n \"MultiThreaded;MultiThreadedDLL;MultiThreadedDebug;MultiThreadedDebugDLL\"\r\n)\r\nset(CMAKE_MSVC_RUNTIME_LIBRARY \"${STL_BENCHMARK_MSVC_RUNTIME_LIBRARY}\")\r\n\r\n# Building the benchmarks as Release optimizes them with `/O2 /Ob2`.\r\n# Compiling with `/Zi` and linking with `/DEBUG` below makes profiling possible.\r\n# (RelWithDebInfo would use `/O2 /Ob1 /Zi`.) See GH-4496.\r\nset(CMAKE_BUILD_TYPE Release)\r\n\r\n# /utf-8 affects .\r\nadd_compile_options(\"$<$:/Zi;/nologo;/diagnostics:caret;/W4;/WX;/w14265;/w15038;/w15262;/utf-8>\")\r\nadd_compile_options(\"$<$:/Zc:preprocessor>\") # TRANSITION, LLVM-48220 clang-cl: ignore /Zc:preprocessor\r\n\r\nadd_link_options(\"/DEBUG\")\r\n\r\nif(NOT EXISTS \"${CMAKE_CURRENT_LIST_DIR}/google-benchmark/.git\")\r\n message(FATAL_ERROR \"google-benchmark is not checked out; make sure to run\\n git submodule update --init benchmarks/google-benchmark\")\r\nendif()\r\n\r\nset(BENCHMARK_ENABLE_DOXYGEN OFF)\r\nset(BENCHMARK_ENABLE_INSTALL OFF)\r\nset(BENCHMARK_ENABLE_TESTING OFF)\r\n\r\nadd_subdirectory(google-benchmark EXCLUDE_FROM_ALL)\r\n\r\nset(benchmark_headers\r\n \"inc/lorem.hpp\"\r\n \"inc/skewed_allocator.hpp\"\r\n \"inc/udt.hpp\"\r\n \"inc/utility.hpp\"\r\n)\r\n\r\nfunction(add_benchmark name)\r\n cmake_parse_arguments(PARSE_ARGV 1 \"arg\" \"\" \"CXX_STANDARD\" \"\")\r\n\r\n if(NOT DEFINED arg_CXX_STANDARD)\r\n set(arg_CXX_STANDARD 23)\r\n elseif(NOT arg_CXX_STANDARD MATCHES \"^[0-9][0-9]$\")\r\n message(FATAL_ERROR \"Unexpected value for CXX_STANDARD: ${arg_CXX_STANDARD}\")\r\n endif()\r\n\r\n if(NOT DEFINED arg_UNPARSED_ARGUMENTS)\r\n message(FATAL_ERROR \"benchmark ${name} does not have any source files\")\r\n endif()\r\n\r\n add_executable(benchmark-${name}\r\n ${benchmark_headers}\r\n ${arg_UNPARSED_ARGUMENTS}\r\n )\r\n\r\n target_compile_features(benchmark-${name} PRIVATE cxx_std_${arg_CXX_STANDARD})\r\n target_include_directories(benchmark-${name} PRIVATE inc)\r\n target_link_libraries(benchmark-${name} PRIVATE benchmark::benchmark)\r\nendfunction()\r\n\r\nadd_benchmark(adjacent_difference src/adjacent_difference.cpp)\r\nadd_benchmark(adjacent_find src/adjacent_find.cpp)\r\nadd_benchmark(any_swap src/any_swap.cpp)\r\nadd_benchmark(bitset_from_string src/bitset_from_string.cpp)\r\nadd_benchmark(bitset_to_string src/bitset_to_string.cpp)\r\nadd_benchmark(charconv_floats src/charconv_floats.cpp)\r\nadd_benchmark(efficient_nonlocking_print src/efficient_nonlocking_print.cpp)\r\nadd_benchmark(filesystem src/filesystem.cpp)\r\nadd_benchmark(fill src/fill.cpp)\r\nadd_benchmark(find_and_count src/find_and_count.cpp)\r\nadd_benchmark(find_first_of src/find_first_of.cpp)\r\nadd_benchmark(flat_meow_assign src/flat_meow_assign.cpp)\r\nadd_benchmark(has_single_bit src/has_single_bit.cpp)\r\nadd_benchmark(includes src/includes.cpp)\r\nadd_benchmark(integer_to_string src/integer_to_string.cpp)\r\nadd_benchmark(iota src/iota.cpp)\r\nadd_benchmark(is_sorted_until src/is_sorted_until.cpp)\r\nadd_benchmark(locale_classic src/locale_classic.cpp)\r\nadd_benchmark(locate_zone src/locate_zone.cpp)\r\nadd_benchmark(minmax_element src/minmax_element.cpp)\r\nadd_benchmark(mismatch src/mismatch.cpp)\r\nadd_benchmark(move_only_function src/move_only_function.cpp)\r\nadd_benchmark(nth_element src/nth_element.cpp)\r\nadd_benchmark(path_lexically_normal src/path_lexically_normal.cpp)\r\nadd_benchmark(priority_queue_push_range src/priority_queue_push_range.cpp)\r\nadd_benchmark(random_integer_generation src/random_integer_generation.cpp)\r\nadd_benchmark(ranges_div_ceil src/ranges_div_ceil.cpp)\r\nadd_benchmark(regex_match src/regex_match.cpp)\r\nadd_benchmark(regex_search src/regex_search.cpp)\r\nadd_benchmark(remove src/remove.cpp)\r\nadd_benchmark(replace src/replace.cpp)\r\nadd_benchmark(reverse src/reverse.cpp)\r\nadd_benchmark(rotate src/rotate.cpp)\r\nadd_benchmark(sample src/sample.cpp)\r\nadd_benchmark(search src/search.cpp)\r\nadd_benchmark(search_n src/search_n.cpp)\r\nadd_benchmark(shuffle src/shuffle.cpp)\r\nadd_benchmark(std_copy src/std_copy.cpp)\r\nadd_benchmark(sv_equal src/sv_equal.cpp)\r\nadd_benchmark(swap_ranges src/swap_ranges.cpp)\r\nadd_benchmark(unique src/unique.cpp)\r\nadd_benchmark(vector_bool_copy src/vector_bool_copy.cpp)\r\nadd_benchmark(vector_bool_copy_n src/vector_bool_copy_n.cpp)\r\nadd_benchmark(vector_bool_count src/vector_bool_count.cpp)\r\nadd_benchmark(vector_bool_meow_of src/vector_bool_meow_of.cpp)\r\nadd_benchmark(vector_bool_move src/vector_bool_move.cpp)\r\nadd_benchmark(vector_bool_transform src/vector_bool_transform.cpp)\r\n" }, { "path": "benchmarks/inc/lorem.hpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#pragma once\r\n\r\n#include \r\n\r\ninline constexpr std::string_view lorem_ipsum =\r\n \"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam mollis imperdiet massa, at dapibus elit interdum \"\r\n \"ac. In eget sollicitudin mi. Nam at tellus at sapien tincidunt sollicitudin vel non eros. Pellentesque nunc nunc, \"\r\n \"ullamcorper eu accumsan at, pulvinar non turpis. Quisque vel mauris pulvinar, pretium purus vel, ultricies erat. \"\r\n \"Curabitur a magna in ligula tristique ornare. Quisque commodo, massa viverra laoreet luctus, sem nisi aliquam \"\r\n \"velit, fermentum pulvinar velit leo eget justo. Suspendisse vel erat efficitur, pulvinar eros volutpat, vulputate \"\r\n \"ex. Phasellus non purus vel velit tristique tristique id at ligula. Quisque mollis sodales magna. Mauris et quam \"\r\n \"eu quam viverra tempus. Nullam tempus maximus porta. Nunc mattis eleifend fermentum. Nullam aliquam libero \"\r\n \"accumsan velit elementum, eu laoreet metus convallis. Donec pellentesque lacus ut iaculis iaculis. Curabitur orci \"\r\n \"elit, bibendum sit amet feugiat at, iaculis sit amet massa. Maecenas imperdiet lacus at vehicula iaculis. Donec \"\r\n \"volutpat nunc sit amet accumsan tempor. Quisque pretium vestibulum ultricies. Suspendisse potenti. Aenean at diam \"\r\n \"iaculis, condimentum felis venenatis, condimentum erat. Nam quis elit dui. Duis quis odio vitae metus hendrerit \"\r\n \"rhoncus ut et magna. Cras ac augue quis nibh pharetra sagittis. Donec ullamcorper vel eros semper pretium. Proin \"\r\n \"vel sollicitudin eros. Nulla sollicitudin mattis turpis id suscipit. Aliquam sed risus velit. Aliquam iaculis nec \"\r\n \"nibh ac egestas. Duis finibus semper est sed consequat. Sed in sapien quis nibh dignissim mattis. Vestibulum nec \"\r\n \"metus sodales, euismod mauris ac, sollicitudin libero. Maecenas non arcu ac velit ullamcorper fringilla et quis \"\r\n \"nulla. Curabitur posuere leo eget ipsum tincidunt dignissim. Cras ultricies suscipit neque, quis suscipit tortor \"\r\n \"venenatis non. Cras nisl mi, bibendum in vulputate quis, vestibulum ornare enim. Nunc hendrerit placerat dui, \"\r\n \"aliquam mollis sem convallis et. Integer vitae urna diam. Phasellus et imperdiet est. Maecenas auctor facilisis \"\r\n \"nibh non commodo. Suspendisse iaculis quam id bibendum feugiat. Pellentesque felis erat, egestas a libero ac, \"\r\n \"laoreet consectetur elit. Cras ut suscipit ex. Etiam gravida sem quis ex porta, eu lacinia tortor fermentum. \"\r\n \"Nulla consequat odio enim, sed condimentum est sagittis a. Quisque nec commodo tellus. Phasellus elementum \"\r\n \"feugiat dolor et feugiat. Praesent sed mattis tortor. In vitae sodales purus. Morbi accumsan, ligula et interdum \"\r\n \"lacinia, leo risus suscipit urna, non luctus mi justo eu ipsum. Curabitur venenatis pretium orci id porttitor. \"\r\n \"Quisque dapibus nisl sit amet elit lobortis sagittis. Orci varius natoque penatibus et magnis dis parturient \"\r\n \"montes, nascetur ridiculus mus. Mauris varius dui sit amet tortor facilisis vestibulum. Curabitur condimentum \"\r\n \"justo nec orci mattis auctor. Quisque aliquet condimentum arcu ac sollicitudin. Maecenas elit elit, condimentum \"\r\n \"vitae auctor a, cursus et sem. Cras vehicula ante in consequat fermentum. Praesent at massa nisi. Mauris pretium \"\r\n \"euismod eros, ut posuere ligula ullamcorper id. Nullam aliquet malesuada est at dignissim. Pellentesque finibus \"\r\n \"sagittis libero nec bibendum. Phasellus dolor ipsum, finibus quis turpis quis, mollis interdum felis.\";\r\n" }, { "path": "benchmarks/inc/skewed_allocator.hpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#pragma once\r\n\r\n#include \r\n#include \r\n#include \r\n\r\ntemplate \r\nstruct skewed_allocator {\r\n using value_type = T;\r\n static_assert(Alignment % alignof(T) == 0, \"Chosen Alignment will produce unaligned T objects\");\r\n static_assert(Skew % alignof(T) == 0, \"Chosen Skew will produce unaligned T objects\");\r\n\r\n template \r\n struct rebind {\r\n using other = skewed_allocator;\r\n };\r\n\r\n skewed_allocator() = default;\r\n template \r\n skewed_allocator(const skewed_allocator&) {}\r\n\r\n template \r\n bool operator==(const skewed_allocator&) const {\r\n return true;\r\n }\r\n\r\n T* allocate(const size_t n) {\r\n const auto p = static_cast(_aligned_malloc(n * sizeof(T) + Skew, Alignment));\r\n if (!p) {\r\n throw std::bad_alloc{};\r\n }\r\n return reinterpret_cast(p + Skew);\r\n }\r\n\r\n void deallocate(T* const p, size_t) {\r\n if (p) {\r\n _aligned_free(reinterpret_cast(p) - Skew);\r\n }\r\n }\r\n};\r\n\r\n// The purpose is to provide consistent behavior for benchmarks.\r\n// 64 would be a reasonable alignment for practical perf uses,\r\n// as it is both the cache line size and the maximum vector instruction size (on x64).\r\n// However, aligning to the page size will provide even more consistency\r\n// by ensuring that the same number of page boundaries is crossed each time.\r\ninline constexpr size_t page_size = 4096;\r\n\r\n// A realistic skew relative to allocation granularity, when a variable is placed\r\n// next to a pointer in a structure or on the stack. Also corresponds to the default packing.\r\ninline constexpr size_t realistic_skew = 8;\r\n\r\ntemplate \r\nusing highly_aligned_allocator = skewed_allocator;\r\n\r\ntemplate \r\nusing not_highly_aligned_allocator = skewed_allocator;\r\n\r\n#pragma warning(push)\r\n#pragma warning(disable : 4324) // structure was padded due to alignment specifier\r\n\r\ntemplate \r\nstruct alignas(page_size) highly_aligned {\r\n T value;\r\n};\r\n\r\ntemplate \r\nstruct alignas(page_size) not_highly_aligned {\r\n char pad[realistic_skew];\r\n T value;\r\n};\r\n\r\n#pragma warning(pop)\r\n" }, { "path": "benchmarks/inc/udt.hpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#pragma once\r\n\r\ntemplate \r\nstruct aggregate {\r\n Data c;\r\n\r\n friend bool operator==(const aggregate&, const aggregate&) = default;\r\n};\r\n\r\ntemplate \r\nstruct non_trivial {\r\n Data c;\r\n non_trivial() : c() {}\r\n non_trivial(const Data& src) : c(src) {}\r\n non_trivial(const non_trivial& other) : c(other.c) {}\r\n non_trivial& operator=(const non_trivial& other) {\r\n c = other.c;\r\n return *this;\r\n }\r\n ~non_trivial() {}\r\n\r\n friend bool operator==(const non_trivial&, const non_trivial&) = default;\r\n};\r\n" }, { "path": "benchmarks/inc/utility.hpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#pragma once\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\ntemplate class Alloc = std::allocator, class... Seed>\r\nstd::vector> random_vector(size_t n, Seed... seed) {\r\n std::vector> res(n);\r\n std::mt19937_64 prng{seed...};\r\n\r\n if constexpr (std::is_same_v) {\r\n std::generate(res.begin(), res.end(), [&prng] { return static_cast(prng() & 1); });\r\n } else {\r\n// Here, the type Contained can be char, int, aggregate, or non_trivial where Data is char or int.\r\n// (aggregate and non_trivial are defined in udt.hpp.)\r\n// static_cast silences truncation warnings when Contained is directly char or int,\r\n// but is insufficient for aggregate or non_trivial.\r\n#pragma warning(push)\r\n#pragma warning(disable : 4244) // warning C4244: conversion from 'uint64_t' to 'Data', possible loss of data\r\n std::generate(res.begin(), res.end(), [&prng] { return static_cast(prng()); });\r\n#pragma warning(pop)\r\n }\r\n\r\n return res;\r\n}\r\n" }, { "path": "benchmarks/src/adjacent_difference.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n mt19937 gen(96337);\r\n\r\n const size_t size = static_cast(state.range(0));\r\n\r\n vector> input(size);\r\n vector> output(size);\r\n\r\n if constexpr (is_floating_point_v) {\r\n normal_distribution dis(0, 100000.0);\r\n ranges::generate(input, [&] { return dis(gen); });\r\n } else {\r\n static_assert(is_unsigned_v, \"This avoids signed integers to avoid UB; they shouldn't perform differently\");\r\n uniform_int_distribution> dis(0, numeric_limits::max());\r\n ranges::generate(input, [&] { return static_cast(dis(gen)); });\r\n }\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(input);\r\n adjacent_difference(input.begin(), input.end(), output.begin());\r\n benchmark::DoNotOptimize(output);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(2255);\r\n}\r\n\r\n#pragma warning(push)\r\n#pragma warning(disable : 4244) // warning C4244: '=': conversion from 'int' to 'unsigned char', possible loss of data\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n#pragma warning(pop)\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/adjacent_find.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\nenum class AlgType { Std, Rng };\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n const size_t size = static_cast(state.range(0));\r\n const size_t pos = static_cast(state.range(1));\r\n\r\n vector> v(size);\r\n\r\n for (size_t i = 0; i != size; ++i) {\r\n v[i] = static_cast(i & 3);\r\n }\r\n\r\n if (pos == 0 || pos >= size) {\r\n abort();\r\n }\r\n\r\n v[pos] = v[pos - 1];\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Alg == AlgType::Std) {\r\n benchmark::DoNotOptimize(adjacent_find(v.begin(), v.end()));\r\n } else {\r\n benchmark::DoNotOptimize(ranges::adjacent_find(v));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->ArgPair(2525, 1142);\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/any_swap.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing trivial = std::array;\r\nstatic_assert(std::is_trivially_copyable_v);\r\n\r\nstruct small {\r\n std::array c{};\r\n small() = default;\r\n small(const small&) = default;\r\n small& operator=(const small&) = default;\r\n small(small&&) noexcept = default;\r\n small& operator=(small&&) noexcept = default;\r\n ~small() {}\r\n};\r\nstatic_assert(!std::is_trivially_copyable_v);\r\nstatic_assert(std::is_nothrow_move_constructible_v);\r\n\r\nusing large = std::array;\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n std::any a = T{};\r\n std::any b = T{};\r\n\r\n for (auto _ : state) {\r\n a.swap(b);\r\n benchmark::DoNotOptimize(a);\r\n benchmark::DoNotOptimize(b);\r\n }\r\n}\r\n\r\nBENCHMARK(bm);\r\nBENCHMARK(bm);\r\nBENCHMARK(bm);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/bitset_from_string.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nauto random_digits_init() {\r\n mt19937_64 rnd{};\r\n uniform_int_distribution<> dis('0', '1');\r\n\r\n constexpr size_t number_of_bitsets = (Min_length + N - 1) / N;\r\n static_assert(number_of_bitsets != 0);\r\n\r\n constexpr size_t actual_size = number_of_bitsets * (N + 1); // +1 for \\0\r\n\r\n array result;\r\n\r\n for (size_t i = 0; i < actual_size; ++i) {\r\n if (i % (N + 1) == N) {\r\n result[i] = charT{'\\0'}; // write null terminators\r\n } else {\r\n result[i] = static_cast(dis(rnd)); // fill random digits\r\n }\r\n }\r\n\r\n return result;\r\n}\r\n\r\nenum class length_type : bool { char_count, null_term };\r\n\r\ntemplate \r\nconst auto random_digits = random_digits_init();\r\n\r\ntemplate \r\nvoid bitset_from_string(benchmark::State& state) {\r\n auto digit_array = random_digits;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(digit_array);\r\n const auto arr_data = digit_array.data();\r\n const auto arr_size = digit_array.size();\r\n for (size_t pos = 0; pos != arr_size; pos += N + 1) {\r\n if constexpr (Length == length_type::char_count) {\r\n bitset bs(arr_data + pos, N);\r\n benchmark::DoNotOptimize(bs);\r\n } else {\r\n bitset bs(arr_data + pos);\r\n benchmark::DoNotOptimize(bs);\r\n }\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nbasic_string random_digits_contiguous_string_init() {\r\n mt19937_64 rnd{};\r\n uniform_int_distribution<> dis('0', '1');\r\n\r\n basic_string result;\r\n\r\n result.resize_and_overwrite(Length, [&](charT* ptr, size_t) {\r\n generate_n(ptr, Length, [&] { return static_cast(dis(rnd)); });\r\n return Length;\r\n });\r\n\r\n return result;\r\n}\r\n\r\ntemplate \r\nconst auto random_digits_contiguous_string = random_digits_contiguous_string_init();\r\n\r\ntemplate \r\nvoid bitset_from_stream(benchmark::State& state) {\r\n constexpr size_t string_length = 2048;\r\n constexpr size_t count = string_length / N;\r\n basic_istringstream stream(random_digits_contiguous_string);\r\n bitset bs;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(stream);\r\n for (size_t i = 0; i != count; ++i) {\r\n stream >> bs;\r\n }\r\n benchmark::DoNotOptimize(bs);\r\n stream.seekg(0);\r\n }\r\n}\r\n\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\n\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\n\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\n\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\nBENCHMARK(bitset_from_string);\r\n\r\nBENCHMARK(bitset_from_stream<15, char>);\r\nBENCHMARK(bitset_from_stream<16, char>);\r\nBENCHMARK(bitset_from_stream<36, char>);\r\nBENCHMARK(bitset_from_stream<64, char>);\r\nBENCHMARK(bitset_from_stream<512, char>);\r\nBENCHMARK(bitset_from_stream<2048, char>);\r\n\r\nBENCHMARK(bitset_from_stream<15, wchar_t>);\r\nBENCHMARK(bitset_from_stream<16, wchar_t>);\r\nBENCHMARK(bitset_from_stream<36, wchar_t>);\r\nBENCHMARK(bitset_from_stream<64, wchar_t>);\r\nBENCHMARK(bitset_from_stream<512, wchar_t>);\r\nBENCHMARK(bitset_from_stream<2048, wchar_t>);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/bitset_to_string.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nauto random_bits_init() {\r\n mt19937_64 rnd{};\r\n array arr;\r\n for (auto& d : arr) {\r\n d = rnd();\r\n }\r\n return arr;\r\n}\r\n\r\ntemplate \r\nconst auto random_bits = random_bits_init();\r\n\r\ntemplate \r\nvoid BM_bitset_to_string(benchmark::State& state) {\r\n static_assert(N <= 64);\r\n\r\n for (auto _ : state) {\r\n // make a copy, so that it can be potentially modified by DoNotOptimize\r\n for (auto bits : random_bits<>) {\r\n benchmark::DoNotOptimize(bits);\r\n bitset bs{bits};\r\n benchmark::DoNotOptimize(bs.template to_string());\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid BM_bitset_to_string_large_single(benchmark::State& state) {\r\n static_assert(N % 64 == 0 && N >= 64);\r\n const auto& bitset_data = random_bits;\r\n\r\n auto large_bitset = bit_cast>(bitset_data);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(large_bitset);\r\n benchmark::DoNotOptimize(large_bitset.template to_string());\r\n }\r\n}\r\n\r\nBENCHMARK(BM_bitset_to_string<15, char>);\r\nBENCHMARK(BM_bitset_to_string<64, char>);\r\nBENCHMARK(BM_bitset_to_string_large_single<512, char>);\r\nBENCHMARK(BM_bitset_to_string_large_single<2048, char>);\r\nBENCHMARK(BM_bitset_to_string<7, wchar_t>);\r\nBENCHMARK(BM_bitset_to_string<64, wchar_t>);\r\nBENCHMARK(BM_bitset_to_string_large_single<512, wchar_t>);\r\nBENCHMARK(BM_bitset_to_string_large_single<2048, wchar_t>);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/charconv_floats.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nvoid verify(const bool b) {\r\n if (!b) {\r\n puts(\"FAIL\");\r\n exit(EXIT_FAILURE);\r\n }\r\n}\r\n\r\nenum class RoundTrip { Sci, Fix, Gen, Hex, Lossy };\r\n\r\nconsteval chars_format chars_format_from_RoundTrip(const RoundTrip rt) {\r\n switch (rt) {\r\n case RoundTrip::Sci:\r\n return chars_format::scientific;\r\n case RoundTrip::Fix:\r\n return chars_format::fixed;\r\n case RoundTrip::Gen:\r\n return chars_format::general;\r\n case RoundTrip::Hex:\r\n return chars_format::hex;\r\n case RoundTrip::Lossy:\r\n default:\r\n exit(EXIT_FAILURE);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid test_to_chars(benchmark::State& state) {\r\n constexpr size_t n = 2'000'000; // how many floating-point values to test\r\n vector vec;\r\n vec.reserve(n);\r\n\r\n {\r\n mt19937_64 mt64;\r\n while (vec.size() < n) {\r\n using Integral = conditional_t;\r\n const Integral val = static_cast(mt64());\r\n constexpr Integral inf_nan = sizeof(Floating) == 4 ? 0x7F800000U : 0x7FF0000000000000ULL;\r\n if ((val & inf_nan) == inf_nan) {\r\n continue; // skip INF/NAN\r\n }\r\n vec.push_back(bit_cast(val));\r\n }\r\n }\r\n\r\n char buf[2'000]; // more than enough\r\n\r\n {\r\n auto it = vec.begin();\r\n for (auto _ : state) {\r\n auto result = to_chars(buf, end(buf), *it, Args...);\r\n\r\n benchmark::DoNotOptimize(result.ptr);\r\n benchmark::DoNotOptimize(buf);\r\n\r\n ++it;\r\n if (it == vec.end()) {\r\n it = vec.begin();\r\n }\r\n }\r\n }\r\n\r\n for (const auto& elem : vec) {\r\n const auto result = to_chars(buf, end(buf), elem, Args...);\r\n verify(result.ec == errc{});\r\n\r\n if constexpr (Rt == RoundTrip::Lossy) {\r\n // skip lossy conversions\r\n } else {\r\n Floating round_trip;\r\n const auto from_result = from_chars(buf, result.ptr, round_trip, chars_format_from_RoundTrip(Rt));\r\n verify(from_result.ec == errc{});\r\n verify(from_result.ptr == result.ptr);\r\n verify(round_trip == elem);\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_plain_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_plain_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_scientific_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_scientific_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_fixed_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_fixed_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_general_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_general_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_hex_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_hex_shortest\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_scientific_8\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_scientific_16\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_fixed_6_lossy\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_fixed_6_lossy\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_general_9\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_general_17\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_float_hex_6\");\r\nBENCHMARK(test_to_chars)->Name(\"STL_double_hex_13\");\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/efficient_nonlocking_print.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n// This benchmark inherently prints many lines to stdout. To view its results, run it with these options:\r\n// --benchmark_out=efficient_nonlocking_print.log --benchmark_out_format=console\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing PrintType = void (*)(FILE*, std::string_view, std::format_args);\r\n\r\ntemplate \r\nvoid BM_vprint(benchmark::State& state) {\r\n for (auto _ : state) {\r\n PrintFunction(stdout, \"Hello cool I am going to print as unicode\\n\", std::make_format_args());\r\n }\r\n}\r\nBENCHMARK(BM_vprint<&std::vprint_unicode>);\r\nBENCHMARK(BM_vprint<&std::vprint_unicode_buffered>);\r\n\r\ntemplate \r\nvoid BM_vprint_complex(benchmark::State& state) {\r\n const int i = 42;\r\n const std::string str = \"Hello world!!!!!!!!!!!!!!!!!!!!!!!!\";\r\n const double f = -902.16283758;\r\n const std::pair p{16, 2.073f};\r\n for (auto _ : state) {\r\n PrintFunction(stdout,\r\n \"Hello cool I am going to print as unicode!! {:X}, {}, {:a}, \"\r\n \"I am a big string, lots of words, multiple {} formats\\n\",\r\n std::make_format_args(i, str, f, p));\r\n }\r\n}\r\nBENCHMARK(BM_vprint_complex<&std::vprint_unicode>);\r\nBENCHMARK(BM_vprint_complex<&std::vprint_unicode_buffered>);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/filesystem.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\nvoid symlink_status(benchmark::State& state) {\r\n auto path = std::filesystem::temp_directory_path();\r\n\r\n for (auto _ : state) {\r\n std::error_code ec;\r\n benchmark::DoNotOptimize(path);\r\n auto status = std::filesystem::symlink_status(path, ec);\r\n benchmark::DoNotOptimize(status);\r\n benchmark::DoNotOptimize(ec);\r\n }\r\n}\r\n\r\nBENCHMARK(symlink_status);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/fill.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \r\n\r\ntemplate \r\nvoid handwritten_loop(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n std::vector> buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(buffer.data());\r\n Contained* ptr = buffer.data();\r\n const Contained* const ptr_end = ptr + r0;\r\n while (ptr != ptr_end) {\r\n *ptr++ = Value;\r\n }\r\n benchmark::DoNotOptimize(buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid handwritten_loop_n(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n std::vector> buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(buffer.data());\r\n Contained* ptr = buffer.data();\r\n for (size_t idx = 0; idx < r0; ++idx) {\r\n ptr[idx] = Value;\r\n }\r\n benchmark::DoNotOptimize(buffer.data());\r\n }\r\n}\r\n\r\n// Ensure that Contained and Value are ok for std::memset.\r\ntemplate \r\nvoid memset_call(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n std::vector> buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(buffer.data());\r\n Contained* ptr = buffer.data();\r\n std::memset(ptr, Value, r0 * sizeof(Contained));\r\n benchmark::DoNotOptimize(buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid std_fill_call(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n std::vector> buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(buffer.data());\r\n auto begin_it = buffer.data();\r\n auto end_it = buffer.data() + r0;\r\n std::fill(begin_it, end_it, Value);\r\n benchmark::DoNotOptimize(buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid std_fill_n_call(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n std::vector> buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(buffer.data());\r\n auto begin_it = buffer.data();\r\n std::fill_n(begin_it, r0, Value);\r\n benchmark::DoNotOptimize(buffer.data());\r\n }\r\n}\r\n\r\nBENCHMARK(handwritten_loop)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop_n)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop_n)->Range(0, 1 << 18);\r\nBENCHMARK(memset_call)->Range(0, 1 << 18);\r\nBENCHMARK(memset_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_fill_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_fill_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_fill_n_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_fill_n_call)->Range(0, 1 << 18);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/find_and_count.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nenum class Op {\r\n FindSized,\r\n FindUnsized,\r\n Count,\r\n StringFind,\r\n StringRFind,\r\n StringFindNotFirstOne,\r\n StringFindNotLastOne,\r\n};\r\n\r\nusing namespace std;\r\n\r\ntemplate class Alloc, Op Operation, T FillVal = T{'0'}, T FoundVal = T{'1'}>\r\nvoid bm(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n const auto pos = static_cast(state.range(1));\r\n\r\n using Container =\r\n conditional_t= Op::StringFind, basic_string, Alloc>, vector>>;\r\n\r\n Container a(size, FillVal);\r\n\r\n if (pos < size) {\r\n if constexpr (Operation == Op::StringRFind || Operation == Op::StringFindNotLastOne) {\r\n a[size - pos - 1] = FoundVal;\r\n } else {\r\n a[pos] = FoundVal;\r\n }\r\n } else {\r\n if constexpr (Operation == Op::FindUnsized) {\r\n abort();\r\n }\r\n }\r\n\r\n for (auto _ : state) {\r\n if constexpr (Operation == Op::FindSized) {\r\n benchmark::DoNotOptimize(ranges::find(a.begin(), a.end(), FoundVal));\r\n } else if constexpr (Operation == Op::FindUnsized) {\r\n benchmark::DoNotOptimize(ranges::find(a.begin(), unreachable_sentinel, FoundVal));\r\n } else if constexpr (Operation == Op::Count) {\r\n benchmark::DoNotOptimize(ranges::count(a.begin(), a.end(), FoundVal));\r\n } else if constexpr (Operation == Op::StringFind) {\r\n benchmark::DoNotOptimize(a.find(FoundVal));\r\n } else if constexpr (Operation == Op::StringRFind) {\r\n benchmark::DoNotOptimize(a.rfind(FoundVal));\r\n } else if constexpr (Operation == Op::StringFindNotFirstOne) {\r\n benchmark::DoNotOptimize(a.find_first_not_of(FillVal));\r\n } else if constexpr (Operation == Op::StringFindNotLastOne) {\r\n benchmark::DoNotOptimize(a.find_last_not_of(FillVal));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Args({8021, 3056});\r\n // AVX tail tests\r\n bm->Args({63, 62})->Args({31, 30})->Args({15, 14})->Args({7, 6});\r\n}\r\n\r\nstruct point {\r\n int16_t x{};\r\n int16_t y{};\r\n\r\n bool operator==(const point&) const = default;\r\n};\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/find_first_of.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\nenum class AlgType {\r\n std_func,\r\n str_member_first,\r\n str_member_last,\r\n str_member_first_not,\r\n str_member_last_not,\r\n};\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n const size_t Pos = static_cast(state.range(0));\r\n const size_t NSize = static_cast(state.range(1));\r\n const size_t HSize = Pos * 2;\r\n const size_t Which = 0;\r\n\r\n using container = conditional_t>,\r\n basic_string, not_highly_aligned_allocator>>;\r\n\r\n constexpr size_t IncrementCap = 16;\r\n\r\n constexpr T HaystackFillerBase = T{' '};\r\n static_assert(\r\n NeedleFillerBase + IncrementCap <= HaystackFillerBase || HaystackFillerBase + IncrementCap <= NeedleFillerBase,\r\n \"Would match where it shouldn't\");\r\n\r\n container h(HSize, T{0});\r\n container n(NSize, T{0});\r\n\r\n for (size_t i = 0; i != NSize; ++i) {\r\n n[i] = NeedleFillerBase + i % IncrementCap;\r\n }\r\n\r\n if (Pos >= HSize || Which >= NSize) {\r\n abort();\r\n }\r\n\r\n if constexpr (Alg == AlgType::str_member_first_not || Alg == AlgType::str_member_last_not) {\r\n for (size_t i = 0; i != HSize; ++i) {\r\n h[i] = n[(i + Which) % NSize];\r\n }\r\n\r\n h[Pos] = HaystackFillerBase;\r\n } else {\r\n for (size_t i = 0; i != HSize; ++i) {\r\n h[i] = HaystackFillerBase + i % IncrementCap;\r\n }\r\n\r\n h[Pos] = n[Which];\r\n }\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(h);\r\n benchmark::DoNotOptimize(n);\r\n if constexpr (Alg == AlgType::str_member_first) {\r\n benchmark::DoNotOptimize(h.find_first_of(n));\r\n } else if constexpr (Alg == AlgType::str_member_last) {\r\n benchmark::DoNotOptimize(h.find_last_of(n));\r\n } else if constexpr (Alg == AlgType::str_member_first_not) {\r\n benchmark::DoNotOptimize(h.find_first_not_of(n));\r\n } else if constexpr (Alg == AlgType::str_member_last_not) {\r\n benchmark::DoNotOptimize(h.find_last_not_of(n));\r\n } else {\r\n benchmark::DoNotOptimize(find_first_of(h.begin(), h.end(), n.begin(), n.end()));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Args({2, 3})->Args({6, 81})->Args({7, 4})->Args({9, 3})->Args({22, 5})->Args({58, 2});\r\n bm->Args({75, 85})->Args({102, 4})->Args({200, 46})->Args({325, 1})->Args({400, 50});\r\n bm->Args({1011, 11})->Args({1280, 46})->Args({1502, 23})->Args({2203, 54})->Args({3056, 7});\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/flat_meow_assign.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nvoid flat_map_strings_impl(benchmark::State& state, initializer_list> il) {\r\n flat_map pieces;\r\n for (auto _ : state) {\r\n pieces = il;\r\n benchmark::DoNotOptimize(pieces);\r\n }\r\n}\r\n\r\nvoid flat_map_strings(benchmark::State& state) {\r\n flat_map_strings_impl(\r\n state, {{\"soldier\"s, 1}, {\"soldier\"s, 2}, {\"soldier\"s, 3}, {\"soldier\"s, 4}, {\"soldier\"s, 5}, {\"soldier\"s, 6},\r\n {\"soldier\"s, 7}, {\"soldier\"s, 8}, {\"tower\"s, 9}, {\"horse\"s, 10}, {\"elephant\"s, 11}, {\"vizier\"s, 12},\r\n {\"king\"s, 13}, {\"elephant\"s, 14}, {\"horse\"s, 15}, {\"tower\"s, 16}});\r\n}\r\n\r\nvoid flat_set_strings_impl(benchmark::State& state, initializer_list il) {\r\n flat_set pieces;\r\n for (auto _ : state) {\r\n pieces = il;\r\n benchmark::DoNotOptimize(pieces);\r\n }\r\n}\r\n\r\nvoid flat_set_strings(benchmark::State& state) {\r\n flat_set_strings_impl(\r\n state, {\"soldier\"s, \"soldier\"s, \"soldier\"s, \"soldier\"s, \"soldier\"s, \"soldier\"s, \"soldier\"s, \"soldier\"s,\r\n \"tower\"s, \"horse\"s, \"elephant\"s, \"vizier\"s, \"king\"s, \"elephant\"s, \"horse\"s, \"tower\"s});\r\n}\r\n\r\nvoid flat_map_integers(benchmark::State& state) {\r\n flat_map pieces;\r\n for (auto _ : state) {\r\n pieces = {{'s', 1}, {'s', 2}, {'s', 3}, {'s', 4}, {'s', 5}, {'s', 6}, {'s', 7}, {'s', 8}, {'T', 9}, {'H', 10},\r\n {'E', 11}, {'V', 12}, {'K', 13}, {'E', 14}, {'H', 15}, {'T', 16}};\r\n benchmark::DoNotOptimize(pieces);\r\n }\r\n}\r\n\r\nvoid flat_set_integers(benchmark::State& state) {\r\n flat_set pieces;\r\n for (auto _ : state) {\r\n pieces = {'s', 's', 's', 's', 's', 's', 's', 's', 'T', 'H', 'E', 'V', 'K', 'E', 'H', 'T'};\r\n benchmark::DoNotOptimize(pieces);\r\n }\r\n}\r\n\r\nBENCHMARK(flat_map_strings);\r\nBENCHMARK(flat_set_strings);\r\nBENCHMARK(flat_map_integers);\r\nBENCHMARK(flat_set_integers);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/has_single_bit.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\n#include \r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nvoid bm_has_single_bit_if(benchmark::State& state) {\r\n auto random_v = random_vector(8);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(random_v);\r\n unsigned int count_true = 0;\r\n unsigned int count_false = 0;\r\n for (const auto& x : random_v) {\r\n if (has_single_bit(x)) {\r\n benchmark::DoNotOptimize(++count_true);\r\n } else {\r\n benchmark::DoNotOptimize(++count_false);\r\n }\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid bm_has_single_bit(benchmark::State& state) {\r\n auto random_v = random_vector(8);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(random_v);\r\n unsigned int r = 0;\r\n for (const auto& x : random_v) {\r\n r += has_single_bit(x);\r\n }\r\n benchmark::DoNotOptimize(r);\r\n }\r\n}\r\n\r\nBENCHMARK(bm_has_single_bit_if);\r\nBENCHMARK(bm_has_single_bit_if);\r\nBENCHMARK(bm_has_single_bit_if);\r\nBENCHMARK(bm_has_single_bit_if);\r\n\r\nBENCHMARK(bm_has_single_bit);\r\nBENCHMARK(bm_has_single_bit);\r\nBENCHMARK(bm_has_single_bit);\r\nBENCHMARK(bm_has_single_bit);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/includes.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\nenum class needle_spread { dense, dense_random, sparse, sparse_random };\r\n\r\ntemplate \r\nvoid bm_includes(benchmark::State& state) {\r\n const auto hay_size = static_cast(state.range(0));\r\n const auto needle_size = static_cast(state.range(1));\r\n const auto spread = static_cast(state.range(2));\r\n const auto expected_match = static_cast(state.range(3));\r\n\r\n auto hay = random_vector(hay_size);\r\n ranges::sort(hay);\r\n\r\n vector> needle;\r\n switch (spread) {\r\n case needle_spread::dense:\r\n needle.assign(hay.begin() + hay_size / 2 - needle_size / 2, hay.begin() + hay_size / 2 + (needle_size + 1) / 2);\r\n break;\r\n\r\n case needle_spread::dense_random:\r\n {\r\n mt19937 gen{};\r\n geometric_distribution dis_dis{};\r\n vector idx(needle_size);\r\n const size_t mid = needle_size / 2;\r\n idx[mid] = hay_size / 2;\r\n\r\n const size_t max_shift = hay_size / needle_size;\r\n\r\n for (size_t i = mid; i != 0; --i) {\r\n idx[i - 1] = idx[i] - min(dis_dis(gen) + 1, max_shift);\r\n }\r\n\r\n for (size_t i = mid; i != needle_size - 1; ++i) {\r\n idx[i + 1] = idx[i] + min(dis_dis(gen) + 1, max_shift);\r\n }\r\n\r\n needle.assign_range(idx | views::transform([&hay](const size_t i) { return hay[i]; }));\r\n }\r\n break;\r\n\r\n case needle_spread::sparse:\r\n needle.resize(needle_size);\r\n for (size_t i = 0; i != needle_size; ++i) {\r\n needle[i] = hay[hay_size * i / needle_size + hay_size / (needle_size * 2)];\r\n }\r\n break;\r\n\r\n case needle_spread::sparse_random:\r\n needle.resize(needle_size);\r\n ranges::sample(hay, needle.begin(), needle_size, mt19937{});\r\n break;\r\n }\r\n\r\n if (!expected_match) {\r\n const T v = needle[needle_size / 2];\r\n const T r = v != numeric_limits::max() ? v + 1 : v - 1;\r\n ranges::replace(hay, v, r);\r\n }\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(hay);\r\n benchmark::DoNotOptimize(needle);\r\n bool found;\r\n if constexpr (Alg == alg_type::rng) {\r\n found = ranges::includes(hay, needle);\r\n } else {\r\n found = includes(hay.begin(), hay.end(), needle.begin(), needle.end());\r\n }\r\n benchmark::DoNotOptimize(found);\r\n if (found != expected_match) {\r\n cerr << \"Unexpected 'includes' result: \" << found << '\\n';\r\n abort();\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n for (const auto& spread :\r\n {needle_spread::dense, needle_spread::dense_random, needle_spread::sparse, needle_spread::sparse_random}) {\r\n for (const auto& expected_match : {true, false}) {\r\n for (const auto& needle_size : {3, 22, 105, 1504, 2750}) {\r\n bm->Args({3000, needle_size, static_cast>(spread), expected_match});\r\n }\r\n\r\n for (const auto& needle_size : {3, 22, 105, 290}) {\r\n bm->Args({300, needle_size, static_cast>(spread), expected_match});\r\n }\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\n\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\n\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\n\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\nBENCHMARK(bm_includes)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/integer_to_string.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nauto generate_array() {\r\n array a;\r\n\r\n mt19937_64 gen;\r\n lognormal_distribution dis(M, S);\r\n auto get_clamped_value = [&] {\r\n for (;;) {\r\n const double dbl = floor(dis(gen));\r\n constexpr auto max_val = static_cast(numeric_limits::max());\r\n if (dbl <= max_val) {\r\n return static_cast(dbl);\r\n }\r\n }\r\n };\r\n ranges::generate(a, get_clamped_value);\r\n\r\n if constexpr (is_signed_v) {\r\n bernoulli_distribution b(0.5);\r\n ranges::for_each(a, [&](T& v) { v *= (b(gen) ? -1 : 1); });\r\n }\r\n\r\n return a;\r\n}\r\n\r\ntemplate \r\nvoid integer_to_chars(benchmark::State& state) {\r\n auto a = generate_array();\r\n char buff[20]; // can hold -2^63 and 2^64 - 1\r\n\r\n auto it = a.begin();\r\n for (auto _ : state) {\r\n auto i = *it;\r\n benchmark::DoNotOptimize(i);\r\n auto s = to_chars(begin(buff), end(buff), i);\r\n benchmark::DoNotOptimize(s.ec);\r\n benchmark::DoNotOptimize(s.ptr);\r\n\r\n ++it;\r\n if (it == a.end()) {\r\n it = a.begin();\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid internal_integer_to_buff(benchmark::State& state) {\r\n auto a = generate_array();\r\n\r\n CharT buff[20]; // can hold -2^63 and 2^64 - 1\r\n auto buff_end = end(buff);\r\n\r\n auto it = a.begin();\r\n for (auto _ : state) {\r\n auto i = *it;\r\n benchmark::DoNotOptimize(i);\r\n auto s = std::_UIntegral_to_buff(buff_end, i);\r\n benchmark::DoNotOptimize(s);\r\n\r\n ++it;\r\n if (it == a.end()) {\r\n it = a.begin();\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid integer_to_string(benchmark::State& state) {\r\n auto a = generate_array();\r\n\r\n auto it = a.begin();\r\n for (auto _ : state) {\r\n auto i = *it;\r\n benchmark::DoNotOptimize(i);\r\n auto s = to_string(i);\r\n benchmark::DoNotOptimize(s);\r\n\r\n ++it;\r\n if (it == a.end()) {\r\n it = a.begin();\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(integer_to_chars);\r\nBENCHMARK(integer_to_chars);\r\nBENCHMARK(integer_to_chars);\r\nBENCHMARK(integer_to_chars);\r\n\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\n\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\nBENCHMARK(internal_integer_to_buff);\r\n\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\n\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\nBENCHMARK(integer_to_string);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/iota.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nenum class Alg {\r\n Std,\r\n Rng,\r\n};\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n\r\n std::vector> a(size);\r\n\r\n for (auto _ : state) {\r\n if constexpr (Algorithm == Alg::Std) {\r\n std::iota(a.begin(), a.end(), T{22});\r\n } else if constexpr (Algorithm == Alg::Rng) {\r\n std::ranges::iota(a, T{22});\r\n }\r\n\r\n benchmark::DoNotOptimize(a);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(7)->Arg(18)->Arg(43)->Arg(131)->Arg(315)->Arg(1212);\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/is_sorted_until.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"utility.hpp\"\r\n\r\nenum class AlgType { Std, Rng };\r\n\r\ntemplate \r\nvoid bm_is_sorted_until(benchmark::State& state) {\r\n const std::size_t size = static_cast(state.range(0));\r\n const std::size_t sort_pos = static_cast(state.range(1));\r\n\r\n std::vector> v;\r\n if constexpr (std::is_integral_v) {\r\n v = random_vector(size);\r\n } else if constexpr (std::is_floating_point_v) {\r\n v.resize(size, 0.0);\r\n std::mt19937 gen;\r\n std::normal_distribution dis(0, 100000.0);\r\n std::generate_n(v.begin(), size, [&dis, &gen] { return dis(gen); });\r\n } else {\r\n static_assert(false);\r\n }\r\n\r\n std::sort(v.begin(), v.begin() + sort_pos);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Alg == AlgType::Std) {\r\n benchmark::DoNotOptimize(std::is_sorted_until(v.begin(), v.end()));\r\n } else {\r\n benchmark::DoNotOptimize(std::ranges::is_sorted_until(v));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->ArgPair(3000, 1800);\r\n}\r\n\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\n\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\n\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\nBENCHMARK(bm_is_sorted_until)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/locale_classic.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\nusing namespace std;\r\n\r\n// GH-3048 : Double-checked locking for locale::classic\r\nvoid BM_locale_classic(benchmark::State& state) {\r\n for (auto _ : state) {\r\n auto v = locale::classic();\r\n benchmark::DoNotOptimize(v);\r\n }\r\n}\r\nBENCHMARK(BM_locale_classic);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/locate_zone.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \"benchmark/benchmark.h\"\r\n#include \r\n\r\nvoid locate_zone(benchmark::State& state) {\r\n const auto& db = std::chrono::get_tzdb();\r\n for (auto _ : state) {\r\n for (const auto& z : db.zones) {\r\n auto res = db.locate_zone(z.name());\r\n benchmark::DoNotOptimize(res);\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(locate_zone);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/minmax_element.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nenum class Op {\r\n Min,\r\n Max,\r\n Both,\r\n Min_val,\r\n Max_val,\r\n Both_val,\r\n};\r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n vector> a(static_cast(state.range()));\r\n\r\n mt19937 gen(84710);\r\n\r\n if constexpr (is_floating_point_v) {\r\n normal_distribution dis(0, 100000.0);\r\n ranges::generate(a, [&] { return dis(gen); });\r\n } else {\r\n uniform_int_distribution> dis(1, 20);\r\n ranges::generate(a, [&] { return static_cast(dis(gen)); });\r\n }\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(a);\r\n\r\n if constexpr (Operation == Op::Min) {\r\n benchmark::DoNotOptimize(ranges::min_element(a));\r\n } else if constexpr (Operation == Op::Max) {\r\n benchmark::DoNotOptimize(ranges::max_element(a));\r\n } else if constexpr (Operation == Op::Both) {\r\n benchmark::DoNotOptimize(ranges::minmax_element(a));\r\n } else if constexpr (Operation == Op::Min_val) {\r\n benchmark::DoNotOptimize(ranges::min(a));\r\n } else if constexpr (Operation == Op::Max_val) {\r\n benchmark::DoNotOptimize(ranges::max(a));\r\n } else if constexpr (Operation == Op::Both_val) {\r\n benchmark::DoNotOptimize(ranges::minmax(a));\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid common_arg(benchmark::Benchmark* bm) {\r\n bm->Arg(8021);\r\n // AVX tail tests\r\n bm->Arg(63 / ElementSize);\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\nBENCHMARK(bm)->Apply(common_arg<1>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\nBENCHMARK(bm)->Apply(common_arg<2>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\nBENCHMARK(bm)->Apply(common_arg<4>);\r\n\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\nBENCHMARK(bm)->Apply(common_arg<8>);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/mismatch.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\nconstexpr int64_t no_pos = -1;\r\n\r\nenum class op {\r\n mismatch,\r\n lexi,\r\n};\r\n\r\nstruct color {\r\n uint16_t h;\r\n uint16_t s;\r\n uint16_t l;\r\n\r\n bool operator==(const color&) const = default;\r\n};\r\n\r\nconstexpr color c1{30000, 40000, 20000};\r\nconstexpr color c2{30000, 40000, 30000};\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n vector> a(static_cast(state.range(0)), MatchVal);\r\n vector> b(static_cast(state.range(0)), MatchVal);\r\n\r\n if (state.range(1) != no_pos) {\r\n b.at(static_cast(state.range(1))) = MismatchVal;\r\n }\r\n\r\n for (auto _ : state) {\r\n if constexpr (Op == op::mismatch) {\r\n benchmark::DoNotOptimize(ranges::mismatch(a, b));\r\n } else if constexpr (Op == op::lexi) {\r\n benchmark::DoNotOptimize(ranges::lexicographical_compare(a, b));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Args({8, 3})->Args({24, 22})->Args({105, -1})->Args({4021, 3056});\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args); // still optimized without vector algorithms using memcmp\r\nBENCHMARK(bm)->Apply(common_args); // optimized with vector algorithms only\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/move_only_function.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\n#ifdef __clang__\r\n#pragma clang diagnostic ignored \"-Wunqualified-std-cast-call\"\r\n#endif // defined(__clang__)\r\n\r\nusing namespace std;\r\n\r\nvoid mof_none(benchmark::State& state) {\r\n move_only_function mof;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(mof);\r\n }\r\n}\r\n\r\nvoid mof_construct(benchmark::State& state) {\r\n for (auto _ : state) {\r\n move_only_function mof;\r\n benchmark::DoNotOptimize(mof);\r\n }\r\n}\r\n\r\nvoid mof_move(benchmark::State& state) {\r\n move_only_function mof;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(mof);\r\n auto moved_mof = move(mof);\r\n benchmark::DoNotOptimize(moved_mof);\r\n }\r\n}\r\n\r\nvoid mof_construct_and_move(benchmark::State& state) {\r\n for (auto _ : state) {\r\n move_only_function mof;\r\n benchmark::DoNotOptimize(mof);\r\n auto moved_mof = move(mof);\r\n benchmark::DoNotOptimize(moved_mof);\r\n }\r\n}\r\n\r\nBENCHMARK(mof_none);\r\nBENCHMARK(mof_construct);\r\nBENCHMARK(mof_move);\r\nBENCHMARK(mof_construct_and_move);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/nth_element.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nconstexpr int tukey_ninther_adversary1[] = {0, 6, 12, 18, 22, 28, 34, 38, 44, 50, 54, 60, 66, 70, 76, 82, 86, 92, 98,\r\n 102, 108, 114, 118, 124, 130, 134, 140, 146, 150, 156, 162, 166, 172, 178, 182, 188, 194, 198, 204, 210, 214, 220,\r\n 226, 230, 236, 242, 246, 252, 258, 262, 268, 274, 278, 284, 290, 294, 300, 306, 310, 316, 322, 326, 332, 338, 342,\r\n 348, 354, 358, 364, 370, 374, 380, 386, 390, 396, 402, 406, 412, 418, 422, 428, 434, 438, 444, 450, 454, 460, 466,\r\n 470, 476, 482, 486, 492, 498, 502, 508, 514, 518, 524, 530, 534, 540, 546, 550, 556, 562, 566, 572, 578, 582, 588,\r\n 594, 598, 604, 610, 614, 620, 626, 630, 636, 642, 646, 652, 658, 662, 668, 674, 678, 1, 7, 13, 684, 19, 23, 29, 690,\r\n 35, 39, 45, 694, 51, 55, 61, 700, 67, 71, 77, 706, 83, 87, 93, 710, 99, 103, 109, 716, 115, 119, 125, 722, 131, 135,\r\n 141, 726, 147, 151, 157, 732, 163, 167, 173, 738, 179, 183, 189, 742, 195, 199, 205, 748, 211, 215, 221, 754, 227,\r\n 231, 237, 758, 243, 247, 253, 764, 259, 263, 269, 770, 275, 279, 285, 774, 291, 295, 301, 780, 307, 311, 317, 786,\r\n 323, 327, 333, 790, 339, 343, 349, 796, 355, 359, 365, 802, 371, 375, 381, 806, 387, 391, 397, 812, 403, 407, 413,\r\n 818, 419, 423, 429, 822, 435, 439, 445, 828, 451, 455, 461, 834, 467, 471, 477, 838, 483, 487, 493, 844, 499, 503,\r\n 509, 850, 515, 519, 525, 854, 531, 535, 541, 860, 547, 551, 557, 866, 563, 567, 573, 870, 579, 583, 589, 876, 595,\r\n 599, 605, 882, 611, 615, 621, 886, 627, 631, 637, 892, 643, 647, 653, 898, 659, 663, 669, 902, 675, 679, 685, 908,\r\n 691, 695, 701, 914, 707, 711, 717, 918, 723, 727, 733, 924, 739, 743, 749, 930, 755, 759, 765, 934, 771, 775, 781,\r\n 940, 787, 791, 797, 946, 803, 807, 813, 950, 819, 823, 829, 956, 835, 839, 845, 962, 851, 855, 861, 966, 867, 871,\r\n 877, 972, 883, 887, 893, 978, 899, 903, 909, 982, 915, 919, 925, 988, 931, 935, 941, 990, 947, 951, 957, 992, 963,\r\n 967, 973, 1024, 979, 983, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 2, 20, 8, 14, 24, 36, 30, 40, 52, 46,\r\n 56, 68, 62, 72, 84, 78, 88, 100, 94, 104, 116, 110, 120, 132, 126, 136, 148, 142, 152, 164, 158, 168, 180, 174, 184,\r\n 196, 190, 200, 212, 206, 216, 228, 222, 232, 244, 238, 248, 260, 254, 264, 276, 270, 280, 292, 286, 296, 308, 302,\r\n 312, 324, 318, 328, 340, 334, 344, 356, 350, 360, 372, 366, 376, 388, 382, 392, 404, 398, 408, 420, 414, 424, 436,\r\n 430, 440, 452, 446, 456, 468, 462, 472, 484, 478, 488, 500, 494, 504, 516, 510, 520, 532, 526, 536, 548, 542, 552,\r\n 564, 558, 568, 580, 574, 584, 596, 590, 600, 612, 606, 616, 628, 622, 632, 644, 638, 648, 660, 654, 664, 676, 670,\r\n 512, 3, 991, 9, 773, 768, 15, 680, 901, 21, 522, 25, 777, 527, 31, 692, 965, 37, 528, 41, 960, 778, 47, 686, 905,\r\n 53, 538, 57, 936, 543, 63, 696, 1007, 69, 544, 73, 789, 784, 79, 708, 1014, 85, 554, 89, 793, 559, 95, 702, 969,\r\n 101, 560, 105, 911, 794, 111, 712, 974, 117, 570, 121, 948, 575, 127, 724, 1015, 133, 576, 137, 805, 800, 143, 718,\r\n 917, 149, 586, 153, 809, 591, 159, 728, 1008, 165, 592, 169, 970, 810, 175, 740, 921, 181, 602, 185, 942, 607, 191,\r\n 734, 1009, 197, 608, 201, 821, 816, 207, 744, 975, 213, 618, 217, 825, 623, 223, 756, 1005, 229, 624, 233, 927, 826,\r\n 239, 750, 984, 245, 634, 249, 952, 639, 255, 760, 1010, 261, 640, 265, 837, 832, 271, 772, 933, 277, 650, 281, 841,\r\n 655, 287, 766, 981, 293, 656, 297, 976, 842, 303, 776, 937, 309, 666, 313, 964, 671, 319, 788, 1011, 325, 672, 329,\r\n 853, 848, 335, 782, 1016, 341, 682, 345, 857, 687, 351, 792, 985, 357, 688, 361, 943, 858, 367, 804, 1003, 373, 698,\r\n 377, 958, 703, 383, 798, 1017, 389, 704, 393, 869, 864, 399, 808, 949, 405, 714, 409, 873, 719, 415, 820, 1012, 421,\r\n 720, 425, 986, 874, 431, 814, 953, 437, 730, 441, 968, 735, 447, 824, 1013, 453, 736, 457, 885, 880, 463, 836, 989,\r\n 469, 746, 473, 889, 751, 479, 830, 1006, 485, 752, 489, 959, 890, 495, 840, 1004, 501, 762, 505, 980, 767, 511, 852,\r\n 4, 517, 10, 521, 16, 896, 26, 846, 32, 533, 42, 537, 48, 783, 58, 856, 64, 549, 74, 553, 80, 906, 90, 868, 96, 565,\r\n 106, 569, 112, 799, 122, 862, 128, 581, 138, 585, 144, 912, 154, 72, 160, 597, 170, 601, 176, 815, 186, 884, 192,\r\n 613, 202, 617, 208, 922, 218, 878, 224, 629, 234, 633, 240, 831, 250, 888, 256, 645, 266, 649, 272, 928, 282, 900,\r\n 288, 661, 298, 665, 304, 847, 314, 894, 320, 677, 330, 681, 336, 938, 346, 904, 352, 693, 362, 697, 368, 863, 378,\r\n 916, 384, 709, 394, 713, 400, 944, 410, 910, 416, 725, 426, 729, 432, 879, 442, 920, 448, 741, 458, 745, 464, 954,\r\n 474, 932, 480, 757, 490, 761, 496, 895, 506, 926, 5, 11, 17, 27, 33, 43, 49, 59, 65, 75, 81, 91, 97, 107, 113, 123,\r\n 129, 139, 145, 155, 161, 71, 177, 187, 193, 203, 209, 219, 225, 235, 241, 251, 257, 267, 273, 283, 289, 299, 305,\r\n 315, 321, 331, 337, 347, 353, 363, 369, 379, 385, 395, 401, 411, 417, 427, 433, 443, 449, 459, 465, 475, 481, 491,\r\n 497, 507, 513, 523, 529, 539, 545, 555, 561, 571, 577, 587, 593, 603, 609, 619, 625, 635, 641, 651, 657, 667, 673,\r\n 683, 689, 699, 705, 715, 721, 731, 737, 747, 753, 763, 769, 779, 785, 795, 801, 811, 817, 827, 833, 843, 849, 859,\r\n 865, 875, 881, 891, 897, 907, 913, 923, 929, 939, 945, 955, 961, 971, 977, 987, 1018, 1019, 1020, 1021, 1022};\r\n\r\nconstexpr int tukey_ninther_adversary2[] = {1024, 31, 30, 29, 28, 36, 46, 51, 61, 67, 77, 82, 92, 98, 108, 118, 123,\r\n 133, 139, 149, 154, 164, 170, 180, 190, 195, 205, 211, 221, 226, 236, 242, 252, 262, 267, 277, 283, 293, 298, 308,\r\n 314, 324, 334, 339, 349, 355, 365, 370, 380, 386, 396, 406, 411, 421, 427, 437, 442, 452, 458, 468, 478, 483, 493,\r\n 499, 509, 514, 524, 530, 540, 550, 555, 565, 571, 581, 586, 596, 602, 612, 622, 627, 637, 643, 653, 658, 668, 674,\r\n 684, 694, 699, 709, 715, 725, 730, 740, 746, 756, 766, 771, 781, 787, 797, 802, 812, 818, 828, 838, 843, 853, 859,\r\n 869, 874, 884, 890, 900, 910, 915, 925, 931, 941, 946, 956, 962, 972, 982, 987, 997, 1003, 1013, 1018, 343, 523,\r\n 127, 529, 86, 539, 358, 549, 178, 554, 107, 564, 374, 570, 183, 580, 384, 585, 389, 595, 394, 601, 399, 611, 404,\r\n 621, 409, 626, 18, 636, 419, 642, 425, 652, 318, 657, 435, 667, 440, 673, 169, 683, 450, 693, 224, 698, 256, 708,\r\n 179, 714, 66, 724, 234, 729, 487, 739, 189, 745, 34, 755, 502, 765, 71, 770, 188, 780, 518, 786, 76, 796, 528, 801,\r\n 533, 811, 538, 817, 543, 827, 548, 837, 553, 842, 163, 852, 563, 858, 569, 868, 286, 873, 579, 883, 584, 889, 70,\r\n 899, 594, 909, 219, 914, 97, 924, 235, 930, 91, 940, 462, 945, 631, 955, 173, 961, 241, 971, 646, 981, 322, 986,\r\n 272, 996, 662, 1002, 327, 1012, 672, 1017, 677, 1023, 682, 184, 687, 44, 692, 80, 697, 703, 390, 347, 707, 193, 713,\r\n 718, 534, 276, 723, 26, 728, 734, 32, 200, 738, 744, 368, 749, 137, 754, 15, 759, 25, 764, 378, 769, 775, 575, 90,\r\n 779, 148, 785, 790, 297, 215, 795, 225, 800, 806, 447, 56, 810, 816, 27, 821, 153, 826, 616, 831, 152, 836, 59, 841,\r\n 847, 472, 632, 851, 116, 857, 862, 430, 214, 867, 647, 872, 878, 106, 251, 882, 888, 21, 893, 332, 898, 87, 903,\r\n 132, 908, 678, 913, 919, 456, 168, 923, 230, 929, 934, 519, 466, 939, 19, 944, 950, 353, 471, 954, 960, 364, 965,\r\n 719, 970, 271, 975, 544, 980, 369, 985, 991, 210, 491, 995, 282, 1001, 1006, 750, 250, 1011, 121, 1016, 1022, 385,\r\n 292, 507, 65, 512, 255, 102, 776, 395, 45, 159, 287, 522, 260, 591, 791, 405, 117, 204, 307, 49, 265, 302, 807, 606,\r\n 400, 22, 111, 16, 344, 822, 420, 313, 303, 415, 832, 275, 203, 559, 23, 416, 426, 323, 848, 281, 231, 209, 317, 574,\r\n 436, 17, 863, 142, 333, 220, 488, 431, 441, 81, 879, 75, 590, 451, 663, 328, 446, 894, 296, 375, 600, 261, 904, 457,\r\n 348, 605, 337, 610, 60, 688, 920, 467, 96, 615, 461, 620, 306, 354, 935, 477, 704, 625, 24, 312, 128, 143, 951, 476,\r\n 635, 174, 131, 641, 240, 966, 492, 481, 138, 359, 976, 40, 363, 651, 735, 656, 498, 379, 992, 20, 497, 39, 560, 666,\r\n 508, 112, 1007, 246, 158, 162, 760, 503, 513, 482, 291, 410, 245, 338, 199, 266, 147, 194, 101, 122, 55, 50, 14, 13,\r\n 43, 48, 58, 64, 74, 79, 95, 105, 115, 120, 130, 136, 146, 151, 167, 177, 187, 192, 202, 208, 218, 223, 239, 249,\r\n 259, 264, 274, 280, 290, 295, 311, 321, 331, 336, 346, 352, 362, 367, 383, 393, 403, 408, 418, 424, 434, 439, 455,\r\n 465, 475, 480, 490, 496, 506, 511, 527, 537, 547, 552, 562, 568, 578, 583, 599, 609, 619, 624, 634, 640, 650, 655,\r\n 671, 681, 691, 696, 706, 712, 722, 727, 743, 753, 763, 768, 778, 784, 794, 799, 815, 825, 835, 840, 850, 856, 866,\r\n 871, 887, 897, 907, 912, 922, 928, 938, 943, 959, 969, 979, 984, 994, 1000, 1010, 1015, 1021, 1005, 990, 953, 974,\r\n 964, 949, 933, 918, 881, 902, 892, 877, 861, 846, 809, 830, 820, 805, 789, 774, 737, 758, 748, 733, 717, 702, 665,\r\n 686, 676, 661, 645, 630, 593, 614, 604, 589, 573, 558, 521, 542, 532, 517, 501, 486, 449, 470, 460, 445, 429, 414,\r\n 377, 398, 388, 373, 357, 342, 305, 326, 316, 301, 285, 270, 233, 254, 244, 229, 213, 198, 161, 182, 172, 157, 141,\r\n 126, 89, 110, 100, 85, 69, 54, 12, 38, 11, 10, 9, 8, 53, 84, 99, 125, 156, 171, 197, 228, 243, 269, 300, 315, 341,\r\n 372, 387, 413, 444, 459, 485, 516, 531, 557, 588, 603, 629, 660, 675, 701, 732, 747, 773, 804, 819, 845, 876, 891,\r\n 917, 948, 963, 989, 1020, 1014, 63, 253, 258, 263, 279, 273, 284, 289, 294, 310, 304, 320, 73, 325, 330, 335, 351,\r\n 345, 356, 361, 366, 382, 376, 392, 88, 397, 402, 407, 423, 417, 428, 433, 438, 454, 448, 464, 109, 469, 474, 479,\r\n 495, 489, 500, 505, 510, 526, 520, 536, 135, 541, 546, 551, 567, 561, 572, 577, 582, 598, 592, 608, 145, 613, 618,\r\n 623, 639, 633, 644, 649, 654, 670, 664, 680, 160, 685, 690, 695, 711, 705, 716, 721, 726, 742, 736, 752, 181, 757,\r\n 762, 767, 783, 777, 788, 793, 798, 814, 808, 824, 207, 829, 834, 839, 855, 849, 860, 865, 870, 886, 880, 896, 217,\r\n 901, 906, 911, 927, 921, 932, 937, 942, 958, 952, 968, 232, 973, 978, 983, 999, 993, 1004, 1009, 248, 238, 222, 212,\r\n 201, 191, 186, 37, 176, 166, 150, 140, 129, 119, 114, 3, 104, 94, 78, 68, 57, 47, 42, 6, 7, 4, 5, 2, -1, 33, 35, 41,\r\n 52, 62, 72, 83, 93, 103, 113, 124, 134, 144, 155, 165, 175, 185, 196, 206, 216, 227, 237, 247, 257, 268, 278, 288,\r\n 299, 309, 319, 329, 340, 350, 360, 371, 381, 391, 401, 412, 422, 432, 443, 453, 463, 473, 484, 494, 504, 515, 525,\r\n 535, 545, 556, 566, 576, 587, 597, 607, 617, 628, 638, 648, 659, 669, 679, 689, 700, 710, 720, 731, 741, 751, 761,\r\n 772, 782, 792, 803, 813, 823, 833, 844, 854, 864, 875, 885, 895, 905, 916, 926, 936, 947, 957, 967, 977, 988, 998,\r\n 1008, 1019};\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\ntemplate \r\nvoid benchmark_common(benchmark::State& state, const Src& src) {\r\n vector v;\r\n v.reserve(size(src));\r\n\r\n for (auto _ : state) {\r\n v.assign(begin(src), end(src));\r\n benchmark::DoNotOptimize(v);\r\n auto mid = v.begin() + (v.size() / 2);\r\n if constexpr (Type == alg_type::std_fn) {\r\n nth_element(v.begin(), mid, v.end());\r\n } else {\r\n ranges::nth_element(v.begin(), mid, v.end());\r\n }\r\n benchmark::DoNotOptimize(*mid);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid bm_uniform(benchmark::State& state) {\r\n vector src(static_cast(state.range()));\r\n mt19937 gen(84710);\r\n uniform_int_distribution dis(1, 580);\r\n ranges::generate(src, [&] { return dis(gen); });\r\n benchmark_common(state, src);\r\n}\r\n\r\nBENCHMARK(bm_uniform)->Arg(1024)->Arg(2048)->Arg(4096)->Arg(8192);\r\nBENCHMARK(bm_uniform)->Arg(1024)->Arg(2048)->Arg(4096)->Arg(8192);\r\n\r\nBENCHMARK_CAPTURE(benchmark_common, adversary1, tukey_ninther_adversary1);\r\nBENCHMARK_CAPTURE(benchmark_common, adversary1, tukey_ninther_adversary1);\r\nBENCHMARK_CAPTURE(benchmark_common, adversary2, tukey_ninther_adversary2);\r\nBENCHMARK_CAPTURE(benchmark_common, adversary2, tukey_ninther_adversary2);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/path_lexically_normal.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\nvoid BM_lexically_normal(benchmark::State& state) {\r\n using namespace std::literals;\r\n static constexpr std::wstring_view args[5]{\r\n LR\"(C:Snippets)\"sv,\r\n LR\"(.\\Snippets)\"sv,\r\n LR\"(..\\..\\IDE\\VC\\Snippets)\"sv,\r\n LR\"(C:\\Program Files\\Microsoft Visual Studio\\2022\\Community\\Common7\\IDE\\VC\\Snippets)\"sv,\r\n LR\"(/\\server/\\share/\\a/\\b/\\c/\\./\\./\\d/\\../\\../\\../\\../\\../\\../\\../\\other/x/y/z/.././..\\meow.txt)\"sv,\r\n };\r\n\r\n const auto index = state.range(0);\r\n const std::filesystem::path p(args[index]);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(p.lexically_normal());\r\n }\r\n}\r\n\r\nBENCHMARK(BM_lexically_normal)->DenseRange(0, 4, 1);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/priority_queue_push_range.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nconstexpr size_t vec_size = 10'000;\r\n\r\ntemplate \r\nauto create_vec(Fn transformation) {\r\n vector vec(vec_size);\r\n for (mt19937_64 rnd(1); auto& e : vec) {\r\n e = transformation(rnd());\r\n }\r\n return vec;\r\n}\r\n\r\ntemplate \r\nT cast_to(uint64_t val) {\r\n return static_cast(val);\r\n}\r\n\r\nconst auto vec_u8 = create_vec(cast_to);\r\nconst auto vec_u16 = create_vec(cast_to);\r\nconst auto vec_u32 = create_vec(cast_to);\r\nconst auto vec_u64 = create_vec(cast_to);\r\nconst auto vec_float = create_vec(cast_to);\r\nconst auto vec_double = create_vec(cast_to);\r\n\r\nconst auto vec_str = create_vec([](uint64_t val) { return to_string(static_cast(val)); });\r\nconst auto vec_wstr = create_vec([](uint64_t val) { return to_wstring(static_cast(val)); });\r\n\r\ntemplate \r\nvoid BM_push_range(benchmark::State& state) {\r\n const size_t frag_size = static_cast(state.range(0));\r\n\r\n for (auto _ : state) {\r\n priority_queue que;\r\n span spn{Data};\r\n\r\n while (!spn.empty()) {\r\n const size_t take_size = min(spn.size(), frag_size);\r\n que.push_range(spn.first(take_size));\r\n spn = spn.subspan(take_size);\r\n }\r\n benchmark::DoNotOptimize(que);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->RangeMultiplier(100)->Range(1, vec_size)->Arg(vec_size / 2 + 1);\r\n}\r\n\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\n\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\nBENCHMARK(BM_push_range)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/random_integer_generation.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\n/// Test URBGs alone\r\n\r\nvoid BM_mt19937(benchmark::State& state) {\r\n std::mt19937 gen;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(gen());\r\n }\r\n}\r\nBENCHMARK(BM_mt19937);\r\n\r\nvoid BM_mt19937_64(benchmark::State& state) {\r\n std::mt19937_64 gen;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(gen());\r\n }\r\n}\r\nBENCHMARK(BM_mt19937_64);\r\n\r\nvoid BM_lcg(benchmark::State& state) {\r\n std::minstd_rand gen;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(gen());\r\n }\r\n}\r\nBENCHMARK(BM_lcg);\r\n\r\n/// Test discard()\r\n\r\ntemplate \r\nvoid BM_discard(benchmark::State& state) {\r\n Engine gen;\r\n const auto n = static_cast(state.range(0));\r\n for (auto _ : state) {\r\n gen.discard(n);\r\n benchmark::DoNotOptimize(gen());\r\n }\r\n}\r\nBENCHMARK(BM_discard)->Range(0, 1 << 18);\r\nBENCHMARK(BM_discard)->Range(0, 1 << 18);\r\nBENCHMARK(BM_discard)->Range(0, 1 << 18);\r\n\r\n/// Support machinery for testing _Rng_from_urng_v2\r\n\r\nstd::uint32_t GetMax() {\r\n std::mt19937 gen;\r\n std::uniform_int_distribution dist(10'000'000, 20'000'000);\r\n return dist(gen);\r\n}\r\n\r\nconst std::uint32_t maximum = GetMax(); // random divisor to prevent strength reduction\r\n\r\n/// Test mt19937\r\n\r\nvoid BM_raw_mt19937_new(benchmark::State& state) {\r\n std::mt19937 gen;\r\n std::_Rng_from_urng_v2 rng(gen);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(rng(maximum));\r\n }\r\n}\r\nBENCHMARK(BM_raw_mt19937_new);\r\n\r\n/// Test mt19937_64\r\n\r\nvoid BM_raw_mt19937_64_new(benchmark::State& state) {\r\n std::mt19937_64 gen;\r\n std::_Rng_from_urng_v2 rng(gen);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(rng(maximum));\r\n }\r\n}\r\nBENCHMARK(BM_raw_mt19937_64_new);\r\n\r\n/// Test minstd_rand\r\n\r\nvoid BM_raw_lcg_new(benchmark::State& state) {\r\n std::minstd_rand gen;\r\n std::_Rng_from_urng_v2 rng(gen);\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(rng(maximum));\r\n }\r\n}\r\nBENCHMARK(BM_raw_lcg_new);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/ranges_div_ceil.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nstruct Data {\r\n _Signed128 num;\r\n _Signed128 den;\r\n};\r\n\r\nconstexpr Data d1{_Signed128{0x0000'1111'2222'3333LL, 0x4444'5555'6666'7777LL}, 0x7777'8888};\r\nstatic_assert(d1.num > numeric_limits::max());\r\nstatic_assert(d1.den <= numeric_limits::max());\r\n\r\nconstexpr Data d2{_Signed128{0x0000'1111'2222'3333LL, 0x4444'5555'6666'7777LL}, 0x7777'8888'9999'AAAA};\r\nstatic_assert(d2.num > numeric_limits::max());\r\nstatic_assert(d2.den <= numeric_limits::max());\r\n\r\nconstexpr Data d3{\r\n _Signed128{0x0000'1111'2222'3333LL, 0x4444'5555'6666'7777LL}, _Signed128{0x7777'8888'9999'AAAA, 0xBBBB}};\r\nstatic_assert(d3.num > numeric_limits::max());\r\nstatic_assert(d3.den > numeric_limits::max());\r\n\r\nvoid bm(benchmark::State& state, const Data& data) {\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(ranges::_Div_ceil(data.num, data.den));\r\n }\r\n}\r\n\r\nBENCHMARK_CAPTURE(bm, div_ceil_int128_uint32, d1);\r\nBENCHMARK_CAPTURE(bm, div_ceil_int128_uint64, d2);\r\nBENCHMARK_CAPTURE(bm, div_ceil_int128_int128, d3);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/regex_match.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nusing namespace std;\r\nusing namespace regex_constants;\r\n\r\nvoid bm_match_sequence_of_as(benchmark::State& state, const char* pattern, syntax_option_type syntax = ECMAScript) {\r\n string input(static_cast(state.range()), 'a');\r\n regex re{pattern, syntax};\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(input);\r\n const char* pos = input.data();\r\n const char* end = input.data() + input.size();\r\n cmatch match;\r\n regex_match(pos, end, match, re);\r\n }\r\n}\r\n\r\nvoid bm_match_sequence_of_9a1b(benchmark::State& state, const char* pattern, syntax_option_type syntax = ECMAScript) {\r\n string input;\r\n for (int i = 0; i < state.range(); ++i) {\r\n input += \"aaaaaaaaab\";\r\n }\r\n\r\n regex re{pattern, syntax};\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(input);\r\n const char* pos = input.data();\r\n const char* end = input.data() + input.size();\r\n cmatch match;\r\n regex_match(pos, end, match, re);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(100)->Arg(200)->Arg(400);\r\n}\r\n\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"a*\", \"a*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"a*?\", \"a*?\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(?:a)*\", \"(?:a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(a)*\", \"(a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(a)*?\", \"(a)*?\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(?:b|a)*\", \"(?:b|a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(b|a)*\", \"(b|a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(a)(?:b|a)*\", \"(a)(?:b|a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(a)(b|a)*\", \"(a)(b|a)*\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_as, \"(a)(?:b|a)*c\", \"(a)(?:b|a)*c\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_match_sequence_of_9a1b, \"(?:a*b)*\", \"(?:a*b)*\")->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/regex_search.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n\r\n#include \"lorem.hpp\"\r\n\r\nusing namespace std;\r\nusing namespace regex_constants;\r\n\r\nvoid bm_lorem_search(benchmark::State& state, const char* pattern, syntax_option_type syntax = ECMAScript) {\r\n string repeated_lorem{lorem_ipsum};\r\n for (long long i = 0; i < state.range(); ++i) {\r\n repeated_lorem += repeated_lorem;\r\n }\r\n regex re{pattern, syntax};\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(repeated_lorem);\r\n const char* pos = repeated_lorem.data();\r\n const char* end = repeated_lorem.data() + repeated_lorem.size();\r\n cmatch match;\r\n for (; regex_search(pos, end, match, re); ++pos) {\r\n benchmark::DoNotOptimize(match);\r\n pos = match[0].second;\r\n if (pos == end) {\r\n break;\r\n }\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(2)->Arg(3)->Arg(4);\r\n}\r\n\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"^bibe\", \"^bibe\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"bibe\", \"bibe\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"bibe\".collate, \"bibe\", regex_constants::collate)->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"(bibe)\", \"(bibe)\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"(bibe)+\", \"(bibe)+\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, \"(?:bibe)+\", \"(?:bibe)+\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, R\"(\\bbibe)\", R\"(\\bbibe)\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, R\"(\\Bibe)\", R\"(\\Bibe)\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, R\"((?=....)bibe)\", R\"((?=....)bibe)\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, R\"((?=bibe)....)\", R\"((?=bibe)....)\")->Apply(common_args);\r\nBENCHMARK_CAPTURE(bm_lorem_search, R\"((?!lorem)bibe)\", R\"((?!lorem)bibe)\")->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/remove.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"lorem.hpp\"\r\n#include \"skewed_allocator.hpp\"\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\ntemplate \r\nvoid r(benchmark::State& state) {\r\n const std::vector> src(lorem_ipsum.begin(), lorem_ipsum.end());\r\n std::vector> v;\r\n v.reserve(lorem_ipsum.size());\r\n for (auto _ : state) {\r\n v = src;\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Type == alg_type::std_fn) {\r\n benchmark::DoNotOptimize(std::remove(v.begin(), v.end(), T{'l'}));\r\n } else {\r\n benchmark::DoNotOptimize(std::ranges::remove(v, T{'l'}));\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid rc(benchmark::State& state) {\r\n std::vector> src(lorem_ipsum.begin(), lorem_ipsum.end());\r\n std::vector> v(lorem_ipsum.size());\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(src);\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Type == alg_type::std_fn) {\r\n benchmark::DoNotOptimize(std::remove_copy(src.begin(), src.end(), v.begin(), T{'l'}));\r\n } else {\r\n benchmark::DoNotOptimize(std::ranges::remove_copy(src, v.begin(), T{'l'}));\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\n\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\n\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\n\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/replace.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"lorem.hpp\"\r\n#include \"skewed_allocator.hpp\"\r\n\r\ntemplate \r\nvoid r(benchmark::State& state) {\r\n std::vector> a(lorem_ipsum.begin(), lorem_ipsum.end());\r\n std::vector> b(lorem_ipsum.size());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(a);\r\n b = a;\r\n std::replace(std::begin(b), std::end(b), T{'m'}, T{'w'});\r\n benchmark::DoNotOptimize(b);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid rc(benchmark::State& state) {\r\n std::vector> a(lorem_ipsum.begin(), lorem_ipsum.end());\r\n std::vector> b(lorem_ipsum.size());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(a);\r\n std::replace_copy(std::begin(a), std::end(a), std::begin(b), T{'m'}, T{'w'});\r\n benchmark::DoNotOptimize(b);\r\n }\r\n}\r\n\r\n// replace() is vectorized for 4 and 8 bytes only.\r\nBENCHMARK(r);\r\nBENCHMARK(r);\r\n\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\nBENCHMARK(rc);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/reverse.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"utility.hpp\"\r\n\r\ntemplate \r\nvoid r(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n auto v = random_vector(size);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(v);\r\n std::reverse(v.begin(), v.end());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid rc(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n auto v = random_vector(size);\r\n std::vector> d(size);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(v);\r\n std::reverse_copy(v.begin(), v.end(), d.begin());\r\n benchmark::DoNotOptimize(d);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(3449);\r\n // AVX tail tests\r\n bm->Arg(63)->Arg(31)->Arg(15)->Arg(7);\r\n}\r\n\r\n\r\nBENCHMARK(r)->Apply(common_args);\r\nBENCHMARK(r)->Apply(common_args);\r\nBENCHMARK(r)->Apply(common_args);\r\nBENCHMARK(r)->Apply(common_args);\r\n\r\nBENCHMARK(rc)->Apply(common_args);\r\nBENCHMARK(rc)->Apply(common_args);\r\nBENCHMARK(rc)->Apply(common_args);\r\nBENCHMARK(rc)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/rotate.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nenum class AlgType { Std, Rng };\r\n\r\ntemplate \r\nvoid bm_rotate(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n const auto n = static_cast(state.range(1));\r\n\r\n auto v = random_vector(size);\r\n benchmark::DoNotOptimize(v);\r\n\r\n for (auto _ : state) {\r\n if constexpr (Alg == AlgType::Std) {\r\n rotate(v.begin(), v.begin() + n, v.end());\r\n } else {\r\n ranges::rotate(v, v.begin() + n);\r\n }\r\n benchmark::DoNotOptimize(v);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Args({3333, 2242})->Args({3332, 1666})->Args({3333, 1111})->Args({3333, 501});\r\n bm->Args({3333, 3300})->Args({3333, 12})->Args({3333, 5})->Args({3333, 1});\r\n bm->Args({333, 101})->Args({123, 32})->Args({23, 7})->Args({12, 5})->Args({3, 2});\r\n}\r\n\r\nstruct color {\r\n uint16_t h;\r\n uint16_t s;\r\n uint16_t l;\r\n};\r\n\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\n\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\nBENCHMARK(bm_rotate)->Apply(common_args);\r\n\r\nBENCHMARK(bm_rotate)->Args({35000, 520})->Args({35000, 3000});\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/sample.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\ntemplate \r\nvoid bm_sample(benchmark::State& state) {\r\n static_assert(is_unsigned_v, \"T must be unsigned so iota() doesn't have to worry about overflow.\");\r\n\r\n const auto population_size = static_cast(state.range(0));\r\n const auto sampled_size = static_cast(state.range(1));\r\n\r\n vector population(population_size);\r\n vector sampled(sampled_size);\r\n iota(population.begin(), population.end(), T{0});\r\n mt19937_64 urbg;\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(population);\r\n if constexpr (Alg == alg_type::rng) {\r\n ranges::sample(population, sampled.begin(), sampled_size, urbg);\r\n } else {\r\n sample(population.begin(), population.end(), sampled.begin(), sampled_size, urbg);\r\n }\r\n benchmark::DoNotOptimize(sampled);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Args({1 << 20, 1 << 15});\r\n}\r\n\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\n\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\nBENCHMARK(bm_sample)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/search.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"lorem.hpp\"\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std::string_view_literals;\r\n\r\ntemplate \r\nconstexpr auto make_fill_pattern_array() {\r\n std::array result;\r\n result.fill('*');\r\n\r\n if constexpr (Last_is_different) {\r\n result.back() = '!';\r\n }\r\n\r\n return result;\r\n}\r\n\r\ntemplate \r\nconstexpr std::array fill_pattern_array = make_fill_pattern_array();\r\n\r\ntemplate \r\nconstexpr std::string_view fill_pattern_view{\r\n fill_pattern_array.data(), fill_pattern_array.size()};\r\n\r\nstruct data_and_pattern {\r\n std::string_view data;\r\n std::string_view pattern;\r\n};\r\n\r\nconstexpr data_and_pattern patterns[] = {\r\n /* 0. Small, closer to end */ {lorem_ipsum, \"aliquet\"sv},\r\n /* 1. Large, closer to end */ {lorem_ipsum, \"aliquet malesuada\"sv},\r\n /* 2. Small, closer to begin */ {lorem_ipsum, \"pulvinar\"sv},\r\n /* 3. Large, closer to begin */ {lorem_ipsum, \"dapibus elit interdum\"sv},\r\n\r\n /* 4. Small, evil */ {fill_pattern_view<3000, false>, fill_pattern_view<7, true>},\r\n /* 5. Large, evil */ {fill_pattern_view<3000, false>, fill_pattern_view<20, true>},\r\n};\r\n\r\ntemplate \r\nusing not_highly_aligned_basic_string = std::basic_string, not_highly_aligned_allocator>;\r\n\r\nusing not_highly_aligned_string = not_highly_aligned_basic_string;\r\nusing not_highly_aligned_wstring = not_highly_aligned_basic_string;\r\nusing not_highly_aligned_u32string = not_highly_aligned_basic_string;\r\n\r\nvoid c_strstr(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n not_highly_aligned_string haystack(src_haystack);\r\n not_highly_aligned_string needle(src_needle);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::strstr(haystack.c_str(), needle.c_str());\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid classic_search(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n std::vector> haystack(src_haystack.begin(), src_haystack.end());\r\n std::vector> needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::search(haystack.begin(), haystack.end(), needle.begin(), needle.end());\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid ranges_search(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n std::vector> haystack(src_haystack.begin(), src_haystack.end());\r\n std::vector> needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::ranges::search(haystack, needle);\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid search_default_searcher(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n std::vector> haystack(src_haystack.begin(), src_haystack.end());\r\n std::vector> needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::search(haystack.begin(), haystack.end(), std::default_searcher{needle.begin(), needle.end()});\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid member_find(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n T haystack(src_haystack.begin(), src_haystack.end());\r\n T needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = haystack.find(needle);\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid classic_find_end(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n std::vector> haystack(src_haystack.begin(), src_haystack.end());\r\n std::vector> needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::find_end(haystack.begin(), haystack.end(), needle.begin(), needle.end());\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid ranges_find_end(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n std::vector> haystack(src_haystack.begin(), src_haystack.end());\r\n std::vector> needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = std::ranges::find_end(haystack, needle);\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid member_rfind(benchmark::State& state) {\r\n const auto& src_haystack = patterns[static_cast(state.range())].data;\r\n const auto& src_needle = patterns[static_cast(state.range())].pattern;\r\n\r\n T haystack(src_haystack.begin(), src_haystack.end());\r\n T needle(src_needle.begin(), src_needle.end());\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(haystack);\r\n benchmark::DoNotOptimize(needle);\r\n auto res = haystack.rfind(needle);\r\n benchmark::DoNotOptimize(res);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->DenseRange(0, std::size(patterns) - 1, 1);\r\n}\r\n\r\nBENCHMARK(c_strstr)->Apply(common_args);\r\n\r\nBENCHMARK(classic_search)->Apply(common_args);\r\nBENCHMARK(classic_search)->Apply(common_args);\r\nBENCHMARK(classic_search)->Apply(common_args);\r\nBENCHMARK(classic_search)->Apply(common_args);\r\n\r\nBENCHMARK(ranges_search)->Apply(common_args);\r\nBENCHMARK(ranges_search)->Apply(common_args);\r\nBENCHMARK(ranges_search)->Apply(common_args);\r\nBENCHMARK(ranges_search)->Apply(common_args);\r\n\r\nBENCHMARK(search_default_searcher)->Apply(common_args);\r\nBENCHMARK(search_default_searcher)->Apply(common_args);\r\nBENCHMARK(search_default_searcher)->Apply(common_args);\r\nBENCHMARK(search_default_searcher)->Apply(common_args);\r\n\r\nBENCHMARK(member_find)->Apply(common_args);\r\nBENCHMARK(member_find)->Apply(common_args);\r\nBENCHMARK(member_find)->Apply(common_args);\r\n\r\nBENCHMARK(classic_find_end)->Apply(common_args);\r\nBENCHMARK(classic_find_end)->Apply(common_args);\r\nBENCHMARK(classic_find_end)->Apply(common_args);\r\nBENCHMARK(classic_find_end)->Apply(common_args);\r\n\r\nBENCHMARK(ranges_find_end)->Apply(common_args);\r\nBENCHMARK(ranges_find_end)->Apply(common_args);\r\nBENCHMARK(ranges_find_end)->Apply(common_args);\r\nBENCHMARK(ranges_find_end)->Apply(common_args);\r\n\r\nBENCHMARK(member_rfind)->Apply(common_args);\r\nBENCHMARK(member_rfind)->Apply(common_args);\r\nBENCHMARK(member_rfind)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/search_n.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\n// NB: This particular algorithm has std and ranges non-vectorized implementations with different perf characteristics!\r\n\r\nenum class AlgType { Std, Rng };\r\n\r\nenum class PatternType {\r\n TwoZones,\r\n DenseSmallSequences,\r\n};\r\n\r\ntemplate \r\nvoid bm(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n const auto n = static_cast(state.range(1));\r\n\r\n constexpr T no_match{'-'};\r\n constexpr T match{'*'};\r\n\r\n vector> v(size, no_match);\r\n\r\n if constexpr (Pattern == PatternType::TwoZones) {\r\n fill(v.begin() + v.size() / 2, v.end(), match);\r\n } else if constexpr (Pattern == PatternType::DenseSmallSequences) {\r\n if (size != 0 && n != 0) {\r\n mt19937 gen{7687239};\r\n\r\n uniform_int_distribution len_dis(0, n - 1);\r\n\r\n size_t cur_len = len_dis(gen);\r\n\r\n for (size_t i = 0; i != size; ++i) {\r\n if (cur_len != 0) {\r\n v[i] = match;\r\n --cur_len;\r\n } else {\r\n cur_len = len_dis(gen);\r\n }\r\n }\r\n }\r\n }\r\n\r\n for (auto _ : state) {\r\n if constexpr (Alg == AlgType::Std) {\r\n benchmark::DoNotOptimize(search_n(v.begin(), v.end(), n, match));\r\n } else if constexpr (Alg == AlgType::Rng) {\r\n benchmark::DoNotOptimize(ranges::search_n(v, n, match));\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n for (const auto& n : {40, 18, 16, 14, 10, 8, 5, 4, 3, 2, 1}) {\r\n bm->ArgPair(3000, n);\r\n }\r\n}\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\nBENCHMARK(bm)->Apply(common_args);\r\n\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/shuffle.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\nusing namespace std;\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\ntemplate \r\nvoid bm_shuffle(benchmark::State& state) {\r\n static_assert(is_unsigned_v, \"T must be unsigned so iota() doesn't have to worry about overflow.\");\r\n\r\n const auto n = static_cast(state.range(0));\r\n vector v(n);\r\n iota(v.begin(), v.end(), T{0});\r\n mt19937_64 urbg;\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Alg == alg_type::rng) {\r\n ranges::shuffle(v, urbg);\r\n } else {\r\n shuffle(v.begin(), v.end(), urbg);\r\n }\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->Arg(1 << 20);\r\n}\r\n\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\n\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\nBENCHMARK(bm_shuffle)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/std_copy.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"udt.hpp\"\r\n#include \"utility.hpp\"\r\n\r\ntemplate \r\nvoid handwritten_loop(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n const auto in_buffer = random_vector(r0);\r\n std::vector> out_buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(in_buffer.data());\r\n const Contained* in_ptr = in_buffer.data();\r\n const Contained* const in_ptr_end = in_ptr + r0;\r\n Contained* out_ptr = out_buffer.data();\r\n while (in_ptr != in_ptr_end) {\r\n *out_ptr++ = *in_ptr++;\r\n }\r\n\r\n benchmark::DoNotOptimize(out_buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid handwritten_loop_n(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n const auto in_buffer = random_vector(r0);\r\n std::vector> out_buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(in_buffer.data());\r\n const Contained* const in_ptr = in_buffer.data();\r\n Contained* const out_ptr = out_buffer.data();\r\n for (size_t idx = 0; idx < r0; ++idx) {\r\n out_ptr[idx] = in_ptr[idx];\r\n }\r\n\r\n benchmark::DoNotOptimize(out_buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid memcpy_call(benchmark::State& state) {\r\n static_assert(std::is_trivially_copyable_v, \"memcpy must only be called on trivially copyable types\");\r\n const size_t r0 = static_cast(state.range(0));\r\n const auto in_buffer = random_vector(r0);\r\n std::vector> out_buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(in_buffer.data());\r\n memcpy(out_buffer.data(), in_buffer.data(), r0 * sizeof(Contained));\r\n benchmark::DoNotOptimize(out_buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid std_copy_call(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n const auto in_buffer = random_vector(r0);\r\n std::vector> out_buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(in_buffer.data());\r\n std::copy(in_buffer.begin(), in_buffer.end(), out_buffer.begin());\r\n benchmark::DoNotOptimize(out_buffer.data());\r\n }\r\n}\r\n\r\ntemplate \r\nvoid std_copy_n_call(benchmark::State& state) {\r\n const size_t r0 = static_cast(state.range(0));\r\n const auto in_buffer = random_vector(r0);\r\n std::vector> out_buffer(r0);\r\n for ([[maybe_unused]] auto _ : state) {\r\n benchmark::DoNotOptimize(in_buffer.data());\r\n std::copy_n(in_buffer.begin(), r0, out_buffer.begin());\r\n benchmark::DoNotOptimize(out_buffer.data());\r\n }\r\n}\r\n\r\nBENCHMARK(handwritten_loop)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop_n)->Range(0, 1 << 18);\r\nBENCHMARK(memcpy_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_call)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_n_call)->Range(0, 1 << 18);\r\n\r\nBENCHMARK(handwritten_loop>)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop_n>)->Range(0, 1 << 18);\r\nBENCHMARK(memcpy_call>)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_call>)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_n_call>)->Range(0, 1 << 18);\r\n\r\nBENCHMARK(handwritten_loop>)->Range(0, 1 << 18);\r\nBENCHMARK(handwritten_loop_n>)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_call>)->Range(0, 1 << 18);\r\nBENCHMARK(std_copy_n_call>)->Range(0, 1 << 18);\r\n\r\nBENCHMARK(handwritten_loop)->Range(0, 1 << 15);\r\nBENCHMARK(handwritten_loop_n)->Range(0, 1 << 15);\r\nBENCHMARK(memcpy_call)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_call)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_n_call)->Range(0, 1 << 15);\r\n\r\nBENCHMARK(handwritten_loop>)->Range(0, 1 << 15);\r\nBENCHMARK(handwritten_loop_n>)->Range(0, 1 << 15);\r\nBENCHMARK(memcpy_call>)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_call>)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_n_call>)->Range(0, 1 << 15);\r\n\r\nBENCHMARK(handwritten_loop>)->Range(0, 1 << 15);\r\nBENCHMARK(handwritten_loop_n>)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_call>)->Range(0, 1 << 15);\r\nBENCHMARK(std_copy_n_call>)->Range(0, 1 << 15);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/sv_equal.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"lorem.hpp\"\r\n\r\nconstexpr std::string_view haystack = lorem_ipsum.substr(0, 2048);\r\n\r\nconstexpr std::size_t Count = 8u;\r\n\r\ntemplate \r\nconstexpr std::array make_svs() {\r\n std::array result{};\r\n\r\n if constexpr (Length != 0) {\r\n using namespace std::views;\r\n\r\n std::ranges::copy(\r\n haystack | chunk(Length) | transform([](auto&& t) { return std::string_view(t); }) | take(Count),\r\n result.begin());\r\n }\r\n\r\n return result;\r\n}\r\n\r\ntemplate \r\nvoid sv_equal(benchmark::State& state) {\r\n auto arr = make_svs();\r\n benchmark::DoNotOptimize(arr);\r\n\r\n for (auto _ : state) {\r\n for (auto& i : arr) {\r\n benchmark::DoNotOptimize(i);\r\n auto res = (i == arr[0]);\r\n benchmark::DoNotOptimize(res);\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(sv_equal<0>);\r\nBENCHMARK(sv_equal<8>);\r\nBENCHMARK(sv_equal<16>);\r\nBENCHMARK(sv_equal<32>);\r\nBENCHMARK(sv_equal<64>);\r\nBENCHMARK(sv_equal<128>);\r\nBENCHMARK(sv_equal<256>);\r\n\r\nstatic_assert(haystack.size() >= Count * 256, \"haystack is too small\");\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/swap_ranges.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\ntemplate class Padder>\r\nvoid std_swap(benchmark::State& state) {\r\n Padder padded_a;\r\n auto& a = padded_a.value;\r\n memset(a, 'a', sizeof(a));\r\n Padder padded_b;\r\n auto& b = padded_b.value;\r\n memset(b, 'b', sizeof(b));\r\n\r\n for (auto _ : state) {\r\n swap(a, b);\r\n benchmark::DoNotOptimize(a);\r\n benchmark::DoNotOptimize(b);\r\n }\r\n}\r\n\r\ntemplate class Alloc>\r\nvoid std_swap_ranges(benchmark::State& state) {\r\n vector> a(static_cast(state.range(0)), T{'a'});\r\n vector> b(static_cast(state.range(0)), T{'b'});\r\n\r\n for (auto _ : state) {\r\n swap_ranges(a.begin(), a.end(), b.begin());\r\n benchmark::DoNotOptimize(a);\r\n benchmark::DoNotOptimize(b);\r\n }\r\n}\r\n\r\nBENCHMARK(std_swap<1, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<5, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<15, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<26, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<38, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<60, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<125, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<800, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<3000, uint8_t, highly_aligned>);\r\nBENCHMARK(std_swap<9000, uint8_t, highly_aligned>);\r\n\r\nBENCHMARK(std_swap<1, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<5, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<15, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<26, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<38, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<60, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<125, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<800, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<3000, uint8_t, not_highly_aligned>);\r\nBENCHMARK(std_swap<9000, uint8_t, not_highly_aligned>);\r\n\r\nBENCHMARK(std_swap_ranges)\r\n ->Arg(1)\r\n ->Arg(5)\r\n ->Arg(15)\r\n ->Arg(26)\r\n ->Arg(38)\r\n ->Arg(60)\r\n ->Arg(125)\r\n ->Arg(800)\r\n ->Arg(3000)\r\n ->Arg(9000);\r\n\r\nBENCHMARK(std_swap_ranges)\r\n ->Arg(1)\r\n ->Arg(5)\r\n ->Arg(15)\r\n ->Arg(26)\r\n ->Arg(38)\r\n ->Arg(60)\r\n ->Arg(125)\r\n ->Arg(800)\r\n ->Arg(3000)\r\n ->Arg(9000);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/unique.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nenum class alg_type { std_fn, rng };\r\n\r\ntemplate \r\nvoid u(benchmark::State& state) {\r\n std::mt19937_64 gen(22033);\r\n using TD = std::conditional_t;\r\n std::binomial_distribution dis(5);\r\n\r\n std::vector> src(2552);\r\n std::iota(src.begin(), src.begin() + 390, T{0});\r\n std::iota(src.end() - 390, src.end(), T{0});\r\n std::generate(src.begin() + 390, src.end() - 390, [&] { return static_cast(dis(gen)); });\r\n\r\n std::vector> v;\r\n v.reserve(src.size());\r\n for (auto _ : state) {\r\n v = src;\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Type == alg_type::std_fn) {\r\n benchmark::DoNotOptimize(std::unique(v.begin(), v.end()));\r\n } else {\r\n benchmark::DoNotOptimize(std::ranges::unique(v));\r\n }\r\n }\r\n}\r\n\r\ntemplate \r\nvoid uc(benchmark::State& state) {\r\n std::mt19937_64 gen(22033);\r\n using TD = std::conditional_t;\r\n std::binomial_distribution dis(5);\r\n\r\n std::vector> src(2552);\r\n std::generate(src.begin(), src.end(), [&] { return static_cast(dis(gen)); });\r\n\r\n std::vector> v(src.size());\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(src);\r\n benchmark::DoNotOptimize(v);\r\n if constexpr (Type == alg_type::std_fn) {\r\n benchmark::DoNotOptimize(std::unique_copy(src.begin(), src.end(), v.begin()));\r\n } else {\r\n benchmark::DoNotOptimize(std::ranges::unique_copy(src, v.begin()));\r\n }\r\n }\r\n}\r\n\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\n\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\nBENCHMARK(u);\r\n\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\n\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\nBENCHMARK(uc);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_copy.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nvoid copy_block_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin(), source.cend(), dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_source_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin() + 1, source.cend(), dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_dest_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin(), source.cend() - 1, dest.begin() + 1);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmark for matching char alignment\r\nvoid copy_matching_alignment(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin() + 5, source.cend(), dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmarks for single block corner case\r\nvoid copy_both_single_blocks(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin() + 5, source.cbegin() + 5 + length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_source_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin() + 5, source.cbegin() + 5 + length, dest.begin() + 25);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_dest_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy(source.cbegin() + 25, source.cbegin() + 25 + length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nBENCHMARK(copy_block_aligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_source_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_dest_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_matching_alignment)->RangeMultiplier(64)->Range(64, 64 << 10);\r\n\r\nBENCHMARK(copy_both_single_blocks);\r\nBENCHMARK(copy_source_single_block);\r\nBENCHMARK(copy_dest_single_block);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_copy_n.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nvoid copy_n_block_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin(), size, dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_n_source_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin() + 1, size - 1, dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_n_dest_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin(), size - 1, dest.begin() + 1);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmark for matching char alignment\r\nvoid copy_n_matching_alignment(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin() + 5, size - 5, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmarks for single block corner case\r\nvoid copy_n_both_single_blocks(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin() + 5, length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_n_source_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin() + 5, length, dest.begin() + 25);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid copy_n_dest_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n copy_n(source.cbegin() + 25, length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nBENCHMARK(copy_n_block_aligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_n_source_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_n_dest_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(copy_n_matching_alignment)->RangeMultiplier(64)->Range(64, 64 << 10);\r\n\r\nBENCHMARK(copy_n_both_single_blocks);\r\nBENCHMARK(copy_n_source_single_block);\r\nBENCHMARK(copy_n_dest_single_block);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_count.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nvoid count_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector v = random_vector(size);\r\n\r\n bool b = false;\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(b);\r\n benchmark::DoNotOptimize(v);\r\n auto r = count(v.cbegin(), v.cend(), b);\r\n benchmark::DoNotOptimize(r);\r\n b = !b;\r\n }\r\n}\r\n\r\nBENCHMARK(count_aligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_meow_of.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n\r\nusing namespace std;\r\n\r\nenum class alg { all_, any_, none_ };\r\nenum class content { ones_then_zeros, zeros_then_ones };\r\n\r\ntemplate \r\nvoid meow_of(benchmark::State& state) {\r\n const auto n = static_cast(state.range(0));\r\n vector> source(n);\r\n\r\n if constexpr (Content == content::ones_then_zeros) {\r\n fill(source.begin(), source.begin() + source.size() / 2, true);\r\n } else {\r\n fill(source.begin() + source.size() / 2, source.end(), true);\r\n }\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n bool result;\r\n if constexpr (Alg == alg::all_) {\r\n result = all_of(source.begin(), source.end(), Pred{});\r\n } else if constexpr (Alg == alg::any_) {\r\n result = any_of(source.begin(), source.end(), Pred{});\r\n } else {\r\n result = none_of(source.begin(), source.end(), Pred{});\r\n }\r\n benchmark::DoNotOptimize(result);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->RangeMultiplier(64)->Range(64, 64 << 10);\r\n}\r\n\r\nusing not_ = logical_not<>;\r\n\r\nBENCHMARK(meow_of)->Apply(common_args);\r\nBENCHMARK(meow_of)->Apply(common_args);\r\nBENCHMARK(meow_of)->Apply(common_args);\r\nBENCHMARK(meow_of)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_move.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\nvoid move_block_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin(), source.cend(), dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid move_source_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin() + 1, source.cend(), dest.begin());\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid move_dest_misaligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin(), source.cend() - 1, dest.begin() + 1);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmark for matching char alignment\r\nvoid move_matching_alignment(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n vector source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin() + 5, source.cend(), dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\n// Special benchmarks for single block corner case\r\nvoid move_both_single_blocks(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin() + 5, source.cbegin() + 5 + length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid move_source_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin() + 5, source.cbegin() + 5 + length, dest.begin() + 25);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid move_dest_single_block(benchmark::State& state) {\r\n vector source = random_vector(50);\r\n vector dest(50, false);\r\n\r\n const size_t length = 20;\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n move(source.cbegin() + 25, source.cbegin() + 25 + length, dest.begin() + 5);\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nBENCHMARK(move_block_aligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(move_source_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(move_dest_misaligned)->RangeMultiplier(64)->Range(64, 64 << 10);\r\nBENCHMARK(move_matching_alignment)->RangeMultiplier(64)->Range(64, 64 << 10);\r\n\r\nBENCHMARK(move_both_single_blocks);\r\nBENCHMARK(move_source_single_block);\r\nBENCHMARK(move_dest_single_block);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "benchmarks/src/vector_bool_transform.cpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#include \r\n//\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \"skewed_allocator.hpp\"\r\n#include \"utility.hpp\"\r\n\r\nusing namespace std;\r\n\r\ntemplate \r\nvoid transform_one_input_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n auto source = random_vector(size);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source);\r\n transform(source.begin(), source.end(), dest.begin(), Pred{});\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\ntemplate \r\nvoid transform_two_inputs_aligned(benchmark::State& state) {\r\n const auto size = static_cast(state.range(0));\r\n auto source1 = random_vector(size);\r\n auto source2 = random_vector(size, 1729u);\r\n vector dest(size, false);\r\n\r\n for (auto _ : state) {\r\n benchmark::DoNotOptimize(source1);\r\n benchmark::DoNotOptimize(source2);\r\n transform(source1.begin(), source1.end(), source2.begin(), dest.begin(), Pred{});\r\n benchmark::DoNotOptimize(dest);\r\n }\r\n}\r\n\r\nvoid common_args(benchmark::Benchmark* bm) {\r\n bm->RangeMultiplier(64)->Range(64, 64 << 10);\r\n}\r\n\r\nBENCHMARK(transform_two_inputs_aligned>)->Apply(common_args);\r\nBENCHMARK(transform_two_inputs_aligned>)->Apply(common_args);\r\nBENCHMARK(transform_two_inputs_aligned>)->Apply(common_args);\r\nBENCHMARK(transform_one_input_aligned>)->Apply(common_args);\r\n\r\nBENCHMARK_MAIN();\r\n" }, { "path": "docs/cgmanifest.json", "content": "{\r\n \"$schema\": \"https://json.schemastore.org/component-detection-manifest.json\",\r\n \"Registrations\": [\r\n {\r\n \"component\": {\r\n \"type\": \"git\",\r\n \"git\": {\r\n \"repositoryUrl\": \"https://github.com/boostorg/math\",\r\n \"commitHash\": \"4d0885ae44f7d4ce94568339b2ae5501eb234e8f\"\r\n }\r\n }\r\n },\r\n {\r\n \"component\": {\r\n \"type\": \"git\",\r\n \"git\": {\r\n \"repositoryUrl\": \"https://github.com/llvm/llvm-project.git\",\r\n \"commitHash\": \"12fcca0afeb08fbe41d79c5387cfacb249992bb4\"\r\n }\r\n }\r\n },\r\n {\r\n \"component\": {\r\n \"type\": \"git\",\r\n \"git\": {\r\n \"repositoryUrl\": \"https://github.com/microsoft/STL.git\",\r\n \"commitHash\": \"9bf8f3f9b03ff71ea83baff189eb1d6a46dd48e1\"\r\n }\r\n }\r\n },\r\n {\r\n \"component\": {\r\n \"type\": \"git\",\r\n \"git\": {\r\n \"repositoryUrl\": \"https://github.com/fmtlib/fmt\",\r\n \"commitHash\": \"273d8865e31659f69528623754c1742b2819ad26\"\r\n }\r\n }\r\n },\r\n {\r\n \"component\": {\r\n \"type\": \"git\",\r\n \"git\": {\r\n \"repositoryUrl\": \"https://github.com/ulfjack/ryu.git\",\r\n \"commitHash\": \"59661c3f883dfd39cef6dc8eaf2fcbaae53597e8\"\r\n }\r\n }\r\n }\r\n ],\r\n \"Version\": 1\r\n}\r\n" }, { "path": "docs/import_library.md", "content": "\r\n\r\n\r\n# Filenames\r\n\r\nMode | Import Library | DLL (VS) | DLL (GitHub) |\r\n--------|----------------|-----------------|---------------------|\r\nRelease | `msvcprt.lib` | `msvcp140.dll` | `msvcp140_oss.dll` |\r\nDebug | `msvcprtd.lib` | `msvcp140d.dll` | `msvcp140d_oss.dll` |\r\n\r\n# Import Libraries\r\n\r\nAn import library is a `.lib` file that defines its symbols as imported from a DLL.\r\n\r\nUsually there is one `.lib` file for one `.dll` file, with the same name.\r\nThe names are different for MSVC because it started encoding its ABI version into the DLL's filename,\r\nbut there was no reason to change the import library's filename.\r\n\r\nAlso, an import library usually only contains references to DLL symbols and doesn't define anything on its own.\r\nHowever, this is purely a convention - nothing technically stops an import library\r\nfrom containing object files that are effectively statically linked.\r\n\r\n## Advantages of Injecting Additional Code\r\n\r\nThis is what the STL's import library does - it defines some functions and variables on its own.\r\nThis allows us to:\r\n\r\n* Extend the STL implementation without altering the DLL export surface.\r\n + This has been critical in allowing us to implement C++17 `` and much more.\r\n* Separately compile functions and constant data for improved throughput.\r\n + ``'s lookup tables are a notable example.\r\n\r\n## Limitations\r\n\r\nThe caveats of this technique are:\r\n\r\n* It effectively defeats the purpose of the `/MD` and `/MDd` options by embedding part of\r\n the STL implementation into the resulting user binaries, rather than staying in the STL's DLL.\r\n* Due to the duplication in each user binary that links to the import library,\r\n variables in the import library **cannot represent shared global state**.\r\n + This limitation is subtle (not readily apparent from the source code) and critical.\r\n If shared global state is necessary, our only option while preserving bincompat is adding a satellite DLL.\r\n* Due to having just two flavors of the import library (debug and release),\r\n we cannot use anything that depends on `_ITERATOR_DEBUG_LEVEL`.\r\n\r\nFor these reasons, especially the last one, we need to strictly control what is used by the import library.\r\nIn particular, `basic_string` must not be used there.\r\n\r\n## Core Headers\r\n\r\nRestricting the import library to including core headers only is an effective way to avoid problems.\r\n`locale0.cpp`'s inclusion of `` is currently a special case and should be treated with extreme caution.\r\n" }, { "path": "stl/CMakeLists.txt", "content": "# Copyright (c) Microsoft Corporation.\r\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n##################################################\r\n# Lists of files. (We can also copy files here.) #\r\n##################################################\r\n\r\nset(HEADERS\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_all_public_headers.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_bit_utils.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_chrono.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_cxx_stdatomic.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_filebuf.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_format_ucd_tables.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_formatter.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_heap_algorithms.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_int128.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_iter_core.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_minmax.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_ostream.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_print.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_ranges_to.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_ranges_tuple_formatter.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_sanitizer_annotate_container.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_string_view.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_system_error_abi.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_threads_core.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_tzdb.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/__msvc_xlocinfo_types.hpp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/algorithm\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/any\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/array\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/atomic\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/barrier\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/bit\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/bitset\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cassert\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ccomplex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cctype\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cerrno\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cfenv\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cfloat\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/charconv\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/chrono\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cinttypes\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ciso646\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/climits\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/clocale\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cmath\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/codecvt\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/compare\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/complex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/concepts\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/condition_variable\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/coroutine\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/csetjmp\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/csignal\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdalign\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdarg\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdbool\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstddef\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdint\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdio\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstdlib\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cstring\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ctgmath\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ctime\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cuchar\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cwchar\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/cwctype\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/deque\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/exception\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/execution\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/expected\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/experimental/coroutine\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/experimental/generator\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/experimental/resumable\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/filesystem\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/flat_map\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/flat_set\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/format\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/forward_list\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/fstream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/functional\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/future\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/generator\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/header-units.json\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/initializer_list\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/iomanip\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ios\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/iosfwd\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/iostream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/iso646.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/istream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/iterator\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/latch\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/limits\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/list\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/locale\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/map\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/mdspan\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/memory\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/memory_resource\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/mutex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/new\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/numbers\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/numeric\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/optional\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ostream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/print\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/queue\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/random\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ranges\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ratio\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/regex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/scoped_allocator\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/semaphore\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/set\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/shared_mutex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/source_location\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/span\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/spanstream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/sstream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/stack\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/stacktrace\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/stdexcept\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/stdfloat\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/stop_token\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/streambuf\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/string\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/string_view\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/strstream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/syncstream\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/system_error\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/thread\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/tuple\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/type_traits\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/typeindex\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/typeinfo\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/unordered_map\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/unordered_set\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/use_ansi.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/utility\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/valarray\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/variant\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/vector\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/version\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xatomic.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xatomic_wait.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xbit_ops.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xcall_once.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xcharconv.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xcharconv_ryu.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xcharconv_ryu_tables.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xcharconv_tables.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xerrc.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xfacet\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xfilesystem_abi.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xhash\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xiosbase\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xkeycheck.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocale\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocbuf\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocinfo\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocmes\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocmon\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xlocnum\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xloctime\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xmemory\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xnode_handle.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xpolymorphic_allocator.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xsmf_control.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xstring\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xthreads.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xtimec.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xtr1common\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xtree\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/xutility\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/ymath.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/yvals.h\r\n ${CMAKE_CURRENT_LIST_DIR}/inc/yvals_core.h\r\n)\r\n\r\nforeach(header ${HEADERS})\r\n file(RELATIVE_PATH _header_path \"${CMAKE_CURRENT_LIST_DIR}/inc\" \"${header}\")\r\n configure_file(\"${header}\" \"${PROJECT_BINARY_DIR}/out/inc/${_header_path}\" COPYONLY)\r\nendforeach()\r\n\r\nset(MODULE_FILES\r\n ${CMAKE_CURRENT_LIST_DIR}/modules/modules.json\r\n ${CMAKE_CURRENT_LIST_DIR}/modules/std.ixx\r\n ${CMAKE_CURRENT_LIST_DIR}/modules/std.compat.ixx\r\n)\r\n\r\nforeach(module_file ${MODULE_FILES})\r\n file(RELATIVE_PATH _module_file_path \"${CMAKE_CURRENT_LIST_DIR}/modules\" \"${module_file}\")\r\n configure_file(\"${module_file}\" \"${PROJECT_BINARY_DIR}/out/modules/${_module_file_path}\" COPYONLY)\r\nendforeach()\r\n\r\n# Objs that implement aliases; these are completely independent of the configuration\r\nset(ALIAS_SOURCES_X86_X64\r\n ${CMAKE_CURRENT_LIST_DIR}/src/alias_init_once_begin_initialize.asm\r\n ${CMAKE_CURRENT_LIST_DIR}/src/alias_init_once_complete.asm\r\n)\r\n\r\n# Objs that exist in both libcpmt[d][01].lib and msvcprt[d].lib.\r\nset(IMPLIB_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/asan_noop.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/charconv.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/filesystem.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/format.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/locale0_implib.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/nothrow.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/print.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/regex.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/sharedmutex.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/stacktrace.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/syserror_import_lib.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/vector_algorithms.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xcharconv_ryu_tables.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xcharconv_tables_double.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xcharconv_tables_float.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xonce2.cpp\r\n)\r\n\r\n# The following files are linked in msvcp140[d][_clr].dll.\r\nset(DLL_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/dllmain.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/instances.cpp\r\n)\r\n\r\n# Sources that must not be compiled with /GL, since they contain CRT initializers.\r\nset(INITIALIZER_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/winapisupp.cpp\r\n)\r\n\r\nset(SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/StlCompareStringA.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/StlCompareStringW.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/StlLCMapStringA.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/StlLCMapStringW.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/_tolower.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/_toupper.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/atomic.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/cerr.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/cin.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/clog.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/cond.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/cout.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/cthread.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/filesys.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/fiopen.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/future.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/iomanip.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ios.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/iosptrs.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/iostream.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/locale.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/locale0.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/multprec.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/mutex.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/pplerror.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ppltasks.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/raisehan.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/stdhndlr.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/stdthrow.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/syserror.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/taskscheduler.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/thread0.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/uncaught_exception.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/uncaught_exceptions.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ushcerr.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ushcin.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ushclog.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ushcout.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ushiostr.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wcerr.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wcin.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wclog.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wcout.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/winapinls.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wiostrea.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/wlocale.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xalloc.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xcosh.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xdateord.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xdtest.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xexp.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xgetwctype.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xlgamma.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xlocale.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xlock.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xmbtowc.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xmtx.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xnotify.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xonce.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xrngabort.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xrngdev.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xsinh.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstod.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstof.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstol.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstoll.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstoul.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstoull.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstrcoll.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xstrxfrm.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xthrow.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xtime.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xtowlower.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xtowupper.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xvalues.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xwcscoll.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xwcsxfrm.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xwctomb.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xwstod.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/xwstof.cpp\r\n)\r\n\r\nset(ASAN_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/asan.cpp\r\n)\r\n\r\nset(EHA_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/excptptr.cpp\r\n)\r\n\r\nset(SOURCES_SATELLITE_1\r\n ${CMAKE_CURRENT_LIST_DIR}/src/memory_resource.cpp\r\n)\r\n\r\nset(SOURCES_SATELLITE_2\r\n ${CMAKE_CURRENT_LIST_DIR}/src/special_math.cpp\r\n)\r\n\r\nset(SOURCES_SATELLITE_ATOMIC_WAIT\r\n ${CMAKE_CURRENT_LIST_DIR}/src/atomic_wait.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/parallel_algorithms.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/syncstream.cpp\r\n ${CMAKE_CURRENT_LIST_DIR}/src/tzdb.cpp\r\n)\r\n\r\nset(SOURCES_SATELLITE_CODECVT_IDS\r\n ${CMAKE_CURRENT_LIST_DIR}/src/ulocale.cpp\r\n)\r\n\r\n# Objs that exist only in libcpmt[d][01].lib.\r\nset(STATIC_SOURCES\r\n ${SOURCES_SATELLITE_1}\r\n ${SOURCES_SATELLITE_2}\r\n ${SOURCES_SATELLITE_ATOMIC_WAIT}\r\n ${SOURCES_SATELLITE_CODECVT_IDS}\r\n)\r\n\r\n# Objs that exist in all satellite DLLs\r\nset(SATELLITE_DLL_SOURCES\r\n ${CMAKE_CURRENT_LIST_DIR}/src/dllmain_satellite.cpp\r\n)\r\n\r\n####################\r\n# Toolset options. #\r\n####################\r\n\r\nset(CMAKE_CXX_FLAGS \"\")\r\nset(CMAKE_CXX_FLAGS_DEBUG \"\")\r\nset(CMAKE_CXX_FLAGS_RELEASE \"\")\r\nset(CMAKE_MSVC_RUNTIME_CHECKS \"\")\r\nset(CMAKE_CXX_STANDARD_LIBRARIES \"kernel32.lib\")\r\nset(CMAKE_CXX_STANDARD_LIBRARIES_INIT \"kernel32.lib\")\r\nset(CMAKE_MSVC_RUNTIME_LIBRARY \"\")\r\n\r\nset(CMAKE_ARCHIVE_OUTPUT_DIRECTORY \"${STL_ARCHIVE_OUTPUT_DIRECTORY}\")\r\nset(CMAKE_LIBRARY_OUTPUT_DIRECTORY \"${STL_LIBRARY_OUTPUT_DIRECTORY}\")\r\nset(CMAKE_RUNTIME_OUTPUT_DIRECTORY \"${STL_RUNTIME_OUTPUT_DIRECTORY}\")\r\n\r\nset(CMAKE_STATIC_LINKER_FLAGS \"/WX\")\r\nset(CMAKE_STATIC_LINKER_FLAGS_DEBUG \"\")\r\nset(CMAKE_STATIC_LINKER_FLAGS_RELEASE \"\")\r\nset(CMAKE_SHARED_LINKER_FLAGS \"/DEBUG:FULL /WX /RELEASE /SUBSYSTEM:Console /NODEFAULTLIB /INCREMENTAL:NO /MANIFEST:NO /DLL /profile /guard:cf /DEBUGTYPE:cv,fixup /LARGEADDRESSAWARE\")\r\nif(VCLIBS_TARGET_ARCHITECTURE STREQUAL \"x64\")\r\n set(CMAKE_SHARED_LINKER_FLAGS \"${CMAKE_SHARED_LINKER_FLAGS} /CETCOMPAT\")\r\nendif()\r\nif(VCLIBS_TARGET_ARCHITECTURE MATCHES \"^(x64|arm64|arm64ec)$\")\r\n set(CMAKE_SHARED_LINKER_FLAGS \"${CMAKE_SHARED_LINKER_FLAGS} /guard:ehcont\")\r\nendif()\r\nif(VCLIBS_TARGET_ARCHITECTURE MATCHES \"^(arm64|arm64ec)$\")\r\n set(CMAKE_SHARED_LINKER_FLAGS \"${CMAKE_SHARED_LINKER_FLAGS} /guard:delayloadsignret\")\r\nendif()\r\nset(CMAKE_SHARED_LINKER_FLAGS_DEBUG \"\")\r\nset(CMAKE_SHARED_LINKER_FLAGS_RELEASE \"\")\r\n\r\n# Toolset options must appear before add_library() for the options to take effect.\r\nadd_compile_definitions(_CRTBLD _HAS_OLD_IOSTREAMS_MEMBERS=1)\r\n\r\n# /Z7 for MSVC, /Zi for MASM\r\nset(CMAKE_MSVC_DEBUG_INFORMATION_FORMAT \"Embedded\")\r\n\r\nadd_compile_options(/nologo /WX /Gy\r\n \"$<$:/diagnostics:caret;/W4;/w14265;/w15038;/fastfail;/guard:cf;/Zp8;/std:c++latest;/permissive-;/Zc:preprocessor;/Zc:threadSafeInit-;/Zl>\"\r\n \"$<$,$>:/guard:ehcont>\"\r\n \"$<$,$>:/guard:signret>\"\r\n \"$<$:/W3;/quiet>\"\r\n)\r\n\r\ninclude_directories(BEFORE\r\n \"${CMAKE_CURRENT_LIST_DIR}/inc\"\r\n \"${TOOLSET_ROOT_DIR}/crt/src/vcruntime\"\r\n)\r\n\r\n###########################\r\n# End of toolset options. #\r\n###########################\r\n\r\nif(VCLIBS_TARGET_ARCHITECTURE MATCHES \"^(x86|x64)$\")\r\n add_library(stl_alias_objects OBJECT ${ALIAS_SOURCES_X86_X64})\r\nelse()\r\n add_library(stl_alias_objects INTERFACE)\r\nendif()\r\n\r\nif(STL_ASAN_BUILD)\r\n set(DLL_ASAN_SOURCES ${ASAN_SOURCES})\r\nelse()\r\n set(DLL_ASAN_SOURCES \"\")\r\nendif()\r\n\r\nfunction(target_stl_compile_options tgt rel_or_dbg)\r\n if(rel_or_dbg STREQUAL \"Release\")\r\n target_compile_options(${tgt} PRIVATE ${VCLIBS_RELEASE_OPTIONS})\r\n elseif(rel_or_dbg STREQUAL \"Debug\")\r\n target_compile_options(${tgt} PRIVATE ${VCLIBS_DEBUG_OPTIONS})\r\n target_compile_definitions(${tgt} PRIVATE \"_DEBUG\")\r\n else()\r\n message(FATAL_ERROR \"INTERNAL ERROR: unexpected value for rel_or_dbg: '${rel_or_dbg}'\")\r\n endif()\r\nendfunction()\r\n\r\nfunction(generate_satellite_def SATELLITE_NAME D_SUFFIX)\r\n set(full_satellite_name \"msvcp140${D_SUFFIX}_${SATELLITE_NAME}${VCLIBS_SUFFIX}\")\r\n string(TOUPPER \"${full_satellite_name}\" upper_full_satellite_name)\r\n set(satellite_input_src_file_path \"${CMAKE_CURRENT_LIST_DIR}/src/msvcp_${SATELLITE_NAME}.src\")\r\n set(satellite_output_def_file_path \"${CMAKE_BINARY_DIR}/msvcp_${SATELLITE_NAME}${D_SUFFIX}.def\")\r\n set_property(DIRECTORY APPEND PROPERTY CMAKE_CONFIGURE_DEPENDS \"${satellite_input_src_file_path}\")\r\n\r\n # We use the placeholder name \"LIBRARYNAME\" in the corresponding .src file of a satellite DLL\r\n # (i.e., we write \"LIBRARY LIBRARYNAME\" as the first non-commented line in the file).\r\n #\r\n # Here, we dynamically replace this placeholder name with the name of the satellite DLL for\r\n # the current build configuration. Then, we write out the new .def file to the binary output\r\n # directory.\r\n file(READ \"${satellite_input_src_file_path}\" satellite_def_file_contents)\r\n string(REPLACE \"LIBRARYNAME\" \"${upper_full_satellite_name}\" satellite_def_file_contents \"${satellite_def_file_contents}\")\r\n file(GENERATE OUTPUT \"${satellite_output_def_file_path}\" CONTENT \"${satellite_def_file_contents}\")\r\nendfunction()\r\n\r\nfunction(add_stl_dlls D_SUFFIX REL_OR_DBG)\r\n set(link_options_Release \"/LTCG;/opt:ref,icf;${VCLIBS_EXPLICIT_MACHINE}\")\r\n set(link_options_Debug \"/opt:ref,noicf;${VCLIBS_EXPLICIT_MACHINE}\")\r\n\r\n set(gl_flag_Release \"/GL\")\r\n set(gl_flag_Debug \"\")\r\n\r\n # msvcp140.dll\r\n add_library(msvcp${D_SUFFIX}_objects OBJECT ${DLL_SOURCES} ${SOURCES} ${DLL_ASAN_SOURCES})\r\n target_compile_definitions(msvcp${D_SUFFIX}_objects PRIVATE CRTDLL2 _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp${D_SUFFIX}_init_objects OBJECT ${INITIALIZER_SOURCES})\r\n target_compile_definitions(msvcp${D_SUFFIX}_init_objects PRIVATE CRTDLL2 _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_init_objects PRIVATE /EHsc)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_init_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp${D_SUFFIX}_eha_objects OBJECT ${EHA_SOURCES})\r\n target_compile_definitions(msvcp${D_SUFFIX}_eha_objects PRIVATE CRTDLL2 _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_eha_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHa)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_eha_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp${D_SUFFIX} SHARED)\r\n target_link_libraries(msvcp${D_SUFFIX} PRIVATE msvcp${D_SUFFIX}_eha_objects msvcp${D_SUFFIX}_objects msvcp${D_SUFFIX}_init_objects \"${TOOLSET_LIB}/vcruntime${D_SUFFIX}.lib\" \"${TOOLSET_LIB}/msvcrt${D_SUFFIX}.lib\" \"ucrt${D_SUFFIX}.lib\")\r\n if(VCLIBS_TARGET_ARCHITECTURE MATCHES \"^(arm64|arm64ec)$\")\r\n target_link_libraries(msvcp${D_SUFFIX} PRIVATE \"softintrin.lib\")\r\n endif()\r\n set_target_properties(msvcp${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcp140_base${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n set_target_properties(msvcp${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}\")\r\n set_target_properties(msvcp${D_SUFFIX} PROPERTIES OUTPUT_NAME \"msvcp140${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n target_link_options(msvcp${D_SUFFIX} PRIVATE ${link_options_${REL_OR_DBG}})\r\n\r\n # import library 'statics'\r\n add_library(msvcp${D_SUFFIX}_implib_objects OBJECT ${IMPLIB_SOURCES})\r\n target_compile_definitions(msvcp${D_SUFFIX}_implib_objects PRIVATE _DLL _ENFORCE_ONLY_CORE_HEADERS)\r\n target_compile_options(msvcp${D_SUFFIX}_implib_objects PRIVATE /EHsc) # No /GL!\r\n target_stl_compile_options(msvcp${D_SUFFIX}_implib_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp${D_SUFFIX}_satellite_objects OBJECT ${SATELLITE_DLL_SOURCES})\r\n target_compile_definitions(msvcp${D_SUFFIX}_satellite_objects PRIVATE _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_satellite_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_satellite_objects ${REL_OR_DBG})\r\n\r\n # msvcp140_1.dll (the memory_resource satellite)\r\n add_library(msvcp_1${D_SUFFIX}_objects OBJECT ${SOURCES_SATELLITE_1})\r\n target_compile_definitions(msvcp_1${D_SUFFIX}_objects PRIVATE _BUILDING_SATELLITE_1 _DLL)\r\n target_compile_options(msvcp_1${D_SUFFIX}_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_stl_compile_options(msvcp_1${D_SUFFIX}_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp_1${D_SUFFIX} SHARED)\r\n target_link_libraries(msvcp_1${D_SUFFIX} PRIVATE msvcp_1${D_SUFFIX}_objects msvcp${D_SUFFIX}_satellite_objects \"msvcp${D_SUFFIX}\" \"${TOOLSET_LIB}/vcruntime${D_SUFFIX}.lib\" \"${TOOLSET_LIB}/msvcrt${D_SUFFIX}.lib\" \"ucrt${D_SUFFIX}.lib\")\r\n set_target_properties(msvcp_1${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcp140_1${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n set_target_properties(msvcp_1${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}\")\r\n set_target_properties(msvcp_1${D_SUFFIX} PROPERTIES OUTPUT_NAME \"msvcp140_1${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n target_link_options(msvcp_1${D_SUFFIX} PRIVATE ${link_options_${REL_OR_DBG}})\r\n\r\n # msvcp140_2.dll (the special math satellite)\r\n add_library(msvcp_2${D_SUFFIX}_objects OBJECT ${SOURCES_SATELLITE_2})\r\n target_compile_definitions(msvcp_2${D_SUFFIX}_objects PRIVATE _BUILDING_SATELLITE_2 _DLL)\r\n target_compile_options(msvcp_2${D_SUFFIX}_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_link_libraries(msvcp_2${D_SUFFIX}_objects PRIVATE Boost::math)\r\n target_stl_compile_options(msvcp_2${D_SUFFIX}_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp_2${D_SUFFIX} SHARED)\r\n target_link_libraries(msvcp_2${D_SUFFIX} PRIVATE msvcp_2${D_SUFFIX}_objects msvcp${D_SUFFIX}_satellite_objects msvcp${D_SUFFIX}_implib_objects msvcp${D_SUFFIX} \"${TOOLSET_LIB}/vcruntime${D_SUFFIX}.lib\" \"${TOOLSET_LIB}/msvcrt${D_SUFFIX}.lib\" \"ucrt${D_SUFFIX}.lib\")\r\n set_target_properties(msvcp_2${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcp140_2${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n set_target_properties(msvcp_2${D_SUFFIX} PROPERTIES ARCHIVE_OUTPUT_DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}\")\r\n set_target_properties(msvcp_2${D_SUFFIX} PROPERTIES OUTPUT_NAME \"msvcp140_2${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n target_link_options(msvcp_2${D_SUFFIX} PRIVATE ${link_options_${REL_OR_DBG}})\r\n\r\n # msvcp140_atomic_wait.dll (the atomic wait satellite)\r\n add_library(msvcp${D_SUFFIX}_atomic_wait_objects OBJECT ${SOURCES_SATELLITE_ATOMIC_WAIT})\r\n target_compile_definitions(msvcp${D_SUFFIX}_atomic_wait_objects PRIVATE _BUILDING_SATELLITE_ATOMIC_WAIT _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_atomic_wait_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_atomic_wait_objects ${REL_OR_DBG})\r\n\r\n # generate the .def for msvcp140_atomic_wait.dll\r\n generate_satellite_def(\"atomic_wait\" \"${D_SUFFIX}\")\r\n\r\n add_library(msvcp${D_SUFFIX}_atomic_wait SHARED \"${CMAKE_BINARY_DIR}/msvcp_atomic_wait${D_SUFFIX}.def\")\r\n target_link_libraries(msvcp${D_SUFFIX}_atomic_wait PRIVATE msvcp${D_SUFFIX}_atomic_wait_objects msvcp${D_SUFFIX}_satellite_objects msvcp${D_SUFFIX}_implib_objects \"msvcp${D_SUFFIX}\" \"${TOOLSET_LIB}/vcruntime${D_SUFFIX}.lib\" \"${TOOLSET_LIB}/msvcrt${D_SUFFIX}.lib\" \"ucrt${D_SUFFIX}.lib\" \"advapi32.lib\" \"synchronization.lib\")\r\n set_target_properties(msvcp${D_SUFFIX}_atomic_wait PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcp140_atomic_wait${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n set_target_properties(msvcp${D_SUFFIX}_atomic_wait PROPERTIES ARCHIVE_OUTPUT_DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}\")\r\n set_target_properties(msvcp${D_SUFFIX}_atomic_wait PROPERTIES OUTPUT_NAME \"msvcp140${D_SUFFIX}_atomic_wait${VCLIBS_SUFFIX}\")\r\n target_link_options(msvcp${D_SUFFIX}_atomic_wait PRIVATE ${link_options_${REL_OR_DBG}})\r\n\r\n # msvcp140_codecvt_ids.dll\r\n add_library(msvcp${D_SUFFIX}_codecvt_ids_objects OBJECT ${SOURCES_SATELLITE_CODECVT_IDS})\r\n target_compile_definitions(msvcp${D_SUFFIX}_codecvt_ids_objects PRIVATE _BUILDING_SATELLITE_CODECVT_IDS _DLL)\r\n target_compile_options(msvcp${D_SUFFIX}_codecvt_ids_objects PRIVATE ${gl_flag_${REL_OR_DBG}} /EHsc)\r\n target_stl_compile_options(msvcp${D_SUFFIX}_codecvt_ids_objects ${REL_OR_DBG})\r\n\r\n add_library(msvcp${D_SUFFIX}_codecvt_ids SHARED)\r\n target_link_libraries(msvcp${D_SUFFIX}_codecvt_ids PRIVATE msvcp${D_SUFFIX}_codecvt_ids_objects msvcp${D_SUFFIX}_satellite_objects \"msvcp${D_SUFFIX}\" \"${TOOLSET_LIB}/vcruntime${D_SUFFIX}.lib\" \"${TOOLSET_LIB}/msvcrt${D_SUFFIX}.lib\" \"ucrt${D_SUFFIX}.lib\")\r\n set_target_properties(msvcp${D_SUFFIX}_codecvt_ids PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcp140_codecvt_ids${D_SUFFIX}${VCLIBS_SUFFIX}\")\r\n set_target_properties(msvcp${D_SUFFIX}_codecvt_ids PROPERTIES ARCHIVE_OUTPUT_DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}\")\r\n set_target_properties(msvcp${D_SUFFIX}_codecvt_ids PROPERTIES OUTPUT_NAME \"msvcp140${D_SUFFIX}_codecvt_ids${VCLIBS_SUFFIX}\")\r\n target_link_options(msvcp${D_SUFFIX}_codecvt_ids PRIVATE ${link_options_${REL_OR_DBG}})\r\n\r\n # import library\r\n add_library(msvcp${D_SUFFIX}_implib STATIC ${HEADERS})\r\n target_link_libraries(msvcp${D_SUFFIX}_implib stl_alias_objects msvcp${D_SUFFIX}_implib_objects)\r\n add_dependencies(msvcp${D_SUFFIX}_implib msvcp${D_SUFFIX} msvcp_1${D_SUFFIX} msvcp_2${D_SUFFIX} msvcp${D_SUFFIX}_atomic_wait msvcp${D_SUFFIX}_codecvt_ids)\r\n set_target_properties(msvcp${D_SUFFIX}_implib PROPERTIES STATIC_LIBRARY_OPTIONS \"/NOLOGO;/NODEFAULTLIB;/IGNORE:4006;$;$;$;$;$;${VCLIBS_EXPLICIT_MACHINE}\")\r\n set_target_properties(msvcp${D_SUFFIX}_implib PROPERTIES ARCHIVE_OUTPUT_NAME \"msvcprt${D_SUFFIX}\")\r\nendfunction()\r\n\r\nadd_stl_dlls(\"\" Release)\r\nadd_stl_dlls(\"d\" Debug)\r\n\r\nfunction(add_stl_statics FLAVOR_SUFFIX REL_OR_DBG IDL_VALUE)\r\n add_library(libcpmt${FLAVOR_SUFFIX}_eha OBJECT ${EHA_SOURCES})\r\n target_compile_definitions(libcpmt${FLAVOR_SUFFIX}_eha PRIVATE _ANNOTATE_STL \"_ITERATOR_DEBUG_LEVEL=${IDL_VALUE}\")\r\n target_compile_options(libcpmt${FLAVOR_SUFFIX}_eha PRIVATE /EHa)\r\n target_stl_compile_options(libcpmt${FLAVOR_SUFFIX}_eha ${REL_OR_DBG})\r\n\r\n add_library(libcpmt${FLAVOR_SUFFIX} STATIC ${HEADERS} ${IMPLIB_SOURCES} ${SOURCES} ${INITIALIZER_SOURCES} ${STATIC_SOURCES})\r\n target_compile_definitions(libcpmt${FLAVOR_SUFFIX} PRIVATE _ANNOTATE_STL \"_ITERATOR_DEBUG_LEVEL=${IDL_VALUE}\")\r\n target_compile_options(libcpmt${FLAVOR_SUFFIX} PRIVATE \"$<$:/EHsc>\")\r\n target_link_libraries(libcpmt${FLAVOR_SUFFIX} PRIVATE Boost::math stl_alias_objects libcpmt${FLAVOR_SUFFIX}_eha)\r\n target_stl_compile_options(libcpmt${FLAVOR_SUFFIX} ${REL_OR_DBG})\r\n set_target_properties(libcpmt${FLAVOR_SUFFIX} PROPERTIES STATIC_LIBRARY_OPTIONS \"${VCLIBS_EXPLICIT_MACHINE}\")\r\nendfunction()\r\n\r\nadd_stl_statics(\"\" Release 0)\r\nadd_stl_statics(\"1\" Release 1)\r\nadd_stl_statics(\"d\" Debug 2)\r\nadd_stl_statics(\"d1\" Debug 1)\r\nadd_stl_statics(\"d0\" Debug 0)\r\n\r\nadd_library(stl_asan STATIC ${ASAN_SOURCES})\r\nset_target_properties(stl_asan PROPERTIES STATIC_LIBRARY_OPTIONS \"${VCLIBS_EXPLICIT_MACHINE}\")\r\n\r\nconfigure_file(set_environment.bat.in \"${PROJECT_BINARY_DIR}/set_environment.bat\" @ONLY)\r\nconfigure_file(set_environment.ps1.in \"${PROJECT_BINARY_DIR}/set_environment.ps1\" @ONLY)\r\n" }, { "path": "stl/debugger/STL.natvis", "content": "\r\n\r\n\r\n\r\n \r\n \r\n {*($T1 *)this}\r\n \r\n *($T1 *)this\r\n \r\n \r\n\r\n \r\n \r\n {_Myval1}\r\n \r\n _Myval1\r\n \r\n \r\n\r\n\r\n \r\n [{name(),sb}]\r\n \r\n \r\n Enable \"Allow Function Calls In Value Formatting\" if you see \"???\" here\r\n \r\n \r\n \r\n\r\n \r\n {{ value={_Myval}, category={*_Mycat} }}\r\n \r\n \r\n Enable \"Allow Function Calls In Value Formatting\" if you see \"???\" here\r\n \r\n _Myval\r\n _Mycat\r\n \r\n \r\n\r\n \r\n \r\n null\r\n \r\n \r\n\r\n\r\n \r\n {{ size={_Last - _First} }}\r\n \r\n \r\n _Last - _First\r\n _First\r\n \r\n \r\n \r\n\r\n\r\n \r\n {first}, {second}\r\n ({first}, {second})\r\n \r\n first\r\n second\r\n \r\n \r\n\r\n \r\n \r\n ({*this,view(noparens)})\r\n \r\n \r\n\r\n \r\n\r\n \r\n _Myfirst._Val, true\">\r\n {_Myfirst._Val}, {*((_Mybase *) this),view(noparens)}\r\n \r\n {_Myfirst._Val}\r\n ({*this,view(noparens)})\r\n \r\n _Myfirst._Val\r\n ((_Mybase *) this)->_Myfirst._Val\r\n ((_Mybase::_Mybase *) this)->_Myfirst._Val\r\n ((_Mybase::_Mybase::_Mybase *) this)->_Myfirst._Val\r\n ((_Mybase::_Mybase::_Mybase::_Mybase *) this)->_Myfirst._Val\r\n _Myfirst._Val, true\">\r\n Next five elements:\r\n \r\n *((_Mybase::_Mybase::_Mybase::_Mybase::_Mybase *) this)\r\n \r\n \r\n\r\n \r\n _Myfirst._Val, true\">\r\n {_Myfirst._Val}, {*((_Mybase *) this),view(noparensasptr)}\r\n \r\n {&_Myfirst._Val}\r\n ({*this,view(noparensasptr)})\r\n \r\n &_Myfirst._Val\r\n &((_Mybase *) this)->_Myfirst._Val\r\n &((_Mybase::_Mybase *) this)->_Myfirst._Val\r\n &((_Mybase::_Mybase::_Mybase *) this)->_Myfirst._Val\r\n &((_Mybase::_Mybase::_Mybase::_Mybase *) this)->_Myfirst._Val\r\n _Myfirst._Val, true\">\r\n Next five elements:\r\n \r\n *((_Mybase::_Mybase::_Mybase::_Mybase::_Mybase *) this),view(asptr)\r\n \r\n \r\n\r\n \r\n nullopt\r\n \r\n\r\n \r\n nullopt\r\n {_Value}\r\n \r\n _Value\r\n \r\n \r\n\r\n\r\n \r\n {_Elem}\r\n \r\n\r\n \r\n \r\n [valueless_by_exception]\r\n {{ index=0, value={_Head} }}\r\n {{ index=1, value={_Tail._Head} }}\r\n {{ index=2, value={_Tail._Tail._Head} }}\r\n {{ index=3, value={_Tail._Tail._Tail._Head} }}\r\n {{ index=4, value={_Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=5, value={_Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=6, value={_Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=7, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=8, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=9, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=10, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=11, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=12, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=13, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=14, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=15, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=16, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=17, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=18, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=19, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=20, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=21, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=22, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=23, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=24, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=25, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=26, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=27, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=28, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=29, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=30, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n {{ index=31, value={_Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head} }}\r\n \r\n index()\r\n _Head\r\n _Tail._Head\r\n _Tail._Tail._Head\r\n _Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n _Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Tail._Head\r\n \r\n \r\n\r\n \r\n monostate\r\n \r\n\r\n \r\n \r\n {unex()}\r\n \r\n unex()\r\n \r\n \r\n\r\n \r\n \r\n {unex()}\r\n \r\n unex()\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n {value()}\r\n {unex()}\r\n \r\n value()\r\n unex()\r\n \r\n \r\n\r\n \r\n \r\n \r\n void\r\n {unex()}\r\n \r\n unex()\r\n \r\n \r\n\r\n\r\n \r\n {{ size={$T1} }}\r\n \r\n \r\n $T1\r\n (_Array[$i / _Bitsperword] >> ($i % _Bitsperword)) & 1,d\r\n \r\n \r\n \r\n\r\n \r\n {(_Pbitset->_Array[_Mypos / _Pbitset->_Bitsperword] >> (_Mypos % _Pbitset->_Bitsperword)) & 1,d}\r\n \r\n _Pbitset\r\n _Mypos\r\n \r\n \r\n\r\n\r\n \r\n allocator\r\n \r\n \r\n\r\n\r\n \r\n default_delete\r\n \r\n \r\n\r\n \r\n \r\n _Mypair._Myval2\r\n empty\r\n unique_ptr void\r\n \r\n _Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n _Mypair._Myval2\r\n empty\r\n unique_ptr {*_Mypair._Myval2}\r\n \r\n _Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n {{empty}}\r\n {_Mypair._Myval2}\r\n _Mypair._Myval2\r\n \r\n _Mypair\r\n _Mypair._Myval2,hv\r\n \r\n \r\n\r\n \r\n default\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n \r\n custom deleter\r\n \r\n _Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n \r\n custom deleter, custom allocator\r\n \r\n _Mypair._Myval2._Myval2\r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n \r\n\r\n \r\n make_shared\r\n \r\n ($T1 *) &_Storage\r\n \r\n \r\n\r\n \r\n \r\n make_shared\r\n \r\n ($T1 *) &_Storage\r\n \r\n \r\n\r\n \r\n \r\n make_shared<T[N]>\r\n \r\n _Storage._Value\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n make_shared<T[]>\r\n \r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n make_shared<T[]>\r\n \r\n _Storage._Value\r\n \r\n \r\n\r\n \r\n \r\n allocate_shared\r\n \r\n ($T1 *) &_Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared\r\n \r\n ($T1 *) &_Storage\r\n allocator()\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared<T[N]>\r\n \r\n _Storage._Value\r\n allocator()\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared<T[]>\r\n \r\n allocator()\r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared_for_overwrite\r\n \r\n ($T1 *) &_Storage\r\n allocator()\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared_for_overwrite<T[N]>\r\n \r\n _Storage._Value\r\n allocator()\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n allocate_shared_for_overwrite<T[]>\r\n \r\n allocator()\r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n custom deleter\r\n \r\n _Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n \r\n custom deleter, custom allocator\r\n \r\n _Mypair._Myval2._Myval2\r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n \r\n\r\n \r\n \r\n _Ptr\r\n empty\r\n nullptr\r\n void\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n \r\n _Ptr\r\n *_Rep\r\n \r\n \r\n\r\n \r\n _Ptr\r\n empty\r\n nullptr\r\n {*_Ptr}\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n shared_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n \r\n _Ptr\r\n *_Rep\r\n \r\n \r\n\r\n \r\n \r\n empty\r\n nullptr\r\n void\r\n expired [{_Rep->_Weaks} weak ref] [{*_Rep}]\r\n expired [{_Rep->_Weaks} weak refs] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n \r\n _Ptr\r\n *_Rep\r\n \r\n \r\n\r\n \r\n empty\r\n nullptr\r\n {*_Ptr}\r\n expired [{_Rep->_Weaks} weak ref] [{*_Rep}]\r\n expired [{_Rep->_Weaks} weak refs] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong ref, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak ref] [{*_Rep}]\r\n weak_ptr {*this,view(ptr)} [{_Rep->_Uses} strong refs, {_Rep->_Weaks - 1} weak refs] [{*_Rep}]\r\n \r\n _Ptr\r\n *_Rep\r\n \r\n \r\n\r\n\r\n \r\n \r\n {*_Ptr}\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n ranges::equal_to\r\n ranges::not_equal_to\r\n ranges::greater\r\n ranges::less\r\n ranges::greater_equal\r\n ranges::less_equal\r\n compare_three_way\r\n\r\n \r\n plus<>\r\n minus<>\r\n multiplies<>\r\n divides<>\r\n modulus<>\r\n negate<>\r\n equal_to<>\r\n not_equal_to<>\r\n greater<>\r\n less<>\r\n greater_equal<>\r\n less_equal<>\r\n logical_and<>\r\n logical_or<>\r\n logical_not<>\r\n bit_and<>\r\n bit_or<>\r\n bit_xor<>\r\n bit_not<>\r\n\r\n \r\n plus\r\n minus\r\n multiplies\r\n divides\r\n modulus\r\n negate\r\n equal_to\r\n not_equal_to\r\n greater\r\n less\r\n greater_equal\r\n less_equal\r\n logical_and\r\n logical_or\r\n logical_not\r\n bit_and\r\n bit_or\r\n bit_xor\r\n bit_not\r\n\r\n\r\n \r\n not1({_Functor})\r\n \r\n _Functor\r\n \r\n \r\n\r\n \r\n not2({_Functor})\r\n \r\n _Functor\r\n \r\n \r\n\r\n\r\n \r\n _{$T1,d}\r\n \r\n \r\n\r\n \r\n \r\n bind({_Mypair}, {_Mypair._Myval2,view(noparens)})\r\n \r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n \r\n\r\n \r\n bind_front({_Mypair}, {_Mypair._Myval2,view(noparens)})\r\n \r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n \r\n\r\n \r\n bind_back({_Mypair}, {_Mypair._Myval2,view(noparens)})\r\n \r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n \r\n\r\n\r\n \r\n \r\n mem_fn({_Pm})\r\n \r\n \r\n\r\n\r\n \r\n \r\n {_Mypair._Myval2}\r\n \r\n _Mypair._Myval2\r\n _Mypair\r\n \r\n \r\n\r\n \r\n {_Callee}\r\n \r\n _Callee\r\n \r\n \r\n\r\n \r\n \r\n empty\r\n {*_Mystorage._Ptrs[_EEN_IMPL]}\r\n \r\n *_Mystorage._Ptrs[_EEN_IMPL]\r\n \r\n \r\n\r\n\r\n \r\n hash\r\n \r\n \r\n\r\n\r\n \r\n {_MyRep} nanosecond\r\n {_MyRep} nanoseconds\r\n \r\n \r\n\r\n \r\n {_MyRep} microsecond\r\n {_MyRep} microseconds\r\n \r\n \r\n\r\n \r\n {_MyRep} millisecond\r\n {_MyRep} milliseconds\r\n \r\n \r\n\r\n \r\n {_MyRep} second\r\n {_MyRep} seconds\r\n \r\n \r\n\r\n \r\n {_MyRep} minute\r\n {_MyRep} minutes\r\n \r\n \r\n\r\n \r\n {_MyRep} hour\r\n {_MyRep} hours\r\n \r\n \r\n\r\n \r\n {_MyRep} day\r\n {_MyRep} days\r\n \r\n \r\n\r\n \r\n {_MyRep} week\r\n {_MyRep} weeks\r\n \r\n \r\n\r\n \r\n {_MyRep} month\r\n {_MyRep} months\r\n \r\n \r\n\r\n \r\n {_MyRep} year\r\n {_MyRep} years\r\n \r\n \r\n\r\n \r\n {(int)_Day}st\r\n {(int)_Day}nd\r\n {(int)_Day}rd\r\n {(int)_Day}th\r\n \r\n \r\n\r\n \r\n January\r\n February\r\n March\r\n April\r\n May\r\n June\r\n July\r\n August\r\n September\r\n October\r\n November\r\n December\r\n {_Month}\r\n \r\n \r\n\r\n \r\n {_Year}\r\n \r\n \r\n\r\n \r\n Sunday\r\n Monday\r\n Tuesday\r\n Wednesday\r\n Thursday\r\n Friday\r\n Saturday\r\n {_Weekday}\r\n \r\n \r\n\r\n \r\n {(int)_Index}st {_Weekday}\r\n {(int)_Index}nd {_Weekday}\r\n {(int)_Index}rd {_Weekday}\r\n {(int)_Index}th {_Weekday}\r\n {(int)_Index}, {_Weekday}\r\n \r\n _Weekday\r\n (int)_Index\r\n \r\n \r\n\r\n \r\n Last {_Weekday}\r\n \r\n _Weekday\r\n \r\n \r\n\r\n \r\n {_Month} {_Day}\r\n \r\n _Month\r\n _Day\r\n \r\n \r\n\r\n \r\n Last day of {_Month}\r\n \r\n _Month\r\n \r\n \r\n\r\n \r\n {_Weekday_index} of {_Month}\r\n \r\n _Month\r\n _Weekday_index\r\n \r\n \r\n\r\n \r\n Last {_Weekday_last._Weekday} of {_Month}\r\n \r\n _Month\r\n _Weekday_last._Weekday\r\n \r\n \r\n\r\n \r\n {_Year} {_Month}\r\n \r\n _Year\r\n _Month\r\n \r\n \r\n\r\n \r\n {_Year} {_Month} {_Day}\r\n \r\n _Year\r\n _Month\r\n _Day\r\n \r\n \r\n\r\n \r\n {_Month_day_last}, {_Year}\r\n \r\n _Year\r\n _Month_day_last._Month\r\n \r\n \r\n\r\n \r\n {_Weekday_index} of {_Month}, {_Year}\r\n \r\n _Year\r\n _Month\r\n _Weekday_index\r\n \r\n \r\n\r\n \r\n {_Weekday_last} of {_Month}, {_Year}\r\n \r\n _Year\r\n _Month\r\n _Weekday_last._Weekday\r\n \r\n \r\n\r\n \r\n -{_Hours._MyRep}h {_Mins._MyRep}m {_Secs._MyRep}s {_Sub_secs._MyRep}ss\r\n {_Hours._MyRep}h {_Mins._MyRep}m {_Secs._MyRep}s {_Sub_secs._MyRep}ss\r\n \r\n _Is_neg\r\n _Hours\r\n _Mins\r\n _Secs\r\n _Sub_secs\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n {_Mypair._Myval2._Bx._Buf,na}\r\n {_Mypair._Myval2._Bx._Ptr,na}\r\n _Mypair._Myval2._Bx._Buf,na\r\n _Mypair._Myval2._Bx._Ptr,na\r\n \r\n size()\r\n capacity()\r\n _Mypair\r\n \r\n _Mypair._Myval2._Mysize\r\n _Mypair._Myval2._Bx._Buf\r\n _Mypair._Myval2._Bx._Ptr\r\n \r\n \r\n \r\n\r\n \r\n \r\n _Ptr,na\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n {_Mydata,[_Mysize]na}\r\n _Mydata,[_Mysize]na\r\n \r\n size()\r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n _Myptr,na\r\n \r\n _Myptr\r\n \r\n \r\n\r\n \r\n \r\n {_Mydata + _Myoff,[_Mysize - _Myoff]na}\r\n _Mydata + _Myoff,[_Mysize - _Myoff]na\r\n \r\n _Mydata + _Myoff\r\n _Myoff\r\n _Mydata,[_Mysize]na\r\n \r\n \r\n\r\n\r\n \r\n {{ size={$T2} }}\r\n \r\n \r\n $T2\r\n _Elems\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n _Ptr,na\r\n {*_Ptr}\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n _Ptr + _Idx\r\n {_Ptr[_Idx]}\r\n end\r\n \r\n _Ptr + _Idx\r\n \r\n \r\n\r\n \r\n \r\n {{ size={size()} }}\r\n \r\n _Mypair\r\n \r\n size()\r\n _Mypair._Myval2._Map[(($i + _Mypair._Myval2._Myoff) / _EEN_DS) % _Mypair._Myval2._Mapsize][($i + _Mypair._Myval2._Myoff) % _EEN_DS]\r\n \r\n \r\n \r\n\r\n \r\n \r\n {((_Mydeque_t *)_Myproxy->_Mycont)->_Map[(_Myoff / _EEN_DS) % ((_Mydeque_t *)_Myproxy->_Mycont)->_Mapsize][_Myoff % _EEN_DS]}\r\n end\r\n \r\n _Myoff - ((_Mydeque_t *)_Myproxy->_Mycont)->_Myoff\r\n &((_Mydeque_t *)_Myproxy->_Mycont)->_Map[(_Myoff / _EEN_DS) % ((_Mydeque_t *)_Myproxy->_Mycont)->_Mapsize][_Myoff % _EEN_DS]\r\n \r\n \r\n\r\n\r\n \r\n \r\n empty\r\n non-empty\r\n \r\n _Mypair\r\n \r\n _Mypair._Myval2._Myhead\r\n _Next\r\n _Myval\r\n \r\n \r\n \r\n\r\n \r\n \r\n &_Ptr->_Myval,na\r\n end\r\n {**this}\r\n \r\n\r\n \r\n \r\n {{ size={_Mypair._Myval2._Mysize} }}\r\n \r\n _Mypair\r\n \r\n _Mypair._Myval2._Mysize\r\n _Mypair._Myval2._Myhead->_Next\r\n _Next\r\n _Myval\r\n \r\n \r\n \r\n\r\n \r\n \r\n &_Ptr->_Myval,na\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n {{ size={size()} }}\r\n \r\n capacity()\r\n _Myvec._Mypair\r\n \r\n _Mysize\r\n (bool)((_Myvec._Mypair._Myval2._Myfirst[$i / _EEN_VBITS] >> ($i % _EEN_VBITS)) & 1)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n {(bool)((*_Myptr >> _Myoff) & 1)}\r\n \r\n _Myptr\r\n _Myoff\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n {{ size={size()} }}\r\n \r\n capacity()\r\n _Mypair\r\n \r\n size()\r\n _Mypair._Myval2._Myfirst\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n data()\r\n 0\">{data(),[size()]na}\r\n {{empty}}\r\n \r\n size()\r\n capacity()\r\n _Mypair\r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n _Ptr,na\r\n {*_Ptr}\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n _Ptr,na\r\n end\r\n {*_Ptr}\r\n \r\n _Ptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n {{ size={_Mypair._Myval2._Myval2._Mysize} }}\r\n \r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n _Mypair._Myval2._Myval2._Mysize\r\n _Mypair._Myval2._Myval2._Myhead->_Parent\r\n _Left\r\n _Right\r\n _Myval\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n {{ size={_Mypair._Myval2._Myval2._Mysize} }}\r\n \r\n _Mypair\r\n _Mypair._Myval2\r\n \r\n _Mypair._Myval2._Myval2._Mysize\r\n _Mypair._Myval2._Myval2._Myhead->_Parent\r\n _Left\r\n _Right\r\n _Myval,view(MapHelper)\r\n \r\n \r\n \r\n\r\n \r\n {second}\r\n \r\n\r\n \r\n \r\n _Ptr->_Isnil ? nullptr : &_Ptr->_Myval\r\n {_Ptr->_Myval}\r\n end\r\n \r\n &_Ptr->_Myval\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n {_List}\r\n \r\n _Maxidx\r\n ((float)_List._Mypair._Myval2._Mysize) / ((float)_Maxidx)\r\n _Traitsobj._Max_buckets\r\n _List._Mypair\r\n _List,view(simple)\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n {_List}\r\n \r\n _Maxidx\r\n ((float)_List._Mypair._Myval2._Mysize) / ((float)_Maxidx)\r\n _Traitsobj._Mypair._Myval2._Myval2\r\n _Traitsobj._Mypair\r\n _Traitsobj._Mypair._Myval2\r\n _List._Mypair\r\n _List,view(simple)\r\n \r\n \r\n\r\n \r\n \r\n {_List}\r\n \r\n _Maxidx\r\n ((float)_List._Mypair._Myval2._Mysize) / ((float)_Maxidx)\r\n _Traitsobj._Mypair._Myval2._Myval2\r\n _Traitsobj._Mypair\r\n _Traitsobj._Mypair._Myval2\r\n _List._Mypair\r\n _List,view(MapHelper)\r\n \r\n \r\n\r\n \r\n \r\n Test\r\n \r\n \r\n _Mypair._Myval2._Mysize\r\n _Mypair._Myval2._Myhead->_Next\r\n _Next\r\n _Myval\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n {c}\r\n \r\n c\r\n \r\n \r\n\r\n\r\n \r\n {c}\r\n \r\n c\r\n comp\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n current._Ptr - 1,na\r\n reverse_iterator {current._Ptr[-1]}\r\n \r\n current._Ptr - 1\r\n \r\n \r\n\r\n \r\n \r\n \r\n current._Ptr + current._Idx - 1,na\r\n reverse_iterator {current._Ptr[current._Idx - 1]}\r\n reverse_iterator rend\r\n \r\n current._Ptr + current._Idx - 1\r\n \r\n \r\n\r\n \r\n \r\n &current._Ptr->_Prev->_Myval,na\r\n reverse_iterator {**this}\r\n \r\n\r\n \r\n \r\n current._Ptr - 1,na\r\n reverse_iterator {**this}\r\n \r\n current._Ptr - 1\r\n \r\n \r\n\r\n \r\n reverse_iterator base() {current}\r\n \r\n NOTE: *ri is equivalent to *prev(ri.base())\r\n current\r\n \r\n \r\n\r\n \r\n \r\n current - 1\r\n reverse_iterator {current[-1]}\r\n \r\n current - 1\r\n \r\n \r\n\r\n\r\n \r\n back_insert_iterator into {container}\r\n \r\n container\r\n \r\n \r\n\r\n\r\n \r\n front_insert_iterator into {container}\r\n \r\n container\r\n \r\n \r\n\r\n\r\n \r\n insert_iterator into {container} at {iter}\r\n \r\n container\r\n iter\r\n \r\n \r\n\r\n\r\n \r\n move_iterator {_Current}\r\n \r\n _Current\r\n \r\n \r\n\r\n\r\n \r\n basic_const_iterator {_Current}\r\n \r\n _Current\r\n \r\n \r\n\r\n\r\n \r\n -i*{-_Val[1]}\r\n {_Val[0]}-i*{-_Val[1]}\r\n {_Val[0]}\r\n i*{_Val[1]}\r\n {_Val[0]}+i*{_Val[1]}\r\n \r\n _Val[0]\r\n _Val[1]\r\n \r\n \r\n\r\n\r\n \r\n {{ size={_Mysize} }}\r\n \r\n \r\n _Mysize\r\n _Myptr\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n {data(),[size()]}\r\n \r\n \r\n\r\n \r\n {_Stringbuffer}\r\n \r\n _Stringbuffer\r\n \r\n \r\n\r\n \r\n {_Stringbuffer}\r\n \r\n _Stringbuffer\r\n \r\n \r\n\r\n \r\n {_Stringbuffer}\r\n \r\n _Stringbuffer\r\n \r\n \r\n\r\n\r\n \r\n empty\r\n {_Visualization}\r\n _Visualization\r\n \r\n \r\n\r\n\r\n \r\n {first,[second - first]na}\r\n false\r\n \r\n matched\r\n first\r\n second\r\n \r\n \r\n\r\n \r\n \r\n {first._Ptr,[second._Ptr - first._Ptr]na}\r\n false\r\n \r\n matched\r\n first\r\n second\r\n \r\n \r\n\r\n\r\n \r\n not ready\r\n {_Matches}\r\n \r\n _Matches,view(simple)\r\n _Prefix\r\n _Suffix\r\n \r\n \r\n\r\n\r\n \r\n &_MyVal\r\n end\r\n {_MyVal}\r\n \r\n _Begin\r\n _End\r\n _MyRe\r\n _Flags\r\n _MyVal\r\n \r\n \r\n\r\n\r\n \r\n _Res\r\n end\r\n {*_Res}\r\n \r\n _Pos\r\n _Res\r\n _Suffix\r\n _Cur\r\n _Subs\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n {value()}\r\n \r\n value()\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n {value()}\r\n \r\n \r\n\r\n \r\n \r\n unlocked\r\n locked\r\n \r\n _Mtx_storage._Thread_id\r\n _Mtx_storage._Count\r\n \r\n \r\n\r\n \r\n \r\n unlocked\r\n locked\r\n \r\n _My_owner\r\n _My_locked\r\n \r\n \r\n\r\n \r\n {&_MyMutex}\r\n \r\n &_MyMutex\r\n \r\n \r\n\r\n \r\n empty\r\n {*_Pmtx} - unowned\r\n {*_Pmtx} - owned\r\n \r\n _Pmtx\r\n _Owns\r\n \r\n \r\n\r\n \r\n ()\r\n \r\n\r\n \r\n ({&_MyMutex})\r\n \r\n &_MyMutex\r\n \r\n \r\n\r\n \r\n {_MyMutexes,view(asptr)}\r\n \r\n _MyMutexes,view(asptr)\r\n \r\n \r\n\r\n \r\n std::defer_lock\r\n \r\n\r\n \r\n std::try_to_lock\r\n \r\n\r\n \r\n std::adopt_lock\r\n \r\n\r\n \r\n incomplete\r\n complete\r\n \r\n\r\n \r\n \r\n \r\n _Retrieved\r\n _Result\r\n _Exception\r\n \r\n \r\n\r\n \r\n \r\n \r\n empty\r\n pending\r\n has_result\r\n \r\n *_MyPromise._State._Assoc_state\r\n _MyPromise._Future_retrieved\r\n \r\n \r\n\r\n \r\n \r\n \r\n empty\r\n pending\r\n has_result\r\n \r\n *_Assoc_state\r\n \r\n \r\n\r\n\r\n \r\n \r\n ptr_fun({_Pfun})\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n mem_fun({_Pmemfun})\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n mem_fun_ref({_Pmemfun})\r\n \r\n \r\n\r\n \r\n bind1st({op}, {value})\r\n \r\n op\r\n value\r\n \r\n \r\n\r\n \r\n bind2nd({op}, {value})\r\n \r\n op\r\n value\r\n \r\n \r\n\r\n \r\n empty\r\n auto_ptr {*_Myptr}\r\n \r\n _Myptr\r\n \r\n \r\n\r\n\r\n \r\n \r\n {_Ptr->_Fn,na}, #initial suspend\r\n {_Ptr->_Fn,na}, #final suspend\r\n {_Ptr->_Fn,na}, suspend point #{(_Ptr->_Index)/2 - 1}\r\n {_Ptr->_Fn,na}\r\n \r\n \"initial suspend\"\r\n \"final suspend\"\r\n (_Ptr->_Index)/2 - 1\r\n this,view(ViewPromise)\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n *reinterpret_cast<$T1 *>(reinterpret_cast<char*>(_Ptr) - _ALIGNED_SIZE)\r\n \r\n \r\n\r\n \r\n \r\n \r\n *reinterpret_cast<$T1 *>(reinterpret_cast<char*>(_Ptr) + 2*sizeof(void*))\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n empty\r\n {primary_function(_Ptr),na} #final suspend\r\n {primary_function(_Ptr),na} #initial suspend\r\n {primary_function(_Ptr),na} #suspend point {suspend_point(_Ptr)}\r\n {primary_function(_Ptr),na} #suspend point {suspend_point(_Ptr)}, line {suspend_point_line(_Ptr)}\r\n \r\n this,view(ViewPromise)\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n {{ size={size()} }}\r\n \r\n \r\n size()\r\n data()\r\n \r\n \r\n \r\n\r\n \r\n \r\n _Myptr,na\r\n {*_Myptr}\r\n \r\n _Myptr\r\n \r\n \r\n\r\n \r\n \r\n _Myptr,na\r\n end\r\n {*_Myptr}\r\n \r\n _Myptr\r\n \r\n \r\n\r\n \r\n default sentinel\r\n \r\n\r\n \r\n unreachable\r\n \r\n\r\n \r\n {{}}\r\n \r\n\r\n \r\n [{ _Val._Val }]\r\n \r\n \r\n 1\r\n &_Val._Val\r\n \r\n \r\n \r\n\r\n \r\n \r\n [{_Value}; {_Bound})\r\n \r\n size()\r\n \r\n \r\n\r\n size()\r\n \r\n \r\n val\r\n ++val\r\n \r\n \r\n \r\n \r\n\r\n \r\n [{_Value}; +∞)\r\n \r\n _Value\r\n \r\n \r\n\r\n \r\n [{_Value._Val} x {_Bound}]\r\n \r\n _Bound\r\n \r\n \r\n\r\n \r\n \r\n _Value._Val\r\n ++idx\r\n \r\n \r\n \r\n \r\n\r\n \r\n [{_Value._Val} x +∞]\r\n \r\n _Value._Val\r\n \r\n \r\n\r\n \r\n {*_Value}\r\n \r\n _Value\r\n _Current\r\n \r\n \r\n\r\n \r\n {*_Value}\r\n \r\n _Value\r\n \r\n \r\n\r\n \r\n dangling\r\n \r\n\r\n \r\n {_Base}\r\n \r\n\r\n \r\n {_Stream}\r\n \r\n _Val\r\n \r\n \r\n\r\n \r\n &_Current,na\r\n \r\n _Current\r\n \r\n \r\n\r\n \r\n {&_Last,na}\r\n \r\n _Last\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n {_Range}\r\n \r\n _Pred\r\n _Next\r\n _Count\r\n _Fun\r\n _Pattern\r\n _Stride\r\n \r\n \r\n\r\n \r\n {{ id={_Thr._Id} }}\r\n \r\n\r\n \r\n {_Id}\r\n \r\n\r\n \r\n {_Impl}\r\n \r\n\r\n \r\n {_Text}\r\n \r\n\r\n \r\n {_Function,sb}: ({_Line}, {_Column})\r\n \r\n _Line\r\n _Column\r\n _File,s\r\n _Function,s\r\n \r\n \r\n\r\n \r\n less\r\n equal\r\n greater\r\n \r\n \r\n\r\n \r\n less\r\n equivalent\r\n greater\r\n \r\n \r\n\r\n \r\n less\r\n equivalent\r\n greater\r\n unordered\r\n \r\n \r\n\r\n \r\n {_Format_string}\r\n \r\n _Num_args\r\n _Next_arg_id\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n {{ size={_Num_args} }}\r\n \r\n \r\n _Num_args\r\n \"None\"\r\n \r\n \r\n *(int*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(unsigned int*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(long long*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(unsigned long long*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(bool*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(char*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(float*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(double*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(long double*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(void**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(char**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(std::string_view*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(void**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n {{ size={_Num_args} }}\r\n \r\n \r\n _Num_args\r\n \r\n \r\n *(int*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(unsigned int*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(long long*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(unsigned long long*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(bool*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(wchar_t*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(float*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(double*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(long double*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(void**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(wchar_t**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(std::wstring_view*)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n *(void**)(&storage()[_Index_array[$i]._Index])\r\n \r\n \r\n \r\n \r\n\r\n \r\n No state: {_No_state}\r\n Int state: {_Int_state}\r\n UInt state: {_UInt_state}\r\n Long long state: {_Long_long_state}\r\n ULong long state: {_ULong_long_state}\r\n Bool state: {_Bool_state}\r\n Char state: {_Char_state}\r\n Float state: {_Float_state}\r\n Double state: {_Double_state}\r\n Long double state: {_Long_double_state}\r\n Pointer state: {_Pointer_state}\r\n CString state: {_CString_state}\r\n String state: {_String_state}\r\n Custom state: {_Custom_state}\r\n = 14\">Invalid state: {_Active_state}\r\n \r\n\r\n \r\n {_Args}\r\n \r\n _OutputIt\r\n _Loc\r\n \r\n \r\n\r\n \r\n {what()}\r\n \r\n\r\n \r\n \r\n \r\n {_Data}\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n [empty]\r\n [not empty (trivial)]\r\n [not empty (small)]\r\n [not empty (large)]\r\n \r\n (void*)(&_Storage._TrivialData)\r\n (void*)(&_Storage._SmallStorage._Data)\r\n _Storage._BigStorage._Ptr\r\n \r\n {has_value()}\r\n \r\n \r\n {type()}\r\n \r\n \r\n (Small and Trivial Object)\r\n \r\n \r\n (Small Object)\r\n \r\n \r\n (Dynamic Allocation)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n {year(),d}-{month()/10,d}{month()%10,d}-{day()/10,d}{day()%10,d} {\r\n (_MyDur._MyRep % (24 * 60 * 60 * 10000000ull))/(10 * 60 * 60 * 10000000ull),d\r\n }{\r\n ((_MyDur._MyRep % (24 * 60 * 60 * 10000000ull))/(60 * 60 * 10000000ull)) % 10,d\r\n }:{\r\n (_MyDur._MyRep % (60 * 60 * 10000000ull))/(10 * 60 * 10000000ull),d\r\n }{\r\n (_MyDur._MyRep % (10 * 60 * 10000000ull)) / (60 * 10000000ull),d\r\n }:{\r\n (_MyDur._MyRep % (60 * 10000000ull)) / (10 * 10000000ull),d\r\n }{\r\n (_MyDur._MyRep % (10 * 10000000ull)) / 10000000ull,d\r\n }.{\r\n (_MyDur._MyRep % 10000000) / 1000000,d\r\n }{\r\n (_MyDur._MyRep % 1000000) / 100000,d\r\n }{\r\n (_MyDur._MyRep % 100000) / 10000,d\r\n }{\r\n (_MyDur._MyRep % 10000) / 1000,d\r\n }{\r\n (_MyDur._MyRep % 1000) / 100,d\r\n }{\r\n (_MyDur._MyRep % 100) / 10,d\r\n }{\r\n _MyDur._MyRep % 10,d\r\n }\r\n \r\n \r\n _MyDur._MyRep\r\n _MyDur._MyRep/10\r\n _MyDur._MyRep/(10 * 1000)\r\n _MyDur._MyRep/(10 * 1000 * 1000)\r\n UTC\r\n \r\n \r\n\r\n \r\n {{ rank={_Rank}, rank_dynamic={_Rank_dynamic} }}\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n *dynptr\r\n ++dynptr\r\n \r\n ($T1) *statptr\r\n ++idx, ++statptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n *dynptr\r\n ++idx, ++dynptr\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ($T1) *statptr\r\n ++idx, ++statptr\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n {{ size={size()} }}\r\n\r\n \r\n size()\r\n _Key_compare\r\n \r\n \r\n size()\r\n \r\n *value_at(i)\r\n ++i\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n {{ size={size()} }}\r\n \r\n _Key_compare\r\n _Data.keys\r\n _Data.values\r\n \r\n \r\n\r\n \r\n ({_Key_it}, {_Mapped_it})\r\n \r\n _Key_it\r\n _Mapped_it\r\n \r\n \r\n\r\n \r\n \r\n {_Data}\r\n \r\n _Key_compare\r\n _Data\r\n \r\n \r\n\r\n\r\n" }, { "path": "stl/inc/__msvc_all_public_headers.hpp", "content": "// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n// This file is intended as a test resource for tools that want to verify that they can parse all MSVC standard\r\n// library headers without warnings. This file disables deprecations, so it should not be included in programs directly.\r\n//\r\n// This file may be changed, renamed, or removed at any time.\r\n\r\n#ifndef __MSVC_ALL_PUBLIC_HEADERS_HPP\r\n#define __MSVC_ALL_PUBLIC_HEADERS_HPP\r\n\r\n#pragma warning(push)\r\n#pragma warning(1 : 4668) // 'MEOW' is not defined as a preprocessor macro, replacing with '0' for '#if/#elif'\r\n\r\n// All STL headers should protect themselves from macroized new.\r\n#if !(defined(__CUDACC__) && defined(__clang__))\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n#define new WILL NOT COMPILE\r\n#endif // !(defined(__CUDACC__) && defined(__clang__))\r\n\r\n// VSO-768746: mbctype.h macroizes _MS, _MP, _M1, and _M2. Include it first for test coverage.\r\n#ifndef _MSVC_TESTING_NVCC\r\n#include \r\n#endif // !defined(_MSVC_TESTING_NVCC)\r\n\r\n#ifndef _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING\r\n#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING\r\n#endif // !defined(_SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING)\r\n\r\n#define _SILENCE_CXX20_CISO646_REMOVED_WARNING\r\n\r\n// Core STL Headers\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n// Core C Wrapper Headers\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#ifndef _CORE_HEADERS_ONLY\r\n\r\n// Non-Core STL Headers\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#ifndef _M_CEE_PURE\r\n#include <__msvc_cxx_stdatomic.hpp>\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#endif // !defined(_M_CEE_PURE)\r\n\r\n// Non-Core C Wrapper Headers\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#endif // !defined(_CORE_HEADERS_ONLY)\r\n\r\n#ifndef _MSVC_TESTING_NVCC\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#ifndef _CORE_HEADERS_ONLY\r\n#include \r\n#include \r\n#endif // !defined(_CORE_HEADERS_ONLY)\r\n\r\n#ifndef _M_CEE_PURE\r\n#include \r\n#endif // !defined(_M_CEE_PURE)\r\n#endif // !defined(_MSVC_TESTING_NVCC)\r\n\r\n#if !(defined(__CUDACC__) && defined(__clang__))\r\n#pragma pop_macro(\"new\")\r\n#endif // !(defined(__CUDACC__) && defined(__clang__))\r\n\r\n#pragma warning(pop)\r\n\r\n#endif // __MSVC_ALL_PUBLIC_HEADERS_HPP\r\n" }, { "path": "stl/inc/__msvc_bit_utils.hpp", "content": "// __msvc_bit_utils.hpp internal header (core)\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_BIT_UTILS_HPP\r\n#define __MSVC_BIT_UTILS_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n\r\n#include \r\n#include \r\n\r\n#include _STL_INTRIN_HEADER\r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n_STD_BEGIN\r\nextern \"C\" {\r\nextern int __isa_available;\r\n}\r\n\r\n_INLINE_VAR constexpr int _Stl_isa_available_sse42 = 2; // equal to __ISA_AVAILABLE_SSE42\r\n_INLINE_VAR constexpr int _Stl_isa_available_avx2 = 5; // equal to __ISA_AVAILABLE_AVX2\r\n\r\ntemplate \r\nconstexpr int _Unsigned_integer_digits = sizeof(_UInt) * CHAR_BIT;\r\n\r\n// Implementation of countl_zero without using specialized CPU instructions.\r\n// Used at compile time and when said instructions are not supported.\r\n// see \"Hacker's Delight\" section 5-3\r\ntemplate \r\n_NODISCARD constexpr int _Countl_zero_fallback(_Ty _Val) noexcept {\r\n _Ty _Yx = 0;\r\n\r\n unsigned int _Nx = _Unsigned_integer_digits<_Ty>;\r\n unsigned int _Cx = _Unsigned_integer_digits<_Ty> / 2;\r\n do {\r\n _Yx = static_cast<_Ty>(_Val >> _Cx);\r\n if (_Yx != 0) {\r\n _Nx -= _Cx;\r\n _Val = _Yx;\r\n }\r\n _Cx >>= 1;\r\n } while (_Cx != 0);\r\n return static_cast(_Nx) - static_cast(_Val);\r\n}\r\n\r\n#if !defined(_M_CEE_PURE)\r\n#define _HAS_COUNTL_ZERO_INTRINSICS 1\r\n#else // ^^^ intrinsics available / intrinsics unavailable vvv\r\n#define _HAS_COUNTL_ZERO_INTRINSICS 0\r\n#endif // ^^^ intrinsics unavailable ^^^\r\n\r\n#if _HAS_COUNTL_ZERO_INTRINSICS\r\n#if (defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)) || (defined(_M_X64) && !defined(_M_ARM64EC))\r\ntemplate \r\n_NODISCARD int _Countl_zero_lzcnt(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n\r\n if constexpr (_Digits <= 16) {\r\n return static_cast(__lzcnt16(_Val) - (16 - _Digits));\r\n } else if constexpr (_Digits == 32) {\r\n return static_cast(__lzcnt(_Val));\r\n } else {\r\n#ifdef _M_IX86\r\n const unsigned int _High = _Val >> 32;\r\n const auto _Low = static_cast(_Val);\r\n if (_High == 0) {\r\n return 32 + _Countl_zero_lzcnt(_Low);\r\n } else {\r\n return _Countl_zero_lzcnt(_High);\r\n }\r\n#else // ^^^ defined(_M_IX86) / !defined(_M_IX86) vvv\r\n return static_cast(__lzcnt64(_Val));\r\n#endif // ^^^ !defined(_M_IX86) ^^^\r\n }\r\n}\r\n\r\ntemplate \r\n_NODISCARD int _Countl_zero_bsr(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n\r\n unsigned long _Result;\r\n if constexpr (_Digits <= 32) {\r\n if (!_BitScanReverse(&_Result, _Val)) {\r\n return _Digits;\r\n }\r\n } else {\r\n#ifdef _M_IX86\r\n const unsigned int _High = _Val >> 32;\r\n if (_BitScanReverse(&_Result, _High)) {\r\n return static_cast(31 - _Result);\r\n }\r\n\r\n const auto _Low = static_cast(_Val);\r\n if (!_BitScanReverse(&_Result, _Low)) {\r\n return _Digits;\r\n }\r\n#else // ^^^ defined(_M_IX86) / !defined(_M_IX86) vvv\r\n if (!_BitScanReverse64(&_Result, _Val)) {\r\n return _Digits;\r\n }\r\n#endif // ^^^ !defined(_M_IX86) ^^^\r\n }\r\n return static_cast(_Digits - 1 - _Result);\r\n}\r\n\r\ntemplate \r\n_NODISCARD int _Checked_x86_x64_countl_zero(const _Ty _Val) noexcept {\r\n#ifndef __AVX2__\r\n const bool _Definitely_have_lzcnt = __isa_available >= _Stl_isa_available_avx2;\r\n if (!_Definitely_have_lzcnt) {\r\n return _Countl_zero_bsr(_Val);\r\n }\r\n#endif // ^^^ !defined(__AVX2__) ^^^\r\n return _Countl_zero_lzcnt(_Val);\r\n}\r\n#endif // (defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)) || (defined(_M_X64) && !defined(_M_ARM64EC))\r\n\r\n#if defined(_M_ARM64) || defined(_M_ARM64EC) || defined(_M_HYBRID_X86_ARM64)\r\ntemplate \r\n_NODISCARD int _Checked_arm64_countl_zero(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n if (_Val == 0) {\r\n return _Digits;\r\n }\r\n\r\n if constexpr (_Digits <= 32) {\r\n return static_cast(_CountLeadingZeros(_Val)) - (_Unsigned_integer_digits - _Digits);\r\n } else {\r\n return static_cast(_CountLeadingZeros64(_Val));\r\n }\r\n}\r\n#endif // defined(_M_ARM64) || defined(_M_ARM64EC) || defined(_M_HYBRID_X86_ARM64)\r\n#endif // _HAS_COUNTL_ZERO_INTRINSICS\r\n\r\n// Implementation of countr_zero without using specialized CPU instructions.\r\n// Used at compile time and when said instructions are not supported.\r\n// see \"Hacker's Delight\" section 5-4\r\ntemplate \r\n_NODISCARD constexpr int _Countr_zero_fallback(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n return _Digits - _Countl_zero_fallback(static_cast<_Ty>(static_cast<_Ty>(~_Val) & static_cast<_Ty>(_Val - 1)));\r\n}\r\n\r\n// Implementation of popcount without using specialized CPU instructions.\r\n// Used at compile time and when said instructions are not supported.\r\ntemplate \r\n_NODISCARD constexpr int _Popcount_fallback(_Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n#if defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)\r\n if constexpr (_Digits == 64) {\r\n // 64-bit bit operations on architectures without 64-bit registers are less efficient,\r\n // hence we split the value so that it fits in 32-bit registers\r\n return _Popcount_fallback(static_cast(_Val))\r\n + _Popcount_fallback(static_cast(_Val >> 32));\r\n } else\r\n#endif // defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)\r\n {\r\n // we static_cast these bit patterns in order to truncate them to the correct size\r\n _Val = static_cast<_Ty>(_Val - ((_Val >> 1) & static_cast<_Ty>(0x5555'5555'5555'5555ull)));\r\n _Val = static_cast<_Ty>((_Val & static_cast<_Ty>(0x3333'3333'3333'3333ull))\r\n + ((_Val >> 2) & static_cast<_Ty>(0x3333'3333'3333'3333ull)));\r\n _Val = static_cast<_Ty>((_Val + (_Val >> 4)) & static_cast<_Ty>(0x0F0F'0F0F'0F0F'0F0Full));\r\n // Multiply by one in each byte, so that it will have the sum of all source bytes in the highest byte\r\n _Val = static_cast<_Ty>(_Val * static_cast<_Ty>(0x0101'0101'0101'0101ull));\r\n // Extract highest byte\r\n return static_cast(_Val >> (_Digits - 8));\r\n }\r\n}\r\n\r\n#if ((defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)) || (defined(_M_X64) && !defined(_M_ARM64EC))) \\\r\n && !defined(_M_CEE_PURE)\r\n#define _HAS_TZCNT_BSF_INTRINSICS 1\r\n#else // ^^^ intrinsics available / intrinsics unavailable vvv\r\n#define _HAS_TZCNT_BSF_INTRINSICS 0\r\n#endif // ^^^ intrinsics unavailable ^^^\r\n\r\n#if _HAS_TZCNT_BSF_INTRINSICS\r\n#ifdef __clang__\r\n#define _TZCNT_U32 __builtin_ia32_tzcnt_u32\r\n#define _TZCNT_U64 __builtin_ia32_tzcnt_u64\r\n#else // ^^^ __clang__ / !__clang__ vvv\r\n#define _TZCNT_U32 _tzcnt_u32\r\n#define _TZCNT_U64 _tzcnt_u64\r\n#endif // __clang__\r\n\r\ntemplate \r\n_NODISCARD int _Countr_zero_tzcnt(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n constexpr _Ty _Max = static_cast<_Ty>(-1); // equal to (numeric_limits<_Ty>::max)()\r\n\r\n if constexpr (_Digits <= 32) {\r\n // Intended widening to int. This operation means that a narrow 0 will widen\r\n // to 0xFFFF....FFFF0... instead of 0. We need this to avoid counting all the zeros\r\n // of the wider type.\r\n return static_cast(_TZCNT_U32(static_cast(~_Max | _Val)));\r\n } else {\r\n#ifdef _M_IX86\r\n const auto _Low = static_cast(_Val);\r\n if (_Low == 0) {\r\n const unsigned int _High = _Val >> 32;\r\n return static_cast(32 + _TZCNT_U32(_High));\r\n } else {\r\n return static_cast(_TZCNT_U32(_Low));\r\n }\r\n#else // ^^^ defined(_M_IX86) / !defined(_M_IX86) vvv\r\n return static_cast(_TZCNT_U64(_Val));\r\n#endif // ^^^ !defined(_M_IX86) ^^^\r\n }\r\n}\r\n\r\n#undef _TZCNT_U32\r\n#undef _TZCNT_U64\r\n\r\ntemplate \r\n_NODISCARD int _Countr_zero_bsf(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n constexpr _Ty _Max = static_cast<_Ty>(-1); // equal to (numeric_limits<_Ty>::max)()\r\n\r\n unsigned long _Result;\r\n if constexpr (_Digits <= 32) {\r\n // Intended widening to int. This operation means that a narrow 0 will widen\r\n // to 0xFFFF....FFFF0... instead of 0. We need this to avoid counting all the zeros\r\n // of the wider type.\r\n if (!_BitScanForward(&_Result, static_cast(~_Max | _Val))) {\r\n return _Digits;\r\n }\r\n } else {\r\n#ifdef _M_IX86\r\n const auto _Low = static_cast(_Val);\r\n if (_BitScanForward(&_Result, _Low)) {\r\n return static_cast(_Result);\r\n }\r\n\r\n const unsigned int _High = _Val >> 32;\r\n if (!_BitScanForward(&_Result, _High)) {\r\n return _Digits;\r\n } else {\r\n return static_cast(_Result + 32);\r\n }\r\n#else // ^^^ defined(_M_IX86) / !defined(_M_IX86) vvv\r\n if (!_BitScanForward64(&_Result, _Val)) {\r\n return _Digits;\r\n }\r\n#endif // ^^^ !defined(_M_IX86) ^^^\r\n }\r\n return static_cast(_Result);\r\n}\r\n\r\ntemplate \r\n_NODISCARD int _Checked_x86_x64_countr_zero(const _Ty _Val) noexcept {\r\n#ifndef __AVX2__\r\n const bool _Definitely_have_tzcnt = __isa_available >= _Stl_isa_available_avx2;\r\n if (!_Definitely_have_tzcnt) {\r\n return _Countr_zero_bsf(_Val);\r\n }\r\n#endif // ^^^ !defined(__AVX2__) ^^^\r\n return _Countr_zero_tzcnt(_Val);\r\n}\r\n\r\n#endif // _HAS_TZCNT_BSF_INTRINSICS\r\n\r\n#if !defined(_M_CEE_PURE)\r\n#define _HAS_POPCNT_INTRINSICS 1\r\n#if defined(__AVX__) || defined(_M_ARM64) || defined(_M_ARM64EC)\r\n#define _POPCNT_INTRINSICS_ALWAYS_AVAILABLE 1\r\n#else // ^^^ intrinsics always available / intrinsics not always available vvv\r\n#define _POPCNT_INTRINSICS_ALWAYS_AVAILABLE 0\r\n#endif // ^^^ intrinsics not always available ^^^\r\n#else // ^^^ intrinsics available / intrinsics unavailable vvv\r\n#define _HAS_POPCNT_INTRINSICS 0\r\n#define _POPCNT_INTRINSICS_ALWAYS_AVAILABLE 0\r\n#endif // ^^^ intrinsics unavailable ^^^\r\n\r\n#if _HAS_POPCNT_INTRINSICS\r\ntemplate \r\n_NODISCARD int _Unchecked_popcount(const _Ty _Val) noexcept {\r\n constexpr int _Digits = _Unsigned_integer_digits<_Ty>;\r\n if constexpr (_Digits <= 16) {\r\n return static_cast(__popcnt16(_Val));\r\n } else if constexpr (_Digits == 32) {\r\n return static_cast(__popcnt(_Val));\r\n } else {\r\n#ifdef _M_IX86\r\n return static_cast(__popcnt(_Val >> 32) + __popcnt(static_cast(_Val)));\r\n#else // ^^^ defined(_M_IX86) / !defined(_M_IX86) vvv\r\n return static_cast(__popcnt64(_Val));\r\n#endif // ^^^ !defined(_M_IX86) ^^^\r\n }\r\n}\r\n\r\ntemplate \r\n_NODISCARD int _Checked_popcount(const _Ty _Val) noexcept {\r\n#if !_POPCNT_INTRINSICS_ALWAYS_AVAILABLE\r\n const bool _Definitely_have_popcnt = __isa_available >= _Stl_isa_available_sse42;\r\n if (!_Definitely_have_popcnt) {\r\n return _Popcount_fallback(_Val);\r\n }\r\n#endif // ^^^ !_POPCNT_INTRINSICS_ALWAYS_AVAILABLE ^^^\r\n return _Unchecked_popcount(_Val);\r\n}\r\n#endif // ^^^ _HAS_POPCNT_INTRINSICS ^^^\r\n\r\ntemplate \r\nconstexpr bool _Is_standard_unsigned_integer =\r\n _Is_any_of_v<_Ty, unsigned char, unsigned short, unsigned int, unsigned long, unsigned long long>;\r\n\r\ntemplate , int> = 0>\r\n_NODISCARD _CONSTEXPR20 int _Countr_zero(const _Ty _Val) noexcept {\r\n#if _HAS_TZCNT_BSF_INTRINSICS\r\n#if _HAS_CXX20\r\n if (!_STD is_constant_evaluated())\r\n#endif // _HAS_CXX20\r\n {\r\n return _Checked_x86_x64_countr_zero(_Val);\r\n }\r\n#endif // _HAS_TZCNT_BSF_INTRINSICS\r\n return _Countr_zero_fallback(_Val);\r\n}\r\n\r\ntemplate \r\nconstexpr decltype(auto) _Select_countr_zero_impl(_Fn _Callback) {\r\n // TRANSITION, DevCom-1527995: Lambdas in this function ensure inlining\r\n#if _HAS_TZCNT_BSF_INTRINSICS && _HAS_CXX20\r\n if (!_STD is_constant_evaluated()) {\r\n#ifndef __AVX2__\r\n const bool _Definitely_have_tzcnt = __isa_available >= _Stl_isa_available_avx2;\r\n if (!_Definitely_have_tzcnt) {\r\n return _Callback([](_Ty _Val) static { return _Countr_zero_bsf(_Val); });\r\n }\r\n#endif // ^^^ !defined(__AVX2__) ^^^\r\n return _Callback([](_Ty _Val) static { return _Countr_zero_tzcnt(_Val); });\r\n }\r\n#endif // ^^^ _HAS_TZCNT_BSF_INTRINSICS && _HAS_CXX20 ^^^\r\n // C++17 constexpr gcd() calls this function, so it should be constexpr unless we detect runtime evaluation.\r\n return _Callback([](_Ty _Val) static { return _Countr_zero_fallback(_Val); });\r\n}\r\n\r\ntemplate \r\n_NODISCARD constexpr int _Countl_zero(const _Ty _Val) noexcept {\r\n _STL_INTERNAL_STATIC_ASSERT(_Is_standard_unsigned_integer<_Ty>);\r\n#if _HAS_COUNTL_ZERO_INTRINSICS\r\n#if (defined(_M_IX86) && !defined(_M_HYBRID_X86_ARM64)) || (defined(_M_X64) && !defined(_M_ARM64EC))\r\n if (!_Is_constant_evaluated()) {\r\n return _Checked_x86_x64_countl_zero(_Val);\r\n }\r\n#elif defined(_M_ARM64) || defined(_M_ARM64EC) || defined(_M_HYBRID_X86_ARM64)\r\n if (!_Is_constant_evaluated()) {\r\n return _Checked_arm64_countl_zero(_Val);\r\n }\r\n#endif // defined(_M_ARM64) || defined(_M_ARM64EC) || defined(_M_HYBRID_X86_ARM64)\r\n#endif // _HAS_COUNTL_ZERO_INTRINSICS\r\n\r\n return _Countl_zero_fallback(_Val);\r\n}\r\n\r\ntemplate , int> = 0>\r\n_NODISCARD _CONSTEXPR20 int _Popcount(const _Ty _Val) noexcept {\r\n#if _HAS_POPCNT_INTRINSICS\r\n#if _HAS_CXX20\r\n if (!_STD is_constant_evaluated())\r\n#endif // _HAS_CXX20\r\n {\r\n return _Checked_popcount(_Val);\r\n }\r\n#endif // ^^^ _HAS_POPCNT_INTRINSICS ^^^\r\n return _Popcount_fallback(_Val);\r\n}\r\n\r\ntemplate \r\n_CONSTEXPR20 decltype(auto) _Select_popcount_impl(_Fn _Callback) {\r\n // TRANSITION, DevCom-1527995: Lambdas in this function ensure inlining\r\n#if _HAS_POPCNT_INTRINSICS\r\n#if _HAS_CXX20\r\n if (!_STD is_constant_evaluated())\r\n#endif // _HAS_CXX20\r\n {\r\n#if !_POPCNT_INTRINSICS_ALWAYS_AVAILABLE\r\n const bool _Definitely_have_popcnt = __isa_available >= _Stl_isa_available_sse42;\r\n if (!_Definitely_have_popcnt) {\r\n return _Callback([](_Ty _Val) static { return _Popcount_fallback(_Val); });\r\n }\r\n#endif // ^^^ !_POPCNT_INTRINSICS_ALWAYS_AVAILABLE ^^^\r\n return _Callback([](_Ty _Val) static { return _Unchecked_popcount(_Val); });\r\n }\r\n#endif // ^^^ _HAS_POPCNT_INTRINSICS ^^^\r\n return _Callback([](_Ty _Val) static { return _Popcount_fallback(_Val); });\r\n}\r\n\r\n#undef _HAS_TZCNT_BSF_INTRINSICS\r\n\r\n_STD_END\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_BIT_UTILS_HPP\r\n" }, { "path": "stl/inc/__msvc_chrono.hpp", "content": "// __msvc_chrono.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_CHRONO_HPP\r\n#define __MSVC_CHRONO_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#if _HAS_CXX20\r\n#include \r\n#endif\r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n// TRANSITION, non-_Ugly attribute tokens\r\n#pragma push_macro(\"msvc\")\r\n#pragma push_macro(\"no_specializations\")\r\n#undef msvc\r\n#undef no_specializations\r\n\r\n_STD_BEGIN\r\nnamespace chrono {\r\n _EXPORT_STD template \r\n struct treat_as_floating_point : is_floating_point<_Rep> {}; // tests for floating-point type\r\n\r\n _EXPORT_STD template \r\n _NO_SPECIALIZATIONS_OF_VARIABLE_TEMPLATES constexpr bool treat_as_floating_point_v =\r\n treat_as_floating_point<_Rep>::value;\r\n\r\n _EXPORT_STD template \r\n struct duration_values { // gets arithmetic properties of a type\r\n _NODISCARD static constexpr _Rep zero() noexcept {\r\n // get zero value\r\n return _Rep(0);\r\n }\r\n\r\n _NODISCARD static constexpr _Rep(min)() noexcept {\r\n // get smallest value\r\n return numeric_limits<_Rep>::lowest();\r\n }\r\n\r\n _NODISCARD static constexpr _Rep(max)() noexcept {\r\n // get largest value\r\n return (numeric_limits<_Rep>::max)();\r\n }\r\n };\r\n\r\n _EXPORT_STD template >\r\n class duration;\r\n\r\n _EXPORT_STD template \r\n class time_point;\r\n\r\n#if _HAS_CXX20\r\n _EXPORT_STD template \r\n _NO_SPECIALIZATIONS_OF_VARIABLE_TEMPLATES constexpr bool is_clock_v = requires {\r\n // Basic checks from N5014 [time.traits.is.clock]/1\r\n typename _Clock::rep;\r\n typename _Clock::period;\r\n typename _Clock::duration;\r\n typename _Clock::time_point;\r\n _Clock::is_steady;\r\n _Clock::now();\r\n\r\n // Additional stricter checks from N5014 [time.clock.req]/2\r\n // \"An arithmetic type or a class emulating an arithmetic type\" is not checked\r\n requires _Is_ratio_v;\r\n requires same_as>;\r\n requires same_as>\r\n || same_as>;\r\n { _Clock::is_steady } -> std::same_as;\r\n { _Clock::now() } -> std::same_as;\r\n };\r\n _EXPORT_STD template \r\n struct _NO_SPECIALIZATIONS_CITING(\"N5014 [time.traits.is.clock]/2\") is_clock : bool_constant> {};\r\n\r\n template \r\n constexpr bool _Is_clock_v = is_clock_v<_Clock>;\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\n template \r\n constexpr bool _Is_clock_v = false;\r\n\r\n template \r\n constexpr bool\r\n _Is_clock_v<_Clock, void_t> =\r\n true;\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n template \r\n constexpr bool _Is_duration_v = _Is_specialization_v<_Ty, duration>;\r\n\r\n _EXPORT_STD template , int> = 0>\r\n constexpr _To duration_cast(const duration<_Rep, _Period>&)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v); // strengthened\r\n\r\n _EXPORT_STD template \r\n class duration { // represents a time duration\r\n public:\r\n using rep = _Rep;\r\n using period = typename _Period::type;\r\n\r\n static_assert(!_Is_duration_v<_Rep>, \"duration can't have duration as first template argument\");\r\n static_assert(_Is_ratio_v<_Period>, \"period not an instance of std::ratio\");\r\n static_assert(0 < _Period::num, \"period negative or zero\");\r\n\r\n constexpr duration() = default;\r\n\r\n template \r\n && (treat_as_floating_point_v<_Rep> || !treat_as_floating_point_v<_Rep2>),\r\n int> = 0>\r\n constexpr explicit duration(const _Rep2& _Val)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v<_Rep2>) // strengthened\r\n : _MyRep(static_cast<_Rep>(_Val)) {}\r\n\r\n template \r\n && (treat_as_floating_point_v<_Rep>\r\n || (_Ratio_divide_sfinae<_Period2, _Period>::den == 1\r\n && !treat_as_floating_point_v<_Rep2>) ),\r\n int> = 0>\r\n constexpr duration(const duration<_Rep2, _Period2>& _Dur)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v<_Rep2>) // strengthened\r\n : _MyRep(_CHRONO duration_cast(_Dur).count()) {}\r\n\r\n _NODISCARD constexpr _Rep count() const noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n return _MyRep;\r\n }\r\n\r\n _NODISCARD constexpr common_type_t operator+() const\r\n noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n return common_type_t(*this);\r\n }\r\n\r\n _NODISCARD constexpr common_type_t operator-() const\r\n noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n return common_type_t(-_MyRep);\r\n }\r\n\r\n _CONSTEXPR17 duration& operator++() noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n ++_MyRep;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration operator++(int) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n return duration(_MyRep++);\r\n }\r\n\r\n _CONSTEXPR17 duration& operator--() noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n --_MyRep;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration operator--(int) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n return duration(_MyRep--);\r\n }\r\n\r\n _CONSTEXPR17 duration& operator+=(const duration& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep += _Right._MyRep;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration& operator-=(const duration& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep -= _Right._MyRep;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration& operator*=(const _Rep& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep *= _Right;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration& operator/=(const _Rep& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep /= _Right;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration& operator%=(const _Rep& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep %= _Right;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 duration& operator%=(const duration& _Right) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n _MyRep %= _Right.count();\r\n return *this;\r\n }\r\n\r\n _NODISCARD static constexpr duration zero() noexcept {\r\n // get zero value\r\n return duration(duration_values<_Rep>::zero());\r\n }\r\n\r\n _NODISCARD static constexpr duration(min)() noexcept {\r\n // get minimum value\r\n return duration((duration_values<_Rep>::min)());\r\n }\r\n\r\n _NODISCARD static constexpr duration(max)() noexcept {\r\n // get maximum value\r\n return duration((duration_values<_Rep>::max)());\r\n }\r\n\r\n private:\r\n _Rep _MyRep; // the stored rep\r\n };\r\n\r\n _EXPORT_STD template \r\n class time_point { // represents a point in time\r\n public:\r\n using clock = _Clock;\r\n using duration = _Duration;\r\n using rep = typename _Duration::rep;\r\n using period = typename _Duration::period;\r\n\r\n static_assert(_Is_duration_v<_Duration>,\r\n \"N4950 [time.point.general]/1 mandates Duration to be a specialization of chrono::duration.\");\r\n\r\n constexpr time_point() = default;\r\n\r\n constexpr explicit time_point(const _Duration& _Other) noexcept(is_arithmetic_v) // strengthened\r\n : _MyDur(_Other) {}\r\n\r\n template , int> = 0>\r\n constexpr time_point(const time_point<_Clock, _Duration2>& _Tp)\r\n noexcept(is_arithmetic_v && is_arithmetic_v) // strengthened\r\n : _MyDur(_Tp.time_since_epoch()) {}\r\n\r\n _NODISCARD constexpr _Duration time_since_epoch() const noexcept(is_arithmetic_v) /* strengthened */ {\r\n return _MyDur;\r\n }\r\n\r\n#if _HAS_CXX20\r\n constexpr time_point& operator++() noexcept(is_arithmetic_v) /* strengthened */ {\r\n ++_MyDur;\r\n return *this;\r\n }\r\n constexpr time_point operator++(int) noexcept(is_arithmetic_v) /* strengthened */ {\r\n return time_point{_MyDur++};\r\n }\r\n constexpr time_point& operator--() noexcept(is_arithmetic_v) /* strengthened */ {\r\n --_MyDur;\r\n return *this;\r\n }\r\n constexpr time_point operator--(int) noexcept(is_arithmetic_v) /* strengthened */ {\r\n return time_point{_MyDur--};\r\n }\r\n#endif // _HAS_CXX20\r\n\r\n _CONSTEXPR17 time_point& operator+=(const _Duration& _Dur) noexcept(is_arithmetic_v) /* strengthened */ {\r\n _MyDur += _Dur;\r\n return *this;\r\n }\r\n\r\n _CONSTEXPR17 time_point& operator-=(const _Duration& _Dur) noexcept(is_arithmetic_v) /* strengthened */ {\r\n _MyDur -= _Dur;\r\n return *this;\r\n }\r\n\r\n _NODISCARD static constexpr time_point(min)() noexcept {\r\n return time_point((_Duration::min) ());\r\n }\r\n\r\n _NODISCARD static constexpr time_point(max)() noexcept {\r\n return time_point((_Duration::max) ());\r\n }\r\n\r\n private:\r\n _Duration _MyDur{duration::zero()}; // duration since the epoch\r\n };\r\n} // namespace chrono\r\n\r\ntemplate \r\nconstexpr bool _Is_trivially_swappable_v> = _Is_trivially_swappable_v<_Rep>;\r\n\r\ntemplate \r\nconstexpr bool _Is_trivially_swappable_v> = _Is_trivially_swappable_v<_Duration>;\r\n\r\n_NODISCARD constexpr intmax_t _Lcm(const intmax_t _Ax, const intmax_t _Bx) noexcept {\r\n return (_Ax / _Gcd(_Ax, _Bx)) * _Bx;\r\n}\r\n\r\ntemplate \r\nstruct common_type<_CHRONO duration<_Rep1, _Period1>, _CHRONO duration<_Rep2, _Period2>> {\r\n using type = _CHRONO duration,\r\n ratio<_Gcd(_Period1::num, _Period2::num), _Lcm(_Period1::den, _Period2::den)>>;\r\n};\r\n\r\ntemplate \r\nstruct common_type<_CHRONO time_point<_Clock, _Duration1>,\r\n _CHRONO time_point<_Clock, _Duration2>> { // common type of two time points\r\n using type = _CHRONO time_point<_Clock, common_type_t<_Duration1, _Duration2>>;\r\n};\r\n\r\nnamespace chrono {\r\n _EXPORT_STD template \r\n _NODISCARD constexpr common_type_t, duration<_Rep2, _Period2>> operator+(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CD = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CD(_CD(_Left).count() + _CD(_Right).count());\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr common_type_t, duration<_Rep2, _Period2>> operator-(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CD = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CD(_CD(_Left).count() - _CD(_Right).count());\r\n }\r\n\r\n _EXPORT_STD template >, int> = 0>\r\n _NODISCARD constexpr duration, _Period1> operator*(\r\n const duration<_Rep1, _Period1>& _Left, const _Rep2& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CR = common_type_t<_Rep1, _Rep2>;\r\n using _CD = duration<_CR, _Period1>;\r\n return _CD(_CD(_Left).count() * _Right);\r\n }\r\n\r\n _EXPORT_STD template >, int> = 0>\r\n _NODISCARD constexpr duration, _Period2> operator*(\r\n const _Rep1& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n return _Right * _Left;\r\n }\r\n\r\n template >\r\n struct _Duration_div_mod1 { // return type for duration / rep and duration % rep\r\n using type = duration<_CR, _Period1>;\r\n };\r\n\r\n template \r\n struct _Duration_div_mod1<_CR, _Period1, _Rep2, false> {}; // no return type\r\n\r\n template >\r\n struct _Duration_div_mod {}; // no return type\r\n\r\n template \r\n struct _Duration_div_mod<_CR, _Period1, _Rep2, false> : _Duration_div_mod1<_CR, _Period1, _Rep2> {\r\n // return type for duration / rep and duration % rep\r\n };\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr typename _Duration_div_mod, _Period1, _Rep2>::type operator/(\r\n const duration<_Rep1, _Period1>& _Left, const _Rep2& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CR = common_type_t<_Rep1, _Rep2>;\r\n using _CD = duration<_CR, _Period1>;\r\n return _CD(_CD(_Left).count() / _Right);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr common_type_t<_Rep1, _Rep2> operator/(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CD = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CD(_Left).count() / _CD(_Right).count();\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr typename _Duration_div_mod, _Period1, _Rep2>::type operator%(\r\n const duration<_Rep1, _Period1>& _Left, const _Rep2& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CR = common_type_t<_Rep1, _Rep2>;\r\n using _CD = duration<_CR, _Period1>;\r\n return _CD(_CD(_Left).count() % _Right);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr common_type_t, duration<_Rep2, _Period2>> operator%(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CD = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CD(_CD(_Left).count() % _CD(_Right).count());\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator==(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CT = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CT(_Left).count() == _CT(_Right).count();\r\n }\r\n\r\n#if !_HAS_CXX20\r\n template \r\n _NODISCARD constexpr bool operator!=(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n return !(_Left == _Right);\r\n }\r\n#endif // !_HAS_CXX20\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator<(const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CT = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CT(_Left).count() < _CT(_Right).count();\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator<=(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n return !(_Right < _Left);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator>(const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n return _Right < _Left;\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator>=(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n return !(_Left < _Right);\r\n }\r\n\r\n#if _HAS_CXX20\r\n _EXPORT_STD template \r\n requires three_way_comparable, duration<_Rep2, _Period2>>::rep>\r\n _NODISCARD constexpr auto operator<=>(\r\n const duration<_Rep1, _Period1>& _Left, const duration<_Rep2, _Period2>& _Right)\r\n noexcept(is_arithmetic_v<_Rep1> && is_arithmetic_v<_Rep2>) /* strengthened */ {\r\n using _CT = common_type_t, duration<_Rep2, _Period2>>;\r\n return _CT(_Left).count() <=> _CT(_Right).count();\r\n }\r\n#endif // _HAS_CXX20\r\n\r\n _EXPORT_STD template , int> /* = 0 */>\r\n _NODISCARD constexpr _To duration_cast(const duration<_Rep, _Period>& _Dur)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v) /* strengthened */ {\r\n // convert duration to another duration; truncate\r\n using _CF = ratio_divide<_Period, typename _To::period>;\r\n\r\n using _ToRep = typename _To::rep;\r\n using _CR = common_type_t<_ToRep, _Rep, intmax_t>;\r\n\r\n constexpr bool _Num_is_one = _CF::num == 1;\r\n constexpr bool _Den_is_one = _CF::den == 1;\r\n\r\n if constexpr (_Den_is_one) {\r\n if constexpr (_Num_is_one) {\r\n return static_cast<_To>(static_cast<_ToRep>(_Dur.count()));\r\n } else {\r\n return static_cast<_To>(\r\n static_cast<_ToRep>(static_cast<_CR>(_Dur.count()) * static_cast<_CR>(_CF::num)));\r\n }\r\n } else {\r\n if constexpr (_Num_is_one) {\r\n return static_cast<_To>(\r\n static_cast<_ToRep>(static_cast<_CR>(_Dur.count()) / static_cast<_CR>(_CF::den)));\r\n } else {\r\n return static_cast<_To>(static_cast<_ToRep>(\r\n static_cast<_CR>(_Dur.count()) * static_cast<_CR>(_CF::num) / static_cast<_CR>(_CF::den)));\r\n }\r\n }\r\n }\r\n\r\n _EXPORT_STD template , int> = 0>\r\n _NODISCARD constexpr _To floor(const duration<_Rep, _Period>& _Dur)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v) /* strengthened */ {\r\n // convert duration to another duration; round towards negative infinity\r\n // i.e. the greatest integral result such that the result <= _Dur\r\n const _To _Casted{_CHRONO duration_cast<_To>(_Dur)};\r\n if (_Casted > _Dur) {\r\n return _To{_Casted.count() - static_cast(1)};\r\n }\r\n\r\n return _Casted;\r\n }\r\n\r\n _EXPORT_STD template , int> = 0>\r\n _NODISCARD constexpr _To ceil(const duration<_Rep, _Period>& _Dur)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v) /* strengthened */ {\r\n // convert duration to another duration; round towards positive infinity\r\n // i.e. the least integral result such that _Dur <= the result\r\n const _To _Casted{_CHRONO duration_cast<_To>(_Dur)};\r\n if (_Casted < _Dur) {\r\n return _To{_Casted.count() + static_cast(1)};\r\n }\r\n\r\n return _Casted;\r\n }\r\n\r\n template \r\n constexpr bool _Is_even(_Rep _Val) noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n // Tests whether _Val is even\r\n return _Val % 2 == 0;\r\n }\r\n\r\n _EXPORT_STD template && !treat_as_floating_point_v, int> = 0>\r\n _NODISCARD constexpr _To round(const duration<_Rep, _Period>& _Dur)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v) /* strengthened */ {\r\n // convert duration to another duration, round to nearest, ties to even\r\n const _To _Floored{_CHRONO floor<_To>(_Dur)};\r\n const _To _Ceiled{_Floored + _To{1}};\r\n const auto _Floor_adjustment = _Dur - _Floored;\r\n const auto _Ceil_adjustment = _Ceiled - _Dur;\r\n if (_Floor_adjustment < _Ceil_adjustment\r\n || (_Floor_adjustment == _Ceil_adjustment && _Is_even(_Floored.count()))) {\r\n return _Floored;\r\n }\r\n\r\n return _Ceiled;\r\n }\r\n\r\n _EXPORT_STD template ::is_signed, int> = 0>\r\n _NODISCARD constexpr duration<_Rep, _Period> abs(const duration<_Rep, _Period> _Dur)\r\n noexcept(is_arithmetic_v<_Rep>) /* strengthened */ {\r\n // create a duration whose count() is the absolute value of _Dur.count()\r\n if (_Dur < duration<_Rep, _Period>::zero()) {\r\n return -_Dur;\r\n } else {\r\n return _Dur;\r\n }\r\n }\r\n\r\n _EXPORT_STD using nanoseconds = duration;\r\n _EXPORT_STD using microseconds = duration;\r\n _EXPORT_STD using milliseconds = duration;\r\n _EXPORT_STD using seconds = duration;\r\n _EXPORT_STD using minutes = duration>;\r\n _EXPORT_STD using hours = duration>;\r\n#if _HAS_CXX20\r\n _EXPORT_STD using days = duration, hours::period>>;\r\n _EXPORT_STD using weeks = duration, days::period>>;\r\n _EXPORT_STD using years = duration, days::period>>;\r\n _EXPORT_STD using months = duration>>;\r\n#endif // _HAS_CXX20\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr time_point<_Clock, common_type_t<_Duration, duration<_Rep, _Period>>> operator+(\r\n const time_point<_Clock, _Duration>& _Left, const duration<_Rep, _Period>& _Right)\r\n noexcept(is_arithmetic_v && is_arithmetic_v<_Rep>) /* strengthened */ {\r\n using _RT = time_point<_Clock, common_type_t<_Duration, duration<_Rep, _Period>>>;\r\n return _RT(_Left.time_since_epoch() + _Right);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr time_point<_Clock, common_type_t, _Duration>> operator+(\r\n const duration<_Rep, _Period>& _Left, const time_point<_Clock, _Duration>& _Right)\r\n noexcept(is_arithmetic_v<_Rep> && is_arithmetic_v) /* strengthened */ {\r\n return _Right + _Left;\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr time_point<_Clock, common_type_t<_Duration, duration<_Rep, _Period>>> operator-(\r\n const time_point<_Clock, _Duration>& _Left, const duration<_Rep, _Period>& _Right)\r\n noexcept(is_arithmetic_v && is_arithmetic_v<_Rep>) /* strengthened */ {\r\n using _RT = time_point<_Clock, common_type_t<_Duration, duration<_Rep, _Period>>>;\r\n return _RT(_Left.time_since_epoch() - _Right);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr common_type_t<_Duration1, _Duration2> operator-(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return _Left.time_since_epoch() - _Right.time_since_epoch();\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator==(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return _Left.time_since_epoch() == _Right.time_since_epoch();\r\n }\r\n\r\n#if !_HAS_CXX20\r\n template \r\n _NODISCARD constexpr bool operator!=(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return !(_Left == _Right);\r\n }\r\n#endif // !_HAS_CXX20\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator<(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return _Left.time_since_epoch() < _Right.time_since_epoch();\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator<=(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return !(_Right < _Left);\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator>(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return _Right < _Left;\r\n }\r\n\r\n _EXPORT_STD template \r\n _NODISCARD constexpr bool operator>=(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return !(_Left < _Right);\r\n }\r\n\r\n#if _HAS_CXX20\r\n _EXPORT_STD template _Duration2>\r\n _NODISCARD constexpr auto operator<=>(\r\n const time_point<_Clock, _Duration1>& _Left, const time_point<_Clock, _Duration2>& _Right)\r\n noexcept(\r\n is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n return _Left.time_since_epoch() <=> _Right.time_since_epoch();\r\n }\r\n#endif // _HAS_CXX20\r\n\r\n _EXPORT_STD template , int> = 0>\r\n _NODISCARD constexpr time_point<_Clock, _To> time_point_cast(const time_point<_Clock, _Duration>& _Time)\r\n noexcept(is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n // change the duration type of a time_point; truncate\r\n return time_point<_Clock, _To>(_CHRONO duration_cast<_To>(_Time.time_since_epoch()));\r\n }\r\n\r\n _EXPORT_STD template , int> = 0>\r\n _NODISCARD constexpr time_point<_Clock, _To> floor(const time_point<_Clock, _Duration>& _Time)\r\n noexcept(is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n // change the duration type of a time_point; round towards negative infinity\r\n return time_point<_Clock, _To>(_CHRONO floor<_To>(_Time.time_since_epoch()));\r\n }\r\n\r\n _EXPORT_STD template , int> = 0>\r\n _NODISCARD constexpr time_point<_Clock, _To> ceil(const time_point<_Clock, _Duration>& _Time)\r\n noexcept(is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n // change the duration type of a time_point; round towards positive infinity\r\n return time_point<_Clock, _To>(_CHRONO ceil<_To>(_Time.time_since_epoch()));\r\n }\r\n\r\n _EXPORT_STD template && !treat_as_floating_point_v, int> = 0>\r\n _NODISCARD constexpr time_point<_Clock, _To> round(const time_point<_Clock, _Duration>& _Time)\r\n noexcept(is_arithmetic_v && is_arithmetic_v) /* strengthened */ {\r\n // change the duration type of a time_point; round to nearest, ties to even\r\n return time_point<_Clock, _To>(_CHRONO round<_To>(_Time.time_since_epoch()));\r\n }\r\n\r\n _EXPORT_STD struct steady_clock { // wraps QueryPerformanceCounter\r\n using rep = long long;\r\n using period = nano;\r\n using duration = nanoseconds;\r\n using time_point = _CHRONO time_point;\r\n static constexpr bool is_steady = true;\r\n\r\n _NODISCARD static time_point now() noexcept { // get current time\r\n const long long _Freq = _Query_perf_frequency(); // doesn't change after system boot\r\n const long long _Ctr = _Query_perf_counter();\r\n _STL_INTERNAL_STATIC_ASSERT(period::num == 1);\r\n // The compiler recognizes the constants for frequency and time period and uses shifts and\r\n // multiplies instead of divides to calculate the nanosecond value.\r\n constexpr long long _TenMHz = 10'000'000;\r\n constexpr long long _TwentyFourMHz = 24'000'000;\r\n if (_Freq == _TenMHz) {\r\n // 10 MHz is a very common QPC frequency on modern x86/x64 PCs. Optimizing for\r\n // this specific frequency can double the performance of this function by\r\n // avoiding the expensive frequency conversion path.\r\n _STL_INTERNAL_STATIC_ASSERT(period::den % _TenMHz == 0);\r\n constexpr long long _Multiplier = period::den / _TenMHz;\r\n return time_point(duration(_Ctr * _Multiplier));\r\n } else if (_Freq == _TwentyFourMHz) {\r\n // 24 MHz is a common frequency on ARM64, including cases where it emulates x86/x64.\r\n constexpr long long _Multiplier_whole = period::den / _TwentyFourMHz;\r\n using _Multiplier_part = ratio;\r\n constexpr long long _Multiplier_num = _Multiplier_part::num;\r\n constexpr long long _Multiplier_den = _Multiplier_part::den;\r\n // This assumes that _Ctr * _Multiplier_num doesn't overflow.\r\n _STL_INTERNAL_STATIC_ASSERT(_Multiplier_num <= _Multiplier_whole);\r\n const long long _Whole = _Ctr * _Multiplier_whole;\r\n const long long _Part = _Ctr * _Multiplier_num / _Multiplier_den;\r\n return time_point(duration(_Whole + _Part));\r\n } else {\r\n // Instead of just having \"(_Ctr * period::den) / _Freq\",\r\n // the algorithm below prevents overflow when _Ctr is sufficiently large.\r\n // It assumes that _Freq * period::den does not overflow, which is currently true for nano period.\r\n // It is not realistic for _Ctr to accumulate to large values from zero with this assumption,\r\n // but the initial value of _Ctr could be large.\r\n const long long _Whole = (_Ctr / _Freq) * period::den;\r\n const long long _Part = (_Ctr % _Freq) * period::den / _Freq;\r\n return time_point(duration(_Whole + _Part));\r\n }\r\n }\r\n };\r\n} // namespace chrono\r\n_STD_END\r\n\r\n// TRANSITION, non-_Ugly attribute tokens\r\n#pragma pop_macro(\"no_specializations\")\r\n#pragma pop_macro(\"msvc\")\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_CHRONO_HPP\r\n" }, { "path": "stl/inc/__msvc_cxx_stdatomic.hpp", "content": "// __msvc_cxx_stdatomic.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_CXX_STDATOMIC_HPP\r\n#define __MSVC_CXX_STDATOMIC_HPP\r\n\r\n// see _STL_COMPILER_PREPROCESSOR in yvals_core.h\r\n#if !defined(RC_INVOKED) && !defined(Q_MOC_RUN) && !defined(__midl)\r\n\r\n// provide a specific error message for C compilers, before the general error message in yvals_core.h\r\n#ifndef __cplusplus\r\n#error <__msvc_cxx_stdatomic.hpp> is an internal header. It is incompatible with C and should not be directly included.\r\n#endif // !defined(__cplusplus)\r\n\r\n#include \r\n\r\n#ifdef _M_CEE_PURE\r\n#error is not supported when compiling with /clr:pure.\r\n#endif // defined(_M_CEE_PURE)\r\n\r\n#if !_HAS_CXX23\r\n_EMIT_STL_WARNING(STL4038, \"The contents of are available only with C++23 or later.\");\r\n#else // ^^^ !_HAS_CXX23 / _HAS_CXX23 vvv\r\n\r\n#include \r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\ntemplate \r\nusing _Std_atomic = _STD atomic<_Ty>;\r\n\r\n#define _Atomic(T) _Std_atomic\r\n\r\nusing _STD memory_order;\r\nusing _STD memory_order_relaxed;\r\nusing _STD memory_order_consume;\r\nusing _STD memory_order_acquire;\r\nusing _STD memory_order_release;\r\nusing _STD memory_order_acq_rel;\r\nusing _STD memory_order_seq_cst;\r\n\r\nusing _STD atomic_flag;\r\n\r\nusing _STD atomic_bool;\r\nusing _STD atomic_char;\r\nusing _STD atomic_schar;\r\nusing _STD atomic_uchar;\r\nusing _STD atomic_short;\r\nusing _STD atomic_ushort;\r\nusing _STD atomic_int;\r\nusing _STD atomic_uint;\r\nusing _STD atomic_long;\r\nusing _STD atomic_ulong;\r\nusing _STD atomic_llong;\r\nusing _STD atomic_ullong;\r\n\r\n#ifdef __cpp_lib_char8_t\r\nusing _STD atomic_char8_t;\r\n#endif // defined(__cpp_lib_char8_t)\r\n\r\nusing _STD atomic_char16_t;\r\nusing _STD atomic_char32_t;\r\nusing _STD atomic_wchar_t;\r\nusing _STD atomic_int8_t;\r\nusing _STD atomic_uint8_t;\r\nusing _STD atomic_int16_t;\r\nusing _STD atomic_uint16_t;\r\nusing _STD atomic_int32_t;\r\nusing _STD atomic_uint32_t;\r\nusing _STD atomic_int64_t;\r\nusing _STD atomic_uint64_t;\r\nusing _STD atomic_int_least8_t;\r\nusing _STD atomic_uint_least8_t;\r\nusing _STD atomic_int_least16_t;\r\nusing _STD atomic_uint_least16_t;\r\nusing _STD atomic_int_least32_t;\r\nusing _STD atomic_uint_least32_t;\r\nusing _STD atomic_int_least64_t;\r\nusing _STD atomic_uint_least64_t;\r\nusing _STD atomic_int_fast8_t;\r\nusing _STD atomic_uint_fast8_t;\r\nusing _STD atomic_int_fast16_t;\r\nusing _STD atomic_uint_fast16_t;\r\nusing _STD atomic_int_fast32_t;\r\nusing _STD atomic_uint_fast32_t;\r\nusing _STD atomic_int_fast64_t;\r\nusing _STD atomic_uint_fast64_t;\r\nusing _STD atomic_intptr_t;\r\nusing _STD atomic_uintptr_t;\r\nusing _STD atomic_size_t;\r\nusing _STD atomic_ptrdiff_t;\r\nusing _STD atomic_intmax_t;\r\nusing _STD atomic_uintmax_t;\r\n\r\nusing _STD atomic_is_lock_free;\r\nusing _STD atomic_load;\r\nusing _STD atomic_load_explicit;\r\nusing _STD atomic_store;\r\nusing _STD atomic_store_explicit;\r\nusing _STD atomic_exchange;\r\nusing _STD atomic_exchange_explicit;\r\nusing _STD atomic_compare_exchange_strong;\r\nusing _STD atomic_compare_exchange_strong_explicit;\r\nusing _STD atomic_compare_exchange_weak;\r\nusing _STD atomic_compare_exchange_weak_explicit;\r\nusing _STD atomic_fetch_add;\r\nusing _STD atomic_fetch_add_explicit;\r\nusing _STD atomic_fetch_sub;\r\nusing _STD atomic_fetch_sub_explicit;\r\nusing _STD atomic_fetch_or;\r\nusing _STD atomic_fetch_or_explicit;\r\nusing _STD atomic_fetch_xor;\r\nusing _STD atomic_fetch_xor_explicit;\r\nusing _STD atomic_fetch_and;\r\nusing _STD atomic_fetch_and_explicit;\r\nusing _STD atomic_flag_test_and_set;\r\nusing _STD atomic_flag_test_and_set_explicit;\r\nusing _STD atomic_flag_clear;\r\nusing _STD atomic_flag_clear_explicit;\r\n\r\nusing _STD atomic_thread_fence;\r\nusing _STD atomic_signal_fence;\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n#endif // ^^^ _HAS_CXX23 ^^^\r\n\r\n#endif // !defined(RC_INVOKED) && !defined(Q_MOC_RUN) && !defined(__midl)\r\n#endif // __MSVC_CXX_STDATOMIC_HPP\r\n" }, { "path": "stl/inc/__msvc_filebuf.hpp", "content": "// __msvc_filebuf.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_FILEBUF_HPP\r\n#define __MSVC_FILEBUF_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n\r\n#include \r\n#include \r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n// TRANSITION, ABI: The _Path_ish functions accepting filesystem::path are templates\r\n// which always use the same types as a workaround for user code deriving from iostreams types and\r\n// __declspec(dllexport)ing the derived types. Adding member functions to iostreams broke the ABI of such DLLs.\r\n// Deriving and __declspec(dllexport)ing standard library types is not supported, but in this particular case\r\n// the workaround was inexpensive. The workaround will be removed in the next ABI breaking release of the\r\n// Visual C++ Libraries.\r\n_STD_BEGIN\r\n#if _HAS_CXX17\r\nnamespace filesystem {\r\n _EXPORT_STD class path;\r\n}\r\n#endif // _HAS_CXX17\r\n\r\nextern \"C++\" _CRTIMP2_PURE FILE* __CLRCALL_PURE_OR_CDECL _Fiopen(const char*, ios_base::openmode, int);\r\nextern \"C++\" _CRTIMP2_PURE FILE* __CLRCALL_PURE_OR_CDECL _Fiopen(const wchar_t*, ios_base::openmode, int);\r\n\r\ntemplate \r\nbool _Fgetc(_Elem& _Ch, FILE* _File) { // get an element from a C stream\r\n return _CSTD fread(&_Ch, sizeof(_Elem), 1, _File) == 1;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Fgetc(char& _Byte, FILE* _File) { // get a char element from a C stream\r\n int _Meta;\r\n if ((_Meta = _CSTD fgetc(_File)) == EOF) {\r\n return false;\r\n } else { // got one, convert to char\r\n _Byte = static_cast(_Meta);\r\n return true;\r\n }\r\n}\r\n\r\ntemplate <>\r\ninline bool _Fgetc(wchar_t& _Wchar, FILE* _File) { // get a wchar_t element from a C stream\r\n wint_t _Meta;\r\n if ((_Meta = _CSTD fgetwc(_File)) == WEOF) {\r\n return false;\r\n } else { // got one, convert to wchar_t\r\n _Wchar = static_cast(_Meta);\r\n return true;\r\n }\r\n}\r\n\r\n#ifdef _CRTBLD\r\ntemplate <>\r\ninline bool _Fgetc(unsigned short& _Wchar, FILE* _File) { // get an unsigned short element from a C stream\r\n wint_t _Meta;\r\n if ((_Meta = _CSTD fgetwc(_File)) == WEOF) {\r\n return false;\r\n } else { // got one, convert to unsigned short\r\n _Wchar = static_cast(_Meta);\r\n return true;\r\n }\r\n}\r\n#endif // defined(_CRTBLD)\r\n\r\ntemplate \r\nbool _Fputc(_Elem _Ch, FILE* _File) { // put an element to a C stream\r\n return _CSTD fwrite(&_Ch, 1, sizeof(_Elem), _File) == sizeof(_Elem);\r\n}\r\n\r\ntemplate <>\r\ninline bool _Fputc(char _Byte, FILE* _File) { // put a char element to a C stream\r\n return _CSTD fputc(_Byte, _File) != EOF;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Fputc(wchar_t _Wchar, FILE* _File) { // put a wchar_t element to a C stream\r\n return _CSTD fputwc(_Wchar, _File) != WEOF;\r\n}\r\n\r\n#ifdef _CRTBLD\r\ntemplate <>\r\ninline bool _Fputc(unsigned short _Wchar, FILE* _File) { // put an unsigned short element to a C stream\r\n return _CSTD fputwc(_Wchar, _File) != WEOF;\r\n}\r\n#endif // defined(_CRTBLD)\r\n\r\ntemplate \r\nbool _Ungetc(const _Elem&, FILE*) { // put back an arbitrary element to a C stream (always fail)\r\n return false;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Ungetc(const char& _Byte, FILE* _File) { // put back a char element to a C stream\r\n return _CSTD ungetc(static_cast(_Byte), _File) != EOF;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Ungetc(const signed char& _Byte, FILE* _File) { // put back a signed char element to a C stream\r\n return _CSTD ungetc(static_cast(_Byte), _File) != EOF;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Ungetc(const unsigned char& _Byte, FILE* _File) { // put back an unsigned char element to a C stream\r\n return _CSTD ungetc(_Byte, _File) != EOF;\r\n}\r\n\r\ntemplate <>\r\ninline bool _Ungetc(const wchar_t& _Wchar, FILE* _File) { // put back a wchar_t element to a C stream\r\n return _CSTD ungetwc(_Wchar, _File) != WEOF;\r\n}\r\n\r\n#ifdef _CRTBLD\r\ntemplate <>\r\ninline bool _Ungetc(const unsigned short& _Wchar, FILE* _File) { // put back an unsigned short element to a C stream\r\n return _CSTD ungetwc(_Wchar, _File) != WEOF;\r\n}\r\n#endif // defined(_CRTBLD)\r\n\r\n_EXPORT_STD template \r\nclass basic_filebuf : public basic_streambuf<_Elem, _Traits> { // stream buffer associated with a C stream\r\npublic:\r\n using _Mysb = basic_streambuf<_Elem, _Traits>;\r\n using _Cvt = codecvt<_Elem, char, typename _Traits::state_type>;\r\n\r\n basic_filebuf() : _Mysb() {\r\n _Init(nullptr, _Newfl);\r\n }\r\n\r\n explicit basic_filebuf(FILE* const _File) : _Mysb() { // extension, no ownership taking\r\n _Init(_File, _Newfl);\r\n }\r\n\r\n __CLR_OR_THIS_CALL ~basic_filebuf() noexcept override {\r\n if (_Myfile) {\r\n _Reset_back(); // revert from _Mychar buffer\r\n }\r\n\r\n if (_Closef) {\r\n close();\r\n }\r\n }\r\n\r\n using int_type = typename _Traits::int_type;\r\n using pos_type = typename _Traits::pos_type;\r\n using off_type = typename _Traits::off_type;\r\n\r\n basic_filebuf(_Uninitialized) noexcept : _Mysb(_Noinit) {}\r\n\r\n basic_filebuf(basic_filebuf&& _Right) {\r\n _Init(_Right._Myfile, _Newfl); // match buffering styles\r\n _Init(static_cast(nullptr), _Closefl); // then make *this look closed\r\n _Assign_rv(_STD move(_Right));\r\n }\r\n\r\n basic_filebuf& operator=(basic_filebuf&& _Right) {\r\n _Assign_rv(_STD move(_Right));\r\n return *this;\r\n }\r\n\r\n void _Assign_rv(basic_filebuf&& _Right) {\r\n if (this != _STD addressof(_Right)) {\r\n close();\r\n this->swap(_Right);\r\n }\r\n }\r\n\r\n void swap(basic_filebuf& _Right) noexcept /* strengthened */ {\r\n if (this != _STD addressof(_Right)) {\r\n FILE* _Myfile_sav = _Myfile;\r\n const _Cvt* _Pcvt_sav = _Pcvt;\r\n typename _Traits::state_type _State_sav = _State;\r\n bool _Wrotesome_sav = _Wrotesome;\r\n bool _Closef_sav = _Closef;\r\n bool _Set_eback_sav = _Mysb::eback() == &_Mychar;\r\n bool _Set_eback_live = _Mysb::gptr() == &_Mychar;\r\n\r\n _Elem* _Pfirst0 = _Mysb::pbase();\r\n _Elem* _Pnext0 = _Mysb::pptr();\r\n _Elem* _Pend = _Mysb::epptr();\r\n _Elem* _Gfirst0 = _Mysb::eback();\r\n _Elem* _Gnext0 = _Mysb::gptr();\r\n _Elem* _Gend = _Mysb::egptr();\r\n\r\n // reinitialize *this\r\n _Init(_Right._Myfile, _Right._Myfile ? _Openfl : _Newfl);\r\n _Mysb::setp(_Right.pbase(), _Right.pptr(), _Right.epptr());\r\n if (_Right.eback() != &_Right._Mychar) {\r\n _Mysb::setg(_Right.eback(), _Right.gptr(), _Right.egptr());\r\n } else if (_Right.gptr() != &_Right._Mychar) {\r\n _Mysb::setg(&_Mychar, &_Mychar + 1, &_Mychar + 1);\r\n } else {\r\n _Mysb::setg(&_Mychar, &_Mychar, &_Mychar + 1);\r\n }\r\n\r\n _Pcvt = _Right._Pcvt;\r\n _State = _Right._State;\r\n _Wrotesome = _Right._Wrotesome;\r\n _Closef = _Right._Closef;\r\n\r\n // reinitialize _Right\r\n _Right._Init(_Myfile_sav, _Myfile_sav ? _Openfl : _Newfl);\r\n _Right.setp(_Pfirst0, _Pnext0, _Pend);\r\n if (!_Set_eback_sav) {\r\n _Right.setg(_Gfirst0, _Gnext0, _Gend);\r\n } else if (!_Set_eback_live) {\r\n _Right.setg(&_Right._Mychar, &_Right._Mychar + 1, &_Right._Mychar + 1);\r\n } else {\r\n _Right.setg(&_Right._Mychar, &_Right._Mychar, &_Right._Mychar + 1);\r\n }\r\n\r\n _Right._Pcvt = _Pcvt_sav;\r\n _Right._State = _State_sav;\r\n _Right._Wrotesome = _Wrotesome_sav;\r\n _Right._Closef = _Closef_sav;\r\n\r\n // swap ancillary data\r\n _STD swap(_Set_eback, _Right._Set_eback);\r\n _STD swap(_Set_egptr, _Right._Set_egptr);\r\n\r\n _STD swap(_Mychar, _Right._Mychar);\r\n _STD swap(_Mysb::_Plocale, _Right._Plocale);\r\n }\r\n }\r\n\r\n basic_filebuf(const basic_filebuf&) = delete;\r\n basic_filebuf& operator=(const basic_filebuf&) = delete;\r\n\r\n enum _Initfl { // reasons for a call to _Init\r\n _Newfl,\r\n _Openfl,\r\n _Closefl\r\n };\r\n\r\n _NODISCARD bool is_open() const noexcept /* strengthened */ {\r\n return static_cast(_Myfile);\r\n }\r\n\r\n basic_filebuf* open(const char* _Filename, ios_base::openmode _Mode, int _Prot = ios_base::_Default_open_prot) {\r\n // _Prot is an extension\r\n if (_Myfile) {\r\n return nullptr;\r\n }\r\n\r\n const auto _File = _Fiopen(_Filename, _Mode, _Prot);\r\n if (!_File) {\r\n return nullptr; // open failed\r\n }\r\n\r\n _Init(_File, _Openfl);\r\n _Initcvt(_STD use_facet<_Cvt>(_Mysb::getloc()));\r\n return this; // open succeeded\r\n }\r\n\r\n basic_filebuf* open(const string& _Str, ios_base::openmode _Mode, int _Prot = ios_base::_Default_open_prot) {\r\n // _Prot is an extension\r\n return open(_Str.c_str(), _Mode, _Prot);\r\n }\r\n\r\n#if _HAS_OLD_IOSTREAMS_MEMBERS\r\n basic_filebuf* open(const char* _Filename, ios_base::open_mode _Mode) {\r\n return open(_Filename, static_cast(_Mode));\r\n }\r\n#endif // _HAS_OLD_IOSTREAMS_MEMBERS\r\n\r\n basic_filebuf* open(const wchar_t* _Filename, ios_base::openmode _Mode, int _Prot = ios_base::_Default_open_prot) {\r\n // in standard as const std::filesystem::path::value_type *; _Prot is an extension\r\n if (_Myfile) {\r\n return nullptr;\r\n }\r\n\r\n const auto _File = _Fiopen(_Filename, _Mode, _Prot);\r\n if (!_File) {\r\n return nullptr; // open failed\r\n }\r\n\r\n _Init(_File, _Openfl);\r\n _Initcvt(_STD use_facet<_Cvt>(_Mysb::getloc()));\r\n return this; // open succeeded\r\n }\r\n\r\n basic_filebuf* open(const wstring& _Str, ios_base::openmode _Mode, int _Prot = ios_base::_Default_open_prot) {\r\n // extension\r\n return open(_Str.c_str(), _Mode, _Prot);\r\n }\r\n\r\n#if _HAS_CXX17\r\n template \r\n basic_filebuf* open(\r\n const _Identity_t<_Path_ish>& _Path, ios_base::openmode _Mode, int _Prot = ios_base::_Default_open_prot) {\r\n // _Prot is an extension\r\n return open(_Path.c_str(), _Mode, _Prot);\r\n }\r\n#endif // _HAS_CXX17\r\n\r\n#if _HAS_OLD_IOSTREAMS_MEMBERS\r\n basic_filebuf* open(const wchar_t* _Filename, ios_base::open_mode _Mode) {\r\n // in standard as const std::filesystem::path::value_type *\r\n return open(_Filename, static_cast(_Mode));\r\n }\r\n#endif // _HAS_OLD_IOSTREAMS_MEMBERS\r\n\r\n basic_filebuf* close() {\r\n basic_filebuf* _Ans;\r\n if (_Myfile) { // put any homing sequence and close file\r\n _Reset_back(); // revert from _Mychar buffer\r\n\r\n _Ans = this;\r\n if (!_Endwrite()) {\r\n _Ans = nullptr;\r\n }\r\n\r\n if (_CSTD fclose(_Myfile) != 0) {\r\n _Ans = nullptr;\r\n }\r\n } else {\r\n _Ans = nullptr;\r\n }\r\n\r\n _Init(nullptr, _Closefl);\r\n return _Ans;\r\n }\r\n\r\n void __CLR_OR_THIS_CALL _Lock() override { // lock file instead of stream buffer\r\n if (_Myfile) {\r\n _CSTD _lock_file(_Myfile);\r\n }\r\n }\r\n\r\n void __CLR_OR_THIS_CALL _Unlock() override { // unlock file instead of stream buffer\r\n if (_Myfile) {\r\n _CSTD _unlock_file(_Myfile);\r\n }\r\n }\r\n\r\n#if _HAS_CXX23 && defined(_CPPRTTI)\r\n template \r\n friend ios_base::iostate _Do_on_maybe_unicode_console(ostream&, _UnicodeConsoleFn, _FallbackFn);\r\n#endif // ^^^ _HAS_CXX23 && defined(_CPPRTTI) ^^^\r\n\r\nprotected:\r\n int_type __CLR_OR_THIS_CALL overflow(int_type _Meta = _Traits::eof()) override { // put an element to stream\r\n if (_Traits::eq_int_type(_Traits::eof(), _Meta)) {\r\n return _Traits::not_eof(_Meta); // EOF, return success code\r\n }\r\n\r\n if (_Mysb::pptr() && _Mysb::pptr() < _Mysb::epptr()) { // room in buffer, store it\r\n *_Mysb::_Pninc() = _Traits::to_char_type(_Meta);\r\n return _Meta;\r\n }\r\n\r\n if (!_Myfile) {\r\n return _Traits::eof(); // no open C stream, fail\r\n }\r\n\r\n _Reset_back(); // revert from _Mychar buffer\r\n if (!_Pcvt) { // no codecvt facet, put as is\r\n return _Fputc(_Traits::to_char_type(_Meta), _Myfile) ? _Meta : _Traits::eof();\r\n }\r\n\r\n // put using codecvt facet\r\n constexpr size_t _Codecvt_temp_buf = 32;\r\n char _Str[_Codecvt_temp_buf];\r\n const _Elem _Ch = _Traits::to_char_type(_Meta);\r\n const _Elem* _Src;\r\n char* _Dest;\r\n\r\n // test result of converting one element\r\n switch (_Pcvt->out(_State, &_Ch, &_Ch + 1, _Src, _Str, _Str + _Codecvt_temp_buf, _Dest)) {\r\n case codecvt_base::partial:\r\n case codecvt_base::ok:\r\n { // converted something, try to put it out\r\n const auto _Count = static_cast(_Dest - _Str);\r\n if (0 < _Count && _Count != static_cast(_CSTD fwrite(_Str, 1, _Count, _Myfile))) {\r\n return _Traits::eof(); // write failed\r\n }\r\n\r\n _Wrotesome = true; // write succeeded\r\n if (_Src != &_Ch) {\r\n return _Meta; // converted whole element\r\n }\r\n\r\n return _Traits::eof(); // conversion failed\r\n }\r\n\r\n case codecvt_base::noconv:\r\n // no conversion, put as is\r\n return _Fputc(_Ch, _Myfile) ? _Meta : _Traits::eof();\r\n\r\n default:\r\n return _Traits::eof(); // conversion failed\r\n }\r\n }\r\n\r\n int_type __CLR_OR_THIS_CALL pbackfail(int_type _Meta = _Traits::eof()) override {\r\n // put an element back to stream\r\n if (_Mysb::gptr() && _Mysb::eback() < _Mysb::gptr()\r\n && (_Traits::eq_int_type(_Traits::eof(), _Meta)\r\n || _Traits::eq_int_type(_Traits::to_int_type(_Mysb::gptr()[-1]),\r\n _Meta))) { // just back up position\r\n _Mysb::_Gndec();\r\n return _Traits::not_eof(_Meta);\r\n } else if (!_Myfile || _Traits::eq_int_type(_Traits::eof(), _Meta)) {\r\n return _Traits::eof(); // no open C stream or EOF, fail\r\n } else if (!_Pcvt && _Ungetc(_Traits::to_char_type(_Meta), _Myfile)) {\r\n return _Meta; // no facet and unget succeeded, return\r\n } else if (_Mysb::gptr() != &_Mychar) { // putback to _Mychar\r\n _Mychar = _Traits::to_char_type(_Meta);\r\n _Set_back(); // switch to _Mychar buffer\r\n return _Meta;\r\n } else {\r\n return _Traits::eof(); // nowhere to put back\r\n }\r\n }\r\n\r\n int_type __CLR_OR_THIS_CALL underflow() override { // get an element from stream, but don't point past it\r\n int_type _Meta;\r\n if (_Mysb::gptr() && _Mysb::gptr() < _Mysb::egptr()) {\r\n return _Traits::to_int_type(*_Mysb::gptr()); // return buffered\r\n } else if (_Traits::eq_int_type(_Traits::eof(), _Meta = uflow())) {\r\n return _Meta; // uflow failed, return EOF\r\n } else { // get a char, don't point past it\r\n pbackfail(_Meta);\r\n return _Meta;\r\n }\r\n }\r\n\r\n int_type __CLR_OR_THIS_CALL uflow() override { // get an element from stream, point past it\r\n if (_Mysb::gptr() && _Mysb::gptr() < _Mysb::egptr()) {\r\n return _Traits::to_int_type(*_Mysb::_Gninc()); // return buffered\r\n }\r\n\r\n if (!_Myfile) {\r\n return _Traits::eof(); // no open C stream, fail\r\n }\r\n\r\n _Reset_back(); // revert from _Mychar buffer\r\n if (!_Pcvt) { // no codecvt facet, just get it\r\n _Elem _Ch;\r\n return _Fgetc(_Ch, _Myfile) ? _Traits::to_int_type(_Ch) : _Traits::eof();\r\n }\r\n\r\n // build string until codecvt succeeds\r\n string _Str;\r\n\r\n for (;;) { // get using codecvt facet\r\n const char* _Src;\r\n int _Meta = _CSTD fgetc(_Myfile);\r\n\r\n if (_Meta == EOF) {\r\n return _Traits::eof(); // partial char?\r\n }\r\n\r\n _Str.push_back(static_cast(_Meta)); // append byte and convert\r\n\r\n _Elem _Ch;\r\n _Elem* _Dest;\r\n\r\n // test result of converting one element\r\n switch (_Pcvt->in(_State, _Str.data(), _Str.data() + _Str.size(), _Src, &_Ch, &_Ch + 1, _Dest)) {\r\n case codecvt_base::partial:\r\n case codecvt_base::ok:\r\n if (_Dest != &_Ch) { // got an element, put back excess and deliver it\r\n auto _Nleft = _Str.data() + _Str.size() - _Src;\r\n while (0 < _Nleft) {\r\n _CSTD ungetc(_Src[--_Nleft], _Myfile);\r\n }\r\n\r\n return _Traits::to_int_type(_Ch);\r\n }\r\n\r\n _Str.erase(0, static_cast(_Src - _Str.data())); // partial, discard used input\r\n break;\r\n\r\n case codecvt_base::noconv:\r\n // noconv is only possible if _Elem is char, so we can use it directly\r\n return static_cast(_Str.front());\r\n\r\n default:\r\n return _Traits::eof(); // conversion failed\r\n }\r\n }\r\n }\r\n\r\n streamsize __CLR_OR_THIS_CALL xsgetn(_Elem* _Ptr, streamsize _Count) override {\r\n // get _Count characters from stream\r\n if constexpr (sizeof(_Elem) == 1) {\r\n if (_Count <= 0) {\r\n return 0;\r\n }\r\n\r\n if (_Pcvt) { // if we need a nontrivial codecvt transform, do the default expensive thing\r\n return _Mysb::xsgetn(_Ptr, _Count);\r\n }\r\n\r\n // assuming this is OK because _Ptr + _Count must be valid\r\n auto _Count_s = static_cast(_Count);\r\n const auto _Start_count = _Count;\r\n const auto _Available = static_cast(_Mysb::_Gnavail());\r\n if (0 < _Available) { // copy from get area\r\n const auto _Read_size = (_STD min) (_Count_s, _Available);\r\n _Traits::copy(_Ptr, _Mysb::gptr(), _Read_size);\r\n _Ptr += _Read_size;\r\n _Count_s -= _Read_size;\r\n _Mysb::gbump(static_cast(_Read_size));\r\n }\r\n\r\n if (_Myfile) { // open C stream, attempt read\r\n _Reset_back(); // revert from _Mychar buffer\r\n // process in 4k - 1 chunks to avoid tripping over fread's clobber-the-end behavior when\r\n // doing \\r\\n -> \\n translation\r\n constexpr size_t _Read_size = 4095; // _INTERNAL_BUFSIZ - 1\r\n while (_Read_size < _Count_s) {\r\n const auto _Actual_read = _CSTD fread(_Ptr, sizeof(_Elem), _Read_size, _Myfile);\r\n _Ptr += _Actual_read;\r\n _Count_s -= _Actual_read;\r\n if (_Actual_read != _Read_size) {\r\n return static_cast(_Start_count - _Count_s);\r\n }\r\n }\r\n\r\n if (0 < _Count_s) {\r\n _Count_s -= _CSTD fread(_Ptr, sizeof(_Elem), _Count_s, _Myfile);\r\n }\r\n }\r\n\r\n return static_cast(_Start_count - _Count_s);\r\n } else { // non-chars always get element-by-element processing\r\n return _Mysb::xsgetn(_Ptr, _Count);\r\n }\r\n }\r\n\r\n streamsize __CLR_OR_THIS_CALL xsputn(const _Elem* _Ptr, streamsize _Count) override {\r\n // put _Count characters to stream\r\n if constexpr (sizeof(_Elem) == 1) {\r\n if (_Pcvt) { // if we need a nontrivial codecvt transform, do the default expensive thing\r\n return _Mysb::xsputn(_Ptr, _Count);\r\n }\r\n\r\n const streamsize _Start_count = _Count;\r\n streamsize _Size = _Mysb::_Pnavail();\r\n if (0 < _Count && 0 < _Size) { // copy to write buffer\r\n if (_Count < _Size) {\r\n _Size = _Count;\r\n }\r\n\r\n _Traits::copy(_Mysb::pptr(), _Ptr, static_cast(_Size));\r\n _Ptr += _Size;\r\n _Count -= _Size;\r\n _Mysb::pbump(static_cast(_Size));\r\n }\r\n\r\n if (0 < _Count && _Myfile) { // open C stream, attempt write\r\n _Count -= _CSTD fwrite(_Ptr, sizeof(_Elem), static_cast(_Count), _Myfile);\r\n }\r\n\r\n return _Start_count - _Count;\r\n } else { // non-chars always get element-by-element processing\r\n return _Mysb::xsputn(_Ptr, _Count);\r\n }\r\n }\r\n\r\n pos_type __CLR_OR_THIS_CALL seekoff(off_type _Off, ios_base::seekdir _Way,\r\n ios_base::openmode = ios_base::in | ios_base::out) override { // change position by _Off\r\n fpos_t _Fileposition;\r\n\r\n if (_Mysb::gptr() == &_Mychar // something putback\r\n && _Way == ios_base::cur // a relative seek\r\n && !_Pcvt) { // not converting\r\n _Off -= static_cast(sizeof(_Elem)); // back up over _Elem bytes\r\n }\r\n\r\n if (!_Myfile || !_Endwrite()\r\n || ((_Off != 0 || _Way != ios_base::cur) && _CSTD _fseeki64(_Myfile, _Off, _Way) != 0)\r\n || _CSTD fgetpos(_Myfile, &_Fileposition) != 0) {\r\n return pos_type{off_type{-1}}; // report failure\r\n }\r\n\r\n _Reset_back(); // revert from _Mychar buffer, discarding any putback\r\n return pos_type{_State, _Fileposition}; // return new position\r\n }\r\n\r\n pos_type __CLR_OR_THIS_CALL seekpos(pos_type _Pos, ios_base::openmode = ios_base::in | ios_base::out) override {\r\n // change position to _Pos\r\n off_type _Off = static_cast(_Pos);\r\n\r\n if (!_Myfile || !_Endwrite() || _CSTD fsetpos(_Myfile, &_Off) != 0) {\r\n return pos_type{off_type{-1}}; // report failure\r\n }\r\n\r\n _State = _Pos.state();\r\n _Reset_back(); // revert from _Mychar buffer, discarding any putback\r\n return pos_type{_State, _Off}; // return new position\r\n }\r\n\r\n _Mysb* __CLR_OR_THIS_CALL setbuf(_Elem* _Buffer, streamsize _Count) override { // offer _Buffer to C stream\r\n int _Mode;\r\n if (!_Buffer && _Count == 0) {\r\n _Mode = _IONBF;\r\n } else {\r\n _Mode = _IOFBF;\r\n }\r\n\r\n const size_t _Size = static_cast(_Count) * sizeof(_Elem);\r\n\r\n if (!_Myfile || _CSTD setvbuf(_Myfile, reinterpret_cast(_Buffer), _Mode, _Size) != 0) {\r\n return nullptr; // failed\r\n }\r\n\r\n // new buffer, reinitialize pointers\r\n _Init(_Myfile, _Openfl);\r\n return this;\r\n }\r\n\r\n int __CLR_OR_THIS_CALL sync() override { // synchronize C stream with external file\r\n if (!_Myfile || _Traits::eq_int_type(_Traits::eof(), overflow()) || 0 <= _CSTD fflush(_Myfile)) {\r\n return 0;\r\n }\r\n\r\n return -1;\r\n }\r\n\r\n void __CLR_OR_THIS_CALL imbue(const locale& _Loc) override {\r\n // set locale to argument (capture nontrivial codecvt facet)\r\n _Initcvt(_STD use_facet<_Cvt>(_Loc));\r\n }\r\n\r\n void _Init(FILE* _File, _Initfl _Which) noexcept { // initialize to C stream _File after {new, open, close}\r\n using _State_type = typename _Traits::state_type;\r\n\r\n __PURE_APPDOMAIN_GLOBAL static _State_type _Stinit; // initial state\r\n\r\n _Closef = _Which == _Openfl;\r\n _Wrotesome = false;\r\n\r\n _Mysb::_Init(); // initialize stream buffer base object\r\n\r\n if (_File && sizeof(_Elem) == 1) { // point inside C stream with [first, first + count) buffer\r\n _Elem** _Pb = nullptr;\r\n _Elem** _Pn = nullptr;\r\n int* _Nr = nullptr;\r\n\r\n ::_get_stream_buffer_pointers(\r\n _File, reinterpret_cast(&_Pb), reinterpret_cast(&_Pn), &_Nr);\r\n int* _Nw = _Nr;\r\n\r\n _Mysb::_Init(_Pb, _Pn, _Nr, _Pb, _Pn, _Nw);\r\n }\r\n\r\n _Myfile = _File;\r\n _State = _Stinit;\r\n _Pcvt = nullptr; // pointer to codecvt facet\r\n }\r\n\r\n bool _Endwrite() { // put shift to initial conversion state, as needed\r\n if (!_Pcvt || !_Wrotesome) {\r\n return true;\r\n }\r\n\r\n // may have to put\r\n if (_Traits::eq_int_type(_Traits::eof(), overflow())) {\r\n return false;\r\n }\r\n\r\n constexpr size_t _Codecvt_temp_buf = 32;\r\n char _Str[_Codecvt_temp_buf];\r\n char* _Dest;\r\n switch (_Pcvt->unshift(_State, _Str, _Str + _Codecvt_temp_buf, _Dest)) { // test result of homing conversion\r\n case codecvt_base::ok:\r\n _Wrotesome = false; // homed successfully\r\n _FALLTHROUGH;\r\n\r\n case codecvt_base::partial:\r\n { // put any generated bytes\r\n const auto _Count = static_cast(_Dest - _Str);\r\n if (0 < _Count && _Count != static_cast(_CSTD fwrite(_Str, 1, _Count, _Myfile))) {\r\n return false; // write failed\r\n }\r\n\r\n return !_Wrotesome;\r\n }\r\n\r\n case codecvt_base::noconv:\r\n _Wrotesome = false; // homed successfully\r\n return true; // nothing else to do\r\n\r\n default:\r\n return false; // conversion failed\r\n }\r\n }\r\n\r\n void _Initcvt(const _Cvt& _Newcvt) noexcept { // initialize codecvt pointer\r\n if (_Newcvt.always_noconv()) {\r\n _Pcvt = nullptr; // nothing to do\r\n } else { // set up for nontrivial codecvt facet\r\n _Pcvt = _STD addressof(_Newcvt);\r\n _Mysb::_Init(); // reset any buffering\r\n }\r\n }\r\n\r\nprivate:\r\n const _Cvt* _Pcvt; // pointer to codecvt facet (may be null)\r\n _Elem _Mychar; // putback character, when _Ungetc fails\r\n bool _Wrotesome; // true if homing sequence may be needed\r\n typename _Traits::state_type _State; // current conversion state\r\n bool _Closef; // true if C stream must be closed\r\n FILE* _Myfile; // pointer to C stream\r\n\r\n void _Reset_back() noexcept { // restore buffer after putback\r\n if (_Mysb::eback() == &_Mychar) {\r\n _Mysb::setg(_Set_eback, _Set_eback, _Set_egptr);\r\n }\r\n }\r\n\r\n void _Set_back() noexcept { // set up putback area\r\n if (_Mysb::eback() != &_Mychar) { // save current get buffer\r\n _Set_eback = _Mysb::eback();\r\n _Set_egptr = _Mysb::egptr();\r\n }\r\n _Mysb::setg(&_Mychar, &_Mychar, &_Mychar + 1);\r\n }\r\n\r\n _Elem* _Set_eback; // saves eback() during one-element putback\r\n _Elem* _Set_egptr; // saves egptr()\r\n};\r\n\r\n_EXPORT_STD template \r\nvoid swap(basic_filebuf<_Elem, _Traits>& _Left, basic_filebuf<_Elem, _Traits>& _Right) noexcept /* strengthened */ {\r\n _Left.swap(_Right);\r\n}\r\n\r\n_STD_END\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_FILEBUF_HPP\r\n" }, { "path": "stl/inc/__msvc_format_ucd_tables.hpp", "content": "// __msvc_format_ucd_tables.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n// WARNING, this entire header is generated by\r\n// tools/unicode_properties_parse/unicode_properties_data_gen.py\r\n// DO NOT MODIFY!\r\n\r\n// UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE\r\n//\r\n// See Terms of Use \r\n// for definitions of Unicode Inc.'s Data Files and Software.\r\n//\r\n// NOTICE TO USER: Carefully read the following legal agreement.\r\n// BY DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S\r\n// DATA FILES (\"DATA FILES\"), AND/OR SOFTWARE (\"SOFTWARE\"),\r\n// YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE\r\n// TERMS AND CONDITIONS OF THIS AGREEMENT.\r\n// IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE\r\n// THE DATA FILES OR SOFTWARE.\r\n//\r\n// COPYRIGHT AND PERMISSION NOTICE\r\n//\r\n// Copyright (c) 1991-2022 Unicode, Inc. All rights reserved.\r\n// Distributed under the Terms of Use in https://www.unicode.org/copyright.html.\r\n//\r\n// Permission is hereby granted, free of charge, to any person obtaining\r\n// a copy of the Unicode data files and any associated documentation\r\n// (the \"Data Files\") or Unicode software and any associated documentation\r\n// (the \"Software\") to deal in the Data Files or Software\r\n// without restriction, including without limitation the rights to use,\r\n// copy, modify, merge, publish, distribute, and/or sell copies of\r\n// the Data Files or Software, and to permit persons to whom the Data Files\r\n// or Software are furnished to do so, provided that either\r\n// (a) this copyright and permission notice appear with all copies\r\n// of the Data Files or Software, or\r\n// (b) this copyright and permission notice appear in associated\r\n// Documentation.\r\n//\r\n// THE DATA FILES AND SOFTWARE ARE PROVIDED \"AS IS\", WITHOUT WARRANTY OF\r\n// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE\r\n// WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n// NONINFRINGEMENT OF THIRD PARTY RIGHTS.\r\n// IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS\r\n// NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL\r\n// DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,\r\n// DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\r\n// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\n// PERFORMANCE OF THE DATA FILES OR SOFTWARE.\r\n//\r\n// Except as contained in this notice, the name of a copyright holder\r\n// shall not be used in advertising or otherwise to promote the sale,\r\n// use or other dealings in these Data Files or Software without prior\r\n// written authorization of the copyright holder.\r\n\r\n#ifndef __MSVC_FORMAT_UCD_TABLES_HPP\r\n#define __MSVC_FORMAT_UCD_TABLES_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n\r\n#include \r\n#include \r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n_STD_BEGIN\r\n\r\ntemplate \r\nstruct _Unicode_property_data {\r\n uint32_t _Lower_bounds[_NumRanges];\r\n uint16_t _Props_and_size[_NumRanges];\r\n _NODISCARD constexpr _ValueEnum _Get_property_for_codepoint(const uint32_t _Code_point) const noexcept {\r\n ptrdiff_t _Upper_idx = _STD upper_bound(_Lower_bounds, _STD end(_Lower_bounds), _Code_point) - _Lower_bounds;\r\n constexpr auto _No_value_constant = static_cast<_ValueEnum>(UINT8_MAX);\r\n if (_Upper_idx == 0) {\r\n return _No_value_constant;\r\n }\r\n --_Upper_idx;\r\n const uint32_t _Lower_bound = _Lower_bounds[_Upper_idx];\r\n const uint16_t _Data = _Props_and_size[_Upper_idx];\r\n _STL_INTERNAL_CHECK(_Code_point >= _Lower_bound);\r\n if constexpr (_Is_binary_property) {\r\n if (_Code_point < _Lower_bound + _Data) {\r\n return static_cast<_ValueEnum>(0);\r\n }\r\n } else {\r\n const uint16_t _Size = static_cast(_Data & 0x0FFF);\r\n const _ValueEnum _Prop = static_cast<_ValueEnum>((_Data & 0xF000) >> 12);\r\n if (_Code_point < _Lower_bound + _Size) {\r\n return _Prop;\r\n }\r\n }\r\n return _No_value_constant;\r\n }\r\n};\r\n\r\n// The following static data tables are generated from the Unicode character database.\r\n// _Grapheme_Break_property_data comes from ucd/auxiliary/GraphemeBreakProperty.txt.\r\n//\r\n// _Indic_Conjunct_Break_property_data comes from ucd/DerivedCoreProperties.txt.\r\n//\r\n// _Extended_Pictographic_property_data comes from ucd/emoji/emoji-data.txt.\r\n//\r\n// __printable_property_data comes from ucd/extracted/DerivedGeneralCategory.txt.\r\n//\r\n// _Grapheme_Extend_property_data comes from ucd/DerivedCoreProperties.txt.\r\n//\r\n// The enums containing the values for the properties are also generated, in order to ensure they match\r\n// up correctly with how we're parsing them.\r\n//\r\n// All sets of data tables are generated by tools/unicode_properties_parse/unicode_properties_data_gen.py in the\r\n// https://github.com/microsoft/stl repository.\r\n//\r\n// The data format is a set of arrays for each character property. The first is an array of uint32_t encoding\r\n// the lower bound of each range of codepoints that has the given property.\r\n// The second is an array of uint16_t.\r\n// - For enumerated properties, this array encodes both the range size and property value as follows:\r\n// 16 12 0\r\n// +-----------------------------------------------------+\r\n// | property_value | range_size |\r\n// +-----------------------------------------------------+\r\n// that is: the size is stored in the least significant 12 bits\r\n// (leading to a max size of 4095), and the property value is stored in the most significant 4 bits,\r\n// leading to a maximum of 16 property values.\r\n// - For binary properties, this array simply stores the range size.\r\n//\r\n// Codepoint ranges may not overlap, and, within one property, a codepoint may only appear once. Furthermore the\r\n// codepoint lower bounds appear in sorted (ascending) order.\r\n\r\n// GraphemeBreakProperty-17.0.0.txt\r\n// Date: 2025-06-30, 06:20:23 GMT\r\nenum class _Grapheme_Break_property_values : uint8_t {\r\n _CR_value,\r\n _Control_value,\r\n _Extend_value,\r\n _L_value,\r\n _LF_value,\r\n _LV_value,\r\n _LVT_value,\r\n _Prepend_value,\r\n _Regional_Indicator_value,\r\n _SpacingMark_value,\r\n _T_value,\r\n _V_value,\r\n _ZWJ_value,\r\n _No_value = 255\r\n};\r\n\r\n// GraphemeBreakProperty-17.0.0.txt\r\n// Date: 2025-06-30, 06:20:23 GMT\r\ninline constexpr _Unicode_property_data<_Grapheme_Break_property_values, 1386, false> _Grapheme_Break_property_data{\r\n {0x0, 0xa, 0xb, 0xd, 0xe, 0x7f, 0xad, 0x300, 0x483, 0x591, 0x5bf, 0x5c1, 0x5c4, 0x5c7, 0x600, 0x610, 0x61c, 0x64b,\r\n 0x670, 0x6d6, 0x6dd, 0x6df, 0x6e7, 0x6ea, 0x70f, 0x711, 0x730, 0x7a6, 0x7eb, 0x7fd, 0x816, 0x81b, 0x825, 0x829,\r\n 0x859, 0x890, 0x897, 0x8ca, 0x8e2, 0x8e3, 0x903, 0x93a, 0x93b, 0x93c, 0x93e, 0x941, 0x949, 0x94d, 0x94e, 0x951,\r\n 0x962, 0x981, 0x982, 0x9bc, 0x9be, 0x9bf, 0x9c1, 0x9c7, 0x9cb, 0x9cd, 0x9d7, 0x9e2, 0x9fe, 0xa01, 0xa03, 0xa3c,\r\n 0xa3e, 0xa41, 0xa47, 0xa4b, 0xa51, 0xa70, 0xa75, 0xa81, 0xa83, 0xabc, 0xabe, 0xac1, 0xac7, 0xac9, 0xacb, 0xacd,\r\n 0xae2, 0xafa, 0xb01, 0xb02, 0xb3c, 0xb3e, 0xb40, 0xb41, 0xb47, 0xb4b, 0xb4d, 0xb55, 0xb62, 0xb82, 0xbbe, 0xbbf,\r\n 0xbc0, 0xbc1, 0xbc6, 0xbca, 0xbcd, 0xbd7, 0xc00, 0xc01, 0xc04, 0xc3c, 0xc3e, 0xc41, 0xc46, 0xc4a, 0xc55, 0xc62,\r\n 0xc81, 0xc82, 0xcbc, 0xcbe, 0xcbf, 0xcc1, 0xcc2, 0xcc3, 0xcc6, 0xcca, 0xcd5, 0xce2, 0xcf3, 0xd00, 0xd02, 0xd3b,\r\n 0xd3e, 0xd3f, 0xd41, 0xd46, 0xd4a, 0xd4d, 0xd4e, 0xd57, 0xd62, 0xd81, 0xd82, 0xdca, 0xdcf, 0xdd0, 0xdd2, 0xdd6,\r\n 0xdd8, 0xddf, 0xdf2, 0xe31, 0xe33, 0xe34, 0xe47, 0xeb1, 0xeb3, 0xeb4, 0xec8, 0xf18, 0xf35, 0xf37, 0xf39, 0xf3e,\r\n 0xf71, 0xf7f, 0xf80, 0xf86, 0xf8d, 0xf99, 0xfc6, 0x102d, 0x1031, 0x1032, 0x1039, 0x103b, 0x103d, 0x1056, 0x1058,\r\n 0x105e, 0x1071, 0x1082, 0x1084, 0x1085, 0x108d, 0x109d, 0x1100, 0x1160, 0x11a8, 0x135d, 0x1712, 0x1732, 0x1752,\r\n 0x1772, 0x17b4, 0x17b6, 0x17b7, 0x17be, 0x17c6, 0x17c7, 0x17c9, 0x17dd, 0x180b, 0x180e, 0x180f, 0x1885, 0x18a9,\r\n 0x1920, 0x1923, 0x1927, 0x1929, 0x1930, 0x1932, 0x1933, 0x1939, 0x1a17, 0x1a19, 0x1a1b, 0x1a55, 0x1a56, 0x1a57,\r\n 0x1a58, 0x1a60, 0x1a62, 0x1a65, 0x1a6d, 0x1a73, 0x1a7f, 0x1ab0, 0x1ae0, 0x1b00, 0x1b04, 0x1b34, 0x1b3e, 0x1b42,\r\n 0x1b6b, 0x1b80, 0x1b82, 0x1ba1, 0x1ba2, 0x1ba6, 0x1ba8, 0x1be6, 0x1be7, 0x1be8, 0x1bea, 0x1bed, 0x1bee, 0x1bef,\r\n 0x1c24, 0x1c2c, 0x1c34, 0x1c36, 0x1cd0, 0x1cd4, 0x1ce1, 0x1ce2, 0x1ced, 0x1cf4, 0x1cf7, 0x1cf8, 0x1dc0, 0x200b,\r\n 0x200c, 0x200d, 0x200e, 0x2028, 0x2060, 0x20d0, 0x2cef, 0x2d7f, 0x2de0, 0x302a, 0x3099, 0xa66f, 0xa674, 0xa69e,\r\n 0xa6f0, 0xa802, 0xa806, 0xa80b, 0xa823, 0xa825, 0xa827, 0xa82c, 0xa880, 0xa8b4, 0xa8c4, 0xa8e0, 0xa8ff, 0xa926,\r\n 0xa947, 0xa952, 0xa953, 0xa960, 0xa980, 0xa983, 0xa9b3, 0xa9b4, 0xa9b6, 0xa9ba, 0xa9bc, 0xa9be, 0xa9c0, 0xa9e5,\r\n 0xaa29, 0xaa2f, 0xaa31, 0xaa33, 0xaa35, 0xaa43, 0xaa4c, 0xaa4d, 0xaa7c, 0xaab0, 0xaab2, 0xaab7, 0xaabe, 0xaac1,\r\n 0xaaeb, 0xaaec, 0xaaee, 0xaaf5, 0xaaf6, 0xabe3, 0xabe5, 0xabe6, 0xabe8, 0xabe9, 0xabec, 0xabed, 0xac00, 0xac01,\r\n 0xac1c, 0xac1d, 0xac38, 0xac39, 0xac54, 0xac55, 0xac70, 0xac71, 0xac8c, 0xac8d, 0xaca8, 0xaca9, 0xacc4, 0xacc5,\r\n 0xace0, 0xace1, 0xacfc, 0xacfd, 0xad18, 0xad19, 0xad34, 0xad35, 0xad50, 0xad51, 0xad6c, 0xad6d, 0xad88, 0xad89,\r\n 0xada4, 0xada5, 0xadc0, 0xadc1, 0xaddc, 0xaddd, 0xadf8, 0xadf9, 0xae14, 0xae15, 0xae30, 0xae31, 0xae4c, 0xae4d,\r\n 0xae68, 0xae69, 0xae84, 0xae85, 0xaea0, 0xaea1, 0xaebc, 0xaebd, 0xaed8, 0xaed9, 0xaef4, 0xaef5, 0xaf10, 0xaf11,\r\n 0xaf2c, 0xaf2d, 0xaf48, 0xaf49, 0xaf64, 0xaf65, 0xaf80, 0xaf81, 0xaf9c, 0xaf9d, 0xafb8, 0xafb9, 0xafd4, 0xafd5,\r\n 0xaff0, 0xaff1, 0xb00c, 0xb00d, 0xb028, 0xb029, 0xb044, 0xb045, 0xb060, 0xb061, 0xb07c, 0xb07d, 0xb098, 0xb099,\r\n 0xb0b4, 0xb0b5, 0xb0d0, 0xb0d1, 0xb0ec, 0xb0ed, 0xb108, 0xb109, 0xb124, 0xb125, 0xb140, 0xb141, 0xb15c, 0xb15d,\r\n 0xb178, 0xb179, 0xb194, 0xb195, 0xb1b0, 0xb1b1, 0xb1cc, 0xb1cd, 0xb1e8, 0xb1e9, 0xb204, 0xb205, 0xb220, 0xb221,\r\n 0xb23c, 0xb23d, 0xb258, 0xb259, 0xb274, 0xb275, 0xb290, 0xb291, 0xb2ac, 0xb2ad, 0xb2c8, 0xb2c9, 0xb2e4, 0xb2e5,\r\n 0xb300, 0xb301, 0xb31c, 0xb31d, 0xb338, 0xb339, 0xb354, 0xb355, 0xb370, 0xb371, 0xb38c, 0xb38d, 0xb3a8, 0xb3a9,\r\n 0xb3c4, 0xb3c5, 0xb3e0, 0xb3e1, 0xb3fc, 0xb3fd, 0xb418, 0xb419, 0xb434, 0xb435, 0xb450, 0xb451, 0xb46c, 0xb46d,\r\n 0xb488, 0xb489, 0xb4a4, 0xb4a5, 0xb4c0, 0xb4c1, 0xb4dc, 0xb4dd, 0xb4f8, 0xb4f9, 0xb514, 0xb515, 0xb530, 0xb531,\r\n 0xb54c, 0xb54d, 0xb568, 0xb569, 0xb584, 0xb585, 0xb5a0, 0xb5a1, 0xb5bc, 0xb5bd, 0xb5d8, 0xb5d9, 0xb5f4, 0xb5f5,\r\n 0xb610, 0xb611, 0xb62c, 0xb62d, 0xb648, 0xb649, 0xb664, 0xb665, 0xb680, 0xb681, 0xb69c, 0xb69d, 0xb6b8, 0xb6b9,\r\n 0xb6d4, 0xb6d5, 0xb6f0, 0xb6f1, 0xb70c, 0xb70d, 0xb728, 0xb729, 0xb744, 0xb745, 0xb760, 0xb761, 0xb77c, 0xb77d,\r\n 0xb798, 0xb799, 0xb7b4, 0xb7b5, 0xb7d0, 0xb7d1, 0xb7ec, 0xb7ed, 0xb808, 0xb809, 0xb824, 0xb825, 0xb840, 0xb841,\r\n 0xb85c, 0xb85d, 0xb878, 0xb879, 0xb894, 0xb895, 0xb8b0, 0xb8b1, 0xb8cc, 0xb8cd, 0xb8e8, 0xb8e9, 0xb904, 0xb905,\r\n 0xb920, 0xb921, 0xb93c, 0xb93d, 0xb958, 0xb959, 0xb974, 0xb975, 0xb990, 0xb991, 0xb9ac, 0xb9ad, 0xb9c8, 0xb9c9,\r\n 0xb9e4, 0xb9e5, 0xba00, 0xba01, 0xba1c, 0xba1d, 0xba38, 0xba39, 0xba54, 0xba55, 0xba70, 0xba71, 0xba8c, 0xba8d,\r\n 0xbaa8, 0xbaa9, 0xbac4, 0xbac5, 0xbae0, 0xbae1, 0xbafc, 0xbafd, 0xbb18, 0xbb19, 0xbb34, 0xbb35, 0xbb50, 0xbb51,\r\n 0xbb6c, 0xbb6d, 0xbb88, 0xbb89, 0xbba4, 0xbba5, 0xbbc0, 0xbbc1, 0xbbdc, 0xbbdd, 0xbbf8, 0xbbf9, 0xbc14, 0xbc15,\r\n 0xbc30, 0xbc31, 0xbc4c, 0xbc4d, 0xbc68, 0xbc69, 0xbc84, 0xbc85, 0xbca0, 0xbca1, 0xbcbc, 0xbcbd, 0xbcd8, 0xbcd9,\r\n 0xbcf4, 0xbcf5, 0xbd10, 0xbd11, 0xbd2c, 0xbd2d, 0xbd48, 0xbd49, 0xbd64, 0xbd65, 0xbd80, 0xbd81, 0xbd9c, 0xbd9d,\r\n 0xbdb8, 0xbdb9, 0xbdd4, 0xbdd5, 0xbdf0, 0xbdf1, 0xbe0c, 0xbe0d, 0xbe28, 0xbe29, 0xbe44, 0xbe45, 0xbe60, 0xbe61,\r\n 0xbe7c, 0xbe7d, 0xbe98, 0xbe99, 0xbeb4, 0xbeb5, 0xbed0, 0xbed1, 0xbeec, 0xbeed, 0xbf08, 0xbf09, 0xbf24, 0xbf25,\r\n 0xbf40, 0xbf41, 0xbf5c, 0xbf5d, 0xbf78, 0xbf79, 0xbf94, 0xbf95, 0xbfb0, 0xbfb1, 0xbfcc, 0xbfcd, 0xbfe8, 0xbfe9,\r\n 0xc004, 0xc005, 0xc020, 0xc021, 0xc03c, 0xc03d, 0xc058, 0xc059, 0xc074, 0xc075, 0xc090, 0xc091, 0xc0ac, 0xc0ad,\r\n 0xc0c8, 0xc0c9, 0xc0e4, 0xc0e5, 0xc100, 0xc101, 0xc11c, 0xc11d, 0xc138, 0xc139, 0xc154, 0xc155, 0xc170, 0xc171,\r\n 0xc18c, 0xc18d, 0xc1a8, 0xc1a9, 0xc1c4, 0xc1c5, 0xc1e0, 0xc1e1, 0xc1fc, 0xc1fd, 0xc218, 0xc219, 0xc234, 0xc235,\r\n 0xc250, 0xc251, 0xc26c, 0xc26d, 0xc288, 0xc289, 0xc2a4, 0xc2a5, 0xc2c0, 0xc2c1, 0xc2dc, 0xc2dd, 0xc2f8, 0xc2f9,\r\n 0xc314, 0xc315, 0xc330, 0xc331, 0xc34c, 0xc34d, 0xc368, 0xc369, 0xc384, 0xc385, 0xc3a0, 0xc3a1, 0xc3bc, 0xc3bd,\r\n 0xc3d8, 0xc3d9, 0xc3f4, 0xc3f5, 0xc410, 0xc411, 0xc42c, 0xc42d, 0xc448, 0xc449, 0xc464, 0xc465, 0xc480, 0xc481,\r\n 0xc49c, 0xc49d, 0xc4b8, 0xc4b9, 0xc4d4, 0xc4d5, 0xc4f0, 0xc4f1, 0xc50c, 0xc50d, 0xc528, 0xc529, 0xc544, 0xc545,\r\n 0xc560, 0xc561, 0xc57c, 0xc57d, 0xc598, 0xc599, 0xc5b4, 0xc5b5, 0xc5d0, 0xc5d1, 0xc5ec, 0xc5ed, 0xc608, 0xc609,\r\n 0xc624, 0xc625, 0xc640, 0xc641, 0xc65c, 0xc65d, 0xc678, 0xc679, 0xc694, 0xc695, 0xc6b0, 0xc6b1, 0xc6cc, 0xc6cd,\r\n 0xc6e8, 0xc6e9, 0xc704, 0xc705, 0xc720, 0xc721, 0xc73c, 0xc73d, 0xc758, 0xc759, 0xc774, 0xc775, 0xc790, 0xc791,\r\n 0xc7ac, 0xc7ad, 0xc7c8, 0xc7c9, 0xc7e4, 0xc7e5, 0xc800, 0xc801, 0xc81c, 0xc81d, 0xc838, 0xc839, 0xc854, 0xc855,\r\n 0xc870, 0xc871, 0xc88c, 0xc88d, 0xc8a8, 0xc8a9, 0xc8c4, 0xc8c5, 0xc8e0, 0xc8e1, 0xc8fc, 0xc8fd, 0xc918, 0xc919,\r\n 0xc934, 0xc935, 0xc950, 0xc951, 0xc96c, 0xc96d, 0xc988, 0xc989, 0xc9a4, 0xc9a5, 0xc9c0, 0xc9c1, 0xc9dc, 0xc9dd,\r\n 0xc9f8, 0xc9f9, 0xca14, 0xca15, 0xca30, 0xca31, 0xca4c, 0xca4d, 0xca68, 0xca69, 0xca84, 0xca85, 0xcaa0, 0xcaa1,\r\n 0xcabc, 0xcabd, 0xcad8, 0xcad9, 0xcaf4, 0xcaf5, 0xcb10, 0xcb11, 0xcb2c, 0xcb2d, 0xcb48, 0xcb49, 0xcb64, 0xcb65,\r\n 0xcb80, 0xcb81, 0xcb9c, 0xcb9d, 0xcbb8, 0xcbb9, 0xcbd4, 0xcbd5, 0xcbf0, 0xcbf1, 0xcc0c, 0xcc0d, 0xcc28, 0xcc29,\r\n 0xcc44, 0xcc45, 0xcc60, 0xcc61, 0xcc7c, 0xcc7d, 0xcc98, 0xcc99, 0xccb4, 0xccb5, 0xccd0, 0xccd1, 0xccec, 0xcced,\r\n 0xcd08, 0xcd09, 0xcd24, 0xcd25, 0xcd40, 0xcd41, 0xcd5c, 0xcd5d, 0xcd78, 0xcd79, 0xcd94, 0xcd95, 0xcdb0, 0xcdb1,\r\n 0xcdcc, 0xcdcd, 0xcde8, 0xcde9, 0xce04, 0xce05, 0xce20, 0xce21, 0xce3c, 0xce3d, 0xce58, 0xce59, 0xce74, 0xce75,\r\n 0xce90, 0xce91, 0xceac, 0xcead, 0xcec8, 0xcec9, 0xcee4, 0xcee5, 0xcf00, 0xcf01, 0xcf1c, 0xcf1d, 0xcf38, 0xcf39,\r\n 0xcf54, 0xcf55, 0xcf70, 0xcf71, 0xcf8c, 0xcf8d, 0xcfa8, 0xcfa9, 0xcfc4, 0xcfc5, 0xcfe0, 0xcfe1, 0xcffc, 0xcffd,\r\n 0xd018, 0xd019, 0xd034, 0xd035, 0xd050, 0xd051, 0xd06c, 0xd06d, 0xd088, 0xd089, 0xd0a4, 0xd0a5, 0xd0c0, 0xd0c1,\r\n 0xd0dc, 0xd0dd, 0xd0f8, 0xd0f9, 0xd114, 0xd115, 0xd130, 0xd131, 0xd14c, 0xd14d, 0xd168, 0xd169, 0xd184, 0xd185,\r\n 0xd1a0, 0xd1a1, 0xd1bc, 0xd1bd, 0xd1d8, 0xd1d9, 0xd1f4, 0xd1f5, 0xd210, 0xd211, 0xd22c, 0xd22d, 0xd248, 0xd249,\r\n 0xd264, 0xd265, 0xd280, 0xd281, 0xd29c, 0xd29d, 0xd2b8, 0xd2b9, 0xd2d4, 0xd2d5, 0xd2f0, 0xd2f1, 0xd30c, 0xd30d,\r\n 0xd328, 0xd329, 0xd344, 0xd345, 0xd360, 0xd361, 0xd37c, 0xd37d, 0xd398, 0xd399, 0xd3b4, 0xd3b5, 0xd3d0, 0xd3d1,\r\n 0xd3ec, 0xd3ed, 0xd408, 0xd409, 0xd424, 0xd425, 0xd440, 0xd441, 0xd45c, 0xd45d, 0xd478, 0xd479, 0xd494, 0xd495,\r\n 0xd4b0, 0xd4b1, 0xd4cc, 0xd4cd, 0xd4e8, 0xd4e9, 0xd504, 0xd505, 0xd520, 0xd521, 0xd53c, 0xd53d, 0xd558, 0xd559,\r\n 0xd574, 0xd575, 0xd590, 0xd591, 0xd5ac, 0xd5ad, 0xd5c8, 0xd5c9, 0xd5e4, 0xd5e5, 0xd600, 0xd601, 0xd61c, 0xd61d,\r\n 0xd638, 0xd639, 0xd654, 0xd655, 0xd670, 0xd671, 0xd68c, 0xd68d, 0xd6a8, 0xd6a9, 0xd6c4, 0xd6c5, 0xd6e0, 0xd6e1,\r\n 0xd6fc, 0xd6fd, 0xd718, 0xd719, 0xd734, 0xd735, 0xd750, 0xd751, 0xd76c, 0xd76d, 0xd788, 0xd789, 0xd7b0, 0xd7cb,\r\n 0xfb1e, 0xfe00, 0xfe20, 0xfeff, 0xff9e, 0xfff0, 0x101fd, 0x102e0, 0x10376, 0x10a01, 0x10a05, 0x10a0c, 0x10a38,\r\n 0x10a3f, 0x10ae5, 0x10d24, 0x10d69, 0x10eab, 0x10efa, 0x10f46, 0x10f82, 0x11000, 0x11001, 0x11002, 0x11038,\r\n 0x11070, 0x11073, 0x1107f, 0x11082, 0x110b0, 0x110b3, 0x110b7, 0x110b9, 0x110bd, 0x110c2, 0x110cd, 0x11100,\r\n 0x11127, 0x1112c, 0x1112d, 0x11145, 0x11173, 0x11180, 0x11182, 0x111b3, 0x111b6, 0x111bf, 0x111c0, 0x111c2,\r\n 0x111c9, 0x111ce, 0x111cf, 0x1122c, 0x1122f, 0x11232, 0x11234, 0x1123e, 0x11241, 0x112df, 0x112e0, 0x112e3,\r\n 0x11300, 0x11302, 0x1133b, 0x1133e, 0x1133f, 0x11340, 0x11341, 0x11347, 0x1134b, 0x1134d, 0x11357, 0x11362,\r\n 0x11366, 0x11370, 0x113b8, 0x113b9, 0x113bb, 0x113c2, 0x113c5, 0x113c7, 0x113ca, 0x113cc, 0x113ce, 0x113d1,\r\n 0x113d2, 0x113e1, 0x11435, 0x11438, 0x11440, 0x11442, 0x11445, 0x11446, 0x1145e, 0x114b0, 0x114b1, 0x114b3,\r\n 0x114b9, 0x114ba, 0x114bb, 0x114bd, 0x114be, 0x114bf, 0x114c1, 0x114c2, 0x115af, 0x115b0, 0x115b2, 0x115b8,\r\n 0x115bc, 0x115be, 0x115bf, 0x115dc, 0x11630, 0x11633, 0x1163b, 0x1163d, 0x1163e, 0x1163f, 0x116ab, 0x116ac,\r\n 0x116ad, 0x116ae, 0x116b0, 0x1171d, 0x1171e, 0x1171f, 0x11722, 0x11726, 0x11727, 0x1182c, 0x1182f, 0x11838,\r\n 0x11839, 0x11930, 0x11931, 0x11937, 0x1193b, 0x1193f, 0x11940, 0x11941, 0x11942, 0x11943, 0x119d1, 0x119d4,\r\n 0x119da, 0x119dc, 0x119e0, 0x119e4, 0x11a01, 0x11a33, 0x11a39, 0x11a3b, 0x11a47, 0x11a51, 0x11a57, 0x11a59,\r\n 0x11a84, 0x11a8a, 0x11a97, 0x11a98, 0x11b60, 0x11b61, 0x11b62, 0x11b65, 0x11b66, 0x11b67, 0x11c2f, 0x11c30,\r\n 0x11c38, 0x11c3e, 0x11c3f, 0x11c92, 0x11ca9, 0x11caa, 0x11cb1, 0x11cb2, 0x11cb4, 0x11cb5, 0x11d31, 0x11d3a,\r\n 0x11d3c, 0x11d3f, 0x11d46, 0x11d47, 0x11d8a, 0x11d90, 0x11d93, 0x11d95, 0x11d96, 0x11d97, 0x11ef3, 0x11ef5,\r\n 0x11f00, 0x11f02, 0x11f03, 0x11f34, 0x11f36, 0x11f3e, 0x11f40, 0x11f5a, 0x13430, 0x13440, 0x13447, 0x1611e,\r\n 0x1612a, 0x1612d, 0x16af0, 0x16b30, 0x16d63, 0x16d67, 0x16f4f, 0x16f51, 0x16f8f, 0x16fe4, 0x16ff0, 0x1bc9d,\r\n 0x1bca0, 0x1cf00, 0x1cf30, 0x1d165, 0x1d16d, 0x1d173, 0x1d17b, 0x1d185, 0x1d1aa, 0x1d242, 0x1da00, 0x1da3b,\r\n 0x1da75, 0x1da84, 0x1da9b, 0x1daa1, 0x1e000, 0x1e008, 0x1e01b, 0x1e023, 0x1e026, 0x1e08f, 0x1e130, 0x1e2ae,\r\n 0x1e2ec, 0x1e4ec, 0x1e5ee, 0x1e6e3, 0x1e6e6, 0x1e6ee, 0x1e6f5, 0x1e8d0, 0x1e944, 0x1f1e6, 0x1f3fb, 0xe0000,\r\n 0xe0020, 0xe0080, 0xe0100, 0xe01f0},\r\n {0x100a, 0x4001, 0x1002, 0x1, 0x1012, 0x1021, 0x1001, 0x2070, 0x2007, 0x202d, 0x2001, 0x2002, 0x2002, 0x2001,\r\n 0x7006, 0x200b, 0x1001, 0x2015, 0x2001, 0x2007, 0x7001, 0x2006, 0x2002, 0x2004, 0x7001, 0x2001, 0x201b, 0x200b,\r\n 0x2009, 0x2001, 0x2004, 0x2009, 0x2003, 0x2005, 0x2003, 0x7002, 0x2009, 0x2018, 0x7001, 0x2020, 0x9001, 0x2001,\r\n 0x9001, 0x2001, 0x9003, 0x2008, 0x9004, 0x2001, 0x9002, 0x2007, 0x2002, 0x2001, 0x9002, 0x2001, 0x2001, 0x9002,\r\n 0x2004, 0x9002, 0x9002, 0x2001, 0x2001, 0x2002, 0x2001, 0x2002, 0x9001, 0x2001, 0x9003, 0x2002, 0x2002, 0x2003,\r\n 0x2001, 0x2002, 0x2001, 0x2002, 0x9001, 0x2001, 0x9003, 0x2005, 0x2002, 0x9001, 0x9002, 0x2001, 0x2002, 0x2006,\r\n 0x2001, 0x9002, 0x2001, 0x2002, 0x9001, 0x2004, 0x9002, 0x9002, 0x2001, 0x2003, 0x2002, 0x2001, 0x2001, 0x9001,\r\n 0x2001, 0x9002, 0x9003, 0x9003, 0x2001, 0x2001, 0x2001, 0x9003, 0x2001, 0x2001, 0x2003, 0x9004, 0x2003, 0x2004,\r\n 0x2002, 0x2002, 0x2001, 0x9002, 0x2001, 0x9001, 0x2002, 0x9001, 0x2001, 0x9002, 0x2003, 0x2004, 0x2002, 0x2002,\r\n 0x9001, 0x2002, 0x9002, 0x2002, 0x2001, 0x9002, 0x2004, 0x9003, 0x9003, 0x2001, 0x7001, 0x2001, 0x2002, 0x2001,\r\n 0x9002, 0x2001, 0x2001, 0x9002, 0x2003, 0x2001, 0x9007, 0x2001, 0x9002, 0x2001, 0x9001, 0x2007, 0x2008, 0x2001,\r\n 0x9001, 0x2009, 0x2007, 0x2002, 0x2001, 0x2001, 0x2001, 0x9002, 0x200e, 0x9001, 0x2005, 0x2002, 0x200b, 0x2024,\r\n 0x2001, 0x2004, 0x9001, 0x2006, 0x2002, 0x9002, 0x2002, 0x9002, 0x2002, 0x2003, 0x2004, 0x2001, 0x9001, 0x2002,\r\n 0x2001, 0x2001, 0x3060, 0xb048, 0xa058, 0x2003, 0x2004, 0x2003, 0x2002, 0x2002, 0x2002, 0x9001, 0x2007, 0x9008,\r\n 0x2001, 0x9002, 0x200b, 0x2001, 0x2003, 0x1001, 0x2001, 0x2002, 0x2001, 0x2003, 0x9004, 0x2002, 0x9003, 0x9002,\r\n 0x2001, 0x9006, 0x2003, 0x2002, 0x9002, 0x2001, 0x9001, 0x2001, 0x9001, 0x2007, 0x2001, 0x2001, 0x2008, 0x9006,\r\n 0x200a, 0x2001, 0x202e, 0x200c, 0x2004, 0x9001, 0x200a, 0x9004, 0x2003, 0x2009, 0x2002, 0x9001, 0x9001, 0x2004,\r\n 0x9002, 0x2006, 0x2001, 0x9001, 0x2002, 0x9003, 0x2001, 0x9001, 0x2005, 0x9008, 0x2008, 0x9002, 0x2002, 0x2003,\r\n 0x200d, 0x9001, 0x2007, 0x2001, 0x2001, 0x9001, 0x2002, 0x2040, 0x1001, 0x2001, 0xc001, 0x1002, 0x1007, 0x1010,\r\n 0x2021, 0x2003, 0x2001, 0x2020, 0x2006, 0x2002, 0x2004, 0x200a, 0x2002, 0x2002, 0x2001, 0x2001, 0x2001, 0x9002,\r\n 0x2002, 0x9001, 0x2001, 0x9002, 0x9010, 0x2002, 0x2012, 0x2001, 0x2008, 0x200b, 0x9001, 0x2001, 0x301d, 0x2003,\r\n 0x9001, 0x2001, 0x9002, 0x2004, 0x9002, 0x2002, 0x9002, 0x2001, 0x2001, 0x2006, 0x9002, 0x2002, 0x9002, 0x2002,\r\n 0x2001, 0x2001, 0x9001, 0x2001, 0x2001, 0x2003, 0x2002, 0x2002, 0x2001, 0x9001, 0x2002, 0x9002, 0x9001, 0x2001,\r\n 0x9002, 0x2001, 0x9002, 0x2001, 0x9002, 0x9001, 0x2001, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001,\r\n 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0x5001, 0x601b, 0xb017, 0xa031, 0x2001, 0x2010, 0x2010, 0x1001, 0x2002,\r\n 0x100c, 0x2001, 0x2001, 0x2005, 0x2003, 0x2002, 0x2004, 0x2003, 0x2001, 0x2002, 0x2004, 0x2005, 0x2002, 0x2006,\r\n 0x200b, 0x2004, 0x9001, 0x2001, 0x9001, 0x200f, 0x2001, 0x2002, 0x2003, 0x9001, 0x9003, 0x2004, 0x9002, 0x2002,\r\n 0x7001, 0x2001, 0x7001, 0x2003, 0x2005, 0x9001, 0x2008, 0x9002, 0x2001, 0x2002, 0x9001, 0x9003, 0x2009, 0x9001,\r\n 0x2001, 0x7002, 0x2004, 0x9001, 0x2001, 0x9003, 0x2003, 0x9002, 0x2004, 0x2001, 0x2001, 0x2001, 0x9003, 0x2008,\r\n 0x2002, 0x9002, 0x2002, 0x2001, 0x9001, 0x2001, 0x9004, 0x9002, 0x9002, 0x2001, 0x2001, 0x9002, 0x2007, 0x2005,\r\n 0x2001, 0x9002, 0x2006, 0x2001, 0x2001, 0x2003, 0x9001, 0x9002, 0x2003, 0x7001, 0x2001, 0x2002, 0x9003, 0x2008,\r\n 0x9002, 0x2003, 0x9001, 0x2001, 0x2001, 0x2001, 0x9002, 0x2006, 0x9001, 0x2001, 0x9002, 0x2001, 0x9001, 0x2002,\r\n 0x9001, 0x2002, 0x2001, 0x9002, 0x2004, 0x9004, 0x2002, 0x9001, 0x2002, 0x2002, 0x9003, 0x2008, 0x9002, 0x2001,\r\n 0x9001, 0x2002, 0x2001, 0x9001, 0x2001, 0x9002, 0x2008, 0x2001, 0x9001, 0x2001, 0x2004, 0x9001, 0x2005, 0x9003,\r\n 0x2009, 0x9001, 0x2002, 0x2001, 0x9005, 0x9002, 0x2004, 0x7001, 0x9001, 0x7001, 0x9001, 0x2001, 0x9003, 0x2004,\r\n 0x2002, 0x9004, 0x2001, 0x9001, 0x200a, 0x2006, 0x9001, 0x2004, 0x2001, 0x2006, 0x9002, 0x2003, 0x7006, 0x200d,\r\n 0x9001, 0x2002, 0x2001, 0x9001, 0x2003, 0x9001, 0x2001, 0x9001, 0x9001, 0x2007, 0x2006, 0x9001, 0x2001, 0x2016,\r\n 0x9001, 0x2007, 0x9001, 0x2002, 0x9001, 0x2002, 0x2006, 0x2001, 0x2002, 0x2007, 0x7001, 0x2001, 0x9005, 0x2002,\r\n 0x9002, 0x2001, 0x9001, 0x2001, 0x2002, 0x9002, 0x2002, 0x7001, 0x9001, 0x9002, 0x2005, 0x9002, 0x2003, 0x2001,\r\n 0x1010, 0x2001, 0x200f, 0x200c, 0x9003, 0x2003, 0x2005, 0x2007, 0xb001, 0xb004, 0x2001, 0x9037, 0x2004, 0x2001,\r\n 0x2002, 0x2002, 0x1004, 0x202e, 0x2017, 0x2005, 0x2006, 0x1008, 0x2008, 0x2007, 0x2004, 0x2003, 0x2037, 0x2032,\r\n 0x2001, 0x2001, 0x2005, 0x200f, 0x2007, 0x2011, 0x2007, 0x2002, 0x2005, 0x2001, 0x2007, 0x2001, 0x2004, 0x2004,\r\n 0x2002, 0x2001, 0x2001, 0x2002, 0x2001, 0x2007, 0x2007, 0x801a, 0x2005, 0x1020, 0x2060, 0x1080, 0x20f0,\r\n 0x1e10}};\r\n\r\n// DerivedCoreProperties-17.0.0.txt\r\n// Date: 2025-07-30, 23:55:08 GMT\r\nenum class _Indic_Conjunct_Break_property_values : uint8_t {\r\n _Consonant_value,\r\n _Extend_value,\r\n _Linker_value,\r\n _No_value = 255\r\n};\r\n\r\n// DerivedCoreProperties-17.0.0.txt\r\n// Date: 2025-07-30, 23:55:08 GMT\r\ninline constexpr _Unicode_property_data<_Indic_Conjunct_Break_property_values, 473, false>\r\n _Indic_Conjunct_Break_property_data{\r\n {0x300, 0x483, 0x591, 0x5bf, 0x5c1, 0x5c4, 0x5c7, 0x610, 0x64b, 0x670, 0x6d6, 0x6df, 0x6e7, 0x6ea, 0x711, 0x730,\r\n 0x7a6, 0x7eb, 0x7fd, 0x816, 0x81b, 0x825, 0x829, 0x859, 0x897, 0x8ca, 0x8e3, 0x915, 0x93a, 0x93c, 0x941,\r\n 0x94d, 0x951, 0x958, 0x962, 0x978, 0x981, 0x995, 0x9aa, 0x9b2, 0x9b6, 0x9bc, 0x9be, 0x9c1, 0x9cd, 0x9d7,\r\n 0x9dc, 0x9df, 0x9e2, 0x9f0, 0x9fe, 0xa01, 0xa3c, 0xa41, 0xa47, 0xa4b, 0xa51, 0xa70, 0xa75, 0xa81, 0xa95,\r\n 0xaaa, 0xab2, 0xab5, 0xabc, 0xac1, 0xac7, 0xacd, 0xae2, 0xaf9, 0xafa, 0xb01, 0xb15, 0xb2a, 0xb32, 0xb35,\r\n 0xb3c, 0xb3e, 0xb41, 0xb4d, 0xb55, 0xb5c, 0xb5f, 0xb62, 0xb71, 0xb82, 0xbbe, 0xbc0, 0xbcd, 0xbd7, 0xc00,\r\n 0xc04, 0xc15, 0xc2a, 0xc3c, 0xc3e, 0xc46, 0xc4a, 0xc4d, 0xc55, 0xc58, 0xc62, 0xc81, 0xcbc, 0xcbf, 0xcc2,\r\n 0xcc6, 0xcca, 0xcd5, 0xce2, 0xd00, 0xd15, 0xd3b, 0xd3e, 0xd41, 0xd4d, 0xd57, 0xd62, 0xd81, 0xdca, 0xdcf,\r\n 0xdd2, 0xdd6, 0xddf, 0xe31, 0xe34, 0xe47, 0xeb1, 0xeb4, 0xec8, 0xf18, 0xf35, 0xf37, 0xf39, 0xf71, 0xf80,\r\n 0xf86, 0xf8d, 0xf99, 0xfc6, 0x1000, 0x102d, 0x1032, 0x1039, 0x103a, 0x103d, 0x103f, 0x1050, 0x1058, 0x105a,\r\n 0x105e, 0x1061, 0x1065, 0x106e, 0x1071, 0x1075, 0x1082, 0x1085, 0x108d, 0x108e, 0x109d, 0x135d, 0x1712,\r\n 0x1732, 0x1752, 0x1772, 0x1780, 0x17b4, 0x17b7, 0x17c6, 0x17c9, 0x17d2, 0x17d3, 0x17dd, 0x180b, 0x180f,\r\n 0x1885, 0x18a9, 0x1920, 0x1927, 0x1932, 0x1939, 0x1a17, 0x1a1b, 0x1a20, 0x1a56, 0x1a58, 0x1a60, 0x1a62,\r\n 0x1a65, 0x1a73, 0x1a7f, 0x1ab0, 0x1ae0, 0x1b00, 0x1b0b, 0x1b13, 0x1b34, 0x1b42, 0x1b44, 0x1b45, 0x1b6b,\r\n 0x1b80, 0x1b83, 0x1ba2, 0x1ba8, 0x1bab, 0x1bac, 0x1bae, 0x1bbb, 0x1be6, 0x1be8, 0x1bed, 0x1bef, 0x1c2c,\r\n 0x1c36, 0x1cd0, 0x1cd4, 0x1ce2, 0x1ced, 0x1cf4, 0x1cf8, 0x1dc0, 0x200d, 0x20d0, 0x2cef, 0x2d7f, 0x2de0,\r\n 0x302a, 0x3099, 0xa66f, 0xa674, 0xa69e, 0xa6f0, 0xa802, 0xa806, 0xa80b, 0xa825, 0xa82c, 0xa8c4, 0xa8e0,\r\n 0xa8ff, 0xa926, 0xa947, 0xa953, 0xa980, 0xa989, 0xa98f, 0xa9b3, 0xa9b6, 0xa9bc, 0xa9c0, 0xa9e0, 0xa9e5,\r\n 0xa9e7, 0xa9fa, 0xaa29, 0xaa31, 0xaa35, 0xaa43, 0xaa4c, 0xaa60, 0xaa71, 0xaa7a, 0xaa7c, 0xaa7e, 0xaab0,\r\n 0xaab2, 0xaab7, 0xaabe, 0xaac1, 0xaae0, 0xaaec, 0xaaf6, 0xabc0, 0xabe5, 0xabe8, 0xabed, 0xfb1e, 0xfe00,\r\n 0xfe20, 0xff9e, 0x101fd, 0x102e0, 0x10376, 0x10a00, 0x10a01, 0x10a05, 0x10a0c, 0x10a10, 0x10a15, 0x10a19,\r\n 0x10a38, 0x10a3f, 0x10ae5, 0x10d24, 0x10d69, 0x10eab, 0x10efa, 0x10f46, 0x10f82, 0x11001, 0x11038, 0x11070,\r\n 0x11073, 0x1107f, 0x110b3, 0x110b9, 0x110c2, 0x11100, 0x11103, 0x11127, 0x1112d, 0x11133, 0x11134, 0x11144,\r\n 0x11147, 0x11173, 0x11180, 0x111b6, 0x111c0, 0x111c9, 0x111cf, 0x1122f, 0x11234, 0x1123e, 0x11241, 0x112df,\r\n 0x112e3, 0x11300, 0x1133b, 0x1133e, 0x11340, 0x1134d, 0x11357, 0x11366, 0x11370, 0x11380, 0x1138b, 0x1138e,\r\n 0x11390, 0x113b8, 0x113bb, 0x113c2, 0x113c5, 0x113c7, 0x113ce, 0x113d0, 0x113d2, 0x113e1, 0x11438, 0x11442,\r\n 0x11446, 0x1145e, 0x114b0, 0x114b3, 0x114ba, 0x114bd, 0x114bf, 0x114c2, 0x115af, 0x115b2, 0x115bc, 0x115bf,\r\n 0x115dc, 0x11633, 0x1163d, 0x1163f, 0x116ab, 0x116ad, 0x116b0, 0x1171d, 0x1171f, 0x11722, 0x11727, 0x1182f,\r\n 0x11839, 0x11900, 0x11909, 0x1190c, 0x11915, 0x11918, 0x11930, 0x1193b, 0x1193e, 0x11943, 0x119d4, 0x119da,\r\n 0x119e0, 0x11a00, 0x11a01, 0x11a0b, 0x11a33, 0x11a3b, 0x11a47, 0x11a50, 0x11a51, 0x11a59, 0x11a5c, 0x11a8a,\r\n 0x11a98, 0x11a99, 0x11b60, 0x11b62, 0x11b66, 0x11c30, 0x11c38, 0x11c3f, 0x11c92, 0x11caa, 0x11cb2, 0x11cb5,\r\n 0x11d31, 0x11d3a, 0x11d3c, 0x11d3f, 0x11d47, 0x11d90, 0x11d95, 0x11d97, 0x11ef3, 0x11f00, 0x11f04, 0x11f12,\r\n 0x11f36, 0x11f40, 0x11f42, 0x11f5a, 0x13440, 0x13447, 0x1611e, 0x1612d, 0x16af0, 0x16b30, 0x16f4f, 0x16f8f,\r\n 0x16fe4, 0x16ff0, 0x1bc9d, 0x1cf00, 0x1cf30, 0x1d165, 0x1d16d, 0x1d17b, 0x1d185, 0x1d1aa, 0x1d242, 0x1da00,\r\n 0x1da3b, 0x1da75, 0x1da84, 0x1da9b, 0x1daa1, 0x1e000, 0x1e008, 0x1e01b, 0x1e023, 0x1e026, 0x1e08f, 0x1e130,\r\n 0x1e2ae, 0x1e2ec, 0x1e4ec, 0x1e5ee, 0x1e6e3, 0x1e6e6, 0x1e6ee, 0x1e6f5, 0x1e8d0, 0x1e944, 0x1f3fb, 0xe0020,\r\n 0xe0100},\r\n {0x1070, 0x1007, 0x102d, 0x1001, 0x1002, 0x1002, 0x1001, 0x100b, 0x1015, 0x1001, 0x1007, 0x1006, 0x1002, 0x1004,\r\n 0x1001, 0x101b, 0x100b, 0x1009, 0x1001, 0x1004, 0x1009, 0x1003, 0x1005, 0x1003, 0x1009, 0x1018, 0x1020,\r\n 0x25, 0x1001, 0x1001, 0x1008, 0x2001, 0x1007, 0x8, 0x1002, 0x8, 0x1001, 0x14, 0x7, 0x1, 0x4, 0x1001, 0x1001,\r\n 0x1004, 0x2001, 0x1001, 0x2, 0x1, 0x1002, 0x2, 0x1001, 0x1002, 0x1001, 0x1002, 0x1002, 0x1003, 0x1001,\r\n 0x1002, 0x1001, 0x1002, 0x14, 0x7, 0x2, 0x5, 0x1001, 0x1005, 0x1002, 0x2001, 0x1002, 0x1, 0x1006, 0x1001,\r\n 0x14, 0x7, 0x2, 0x5, 0x1001, 0x1002, 0x1004, 0x2001, 0x1003, 0x2, 0x1, 0x1002, 0x1, 0x1001, 0x1001, 0x1001,\r\n 0x1001, 0x1001, 0x1001, 0x1001, 0x14, 0x10, 0x1001, 0x1003, 0x1003, 0x1003, 0x2001, 0x1002, 0x3, 0x1002,\r\n 0x1001, 0x1001, 0x1002, 0x1001, 0x1003, 0x1004, 0x1002, 0x1002, 0x1002, 0x26, 0x1002, 0x1001, 0x1004,\r\n 0x2001, 0x1001, 0x1002, 0x1001, 0x1001, 0x1001, 0x1003, 0x1001, 0x1001, 0x1001, 0x1007, 0x1008, 0x1001,\r\n 0x1009, 0x1007, 0x1002, 0x1001, 0x1001, 0x1001, 0x100e, 0x1005, 0x1002, 0x100b, 0x1024, 0x1001, 0x2b,\r\n 0x1004, 0x1006, 0x2001, 0x1001, 0x1002, 0x1, 0x6, 0x1002, 0x4, 0x1003, 0x1, 0x2, 0x3, 0x1004, 0xd, 0x1001,\r\n 0x1002, 0x1001, 0x1, 0x1001, 0x1003, 0x1004, 0x1003, 0x1002, 0x1002, 0x34, 0x1002, 0x1007, 0x1001, 0x1009,\r\n 0x2001, 0x1001, 0x1001, 0x1003, 0x1001, 0x1002, 0x1001, 0x1003, 0x1002, 0x1001, 0x1003, 0x1002, 0x1001,\r\n 0x35, 0x1001, 0x1007, 0x2001, 0x1001, 0x1008, 0x100a, 0x1001, 0x102e, 0x100c, 0x1004, 0x2, 0x21, 0x100a,\r\n 0x1002, 0x2001, 0x8, 0x1009, 0x1002, 0x1e, 0x1004, 0x1003, 0x2001, 0x1002, 0x2, 0x3, 0x1001, 0x1002, 0x1001,\r\n 0x1005, 0x1008, 0x1002, 0x1003, 0x100d, 0x1007, 0x1001, 0x1001, 0x1002, 0x1040, 0x1001, 0x1021, 0x1003,\r\n 0x1001, 0x1020, 0x1006, 0x1002, 0x1004, 0x100a, 0x1002, 0x1002, 0x1001, 0x1001, 0x1001, 0x1002, 0x1001,\r\n 0x1002, 0x1012, 0x1001, 0x1008, 0x100b, 0x1001, 0x1003, 0x3, 0x24, 0x1001, 0x1004, 0x1002, 0x2001, 0x5,\r\n 0x1001, 0x9, 0x5, 0x1006, 0x1002, 0x1002, 0x1001, 0x1001, 0x10, 0x3, 0x1, 0x1001, 0x2, 0x1001, 0x1003,\r\n 0x1002, 0x1002, 0x1001, 0xb, 0x1002, 0x2001, 0x1b, 0x1001, 0x1001, 0x1001, 0x1001, 0x1010, 0x1010, 0x1002,\r\n 0x1001, 0x1001, 0x1005, 0x1, 0x1003, 0x1002, 0x1004, 0x4, 0x3, 0x1d, 0x1003, 0x2001, 0x1002, 0x1004, 0x1005,\r\n 0x1002, 0x1006, 0x100b, 0x1004, 0x1001, 0x100f, 0x1001, 0x1002, 0x1003, 0x1004, 0x1002, 0x1001, 0x1003,\r\n 0x24, 0x1005, 0x1006, 0x2001, 0x1001, 0x1, 0x1, 0x1001, 0x1002, 0x1009, 0x1001, 0x1004, 0x1001, 0x1003,\r\n 0x1004, 0x1001, 0x1001, 0x1001, 0x1008, 0x1002, 0x1002, 0x1001, 0x1001, 0x1001, 0x1001, 0x1007, 0x1005, 0xa,\r\n 0x1, 0x1, 0x26, 0x1001, 0x1006, 0x1001, 0x1001, 0x1003, 0x1002, 0x2001, 0x1001, 0x1002, 0x1008, 0x1003,\r\n 0x1001, 0x1001, 0x1001, 0x1006, 0x1001, 0x1001, 0x1002, 0x1002, 0x1001, 0x1004, 0x1002, 0x1002, 0x1002,\r\n 0x1008, 0x1001, 0x1002, 0x1001, 0x1001, 0x1008, 0x1001, 0x1001, 0x1004, 0x1005, 0x1009, 0x1002, 0x7, 0x1,\r\n 0x8, 0x2, 0x18, 0x1001, 0x1003, 0x2001, 0x1001, 0x1004, 0x1002, 0x1001, 0x1, 0x100a, 0x28, 0x1006, 0x1004,\r\n 0x2001, 0x1, 0x1006, 0x1003, 0x28, 0x100d, 0x1001, 0x2001, 0x1001, 0x1003, 0x1001, 0x1007, 0x1006, 0x1001,\r\n 0x1016, 0x1007, 0x1002, 0x1002, 0x1006, 0x1001, 0x1002, 0x1007, 0x1001, 0x1002, 0x1001, 0x1001, 0x1002,\r\n 0x1002, 0xd, 0x22, 0x1005, 0x1002, 0x2001, 0x1001, 0x1001, 0x100f, 0x100c, 0x1003, 0x1005, 0x1007, 0x1001,\r\n 0x1004, 0x1001, 0x1002, 0x1002, 0x102e, 0x1017, 0x1005, 0x1006, 0x1008, 0x1007, 0x1004, 0x1003, 0x1037,\r\n 0x1032, 0x1001, 0x1001, 0x1005, 0x100f, 0x1007, 0x1011, 0x1007, 0x1002, 0x1005, 0x1001, 0x1007, 0x1001,\r\n 0x1004, 0x1004, 0x1002, 0x1001, 0x1001, 0x1002, 0x1001, 0x1007, 0x1007, 0x1005, 0x1060, 0x10f0}};\r\n\r\n// emoji-data.txt\r\n// Date: 2025-07-25, 17:54:31 GMT\r\nenum class _Extended_Pictographic_property_values : uint8_t { _Extended_Pictographic_value, _No_value = 255 };\r\n\r\n// emoji-data.txt\r\n// Date: 2025-07-25, 17:54:31 GMT\r\ninline constexpr _Unicode_property_data<_Extended_Pictographic_property_values, 156, true>\r\n _Extended_Pictographic_property_data{\r\n {0xa9, 0xae, 0x203c, 0x2049, 0x2122, 0x2139, 0x2194, 0x21a9, 0x231a, 0x2328, 0x23cf, 0x23e9, 0x23f8, 0x24c2,\r\n 0x25aa, 0x25b6, 0x25c0, 0x25fb, 0x2600, 0x260e, 0x2611, 0x2614, 0x2618, 0x261d, 0x2620, 0x2622, 0x2626,\r\n 0x262a, 0x262e, 0x2638, 0x2640, 0x2642, 0x2648, 0x265f, 0x2663, 0x2665, 0x2668, 0x267b, 0x267e, 0x2692,\r\n 0x2699, 0x269b, 0x26a0, 0x26a7, 0x26aa, 0x26b0, 0x26bd, 0x26c4, 0x26c8, 0x26ce, 0x26d1, 0x26d3, 0x26e9,\r\n 0x26f0, 0x26f7, 0x26fd, 0x2702, 0x2705, 0x2708, 0x270f, 0x2712, 0x2714, 0x2716, 0x271d, 0x2721, 0x2728,\r\n 0x2733, 0x2744, 0x2747, 0x274c, 0x274e, 0x2753, 0x2757, 0x2763, 0x2795, 0x27a1, 0x27b0, 0x27bf, 0x2934,\r\n 0x2b05, 0x2b1b, 0x2b50, 0x2b55, 0x3030, 0x303d, 0x3297, 0x3299, 0x1f004, 0x1f02c, 0x1f094, 0x1f0af, 0x1f0c0,\r\n 0x1f0cf, 0x1f0f6, 0x1f170, 0x1f17e, 0x1f18e, 0x1f191, 0x1f1ae, 0x1f201, 0x1f21a, 0x1f22f, 0x1f232, 0x1f23c,\r\n 0x1f249, 0x1f266, 0x1f324, 0x1f396, 0x1f399, 0x1f39e, 0x1f3f3, 0x1f3f7, 0x1f400, 0x1f4ff, 0x1f549, 0x1f550,\r\n 0x1f56f, 0x1f573, 0x1f587, 0x1f58a, 0x1f590, 0x1f595, 0x1f5a4, 0x1f5a8, 0x1f5b1, 0x1f5bc, 0x1f5c2, 0x1f5d1,\r\n 0x1f5dc, 0x1f5e1, 0x1f5e3, 0x1f5e8, 0x1f5ef, 0x1f5f3, 0x1f5fa, 0x1f680, 0x1f6cb, 0x1f6d5, 0x1f6e9, 0x1f6eb,\r\n 0x1f6f3, 0x1f7da, 0x1f80c, 0x1f848, 0x1f85a, 0x1f888, 0x1f8ae, 0x1f8bc, 0x1f8c2, 0x1f8d9, 0x1f90c, 0x1f93c,\r\n 0x1f947, 0x1fa58, 0x1fa6e, 0x1fc00},\r\n {0x1, 0x1, 0x1, 0x1, 0x1, 0x1, 0x6, 0x2, 0x2, 0x1, 0x1, 0xb, 0x3, 0x1, 0x2, 0x1, 0x1, 0x4, 0x5, 0x1, 0x1, 0x2,\r\n 0x1, 0x1, 0x1, 0x2, 0x1, 0x1, 0x2, 0x3, 0x1, 0x1, 0xc, 0x2, 0x1, 0x2, 0x1, 0x1, 0x2, 0x6, 0x1, 0x2, 0x2,\r\n 0x1, 0x2, 0x2, 0x2, 0x2, 0x1, 0x2, 0x1, 0x2, 0x2, 0x6, 0x4, 0x1, 0x1, 0x1, 0x6, 0x1, 0x1, 0x1, 0x1, 0x1,\r\n 0x1, 0x1, 0x2, 0x1, 0x1, 0x1, 0x1, 0x3, 0x1, 0x2, 0x3, 0x1, 0x1, 0x1, 0x2, 0x3, 0x2, 0x1, 0x1, 0x1, 0x1,\r\n 0x1, 0x1, 0x1, 0x4, 0xc, 0x2, 0x1, 0x2, 0xa, 0x2, 0x2, 0x1, 0xa, 0x38, 0xf, 0x1, 0x1, 0x9, 0x4, 0x17, 0xbc,\r\n 0x70, 0x2, 0x3, 0x53, 0x3, 0x4, 0xfe, 0x3f, 0x6, 0x18, 0x2, 0x8, 0x1, 0x4, 0x1, 0x2, 0x2, 0x1, 0x2, 0x1,\r\n 0x3, 0x3, 0x3, 0x1, 0x1, 0x1, 0x1, 0x1, 0x56, 0x46, 0x8, 0x11, 0x1, 0x6, 0xd, 0x26, 0x4, 0x8, 0x6, 0x8, 0x2,\r\n 0x4, 0xe, 0x27, 0x2f, 0xa, 0xb9, 0x8, 0x92, 0x3fe}};\r\n\r\n// DerivedGeneralCategory-17.0.0.txt\r\n// Date: 2025-07-24, 00:12:50 GMT\r\nenum class __printable_property_values : uint8_t { _Yes_value, _No_value = 255 };\r\n\r\n// DerivedGeneralCategory-17.0.0.txt\r\n// Date: 2025-07-24, 00:12:50 GMT\r\ninline constexpr _Unicode_property_data<__printable_property_values, 741, true> __printable_property_data{\r\n {0x20, 0xa1, 0xae, 0x37a, 0x384, 0x38c, 0x38e, 0x3a3, 0x531, 0x559, 0x58d, 0x591, 0x5d0, 0x5ef, 0x606, 0x61d, 0x6de,\r\n 0x710, 0x74d, 0x7c0, 0x7fd, 0x830, 0x840, 0x85e, 0x860, 0x870, 0x897, 0x8e3, 0x985, 0x98f, 0x993, 0x9aa, 0x9b2,\r\n 0x9b6, 0x9bc, 0x9c7, 0x9cb, 0x9d7, 0x9dc, 0x9df, 0x9e6, 0xa01, 0xa05, 0xa0f, 0xa13, 0xa2a, 0xa32, 0xa35, 0xa38,\r\n 0xa3c, 0xa3e, 0xa47, 0xa4b, 0xa51, 0xa59, 0xa5e, 0xa66, 0xa81, 0xa85, 0xa8f, 0xa93, 0xaaa, 0xab2, 0xab5, 0xabc,\r\n 0xac7, 0xacb, 0xad0, 0xae0, 0xae6, 0xaf9, 0xb01, 0xb05, 0xb0f, 0xb13, 0xb2a, 0xb32, 0xb35, 0xb3c, 0xb47, 0xb4b,\r\n 0xb55, 0xb5c, 0xb5f, 0xb66, 0xb82, 0xb85, 0xb8e, 0xb92, 0xb99, 0xb9c, 0xb9e, 0xba3, 0xba8, 0xbae, 0xbbe, 0xbc6,\r\n 0xbca, 0xbd0, 0xbd7, 0xbe6, 0xc00, 0xc0e, 0xc12, 0xc2a, 0xc3c, 0xc46, 0xc4a, 0xc55, 0xc58, 0xc5c, 0xc60, 0xc66,\r\n 0xc77, 0xc8e, 0xc92, 0xcaa, 0xcb5, 0xcbc, 0xcc6, 0xcca, 0xcd5, 0xcdc, 0xce0, 0xce6, 0xcf1, 0xd00, 0xd0e, 0xd12,\r\n 0xd46, 0xd4a, 0xd54, 0xd66, 0xd81, 0xd85, 0xd9a, 0xdb3, 0xdbd, 0xdc0, 0xdca, 0xdcf, 0xdd6, 0xdd8, 0xde6, 0xdf2,\r\n 0xe01, 0xe3f, 0xe81, 0xe84, 0xe86, 0xe8c, 0xea5, 0xea7, 0xec0, 0xec6, 0xec8, 0xed0, 0xedc, 0xf00, 0xf49, 0xf71,\r\n 0xf99, 0xfbe, 0xfce, 0x1000, 0x10c7, 0x10cd, 0x10d0, 0x124a, 0x1250, 0x1258, 0x125a, 0x1260, 0x128a, 0x1290,\r\n 0x12b2, 0x12b8, 0x12c0, 0x12c2, 0x12c8, 0x12d8, 0x1312, 0x1318, 0x135d, 0x1380, 0x13a0, 0x13f8, 0x1400, 0x1681,\r\n 0x16a0, 0x1700, 0x171f, 0x1740, 0x1760, 0x176e, 0x1772, 0x1780, 0x17e0, 0x17f0, 0x1800, 0x180f, 0x1820, 0x1880,\r\n 0x18b0, 0x1900, 0x1920, 0x1930, 0x1940, 0x1944, 0x1970, 0x1980, 0x19b0, 0x19d0, 0x19de, 0x1a1e, 0x1a60, 0x1a7f,\r\n 0x1a90, 0x1aa0, 0x1ab0, 0x1ae0, 0x1b00, 0x1b4e, 0x1bfc, 0x1c3b, 0x1c4d, 0x1c90, 0x1cbd, 0x1cd0, 0x1d00, 0x1f18,\r\n 0x1f20, 0x1f48, 0x1f50, 0x1f59, 0x1f5b, 0x1f5d, 0x1f5f, 0x1f80, 0x1fb6, 0x1fc6, 0x1fd6, 0x1fdd, 0x1ff2, 0x1ff6,\r\n 0x2010, 0x2030, 0x2070, 0x2074, 0x2090, 0x20a0, 0x20d0, 0x2100, 0x2190, 0x2440, 0x2460, 0x2b76, 0x2cf9, 0x2d27,\r\n 0x2d2d, 0x2d30, 0x2d6f, 0x2d7f, 0x2da0, 0x2da8, 0x2db0, 0x2db8, 0x2dc0, 0x2dc8, 0x2dd0, 0x2dd8, 0x2de0, 0x2e80,\r\n 0x2e9b, 0x2f00, 0x2ff0, 0x3001, 0x3041, 0x3099, 0x3105, 0x3131, 0x3190, 0x31ef, 0x3220, 0xa490, 0xa4d0, 0xa640,\r\n 0xa700, 0xa7f1, 0xa830, 0xa840, 0xa880, 0xa8ce, 0xa8e0, 0xa95f, 0xa980, 0xa9cf, 0xa9de, 0xaa00, 0xaa40, 0xaa50,\r\n 0xaa5c, 0xaadb, 0xab01, 0xab09, 0xab11, 0xab20, 0xab28, 0xab30, 0xab70, 0xabf0, 0xac00, 0xd7b0, 0xd7cb, 0xf900,\r\n 0xfa70, 0xfb00, 0xfb13, 0xfb1d, 0xfb38, 0xfb3e, 0xfb40, 0xfb43, 0xfb46, 0xfdf0, 0xfe20, 0xfe54, 0xfe68, 0xfe70,\r\n 0xfe76, 0xff01, 0xffc2, 0xffca, 0xffd2, 0xffda, 0xffe0, 0xffe8, 0xfffc, 0x10000, 0x1000d, 0x10028, 0x1003c,\r\n 0x1003f, 0x10050, 0x10080, 0x10100, 0x10107, 0x10137, 0x10190, 0x101a0, 0x101d0, 0x10280, 0x102a0, 0x102e0,\r\n 0x10300, 0x1032d, 0x10350, 0x10380, 0x1039f, 0x103c8, 0x10400, 0x104a0, 0x104b0, 0x104d8, 0x10500, 0x10530,\r\n 0x1056f, 0x1057c, 0x1058c, 0x10594, 0x10597, 0x105a3, 0x105b3, 0x105bb, 0x105c0, 0x10600, 0x10740, 0x10760,\r\n 0x10780, 0x10787, 0x107b2, 0x10800, 0x10808, 0x1080a, 0x10837, 0x1083c, 0x1083f, 0x10857, 0x108a7, 0x108e0,\r\n 0x108f4, 0x108fb, 0x1091f, 0x1093f, 0x10980, 0x109bc, 0x109d2, 0x10a05, 0x10a0c, 0x10a15, 0x10a19, 0x10a38,\r\n 0x10a3f, 0x10a50, 0x10a60, 0x10ac0, 0x10aeb, 0x10b00, 0x10b39, 0x10b58, 0x10b78, 0x10b99, 0x10ba9, 0x10c00,\r\n 0x10c80, 0x10cc0, 0x10cfa, 0x10d30, 0x10d40, 0x10d69, 0x10d8e, 0x10e60, 0x10e80, 0x10eab, 0x10eb0, 0x10ec2,\r\n 0x10ed0, 0x10efa, 0x10f30, 0x10f70, 0x10fb0, 0x10fe0, 0x11000, 0x11052, 0x1107f, 0x110be, 0x110d0, 0x110f0,\r\n 0x11100, 0x11136, 0x11150, 0x11180, 0x111e1, 0x11200, 0x11213, 0x11280, 0x11288, 0x1128a, 0x1128f, 0x1129f,\r\n 0x112b0, 0x112f0, 0x11300, 0x11305, 0x1130f, 0x11313, 0x1132a, 0x11332, 0x11335, 0x1133b, 0x11347, 0x1134b,\r\n 0x11350, 0x11357, 0x1135d, 0x11366, 0x11370, 0x11380, 0x1138b, 0x1138e, 0x11390, 0x113b7, 0x113c2, 0x113c5,\r\n 0x113c7, 0x113cc, 0x113d7, 0x113e1, 0x11400, 0x1145d, 0x11480, 0x114d0, 0x11580, 0x115b8, 0x11600, 0x11650,\r\n 0x11660, 0x11680, 0x116c0, 0x116d0, 0x11700, 0x1171d, 0x11730, 0x11800, 0x118a0, 0x118ff, 0x11909, 0x1190c,\r\n 0x11915, 0x11918, 0x11937, 0x1193b, 0x11950, 0x119a0, 0x119aa, 0x119da, 0x11a00, 0x11a50, 0x11ab0, 0x11b00,\r\n 0x11b60, 0x11bc0, 0x11bf0, 0x11c00, 0x11c0a, 0x11c38, 0x11c50, 0x11c70, 0x11c92, 0x11ca9, 0x11d00, 0x11d08,\r\n 0x11d0b, 0x11d3a, 0x11d3c, 0x11d3f, 0x11d50, 0x11d60, 0x11d67, 0x11d6a, 0x11d90, 0x11d93, 0x11da0, 0x11db0,\r\n 0x11de0, 0x11ee0, 0x11f00, 0x11f12, 0x11f3e, 0x11fb0, 0x11fc0, 0x11fff, 0x12400, 0x12470, 0x12480, 0x12f90,\r\n 0x13000, 0x13440, 0x13460, 0x14400, 0x16100, 0x16800, 0x16a40, 0x16a60, 0x16a6e, 0x16ac0, 0x16ad0, 0x16af0,\r\n 0x16b00, 0x16b50, 0x16b5b, 0x16b63, 0x16b7d, 0x16d40, 0x16e40, 0x16ea0, 0x16ebb, 0x16f00, 0x16f4f, 0x16f8f,\r\n 0x16fe0, 0x16ff0, 0x17000, 0x18cff, 0x18d80, 0x1aff0, 0x1aff5, 0x1affd, 0x1b000, 0x1b132, 0x1b150, 0x1b155,\r\n 0x1b164, 0x1b170, 0x1bc00, 0x1bc70, 0x1bc80, 0x1bc90, 0x1bc9c, 0x1cc00, 0x1cd00, 0x1ceba, 0x1cee0, 0x1cf00,\r\n 0x1cf30, 0x1cf50, 0x1d000, 0x1d100, 0x1d129, 0x1d17b, 0x1d200, 0x1d2c0, 0x1d2e0, 0x1d300, 0x1d360, 0x1d400,\r\n 0x1d456, 0x1d49e, 0x1d4a2, 0x1d4a5, 0x1d4a9, 0x1d4ae, 0x1d4bb, 0x1d4bd, 0x1d4c5, 0x1d507, 0x1d50d, 0x1d516,\r\n 0x1d51e, 0x1d53b, 0x1d540, 0x1d546, 0x1d54a, 0x1d552, 0x1d6a8, 0x1d7ce, 0x1da9b, 0x1daa1, 0x1df00, 0x1df25,\r\n 0x1e000, 0x1e008, 0x1e01b, 0x1e023, 0x1e026, 0x1e030, 0x1e08f, 0x1e100, 0x1e130, 0x1e140, 0x1e14e, 0x1e290,\r\n 0x1e2c0, 0x1e2ff, 0x1e4d0, 0x1e5d0, 0x1e5ff, 0x1e6c0, 0x1e6e0, 0x1e6fe, 0x1e7e0, 0x1e7e8, 0x1e7ed, 0x1e7f0,\r\n 0x1e800, 0x1e8c7, 0x1e900, 0x1e950, 0x1e95e, 0x1ec71, 0x1ed01, 0x1ee00, 0x1ee05, 0x1ee21, 0x1ee24, 0x1ee27,\r\n 0x1ee29, 0x1ee34, 0x1ee39, 0x1ee3b, 0x1ee42, 0x1ee47, 0x1ee49, 0x1ee4b, 0x1ee4d, 0x1ee51, 0x1ee54, 0x1ee57,\r\n 0x1ee59, 0x1ee5b, 0x1ee5d, 0x1ee5f, 0x1ee61, 0x1ee64, 0x1ee67, 0x1ee6c, 0x1ee74, 0x1ee79, 0x1ee7e, 0x1ee80,\r\n 0x1ee8b, 0x1eea1, 0x1eea5, 0x1eeab, 0x1eef0, 0x1f000, 0x1f030, 0x1f0a0, 0x1f0b1, 0x1f0c1, 0x1f0d1, 0x1f100,\r\n 0x1f1e6, 0x1f210, 0x1f240, 0x1f250, 0x1f260, 0x1f300, 0x1f6dc, 0x1f6f0, 0x1f700, 0x1f7e0, 0x1f7f0, 0x1f800,\r\n 0x1f810, 0x1f850, 0x1f860, 0x1f890, 0x1f8b0, 0x1f8c0, 0x1f8d0, 0x1f900, 0x1fa60, 0x1fa70, 0x1fa80, 0x1fa8e,\r\n 0x1fac8, 0x1facd, 0x1fadf, 0x1faef, 0x1fb00, 0x1fb94, 0x20000, 0x2a700, 0x2b820, 0x2ceb0, 0x2ebf0, 0x2f800,\r\n 0x30000, 0x31350, 0xe0100},\r\n {0x5f, 0xc, 0x2ca, 0x6, 0x7, 0x1, 0x14, 0x18d, 0x26, 0x32, 0x3, 0x37, 0x1b, 0x6, 0x16, 0xc0, 0x30, 0x3b, 0x65, 0x3b,\r\n 0x31, 0xf, 0x1c, 0x1, 0xb, 0x20, 0x4b, 0xa1, 0x8, 0x2, 0x16, 0x7, 0x1, 0x4, 0x9, 0x2, 0x4, 0x1, 0x2, 0x5, 0x19,\r\n 0x3, 0x6, 0x2, 0x16, 0x7, 0x2, 0x2, 0x2, 0x1, 0x5, 0x2, 0x3, 0x1, 0x4, 0x1, 0x11, 0x3, 0x9, 0x3, 0x16, 0x7, 0x2,\r\n 0x5, 0xa, 0x3, 0x3, 0x1, 0x4, 0xc, 0x7, 0x3, 0x8, 0x2, 0x16, 0x7, 0x2, 0x5, 0x9, 0x2, 0x3, 0x3, 0x2, 0x5, 0x12,\r\n 0x2, 0x6, 0x3, 0x4, 0x2, 0x1, 0x2, 0x2, 0x3, 0xc, 0x5, 0x3, 0x4, 0x1, 0x1, 0x15, 0xd, 0x3, 0x17, 0x10, 0x9, 0x3,\r\n 0x4, 0x2, 0x3, 0x2, 0x4, 0xa, 0x16, 0x3, 0x17, 0xa, 0x5, 0x9, 0x3, 0x4, 0x2, 0x3, 0x4, 0xa, 0x3, 0xd, 0x3, 0x33,\r\n 0x3, 0x6, 0x10, 0x1a, 0x3, 0x12, 0x18, 0x9, 0x1, 0x7, 0x1, 0x6, 0x1, 0x8, 0xa, 0x3, 0x3a, 0x1d, 0x2, 0x1, 0x5,\r\n 0x18, 0x1, 0x17, 0x5, 0x1, 0x7, 0xa, 0x4, 0x48, 0x24, 0x27, 0x24, 0xf, 0xd, 0xc6, 0x1, 0x1, 0x179, 0x4, 0x7,\r\n 0x1, 0x4, 0x29, 0x4, 0x21, 0x4, 0x7, 0x1, 0x4, 0xf, 0x39, 0x4, 0x43, 0x20, 0x1a, 0x56, 0x6, 0x280, 0x1c, 0x59,\r\n 0x16, 0x18, 0x14, 0xd, 0x3, 0x2, 0x5e, 0xa, 0xa, 0xe, 0xb, 0x59, 0x2b, 0x46, 0x1f, 0xc, 0xc, 0x1, 0x2a, 0x5,\r\n 0x2c, 0x1a, 0xb, 0x3e, 0x41, 0x1d, 0xb, 0xa, 0xe, 0x2e, 0xc, 0x4d, 0xa6, 0x3c, 0xf, 0x3e, 0x2b, 0xb, 0x2b,\r\n 0x216, 0x6, 0x26, 0x6, 0x8, 0x1, 0x1, 0x1, 0x1f, 0x35, 0xf, 0xe, 0x6, 0x13, 0x3, 0x9, 0x18, 0x2f, 0x2, 0x1b,\r\n 0xd, 0x22, 0x21, 0x8c, 0x29a, 0xb, 0x714, 0x17e, 0x2d, 0x1, 0x1, 0x38, 0x2, 0x18, 0x7, 0x7, 0x7, 0x7, 0x7, 0x7,\r\n 0x7, 0x7, 0x7e, 0x1a, 0x59, 0xd6, 0x10, 0x3f, 0x56, 0x67, 0x2b, 0x5e, 0x56, 0x30, 0x726d, 0x37, 0x15c, 0xb8,\r\n 0xdd, 0x3c, 0xa, 0x38, 0x46, 0xc, 0x74, 0x1e, 0x4e, 0xb, 0x21, 0x37, 0xe, 0xa, 0x67, 0x1c, 0x6, 0x6, 0x6, 0x7,\r\n 0x7, 0x3c, 0x7e, 0xa, 0x2ba4, 0x17, 0x31, 0x16e, 0x6a, 0x7, 0x5, 0x1a, 0x5, 0x1, 0x2, 0x2, 0x28a, 0x2a, 0x33,\r\n 0x13, 0x4, 0x5, 0x87, 0xbe, 0x6, 0x6, 0x6, 0x3, 0x7, 0x7, 0x2, 0xc, 0x1a, 0x13, 0x2, 0xf, 0xe, 0x7b, 0x3, 0x2d,\r\n 0x58, 0xd, 0x1, 0x2e, 0x1d, 0x31, 0x1c, 0x24, 0x1e, 0x2b, 0x1e, 0x25, 0xe, 0x9e, 0xa, 0x24, 0x24, 0x28, 0x34,\r\n 0xc, 0xf, 0x7, 0x2, 0xb, 0xf, 0x7, 0x2, 0x34, 0x137, 0x16, 0x8, 0x6, 0x2a, 0x9, 0x6, 0x1, 0x2c, 0x2, 0x1, 0x17,\r\n 0x48, 0x9, 0x13, 0x2, 0x21, 0x1b, 0x1b, 0x38, 0x14, 0x32, 0x2, 0x8, 0x3, 0x1d, 0x3, 0xa, 0x9, 0x40, 0x27, 0xc,\r\n 0x36, 0x1d, 0x1b, 0x1a, 0x4, 0x7, 0x49, 0x33, 0x33, 0x2e, 0xa, 0x26, 0x1d, 0x2, 0x1f, 0x2a, 0x3, 0x2, 0x6, 0x9,\r\n 0x2e, 0x2a, 0x1a, 0x1c, 0x17, 0x4e, 0x24, 0x3e, 0x5, 0x19, 0xa, 0x35, 0x12, 0x27, 0x60, 0x14, 0x12, 0x2f, 0x7,\r\n 0x1, 0x4, 0xf, 0xb, 0x3b, 0xa, 0x4, 0x8, 0x2, 0x16, 0x7, 0x2, 0x5, 0xa, 0x2, 0x3, 0x1, 0x1, 0x7, 0x7, 0x5, 0xa,\r\n 0x1, 0x1, 0x26, 0xa, 0x1, 0x1, 0x4, 0xa, 0x2, 0x2, 0x5c, 0x5, 0x48, 0xa, 0x36, 0x26, 0x45, 0xa, 0xd, 0x3a, 0xa,\r\n 0x14, 0x1b, 0xf, 0x17, 0x3c, 0x53, 0x8, 0x1, 0x8, 0x2, 0x1e, 0x2, 0xc, 0xa, 0x8, 0x2e, 0xb, 0x48, 0x53, 0x49,\r\n 0xa, 0x8, 0x22, 0xa, 0x9, 0x2d, 0xe, 0x1d, 0x20, 0x16, 0xe, 0x7, 0x2, 0x2c, 0x1, 0x2, 0x9, 0xa, 0x6, 0x2, 0x25,\r\n 0x2, 0x6, 0xa, 0x2c, 0xa, 0x19, 0x11, 0x29, 0x1d, 0x1, 0x32, 0x39b, 0x6f, 0x5, 0xc4, 0x63, 0x430, 0x16, 0xf9b,\r\n 0x247, 0x3a, 0x239, 0x1f, 0xa, 0x51, 0xa, 0x1e, 0x6, 0x46, 0xa, 0x7, 0x15, 0x13, 0x3a, 0x5b, 0x19, 0x19, 0x4b,\r\n 0x39, 0x11, 0x5, 0x7, 0x1cd6, 0x20, 0x73, 0x4, 0x7, 0x2, 0x123, 0x1, 0x3, 0x1, 0x4, 0x18c, 0x6b, 0xd, 0x9, 0xa,\r\n 0x4, 0xfd, 0x1b4, 0x17, 0x11, 0x2e, 0x17, 0x74, 0xf6, 0x27, 0x4a, 0x70, 0x46, 0x14, 0x14, 0x57, 0x19, 0x55,\r\n 0x47, 0x2, 0x1, 0x2, 0x4, 0xc, 0x1, 0x7, 0x41, 0x4, 0x8, 0x7, 0x1c, 0x4, 0x5, 0x1, 0x7, 0x154, 0x124, 0x2be,\r\n 0x5, 0xf, 0x1f, 0x6, 0x7, 0x11, 0x7, 0x2, 0x5, 0x3e, 0x1, 0x2d, 0xe, 0xa, 0x2, 0x1f, 0x3a, 0x1, 0x2a, 0x2b, 0x1,\r\n 0x1f, 0x16, 0x2, 0x7, 0x4, 0x2, 0xf, 0xc5, 0x10, 0x4c, 0xa, 0x2, 0x44, 0x3d, 0x4, 0x1b, 0x2, 0x1, 0x1, 0xa, 0x4,\r\n 0x1, 0x1, 0x1, 0x1, 0x1, 0x1, 0x3, 0x2, 0x1, 0x1, 0x1, 0x1, 0x1, 0x1, 0x2, 0x1, 0x4, 0x7, 0x4, 0x4, 0x1, 0xa,\r\n 0x11, 0x3, 0x5, 0x11, 0x2, 0x2c, 0x64, 0xf, 0xf, 0xf, 0x25, 0xae, 0x1d, 0x2c, 0x9, 0x2, 0x6, 0x3d9, 0x11, 0xd,\r\n 0xda, 0xc, 0x1, 0xc, 0x38, 0xa, 0x28, 0x1e, 0xc, 0x2, 0x9, 0x158, 0xe, 0xd, 0xb, 0x39, 0x1, 0x10, 0xc, 0xa,\r\n 0x93, 0x67, 0xa6e0, 0x111e, 0x168e, 0x1d31, 0x26e, 0x21e, 0x134b, 0x212a, 0xf0}};\r\n\r\n// DerivedCoreProperties-17.0.0.txt\r\n// Date: 2025-07-30, 23:55:08 GMT\r\nenum class _Grapheme_Extend_property_values : uint8_t { _Grapheme_Extend_value, _No_value = 255 };\r\n\r\n// DerivedCoreProperties-17.0.0.txt\r\n// Date: 2025-07-30, 23:55:08 GMT\r\ninline constexpr _Unicode_property_data<_Grapheme_Extend_property_values, 383, true> _Grapheme_Extend_property_data{\r\n {0x300, 0x483, 0x591, 0x5bf, 0x5c1, 0x5c4, 0x5c7, 0x610, 0x64b, 0x670, 0x6d6, 0x6df, 0x6e7, 0x6ea, 0x711, 0x730,\r\n 0x7a6, 0x7eb, 0x7fd, 0x816, 0x81b, 0x825, 0x829, 0x859, 0x897, 0x8ca, 0x8e3, 0x93a, 0x93c, 0x941, 0x94d, 0x951,\r\n 0x962, 0x981, 0x9bc, 0x9be, 0x9c1, 0x9cd, 0x9d7, 0x9e2, 0x9fe, 0xa01, 0xa3c, 0xa41, 0xa47, 0xa4b, 0xa51, 0xa70,\r\n 0xa75, 0xa81, 0xabc, 0xac1, 0xac7, 0xacd, 0xae2, 0xafa, 0xb01, 0xb3c, 0xb3e, 0xb41, 0xb4d, 0xb55, 0xb62, 0xb82,\r\n 0xbbe, 0xbc0, 0xbcd, 0xbd7, 0xc00, 0xc04, 0xc3c, 0xc3e, 0xc46, 0xc4a, 0xc55, 0xc62, 0xc81, 0xcbc, 0xcbf, 0xcc2,\r\n 0xcc6, 0xcca, 0xcd5, 0xce2, 0xd00, 0xd3b, 0xd3e, 0xd41, 0xd4d, 0xd57, 0xd62, 0xd81, 0xdca, 0xdcf, 0xdd2, 0xdd6,\r\n 0xddf, 0xe31, 0xe34, 0xe47, 0xeb1, 0xeb4, 0xec8, 0xf18, 0xf35, 0xf37, 0xf39, 0xf71, 0xf80, 0xf86, 0xf8d, 0xf99,\r\n 0xfc6, 0x102d, 0x1032, 0x1039, 0x103d, 0x1058, 0x105e, 0x1071, 0x1082, 0x1085, 0x108d, 0x109d, 0x135d, 0x1712,\r\n 0x1732, 0x1752, 0x1772, 0x17b4, 0x17b7, 0x17c6, 0x17c9, 0x17dd, 0x180b, 0x180f, 0x1885, 0x18a9, 0x1920, 0x1927,\r\n 0x1932, 0x1939, 0x1a17, 0x1a1b, 0x1a56, 0x1a58, 0x1a60, 0x1a62, 0x1a65, 0x1a73, 0x1a7f, 0x1ab0, 0x1ae0, 0x1b00,\r\n 0x1b34, 0x1b42, 0x1b6b, 0x1b80, 0x1ba2, 0x1ba8, 0x1be6, 0x1be8, 0x1bed, 0x1bef, 0x1c2c, 0x1c36, 0x1cd0, 0x1cd4,\r\n 0x1ce2, 0x1ced, 0x1cf4, 0x1cf8, 0x1dc0, 0x200c, 0x20d0, 0x2cef, 0x2d7f, 0x2de0, 0x302a, 0x3099, 0xa66f, 0xa674,\r\n 0xa69e, 0xa6f0, 0xa802, 0xa806, 0xa80b, 0xa825, 0xa82c, 0xa8c4, 0xa8e0, 0xa8ff, 0xa926, 0xa947, 0xa953, 0xa980,\r\n 0xa9b3, 0xa9b6, 0xa9bc, 0xa9c0, 0xa9e5, 0xaa29, 0xaa31, 0xaa35, 0xaa43, 0xaa4c, 0xaa7c, 0xaab0, 0xaab2, 0xaab7,\r\n 0xaabe, 0xaac1, 0xaaec, 0xaaf6, 0xabe5, 0xabe8, 0xabed, 0xfb1e, 0xfe00, 0xfe20, 0xff9e, 0x101fd, 0x102e0,\r\n 0x10376, 0x10a01, 0x10a05, 0x10a0c, 0x10a38, 0x10a3f, 0x10ae5, 0x10d24, 0x10d69, 0x10eab, 0x10efa, 0x10f46,\r\n 0x10f82, 0x11001, 0x11038, 0x11070, 0x11073, 0x1107f, 0x110b3, 0x110b9, 0x110c2, 0x11100, 0x11127, 0x1112d,\r\n 0x11173, 0x11180, 0x111b6, 0x111c0, 0x111c9, 0x111cf, 0x1122f, 0x11234, 0x1123e, 0x11241, 0x112df, 0x112e3,\r\n 0x11300, 0x1133b, 0x1133e, 0x11340, 0x1134d, 0x11357, 0x11366, 0x11370, 0x113b8, 0x113bb, 0x113c2, 0x113c5,\r\n 0x113c7, 0x113ce, 0x113d2, 0x113e1, 0x11438, 0x11442, 0x11446, 0x1145e, 0x114b0, 0x114b3, 0x114ba, 0x114bd,\r\n 0x114bf, 0x114c2, 0x115af, 0x115b2, 0x115bc, 0x115bf, 0x115dc, 0x11633, 0x1163d, 0x1163f, 0x116ab, 0x116ad,\r\n 0x116b0, 0x1171d, 0x1171f, 0x11722, 0x11727, 0x1182f, 0x11839, 0x11930, 0x1193b, 0x11943, 0x119d4, 0x119da,\r\n 0x119e0, 0x11a01, 0x11a33, 0x11a3b, 0x11a47, 0x11a51, 0x11a59, 0x11a8a, 0x11a98, 0x11b60, 0x11b62, 0x11b66,\r\n 0x11c30, 0x11c38, 0x11c3f, 0x11c92, 0x11caa, 0x11cb2, 0x11cb5, 0x11d31, 0x11d3a, 0x11d3c, 0x11d3f, 0x11d47,\r\n 0x11d90, 0x11d95, 0x11d97, 0x11ef3, 0x11f00, 0x11f36, 0x11f40, 0x11f5a, 0x13440, 0x13447, 0x1611e, 0x1612d,\r\n 0x16af0, 0x16b30, 0x16f4f, 0x16f8f, 0x16fe4, 0x16ff0, 0x1bc9d, 0x1cf00, 0x1cf30, 0x1d165, 0x1d16d, 0x1d17b,\r\n 0x1d185, 0x1d1aa, 0x1d242, 0x1da00, 0x1da3b, 0x1da75, 0x1da84, 0x1da9b, 0x1daa1, 0x1e000, 0x1e008, 0x1e01b,\r\n 0x1e023, 0x1e026, 0x1e08f, 0x1e130, 0x1e2ae, 0x1e2ec, 0x1e4ec, 0x1e5ee, 0x1e6e3, 0x1e6e6, 0x1e6ee, 0x1e6f5,\r\n 0x1e8d0, 0x1e944, 0xe0020, 0xe0100},\r\n {0x70, 0x7, 0x2d, 0x1, 0x2, 0x2, 0x1, 0xb, 0x15, 0x1, 0x7, 0x6, 0x2, 0x4, 0x1, 0x1b, 0xb, 0x9, 0x1, 0x4, 0x9, 0x3,\r\n 0x5, 0x3, 0x9, 0x18, 0x20, 0x1, 0x1, 0x8, 0x1, 0x7, 0x2, 0x1, 0x1, 0x1, 0x4, 0x1, 0x1, 0x2, 0x1, 0x2, 0x1, 0x2,\r\n 0x2, 0x3, 0x1, 0x2, 0x1, 0x2, 0x1, 0x5, 0x2, 0x1, 0x2, 0x6, 0x1, 0x1, 0x2, 0x4, 0x1, 0x3, 0x2, 0x1, 0x1, 0x1,\r\n 0x1, 0x1, 0x1, 0x1, 0x1, 0x3, 0x3, 0x4, 0x2, 0x2, 0x1, 0x1, 0x2, 0x1, 0x3, 0x4, 0x2, 0x2, 0x2, 0x2, 0x1, 0x4,\r\n 0x1, 0x1, 0x2, 0x1, 0x1, 0x1, 0x3, 0x1, 0x1, 0x1, 0x7, 0x8, 0x1, 0x9, 0x7, 0x2, 0x1, 0x1, 0x1, 0xe, 0x5, 0x2,\r\n 0xb, 0x24, 0x1, 0x4, 0x6, 0x2, 0x2, 0x2, 0x3, 0x4, 0x1, 0x2, 0x1, 0x1, 0x3, 0x4, 0x3, 0x2, 0x2, 0x2, 0x7, 0x1,\r\n 0xb, 0x1, 0x3, 0x1, 0x2, 0x1, 0x3, 0x2, 0x1, 0x3, 0x2, 0x1, 0x1, 0x7, 0x1, 0x1, 0x8, 0xa, 0x1, 0x2e, 0xc, 0x4,\r\n 0xa, 0x3, 0x9, 0x2, 0x4, 0x6, 0x1, 0x2, 0x1, 0x5, 0x8, 0x2, 0x3, 0xd, 0x7, 0x1, 0x1, 0x2, 0x40, 0x1, 0x21, 0x3,\r\n 0x1, 0x20, 0x6, 0x2, 0x4, 0xa, 0x2, 0x2, 0x1, 0x1, 0x1, 0x2, 0x1, 0x2, 0x12, 0x1, 0x8, 0xb, 0x1, 0x3, 0x1, 0x4,\r\n 0x2, 0x1, 0x1, 0x6, 0x2, 0x2, 0x1, 0x1, 0x1, 0x1, 0x3, 0x2, 0x2, 0x1, 0x2, 0x1, 0x1, 0x1, 0x1, 0x1, 0x10, 0x10,\r\n 0x2, 0x1, 0x1, 0x5, 0x3, 0x2, 0x4, 0x3, 0x1, 0x2, 0x4, 0x5, 0x2, 0x6, 0xb, 0x4, 0x1, 0xf, 0x1, 0x2, 0x3, 0x4,\r\n 0x2, 0x1, 0x3, 0x5, 0x8, 0x1, 0x2, 0x9, 0x1, 0x4, 0x1, 0x3, 0x4, 0x1, 0x1, 0x1, 0x8, 0x2, 0x2, 0x1, 0x1, 0x1,\r\n 0x1, 0x7, 0x5, 0x1, 0x6, 0x1, 0x1, 0x3, 0x3, 0x1, 0x2, 0x8, 0x3, 0x1, 0x1, 0x1, 0x6, 0x1, 0x1, 0x2, 0x2, 0x1,\r\n 0x4, 0x2, 0x2, 0x2, 0x8, 0x1, 0x2, 0x1, 0x1, 0x8, 0x1, 0x1, 0x4, 0x5, 0x9, 0x2, 0x1, 0x4, 0x1, 0x4, 0x2, 0x1,\r\n 0xa, 0x6, 0x4, 0x1, 0x6, 0x3, 0xd, 0x2, 0x1, 0x3, 0x1, 0x7, 0x6, 0x1, 0x16, 0x7, 0x2, 0x2, 0x6, 0x1, 0x2, 0x7,\r\n 0x1, 0x2, 0x1, 0x1, 0x2, 0x2, 0x5, 0x3, 0x1, 0x1, 0xf, 0xc, 0x3, 0x5, 0x7, 0x1, 0x4, 0x1, 0x2, 0x2, 0x2e, 0x17,\r\n 0x5, 0x6, 0x8, 0x7, 0x4, 0x3, 0x37, 0x32, 0x1, 0x1, 0x5, 0xf, 0x7, 0x11, 0x7, 0x2, 0x5, 0x1, 0x7, 0x1, 0x4, 0x4,\r\n 0x2, 0x1, 0x1, 0x2, 0x1, 0x7, 0x7, 0x60, 0xf0}};\r\n\r\n// EastAsianWidth-17.0.0.txt\r\n// Date: 2025-07-24, 00:12:54 GMT\r\ninline constexpr char32_t _Width_estimate_intervals_v2[] = {0x1100, 0x1160, 0x231a, 0x231c, 0x2329, 0x232b, 0x23e9,\r\n 0x23ed, 0x23f0, 0x23f1, 0x23f3, 0x23f4, 0x25fd, 0x25ff, 0x2614, 0x2616, 0x2630, 0x2638, 0x2648, 0x2654, 0x267f,\r\n 0x2680, 0x268a, 0x2690, 0x2693, 0x2694, 0x26a1, 0x26a2, 0x26aa, 0x26ac, 0x26bd, 0x26bf, 0x26c4, 0x26c6, 0x26ce,\r\n 0x26cf, 0x26d4, 0x26d5, 0x26ea, 0x26eb, 0x26f2, 0x26f4, 0x26f5, 0x26f6, 0x26fa, 0x26fb, 0x26fd, 0x26fe, 0x2705,\r\n 0x2706, 0x270a, 0x270c, 0x2728, 0x2729, 0x274c, 0x274d, 0x274e, 0x274f, 0x2753, 0x2756, 0x2757, 0x2758, 0x2795,\r\n 0x2798, 0x27b0, 0x27b1, 0x27bf, 0x27c0, 0x2b1b, 0x2b1d, 0x2b50, 0x2b51, 0x2b55, 0x2b56, 0x2e80, 0x2e9a, 0x2e9b,\r\n 0x2ef4, 0x2f00, 0x2fd6, 0x2ff0, 0x303f, 0x3041, 0x3097, 0x3099, 0x3100, 0x3105, 0x3130, 0x3131, 0x318f, 0x3190,\r\n 0x31e6, 0x31ef, 0x321f, 0x3220, 0x3248, 0x3250, 0xa48d, 0xa490, 0xa4c7, 0xa960, 0xa97d, 0xac00, 0xd7a4, 0xf900,\r\n 0xfb00, 0xfe10, 0xfe1a, 0xfe30, 0xfe53, 0xfe54, 0xfe67, 0xfe68, 0xfe6c, 0xff01, 0xff61, 0xffe0, 0xffe7, 0x16fe0,\r\n 0x16fe5, 0x16ff0, 0x16ff7, 0x17000, 0x18cd6, 0x18cff, 0x18d1f, 0x18d80, 0x18df3, 0x1aff0, 0x1aff4, 0x1aff5, 0x1affc,\r\n 0x1affd, 0x1afff, 0x1b000, 0x1b123, 0x1b132, 0x1b133, 0x1b150, 0x1b153, 0x1b155, 0x1b156, 0x1b164, 0x1b168, 0x1b170,\r\n 0x1b2fc, 0x1d300, 0x1d357, 0x1d360, 0x1d377, 0x1f004, 0x1f005, 0x1f0cf, 0x1f0d0, 0x1f18e, 0x1f18f, 0x1f191, 0x1f19b,\r\n 0x1f200, 0x1f203, 0x1f210, 0x1f23c, 0x1f240, 0x1f249, 0x1f250, 0x1f252, 0x1f260, 0x1f266, 0x1f300, 0x1f650, 0x1f680,\r\n 0x1f6c6, 0x1f6cc, 0x1f6cd, 0x1f6d0, 0x1f6d3, 0x1f6d5, 0x1f6d9, 0x1f6dc, 0x1f6e0, 0x1f6eb, 0x1f6ed, 0x1f6f4, 0x1f6fd,\r\n 0x1f7e0, 0x1f7ec, 0x1f7f0, 0x1f7f1, 0x1f900, 0x1fa00, 0x1fa70, 0x1fa7d, 0x1fa80, 0x1fa8b, 0x1fa8e, 0x1fac7, 0x1fac8,\r\n 0x1fac9, 0x1facd, 0x1fadd, 0x1fadf, 0x1faeb, 0x1faef, 0x1faf9, 0x20000, 0x2fffe, 0x30000, 0x3fffe};\r\n\r\n_STD_END\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_FORMAT_UCD_TABLES_HPP\r\n" }, { "path": "stl/inc/__msvc_formatter.hpp", "content": "// __msvc_formatter.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n// NOTE:\r\n// The contents of this header are derived in part from libfmt under the following license:\r\n\r\n// Copyright (c) 2012 - present, Victor Zverovich\r\n//\r\n// Permission is hereby granted, free of charge, to any person obtaining\r\n// a copy of this software and associated documentation files (the\r\n// \"Software\"), to deal in the Software without restriction, including\r\n// without limitation the rights to use, copy, modify, merge, publish,\r\n// distribute, sublicense, and/or sell copies of the Software, and to\r\n// permit persons to whom the Software is furnished to do so, subject to\r\n// the following conditions:\r\n//\r\n// The above copyright notice and this permission notice shall be\r\n// included in all copies or substantial portions of the Software.\r\n\r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\r\n// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\r\n// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\r\n// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\r\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n//\r\n// --- Optional exception to the license ---\r\n//\r\n// As an exception, if, as a result of your compiling your source code, portions\r\n// of this Software are embedded into a machine-executable object form of such\r\n// source code, you may redistribute such embedded portions in such object form\r\n// without including the above copyright and permission notices.\r\n\r\n#ifndef __MSVC_FORMATTER_HPP\r\n#define __MSVC_FORMATTER_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n\r\n#if !_HAS_CXX20\r\n#error The contents of are only available with C++20. (Also, you should not include this internal header.)\r\n#endif // !_HAS_CXX20\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#if _HAS_CXX23\r\n#include \r\n#endif // _HAS_CXX23\r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n// TRANSITION, non-_Ugly attribute tokens\r\n#pragma push_macro(\"msvc\")\r\n#pragma push_macro(\"no_specializations\")\r\n#undef msvc\r\n#undef no_specializations\r\n\r\n_STD_BEGIN\r\n#if _HAS_CXX23\r\n#define _FMT_P2286_BEGIN inline namespace __p2286 {\r\n#define _FMT_P2286_END }\r\n#else // ^^^ _HAS_CXX23 / !_HAS_CXX23 vvv\r\n#define _FMT_P2286_BEGIN\r\n#define _FMT_P2286_END\r\n#endif // ^^^ !_HAS_CXX23 ^^^\r\n\r\nenum class _Fmt_align : uint8_t { _None, _Left, _Right, _Center };\r\n\r\nenum class _Fmt_sign : uint8_t { _None, _Plus, _Minus, _Space };\r\n\r\nenum class _Basic_format_arg_type : uint8_t {\r\n _None,\r\n _Int_type,\r\n _UInt_type,\r\n _Long_long_type,\r\n _ULong_long_type,\r\n _Bool_type,\r\n _Char_type,\r\n _Float_type,\r\n _Double_type,\r\n _Long_double_type,\r\n _Pointer_type,\r\n _CString_type,\r\n _String_type,\r\n _Custom_type,\r\n};\r\nstatic_assert(static_cast(_Basic_format_arg_type::_Custom_type) < 16, \"must fit in 4-bit bitfield\");\r\n\r\n#if _HAS_CXX23\r\n_EXPORT_STD template // specializations allowed by N5014 [format.formatter.locking]/1\r\nconstexpr bool enable_nonlocking_formatter_optimization = false;\r\n\r\n_NODISCARD consteval bool _Is_debug_enabled_fmt_type(_Basic_format_arg_type _Ty) {\r\n return _Ty == _Basic_format_arg_type::_Char_type || _Ty == _Basic_format_arg_type::_CString_type\r\n || _Ty == _Basic_format_arg_type::_String_type;\r\n}\r\n#endif // _HAS_CXX23\r\n\r\ntemplate \r\nstruct _Basic_format_specs {\r\n int _Width = 0;\r\n int _Precision = -1;\r\n char _Type = '\\0';\r\n _Fmt_align _Alignment = _Fmt_align::_None;\r\n _Fmt_sign _Sgn = _Fmt_sign::_None;\r\n bool _Alt = false;\r\n bool _Localized = false;\r\n bool _Leading_zero = false;\r\n uint8_t _Fill_length = 1;\r\n // At most one codepoint (so one char32_t or four utf-8 char8_t).\r\n _CharT _Fill[4 / sizeof(_CharT)] = {_CharT{' '}};\r\n};\r\n\r\n// Adds width and precision references to _Basic_format_specs.\r\n// This is required for std::formatter implementations because we must\r\n// parse the format specs without having access to the format args (via a format context).\r\ntemplate \r\nstruct _Dynamic_format_specs : _Basic_format_specs<_CharT> {\r\n int _Dynamic_width_index = -1;\r\n int _Dynamic_precision_index = -1;\r\n};\r\n\r\n[[noreturn]] inline void _Throw_format_error(const char* _Message);\r\n\r\n_EXPORT_STD template \r\nclass _NO_SPECIALIZATIONS_CITING(\"N5014 [format.parse.ctx]/2\") basic_format_parse_context;\r\n\r\ntemplate \r\nconcept _Format_supported_charT = _Is_any_of_v<_CharT, char, wchar_t>;\r\n\r\n_EXPORT_STD template \r\nstruct formatter {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\n_FMT_P2286_BEGIN\r\ntemplate \r\nstruct _Formatter_base {\r\npublic:\r\n#if _HAS_CXX23\r\n constexpr void _Set_debug_format() noexcept\r\n requires (_Is_debug_enabled_fmt_type(_ArgType))\r\n {\r\n _Specs._Type = '?';\r\n }\r\n#endif // _HAS_CXX23\r\n\r\n template >\r\n constexpr _ParseContext::iterator parse(type_identity_t<_ParseContext&> _Parse_ctx); // defined in \r\n\r\n template \r\n _FormatContext::iterator format(const _Ty& _Val, _FormatContext& _Format_ctx) const; // defined in \r\n\r\nprivate:\r\n _Dynamic_format_specs<_CharT> _Specs;\r\n};\r\n_FMT_P2286_END\r\n\r\n#if _HAS_CXX23\r\n#define _FORMAT_SPECIALIZE_NONLOCKING_FOR(_Type) \\\r\n template <> \\\r\n inline constexpr bool enable_nonlocking_formatter_optimization<_Type> = true;\r\n#else // ^^^ _HAS_CXX23 / !_HAS_CXX23 vvv\r\n#define _FORMAT_SPECIALIZE_NONLOCKING_FOR(_Type)\r\n#endif // ^^^ !_HAS_CXX23 ^^^\r\n\r\n#define _FORMAT_SPECIALIZE_FOR(_Type, _ArgType) \\\r\n _FORMAT_SPECIALIZE_NONLOCKING_FOR(_Type) \\\r\n template <_Format_supported_charT _CharT> \\\r\n struct formatter<_Type, _CharT> : _Formatter_base<_Type, _CharT, _ArgType> {}\r\n\r\n_FORMAT_SPECIALIZE_FOR(int, _Basic_format_arg_type::_Int_type);\r\n_FORMAT_SPECIALIZE_FOR(unsigned int, _Basic_format_arg_type::_UInt_type);\r\n_FORMAT_SPECIALIZE_FOR(long long, _Basic_format_arg_type::_Long_long_type);\r\n_FORMAT_SPECIALIZE_FOR(unsigned long long, _Basic_format_arg_type::_ULong_long_type);\r\n_FORMAT_SPECIALIZE_FOR(bool, _Basic_format_arg_type::_Bool_type);\r\n_FORMAT_SPECIALIZE_FOR(float, _Basic_format_arg_type::_Float_type);\r\n_FORMAT_SPECIALIZE_FOR(double, _Basic_format_arg_type::_Double_type);\r\n_FORMAT_SPECIALIZE_FOR(long double, _Basic_format_arg_type::_Long_double_type);\r\n_FORMAT_SPECIALIZE_FOR(nullptr_t, _Basic_format_arg_type::_Pointer_type);\r\n_FORMAT_SPECIALIZE_FOR(void*, _Basic_format_arg_type::_Pointer_type);\r\n_FORMAT_SPECIALIZE_FOR(const void*, _Basic_format_arg_type::_Pointer_type);\r\n_FORMAT_SPECIALIZE_FOR(short, _Basic_format_arg_type::_Int_type);\r\n_FORMAT_SPECIALIZE_FOR(unsigned short, _Basic_format_arg_type::_UInt_type);\r\n_FORMAT_SPECIALIZE_FOR(long, _Basic_format_arg_type::_Int_type);\r\n_FORMAT_SPECIALIZE_FOR(unsigned long, _Basic_format_arg_type::_UInt_type);\r\n_FORMAT_SPECIALIZE_FOR(signed char, _Basic_format_arg_type::_Int_type);\r\n_FORMAT_SPECIALIZE_FOR(unsigned char, _Basic_format_arg_type::_UInt_type);\r\n\r\n#undef _FORMAT_SPECIALIZE_FOR\r\n#undef _FORMAT_SPECIALIZE_NONLOCKING_FOR\r\n\r\n// not using the macro because we'd like to add 'set_debug_format' member function in C++23 mode\r\ntemplate <_Format_supported_charT _CharT>\r\nstruct formatter : _Formatter_base {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\n// not using the macro because we'd like to avoid the formatter specialization\r\ntemplate <>\r\nstruct formatter : _Formatter_base {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n _Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\n// We could use the macro for these specializations, but it's confusing to refer to symbols that are defined\r\n// inside the macro in the macro's \"call\".\r\ntemplate <_Format_supported_charT _CharT>\r\nstruct formatter<_CharT*, _CharT> : _Formatter_base<_CharT*, _CharT, _Basic_format_arg_type::_CString_type> {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\ntemplate <_Format_supported_charT _CharT>\r\nstruct formatter\r\n : _Formatter_base {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\ntemplate <_Format_supported_charT _CharT, size_t _Nx>\r\nstruct formatter<_CharT[_Nx], _CharT> : _Formatter_base<_CharT[_Nx], _CharT, _Basic_format_arg_type::_CString_type> {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\n_EXPORT_STD template \r\nclass basic_string;\r\n\r\n_EXPORT_STD template \r\nclass basic_string_view;\r\n\r\ntemplate <_Format_supported_charT _CharT, class _Traits, class _Allocator>\r\nstruct formatter, _CharT>\r\n : _Formatter_base, _CharT, _Basic_format_arg_type::_String_type> {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\ntemplate <_Format_supported_charT _CharT, class _Traits>\r\nstruct formatter, _CharT>\r\n : _Formatter_base, _CharT, _Basic_format_arg_type::_String_type> {\r\n#if _HAS_CXX23\r\n constexpr void set_debug_format() noexcept {\r\n this->_Set_debug_format();\r\n }\r\n#endif // _HAS_CXX23\r\n};\r\n\r\n#if _HAS_CXX23\r\ntemplate <>\r\nstruct formatter {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\ntemplate <>\r\nstruct formatter {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\ntemplate \r\nstruct formatter {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\ntemplate \r\nstruct formatter, wchar_t> {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\ntemplate \r\nstruct formatter, wchar_t> {\r\n formatter() = delete;\r\n formatter(const formatter&) = delete;\r\n formatter& operator=(const formatter&) = delete;\r\n};\r\n\r\n_EXPORT_STD enum class range_format { disabled, map, set, sequence, string, debug_string };\r\n\r\ntemplate \r\nstruct _Invalid_format_kind {\r\n static_assert(false, \"A program that instantiates the primary template of format_kind is ill-formed. \"\r\n \"(N4981 [format.range.fmtkind]/1)\");\r\n};\r\n\r\n_EXPORT_STD template \r\nconstexpr _Invalid_format_kind<_Ty> format_kind; // specializations allowed by N5014 [format.range.fmtkind]/3\r\n\r\ntemplate \r\nconstexpr bool _Is_two_tuple = false;\r\n\r\ntemplate \r\nconstexpr bool _Is_two_tuple> = true;\r\n\r\ntemplate \r\nconstexpr bool _Is_two_tuple> = true;\r\n\r\ntemplate <_RANGES input_range _Rng>\r\n requires same_as<_Rng, remove_cvref_t<_Rng>>\r\nconstexpr range_format format_kind<_Rng> = []() consteval {\r\n using _Ref_value_t = remove_cvref_t<_RANGES range_reference_t<_Rng>>;\r\n if constexpr (same_as<_Ref_value_t, _Rng>) {\r\n return range_format::disabled;\r\n } else if constexpr (requires { typename _Rng::key_type; }) {\r\n if constexpr (requires { typename _Rng::mapped_type; } && _Is_two_tuple<_Ref_value_t>) {\r\n return range_format::map;\r\n } else {\r\n return range_format::set;\r\n }\r\n } else {\r\n return range_format::sequence;\r\n }\r\n}();\r\n\r\n// Specializations for pairs, tuples, and ranges are forward-declared to avoid any risk of using the disabled primary\r\n// template.\r\n\r\n// Per LWG-3997, `_CharT` in library-provided `formatter` specializations is\r\n// constrained to character types supported by `format`.\r\n\r\ntemplate \r\nconcept _Formatting_enabled_range = format_kind<_Rng> != range_format::disabled;\r\n\r\ntemplate <_RANGES input_range _Rng, _Format_supported_charT _CharT>\r\n requires _Formatting_enabled_range<_Rng>\r\nstruct formatter<_Rng, _CharT>;\r\n\r\ntemplate <_Format_supported_charT _CharT, class _Ty1, class _Ty2>\r\nstruct formatter, _CharT>;\r\n\r\ntemplate <_Format_supported_charT _CharT, class... _Types>\r\nstruct formatter, _CharT>;\r\n\r\ntemplate <_Format_supported_charT _CharT>\r\nconstexpr bool enable_nonlocking_formatter_optimization<_CharT> = true;\r\n\r\ntemplate <_Format_supported_charT _CharT>\r\nconstexpr bool enable_nonlocking_formatter_optimization<_CharT*> = true;\r\n\r\ntemplate <_Format_supported_charT _CharT>\r\nconstexpr bool enable_nonlocking_formatter_optimization = true;\r\n\r\ntemplate <_Format_supported_charT _CharT, size_t _Nx>\r\nconstexpr bool enable_nonlocking_formatter_optimization<_CharT[_Nx]> = true;\r\n\r\ntemplate <_Format_supported_charT _CharT, class _Traits, class _Allocator>\r\nconstexpr bool enable_nonlocking_formatter_optimization> = true;\r\n\r\ntemplate <_Format_supported_charT _CharT, class _Traits>\r\nconstexpr bool enable_nonlocking_formatter_optimization> = true;\r\n\r\ntemplate \r\nconstexpr bool enable_nonlocking_formatter_optimization> =\r\n enable_nonlocking_formatter_optimization>\r\n && enable_nonlocking_formatter_optimization>;\r\n\r\ntemplate \r\nconstexpr bool enable_nonlocking_formatter_optimization> =\r\n (enable_nonlocking_formatter_optimization> && ...);\r\n\r\ntemplate \r\nstruct _Fill_align_and_width_specs {\r\n int _Width = -1;\r\n int _Dynamic_width_index = -1;\r\n _Fmt_align _Alignment = _Fmt_align::_None;\r\n uint8_t _Fill_length = 1;\r\n // At most one codepoint (so one char32_t or four utf-8 char8_t).\r\n _CharT _Fill[4 / sizeof(_CharT)]{' '};\r\n};\r\n\r\ntemplate \r\nstruct _Fill_align_and_width_formatter {\r\npublic:\r\n template > // improves throughput, see GH-5003\r\n _NODISCARD constexpr _ParseContext::iterator _Parse(\r\n type_identity_t<_ParseContext&> _Parse_ctx); // defined in \r\n\r\n template \r\n _NODISCARD _FormatContext::iterator _Format(_FormatContext& _Format_ctx, const int _Width,\r\n _Fmt_align _Default_align,\r\n _Func&& _Fn) const; // defined in \r\n\r\nprivate:\r\n _Fill_align_and_width_specs<_CharT> _Specs;\r\n};\r\n#endif // _HAS_CXX23\r\n_STD_END\r\n\r\n// TRANSITION, non-_Ugly attribute tokens\r\n#pragma pop_macro(\"no_specializations\")\r\n#pragma pop_macro(\"msvc\")\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_FORMATTER_HPP\r\n" }, { "path": "stl/inc/__msvc_heap_algorithms.hpp", "content": "// __msvc_heap_algorithms.hpp internal header\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_HEAP_ALGORITHMS_HPP\r\n#define __MSVC_HEAP_ALGORITHMS_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n\r\n#include \r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n_STD_BEGIN\r\ntemplate \r\n_CONSTEXPR20 void _Push_heap_by_index(\r\n _RanIt _First, _Iter_diff_t<_RanIt> _Hole, _Iter_diff_t<_RanIt> _Top, _Ty&& _Val, _Pr _Pred) {\r\n // percolate _Hole to _Top or where _Val belongs\r\n using _Diff = _Iter_diff_t<_RanIt>;\r\n for (_Diff _Idx = (_Hole - 1) >> 1; // shift for codegen\r\n _Top < _Hole && _DEBUG_LT_PRED(_Pred, *(_First + _Idx), _Val); _Idx = (_Hole - 1) >> 1) { // shift for codegen\r\n // move _Hole up to parent\r\n *(_First + _Hole) = _STD move(*(_First + _Idx));\r\n _Hole = _Idx;\r\n }\r\n\r\n *(_First + _Hole) = _STD forward<_Ty>(_Val); // drop _Val into final hole\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void push_heap(_RanIt _First, _RanIt _Last, _Pr _Pred) {\r\n // push *(_Last - 1) onto heap at [_First, _Last - 1)\r\n _STD _Adl_verify_range(_First, _Last);\r\n const auto _UFirst = _STD _Get_unwrapped(_First);\r\n auto _ULast = _STD _Get_unwrapped(_Last);\r\n using _Diff = _Iter_diff_t<_RanIt>;\r\n _Diff _Count = _ULast - _UFirst;\r\n if (2 <= _Count) {\r\n _Iter_value_t<_RanIt> _Val(_STD move(*--_ULast));\r\n _STD _Push_heap_by_index(_UFirst, --_Count, _Diff(0), _STD move(_Val), _STD _Pass_fn(_Pred));\r\n }\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void push_heap(_RanIt _First, _RanIt _Last) {\r\n // push *(_Last - 1) onto heap at [_First, _Last - 1)\r\n _STD push_heap(_First, _Last, less<>{});\r\n}\r\n\r\ntemplate \r\n_CONSTEXPR20 void _Pop_heap_hole_by_index(\r\n _RanIt _First, _Iter_diff_t<_RanIt> _Hole, _Iter_diff_t<_RanIt> _Bottom, _Ty&& _Val, _Pr _Pred) {\r\n // percolate _Hole to _Bottom, then push _Val\r\n _STL_INTERNAL_CHECK(_Bottom > 0);\r\n\r\n using _Diff = _Iter_diff_t<_RanIt>;\r\n const _Diff _Top = _Hole;\r\n _Diff _Idx = _Hole;\r\n\r\n // Check whether _Idx can have a child before calculating that child's index, since\r\n // calculating the child's index can trigger integer overflows\r\n const _Diff _Max_sequence_non_leaf = (_Bottom - 1) >> 1; // shift for codegen\r\n while (_Idx < _Max_sequence_non_leaf) { // move _Hole down to larger child\r\n _Idx = 2 * _Idx + 2;\r\n if (_DEBUG_LT_PRED(_Pred, *(_First + _Idx), *(_First + (_Idx - 1)))) {\r\n --_Idx;\r\n }\r\n *(_First + _Hole) = _STD move(*(_First + _Idx));\r\n _Hole = _Idx;\r\n }\r\n\r\n if (_Idx == _Max_sequence_non_leaf && _Bottom % 2 == 0) { // only child at bottom, move _Hole down to it\r\n *(_First + _Hole) = _STD move(*(_First + (_Bottom - 1)));\r\n _Hole = _Bottom - 1;\r\n }\r\n\r\n _STD _Push_heap_by_index(_First, _Hole, _Top, _STD forward<_Ty>(_Val), _Pred);\r\n}\r\n\r\ntemplate \r\n_CONSTEXPR20 void _Pop_heap_hole_unchecked(_RanIt _First, _RanIt _Last, _RanIt _Dest, _Ty&& _Val, _Pr _Pred) {\r\n // pop *_First to *_Dest and reheap\r\n // precondition: _First != _Last\r\n // precondition: _First != _Dest\r\n *_Dest = _STD move(*_First);\r\n using _Diff = _Iter_diff_t<_RanIt>;\r\n _STD _Pop_heap_hole_by_index(\r\n _First, static_cast<_Diff>(0), static_cast<_Diff>(_Last - _First), _STD forward<_Ty>(_Val), _Pred);\r\n}\r\n\r\ntemplate \r\n_CONSTEXPR20 void _Pop_heap_unchecked(_RanIt _First, _RanIt _Last, _Pr _Pred) {\r\n // pop *_First to *(_Last - 1) and reheap\r\n if (2 <= _Last - _First) {\r\n --_Last;\r\n _Iter_value_t<_RanIt> _Val(_STD move(*_Last));\r\n _STD _Pop_heap_hole_unchecked(_First, _Last, _Last, _STD move(_Val), _Pred);\r\n }\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void pop_heap(_RanIt _First, _RanIt _Last, _Pr _Pred) {\r\n // pop *_First to *(_Last - 1) and reheap\r\n _STD _Adl_verify_range(_First, _Last);\r\n _STD _Pop_heap_unchecked(_STD _Get_unwrapped(_First), _STD _Get_unwrapped(_Last), _STD _Pass_fn(_Pred));\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void pop_heap(_RanIt _First, _RanIt _Last) {\r\n // pop *_First to *(_Last - 1) and reheap\r\n _STD pop_heap(_First, _Last, less<>{});\r\n}\r\n\r\ntemplate \r\n_CONSTEXPR20 void _Make_heap_unchecked(_RanIt _First, _RanIt _Last, _Pr _Pred) {\r\n // make [_First, _Last) into a heap\r\n using _Diff = _Iter_diff_t<_RanIt>;\r\n _Diff _Bottom = _Last - _First;\r\n for (_Diff _Hole = _Bottom >> 1; _Hole > 0;) { // shift for codegen\r\n // reheap top half, bottom to top\r\n --_Hole;\r\n _Iter_value_t<_RanIt> _Val(_STD move(*(_First + _Hole)));\r\n _STD _Pop_heap_hole_by_index(_First, _Hole, _Bottom, _STD move(_Val), _Pred);\r\n }\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void make_heap(_RanIt _First, _RanIt _Last, _Pr _Pred) { // make [_First, _Last) into a heap\r\n _STD _Adl_verify_range(_First, _Last);\r\n _STD _Make_heap_unchecked(_STD _Get_unwrapped(_First), _STD _Get_unwrapped(_Last), _STD _Pass_fn(_Pred));\r\n}\r\n\r\n_EXPORT_STD template \r\n_CONSTEXPR20 void make_heap(_RanIt _First, _RanIt _Last) { // make [_First, _Last) into a heap\r\n _STD make_heap(_First, _Last, less<>{});\r\n}\r\n_STD_END\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_HEAP_ALGORITHMS_HPP\r\n" }, { "path": "stl/inc/__msvc_int128.hpp", "content": "// __msvc_int128.hpp internal header (core)\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_INT128_HPP\r\n#define __MSVC_INT128_HPP\r\n\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n#include <__msvc_bit_utils.hpp>\r\n#include \r\n#include \r\n#include \r\n\r\n#include _STL_INTRIN_HEADER\r\n\r\n#if _HAS_CXX20\r\n#include \r\n#include \r\n#define _TEMPLATE_CLASS_INTEGRAL(type) template \r\n#define _ZERO_OR_NO_INIT\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\n#define _TEMPLATE_CLASS_INTEGRAL(type) template , int> = 0>\r\n#define _ZERO_OR_NO_INIT \\\r\n { \\\r\n } // Trivial default initialization is not allowed in constexpr functions before C++20.\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n_STD_BEGIN\r\n\r\n#if defined(_M_X64) && !defined(_M_ARM64EC) && !defined(_M_CEE_PURE)\r\n#define _STL_128_INTRINSICS 1\r\n#ifdef __clang__ // clang doesn't have _udiv128 / _div128\r\n#define _STL_128_DIV_INTRINSICS 0\r\n#else // ^^^ Clang / other vvv\r\n#define _STL_128_DIV_INTRINSICS 1\r\n#endif // ^^^ detect _udiv128 / _div128 ^^^\r\n#else // ^^^ intrinsics available / intrinsics unavailable vvv\r\n#define _STL_128_INTRINSICS 0\r\n#define _STL_128_DIV_INTRINSICS 0\r\n#endif // ^^^ intrinsics unavailable ^^^\r\n\r\nstruct alignas(16) _Base128 {\r\n uint64_t _Word[2];\r\n\r\n constexpr void _Left_shift(const unsigned char _Count) noexcept {\r\n // _STL_INTERNAL_CHECK(_Count < 128);\r\n if (_Count == 0) {\r\n return;\r\n }\r\n\r\n if (_Count >= 64) {\r\n _Word[1] = _Word[0] << (_Count % 64);\r\n _Word[0] = 0;\r\n return;\r\n }\r\n\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n _Word[1] = __shiftleft128(_Word[0], _Word[1], _Count);\r\n } else\r\n#endif // _STL_128_INTRINSICS\r\n {\r\n _Word[1] = (_Word[1] << _Count) | (_Word[0] >> (64 - _Count));\r\n }\r\n\r\n _Word[0] <<= _Count;\r\n }\r\n\r\n constexpr void _Unsigned_right_shift(const unsigned char _Count) noexcept {\r\n // _STL_INTERNAL_CHECK(_Count < 128);\r\n if (_Count == 0) {\r\n return;\r\n }\r\n\r\n if (_Count >= 64) {\r\n _Word[0] = _Word[1] >> (_Count % 64);\r\n _Word[1] = 0;\r\n return;\r\n }\r\n\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n _Word[0] = __shiftright128(_Word[0], _Word[1], _Count);\r\n } else\r\n#endif // _STL_128_INTRINSICS\r\n {\r\n _Word[0] = (_Word[0] >> _Count) | (_Word[1] << (64 - _Count));\r\n }\r\n\r\n _Word[1] >>= _Count;\r\n }\r\n\r\n static constexpr unsigned char _AddCarry64(\r\n unsigned char _Carry, uint64_t _Left, uint64_t _Right, uint64_t& _Result) noexcept {\r\n // _STL_INTERNAL_CHECK(_Carry < 2);\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n return _addcarry_u64(_Carry, _Left, _Right, &_Result);\r\n }\r\n#endif // _STL_128_INTRINSICS\r\n\r\n const uint64_t _Sum = _Left + _Right + _Carry;\r\n _Result = _Sum;\r\n return _Carry ? _Sum <= _Left : _Sum < _Left;\r\n }\r\n\r\n static constexpr unsigned char _SubBorrow64(\r\n unsigned char _Carry, uint64_t _Left, uint64_t _Right, uint64_t& _Result) noexcept {\r\n // _STL_INTERNAL_CHECK(_Carry < 2);\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n return _subborrow_u64(_Carry, _Left, _Right, &_Result);\r\n }\r\n#endif // _STL_128_INTRINSICS\r\n\r\n const auto _Difference = _Left - _Right - _Carry;\r\n _Result = _Difference;\r\n return _Carry ? _Difference >= _Left : _Difference > _Left;\r\n }\r\n\r\n template \r\n static constexpr void _Knuth_4_3_1_M(\r\n const uint32_t (&__u)[__m], const uint32_t (&__v)[__n], uint32_t (&__w)[__n + __m]) noexcept {\r\n#ifdef _ENABLE_STL_INTERNAL_CHECK\r\n constexpr auto _Int_max = static_cast(INT_MAX);\r\n _STL_INTERNAL_STATIC_ASSERT(__m <= _Int_max);\r\n _STL_INTERNAL_STATIC_ASSERT(__n <= _Int_max);\r\n#endif // defined(_ENABLE_STL_INTERNAL_CHECK)\r\n\r\n for (auto& _Elem : __w) {\r\n _Elem = 0;\r\n }\r\n\r\n for (int __j = 0; __j < static_cast(__n); ++__j) {\r\n // stash Knuth's `k` in the lower 32 bits of __t\r\n uint64_t __t = 0;\r\n for (int __i = 0; __i < static_cast(__m); ++__i) {\r\n __t += static_cast(__u[__i]) * __v[__j] + __w[__i + __j];\r\n __w[__i + __j] = static_cast(__t);\r\n __t >>= 32;\r\n }\r\n __w[__j + __m] = static_cast(__t);\r\n }\r\n }\r\n\r\n _NODISCARD static constexpr uint64_t _UMul128(\r\n const uint64_t _Left, const uint64_t _Right, uint64_t& _High_result) noexcept {\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n return _umul128(_Left, _Right, &_High_result);\r\n }\r\n#endif // _STL_128_INTRINSICS\r\n\r\n const uint32_t __u[2] = {\r\n static_cast(_Left),\r\n static_cast(_Left >> 32),\r\n };\r\n const uint32_t __v[2] = {\r\n static_cast(_Right),\r\n static_cast(_Right >> 32),\r\n };\r\n uint32_t __w[4] _ZERO_OR_NO_INIT;\r\n\r\n // multiply 2-digit numbers with 4-digit result in base 2^32\r\n _Knuth_4_3_1_M(__u, __v, __w);\r\n\r\n _High_result = (static_cast(__w[3]) << 32) | __w[2];\r\n return (static_cast(__w[1]) << 32) | __w[0];\r\n }\r\n\r\n static constexpr void _Knuth_4_3_1_D(uint32_t* const __u, const size_t __u_size, const uint32_t* const __v,\r\n const size_t __v_size, uint32_t* const __q) noexcept {\r\n // Pre: __u + [0, __u_size), __v + [0, __v_size), and __q + [0, __u_size - __v_size) are all valid ranges\r\n // constexpr auto _Int_max = static_cast(INT_MAX);\r\n // _STL_INTERNAL_CHECK(__v_size <= _Int_max);\r\n const int __n = static_cast(__v_size);\r\n // _STL_INTERNAL_CHECK(__u_size > __v_size);\r\n // _STL_INTERNAL_CHECK(__u_size <= _Int_max);\r\n const int __m = static_cast(__u_size - __v_size - 1);\r\n // _STL_INTERNAL_CHECK(__v[__n - 1] >> 31 != 0); // Arguments are already normalized\r\n\r\n for (int __j = __m; __j >= 0; --__j) {\r\n const auto _Two_digits = (static_cast(__u[__j + __n]) << 32) | __u[__j + __n - 1];\r\n auto __qhat = _Two_digits / __v[__n - 1];\r\n auto __rhat = _Two_digits % __v[__n - 1];\r\n\r\n while ((__qhat >> 32) != 0\r\n || static_cast(__qhat) * static_cast(__v[__n - 2])\r\n > ((__rhat << 32) | __u[__j + __n - 2])) {\r\n --__qhat;\r\n __rhat += __v[__n - 1];\r\n if ((__rhat >> 32) != 0) {\r\n break;\r\n }\r\n }\r\n\r\n int64_t __k = 0;\r\n int64_t __t _ZERO_OR_NO_INIT;\r\n for (int __i = 0; __i < __n; ++__i) {\r\n const auto _Prod = static_cast(__qhat) * static_cast(__v[__i]);\r\n __t = __u[__i + __j] - __k - static_cast(_Prod);\r\n __u[__i + __j] = static_cast(__t);\r\n __k = static_cast(_Prod >> 32) - (__t >> 32);\r\n }\r\n __t = __u[__j + __n] - __k;\r\n __u[__j + __n] = static_cast(__t);\r\n\r\n __q[__j] = static_cast(__qhat);\r\n if (__t < 0) {\r\n --__q[__j];\r\n __k = 0;\r\n for (int __i = 0; __i < __n; ++__i) {\r\n __t = __u[__i + __j] + __k + __v[__i];\r\n __u[__i + __j] = static_cast(__t);\r\n __k = __t >> 32;\r\n }\r\n __u[__j + __n] += static_cast(__k);\r\n }\r\n }\r\n\r\n // quotient is in __q, normalized remainder is in __u\r\n }\r\n\r\n _NODISCARD static constexpr uint64_t _UDiv128(\r\n uint64_t _High, uint64_t _Low, uint64_t _Div, uint64_t& _Remainder) noexcept {\r\n // _STL_INTERNAL_CHECK(_High < _Div);\r\n\r\n#if _STL_128_DIV_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n return _udiv128(_High, _Low, _Div, &_Remainder);\r\n }\r\n#endif // _STL_128_DIV_INTRINSICS\r\n\r\n const auto __d = _Countl_zero(static_cast(_Div >> 32));\r\n if (__d >= 32) { // _Div < 2^32\r\n auto _Rem = (_High << 32) | (_Low >> 32);\r\n auto _Result = _Rem / static_cast(_Div);\r\n _Rem = ((_Rem % static_cast(_Div)) << 32) | static_cast(_Low);\r\n _Result = (_Result << 32) | (_Rem / static_cast(_Div));\r\n _Remainder = _Rem % static_cast(_Div);\r\n return _Result;\r\n }\r\n\r\n uint32_t __u[5] = {\r\n static_cast(_Low << __d),\r\n static_cast(_Low >> (32 - __d)),\r\n static_cast(_High << __d),\r\n static_cast(_High >> (32 - __d)),\r\n 0,\r\n };\r\n if (__d != 0) {\r\n __u[2] |= static_cast(_Low >> (64 - __d));\r\n __u[4] |= static_cast(_High >> (64 - __d));\r\n }\r\n\r\n uint32_t __v[2] = {\r\n static_cast(_Div << __d),\r\n static_cast(_Div >> (32 - __d)),\r\n };\r\n uint32_t __q[3] _ZERO_OR_NO_INIT;\r\n\r\n _Knuth_4_3_1_D(__u, 5, __v, 2, __q);\r\n // _STL_INTERNAL_CHECK(__u[4] == 0);\r\n // _STL_INTERNAL_CHECK(__u[3] == 0);\r\n // _STL_INTERNAL_CHECK(__u[2] == 0);\r\n _Remainder = (static_cast(__u[1]) << (32 - __d)) | (__u[0] >> __d);\r\n\r\n // _STL_INTERNAL_CHECK(__q[2] == 0);\r\n return (static_cast(__q[1]) << 32) | __q[0];\r\n }\r\n\r\n constexpr _Base128() noexcept : _Word{} {}\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Base128(const _Ty _Val) noexcept : _Word{static_cast(_Val)} {\r\n#if _HAS_CXX20\r\n if constexpr (signed_integral<_Ty>)\r\n#else\r\n if constexpr (is_signed_v<_Ty>)\r\n#endif\r\n {\r\n if (_Val < 0) {\r\n _Word[1] = ~0ull;\r\n }\r\n }\r\n }\r\n\r\n constexpr explicit _Base128(const uint64_t _Low, const uint64_t _High) noexcept : _Word{_Low, _High} {}\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD constexpr explicit operator _Ty() const noexcept {\r\n return static_cast<_Ty>(_Word[0]);\r\n }\r\n\r\n _NODISCARD constexpr explicit operator bool() const noexcept {\r\n return (_Word[0] | _Word[1]) != 0;\r\n }\r\n\r\n#if _HAS_CXX20\r\n _NODISCARD friend constexpr bool operator==(const _Base128&, const _Base128&) noexcept = default;\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\n _NODISCARD friend constexpr bool operator==(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Left._Word[0] == _Right._Word[0] && _Left._Word[1] == _Right._Word[1];\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator!=(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return !(_Left == _Right);\r\n }\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n _NODISCARD friend constexpr bool operator<(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n if (_Left._Word[1] < _Right._Word[1]) {\r\n return true;\r\n }\r\n\r\n if (_Left._Word[1] > _Right._Word[1]) {\r\n return false;\r\n }\r\n return _Left._Word[0] < _Right._Word[0];\r\n }\r\n _NODISCARD friend constexpr bool operator>(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Right < _Left;\r\n }\r\n _NODISCARD friend constexpr bool operator<=(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return !(_Right < _Left);\r\n }\r\n _NODISCARD friend constexpr bool operator>=(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return !(_Left < _Right);\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Ty operator<<(const _Ty _Left, const _Base128& _Right) noexcept {\r\n return _Left << _Right._Word[0];\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Ty operator>>(const _Ty _Left, const _Base128& _Right) noexcept {\r\n return _Left >> _Right._Word[0];\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Base128& operator<<=(const _Ty _Count) noexcept {\r\n _Left_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator<<=(_Ty& _Left, const _Base128& _Right) noexcept {\r\n _Left <<= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Base128& operator>>=(const _Ty _Count) noexcept {\r\n _Unsigned_right_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator>>=(_Ty& _Left, const _Base128& _Right) noexcept {\r\n _Left >>= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n constexpr _Base128& operator++() noexcept {\r\n if (++_Word[0] == 0) {\r\n ++_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Base128 operator++(int) noexcept {\r\n auto _Tmp = *this;\r\n ++*this;\r\n return _Tmp;\r\n }\r\n\r\n constexpr _Base128& operator--() noexcept {\r\n if (_Word[0]-- == 0) {\r\n --_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Base128 operator--(int) noexcept {\r\n auto _Tmp = *this;\r\n --*this;\r\n return _Tmp;\r\n }\r\n\r\n _NODISCARD static constexpr _Base128 _Multiply(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n _Base128 _Result;\r\n _Result._Word[0] = _UMul128(_Left._Word[0], _Right._Word[0], _Result._Word[1]);\r\n _Result._Word[1] += _Left._Word[0] * _Right._Word[1];\r\n _Result._Word[1] += _Left._Word[1] * _Right._Word[0];\r\n return _Result;\r\n }\r\n\r\n#if !_STL_128_DIV_INTRINSICS\r\n _NODISCARD static constexpr _Base128 _Divide(const _Base128& _Num, const uint32_t _Den) noexcept {\r\n _Base128 _Result;\r\n _Result._Word[1] = _Num._Word[1] / _Den;\r\n uint64_t _Rem = ((_Num._Word[1] % _Den) << 32) | (_Num._Word[0] >> 32);\r\n _Result._Word[0] = (_Rem / _Den) << 32;\r\n _Rem = ((_Rem % _Den) << 32) | static_cast(_Num._Word[0]);\r\n _Result._Word[0] |= static_cast(_Rem / _Den);\r\n return _Result;\r\n }\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n _NODISCARD static constexpr _Base128 _Divide(const _Base128& _Num, const uint64_t _Den) noexcept {\r\n _Base128 _Result;\r\n _Result._Word[1] = _Num._Word[1] / _Den;\r\n uint64_t _Rem _ZERO_OR_NO_INIT;\r\n _Result._Word[0] = _UDiv128(_Num._Word[1] % _Den, _Num._Word[0], _Den, _Rem);\r\n return _Result;\r\n }\r\n _NODISCARD static constexpr _Base128 _Divide(_Base128 _Num, _Base128 _Den) noexcept {\r\n // establish _Den < _Num and _Num._Word[1] > 0\r\n if (_Den._Word[1] >= _Num._Word[1]) {\r\n if (_Den._Word[1] > _Num._Word[1]) {\r\n return 0;\r\n }\r\n\r\n return _Num._Word[1] == 0 ? _Num._Word[0] / _Den._Word[0] : _Num._Word[0] >= _Den._Word[0];\r\n }\r\n\r\n // establish _Den has more than 1 non-zero \"digit\"\r\n if (_Den._Word[1] == 0) {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if (_Den._Word[0] < (1ull << 32)) {\r\n return _Divide(_Num, static_cast(_Den._Word[0]));\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n return _Divide(_Num, _Den._Word[0]);\r\n }\r\n }\r\n\r\n#if _STL_128_INTRINSICS\r\n // Knuth 4.3.1D, 2-digit by 2-digit divide in base 2^64\r\n // _STL_INTERNAL_CHECK(_Den._Word[1] != 0);\r\n // _STL_INTERNAL_CHECK(_Num._Word[1] > _Den._Word[1]);\r\n // Normalize by shifting both left until _Den's high bit is set (So _Den's high digit is >= b / 2)\r\n const auto __d = _Countl_zero(_Den._Word[1]);\r\n _Den <<= __d;\r\n auto _High_digit = __d == 0 ? 0 : _Num._Word[1] >> (64 - __d); // This creates a third digit for _Num\r\n _Num <<= __d;\r\n\r\n _Base128 __qhat;\r\n __qhat._Word[1] = _High_digit >= _Den._Word[1];\r\n uint64_t __rhat _ZERO_OR_NO_INIT;\r\n __qhat._Word[0] = _UDiv128(_High_digit >= _Den._Word[1] ? _High_digit - _Den._Word[1] : _High_digit,\r\n _Num._Word[1], _Den._Word[1], __rhat);\r\n\r\n for (;;) {\r\n if (__qhat._Word[1] > 0) {\r\n --__qhat;\r\n } else {\r\n _Base128 _Prod;\r\n _Prod._Word[0] = _UMul128(__qhat._Word[0], _Den._Word[0], _Prod._Word[1]);\r\n if (_Prod <= _Base128{_Num._Word[0], __rhat}) {\r\n break;\r\n }\r\n --__qhat._Word[0];\r\n }\r\n\r\n const auto _Sum = __rhat + _Den._Word[1];\r\n if (__rhat > _Sum) {\r\n break;\r\n }\r\n __rhat = _Sum;\r\n }\r\n // _STL_INTERNAL_CHECK(__qhat._Word[1] == 0);\r\n\r\n // [_High_digit | _Num] -= __qhat * _Den [Since __qhat < b, this is 3-digit - 1-digit * 2-digit]\r\n uint64_t _Prod0_hi _ZERO_OR_NO_INIT;\r\n uint64_t _Prod_lo = _UMul128(__qhat._Word[0], _Den._Word[0], _Prod0_hi);\r\n auto _Borrow = _SubBorrow64(0, _Num._Word[0], _Prod_lo, _Num._Word[0]);\r\n uint64_t _Prod1_hi _ZERO_OR_NO_INIT;\r\n _Prod_lo = _UMul128(__qhat._Word[0], _Den._Word[1], _Prod1_hi);\r\n _Prod1_hi += _AddCarry64(0, _Prod_lo, _Prod0_hi, _Prod_lo);\r\n _Borrow = _SubBorrow64(_Borrow, _Num._Word[1], _Prod_lo, _Num._Word[1]);\r\n _Borrow = _SubBorrow64(_Borrow, _High_digit, _Prod1_hi, _High_digit);\r\n if (_Borrow) {\r\n --__qhat._Word[0];\r\n }\r\n return __qhat;\r\n#else // ^^^ 128-bit intrinsics / no such intrinsics vvv\r\n auto __d = _Countl_zero(_Den._Word[1]);\r\n const bool _Three_word_den = __d >= 32;\r\n __d &= 31;\r\n uint32_t __u[5]{\r\n static_cast(_Num._Word[0] << __d),\r\n static_cast(_Num._Word[0] >> (32 - __d)),\r\n static_cast(_Num._Word[1] << __d),\r\n static_cast(_Num._Word[1] >> (32 - __d)),\r\n 0,\r\n };\r\n uint32_t __v[4] = {\r\n static_cast(_Den._Word[0] << __d),\r\n static_cast(_Den._Word[0] >> (32 - __d)),\r\n static_cast(_Den._Word[1] << __d),\r\n static_cast(_Den._Word[1] >> (32 - __d)),\r\n };\r\n if (__d != 0) {\r\n __u[2] |= _Num._Word[0] >> (64 - __d);\r\n __u[4] |= _Num._Word[1] >> (64 - __d);\r\n __v[2] |= _Den._Word[0] >> (64 - __d);\r\n }\r\n\r\n uint32_t __q[2] _ZERO_OR_NO_INIT;\r\n if (_Three_word_den) {\r\n // 4-digit by 3-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 3, __q);\r\n } else {\r\n // 4-digit by 4-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 4, __q);\r\n __q[1] = 0;\r\n }\r\n\r\n return (static_cast(__q[1]) << 32) | __q[0];\r\n#endif // _STL_128_INTRINSICS\r\n }\r\n\r\n#if !_STL_128_DIV_INTRINSICS\r\n _NODISCARD static constexpr _Base128 _Modulo(const _Base128& _Num, const uint32_t _Den) noexcept {\r\n uint64_t _Rem = _Num._Word[1];\r\n _Rem = ((_Rem % _Den) << 32) | (_Num._Word[0] >> 32);\r\n _Rem = ((_Rem % _Den) << 32) | static_cast(_Num._Word[0]);\r\n return _Rem % _Den;\r\n }\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n _NODISCARD static constexpr _Base128 _Modulo(const _Base128& _Num, const uint64_t _Den) noexcept {\r\n uint64_t _Rem _ZERO_OR_NO_INIT;\r\n (void) _UDiv128(_Num._Word[1] % _Den, _Num._Word[0], _Den, _Rem);\r\n return _Rem;\r\n }\r\n _NODISCARD static constexpr _Base128 _Modulo(_Base128 _Num, _Base128 _Den) noexcept {\r\n // establish _Den < _Num and _Num._Word[1] > 0\r\n if (_Den._Word[1] >= _Num._Word[1]) {\r\n if (_Den._Word[1] > _Num._Word[1]) {\r\n return _Num;\r\n }\r\n\r\n if (_Den._Word[0] <= _Num._Word[0]) {\r\n return _Num._Word[1] == 0 ? _Num._Word[0] % _Den._Word[0] : _Num._Word[0] - _Den._Word[0];\r\n }\r\n\r\n return _Num;\r\n }\r\n\r\n // establish _Den has more than 1 non-zero \"digit\"\r\n if (_Den._Word[1] == 0) {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if (_Den._Word[0] < (1ull << 32)) {\r\n return _Modulo(_Num, static_cast(_Den._Word[0]));\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n return _Modulo(_Num, _Den._Word[0]);\r\n }\r\n }\r\n\r\n#if _STL_128_INTRINSICS\r\n // Knuth 4.3.1D, 2-digit by 2-digit divide in base 2^64\r\n // _STL_INTERNAL_CHECK(_Den._Word[1] != 0);\r\n // _STL_INTERNAL_CHECK(_Num._Word[1] > _Den._Word[1]);\r\n // Normalize by shifting both left until _Den's high bit is set (So _Den's high digit is >= b / 2)\r\n const auto __d = _Countl_zero(_Den._Word[1]);\r\n _Den <<= __d;\r\n auto _High_digit = __d == 0 ? 0 : _Num._Word[1] >> (64 - __d); // This creates a third digit for _Num\r\n _Num <<= __d;\r\n\r\n uint64_t __qhat_high = _High_digit >= _Den._Word[1];\r\n uint64_t __rhat _ZERO_OR_NO_INIT;\r\n uint64_t __qhat = _UDiv128(_High_digit >= _Den._Word[1] ? _High_digit - _Den._Word[1] : _High_digit,\r\n _Num._Word[1], _Den._Word[1], __rhat);\r\n\r\n for (;;) {\r\n if (__qhat_high > 0) {\r\n if (__qhat-- == 0) {\r\n --__qhat_high;\r\n }\r\n } else {\r\n _Base128 _Prod;\r\n _Prod._Word[0] = _UMul128(__qhat, _Den._Word[0], _Prod._Word[1]);\r\n if (_Prod <= _Base128{_Num._Word[0], __rhat}) {\r\n break;\r\n }\r\n --__qhat;\r\n }\r\n\r\n const auto _Sum = __rhat + _Den._Word[1];\r\n if (__rhat > _Sum) {\r\n break;\r\n }\r\n __rhat = _Sum;\r\n // The addition didn't overflow, so `__rhat < b` holds\r\n }\r\n // _STL_INTERNAL_CHECK(__qhat_high == 0);\r\n\r\n // [_High_digit | _Num] -= __qhat * _Den [3-digit - 1-digit * 2-digit]\r\n uint64_t _Prod0_hi _ZERO_OR_NO_INIT;\r\n uint64_t _Prod_lo = _UMul128(__qhat, _Den._Word[0], _Prod0_hi);\r\n auto _Borrow = _SubBorrow64(0, _Num._Word[0], _Prod_lo, _Num._Word[0]);\r\n uint64_t _Prod1_hi _ZERO_OR_NO_INIT;\r\n _Prod_lo = _UMul128(__qhat, _Den._Word[1], _Prod1_hi);\r\n _Prod1_hi += _AddCarry64(0, _Prod_lo, _Prod0_hi, _Prod_lo);\r\n _Borrow = _SubBorrow64(_Borrow, _Num._Word[1], _Prod_lo, _Num._Word[1]);\r\n _Borrow = _SubBorrow64(_Borrow, _High_digit, _Prod1_hi, _High_digit);\r\n if (_Borrow) {\r\n auto _Carry = _AddCarry64(0, _Num._Word[0], _Den._Word[0], _Num._Word[0]);\r\n (void) _AddCarry64(_Carry, _Num._Word[1], _Den._Word[1], _Num._Word[1]);\r\n }\r\n#else // ^^^ 128-bit intrinsics / no such intrinsics vvv\r\n auto __d = _Countl_zero(_Den._Word[1]);\r\n const bool _Three_word_den = __d >= 32;\r\n __d &= 31;\r\n uint32_t __u[5]{\r\n static_cast(_Num._Word[0] << __d),\r\n static_cast(_Num._Word[0] >> (32 - __d)),\r\n static_cast(_Num._Word[1] << __d),\r\n static_cast(_Num._Word[1] >> (32 - __d)),\r\n 0,\r\n };\r\n uint32_t __v[4] = {\r\n static_cast(_Den._Word[0] << __d),\r\n static_cast(_Den._Word[0] >> (32 - __d)),\r\n static_cast(_Den._Word[1] << __d),\r\n static_cast(_Den._Word[1] >> (32 - __d)),\r\n };\r\n if (__d != 0) {\r\n __u[2] |= _Num._Word[0] >> (64 - __d);\r\n __u[4] |= _Num._Word[1] >> (64 - __d);\r\n __v[2] |= _Den._Word[0] >> (64 - __d);\r\n }\r\n\r\n uint32_t __q[2] _ZERO_OR_NO_INIT;\r\n if (_Three_word_den) {\r\n // 4-digit by 3-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 3, __q);\r\n // _STL_INTERNAL_CHECK(__u[3] == 0);\r\n } else {\r\n // 4-digit by 4-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 4, __q);\r\n }\r\n // _STL_INTERNAL_CHECK(__u[4] == 0);\r\n\r\n _Num._Word[0] = (static_cast(__u[1]) << 32) | __u[0];\r\n _Num._Word[1] = (static_cast(__u[3]) << 32) | __u[2];\r\n#endif // _STL_128_INTRINSICS\r\n _Num >>= __d;\r\n return _Num;\r\n }\r\n\r\n#if _HAS_CXX23\r\n#if !_STL_128_DIV_INTRINSICS\r\n _NODISCARD static constexpr _Base128 _Div_ceil(const _Base128& _Num, const uint32_t _Den) noexcept {\r\n _Base128 _Result;\r\n _Result._Word[1] = _Num._Word[1] / _Den;\r\n uint64_t _Rem = ((_Num._Word[1] % _Den) << 32) | (_Num._Word[0] >> 32);\r\n _Result._Word[0] = (_Rem / _Den) << 32;\r\n _Rem = ((_Rem % _Den) << 32) | static_cast(_Num._Word[0]);\r\n _Result._Word[0] |= static_cast(_Rem / _Den);\r\n if (_Rem % _Den != 0) {\r\n ++_Result;\r\n }\r\n\r\n return _Result;\r\n }\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n\r\n _NODISCARD static constexpr _Base128 _Div_ceil(const _Base128& _Num, const uint64_t _Den) noexcept {\r\n _Base128 _Result;\r\n _Result._Word[1] = _Num._Word[1] / _Den;\r\n uint64_t _Rem;\r\n _Result._Word[0] = _UDiv128(_Num._Word[1] % _Den, _Num._Word[0], _Den, _Rem);\r\n if (_Rem != 0) {\r\n ++_Result;\r\n }\r\n\r\n return _Result;\r\n }\r\n\r\n _NODISCARD static constexpr _Base128 _Div_ceil(_Base128 _Num, _Base128 _Den) noexcept {\r\n // establish _Den < _Num and _Num._Word[1] > 0\r\n if (_Den._Word[1] >= _Num._Word[1]) {\r\n if (_Den._Word[1] > _Num._Word[1]) {\r\n return static_cast<_Base128>(_Num != 0);\r\n }\r\n\r\n if (_Num._Word[1] == 0) {\r\n uint64_t _Result = _Num._Word[0] / _Den._Word[0]; // with 64-bit inputs, the ceiling is also 64-bit\r\n if (_Num._Word[0] % _Den._Word[0] != 0) {\r\n ++_Result;\r\n }\r\n\r\n return _Result;\r\n }\r\n\r\n if (_Num._Word[0] > _Den._Word[0]) {\r\n return 2u;\r\n }\r\n\r\n return 1u;\r\n }\r\n\r\n // establish _Den has more than 1 non-zero \"digit\"\r\n if (_Den._Word[1] == 0) {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if (_Den._Word[0] < (1ull << 32)) {\r\n return _Div_ceil(_Num, static_cast(_Den._Word[0]));\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n return _Div_ceil(_Num, _Den._Word[0]);\r\n }\r\n }\r\n\r\n _Base128 _Result;\r\n#if _STL_128_INTRINSICS\r\n // Knuth 4.3.1D, 2-digit by 2-digit divide in base 2^64\r\n // _STL_INTERNAL_CHECK(_Den._Word[1] != 0);\r\n // _STL_INTERNAL_CHECK(_Num._Word[1] > _Den._Word[1]);\r\n // Normalize by shifting both left until _Den's high bit is set (So _Den's high digit is >= b / 2)\r\n const auto __d = _STD _Countl_zero(_Den._Word[1]);\r\n _Den <<= __d;\r\n auto _High_digit = __d == 0 ? 0 : _Num._Word[1] >> (64 - __d); // This creates a third digit for _Num\r\n _Num <<= __d;\r\n\r\n _Base128 __qhat;\r\n __qhat._Word[1] = _High_digit >= _Den._Word[1];\r\n uint64_t __rhat;\r\n __qhat._Word[0] = _UDiv128(_High_digit >= _Den._Word[1] ? _High_digit - _Den._Word[1] : _High_digit,\r\n _Num._Word[1], _Den._Word[1], __rhat);\r\n\r\n for (;;) {\r\n if (__qhat._Word[1] > 0) {\r\n --__qhat;\r\n } else {\r\n _Base128 _Prod;\r\n _Prod._Word[0] = _UMul128(__qhat._Word[0], _Den._Word[0], _Prod._Word[1]);\r\n if (_Prod <= _Base128{_Num._Word[0], __rhat}) {\r\n break;\r\n }\r\n --__qhat._Word[0];\r\n }\r\n\r\n const auto _Sum = __rhat + _Den._Word[1];\r\n if (__rhat > _Sum) {\r\n break;\r\n }\r\n __rhat = _Sum;\r\n }\r\n // _STL_INTERNAL_CHECK(__qhat._Word[1] == 0);\r\n\r\n // [_High_digit | _Num] -= __qhat * _Den [Since __qhat < b, this is 3-digit - 1-digit * 2-digit]\r\n uint64_t _Prod0_hi;\r\n uint64_t _Prod_lo = _UMul128(__qhat._Word[0], _Den._Word[0], _Prod0_hi);\r\n auto _Borrow = _SubBorrow64(0, _Num._Word[0], _Prod_lo, _Num._Word[0]);\r\n uint64_t _Prod1_hi;\r\n _Prod_lo = _UMul128(__qhat._Word[0], _Den._Word[1], _Prod1_hi);\r\n _Prod1_hi += _AddCarry64(0, _Prod_lo, _Prod0_hi, _Prod_lo);\r\n _Borrow = _SubBorrow64(_Borrow, _Num._Word[1], _Prod_lo, _Num._Word[1]);\r\n _Borrow = _SubBorrow64(_Borrow, _High_digit, _Prod1_hi, _High_digit);\r\n if (_Borrow) {\r\n --__qhat._Word[0];\r\n auto _Carry = _AddCarry64(0, _Num._Word[0], _Den._Word[0], _Num._Word[0]);\r\n (void) _AddCarry64(_Carry, _Num._Word[1], _Den._Word[1], _Num._Word[1]);\r\n }\r\n _Result = __qhat;\r\n#else // ^^^ 128-bit intrinsics / no such intrinsics vvv\r\n auto __d = _Countl_zero(_Den._Word[1]);\r\n const bool _Three_word_den = __d >= 32;\r\n __d &= 31;\r\n uint32_t __u[5]{\r\n static_cast(_Num._Word[0] << __d),\r\n static_cast(_Num._Word[0] >> (32 - __d)),\r\n static_cast(_Num._Word[1] << __d),\r\n static_cast(_Num._Word[1] >> (32 - __d)),\r\n 0,\r\n };\r\n uint32_t __v[4] = {\r\n static_cast(_Den._Word[0] << __d),\r\n static_cast(_Den._Word[0] >> (32 - __d)),\r\n static_cast(_Den._Word[1] << __d),\r\n static_cast(_Den._Word[1] >> (32 - __d)),\r\n };\r\n if (__d != 0) {\r\n __u[2] |= _Num._Word[0] >> (64 - __d);\r\n __u[4] |= _Num._Word[1] >> (64 - __d);\r\n __v[2] |= _Den._Word[0] >> (64 - __d);\r\n }\r\n\r\n uint32_t __q[2] = {};\r\n if (_Three_word_den) {\r\n // 4-digit by 3-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 3, __q);\r\n // _STL_INTERNAL_CHECK(__u[3] == 0);\r\n } else {\r\n // 4-digit by 4-digit base 2^32 division\r\n _Knuth_4_3_1_D(__u, 5, __v, 4, __q);\r\n }\r\n\r\n _Result = (static_cast(__q[1]) << 32) | __q[0];\r\n _Num._Word[0] = (static_cast(__u[1]) << 32) | __u[0];\r\n _Num._Word[1] = (static_cast(__u[3]) << 32) | __u[2];\r\n#endif // _STL_128_INTRINSICS\r\n\r\n if (_Num != 0) {\r\n ++_Result;\r\n }\r\n\r\n return _Result;\r\n }\r\n#endif // _HAS_CXX23\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator&=(_Ty& _Left, const _Base128& _Right) noexcept {\r\n _Left &= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator^=(_Ty& _Left, const _Base128& _Right) noexcept {\r\n _Left ^= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator|=(_Ty& _Left, const _Base128& _Right) noexcept {\r\n _Left |= _Right._Word[0];\r\n return _Left;\r\n }\r\n};\r\n\r\nstruct _Signed128;\r\n\r\nstruct _Unsigned128 : _Base128 {\r\n using _Signed_type = _Signed128;\r\n using _Unsigned_type = _Unsigned128;\r\n\r\n#if !_HAS_CXX17 || (_HAS_CXX20 && !defined(__clang__) && !defined(__EDG__)) // TRANSITION, DevCom-10729775\r\n constexpr _Unsigned128() noexcept : _Base128{} {}\r\n#endif // ^^^ workaround for C++20 MSVC modules and header units; should be guarded for !_HAS_CXX17 only ^^^\r\n\r\n using _Base128::_Base128;\r\n constexpr explicit _Unsigned128(const _Base128& _That) noexcept : _Base128{_That} {}\r\n\r\n constexpr _Unsigned128& operator=(const _Base128& _That) noexcept {\r\n _Base128::operator=(_That);\r\n return *this;\r\n }\r\n\r\n#if _HAS_CXX20\r\n _NODISCARD friend constexpr strong_ordering operator<=>(\r\n const _Unsigned128& _Left, const _Unsigned128& _Right) noexcept {\r\n strong_ordering _Ord = _Left._Word[1] <=> _Right._Word[1];\r\n if (_Ord == strong_ordering::equal) {\r\n _Ord = _Left._Word[0] <=> _Right._Word[0];\r\n }\r\n return _Ord;\r\n }\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\n _NODISCARD friend constexpr bool operator<(const _Unsigned128& _Left, const _Unsigned128& _Right) noexcept {\r\n if (_Left._Word[1] < _Right._Word[1]) {\r\n return true;\r\n }\r\n\r\n if (_Right._Word[1] < _Left._Word[1]) {\r\n return false;\r\n }\r\n\r\n return _Left._Word[0] < _Right._Word[0];\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator>(const _Unsigned128& _Left, const _Unsigned128& _Right) noexcept {\r\n return _Right < _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator<=(const _Unsigned128& _Left, const _Unsigned128& _Right) noexcept {\r\n return !(_Right < _Left);\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator>=(const _Unsigned128& _Left, const _Unsigned128& _Right) noexcept {\r\n return !(_Left < _Right);\r\n }\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator<<(const _Unsigned128& _Left, const _Base128& _Right) noexcept {\r\n auto _Tmp{_Left};\r\n _Tmp._Left_shift(static_cast(_Right._Word[0]));\r\n return _Tmp;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Unsigned128& operator<<=(const _Ty _Count) noexcept {\r\n _Left_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n constexpr _Unsigned128& operator<<=(const _Base128& _Count) noexcept {\r\n _Left_shift(static_cast(_Count._Word[0]));\r\n return *this;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator>>(const _Unsigned128& _Left, const _Base128& _Right) noexcept {\r\n auto _Tmp{_Left};\r\n _Tmp._Unsigned_right_shift(static_cast(_Right._Word[0]));\r\n return _Tmp;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Unsigned128& operator>>=(const _Ty _Count) noexcept {\r\n _Unsigned_right_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n constexpr _Unsigned128& operator>>=(const _Base128& _Count) noexcept {\r\n _Unsigned_right_shift(static_cast(_Count._Word[0]));\r\n return *this;\r\n }\r\n\r\n constexpr _Unsigned128& operator++() noexcept {\r\n if (++_Word[0] == 0) {\r\n ++_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Unsigned128 operator++(int) noexcept {\r\n auto _Tmp = *this;\r\n ++*this;\r\n return _Tmp;\r\n }\r\n\r\n constexpr _Unsigned128& operator--() noexcept {\r\n if (_Word[0]-- == 0) {\r\n --_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Unsigned128 operator--(int) noexcept {\r\n auto _Tmp = *this;\r\n --*this;\r\n return _Tmp;\r\n }\r\n\r\n _NODISCARD constexpr _Unsigned128 operator+() const noexcept {\r\n return *this;\r\n }\r\n\r\n _NODISCARD constexpr _Unsigned128 operator-() const noexcept {\r\n return _Unsigned128{} - *this;\r\n }\r\n\r\n _NODISCARD constexpr _Unsigned128 operator~() const noexcept {\r\n return _Unsigned128{~_Word[0], ~_Word[1]};\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator+(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n _Unsigned128 _Result;\r\n const auto _Carry = _AddCarry64(0, _Left._Word[0], _Right._Word[0], _Result._Word[0]);\r\n _AddCarry64(_Carry, _Left._Word[1], _Right._Word[1], _Result._Word[1]);\r\n return _Result;\r\n }\r\n\r\n constexpr _Unsigned128& operator+=(const _Base128& _That) noexcept {\r\n const auto _Carry = _AddCarry64(0, _Word[0], _That._Word[0], _Word[0]);\r\n _AddCarry64(_Carry, _Word[1], _That._Word[1], _Word[1]);\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator+=(_Ty& _Left, const _Unsigned128& _Right) noexcept {\r\n _Left += _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator-(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n _Unsigned128 _Result;\r\n const auto _Borrow = _SubBorrow64(0, _Left._Word[0], _Right._Word[0], _Result._Word[0]);\r\n _SubBorrow64(_Borrow, _Left._Word[1], _Right._Word[1], _Result._Word[1]);\r\n return _Result;\r\n }\r\n\r\n constexpr _Unsigned128& operator-=(const _Base128& _That) noexcept {\r\n const auto _Borrow = _SubBorrow64(0, _Word[0], _That._Word[0], _Word[0]);\r\n _SubBorrow64(_Borrow, _Word[1], _That._Word[1], _Word[1]);\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator-=(_Ty& _Left, const _Unsigned128& _Right) noexcept {\r\n _Left -= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator*(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Unsigned128{_Base128::_Multiply(_Left, _Right)};\r\n }\r\n\r\n constexpr _Unsigned128& operator*=(const _Base128& _That) noexcept {\r\n *this = *this * _That;\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator*=(_Ty& _Left, const _Unsigned128& _Right) noexcept {\r\n _Left *= _Right._Word[0];\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Unsigned128 operator/(const _Unsigned128& _Num, const _Ty _Den) noexcept {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if constexpr (sizeof(_Ty) <= 4) {\r\n return _Unsigned128{_Base128::_Divide(_Num, static_cast(_Den))};\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n return _Unsigned128{_Base128::_Divide(_Num, static_cast(_Den))};\r\n }\r\n }\r\n _NODISCARD friend constexpr _Unsigned128 operator/(const _Base128& _Num, const _Base128& _Den) noexcept {\r\n return _Unsigned128{_Base128::_Divide(_Num, _Den)};\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Unsigned128& operator/=(const _Ty _That) noexcept {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if constexpr (sizeof(_Ty) <= 4) {\r\n *this = _Unsigned128{_Base128::_Divide(*this, static_cast(_That))};\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n *this = _Unsigned128{_Base128::_Divide(*this, static_cast(_That))};\r\n }\r\n return *this;\r\n }\r\n constexpr _Unsigned128& operator/=(const _Base128& _That) noexcept {\r\n *this = _Unsigned128{_Base128::_Divide(*this, _That)};\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator/=(_Ty& _Left, const _Unsigned128& _Right) noexcept {\r\n if (_Right._Word[1] != 0) {\r\n _Left = 0;\r\n } else {\r\n _Left /= _Right._Word[0];\r\n }\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Unsigned128 operator%(const _Base128& _Num, const _Ty _Den) noexcept {\r\n#if !_STL_128_DIV_INTRINSICS\r\n if constexpr (sizeof(_Ty) <= 4) {\r\n return _Unsigned128{_Base128::_Modulo(_Num, static_cast(_Den))};\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n return _Unsigned128{_Base128::_Modulo(_Num, static_cast(_Den))};\r\n }\r\n }\r\n _NODISCARD friend constexpr _Unsigned128 operator%(const _Base128& _Num, const _Base128& _Den) noexcept {\r\n return _Unsigned128{_Base128::_Modulo(_Num, _Den)};\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Unsigned128& operator%=(const _Ty _Den) noexcept {\r\n *this = *this % _Den;\r\n return *this;\r\n }\r\n constexpr _Unsigned128& operator%=(const _Base128& _Den) noexcept {\r\n *this = *this % _Den;\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator%=(_Ty& _Left, const _Unsigned128& _Right) noexcept {\r\n if (_Right._Word[1] == 0) {\r\n _Left %= _Right._Word[0];\r\n }\r\n return _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator&(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Unsigned128{_Left._Word[0] & _Right._Word[0], _Left._Word[1] & _Right._Word[1]};\r\n }\r\n\r\n constexpr _Unsigned128& operator&=(const _Base128& _That) noexcept {\r\n _Word[0] &= _That._Word[0];\r\n _Word[1] &= _That._Word[1];\r\n return *this;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator^(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Unsigned128{_Left._Word[0] ^ _Right._Word[0], _Left._Word[1] ^ _Right._Word[1]};\r\n }\r\n\r\n constexpr _Unsigned128& operator^=(const _Base128& _That) noexcept {\r\n _Word[0] ^= _That._Word[0];\r\n _Word[1] ^= _That._Word[1];\r\n return *this;\r\n }\r\n\r\n _NODISCARD friend constexpr _Unsigned128 operator|(const _Base128& _Left, const _Base128& _Right) noexcept {\r\n return _Unsigned128{_Left._Word[0] | _Right._Word[0], _Left._Word[1] | _Right._Word[1]};\r\n }\r\n\r\n constexpr _Unsigned128& operator|=(const _Base128& _That) noexcept {\r\n _Word[0] |= _That._Word[0];\r\n _Word[1] |= _That._Word[1];\r\n return *this;\r\n }\r\n};\r\n\r\ntemplate <>\r\nclass numeric_limits<_Unsigned128> : public _Num_int_base {\r\npublic:\r\n _NODISCARD static constexpr _Unsigned128(min)() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128(max)() noexcept {\r\n return _Unsigned128{~0ull, ~0ull};\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 lowest() noexcept {\r\n return (min) ();\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 epsilon() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 round_error() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 denorm_min() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 infinity() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 quiet_NaN() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Unsigned128 signaling_NaN() noexcept {\r\n return 0;\r\n }\r\n\r\n static constexpr bool is_modulo = true;\r\n static constexpr int digits = 128;\r\n static constexpr int digits10 = 38;\r\n};\r\n\r\nstruct _Signed128 : _Base128 {\r\n using _Signed_type = _Signed128;\r\n using _Unsigned_type = _Unsigned128;\r\n\r\n#if !_HAS_CXX17 || (_HAS_CXX20 && !defined(__clang__) && !defined(__EDG__)) // TRANSITION, DevCom-10729775\r\n constexpr _Signed128() noexcept : _Base128{} {}\r\n#endif // ^^^ workaround for C++20 MSVC modules and header units; should be guarded for !_HAS_CXX17 only ^^^\r\n\r\n using _Base128::_Base128;\r\n constexpr explicit _Signed128(const _Base128& _That) noexcept : _Base128{_That} {}\r\n\r\n constexpr _Signed128& operator=(const _Base128& _That) noexcept {\r\n _Base128::operator=(_That);\r\n return *this;\r\n }\r\n\r\n#if _HAS_CXX20\r\n _NODISCARD friend constexpr strong_ordering operator<=>(\r\n const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n strong_ordering _Ord = static_cast(_Left._Word[1]) <=> static_cast(_Right._Word[1]);\r\n if (_Ord == strong_ordering::equal) {\r\n _Ord = _Left._Word[0] <=> _Right._Word[0];\r\n }\r\n return _Ord;\r\n }\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\n _NODISCARD friend constexpr bool operator<(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n if (static_cast(_Left._Word[1]) < static_cast(_Right._Word[1])) {\r\n return true;\r\n }\r\n\r\n if (static_cast(_Right._Word[1]) < static_cast(_Left._Word[1])) {\r\n return false;\r\n }\r\n\r\n return _Left._Word[0] < _Right._Word[0];\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator>(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return _Right < _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator<=(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return !(_Right < _Left);\r\n }\r\n\r\n _NODISCARD friend constexpr bool operator>=(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return !(_Left < _Right);\r\n }\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n _NODISCARD friend constexpr _Signed128 operator<<(const _Signed128& _Left, const _Base128& _Right) noexcept {\r\n auto _Tmp{_Left};\r\n _Tmp._Left_shift(static_cast(_Right._Word[0]));\r\n return _Tmp;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Signed128& operator<<=(const _Ty _Count) noexcept {\r\n _Left_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n constexpr _Signed128& operator<<=(const _Base128& _Count) noexcept {\r\n _Left_shift(static_cast(_Count._Word[0]));\r\n return *this;\r\n }\r\n\r\n constexpr void _Signed_right_shift(const unsigned char _Count) noexcept {\r\n if (_Count == 0) {\r\n return;\r\n }\r\n\r\n if (_Count >= 64) {\r\n _Word[0] = static_cast(static_cast(_Word[1]) >> (_Count % 64));\r\n _Word[1] = (_Word[1] & (1ull << 63)) == 0 ? 0 : ~0ull;\r\n return;\r\n }\r\n\r\n#if _STL_128_INTRINSICS\r\n if (!_Is_constant_evaluated()) {\r\n _Word[0] = __shiftright128(_Word[0], _Word[1], _Count);\r\n } else\r\n#endif // _STL_128_INTRINSICS\r\n {\r\n _Word[0] = (_Word[0] >> _Count) | (_Word[1] << (64 - _Count));\r\n }\r\n\r\n _Word[1] = static_cast(static_cast(_Word[1]) >> _Count);\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator>>(const _Signed128& _Left, const _Base128& _Right) noexcept {\r\n auto _Tmp{_Left};\r\n _Tmp._Signed_right_shift(static_cast(_Right._Word[0]));\r\n return _Tmp;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Signed128& operator>>=(const _Ty _Count) noexcept {\r\n _Signed_right_shift(static_cast(_Count));\r\n return *this;\r\n }\r\n constexpr _Signed128& operator>>=(const _Base128& _Count) noexcept {\r\n _Signed_right_shift(static_cast(_Count._Word[0]));\r\n return *this;\r\n }\r\n\r\n constexpr _Signed128& operator++() noexcept {\r\n if (++_Word[0] == 0) {\r\n ++_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Signed128 operator++(int) noexcept {\r\n auto _Tmp = *this;\r\n ++*this;\r\n return _Tmp;\r\n }\r\n\r\n constexpr _Signed128& operator--() noexcept {\r\n if (_Word[0]-- == 0) {\r\n --_Word[1];\r\n }\r\n return *this;\r\n }\r\n constexpr _Signed128 operator--(int) noexcept {\r\n auto _Tmp = *this;\r\n --*this;\r\n return _Tmp;\r\n }\r\n\r\n _NODISCARD constexpr _Signed128 operator+() const noexcept {\r\n return *this;\r\n }\r\n\r\n _NODISCARD constexpr _Signed128 operator-() const noexcept {\r\n return _Signed128{} - *this;\r\n }\r\n\r\n _NODISCARD constexpr _Signed128 operator~() const noexcept {\r\n return _Signed128{~_Word[0], ~_Word[1]};\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator+(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n _Signed128 _Result;\r\n const auto _Carry = _AddCarry64(0, _Left._Word[0], _Right._Word[0], _Result._Word[0]);\r\n _AddCarry64(_Carry, _Left._Word[1], _Right._Word[1], _Result._Word[1]);\r\n return _Result;\r\n }\r\n\r\n constexpr _Signed128& operator+=(const _Base128& _That) noexcept {\r\n const auto _Carry = _AddCarry64(0, _Word[0], _That._Word[0], _Word[0]);\r\n _AddCarry64(_Carry, _Word[1], _That._Word[1], _Word[1]);\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator+=(_Ty& _Left, const _Signed128& _Right) noexcept {\r\n _Left = static_cast<_Ty>(_Signed128{_Left} + _Right);\r\n return _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator-(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n _Signed128 _Result;\r\n const auto _Borrow = _SubBorrow64(0, _Left._Word[0], _Right._Word[0], _Result._Word[0]);\r\n _SubBorrow64(_Borrow, _Left._Word[1], _Right._Word[1], _Result._Word[1]);\r\n return _Result;\r\n }\r\n\r\n constexpr _Signed128& operator-=(const _Base128& _That) noexcept {\r\n const auto _Borrow = _SubBorrow64(0, _Word[0], _That._Word[0], _Word[0]);\r\n _SubBorrow64(_Borrow, _Word[1], _That._Word[1], _Word[1]);\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator-=(_Ty& _Left, const _Signed128& _Right) noexcept {\r\n _Left = static_cast<_Ty>(_Signed128{_Left} - _Right);\r\n return _Left;\r\n }\r\n\r\n constexpr void _Strip_negative(bool& _Flip) noexcept {\r\n if ((_Word[1] & (1ull << 63)) != 0) {\r\n *this = -*this;\r\n _Flip = !_Flip;\r\n }\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator*(_Signed128 _Left, _Signed128 _Right) noexcept {\r\n bool _Negative = false;\r\n _Left._Strip_negative(_Negative);\r\n _Right._Strip_negative(_Negative);\r\n _Signed128 _Result{_Base128::_Multiply(_Left, _Right)};\r\n if (_Negative) {\r\n _Result = -_Result;\r\n }\r\n return _Result;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Signed128& operator*=(const _Ty _That) noexcept {\r\n *this = *this * _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator*=(const _Signed128& _That) noexcept {\r\n *this = *this * _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator*=(const _Unsigned128& _That) noexcept {\r\n *this = _Signed128{static_cast(*this) * _That};\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator*=(_Ty& _Left, const _Signed128& _Right) noexcept {\r\n _Left = static_cast<_Ty>(_Signed128{_Left} * _Right);\r\n return _Left;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Signed128 operator/(_Signed128 _Num, _Ty _Den) noexcept {\r\n bool _Negative = false;\r\n _Num._Strip_negative(_Negative);\r\n if constexpr (is_signed_v<_Ty>) {\r\n if (_Den < 0) {\r\n _Den = -_Den;\r\n _Negative = !_Negative;\r\n }\r\n }\r\n\r\n _Signed128 _Result;\r\n#if !_STL_128_DIV_INTRINSICS\r\n if constexpr (sizeof(_Ty) <= 4) {\r\n _Result = _Signed128{_Base128::_Divide(_Num, static_cast(_Den))};\r\n } else\r\n#endif // !_STL_128_DIV_INTRINSICS\r\n {\r\n _Result = _Signed128{_Base128::_Divide(_Num, static_cast(_Den))};\r\n }\r\n\r\n if (_Negative) {\r\n _Result = -_Result;\r\n }\r\n return _Result;\r\n }\r\n _NODISCARD friend constexpr _Signed128 operator/(_Signed128 _Num, _Signed128 _Den) noexcept {\r\n bool _Negative = false;\r\n _Num._Strip_negative(_Negative);\r\n _Den._Strip_negative(_Negative);\r\n _Signed128 _Result{_Base128::_Divide(_Num, _Den)};\r\n if (_Negative) {\r\n _Result = -_Result;\r\n }\r\n return _Result;\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Signed128& operator/=(const _Ty _That) noexcept {\r\n *this = *this / _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator/=(const _Signed128& _That) noexcept {\r\n *this = *this / _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator/=(const _Unsigned128& _That) noexcept {\r\n *this = _Signed128{static_cast<_Base128&>(*this) / _That};\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator/=(_Ty& _Left, const _Signed128& _Right) noexcept {\r\n _Left = static_cast<_Ty>(_Signed128{_Left} / _Right);\r\n return _Left;\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator%(_Signed128 _Left, _Signed128 _Right) noexcept {\r\n bool _Negative = false;\r\n _Left._Strip_negative(_Negative);\r\n\r\n if ((_Right._Word[1] & (1ull << 63)) != 0) {\r\n _Right = -_Right;\r\n // intentionally not flipping _Negative\r\n }\r\n\r\n _Unsigned128 _Result{_Base128::_Modulo(_Left, _Right)};\r\n if (_Negative) {\r\n _Result = -_Result;\r\n }\r\n return _Signed128{_Result};\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n _NODISCARD friend constexpr _Signed128 operator%(_Signed128 _Left, const _Ty _Right) noexcept {\r\n return _Left % _Signed128{_Right};\r\n }\r\n\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n constexpr _Signed128& operator%=(const _Ty _That) noexcept {\r\n *this = *this % _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator%=(const _Signed128& _That) noexcept {\r\n *this = *this % _That;\r\n return *this;\r\n }\r\n constexpr _Signed128& operator%=(const _Unsigned128& _That) noexcept {\r\n *this = static_cast(*this) % _That;\r\n return *this;\r\n }\r\n _TEMPLATE_CLASS_INTEGRAL(_Ty)\r\n friend constexpr _Ty& operator%=(_Ty& _Left, const _Signed128& _Right) noexcept {\r\n _Left = static_cast<_Ty>(_Signed128{_Left} % _Right);\r\n return _Left;\r\n }\r\n\r\n#if _HAS_CXX23\r\n _NODISCARD static constexpr _Signed128 _Div_ceil(_Signed128 _Num, _Signed128 _Den) noexcept {\r\n // _STL_INTERNAL_CHECK(_Num >= 0);\r\n // _STL_INTERNAL_CHECK(_Den > 0);\r\n return _Signed128{_Base128::_Div_ceil(_Num, _Den)};\r\n }\r\n#endif // _HAS_CXX23\r\n\r\n _NODISCARD friend constexpr _Signed128 operator&(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return _Signed128{_Left._Word[0] & _Right._Word[0], _Left._Word[1] & _Right._Word[1]};\r\n }\r\n\r\n constexpr _Signed128& operator&=(const _Base128& _That) noexcept {\r\n _Word[0] &= _That._Word[0];\r\n _Word[1] &= _That._Word[1];\r\n return *this;\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator^(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return _Signed128{_Left._Word[0] ^ _Right._Word[0], _Left._Word[1] ^ _Right._Word[1]};\r\n }\r\n\r\n constexpr _Signed128& operator^=(const _Base128& _That) noexcept {\r\n _Word[0] ^= _That._Word[0];\r\n _Word[1] ^= _That._Word[1];\r\n return *this;\r\n }\r\n\r\n _NODISCARD friend constexpr _Signed128 operator|(const _Signed128& _Left, const _Signed128& _Right) noexcept {\r\n return _Signed128{_Left._Word[0] | _Right._Word[0], _Left._Word[1] | _Right._Word[1]};\r\n }\r\n\r\n constexpr _Signed128& operator|=(const _Base128& _That) noexcept {\r\n _Word[0] |= _That._Word[0];\r\n _Word[1] |= _That._Word[1];\r\n return *this;\r\n }\r\n};\r\n\r\ntemplate <>\r\nclass numeric_limits<_Signed128> : public _Num_int_base {\r\npublic:\r\n _NODISCARD static constexpr _Signed128(min)() noexcept {\r\n return _Signed128{0ull, 1ull << 63};\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128(max)() noexcept {\r\n return _Signed128{~0ull, ~0ull >> 1};\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 lowest() noexcept {\r\n return (min) ();\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 epsilon() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 round_error() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 denorm_min() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 infinity() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 quiet_NaN() noexcept {\r\n return 0;\r\n }\r\n\r\n _NODISCARD static constexpr _Signed128 signaling_NaN() noexcept {\r\n return 0;\r\n }\r\n\r\n static constexpr int digits = 127;\r\n static constexpr int digits10 = 38;\r\n static constexpr bool is_signed = true;\r\n};\r\n\r\ntemplate <>\r\nstruct common_type<_Signed128, _Unsigned128> {\r\n using type = _Unsigned128;\r\n};\r\ntemplate <>\r\nstruct common_type<_Unsigned128, _Signed128> {\r\n using type = _Unsigned128;\r\n};\r\n\r\ntemplate \r\n_NODISCARD constexpr _Ty _Min_limit() noexcept;\r\n\r\ntemplate <>\r\n_NODISCARD constexpr _Unsigned128 _Min_limit<_Unsigned128>() noexcept {\r\n return 0;\r\n}\r\n\r\ntemplate <>\r\n_NODISCARD constexpr _Signed128 _Min_limit<_Signed128>() noexcept {\r\n return _Signed128{0ull, 1ull << 63};\r\n}\r\n\r\ntemplate \r\n_NODISCARD constexpr _Ty _Max_limit() noexcept;\r\n\r\ntemplate <>\r\n_NODISCARD constexpr _Unsigned128 _Max_limit<_Unsigned128>() noexcept {\r\n return _Unsigned128{~0ull, ~0ull};\r\n}\r\n\r\ntemplate <>\r\n_NODISCARD constexpr _Signed128 _Max_limit<_Signed128>() noexcept {\r\n return _Signed128{~0ull, ~0ull >> 1};\r\n}\r\n\r\n#undef _STL_128_INTRINSICS\r\n#undef _STL_128_DIV_INTRINSICS\r\n\r\n_STD_END\r\n\r\n#undef _TEMPLATE_CLASS_INTEGRAL\r\n#undef _ZERO_OR_NO_INIT\r\n\r\n#pragma pop_macro(\"new\")\r\n_STL_RESTORE_CLANG_WARNINGS\r\n#pragma warning(pop)\r\n#pragma pack(pop)\r\n#endif // _STL_COMPILER_PREPROCESSOR\r\n#endif // __MSVC_INT128_HPP\r\n" }, { "path": "stl/inc/__msvc_iter_core.hpp", "content": "// __msvc_iter_core.hpp internal header (core)\r\n\r\n// Copyright (c) Microsoft Corporation.\r\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\r\n\r\n#ifndef __MSVC_ITER_CORE_HPP\r\n#define __MSVC_ITER_CORE_HPP\r\n#include \r\n#if _STL_COMPILER_PREPROCESSOR\r\n#include \r\n\r\n#pragma pack(push, _CRT_PACKING)\r\n#pragma warning(push, _STL_WARNING_LEVEL)\r\n#pragma warning(disable : _STL_DISABLED_WARNINGS)\r\n_STL_DISABLE_CLANG_WARNINGS\r\n#pragma push_macro(\"new\")\r\n#undef new\r\n\r\n// TRANSITION, non-_Ugly attribute tokens\r\n#pragma push_macro(\"msvc\")\r\n#pragma push_macro(\"no_specializations\")\r\n#undef msvc\r\n#undef no_specializations\r\n\r\n_STD_BEGIN\r\ntemplate \r\nstruct _Has_allocator_type : false_type {}; // tests for suitable _Ty::allocator_type\r\n\r\ntemplate \r\nstruct _Has_allocator_type<_Ty, _Alloc, void_t>\r\n : is_convertible<_Alloc, typename _Ty::allocator_type>::type {};\r\n\r\n_EXPORT_STD struct allocator_arg_t { // tag type for added allocator argument\r\n explicit allocator_arg_t() = default;\r\n};\r\n\r\n_EXPORT_STD _INLINE_VAR constexpr allocator_arg_t allocator_arg{};\r\n\r\n_EXPORT_STD template \r\nstruct uses_allocator : _Has_allocator_type<_Ty, _Alloc>::type {};\r\n\r\n_EXPORT_STD template \r\n_NO_SPECIALIZATIONS_OF_VARIABLE_TEMPLATES constexpr bool uses_allocator_v = uses_allocator<_Ty, _Alloc>::value;\r\n\r\n// from \r\n_EXPORT_STD struct input_iterator_tag {};\r\n\r\n_EXPORT_STD struct output_iterator_tag {};\r\n\r\n_EXPORT_STD struct forward_iterator_tag : input_iterator_tag {};\r\n\r\n_EXPORT_STD struct bidirectional_iterator_tag : forward_iterator_tag {};\r\n\r\n_EXPORT_STD struct random_access_iterator_tag : bidirectional_iterator_tag {};\r\n\r\n#if _HAS_CXX20\r\n_EXPORT_STD struct contiguous_iterator_tag : random_access_iterator_tag {};\r\n\r\ntemplate \r\nusing _With_reference = _Ty&;\r\n\r\ntemplate \r\nconcept _Can_reference = requires { typename _With_reference<_Ty>; };\r\n\r\ntemplate \r\nconcept _Dereferenceable = requires(_Ty& __t) {\r\n { *__t } -> _Can_reference;\r\n};\r\n\r\ntemplate \r\nconcept _Has_member_iterator_concept = requires { typename _Ty::iterator_concept; };\r\n\r\ntemplate \r\nconcept _Has_member_iterator_category = requires { typename _Ty::iterator_category; };\r\n\r\ntemplate \r\nconcept _Has_member_value_type = requires { typename _Ty::value_type; };\r\n\r\ntemplate \r\nconcept _Has_member_element_type = requires { typename _Ty::element_type; };\r\n\r\ntemplate \r\nconcept _Has_member_difference_type = requires { typename _Ty::difference_type; };\r\n\r\ntemplate \r\nconcept _Has_member_pointer = requires { typename _Ty::pointer; };\r\n\r\ntemplate \r\nconcept _Has_member_reference = requires { typename _Ty::reference; };\r\n\r\n_EXPORT_STD template \r\nstruct incrementable_traits {};\r\n\r\ntemplate \r\n requires is_object_v<_Ty>\r\nstruct incrementable_traits<_Ty*> {\r\n using difference_type = ptrdiff_t;\r\n};\r\n\r\ntemplate \r\nstruct incrementable_traits : incrementable_traits<_Ty> {};\r\n\r\ntemplate <_Has_member_difference_type _Ty>\r\nstruct incrementable_traits<_Ty> {\r\n using difference_type = _Ty::difference_type;\r\n};\r\n\r\ntemplate \r\nconcept _Can_difference = requires(const _Ty& __a, const _Ty& __b) {\r\n { __a - __b } -> integral;\r\n};\r\n\r\ntemplate \r\n requires (!_Has_member_difference_type<_Ty> && _Can_difference<_Ty>)\r\nstruct incrementable_traits<_Ty> {\r\n using difference_type = make_signed_t() - _STD declval<_Ty>())>;\r\n};\r\n\r\ntemplate \r\nconcept _Is_from_primary = _Same_impl;\r\n\r\n_EXPORT_STD template \r\nstruct iterator_traits;\r\n\r\n_EXPORT_STD template \r\nusing iter_difference_t = conditional_t<_Is_from_primary>>,\r\n incrementable_traits>, iterator_traits>>::difference_type;\r\n\r\ntemplate \r\nstruct _Cond_value_type {};\r\n\r\ntemplate \r\n requires is_object_v<_Ty>\r\nstruct _Cond_value_type<_Ty> {\r\n using value_type = remove_cv_t<_Ty>;\r\n};\r\n\r\n_EXPORT_STD template \r\nstruct indirectly_readable_traits {};\r\n\r\ntemplate \r\nstruct indirectly_readable_traits<_Ty*> : _Cond_value_type<_Ty> {};\r\n\r\ntemplate \r\n requires is_array_v<_Ty>\r\nstruct indirectly_readable_traits<_Ty> {\r\n using value_type = remove_cv_t>;\r\n};\r\n\r\ntemplate \r\nstruct indirectly_readable_traits : indirectly_readable_traits<_Ty> {};\r\n\r\ntemplate <_Has_member_value_type _Ty>\r\nstruct indirectly_readable_traits<_Ty> : _Cond_value_type {};\r\n\r\ntemplate <_Has_member_element_type _Ty>\r\nstruct indirectly_readable_traits<_Ty> : _Cond_value_type {};\r\n\r\ntemplate <_Has_member_value_type _Ty>\r\n requires _Has_member_element_type<_Ty>\r\nstruct indirectly_readable_traits<_Ty> {};\r\n\r\ntemplate <_Has_member_value_type _Ty>\r\n requires _Has_member_element_type<_Ty>\r\n && same_as, remove_cv_t>\r\nstruct indirectly_readable_traits<_Ty> : _Cond_value_type {};\r\n\r\n_EXPORT_STD template \r\nusing iter_value_t = conditional_t<_Is_from_primary>>,\r\n indirectly_readable_traits>, iterator_traits>>::value_type;\r\n\r\n_EXPORT_STD template <_Dereferenceable _Ty>\r\nusing iter_reference_t = decltype(*_STD declval<_Ty&>());\r\n\r\ntemplate \r\nstruct _Iterator_traits_base {};\r\n\r\ntemplate \r\nconcept _Has_iter_types = _Has_member_difference_type<_It> && _Has_member_value_type<_It> && _Has_member_reference<_It>\r\n && _Has_member_iterator_category<_It>;\r\n\r\ntemplate \r\nstruct _Old_iter_traits_pointer {\r\n template \r\n using _Apply = _It::pointer;\r\n};\r\n\r\ntemplate <>\r\nstruct _Old_iter_traits_pointer {\r\n template \r\n using _Apply = void;\r\n};\r\n\r\ntemplate <_Has_iter_types _It>\r\nstruct _Iterator_traits_base<_It> {\r\n using iterator_category = _It::iterator_category;\r\n using value_type = _It::value_type;\r\n using difference_type = _It::difference_type;\r\n using pointer = _Old_iter_traits_pointer<_Has_member_pointer<_It>>::template _Apply<_It>;\r\n using reference = _It::reference;\r\n};\r\n\r\ntemplate \r\nstruct _Iter_traits_difference {\r\n template \r\n using _Apply = incrementable_traits<_It>::difference_type;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_difference {\r\n template \r\n using _Apply = void;\r\n};\r\n\r\ntemplate \r\nconcept _Cpp17_iterator = requires(_It __i) {\r\n { *__i } -> _Can_reference;\r\n { ++__i } -> same_as<_It&>;\r\n { *__i++ } -> _Can_reference;\r\n} && copyable<_It>;\r\n\r\ntemplate \r\nconcept _Cpp17_input_iterator =\r\n _Cpp17_iterator<_It> && equality_comparable<_It> && _Has_member_difference_type>\r\n && _Has_member_value_type> && requires(_It __i) {\r\n typename common_reference_t&&, typename indirectly_readable_traits<_It>::value_type&>;\r\n typename common_reference_t::value_type&>;\r\n requires signed_integral::difference_type>;\r\n };\r\n\r\ntemplate \r\n requires (!_Has_iter_types<_It> && _Cpp17_iterator<_It> && !_Cpp17_input_iterator<_It>)\r\nstruct _Iterator_traits_base<_It> {\r\n using iterator_category = output_iterator_tag;\r\n using value_type = void;\r\n using difference_type =\r\n _Iter_traits_difference<_Has_member_difference_type>>::template _Apply<_It>;\r\n using pointer = void;\r\n using reference = void;\r\n};\r\n\r\nenum class _Itraits_pointer_strategy { _Use_void, _Use_member, _Use_decltype };\r\n\r\ntemplate <_Itraits_pointer_strategy>\r\nstruct _Iter_traits_pointer;\r\n\r\ntemplate <>\r\nstruct _Iter_traits_pointer<_Itraits_pointer_strategy::_Use_void> {\r\n template \r\n using _Apply = void;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_pointer<_Itraits_pointer_strategy::_Use_member> {\r\n template \r\n using _Apply = _It::pointer;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_pointer<_Itraits_pointer_strategy::_Use_decltype> {\r\n template \r\n using _Apply = decltype(_STD declval<_It&>().operator->());\r\n};\r\n\r\ntemplate \r\nconcept _Has_member_arrow = requires(_Ty&& __t) { static_cast<_Ty &&>(__t).operator->(); };\r\n\r\ntemplate \r\nstruct _Iter_traits_reference {\r\n template \r\n using _Apply = _It::reference;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_reference {\r\n template \r\n using _Apply = iter_reference_t<_It>;\r\n};\r\n\r\ntemplate \r\nstruct _Iter_traits_category4 {\r\n using type = random_access_iterator_tag;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_category4 {\r\n using type = bidirectional_iterator_tag;\r\n};\r\n\r\ntemplate \r\nconcept _Cpp17_random_delta =\r\n totally_ordered<_It> && requires(_It __i, incrementable_traits<_It>::difference_type __n) {\r\n { __i += __n } -> same_as<_It&>;\r\n { __i -= __n } -> same_as<_It&>;\r\n { __i + __n } -> same_as<_It>;\r\n { __n + __i } -> same_as<_It>;\r\n { __i - __n } -> same_as<_It>;\r\n { __i - __i } -> same_as;\r\n { __i[__n] } -> convertible_to>;\r\n };\r\n\r\ntemplate \r\nstruct _Iter_traits_category3 {\r\n template \r\n using _Apply = _Iter_traits_category4<_Cpp17_random_delta<_It>>::type;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_category3 {\r\n template \r\n using _Apply = forward_iterator_tag;\r\n};\r\n\r\ntemplate \r\nconcept _Cpp17_bidi_delta = requires(_It __i) {\r\n { --__i } -> same_as<_It&>;\r\n { __i-- } -> convertible_to;\r\n requires same_as>;\r\n};\r\n\r\ntemplate \r\nstruct _Iter_traits_category2 {\r\n template \r\n using _Apply = _Iter_traits_category3<_Cpp17_bidi_delta<_It>>::template _Apply<_It>;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_category2 {\r\n template \r\n using _Apply = input_iterator_tag;\r\n};\r\n\r\ntemplate \r\nconcept _Cpp17_forward_delta =\r\n constructible_from<_It> && is_reference_v>\r\n && same_as>, typename indirectly_readable_traits<_It>::value_type>\r\n && requires(_It __i) {\r\n { __i++ } -> convertible_to;\r\n requires same_as>;\r\n };\r\n\r\ntemplate \r\nstruct _Iter_traits_category {\r\n template \r\n using _Apply = _It::iterator_category;\r\n};\r\n\r\ntemplate <>\r\nstruct _Iter_traits_category {\r\n template \r\n using _Apply = _Iter_traits_category2<_Cpp17_forward_delta<_It>>::template _Apply<_It>;\r\n};\r\n\r\ntemplate \r\n requires (!_Has_iter_types<_It> && _Cpp17_input_iterator<_It>)\r\nstruct _Iterator_traits_base<_It> {\r\n using iterator_category = _Iter_traits_category<_Has_member_iterator_category<_It>>::template _Apply<_It>;\r\n using value_type = indirectly_readable_traits<_It>::value_type;\r\n using difference_type = incrementable_traits<_It>::difference_type;\r\n using pointer =\r\n _Iter_traits_pointer<(_Has_member_pointer<_It> ? _Itraits_pointer_strategy::_Use_member\r\n : _Has_member_arrow<_It&> ? _Itraits_pointer_strategy::_Use_decltype\r\n : _Itraits_pointer_strategy::_Use_void)>::template _Apply<_It>;\r\n using reference = _Iter_traits_reference<_Has_member_reference<_It>>::template _Apply<_It>;\r\n};\r\n\r\n_EXPORT_STD template \r\nstruct iterator_traits : _Iterator_traits_base<_Ty> {\r\n using _From_primary = iterator_traits;\r\n};\r\n\r\ntemplate \r\n requires is_object_v<_Ty>\r\nstruct iterator_traits<_Ty*> {\r\n using iterator_concept = contiguous_iterator_tag;\r\n using iterator_category = random_access_iterator_tag;\r\n using value_type = remove_cv_t<_Ty>;\r\n using difference_type = ptrdiff_t;\r\n using pointer = _Ty*;\r\n using reference = _Ty&;\r\n};\r\n\r\ntemplate \r\nconstexpr bool _Integer_class = requires {\r\n typename _Ty::_Signed_type;\r\n typename _Ty::_Unsigned_type;\r\n};\r\n\r\ntemplate \r\nconcept _Integer_like = _Is_nonbool_integral<_Ty> || _Integer_class<_Ty>;\r\n\r\ntemplate \r\nconcept _Signed_integer_like = _Integer_like<_Ty> && static_cast<_Ty>(-1) < static_cast<_Ty>(0);\r\n\r\n_EXPORT_STD template \r\nconcept weakly_incrementable = movable<_Ty> && requires(_Ty __i) {\r\n typename iter_difference_t<_Ty>;\r\n requires _Signed_integer_like>;\r\n { ++__i } -> same_as<_Ty&>;\r\n __i++;\r\n};\r\n\r\n_EXPORT_STD template \r\nconcept input_or_output_iterator = requires(_It __i) {\r\n { *__i } -> _Can_reference;\r\n} && weakly_incrementable<_It>;\r\n\r\n_EXPORT_STD template \r\nconcept sentinel_for = semiregular<_Se> && input_or_output_iterator<_It> && _Weakly_equality_comparable_with<_Se, _It>;\r\n\r\n_EXPORT_STD template // specializations allowed by N5014 [iterator.concept.sizedsentinel]/3\r\nconstexpr bool disable_sized_sentinel_for = false;\r\n\r\n_EXPORT_STD template \r\nconcept sized_sentinel_for = sentinel_for<_Se, _It> && !disable_sized_sentinel_for, remove_cv_t<_It>>\r\n && requires(const _It& __i, const _Se& __s) {\r\n { __s - __i } -> same_as>;\r\n { __i - __s } -> same_as>;\r\n };\r\n\r\n_EXPORT_STD struct default_sentinel_t {};\r\n\r\n_EXPORT_STD inline constexpr default_sentinel_t default_sentinel{};\r\n\r\nnamespace ranges {\r\n _EXPORT_STD enum class subrange_kind : bool { unsized, sized };\r\n\r\n _EXPORT_STD template _Se = _It,\r\n subrange_kind _Ki = sized_sentinel_for<_Se, _It> ? subrange_kind::sized : subrange_kind::unsized>\r\n requires (_Ki == subrange_kind::sized || !sized_sentinel_for<_Se, _It>)\r\n class subrange;\r\n\r\n _EXPORT_STD template \r\n requires ((_Idx == 0 && copyable<_It>) || _Idx == 1)\r\n _NODISCARD constexpr auto get(const subrange<_It, _Se, _Ki>& _Val);\r\n\r\n _EXPORT_STD template \r\n requires (_Idx < 2)\r\n _NODISCARD constexpr auto get(subrange<_It, _Se, _Ki>&& _Val);\r\n} // namespace ranges\r\n\r\n_EXPORT_STD using ranges::get;\r\n\r\ntemplate \r\nconstexpr bool _Is_subrange_v> = true;\r\n\r\ntemplate \r\nstruct tuple_size> : integral_constant {};\r\n\r\ntemplate \r\nstruct tuple_element<0, ranges::subrange<_It, _Se, _Ki>> {\r\n using type = _It;\r\n};\r\n\r\ntemplate \r\nstruct tuple_element<1, ranges::subrange<_It, _Se, _Ki>> {\r\n using type = _Se;\r\n};\r\n\r\ntemplate \r\nstruct tuple_element<0, const ranges::subrange<_It, _Se, _Ki>> {\r\n using type = _It;\r\n};\r\n\r\ntemplate \r\nstruct tuple_element<1, const ranges::subrange<_It, _Se, _Ki>> {\r\n using type = _Se;\r\n};\r\n#else // ^^^ _HAS_CXX20 / !_HAS_CXX20 vvv\r\ntemplate \r\nstruct _Iterator_traits_base {}; // empty for non-iterators\r\n\r\ntemplate \r\nstruct _Iterator_traits_base<_Iter,\r\n void_t> {\r\n // defined if _Iter::* types exist\r\n using iterator_category = typename _Iter::iterator_category;\r\n using value_type = typename _Iter::value_type;\r\n using difference_type = typename _Iter::difference_type;\r\n using pointer = typename _Iter::pointer;\r\n using reference = typename _Iter::reference;\r\n};\r\n\r\ntemplate >\r\nstruct _Iterator_traits_pointer_base { // iterator properties for pointers to object\r\n using iterator_category = random_access_iterator_tag;\r\n using value_type = remove_cv_t<_Ty>;\r\n using difference_type = ptrdiff_t;\r\n using pointer = _Ty*;\r\n using reference = _Ty&;\r\n};\r\n\r\ntemplate \r\nstruct _Iterator_traits_pointer_base<_Ty, false> {}; // iterator non-properties for pointers to non-object\r\n\r\ntemplate \r\nstruct iterator_traits : _Iterator_traits_base<_Iter> {}; // get traits from iterator _Iter, if possible\r\n\r\ntemplate \r\nstruct iterator_traits<_Ty*> : _Iterator_traits_pointer_base<_Ty> {}; // get traits from pointer, if possible\r\n\r\ntemplate \r\nconstexpr bool _Integer_like = _Is_nonbool_integral<_Ty>;\r\n\r\ntemplate \r\nconstexpr bool _Signed_integer_like = _Integer_like<_Ty> && is_signed_v<_Ty>;\r\n#endif // ^^^ !_HAS_CXX20 ^^^\r\n\r\n_INLINE_VAR constexpr auto _Meta_npos = ~size_t{0};\r\n\r\nconstexpr size_t _Meta_find_index_i_(const bool* const _Ptr, const size_t _Count, size_t _Idx = 0) {\r\n // return the index of the first true in the _Count bools at _Ptr, or _Meta_npos if all are false\r\n for (; _Idx < _Count; ++_Idx) {\r\n if (_Ptr[_Idx]) {\r\n return _Idx;\r\n }\r\n }\r\n\r\n return _Meta_npos;\r\n}\r\n\r\ntemplate \r\nstruct _Meta_find_unique_index_ {\r\n using type = integral_constant;\r\n};\r\ntemplate \r\nusing _Meta_find_unique_index =\r\n // The index of _Ty in _List if it occurs exactly once, otherwise _Meta_npos\r\n typename _Meta_find_unique_index_<_List, _Ty>::type;\r\n\r\nconstexpr size_t _Meta_find_unique_index_i_2(const bool* const _Ptr, const size_t _Count, const size_t _First) {\r\n // return _First if there is no _First < j < _Count such that _Ptr[j] is true, otherwise _Meta_npos\r\n return _First != _Meta_npos && _STD _Meta_find_index_i_(_Ptr, _Count, _First + 1) == _Meta_npos ? _First\r\n : _Meta_npos;\r\n}\r\n\r\nconstexpr size_t _Meta_find_unique_index_i_(const bool* const _Ptr, const size_t _Count) {\r\n // Pass the smallest i such that _Ptr[i] is true to _Meta_find_unique_index_i_2\r\n return _STD _Meta_find_unique_index_i_2(_Ptr, _Count, _STD _Meta_find_index_i_(_Ptr, _Count));\r\n}\r\n\r\ntemplate