[
{
"path": ".gitattributes",
"content": "###############################################################################\n# Set default behavior to automatically normalize line endings.\n###############################################################################\n* text=auto\n\n###############################################################################\n# Set default behavior for command prompt diff.\n#\n# This is need for earlier builds of msysgit that does not have it on by\n# default for csharp files.\n# Note: This is only used by command line\n###############################################################################\n#*.cs diff=csharp\n\n###############################################################################\n# Set the merge driver for project and solution files\n#\n# Merging from the command prompt will add diff markers to the files if there\n# are conflicts (Merging from VS is not affected by the settings below, in VS\n# the diff markers are never inserted). Diff markers may cause the following \n# file extensions to fail to load in VS. An alternative would be to treat\n# these files as binary and thus will always conflict and require user\n# intervention with every merge. To do so, just uncomment the entries below\n###############################################################################\n#*.sln merge=binary\n#*.csproj merge=binary\n#*.vbproj merge=binary\n#*.vcxproj merge=binary\n#*.vcproj merge=binary\n#*.dbproj merge=binary\n#*.fsproj merge=binary\n#*.lsproj merge=binary\n#*.wixproj merge=binary\n#*.modelproj merge=binary\n#*.sqlproj merge=binary\n#*.wwaproj merge=binary\n\n###############################################################################\n# behavior for image files\n#\n# image files are treated as binary by default.\n###############################################################################\n#*.jpg binary\n#*.png binary\n#*.gif binary\n\n###############################################################################\n# diff behavior for common document formats\n# \n# Convert binary document formats to text before diffing them. This feature\n# is only available from the command line. Turn it on by uncommenting the \n# entries below.\n###############################################################################\n#*.doc diff=astextplain\n#*.DOC diff=astextplain\n#*.docx diff=astextplain\n#*.DOCX diff=astextplain\n#*.dot diff=astextplain\n#*.DOT diff=astextplain\n#*.pdf diff=astextplain\n#*.PDF diff=astextplain\n#*.rtf diff=astextplain\n#*.RTF diff=astextplain\n"
},
{
"path": ".gitignore",
"content": "## Ignore Visual Studio temporary files, build results, and\n## files generated by popular Visual Studio add-ons.\n\n# Local build files\n*c.cmd\n*a.exe\n\n# User-specific files\n*.suo\n*.user\n*.userosscache\n*.sln.docstates\n\n# User-specific files (MonoDevelop/Xamarin Studio)\n*.userprefs\n\n# Build results\n[Dd]ebug/\n[Dd]ebugPublic/\n[Rr]elease/\n[Rr]eleases/\n[Xx]64/\n[Xx]86/\n[Bb]uild/\nbld/\n[Bb]in/\n[Oo]bj/\n\n# Visual Studio 2015 cache/options directory\n.vs/\n\n# Visual Studio Code\n.vscode/\n\n# Uncomment if you have tasks that create the project's static files in wwwroot\n#wwwroot/\n\n# MSTest test Results\n[Tt]est[Rr]esult*/\n[Bb]uild[Ll]og.*\n\n# NUNIT\n*.VisualState.xml\nTestResult.xml\n\n# Build Results of an ATL Project\n[Dd]ebugPS/\n[Rr]eleasePS/\ndlldata.c\n\n# DNX\nproject.lock.json\nartifacts/\n\n*_i.c\n*_p.c\n*_i.h\n*.ilk\n*.meta\n*.obj\n*.pch\n*.pdb\n*.pgc\n*.pgd\n*.rsp\n*.sbr\n*.tlb\n*.tli\n*.tlh\n*.tmp\n*.tmp_proj\n*.log\n*.vspscc\n*.vssscc\n.builds\n*.pidb\n*.svclog\n*.scc\n\n# Chutzpah Test files\n_Chutzpah*\n\n# Visual C++ cache files\nipch/\n*.aps\n*.ncb\n*.opendb\n*.opensdf\n*.sdf\n*.cachefile\n*.VC.db\n\n# Visual Studio profiler\n*.psess\n*.vsp\n*.vspx\n*.sap\n\n# TFS 2012 Local Workspace\n$tf/\n\n# Guidance Automation Toolkit\n*.gpState\n\n# ReSharper is a .NET coding add-in\n_ReSharper*/\n*.[Rr]e[Ss]harper\n*.DotSettings.user\n\n# JustCode is a .NET coding add-in\n.JustCode\n\n# TeamCity is a build add-in\n_TeamCity*\n\n# DotCover is a Code Coverage Tool\n*.dotCover\n\n# NCrunch\n_NCrunch_*\n.*crunch*.local.xml\nnCrunchTemp_*\n\n# MightyMoose\n*.mm.*\nAutoTest.Net/\n\n# Web workbench (sass)\n.sass-cache/\n\n# Installshield output folder\n[Ee]xpress/\n\n# DocProject is a documentation generator add-in\nDocProject/buildhelp/\nDocProject/Help/*.HxT\nDocProject/Help/*.HxC\nDocProject/Help/*.hhc\nDocProject/Help/*.hhk\nDocProject/Help/*.hhp\nDocProject/Help/Html2\nDocProject/Help/html\n\n# Click-Once directory\npublish/\n\n# Publish Web Output\n*.[Pp]ublish.xml\n*.azurePubxml\n\n# TODO: Un-comment the next line if you do not want to checkin \n# your web deploy settings because they may include unencrypted\n# passwords\n#*.pubxml\n*.publishproj\n\n# NuGet Packages\n*.nupkg\n# The packages folder can be ignored because of Package Restore\n**/packages/*\n# except build/, which is used as an MSBuild target.\n!**/packages/build/\n# Uncomment if necessary however generally it will be regenerated when needed\n#!**/packages/repositories.config\n# NuGet v3's project.json files produces more ignoreable files\n*.nuget.props\n*.nuget.targets\n\n# Microsoft Azure Build Output\ncsx/\n*.build.csdef\n\n# Microsoft Azure Emulator\necf/\nrcf/\n\n# Microsoft Azure ApplicationInsights config file\nApplicationInsights.config\n\n# Windows Store app package directory\nAppPackages/\nBundleArtifacts/\n\n# Visual Studio cache files\n# files ending in .cache can be ignored\n*.[Cc]ache\n# but keep track of directories ending in .cache\n!*.[Cc]ache/\n\n# Others\nClientBin/\n[Ss]tyle[Cc]op.*\n~$*\n*~\n*.dbmdl\n*.dbproj.schemaview\n*.pfx\n*.publishsettings\nnode_modules/\norleans.codegen.cs\n\n# RIA/Silverlight projects\nGenerated_Code/\n\n# Backup & report files from converting an old project file\n# to a newer Visual Studio version. Backup files are not needed,\n# because we have git ;-)\n_UpgradeReport_Files/\nBackup*/\nUpgradeLog*.XML\nUpgradeLog*.htm\n\n# SQL Server files\n*.mdf\n*.ldf\n\n# Business Intelligence projects\n*.rdl.data\n*.bim.layout\n*.bim_*.settings\n\n# Microsoft Fakes\nFakesAssemblies/\n\n# GhostDoc plugin setting file\n*.GhostDoc.xml\n\n# Node.js Tools for Visual Studio\n.ntvs_analysis.dat\n\n# Visual Studio 6 build log\n*.plg\n\n# Visual Studio 6 workspace options file\n*.opt\n\n# Visual Studio LightSwitch build output\n**/*.HTMLClient/GeneratedArtifacts\n**/*.DesktopClient/GeneratedArtifacts\n**/*.DesktopClient/ModelManifest.xml\n**/*.Server/GeneratedArtifacts\n**/*.Server/ModelManifest.xml\n_Pvt_Extensions\n\n# LightSwitch generated files\nGeneratedArtifacts/\nModelManifest.xml\n\n# Paket dependency manager\n.paket/paket.exe\n\n# FAKE - F# Make\n.fake/\n"
},
{
"path": ".travis.yml",
"content": "language: cpp\n\n# ubuntu 14.04 version\nsudo: required\ndist: trusty\n\nmatrix:\n include:\n - os: linux\n compiler: gcc\n addons:\n apt:\n sources: ['ubuntu-toolchain-r-test']\n packages: ['g++-5']\n env:\n - MATRIX_EVAL=\"CC=gcc-5 && CXX=g++-5\"\n\n - os: linux\n compiler: gcc\n addons:\n apt:\n sources: ['ubuntu-toolchain-r-test']\n packages: ['g++-6']\n env:\n - MATRIX_EVAL=\"CC=gcc-6 && CXX=g++-6\"\n\n - os: linux\n compiler: gcc\n addons:\n apt:\n sources: ['ubuntu-toolchain-r-test']\n packages: ['g++-7']\n env:\n - MATRIX_EVAL=\"CC=gcc-7 && CXX=g++-7\"\n \n - os: osx\n osx_image: xcode5\n env:\n - MATRIX_EVAL=\"CC=clang && CXX=clang++\"\n \n - os: osx\n osx_image: xcode6\n env:\n - MATRIX_EVAL=\"CC=clang && CXX=clang++\"\n \n - os: osx\n osx_image: xcode7\n env:\n - MATRIX_EVAL=\"CC=clang && CXX=clang++\"\n \n - os: osx\n osx_image: xcode8\n env:\n - MATRIX_EVAL=\"CC=clang && CXX=clang++\"\n \n \nbefore_script:\n - eval \"${MATRIX_EVAL}\"\n - $CXX --version\n \nscript:\n - mkdir build && cd ./build\n - cmake ..\n - make\n - cd ../bin && ./stltest\n \nbranches:\n only:\n - master\n \nnotifications:\n email: false\n"
},
{
"path": "CMakeLists.txt",
"content": "cmake_minimum_required(VERSION 2.8)\n\nproject(MyTinySTL)\n\n# version\nset(MyTinySTL_VERSION_MAJOR 2)\nset(MyTinySTL_VERSION_MINOR 0)\nset(MyTinySTL_VERSION_PATCH 0)\nset(MyTinySTL_VERSION \"${MyTinySTL_VERSION_MAJOR}.${MyTinySTL_VERSION_MINOR}.${MyTinySTL_VERSION_PATCH}\")\nmessage(STATUS \"The version of this project is: ${MyTinySTL_VERSION}\")\n\n# build type\nset(CMAKE_BUILD_TYPE release)\n\nif (\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"GNU\")\n\tset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -O2 -Wall -Wextra -Wno-sign-compare -Wno-unused-but-set-variable -Wno-array-bounds\")\n\t# set(EXTRA_CXX_FLAGS -Weffc++ -Wswitch-default -Wfloat-equal -Wconversion -Wsign-conversion)\n\tif (CMAKE_CXX_COMPILER_VERSION VERSION_LESS \"5.0.0\")\n\t\tmessage(FATAL_ERROR \"required GCC 5.0 or later\")\n\telse()\n\t\tset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -std=c++11\")\n\tendif()\nelseif (CMAKE_CXX_COMPILER_ID MATCHES \"Clang\")\n\tset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -O2 -Wall -Wextra -Wno-sign-compare\")\n\t# set(EXTRA_CXX_FLAGS -Weffc++ -Wswitch-default -Wfloat-equal -Wconversion -Wimplicit-fallthrough)\n\tif (CMAKE_CXX_COMPILER_VERSION VERSION_LESS \"3.5.0\")\n\t\tmessage(FATAL_ERROR \"required Clang 3.5 or later\")\n\telse()\n\t\tset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -std=c++11\")\n\tendif()\nendif()\n\nmessage(STATUS \"The cmake_cxx_flags is: ${CMAKE_CXX_FLAGS}\")\n\nadd_subdirectory(${PROJECT_SOURCE_DIR}/Test)\n"
},
{
"path": "License.txt",
"content": "Copyright (c) 2016-2017 Alinshans. All rights reserved.\r\n\r\nFirst published on github, see https://github.com/Alinshans/MyTinySTL\r\n\r\nThe MyTinySTL source code is licensed under the MIT License.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n"
},
{
"path": "MSVC/MyTinySTL_VS2015.sln",
"content": "\nMicrosoft Visual Studio Solution File, Format Version 12.00\n# Visual Studio 14\nVisualStudioVersion = 14.0.25420.1\nMinimumVisualStudioVersion = 10.0.40219.1\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"MyTinySTL\", \"MyTinySTL_VS2015.vcxproj\", \"{E88807F6-B07C-4371-BD38-FB1569F894E4}\"\nEndProject\nGlobal\n\tGlobalSection(SolutionConfigurationPlatforms) = preSolution\n\t\tDebug|x64 = Debug|x64\n\t\tDebug|x86 = Debug|x86\n\t\tRelease|x64 = Release|x64\n\t\tRelease|x86 = Release|x86\n\tEndGlobalSection\n\tGlobalSection(ProjectConfigurationPlatforms) = postSolution\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Debug|x64.Build.0 = Debug|x64\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Debug|x86.Build.0 = Debug|Win32\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Release|x64.ActiveCfg = Release|x64\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Release|x64.Build.0 = Release|x64\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Release|x86.ActiveCfg = Release|Win32\n\t\t{E88807F6-B07C-4371-BD38-FB1569F894E4}.Release|x86.Build.0 = Release|Win32\n\tEndGlobalSection\n\tGlobalSection(SolutionProperties) = preSolution\n\t\tHideSolutionNode = FALSE\n\tEndGlobalSection\nEndGlobal\n"
},
{
"path": "MSVC/MyTinySTL_VS2015.vcxproj",
"content": "\n\n \n \n Debug\n Win32\n \n \n Release\n Win32\n \n \n Debug\n x64\n \n \n Release\n x64\n \n \n \n {E88807F6-B07C-4371-BD38-FB1569F894E4}\n Win32Proj\n MyTinySTL\n 8.1\n MyTinySTL\n \n \n \n Application\n true\n v140\n Unicode\n \n \n Application\n false\n v140\n true\n Unicode\n \n \n Application\n true\n v140\n Unicode\n \n \n Application\n false\n v140\n true\n Unicode\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n true\n \n \n true\n \n \n false\n \n \n false\n \n \n \n \n \n Level3\n Disabled\n WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n \n \n \n \n \n \n Level4\n Disabled\n _DEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n \n \n \n \n Level3\n \n \n MaxSpeed\n true\n true\n WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n true\n true\n \n \n \n \n Level4\n \n \n MaxSpeed\n true\n true\n NDEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n true\n true\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n"
},
{
"path": "MSVC/MyTinySTL_VS2015.vcxproj.filters",
"content": "\n\n \n \n {67DA6AB6-F800-4c08-8B7A-83BB121AAD01}\n rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms\n \n \n {93995380-89BD-4b04-88EB-625FBE52EBFB}\n h;hh;hpp;hxx;hm;inl;inc;xsd\n \n \n {4FC737F1-C7A5-4376-A066-2A32D752A2FF}\n cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx\n \n \n {ec314ff3-dcde-4cac-a63a-4f6827750d0a}\n \n \n {c6f24d77-e6f0-439e-954a-c0ca577689d5}\n \n \n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n include\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\n \n \n test\\Lib\n \n \n test\\Lib\n \n \n include\n \n \n include\n \n \n include\n \n \n \n \n test\n \n \n"
},
{
"path": "MyTinySTL/algo.h",
"content": "#ifndef MYTINYSTL_ALGO_H_\n#define MYTINYSTL_ALGO_H_\n\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4244)\n#endif\n\n// 这个头文件包含了 mystl 的一系列算法\n\n#include \n#include \n\n#include \"algobase.h\"\n#include \"memory.h\"\n#include \"heap_algo.h\"\n#include \"functional.h\"\n\nnamespace mystl\n{\n\n/*****************************************************************************************/\n// all_of\n// 检查[first, last)内是否全部元素都满足一元操作 unary_pred 为 true 的情况，满足则返回 true\n/*****************************************************************************************/\ntemplate \nbool all_of(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (!unary_pred(*first))\n return false;\n }\n return true;\n}\n\n/*****************************************************************************************/\n// any_of\n// 检查[first, last)内是否存在某个元素满足一元操作 unary_pred 为 true 的情况，满足则返回 true\n/*****************************************************************************************/\ntemplate \nbool any_of(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n return true;\n }\n return false;\n}\n\n/*****************************************************************************************/\n// none_of\n// 检查[first, last)内是否全部元素都不满足一元操作 unary_pred 为 true 的情况，满足则返回 true\n/*****************************************************************************************/\ntemplate \nbool none_of(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n return false;\n }\n return true;\n}\n\n/*****************************************************************************************/\n// count\n// 对[first, last)区间内的元素与给定值进行比较，缺省使用 operator==，返回元素相等的个数\n/*****************************************************************************************/\ntemplate \nsize_t count(InputIter first, InputIter last, const T& value)\n{\n size_t n = 0;\n for (; first != last; ++first)\n {\n if (*first == value)\n ++n;\n }\n return n;\n}\n\n/*****************************************************************************************/\n// count_if\n// 对[first, last)区间内的每个元素都进行一元 unary_pred 操作，返回结果为 true 的个数\n/*****************************************************************************************/\ntemplate \nsize_t count_if(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n size_t n = 0;\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n ++n;\n }\n return n;\n}\n\n/*****************************************************************************************/\n// find\n// 在[first, last)区间内找到等于 value 的元素，返回指向该元素的迭代器\n/*****************************************************************************************/\ntemplate \nInputIter\nfind(InputIter first, InputIter last, const T& value)\n{\n while (first != last && *first != value)\n ++first;\n return first;\n}\n\n/*****************************************************************************************/\n// find_if\n// 在[first, last)区间内找到第一个令一元操作 unary_pred 为 true 的元素并返回指向该元素的迭代器\n/*****************************************************************************************/\ntemplate \nInputIter\nfind_if(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n while (first != last && !unary_pred(*first))\n ++first;\n return first;\n}\n\n/*****************************************************************************************/\n// find_if_not\n// 在[first, last)区间内找到第一个令一元操作 unary_pred 为 false 的元素并返回指向该元素的迭代器\n/*****************************************************************************************/\ntemplate \nInputIter\nfind_if_not(InputIter first, InputIter last, UnaryPredicate unary_pred)\n{\n while (first != last && unary_pred(*first))\n ++first;\n return first;\n}\n\n/*****************************************************************************************/\n// search\n// 在[first1, last1)中查找[first2, last2)的首次出现点\n/*****************************************************************************************/\ntemplate \nForwardIter1\nsearch(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2)\n{\n auto d1 = mystl::distance(first1, last1);\n auto d2 = mystl::distance(first2, last2);\n if (d1 < d2)\n return last1;\n auto current1 = first1;\n auto current2 = first2;\n while (current2 != last2)\n {\n if (*current1 == *current2)\n {\n ++current1;\n ++current2;\n }\n else\n {\n if (d1 == d2)\n {\n return last1;\n }\n else\n {\n current1 = ++first1;\n current2 = first2;\n --d1;\n }\n }\n }\n return first1;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter1\nsearch(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2, Compared comp)\n{\n auto d1 = mystl::distance(first1, last1);\n auto d2 = mystl::distance(first2, last2);\n if (d1 < d2)\n return last1;\n auto current1 = first1;\n auto current2 = first2;\n while (current2 != last2)\n {\n if (comp(*current1, *current2))\n {\n ++current1;\n ++current2;\n }\n else\n {\n if (d1 == d2)\n {\n return last1;\n }\n else\n {\n current1 = ++first1;\n current2 = first2;\n --d1;\n }\n }\n }\n return first1;\n}\n\n/*****************************************************************************************/\n// search_n\n// 在[first, last)中查找连续 n 个 value 所形成的子序列，返回一个迭代器指向该子序列的起始处\n/*****************************************************************************************/\ntemplate \nForwardIter\nsearch_n(ForwardIter first, ForwardIter last, Size n, const T& value)\n{\n if (n <= 0)\n {\n return first;\n }\n else\n {\n first = mystl::find(first, last, value);\n while (first != last)\n {\n auto m = n - 1;\n auto i = first;\n ++i;\n while (i != last && m != 0 && *i == value)\n {\n ++i;\n --m;\n }\n if (m == 0)\n {\n return first;\n }\n else\n {\n first = mystl::find(i, last, value);\n }\n }\n return last;\n }\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter\nsearch_n(ForwardIter first, ForwardIter last,\n Size n, const T& value, Compared comp)\n{\n if (n <= 0)\n {\n return first;\n }\n else\n {\n while (first != last)\n {\n if (comp(*first, value))\n break;\n ++first;\n }\n while (first != last)\n {\n auto m = n - 1;\n auto i = first;\n ++i;\n while (i != last && m != 0 && comp(*i, value))\n {\n ++i;\n --m;\n }\n if (m == 0)\n {\n return first;\n }\n else\n {\n while (i != last)\n {\n if (comp(*i, value))\n break;\n ++i;\n }\n first = i;\n }\n }\n return last;\n }\n}\n\n/*****************************************************************************************/\n// find_end\n// 在[first1, last1)区间中查找[first2, last2)最后一次出现的地方，若不存在返回 last1\n/*****************************************************************************************/\n// find_end_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter1\nfind_end_dispatch(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2,\n forward_iterator_tag, forward_iterator_tag)\n{\n if (first2 == last2)\n {\n return last1;\n }\n else\n {\n auto result = last1;\n while (true)\n {\n // 利用 search 查找某个子序列的首次出现点，找不到则返回 last1\n auto new_result = mystl::search(first1, last1, first2, last2);\n if (new_result == last1)\n {\n return result;\n }\n else\n {\n result = new_result;\n first1 = new_result;\n ++first1;\n }\n }\n }\n}\n\n// find_end_dispatch 的 bidirectional_iterator_tag 版本\ntemplate \nBidirectionalIter1\nfind_end_dispatch(BidirectionalIter1 first1, BidirectionalIter1 last1,\n BidirectionalIter2 first2, BidirectionalIter2 last2,\n bidirectional_iterator_tag, bidirectional_iterator_tag)\n{\n typedef reverse_iterator reviter1;\n typedef reverse_iterator reviter2;\n reviter1 rlast1(first1);\n reviter2 rlast2(first2);\n reviter1 rresult = mystl::search(reviter1(last1), rlast1, reviter2(last2), rlast2);\n if (rresult == rlast1)\n {\n return last1;\n }\n else\n {\n auto result = rresult.base();\n mystl::advance(result, -mystl::distance(first2, last2));\n return result;\n }\n}\n\ntemplate \nForwardIter1\nfind_end(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2)\n{\n typedef typename iterator_traits::iterator_category Category1;\n typedef typename iterator_traits::iterator_category Category2;\n return mystl::find_end_dispatch(first1, last1, first2, last2, Category1(), Category2());\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// find_end_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter1\nfind_end_dispatch(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2,\n forward_iterator_tag, forward_iterator_tag, Compared comp)\n{\n if (first2 == last2)\n {\n return last1;\n }\n else\n {\n auto result = last1;\n while (true)\n {\n // 利用 search 查找某个子序列的首次出现点，找不到则返回 last1\n auto new_result = mystl::search(first1, last1, first2, last2, comp);\n if (new_result == last1)\n {\n return result;\n }\n else\n {\n result = new_result;\n first1 = new_result;\n ++first1;\n }\n }\n }\n}\n\n// find_end_dispatch 的 bidirectional_iterator_tag 版本\ntemplate \nBidirectionalIter1\nfind_end_dispatch(BidirectionalIter1 first1, BidirectionalIter1 last1,\n BidirectionalIter2 first2, BidirectionalIter2 last2,\n bidirectional_iterator_tag, bidirectional_iterator_tag, Compared comp)\n{\n typedef reverse_iterator reviter1;\n typedef reverse_iterator reviter2;\n reviter1 rlast1(first1);\n reviter2 rlast2(first2);\n reviter1 rresult = mystl::search(reviter1(last1), rlast1, reviter2(last2), rlast2, comp);\n if (rresult == rlast1)\n {\n return last1;\n }\n else\n {\n auto result = rresult.base();\n mystl::advance(result, -mystl::distance(first2, last2));\n return result;\n }\n}\n\ntemplate \nForwardIter1\nfind_end(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2, Compared comp)\n{\n typedef typename iterator_traits::iterator_category Category1;\n typedef typename iterator_traits::iterator_category Category2;\n return mystl::find_end_dispatch(first1, last1, first2, last2, Category1(), Category2(), comp);\n}\n\n/*****************************************************************************************/\n// find_first_of\n// 在[first1, last1)中查找[first2, last2)中的某些元素，返回指向第一次出现的元素的迭代器\n/*****************************************************************************************/\ntemplate \nInputIter\nfind_first_of(InputIter first1, InputIter last1,\n ForwardIter first2, ForwardIter last2)\n{\n for (; first1 != last1; ++first1)\n {\n for (auto iter = first2; iter != last2; ++iter)\n {\n if (*first1 == *iter)\n return first1;\n }\n }\n return last1;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nInputIter\nfind_first_of(InputIter first1, InputIter last1,\n ForwardIter first2, ForwardIter last2, Compared comp)\n{\n for (; first1 != last1; ++first1)\n {\n for (auto iter = first2; iter != last2; ++iter)\n {\n if (comp(*first1, *iter))\n return first1;\n }\n }\n return last1;\n}\n\n/*****************************************************************************************/\n// for_each\n// 使用一个函数对象 f 对[first, last)区间内的每个元素执行一个 operator() 操作，但不能改变元素内容\n// f() 可返回一个值，但该值会被忽略\n/*****************************************************************************************/\ntemplate \nFunction for_each(InputIter first, InputIter last, Function f)\n{\n for (; first != last; ++first)\n {\n f(*first);\n }\n return f;\n}\n\n/*****************************************************************************************/\n// adjacent_find\n// 找出第一对匹配的相邻元素，缺省使用 operator== 比较，如果找到返回一个迭代器，指向这对元素的第一个元素\n/*****************************************************************************************/\ntemplate \nForwardIter adjacent_find(ForwardIter first, ForwardIter last)\n{\n if (first == last) return last;\n auto next = first;\n while (++next != last)\n {\n if (*first == *next) return first;\n first = next;\n }\n return last;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter adjacent_find(ForwardIter first, ForwardIter last, Compared comp)\n{\n if (first == last) return last;\n auto next = first;\n while (++next != last)\n {\n if (comp(*first, *next)) return first;\n first = next;\n }\n return last;\n}\n\n/*****************************************************************************************/\n// lower_bound\n// 在[first, last)中查找第一个不小于 value 的元素，并返回指向它的迭代器，若没有则返回 last\n/*****************************************************************************************/\n// lbound_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nlbound_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (*middle < value)\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n else\n {\n len = half;\n }\n }\n return first;\n}\n\n// lbound_dispatch 的 random_access_iterator_tag 版本\ntemplate \nRandomIter\nlbound_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (*middle < value)\n {\n first = middle + 1;\n len = len - half - 1;\n }\n else\n {\n len = half;\n }\n }\n return first;\n}\n\ntemplate \nForwardIter\nlower_bound(ForwardIter first, ForwardIter last, const T& value)\n{\n return mystl::lbound_dispatch(first, last, value, iterator_category(first));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// lbound_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nlbound_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag, Compared comp)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (comp(*middle, value))\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n else\n {\n len = half;\n }\n }\n return first;\n}\n\n// lbound_dispatch 的 random_access_iterator_tag 版本\ntemplate \nRandomIter\nlbound_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag, Compared comp)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (comp(*middle, value))\n {\n first = middle + 1;\n len = len - half - 1;\n }\n else\n {\n len = half;\n }\n }\n return first;\n}\n\ntemplate \nForwardIter\nlower_bound(ForwardIter first, ForwardIter last, const T& value, Compared comp)\n{\n return mystl::lbound_dispatch(first, last, value, iterator_category(first), comp);\n}\n\n/*****************************************************************************************/\n// upper_bound\n// 在[first, last)中查找第一个大于value 的元素，并返回指向它的迭代器，若没有则返回 last\n/*****************************************************************************************/\n// ubound_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nubound_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (value < *middle)\n {\n len = half;\n }\n else\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n }\n return first;\n}\n\n// ubound_dispatch 的 random_access_iterator_tag 版本\ntemplate \nRandomIter\nubound_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (value < *middle)\n {\n len = half;\n }\n else\n {\n first = middle + 1;\n len = len - half - 1;\n }\n }\n return first;\n}\n\ntemplate \nForwardIter\nupper_bound(ForwardIter first, ForwardIter last, const T& value)\n{\n return mystl::ubound_dispatch(first, last, value, iterator_category(first));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// ubound_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nubound_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag, Compared comp)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (comp(value, *middle))\n {\n len = half;\n }\n else\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n }\n return first;\n}\n\n// ubound_dispatch 的 random_access_iterator_tag 版本\ntemplate \nRandomIter\nubound_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag, Compared comp)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (comp(value, *middle))\n {\n len = half;\n }\n else\n {\n first = middle + 1;\n len = len - half - 1;\n }\n }\n return first;\n}\n\ntemplate \nForwardIter\nupper_bound(ForwardIter first, ForwardIter last, const T& value, Compared comp)\n{\n return mystl::ubound_dispatch(first, last, value, iterator_category(first), comp);\n}\n\n/*****************************************************************************************/\n// binary_search\n// 二分查找，如果在[first, last)内有等同于 value 的元素，返回 true，否则返回 false\n/*****************************************************************************************/\ntemplate \nbool binary_search(ForwardIter first, ForwardIter last, const T& value)\n{\n auto i = mystl::lower_bound(first, last, value);\n return i != last && !(value < *i);\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool binary_search(ForwardIter first, ForwardIter last, const T& value, Compared comp)\n{\n auto i = mystl::lower_bound(first, last, value);\n return i != last && !comp(value, *i);\n}\n\n/*****************************************************************************************/\n// equal_range\n// 查找[first,last)区间中与 value 相等的元素所形成的区间，返回一对迭代器指向区间首尾\n// 第一个迭代器指向第一个不小于 value 的元素，第二个迭代器指向第一个大于 value 的元素\n/*****************************************************************************************/\n// erange_dispatch 的 forward_iterator_tag 版本\ntemplate \nmystl::pair\nerange_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle, left, right;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (*middle < value)\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n else if (value < *middle)\n {\n len = half;\n }\n else\n {\n left = mystl::lower_bound(first, last, value);\n mystl::advance(first, len);\n right = mystl::upper_bound(++middle, first, value);\n return mystl::pair(left, right);\n }\n }\n return mystl::pair(last, last);\n}\n\n// erange_dispatch 的 random_access_iterator_tag 版本\ntemplate \nmystl::pair\nerange_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle, left, right;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (*middle < value)\n {\n first = middle + 1;\n len = len - half - 1;\n }\n else if (value < *middle)\n {\n len = half;\n }\n else\n {\n left = mystl::lower_bound(first, middle, value);\n right = mystl::upper_bound(++middle, first + len, value);\n return mystl::pair(left, right);\n }\n }\n return mystl::pair(last, last);\n}\n\ntemplate \nmystl::pair\nequal_range(ForwardIter first, ForwardIter last, const T& value)\n{\n return mystl::erange_dispatch(first, last, value, iterator_category(first));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// erange_dispatch 的 forward iterator 版本\ntemplate \nmystl::pair\nerange_dispatch(ForwardIter first, ForwardIter last,\n const T& value, forward_iterator_tag, Compared comp)\n{\n auto len = mystl::distance(first, last);\n auto half = len;\n ForwardIter middle, left, right;\n while (len > 0)\n {\n half = len >> 1;\n middle = first;\n mystl::advance(middle, half);\n if (comp(*middle, value))\n {\n first = middle;\n ++first;\n len = len - half - 1;\n }\n else if (comp(value, *middle))\n {\n len = half;\n }\n else\n {\n left = mystl::lower_bound(first, last, value, comp);\n mystl::advance(first, len);\n right = mystl::upper_bound(++middle, first, value, comp);\n return mystl::pair(left, right);\n }\n }\n return mystl::pair(last, last);\n}\n\n// erange_dispatch 的 random access iterator 版本\ntemplate \nmystl::pair\nerange_dispatch(RandomIter first, RandomIter last,\n const T& value, random_access_iterator_tag, Compared comp)\n{\n auto len = last - first;\n auto half = len;\n RandomIter middle, left, right;\n while (len > 0)\n {\n half = len >> 1;\n middle = first + half;\n if (comp(*middle, value))\n {\n first = middle + 1;\n len = len - half - 1;\n }\n else if (comp(value, *middle))\n {\n len = half;\n }\n else\n {\n left = mystl::lower_bound(first, middle, value, comp);\n right = mystl::upper_bound(++middle, first + len, value, comp);\n return mystl::pair(left, right);\n }\n }\n return mystl::pair(last, last);\n}\n\ntemplate \nmystl::pair\nequal_range(ForwardIter first, ForwardIter last, const T& value, Compared comp)\n{\n return mystl::erange_dispatch(first, last, value, iterator_category(first), comp);\n}\n\n/*****************************************************************************************/\n// generate\n// 将函数对象 gen 的运算结果对[first, last)内的每个元素赋值\n/*****************************************************************************************/\ntemplate \nvoid generate(ForwardIter first, ForwardIter last, Generator gen)\n{\n for (; first != last; ++first)\n {\n *first = gen();\n }\n}\n\n/*****************************************************************************************/\n// generate_n\n// 用函数对象 gen 连续对 n 个元素赋值\n/*****************************************************************************************/\ntemplate \nvoid generate_n(ForwardIter first, Size n, Generator gen)\n{\n for (; n > 0; --n, ++first)\n {\n *first = gen();\n }\n}\n\n/*****************************************************************************************/\n// includes\n// 判断序列一S1 是否包含序列二S2\n/*****************************************************************************************/\ntemplate \nbool includes(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2)\n{\n while (first1 != last1 && first2 != last2)\n {\n if (*first2 < *first1)\n {\n return false;\n }\n else if (*first1 < *first2)\n {\n ++first1;\n }\n else\n {\n ++first1, ++first2;\n }\n }\n return first2 == last2;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool includes(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2, Compared comp)\n{\n while (first1 != last1 && first2 != last2)\n {\n if (comp(*first2, *first1))\n {\n return false;\n }\n else if (comp(*first1, *first2))\n {\n ++first1;\n }\n else\n {\n ++first1, ++first2;\n }\n }\n return first2 == last2;\n}\n\n/*****************************************************************************************/\n// is_heap\n// 检查[first, last)内的元素是否为一个堆，如果是，则返回 true\n/*****************************************************************************************/\ntemplate \nbool is_heap(RandomIter first, RandomIter last)\n{\n auto n = mystl::distance(first, last);\n auto parent = 0;\n for (auto child = 1; child < n; ++child)\n {\n if (first[parent] < first[child])\n return false;\n if ((child & 1) == 0)\n ++parent;\n }\n return true;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool is_heap(RandomIter first, RandomIter last, Compared comp)\n{\n auto n = mystl::distance(first, last);\n auto parent = 0;\n for (auto child = 1; child < n; ++child)\n {\n if (comp(first[parent], first[child]))\n return false;\n if ((child & 1) == 0)\n ++parent;\n }\n return true;\n}\n\n/*****************************************************************************************/\n// is_sorted\n// 检查[first, last)内的元素是否升序，如果是升序，则返回 true\n/*****************************************************************************************/\ntemplate \nbool is_sorted(ForwardIter first, ForwardIter last)\n{\n if (first == last)\n return true;\n auto next = first;\n ++next;\n for (; next != last; first = next, ++next)\n {\n if (*next < *first)\n return false;\n }\n return true;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool is_sorted(ForwardIter first, ForwardIter last, Compared comp)\n{\n if (first == last)\n return true;\n auto next = first;\n ++next;\n for (; next != last; first = next, ++next)\n {\n if (comp(*next, *first))\n return false;\n }\n return true;\n}\n\n/*****************************************************************************************/\n// median\n// 找出三个值的中间值\n/*****************************************************************************************/\ntemplate \nconst T& median(const T& left, const T& mid, const T& right)\n{\n if (left < mid)\n if (mid < right) // left < mid < right\n return mid;\n else if (left < right) // left < right <= mid\n return right;\n else // right <= left < mid\n return left;\n else if (left < right) // mid <= left < right\n return left;\n else if (mid < right) // mid < right <= left\n return right;\n else // right <= mid <= left\n return mid;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nconst T& median(const T& left, const T& mid, const T& right, Compared comp)\n{\n if (comp(left, mid))\n if (comp(mid, right))\n return mid;\n else if (comp(left, right))\n return right;\n else\n return left;\n else if (comp(left, right))\n return left;\n else if (comp(mid, right))\n return right;\n else\n return mid;\n}\n\n/*****************************************************************************************/\n// max_element\n// 返回一个迭代器，指向序列中最大的元素\n/*****************************************************************************************/\ntemplate \nForwardIter max_element(ForwardIter first, ForwardIter last)\n{\n if (first == last)\n return first;\n auto result = first;\n while (++first != last)\n {\n if (*result < *first)\n result = first;\n }\n return result;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter max_element(ForwardIter first, ForwardIter last, Compared comp)\n{\n if (first == last)\n return first;\n auto result = first;\n while (++first != last)\n {\n if (comp(*result, *first))\n result = first;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// min_element\n// 返回一个迭代器，指向序列中最小的元素\n/*****************************************************************************************/\ntemplate \nForwardIter min_elememt(ForwardIter first, ForwardIter last)\n{\n if (first == last)\n return first;\n auto result = first;\n while (++first != last)\n {\n if (*first < *result)\n result = first;\n }\n return result;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter min_elememt(ForwardIter first, ForwardIter last, Compared comp)\n{\n if (first == last)\n return first;\n auto result = first;\n while (++first != last)\n {\n if (comp(*first, *result))\n result = first;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// swap_ranges\n// 将[first1, last1)从 first2 开始，交换相同个数元素\n// 交换的区间长度必须相同，两个序列不能互相重叠，返回一个迭代器指向序列二最后一个被交换元素的下一位置\n/*****************************************************************************************/\ntemplate \nForwardIter2\nswap_ranges(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2)\n{\n for (; first1 != last1; ++first1, ++first2)\n {\n mystl::iter_swap(first1, first2);\n }\n return first2;\n}\n\n/*****************************************************************************************/\n// transform\n// 第一个版本以函数对象 unary_op 作用于[first, last)中的每个元素并将结果保存至 result 中\n// 第二个版本以函数对象 binary_op 作用于两个序列[first1, last1)、[first2, last2)的相同位置\n/*****************************************************************************************/\ntemplate \nOutputIter\ntransform(InputIter first, InputIter last,\n OutputIter result, UnaryOperation unary_op)\n{\n for (; first != last; ++first, ++result)\n {\n *result = unary_op(*first);\n }\n return result;\n}\n\ntemplate \nOutputIter\ntransform(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, OutputIter result, BinaryOperation binary_op)\n{\n for (; first1 != last1; ++first1, ++first2, ++result)\n {\n *result = binary_op(*first1, *first2);\n }\n return result;\n}\n\n/*****************************************************************************************/\n// remove_copy\n// 移除区间内与指定 value 相等的元素，并将结果复制到以 result 标示起始位置的容器上\n/*****************************************************************************************/\ntemplate \nOutputIter\nremove_copy(InputIter first, InputIter last, OutputIter result, const T& value)\n{\n for (; first != last; ++first)\n {\n if (*first != value)\n {\n *result++ = *first;\n }\n }\n return result;\n}\n\n/*****************************************************************************************/\n// remove\n// 移除所有与指定 value 相等的元素\n// 并不从容器中删除这些元素，所以 remove 和 remove_if 不适用于 array\n/*****************************************************************************************/\ntemplate \nForwardIter remove(ForwardIter first, ForwardIter last, const T& value)\n{\n first = mystl::find(first, last, value); // 利用 find 找出第一个匹配的地方\n auto next = first;\n return first == last ? first : mystl::remove_copy(++next, last, first, value);\n}\n\n/*****************************************************************************************/\n// remove_copy_if\n// 移除区间内所有令一元操作 unary_pred 为 true 的元素，并将结果复制到以 result 为起始位置的容器上\n/*****************************************************************************************/\ntemplate \nOutputIter\nremove_copy_if(InputIter first, InputIter last,\n OutputIter result, UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (!unary_pred(*first))\n {\n *result = *first;\n ++result;\n }\n }\n return result;\n}\n\n/*****************************************************************************************/\n// remove_if\n// 移除区间内所有令一元操作 unary_pred 为 true 的元素\n/*****************************************************************************************/\ntemplate \nForwardIter\nremove_if(ForwardIter first, ForwardIter last, UnaryPredicate unary_pred)\n{\n first = mystl::find_if(first, last, unary_pred); // 利用 find_if 找出第一个匹配的地方\n auto next = first;\n return first == last ? first : mystl::remove_copy_if(++next, last, first, unary_pred);\n}\n\n/*****************************************************************************************/\n// replace\n// 将区间内所有的 old_value 都以 new_value 替代\n/*****************************************************************************************/\ntemplate \nvoid replace(ForwardIter first, ForwardIter last,\n const T& old_value, const T& new_value)\n{\n for (; first != last; ++first)\n {\n if (*first == old_value)\n *first = new_value;\n }\n}\n\n/*****************************************************************************************/\n// replace_copy\n// 行为与 replace 类似，不同的是将结果复制到 result 所指的容器中，原序列没有改变\n/*****************************************************************************************/\ntemplate \nOutputIter\nreplace_copy(InputIter first, InputIter last,\n OutputIter result, const T& old_value, const T& new_value)\n{\n for (; first != last; ++first, ++result)\n {\n *result = *first == old_value ? new_value : *first;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// replace_copy_if\n// 行为与 replace_if 类似，不同的是将结果复制到 result 所指的容器中，原序列没有改变\n/*****************************************************************************************/\ntemplate \nOutputIter\nreplace_copy_if(InputIter first, InputIter last,\n OutputIter result, UnaryPredicate unary_pred, const T& new_value)\n{\n for (; first != last; ++first, ++result)\n {\n *result = unary_pred(*first) ? new_value : *first;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// replace_if\n// 将区间内所有令一元操作 unary_pred 为 true 的元素都用 new_value 替代\n/*****************************************************************************************/\ntemplate \nvoid replace_if(ForwardIter first, ForwardIter last,\n UnaryPredicate unary_pred, const T& new_value)\n{\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n *first = new_value;\n }\n}\n\n/*****************************************************************************************/\n// reverse\n// 将[first, last)区间内的元素反转\n/*****************************************************************************************/\n// reverse_dispatch 的 bidirectional_iterator_tag 版本\ntemplate \nvoid reverse_dispatch(BidirectionalIter first, BidirectionalIter last,\n bidirectional_iterator_tag)\n{\n while (true)\n {\n if (first == last || first == --last)\n return;\n mystl::iter_swap(first++, last);\n }\n}\n\n// reverse_dispatch 的 random_access_iterator_tag 版本\ntemplate \nvoid reverse_dispatch(RandomIter first, RandomIter last,\n random_access_iterator_tag)\n{\n while (first < last)\n mystl::iter_swap(first++, --last);\n}\n\ntemplate \nvoid reverse(BidirectionalIter first, BidirectionalIter last)\n{\n mystl::reverse_dispatch(first, last, iterator_category(first));\n}\n\n/*****************************************************************************************/\n// reverse_copy\n// 行为与 reverse 类似，不同的是将结果复制到 result 所指容器中\n/*****************************************************************************************/\ntemplate \nOutputIter\nreverse_copy(BidirectionalIter first, BidirectionalIter last,\n OutputIter result)\n{\n while (first != last)\n {\n --last;\n *result = *last;\n ++result;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// random_shuffle\n// 将[first, last)内的元素次序随机重排\n// 重载版本使用一个产生随机数的函数对象 rand\n/*****************************************************************************************/\ntemplate \nvoid random_shuffle(RandomIter first, RandomIter last)\n{\n if (first == last)\n return;\n srand((unsigned)time(0));\n for (auto i = first + 1; i != last; ++i)\n {\n mystl::iter_swap(i, first + (rand() % (i - first + 1)));\n }\n}\n\n// 重载版本使用一个产生随机数的函数对象 rand\ntemplate \nvoid random_shuffle(RandomIter first, RandomIter last,\n RandomNumberGenerator& rand)\n{\n if (first == last)\n return;\n auto len = mystl::distance(first, last);\n for (auto i = first + 1; i != last; ++i)\n {\n mystl::iter_swap(i, first + (rand(i - first + 1) % len));\n }\n}\n\n/*****************************************************************************************/\n// rotate\n// 将[first, middle)内的元素和 [middle, last)内的元素互换，可以交换两个长度不同的区间\n// 返回交换后 middle 的位置\n/*****************************************************************************************/\n// rotate_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nrotate_dispatch(ForwardIter first, ForwardIter middle,\n ForwardIter last, forward_iterator_tag)\n{\n auto first2 = middle;\n do\n {\n mystl::swap(*first++, *first2++);\n if (first == middle)\n middle = first2;\n } while (first2 != last); // 后半段移到前面\n\n auto new_middle = first; // 迭代器返回的位置\n first2 = middle;\n while (first2 != last)\n { // 调整剩余元素\n mystl::swap(*first++, *first2++);\n if (first == middle)\n {\n middle = first2;\n }\n else if (first2 == last)\n {\n first2 = middle;\n }\n }\n return new_middle;\n}\n\n// rotate_dispatch 的 bidirectional_iterator_tag 版本\ntemplate \nBidirectionalIter\nrotate_dispatch(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, bidirectional_iterator_tag)\n{\n mystl::reverse_dispatch(first, middle, bidirectional_iterator_tag());\n mystl::reverse_dispatch(middle, last, bidirectional_iterator_tag());\n while (first != middle && middle != last)\n mystl::swap(*first++, *--last);\n if (first == middle)\n {\n mystl::reverse_dispatch(middle, last, bidirectional_iterator_tag());\n return last;\n }\n else\n {\n mystl::reverse_dispatch(first, middle, bidirectional_iterator_tag());\n return first;\n }\n}\n\n// 求最大公因子\ntemplate \nEuclideanRingElement rgcd(EuclideanRingElement m, EuclideanRingElement n)\n{\n while (n != 0)\n {\n auto t = m % n;\n m = n;\n n = t;\n }\n return m;\n}\n\n// rotate_dispatch 的 random_access_iterator_tag 版本\ntemplate \nRandomIter\nrotate_dispatch(RandomIter first, RandomIter middle,\n RandomIter last, random_access_iterator_tag)\n{\n // 因为是 random access iterator，我们可以确定每个元素的位置\n auto n = last - first;\n auto l = middle - first;\n auto r = n - l;\n auto result = first + (last - middle);\n if (l == r)\n {\n mystl::swap_ranges(first, middle, middle);\n return result;\n }\n auto cycle_times = rgcd(n, l);\n for (auto i = 0; i < cycle_times; ++i)\n {\n auto tmp = *first;\n auto p = first;\n if (l < r)\n {\n for (auto j = 0; j < r / cycle_times; ++j)\n {\n if (p > first + r)\n {\n *p = *(p - r);\n p -= r;\n }\n *p = *(p + l);\n p += l;\n }\n }\n else\n {\n for (auto j = 0; j < l / cycle_times - 1; ++j)\n {\n if (p < last - l)\n {\n *p = *(p + l);\n p += l;\n }\n *p = *(p - r);\n p -= r;\n }\n }\n *p = tmp;\n ++first;\n }\n return result;\n}\n\ntemplate \nForwardIter\nrotate(ForwardIter first, ForwardIter middle, ForwardIter last)\n{\n if (first == middle)\n return last;\n if (middle == last)\n return first;\n return mystl::rotate_dispatch(first, middle, last, iterator_category(first));\n}\n\n/*****************************************************************************************/\n// rotate_copy\n// 行为与 rotate 类似，不同的是将结果复制到 result 所指的容器中\n/*****************************************************************************************/\ntemplate \nForwardIter\nrotate_copy(ForwardIter first, ForwardIter middle,\n ForwardIter last, OutputIter result)\n{\n return mystl::copy(first, middle, mystl::copy(middle, last, result));\n}\n\n/*****************************************************************************************/\n// is_permutation\n// 判断[first1,last1)是否为[first2, last2)的排列组合\n/*****************************************************************************************/\ntemplate \nbool is_permutation_aux(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2,\n BinaryPred pred)\n{\n constexpr bool is_ra_it = mystl::is_random_access_iterator::value\n && mystl::is_random_access_iterator::value;\n if (is_ra_it)\n {\n auto len1 = last1 - first1;\n auto len2 = last2 - first2;\n if (len1 != len2)\n return false;\n }\n\n // 先找出相同的前缀段\n for (; first1 != last1 && first2 != last2; ++first1, (void) ++first2)\n {\n if (!pred(*first1, *first2))\n break;\n }\n if (is_ra_it)\n {\n if (first1 == last1)\n return true;\n }\n else\n {\n auto len1 = mystl::distance(first1, last1);\n auto len2 = mystl::distance(first2, last2);\n if (len1 == 0 && len2 == 0)\n return true;\n if (len1 != len2)\n return false;\n }\n\n // 判断剩余部分\n for (auto i = first1; i != last1; ++i)\n {\n bool is_repeated = false;\n for (auto j = first1; j != i; ++j)\n {\n if (pred(*j, *i))\n {\n is_repeated = true;\n break;\n }\n }\n\n if (!is_repeated)\n {\n // 计算 *i 在 [first2, last2) 的数目\n auto c2 = 0;\n for (auto j = first2; j != last2; ++j)\n {\n if (pred(*i, *j))\n ++c2;\n }\n if (c2 == 0)\n return false;\n\n // 计算 *i 在 [first1, last1) 的数目\n auto c1 = 1;\n auto j = i;\n for (++j; j != last1; ++j)\n {\n if (pred(*i, *j))\n ++c1;\n }\n if (c1 != c2)\n return false;\n }\n }\n return true;\n}\n\ntemplate \nbool is_permutation(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2,\n BinaryPred pred)\n{\n return is_permutation_aux(first1, last1, first2, last2, pred);\n}\n\ntemplate \nbool is_permutation(ForwardIter1 first1, ForwardIter1 last1,\n ForwardIter2 first2, ForwardIter2 last2)\n{\n typedef typename iterator_traits::value_type v1;\n typedef typename iterator_traits::value_type v2;\n static_assert(std::is_same::value,\n \"the type should be same in mystl::is_permutation\");\n return is_permutation_aux(first1, last1, first2, last2,\n mystl::equal_to());\n}\n\n/*****************************************************************************************/\n// next_permutation\n// 取得[first, last)所标示序列的下一个排列组合，如果没有下一个排序组合，返回 false，否则返回 true\n/*****************************************************************************************/\ntemplate \nbool next_permutation(BidirectionalIter first, BidirectionalIter last)\n{\n auto i = last;\n if (first == last || first == --i)\n return false;\n for (;;)\n {\n auto ii = i;\n if (*--i < *ii)\n { // 找到第一对小于关系的元素\n auto j = last;\n while (!(*i < *--j)) {}\n mystl::iter_swap(i, j); // 交换 i，j 所指元素\n mystl::reverse(ii, last); // 将 ii 之后的所有元素反转\n return true;\n }\n if (i == first)\n {\n mystl::reverse(first, last);\n return false;\n }\n }\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool next_permutation(BidirectionalIter first, BidirectionalIter last, Compared comp)\n{\n auto i = last;\n if (first == last || first == --i)\n return false;\n for (;;)\n {\n auto ii = i;\n if (comp(*--i, *ii))\n {\n auto j = last;\n while (!comp(*i, *--j)) {}\n mystl::iter_swap(i, j); // 交换 i，j 所指元素\n mystl::reverse(ii, last); // 将 ii 之后的所有元素反转\n return true;\n }\n if (i == first)\n {\n mystl::reverse(first, last);\n return false;\n }\n }\n}\n\n/*****************************************************************************************/\n// prev_permutation\n// 取得[first, last)所标示序列的上一个排列组合，如果没有上一个排序组合，返回 false，否则返回 true\n/*****************************************************************************************/\ntemplate \nbool prev_permutation(BidirectionalIter first, BidirectionalIter last)\n{\n auto i = last;\n if (first == last || first == --i)\n return false;\n for (;;)\n {\n auto ii = i;\n if (*ii < *--i)\n { // 找到第一对大于关系的元素\n auto j = last;\n while (!(*--j < *i)) {}\n mystl::iter_swap(i, j); // 交换i，j\n mystl::reverse(ii, last); // 将 ii 之后的所有元素反转\n return true;\n }\n if (i == first)\n {\n mystl::reverse(first, last);\n return false;\n }\n }\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool prev_permutation(BidirectionalIter first, BidirectionalIter last, Compared comp)\n{\n auto i = last;\n if (first == last || first == --i)\n return false;\n for (;;)\n {\n auto ii = i;\n if (comp(*ii, *--i))\n {\n auto j = last;\n while (!comp(*--j, *i)) {}\n mystl::iter_swap(i, j); // 交换i，j\n mystl::reverse(ii, last); // 将 ii 之后的所有元素反转\n return true;\n }\n if (i == first)\n {\n mystl::reverse(first, last);\n return false;\n }\n }\n}\n\n/*****************************************************************************************/\n// merge\n// 将两个经过排序的集合 S1 和 S2 合并起来置于另一段空间，返回一个迭代器指向最后一个元素的下一位置\n/*****************************************************************************************/\ntemplate \nOutputIter\nmerge(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2,\n OutputIter result)\n{\n while (first1 != last1 && first2 != last2)\n {\n if (*first2 < *first1)\n {\n *result = *first2;\n ++first2;\n }\n else\n {\n *result = *first1;\n ++first1;\n }\n ++result;\n }\n return mystl::copy(first2, last2, mystl::copy(first1, last1, result));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nOutputIter\nmerge(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2,\n OutputIter result, Compared comp)\n{\n while (first1 != last1 && first2 != last2)\n {\n if (comp(*first2, *first1))\n {\n *result = *first2;\n ++first2;\n }\n else\n {\n *result = *first1;\n ++first1;\n }\n ++result;\n }\n return mystl::copy(first2, last2, mystl::copy(first1, last1, result));\n}\n\n/*****************************************************************************************/\n// inplace_merge\n// 把连接在一起的两个有序序列结合成单一序列并保持有序\n/*****************************************************************************************/\n// 没有缓冲区的情况下合并\ntemplate \nvoid merge_without_buffer(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, Distance len1, Distance len2)\n{\n if (len1 == 0 || len2 == 0)\n return;\n if (len1 + len2 == 2)\n {\n if (*middle < *first)\n mystl::iter_swap(first, middle);\n return;\n }\n auto first_cut = first;\n auto second_cut = middle;\n Distance len11 = 0;\n Distance len22 = 0;\n if (len1 > len2)\n { // 序列一较长，找到序列一的中点\n len11 = len1 >> 1;\n mystl::advance(first_cut, len11);\n second_cut = mystl::lower_bound(middle, last, *first_cut);\n len22 = mystl::distance(middle, second_cut);\n }\n else\n { // 序列二较长，找到序列二的中点\n len22 = len2 >> 1;\n mystl::advance(second_cut, len22);\n first_cut = mystl::upper_bound(first, middle, *second_cut);\n len11 = mystl::distance(first, first_cut);\n }\n auto new_middle = mystl::rotate(first_cut, middle, second_cut);\n mystl::merge_without_buffer(first, first_cut, new_middle, len11, len22);\n mystl::merge_without_buffer(new_middle, second_cut, last, len1 - len11, len2 - len22);\n}\n\ntemplate \nBidirectionalIter1\nmerge_backward(BidirectionalIter1 first1, BidirectionalIter1 last1,\n BidirectionalIter2 first2, BidirectionalIter2 last2,\n BidirectionalIter1 result)\n{\n if (first1 == last1)\n return mystl::copy_backward(first2, last2, result);\n if (first2 == last2)\n return mystl::copy_backward(first1, last1, result);\n --last1;\n --last2;\n while (true)\n {\n if (*last2 < *last1)\n {\n *--result = *last1;\n if (first1 == last1)\n return mystl::copy_backward(first2, ++last2, result);\n --last1;\n }\n else\n {\n *--result = *last2;\n if (first2 == last2)\n return mystl::copy_backward(first1, ++last1, result);\n --last2;\n }\n }\n}\n\ntemplate \nBidirectionalIter1\nrotate_adaptive(BidirectionalIter1 first, BidirectionalIter1 middle,\n BidirectionalIter1 last, Distance len1, Distance len2,\n BidirectionalIter2 buffer, Distance buffer_size)\n{\n BidirectionalIter2 buffer_end;\n if (len1 > len2 && len2 <= buffer_size)\n {\n buffer_end = mystl::copy(middle, last, buffer);\n mystl::copy_backward(first, middle, last);\n return mystl::copy(buffer, buffer_end, first);\n }\n else if (len1 <= buffer_size)\n {\n buffer_end = mystl::copy(first, middle, buffer);\n mystl::copy(middle, last, first);\n return mystl::copy_backward(buffer, buffer_end, last);\n }\n else\n {\n return mystl::rotate(first, middle, last);\n }\n}\n\n// 有缓冲区的情况下合并\ntemplate \nvoid merge_adaptive(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, Distance len1, Distance len2,\n Pointer buffer, Distance buffer_size)\n{\n // 区间长度足够放进缓冲区\n if (len1 <= len2 && len1 <= buffer_size)\n {\n Pointer buffer_end = mystl::copy(first, middle, buffer);\n mystl::merge(buffer, buffer_end, middle, last, first);\n }\n else if (len2 <= buffer_size)\n {\n Pointer buffer_end = mystl::copy(middle, last, buffer);\n mystl::merge_backward(first, middle, buffer, buffer_end, last);\n }\n else\n { // 区间长度太长，分割递归处理\n auto first_cut = first;\n auto second_cut = middle;\n Distance len11 = 0;\n Distance len22 = 0;\n if (len1 > len2)\n {\n len11 = len1 >> 1;\n mystl::advance(first_cut, len11);\n second_cut = mystl::lower_bound(middle, last, *first_cut);\n len22 = mystl::distance(middle, second_cut);\n }\n else\n {\n len22 = len2 >> 1;\n mystl::advance(second_cut, len22);\n first_cut = mystl::upper_bound(first, middle, *second_cut);\n len11 = mystl::distance(first, first_cut);\n }\n auto new_middle = mystl::rotate_adaptive(first_cut, middle, second_cut,\n len1 - len11, len22, buffer, buffer_size);\n mystl::merge_adaptive(first, first_cut, new_middle, len11, len22, buffer, buffer_size);\n mystl::merge_adaptive(new_middle, second_cut, last, len1 - len11,\n len2 - len22, buffer, buffer_size);\n }\n}\n\ntemplate \nvoid\ninplace_merge_aux(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, T*)\n{\n auto len1 = mystl::distance(first, middle);\n auto len2 = mystl::distance(middle, last);\n temporary_buffer buf(first, last);\n if (!buf.begin())\n {\n mystl::merge_without_buffer(first, middle, last, len1, len2);\n }\n else\n {\n mystl::merge_adaptive(first, middle, last, len1, len2, buf.begin(), buf.size());\n }\n}\n\ntemplate \nvoid\ninplace_merge(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last)\n{\n if (first == middle || middle == last)\n return;\n mystl::inplace_merge_aux(first, middle, last, value_type(first));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// 没有缓冲区的情况下合并\ntemplate \nvoid merge_without_buffer(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, Distance len1, Distance len2,\n Compared comp)\n{\n if (len1 == 0 || len2 == 0)\n return;\n if (len1 + len2 == 2)\n {\n if (comp(*middle, *first))\n mystl::iter_swap(first, middle);\n return;\n }\n auto first_cut = first;\n auto second_cut = middle;\n Distance len11 = 0;\n Distance len22 = 0;\n if (len1 > len2)\n {\n len11 = len1 >> 1;\n mystl::advance(first_cut, len11);\n second_cut = mystl::lower_bound(middle, last, *first_cut, comp);\n len22 = mystl::distance(middle, second_cut);\n }\n else\n {\n len22 = len2 >> 1;\n mystl::advance(second_cut, len22);\n first_cut = mystl::upper_bound(first, middle, *second_cut, comp);\n len11 = mystl::distance(first, first_cut);\n }\n auto new_middle = mystl::rotate(first_cut, middle, second_cut);\n mystl::merge_without_buffer(first, first_cut, new_middle, len11, len22, comp);\n mystl::merge_without_buffer(new_middle, second_cut, last, len1 - len11, len2 - len22, comp);\n}\n\ntemplate \nBidirectionalIter1\nmerge_backward(BidirectionalIter1 first1, BidirectionalIter1 last1,\n BidirectionalIter2 first2, BidirectionalIter2 last2,\n BidirectionalIter1 result, Compared comp)\n{\n if (first1 == last1)\n return mystl::copy_backward(first2, last2, result);\n if (first2 == last2)\n return mystl::copy_backward(first1, last1, result);\n --last1;\n --last2;\n while (true)\n {\n if (comp(*last2, *last1))\n {\n *--result = *last1;\n if (first1 == last1)\n return mystl::copy_backward(first2, ++last2, result);\n --last1;\n }\n else\n {\n *--result = *last2;\n if (first2 == last2)\n return mystl::copy_backward(first1, ++last1, result);\n --last2;\n }\n }\n}\n\n// 有缓冲区的情况下合并\ntemplate \nvoid merge_adaptive(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, Distance len1, Distance len2,\n Pointer buffer, Distance buffer_size, Compared comp)\n{\n // 区间长度足够放进缓冲区\n if (len1 <= len2 && len1 <= buffer_size)\n {\n Pointer buffer_end = mystl::copy(first, middle, buffer);\n mystl::merge(buffer, buffer_end, middle, last, first, comp);\n }\n else if (len2 <= buffer_size)\n {\n Pointer buffer_end = mystl::copy(middle, last, buffer);\n mystl::merge_backward(first, middle, buffer, buffer_end, last, comp);\n }\n else\n { // 区间长度太长，分割递归处理\n auto first_cut = first;\n auto second_cut = middle;\n Distance len11 = 0;\n Distance len22 = 0;\n if (len1 > len2)\n {\n len11 = len1 >> 1;\n mystl::advance(first_cut, len11);\n second_cut = mystl::lower_bound(middle, last, *first_cut, comp);\n len22 = mystl::distance(middle, second_cut);\n }\n else\n {\n len22 = len2 >> 1;\n mystl::advance(second_cut, len22);\n first_cut = mystl::upper_bound(first, middle, *second_cut, comp);\n len11 = mystl::distance(first, first_cut);\n }\n auto new_middle = mystl::rotate_adaptive(first_cut, middle, second_cut, len1 - len11,\n len22, buffer, buffer_size);\n mystl::merge_adaptive(first, first_cut, new_middle, len11,\n len22, buffer, buffer_size, comp);\n mystl::merge_adaptive(new_middle, second_cut, last, len1 - len11,\n len2 - len22, buffer, buffer_size, comp);\n }\n}\n\ntemplate \nvoid\ninplace_merge_aux(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, T*, Compared comp)\n{\n auto len1 = mystl::distance(first, middle);\n auto len2 = mystl::distance(middle, last);\n temporary_buffer buf(first, last);\n if (!buf.begin())\n {\n mystl::merge_without_buffer(first, middle, last, len1, len2, comp);\n }\n else\n {\n mystl::merge_adaptive(first, middle, last, len1, len2, buf.begin(), buf.size(), comp);\n }\n}\n\ntemplate \nvoid\ninplace_merge(BidirectionalIter first, BidirectionalIter middle,\n BidirectionalIter last, Compared comp)\n{\n if (first == middle || middle == last)\n return;\n mystl::inplace_merge_aux(first, middle, last, value_type(first), comp);\n}\n\n/*****************************************************************************************/\n// partial_sort\n// 对整个序列做部分排序，保证较小的 N 个元素以递增顺序置于[first, first + N)中\n/*****************************************************************************************/\ntemplate \nvoid partial_sort(RandomIter first, RandomIter middle,\n RandomIter last)\n{\n mystl::make_heap(first, middle);\n for (auto i = middle; i < last; ++i)\n {\n if (*i < *first)\n {\n mystl::pop_heap_aux(first, middle, i, *i, distance_type(first));\n }\n }\n mystl::sort_heap(first, middle);\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nvoid partial_sort(RandomIter first, RandomIter middle,\n RandomIter last, Compared comp)\n{\n mystl::make_heap(first, middle, comp);\n for (auto i = middle; i < last; ++i)\n {\n if (comp(*i, *first))\n {\n mystl::pop_heap_aux(first, middle, i, *i, distance_type(first), comp);\n }\n }\n mystl::sort_heap(first, middle, comp);\n}\n\n/*****************************************************************************************/\n// partial_sort_copy\n// 行为与 partial_sort 类似，不同的是把排序结果复制到 result 容器中\n/*****************************************************************************************/\ntemplate \nRandomIter\npsort_copy_aux(InputIter first, InputIter last,\n RandomIter result_first, RandomIter result_last,\n Distance*)\n{\n if (result_first == result_last)\n return result_last;\n auto result_iter = result_first;\n while (first != last && result_iter != result_last)\n {\n *result_iter = *first;\n ++result_iter;\n ++first;\n }\n mystl::make_heap(result_first, result_iter);\n while (first != last)\n {\n if (*first < *result_first)\n {\n mystl::adjust_heap(result_first, static_cast(0),\n result_iter - result_first, *first);\n }\n ++first;\n }\n mystl::sort_heap(result_first, result_iter);\n return result_iter;\n}\n\ntemplate \nRandomIter\npartial_sort_copy(InputIter first, InputIter last,\n RandomIter result_first, RandomIter result_last)\n{\n return mystl::psort_copy_aux(first, last, result_first, result_last,\n distance_type(result_first));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nRandomIter\npsort_copy_aux(InputIter first, InputIter last,\n RandomIter result_first, RandomIter result_last,\n Distance*, Compared comp)\n{\n if (result_first == result_last)\n return result_last;\n auto result_iter = result_first;\n while (first != last && result_iter != result_last)\n {\n *result_iter = *first;\n ++result_iter;\n ++first;\n }\n mystl::make_heap(result_first, result_iter, comp);\n while (first != last)\n {\n if (comp(*first, *result_first))\n {\n mystl::adjust_heap(result_first, static_cast(0),\n result_iter - result_first, *first, comp);\n }\n ++first;\n }\n mystl::sort_heap(result_first, result_iter, comp);\n return result_iter;\n}\n\ntemplate \nRandomIter\npartial_sort_copy(InputIter first, InputIter last,\n RandomIter result_first, RandomIter result_last,\n Compared comp)\n{\n return mystl::psort_copy_aux(first, last, result_first, result_last,\n distance_type(result_first), comp);\n}\n/*****************************************************************************************/\n// partition\n// 对区间内的元素重排，被一元条件运算判定为 true 的元素会放到区间的前段\n// 该函数不保证元素的原始相对位置\n/*****************************************************************************************/\ntemplate \nBidirectionalIter\npartition(BidirectionalIter first, BidirectionalIter last,\n UnaryPredicate unary_pred)\n{\n while (true)\n {\n while (first != last && unary_pred(*first))\n {\n ++first;\n }\n if (first == last)\n break;\n --last;\n while (first != last && !unary_pred(*last))\n {\n --last;\n }\n if (first == last)\n break;\n mystl::iter_swap(first, last);\n ++first;\n }\n return first;\n}\n\n/*****************************************************************************************/\n// partition_copy\n// 行为与 partition 类似，不同的是，将被一元操作符判定为 true 的放到 result_true 的输出区间\n// 其余放到 result_false 的输出区间，并返回一个 mystl::pair 指向这两个区间的尾部\n/*****************************************************************************************/\ntemplate \nmystl::pair\npartition_copy(InputIter first, InputIter last,\n OutputIter1 result_true, OutputIter2 result_false,\n UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n {\n *result_true++ = *first;\n }\n else\n {\n *result_false++ = *first;\n }\n }\n return mystl::pair(result_true, result_false);\n}\n\n/*****************************************************************************************/\n// sort\n// 将[first, last)内的元素以递增的方式排序\n/*****************************************************************************************/\nconstexpr static size_t kSmallSectionSize = 128; // 小型区间的大小，在这个大小内采用插入排序\n\n // 用于控制分割恶化的情况\ntemplate \nSize slg2(Size n)\n{ // 找出 lgk <= n 的 k 的最大值\n Size k = 0;\n for (; n > 1; n >>= 1)\n ++k;\n return k;\n}\n\n// 分割函数 unchecked_partition\ntemplate \nRandomIter\nunchecked_partition(RandomIter first, RandomIter last, const T& pivot)\n{\n while (true)\n {\n while (*first < pivot)\n ++first;\n --last;\n while (pivot < *last)\n --last;\n if (!(first < last))\n return first;\n mystl::iter_swap(first, last);\n ++first;\n }\n}\n\n// 内省式排序，先进行 quick sort，当分割行为有恶化倾向时，改用 heap sort\ntemplate \nvoid intro_sort(RandomIter first, RandomIter last, Size depth_limit)\n{\n while (static_cast(last - first) > kSmallSectionSize)\n {\n if (depth_limit == 0)\n { // 到达最大分割深度限制\n mystl::partial_sort(first, last, last); // 改用 heap_sort\n return;\n }\n --depth_limit;\n auto mid = mystl::median(*(first), *(first + (last - first) / 2), *(last - 1));\n auto cut = mystl::unchecked_partition(first, last, mid);\n mystl::intro_sort(cut, last, depth_limit);\n last = cut;\n }\n}\n\n// 插入排序辅助函数 unchecked_linear_insert\ntemplate \nvoid unchecked_linear_insert(RandomIter last, const T& value)\n{\n auto next = last;\n --next;\n while (value < *next)\n {\n *last = *next;\n last = next;\n --next;\n }\n *last = value;\n}\n\n// 插入排序函数 unchecked_insertion_sort\ntemplate \nvoid unchecked_insertion_sort(RandomIter first, RandomIter last)\n{\n for (auto i = first; i != last; ++i)\n {\n mystl::unchecked_linear_insert(i, *i);\n }\n}\n\n// 插入排序函数 insertion_sort\ntemplate \nvoid insertion_sort(RandomIter first, RandomIter last)\n{\n if (first == last)\n return;\n for (auto i = first + 1; i != last; ++i)\n {\n auto value = *i;\n if (value < *first)\n {\n mystl::copy_backward(first, i, i + 1);\n *first = value;\n }\n else\n {\n mystl::unchecked_linear_insert(i, value);\n }\n }\n}\n\n// 最终插入排序函数 final_insertion_sort\ntemplate \nvoid final_insertion_sort(RandomIter first, RandomIter last)\n{\n if (static_cast(last - first) > kSmallSectionSize)\n {\n mystl::insertion_sort(first, first + kSmallSectionSize);\n mystl::unchecked_insertion_sort(first + kSmallSectionSize, last);\n }\n else\n {\n mystl::insertion_sort(first, last);\n }\n}\n\ntemplate \nvoid sort(RandomIter first, RandomIter last)\n{\n if (first != last)\n {\n // 内省式排序，将区间分为一个个小区间，然后对整体进行插入排序\n mystl::intro_sort(first, last, slg2(last - first) * 2);\n mystl::final_insertion_sort(first, last);\n }\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// 分割函数 unchecked_partition\ntemplate \nRandomIter\nunchecked_partition(RandomIter first, RandomIter last,\n const T& pivot, Compared comp)\n{\n while (true)\n {\n while (comp(*first, pivot))\n ++first;\n --last;\n while (comp(pivot, *last))\n --last;\n if (!(first < last))\n return first;\n mystl::iter_swap(first, last);\n ++first;\n }\n}\n\n// 内省式排序，先进行 quick sort，当分割行为有恶化倾向时，改用 heap sort\ntemplate \nvoid intro_sort(RandomIter first, RandomIter last,\n Size depth_limit, Compared comp)\n{\n while (static_cast(last - first) > kSmallSectionSize)\n {\n if (depth_limit == 0)\n { // 到达最大分割深度限制\n mystl::partial_sort(first, last, last, comp); // 改用 heap_sort\n return;\n }\n --depth_limit;\n auto mid = mystl::median(*(first), *(first + (last - first) / 2), *(last - 1));\n auto cut = mystl::unchecked_partition(first, last, mid, comp);\n mystl::intro_sort(cut, last, depth_limit, comp);\n last = cut;\n }\n}\n\n// 插入排序辅助函数 unchecked_linear_insert\ntemplate \nvoid unchecked_linear_insert(RandomIter last, const T& value, Compared comp)\n{\n auto next = last;\n --next;\n while (comp(value, *next))\n { // 从尾部开始寻找第一个可插入位置\n *last = *next;\n last = next;\n --next;\n }\n *last = value;\n}\n\n// 插入排序函数 unchecked_insertion_sort\ntemplate \nvoid unchecked_insertion_sort(RandomIter first, RandomIter last,\n Compared comp)\n{\n for (auto i = first; i != last; ++i)\n {\n mystl::unchecked_linear_insert(i, *i, comp);\n }\n}\n\n// 插入排序函数 insertion_sort\ntemplate \nvoid insertion_sort(RandomIter first, RandomIter last, Compared comp)\n{\n if (first == last)\n return;\n for (auto i = first + 1; i != last; ++i)\n {\n auto value = *i;\n if (comp(value, *first))\n {\n mystl::copy_backward(first, i, i + 1);\n *first = value;\n }\n else\n {\n mystl::unchecked_linear_insert(i, value, comp);\n }\n }\n}\n\n// 最终插入排序函数 final_insertion_sort\ntemplate \nvoid final_insertion_sort(RandomIter first, RandomIter last, Compared comp)\n{\n if (static_cast(last - first) > kSmallSectionSize)\n {\n mystl::insertion_sort(first, first + kSmallSectionSize, comp);\n mystl::unchecked_insertion_sort(first + kSmallSectionSize, last, comp);\n }\n else\n {\n mystl::insertion_sort(first, last, comp);\n }\n}\n\ntemplate \nvoid sort(RandomIter first, RandomIter last, Compared comp)\n{\n if (first != last)\n {\n // 内省式排序，将区间分为一个个小区间，然后对整体进行插入排序\n mystl::intro_sort(first, last, slg2(last - first) * 2, comp);\n mystl::final_insertion_sort(first, last, comp);\n }\n}\n\n/*****************************************************************************************/\n// nth_element\n// 对序列重排，使得所有小于第 n 个元素的元素出现在它的前面，大于它的出现在它的后面\n/*****************************************************************************************/\ntemplate \nvoid nth_element(RandomIter first, RandomIter nth,\n RandomIter last)\n{\n if (nth == last)\n return;\n while (last - first > 3)\n {\n auto cut = mystl::unchecked_partition(first, last, mystl::median(*first,\n\t\t\t\t\t\t\t\t\t\t *(first + (last - first) / 2),\n\t\t\t\t\t\t\t\t\t\t *(last - 1)));\n if (cut <= nth) // 如果 nth 位于右段\n first = cut; // 对右段进行分割\n else\n last = cut; // 对左段进行分割\n }\n mystl::insertion_sort(first, last);\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nvoid nth_element(RandomIter first, RandomIter nth,\n RandomIter last, Compared comp)\n{\n if (nth == last)\n return;\n while (last - first > 3)\n {\n auto cut = mystl::unchecked_partition(first, last, mystl::median(*first, \n\t\t\t\t\t\t\t\t\t\t *(first + (last - first) / 2),\n\t\t\t\t\t\t\t\t\t\t *(last - 1)), comp);\n if (cut <= nth) // 如果 nth 位于右段\n first = cut; // 对右段进行分割\n else\n last = cut; // 对左段进行分割\n }\n mystl::insertion_sort(first, last, comp);\n}\n\n/*****************************************************************************************/\n// unique_copy\n// 从[first, last)中将元素复制到 result 上，序列必须有序，如果有重复的元素，只会复制一次\n/*****************************************************************************************/\n// unique_copy_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nunique_copy_dispatch(InputIter first, InputIter last,\n ForwardIter result, forward_iterator_tag)\n{\n *result = *first;\n while (++first != last)\n {\n if (*result != *first)\n *++result = *first;\n }\n return ++result;\n}\n\n// unique_copy_dispatch 的 output_iterator_tag 版本\n// 由于 output iterator 只能进行只读操作，所以不能有 *result != *first 这样的判断\ntemplate \nOutputIter\nunique_copy_dispatch(InputIter first, InputIter last,\n OutputIter result, output_iterator_tag)\n{\n auto value = *first;\n *result = value;\n while (++first != last)\n {\n if (value != *first)\n {\n value = *first;\n *++result = value;\n }\n }\n return ++result;\n}\n\ntemplate \nOutputIter\nunique_copy(InputIter first, InputIter last, OutputIter result)\n{\n if (first == last)\n return result;\n return mystl::unique_copy_dispatch(first, last, result, iterator_category(result));\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\n// unique_copy_dispatch 的 forward_iterator_tag 版本\ntemplate \nForwardIter\nunique_copy_dispatch(InputIter first, InputIter last,\n ForwardIter result, forward_iterator_tag, Compared comp)\n{\n *result = *first;\n while (++first != last)\n {\n if (!comp(*result, *first))\n *++result = *first;\n }\n return ++result;\n}\n\n// unique_copy_dispatch 的 output_iterator_tag 版本\n// 由于 output iterator 只能进行只读操作，所以不能有 *result != *first 这样的判断\ntemplate \nOutputIter\nunique_copy_dispatch(InputIter first, InputIter last,\n OutputIter result, output_iterator_tag, Compared comp)\n{\n auto value = *first;\n *result = value;\n while (++first != last)\n {\n if (!comp(value, *first))\n {\n value = *first;\n *++result = value;\n }\n }\n return ++result;\n}\n\ntemplate \nOutputIter\nunique_copy(InputIter first, InputIter last, OutputIter result, Compared comp)\n{\n if (first == last)\n return result;\n return mystl::unique_copy_dispatch(first, last, result, iterator_category(result), comp);\n}\n\n/*****************************************************************************************/\n// unique\n// 移除[first, last)内重复的元素，序列必须有序，和 remove 类似，它也不能真正的删除重复元素\n/*****************************************************************************************/\ntemplate \nForwardIter unique(ForwardIter first, ForwardIter last)\n{\n first = mystl::adjacent_find(first, last);\n return mystl::unique_copy(first, last, first);\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nForwardIter unique(ForwardIter first, ForwardIter last, Compared comp)\n{\n first = mystl::adjacent_find(first, last, comp);\n return mystl::unique_copy(first, last, first, comp);\n}\n\n} // namespace mystl\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#endif // !MYTINYSTL_ALGO_H_\n\n"
},
{
"path": "MyTinySTL/algobase.h",
"content": "#ifndef MYTINYSTL_ALGOBASE_H_\n#define MYTINYSTL_ALGOBASE_H_\n\n// 这个头文件包含了 mystl 的基本算法\n\n#include \n\n#include \"iterator.h\"\n#include \"util.h\"\n\nnamespace mystl\n{\n\n#ifdef max\n#pragma message(\"#undefing marco max\")\n#undef max\n#endif // max\n\n#ifdef min\n#pragma message(\"#undefing marco min\")\n#undef min\n#endif // min\n\n/*****************************************************************************************/\n// max\n// 取二者中的较大值，语义相等时保证返回第一个参数\n/*****************************************************************************************/\ntemplate \nconst T& max(const T& lhs, const T& rhs)\n{\n return lhs < rhs ? rhs : lhs;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nconst T& max(const T& lhs, const T& rhs, Compare comp)\n{\n return comp(lhs, rhs) ? rhs : lhs;\n}\n\n/*****************************************************************************************/\n// min \n// 取二者中的较小值，语义相等时保证返回第一个参数\n/*****************************************************************************************/\ntemplate \nconst T& min(const T& lhs, const T& rhs)\n{\n return rhs < lhs ? rhs : lhs;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nconst T& min(const T& lhs, const T& rhs, Compare comp)\n{\n return comp(rhs, lhs) ? rhs : lhs;\n}\n\n/*****************************************************************************************/\n// iter_swap\n// 将两个迭代器所指对象对调\n/*****************************************************************************************/\ntemplate \nvoid iter_swap(FIter1 lhs, FIter2 rhs)\n{\n mystl::swap(*lhs, *rhs);\n}\n\n/*****************************************************************************************/\n// copy\n// 把 [first, last)区间内的元素拷贝到 [result, result + (last - first))内\n/*****************************************************************************************/\n// input_iterator_tag 版本\ntemplate \nOutputIter \nunchecked_copy_cat(InputIter first, InputIter last, OutputIter result, \n mystl::input_iterator_tag)\n{\n for (; first != last; ++first, ++result)\n {\n *result = *first;\n }\n return result;\n}\n\n// ramdom_access_iterator_tag 版本\ntemplate \nOutputIter \nunchecked_copy_cat(RandomIter first, RandomIter last, OutputIter result,\n mystl::random_access_iterator_tag)\n{\n for (auto n = last - first; n > 0; --n, ++first, ++result)\n {\n *result = *first;\n }\n return result;\n}\n\ntemplate \nOutputIter \nunchecked_copy(InputIter first, InputIter last, OutputIter result)\n{\n return unchecked_copy_cat(first, last, result, iterator_category(first));\n}\n\n// 为 trivially_copy_assignable 类型提供特化版本\ntemplate \ntypename std::enable_if<\n std::is_same::type, Up>::value &&\n std::is_trivially_copy_assignable::value,\n Up*>::type\nunchecked_copy(Tp* first, Tp* last, Up* result)\n{\n const auto n = static_cast(last - first);\n if (n != 0)\n std::memmove(result, first, n * sizeof(Up));\n return result + n;\n}\n\ntemplate \nOutputIter copy(InputIter first, InputIter last, OutputIter result)\n{\n return unchecked_copy(first, last, result);\n}\n\n/*****************************************************************************************/\n// copy_backward\n// 将 [first, last)区间内的元素拷贝到 [result - (last - first), result)内\n/*****************************************************************************************/\n// unchecked_copy_backward_cat 的 bidirectional_iterator_tag 版本\ntemplate \nBidirectionalIter2 \nunchecked_copy_backward_cat(BidirectionalIter1 first, BidirectionalIter1 last,\n BidirectionalIter2 result, mystl::bidirectional_iterator_tag)\n{\n while (first != last)\n *--result = *--last;\n return result;\n}\n\n// unchecked_copy_backward_cat 的 random_access_iterator_tag 版本\ntemplate \nBidirectionalIter2 \nunchecked_copy_backward_cat(RandomIter1 first, RandomIter1 last,\n BidirectionalIter2 result, mystl::random_access_iterator_tag)\n{\n for (auto n = last - first; n > 0; --n)\n *--result = *--last;\n return result;\n}\n\ntemplate \nBidirectionalIter2 \nunchecked_copy_backward(BidirectionalIter1 first, BidirectionalIter1 last,\n BidirectionalIter2 result)\n{\n return unchecked_copy_backward_cat(first, last, result,\n iterator_category(first));\n}\n\n// 为 trivially_copy_assignable 类型提供特化版本\ntemplate \ntypename std::enable_if<\n std::is_same::type, Up>::value &&\n std::is_trivially_copy_assignable::value,\n Up*>::type\nunchecked_copy_backward(Tp* first, Tp* last, Up* result)\n{\n const auto n = static_cast(last - first);\n if (n != 0)\n {\n result -= n;\n std::memmove(result, first, n * sizeof(Up));\n }\n return result;\n}\n\ntemplate \nBidirectionalIter2 \ncopy_backward(BidirectionalIter1 first, BidirectionalIter1 last, BidirectionalIter2 result)\n{\n return unchecked_copy_backward(first, last, result);\n}\n\n/*****************************************************************************************/\n// copy_if\n// 把[first, last)内满足一元操作 unary_pred 的元素拷贝到以 result 为起始的位置上\n/*****************************************************************************************/\ntemplate \nOutputIter \ncopy_if(InputIter first, InputIter last, OutputIter result, UnaryPredicate unary_pred)\n{\n for (; first != last; ++first)\n {\n if (unary_pred(*first))\n *result++ = *first;\n }\n return result;\n}\n\n/*****************************************************************************************/\n// copy_n\n// 把 [first, first + n)区间上的元素拷贝到 [result, result + n)上\n// 返回一个 pair 分别指向拷贝结束的尾部\n/*****************************************************************************************/\ntemplate \nmystl::pair\nunchecked_copy_n(InputIter first, Size n, OutputIter result, mystl::input_iterator_tag)\n{\n for (; n > 0; --n, ++first, ++result)\n {\n *result = *first;\n }\n return mystl::pair(first, result);\n}\n\ntemplate \nmystl::pair\nunchecked_copy_n(RandomIter first, Size n, OutputIter result, \n mystl::random_access_iterator_tag)\n{\n auto last = first + n;\n return mystl::pair(last, mystl::copy(first, last, result));\n}\n\ntemplate \nmystl::pair \ncopy_n(InputIter first, Size n, OutputIter result)\n{\n return unchecked_copy_n(first, n, result, iterator_category(first));\n}\n\n/*****************************************************************************************/\n// move\n// 把 [first, last)区间内的元素移动到 [result, result + (last - first))内\n/*****************************************************************************************/\n// input_iterator_tag 版本\ntemplate \nOutputIter \nunchecked_move_cat(InputIter first, InputIter last, OutputIter result,\n mystl::input_iterator_tag)\n{\n for (; first != last; ++first, ++result)\n {\n *result = mystl::move(*first);\n }\n return result;\n}\n\n// ramdom_access_iterator_tag 版本\ntemplate \nOutputIter \nunchecked_move_cat(RandomIter first, RandomIter last, OutputIter result,\n mystl::random_access_iterator_tag)\n{\n for (auto n = last - first; n > 0; --n, ++first, ++result)\n {\n *result = mystl::move(*first);\n }\n return result;\n}\n\ntemplate \nOutputIter \nunchecked_move(InputIter first, InputIter last, OutputIter result)\n{\n return unchecked_move_cat(first, last, result, iterator_category(first));\n}\n\n// 为 trivially_copy_assignable 类型提供特化版本\ntemplate \ntypename std::enable_if<\n std::is_same::type, Up>::value &&\n std::is_trivially_move_assignable::value,\n Up*>::type\nunchecked_move(Tp* first, Tp* last, Up* result)\n{\n const size_t n = static_cast(last - first);\n if (n != 0)\n std::memmove(result, first, n * sizeof(Up));\n return result + n;\n}\n\ntemplate \nOutputIter move(InputIter first, InputIter last, OutputIter result)\n{\n return unchecked_move(first, last, result);\n}\n\n/*****************************************************************************************/\n// move_backward\n// 将 [first, last)区间内的元素移动到 [result - (last - first), result)内\n/*****************************************************************************************/\n// bidirectional_iterator_tag 版本\ntemplate \nBidirectionalIter2\nunchecked_move_backward_cat(BidirectionalIter1 first, BidirectionalIter1 last,\n BidirectionalIter2 result, mystl::bidirectional_iterator_tag)\n{\n while (first != last)\n *--result = mystl::move(*--last);\n return result;\n}\n\n// random_access_iterator_tag 版本\ntemplate \nRandomIter2\nunchecked_move_backward_cat(RandomIter1 first, RandomIter1 last,\n RandomIter2 result, mystl::random_access_iterator_tag)\n{\n for (auto n = last - first; n > 0; --n)\n *--result = mystl::move(*--last);\n return result;\n}\n\ntemplate \nBidirectionalIter2\nunchecked_move_backward(BidirectionalIter1 first, BidirectionalIter1 last, \n BidirectionalIter2 result)\n{\n return unchecked_move_backward_cat(first, last, result,\n iterator_category(first));\n}\n\n// 为 trivially_copy_assignable 类型提供特化版本\ntemplate \ntypename std::enable_if<\n std::is_same::type, Up>::value &&\n std::is_trivially_move_assignable::value,\n Up*>::type\nunchecked_move_backward(Tp* first, Tp* last, Up* result)\n{\n const size_t n = static_cast(last - first);\n if (n != 0)\n {\n result -= n;\n std::memmove(result, first, n * sizeof(Up));\n }\n return result;\n}\n\ntemplate \nBidirectionalIter2\nmove_backward(BidirectionalIter1 first, BidirectionalIter1 last, BidirectionalIter2 result)\n{\n return unchecked_move_backward(first, last, result);\n}\n\n/*****************************************************************************************/\n// equal\n// 比较第一序列在 [first, last)区间上的元素值是否和第二序列相等\n/*****************************************************************************************/\ntemplate \nbool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2)\n{\n for (; first1 != last1; ++first1, ++first2)\n {\n if (*first1 != *first2) \n return false;\n }\n return true;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, Compared comp)\n{\n for (; first1 != last1; ++first1, ++first2)\n {\n if (!comp(*first1, *first2)) \n return false;\n }\n return true;\n}\n\n/*****************************************************************************************/\n// fill_n\n// 从 first 位置开始填充 n 个值\n/*****************************************************************************************/\ntemplate \nOutputIter unchecked_fill_n(OutputIter first, Size n, const T& value)\n{\n for (; n > 0; --n, ++first)\n {\n *first = value;\n }\n return first;\n}\n\n// 为 one-byte 类型提供特化版本\ntemplate \ntypename std::enable_if<\n std::is_integral::value && sizeof(Tp) == 1 &&\n !std::is_same::value &&\n std::is_integral::value && sizeof(Up) == 1,\n Tp*>::type\nunchecked_fill_n(Tp* first, Size n, Up value)\n{\n if (n > 0)\n {\n std::memset(first, (unsigned char)value, (size_t)(n));\n }\n return first + n;\n}\n\ntemplate \nOutputIter fill_n(OutputIter first, Size n, const T& value)\n{\n return unchecked_fill_n(first, n, value);\n}\n\n/*****************************************************************************************/\n// fill\n// 为 [first, last)区间内的所有元素填充新值\n/*****************************************************************************************/\ntemplate \nvoid fill_cat(ForwardIter first, ForwardIter last, const T& value,\n mystl::forward_iterator_tag)\n{\n for (; first != last; ++first)\n {\n *first = value;\n }\n}\n\ntemplate \nvoid fill_cat(RandomIter first, RandomIter last, const T& value,\n mystl::random_access_iterator_tag)\n{\n fill_n(first, last - first, value);\n}\n\ntemplate \nvoid fill(ForwardIter first, ForwardIter last, const T& value)\n{\n fill_cat(first, last, value, iterator_category(first));\n}\n\n/*****************************************************************************************/\n// lexicographical_compare\n// 以字典序排列对两个序列进行比较，当在某个位置发现第一组不相等元素时，有下列几种情况：\n// (1)如果第一序列的元素较小，返回 true ，否则返回 false\n// (2)如果到达 last1 而尚未到达 last2 返回 true\n// (3)如果到达 last2 而尚未到达 last1 返回 false\n// (4)如果同时到达 last1 和 last2 返回 false\n/*****************************************************************************************/\ntemplate \nbool lexicographical_compare(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2)\n{\n for (; first1 != last1 && first2 != last2; ++first1, ++first2)\n {\n if (*first1 < *first2)\n return true;\n if (*first2 < *first1)\n return false;\n }\n return first1 == last1 && first2 != last2;\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nbool lexicographical_compare(InputIter1 first1, InputIter1 last1,\n InputIter2 first2, InputIter2 last2, Compred comp)\n{\n for (; first1 != last1 && first2 != last2; ++first1, ++first2)\n {\n if (comp(*first1, *first2))\n return true;\n if (comp(*first2, *first1))\n return false;\n }\n return first1 == last1 && first2 != last2;\n}\n\n// 针对 const unsigned char* 的特化版本\nbool lexicographical_compare(const unsigned char* first1,\n const unsigned char* last1,\n const unsigned char* first2,\n const unsigned char* last2)\n{\n const auto len1 = last1 - first1;\n const auto len2 = last2 - first2;\n // 先比较相同长度的部分\n const auto result = std::memcmp(first1, first2, mystl::min(len1, len2));\n // 若相等，长度较长的比较大\n return result != 0 ? result < 0 : len1 < len2;\n}\n\n/*****************************************************************************************/\n// mismatch\n// 平行比较两个序列，找到第一处失配的元素，返回一对迭代器，分别指向两个序列中失配的元素\n/*****************************************************************************************/\ntemplate \nmystl::pair \nmismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2)\n{\n while (first1 != last1 && *first1 == *first2)\n {\n ++first1;\n ++first2;\n }\n return mystl::pair(first1, first2);\n}\n\n// 重载版本使用函数对象 comp 代替比较操作\ntemplate \nmystl::pair \nmismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2, Compred comp)\n{\n while (first1 != last1 && comp(*first1, *first2))\n {\n ++first1;\n ++first2;\n }\n return mystl::pair(first1, first2);\n}\n\n} // namespace mystl\n#endif // !MYTINYSTL_ALGOBASE_H_\n\n"
},
{
"path": "MyTinySTL/algorithm.h",
"content": "#ifndef MYTINYSTL_ALGORITHM_H_\n#define MYTINYSTL_ALGORITHM_H_\n\n// 这个头文件包含了 mystl 的所有算法，包括基本算法，数值算法，heap 算法，set 算法和其他算法\n\n#include \"algobase.h\"\n#include \"algo.h\"\n#include \"set_algo.h\"\n#include \"heap_algo.h\"\n#include \"numeric.h\"\n\nnamespace mystl\n{\n\n} // namespace mystl\n\n#endif // !MYTINYSTL_ALGORITHM_H_\n\n"
},
{
"path": "MyTinySTL/alloc.h",
"content": "#ifndef MYTINYSTL_ALLOC_H_\n#define MYTINYSTL_ALLOC_H_\n\n// 这个头文件包含一个类 alloc，用于分配和回收内存，以内存池的方式实现\n//\n// 从 v2.0.0 版本开始，将不再使用内存池，这个文件将被弃用，但暂时保留\n//\n// 注意！！！\n// 我知道这个文件里很多实现是错的，这是很久很久前写的了，后面已经不用这个东西了，\n// 所以我也没再维护，有诸多问题，已经有人在issue中都提了，free_list的修改，\n// 指针作为参数时没实际修改到原指针，等等。相信会看这么仔细的，大部分都是\n// 初学C++的朋友，大佬都不会看这些玩具了，所以其中的错误，就留给对内存池实现\n// 感兴趣的朋友去修改啦！\n\n#include \n\n#include \n#include \n\nnamespace mystl\n{\n\n// 共用体: FreeList\n// 采用链表的方式管理内存碎片，分配与回收小内存（<=4K）区块\nunion FreeList\n{\n union FreeList* next; // 指向下一个区块\n char data[1]; // 储存本块内存的首地址\n};\n\n// 不同内存范围的上调大小\nenum\n{\n EAlign128 = 8, \n EAlign256 = 16, \n EAlign512 = 32,\n EAlign1024 = 64, \n EAlign2048 = 128,\n EAlign4096 = 256\n};\n\n// 小对象的内存大小\nenum { ESmallObjectBytes = 4096 };\n\n// free lists 个数\nenum { EFreeListsNumber = 56 };\n\n// 空间配置类 alloc\n// 如果内存较大，超过 4096 bytes，直接调用 std::malloc, std::free\n// 当内存较小时，以内存池管理，每次配置一大块内存，并维护对应的自由链表\nclass alloc\n{\nprivate:\n static char* start_free; // 内存池起始位置\n static char* end_free; // 内存池结束位置\n static size_t heap_size; // 申请 heap 空间附加值大小\n \n static FreeList* free_list[EFreeListsNumber]; // 自由链表\n\npublic:\n static void* allocate(size_t n);\n static void deallocate(void* p, size_t n);\n static void* reallocate(void* p, size_t old_size, size_t new_size);\n\nprivate:\n static size_t M_align(size_t bytes);\n static size_t M_round_up(size_t bytes);\n static size_t M_freelist_index(size_t bytes);\n static void* M_refill(size_t n);\n static char* M_chunk_alloc(size_t size, size_t &nobj);\n};\n\n// 静态成员变量初始化\n\nchar* alloc::start_free = nullptr;\nchar* alloc::end_free = nullptr;\nsize_t alloc::heap_size = 0;\n\nFreeList* alloc::free_list[EFreeListsNumber] = {\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,\n nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr,nullptr\n };\n\n// 分配大小为 n 的空间， n > 0\ninline void* alloc::allocate(size_t n)\n{\n FreeList* my_free_list;\n FreeList* result;\n if (n > static_cast(ESmallObjectBytes))\n return std::malloc(n);\n my_free_list = free_list[M_freelist_index(n)];\n result = my_free_list;\n if (result == nullptr)\n {\n void* r = M_refill(M_round_up(n));\n return r;\n }\n my_free_list = result->next;\n return result;\n}\n\n// 释放 p 指向的大小为 n 的空间, p 不能为 0\ninline void alloc::deallocate(void* p, size_t n)\n{\n if (n > static_cast(ESmallObjectBytes))\n {\n std::free(p);\n return;\n }\n FreeList* q = reinterpret_cast(p);\n FreeList* my_free_list;\n my_free_list = free_list[M_freelist_index(n)];\n q->next = my_free_list;\n my_free_list = q;\n}\n\n// 重新分配空间，接受三个参数，参数一为指向新空间的指针，参数二为原来空间的大小，参数三为申请空间的大小\ninline void* alloc::reallocate(void* p, size_t old_size, size_t new_size)\n{\n deallocate(p, old_size);\n p = allocate(new_size);\n return p;\n}\n\n// bytes 对应上调大小\ninline size_t alloc::M_align(size_t bytes)\n{\n if (bytes <= 512)\n {\n return bytes <= 256\n ? bytes <= 128 ? EAlign128 : EAlign256\n : EAlign512;\n }\n return bytes <= 2048\n ? bytes <= 1024 ? EAlign1024 : EAlign2048\n : EAlign4096;\n}\n\n// 将 bytes 上调至对应区间大小\ninline size_t alloc::M_round_up(size_t bytes)\n{\n return ((bytes + M_align(bytes) - 1) & ~(M_align(bytes) - 1));\n}\n\n// 根据区块大小，选择第 n 个 free lists\ninline size_t alloc::M_freelist_index(size_t bytes)\n{\n if (bytes <= 512)\n {\n return bytes <= 256\n ? bytes <= 128 \n ? ((bytes + EAlign128 - 1) / EAlign128 - 1) \n : (15 + (bytes + EAlign256 - 129) / EAlign256)\n : (23 + (bytes + EAlign512 - 257) / EAlign512);\n }\n return bytes <= 2048\n ? bytes <= 1024 \n ? (31 + (bytes + EAlign1024 - 513) / EAlign1024)\n : (39 + (bytes + EAlign2048 - 1025) / EAlign2048)\n : (47 + (bytes + EAlign4096 - 2049) / EAlign4096);\n}\n\n// 重新填充 free list\nvoid* alloc::M_refill(size_t n)\n{\n size_t nblock = 10;\n char* c = M_chunk_alloc(n, nblock);\n FreeList* my_free_list;\n FreeList* result, *cur, *next;\n // 如果只有一个区块，就把这个区块返回给调用者，free list 没有增加新节点\n if (nblock == 1)\n return c;\n // 否则把一个区块给调用者，剩下的纳入 free list 作为新节点\n my_free_list = free_list[M_freelist_index(n)];\n result = (FreeList*)c;\n my_free_list = next = (FreeList*)(c + n);\n for (size_t i = 1; ; ++i)\n {\n cur = next;\n next = (FreeList*)((char*)next + n);\n if (nblock - 1 == i)\n {\n cur->next = nullptr;\n break;\n }\n else\n {\n cur->next = next;\n }\n }\n return result;\n}\n\n// 从内存池中取空间给 free list 使用，条件不允许时，会调整 nblock\nchar* alloc::M_chunk_alloc(size_t size, size_t& nblock)\n{\n char* result;\n size_t need_bytes = size * nblock;\n size_t pool_bytes = end_free - start_free;\n\n // 如果内存池剩余大小完全满足需求量，返回它\n if (pool_bytes >= need_bytes)\n {\n result = start_free;\n start_free += need_bytes;\n return result;\n }\n\n // 如果内存池剩余大小不能完全满足需求量，但至少可以分配一个或一个以上的区块，就返回它\n else if (pool_bytes >= size)\n {\n nblock = pool_bytes / size;\n need_bytes = size * nblock;\n result = start_free;\n start_free += need_bytes;\n return result;\n }\n\n // 如果内存池剩余大小连一个区块都无法满足\n else\n {\n if (pool_bytes > 0)\n { // 如果内存池还有剩余，把剩余的空间加入到 free list 中\n FreeList* my_free_list = free_list[M_freelist_index(pool_bytes)];\n ((FreeList*)start_free)->next = my_free_list;\n my_free_list = (FreeList*)start_free;\n }\n // 申请 heap 空间\n size_t bytes_to_get = (need_bytes << 1) + M_round_up(heap_size >> 4);\n start_free = (char*)std::malloc(bytes_to_get);\n if (!start_free)\n { // heap 空间也不够\n FreeList* my_free_list, *p;\n // 试着查找有无未用区块，且区块足够大的 free list\n for (size_t i = size; i <= ESmallObjectBytes; i += M_align(i))\n {\n my_free_list = free_list[M_freelist_index(i)];\n p = my_free_list;\n if (p)\n {\n my_free_list = p->next;\n start_free = (char*)p;\n end_free = start_free + i;\n return M_chunk_alloc(size, nblock);\n }\n }\n std::printf(\"out of memory\");\n end_free = nullptr;\n throw std::bad_alloc();\n }\n end_free = start_free + bytes_to_get;\n heap_size += bytes_to_get;\n return M_chunk_alloc(size, nblock);\n }\n}\n\n} // namespace mystl\n#endif // !MYTINYSTL_ALLOC_H_\n\n"
},
{
"path": "MyTinySTL/allocator.h",
"content": "#ifndef MYTINYSTL_ALLOCATOR_H_\n#define MYTINYSTL_ALLOCATOR_H_\n\n// 这个头文件包含一个模板类 allocator，用于管理内存的分配、释放，对象的构造、析构\n\n#include \"construct.h\"\n#include \"util.h\"\n\nnamespace mystl\n{\n\n// 模板类：allocator\n// 模板函数代表数据类型\ntemplate \nclass allocator\n{\npublic:\n typedef T value_type;\n typedef T* pointer;\n typedef const T* const_pointer;\n typedef T& reference;\n typedef const T& const_reference;\n typedef size_t size_type;\n typedef ptrdiff_t difference_type;\n\npublic:\n static T* allocate();\n static T* allocate(size_type n);\n\n static void deallocate(T* ptr);\n static void deallocate(T* ptr, size_type n);\n\n static void construct(T* ptr);\n static void construct(T* ptr, const T& value);\n static void construct(T* ptr, T&& value);\n\n template \n static void construct(T* ptr, Args&& ...args);\n\n static void destroy(T* ptr);\n static void destroy(T* first, T* last);\n};\n\ntemplate \nT* allocator::allocate()\n{\n return static_cast(::operator new(sizeof(T)));\n}\n\ntemplate \nT* allocator::allocate(size_type n)\n{\n if (n == 0)\n return nullptr;\n return static_cast(::operator new(n * sizeof(T)));\n}\n\ntemplate