From 1517c3041fc297c572d14f9a7b51b608929be4a8 Mon Sep 17 00:00:00 2001 From: dvsav Date: Sun, 22 Oct 2023 22:02:06 +0400 Subject: [PATCH 001/121] add merge_sort function --- .gitignore | 7 + build/vs2019/computer-science.sln | 31 ++++ .../computer-science/computer-science.vcxproj | 151 ++++++++++++++++++ .../computer-science.vcxproj.filters | 30 ++++ .../computer-science.vcxproj.user | 4 + src/main.cpp | 13 ++ src/merge_sort.h | 56 +++++++ src/print.h | 11 ++ src/sort.h | 2 - 9 files changed, 303 insertions(+), 2 deletions(-) create mode 100755 build/vs2019/computer-science.sln create mode 100755 build/vs2019/computer-science/computer-science.vcxproj create mode 100755 build/vs2019/computer-science/computer-science.vcxproj.filters create mode 100755 build/vs2019/computer-science/computer-science.vcxproj.user create mode 100755 src/main.cpp create mode 100755 src/merge_sort.h create mode 100755 src/print.h delete mode 100755 src/sort.h diff --git a/.gitignore b/.gitignore index 259148f..8c3f601 100644 --- a/.gitignore +++ b/.gitignore @@ -30,3 +30,10 @@ *.exe *.out *.app + +# Visual Studio cache/options directory +build/vs2019/.vs/** +build/vs2019/Debug/** +build/vs2019/Release/** +build/vs2019/computer-science/Debug/** +build/vs2019/computer-science/Release/** \ No newline at end of file diff --git a/build/vs2019/computer-science.sln b/build/vs2019/computer-science.sln new file mode 100755 index 0000000..01cb5f1 --- /dev/null +++ b/build/vs2019/computer-science.sln @@ -0,0 +1,31 @@ + +Microsoft Visual Studio Solution File, Format Version 12.00 +# Visual Studio Version 16 +VisualStudioVersion = 16.0.31911.196 +MinimumVisualStudioVersion = 10.0.40219.1 +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "computer-science", "computer-science\computer-science.vcxproj", "{459024E5-213E-464C-84FB-CB82E71D8F77}" +EndProject +Global + GlobalSection(SolutionConfigurationPlatforms) = preSolution + Debug|x64 = Debug|x64 + Debug|x86 = Debug|x86 + Release|x64 = Release|x64 + Release|x86 = Release|x86 + EndGlobalSection + GlobalSection(ProjectConfigurationPlatforms) = postSolution + {459024E5-213E-464C-84FB-CB82E71D8F77}.Debug|x64.ActiveCfg = Debug|x64 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Debug|x64.Build.0 = Debug|x64 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Debug|x86.ActiveCfg = Debug|Win32 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Debug|x86.Build.0 = Debug|Win32 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Release|x64.ActiveCfg = Release|x64 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Release|x64.Build.0 = Release|x64 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Release|x86.ActiveCfg = Release|Win32 + {459024E5-213E-464C-84FB-CB82E71D8F77}.Release|x86.Build.0 = Release|Win32 + EndGlobalSection + GlobalSection(SolutionProperties) = preSolution + HideSolutionNode = FALSE + EndGlobalSection + GlobalSection(ExtensibilityGlobals) = postSolution + SolutionGuid = {1729E95F-AE50-45CB-BE3D-B2063B09CD67} + EndGlobalSection +EndGlobal diff --git a/build/vs2019/computer-science/computer-science.vcxproj b/build/vs2019/computer-science/computer-science.vcxproj new file mode 100755 index 0000000..bd04630 --- /dev/null +++ b/build/vs2019/computer-science/computer-science.vcxproj @@ -0,0 +1,151 @@ + + + + + Debug + Win32 + + + Release + Win32 + + + Debug + x64 + + + Release + x64 + + + + 16.0 + Win32Proj + {459024e5-213e-464c-84fb-cb82e71d8f77} + computerscience + 10.0 + + + + Application + true + v142 + Unicode + + + Application + false + v142 + true + Unicode + + + Application + true + v142 + Unicode + + + Application + false + v142 + true + Unicode + + + + + + + + + + + + + + + + + + + + + true + + + false + + + true + + + false + + + + Level3 + true + WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) + true + + + Console + true + + + + + Level3 + true + true + true + WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + true + + + Console + true + true + true + + + + + Level3 + true + _DEBUG;_CONSOLE;%(PreprocessorDefinitions) + true + + + Console + true + + + + + Level3 + true + true + true + NDEBUG;_CONSOLE;%(PreprocessorDefinitions) + true + + + Console + true + true + true + + + + + + + + + + + + + \ No newline at end of file diff --git a/build/vs2019/computer-science/computer-science.vcxproj.filters b/build/vs2019/computer-science/computer-science.vcxproj.filters new file mode 100755 index 0000000..d16179a --- /dev/null +++ b/build/vs2019/computer-science/computer-science.vcxproj.filters @@ -0,0 +1,30 @@ + + + + + {4FC737F1-C7A5-4376-A066-2A32D752A2FF} + cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx + + + {93995380-89BD-4b04-88EB-625FBE52EBFB} + h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd + + + {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} + rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms + + + + + Header Files + + + Header Files + + + + + Source Files + + + \ No newline at end of file diff --git a/build/vs2019/computer-science/computer-science.vcxproj.user b/build/vs2019/computer-science/computer-science.vcxproj.user new file mode 100755 index 0000000..0f14913 --- /dev/null +++ b/build/vs2019/computer-science/computer-science.vcxproj.user @@ -0,0 +1,4 @@ + + + + \ No newline at end of file diff --git a/src/main.cpp b/src/main.cpp new file mode 100755 index 0000000..23f0c93 --- /dev/null +++ b/src/main.cpp @@ -0,0 +1,13 @@ +#include "print.h" +#include "merge_sort.h" + +#include + +int main(int argc, char** argv) +{ + std::vector vec{ 5, 2, 8, 15, 1, -6, 7 }; + sc::merge_sort(vec.begin(), vec.end()); + sc::print(vec.begin(), vec.end(), " "); + + return 0; +} \ No newline at end of file diff --git a/src/merge_sort.h b/src/merge_sort.h new file mode 100755 index 0000000..05f61b4 --- /dev/null +++ b/src/merge_sort.h @@ -0,0 +1,56 @@ +#include +#include + +namespace sc +{ + template + static std::vector merge(const std::vector& a, const std::vector& b) + { + std::vector result; + result.reserve(a.size() + b.size()); + + size_t a_i = 0; + size_t b_i = 0; + + while (a_i < a.size() && b_i < b.size()) + { + if (a[a_i] < b[b_i]) + result.push_back(a[a_i++]); + else + result.push_back(b[b_i++]); + } + + while (a_i < a.size()) + result.push_back(a[a_i++]); + + while (b_i < b.size()) + result.push_back(b[b_i++]); + + return result; + } + + template + static std::vector merge_sort_internal(TIterator begin, TIterator end) + { + auto size = end - begin; + + if (size == 0) + return std::vector(); + else if (size == 1) + return std::vector(1, *begin); + + auto middle = begin + size / 2; + + auto left_part = merge_sort_internal(begin, middle); + auto right_part = merge_sort_internal(middle, end); + + return merge(left_part, right_part); + } + + template + void merge_sort(TIterator begin, TIterator end) + { + auto result = merge_sort_internal(begin, end); + std::copy(result.begin(), result.end(), begin); + } +} diff --git a/src/print.h b/src/print.h new file mode 100755 index 0000000..ab7cc49 --- /dev/null +++ b/src/print.h @@ -0,0 +1,11 @@ +#include + +namespace sc +{ + template + void print(TIterator begin, TIterator end, const std::string& delimeter) + { + for (auto i = begin; i != end; i++) + std::cout << *i << delimeter; + } +} diff --git a/src/sort.h b/src/sort.h deleted file mode 100755 index 3f9efd2..0000000 --- a/src/sort.h +++ /dev/null @@ -1,2 +0,0 @@ -template -void merge_sort(TIterator begin, TIterator end); \ No newline at end of file From 03c47a47d93fcc1aac3ec0c6e2398a0a0a8139ba Mon Sep 17 00:00:00 2001 From: dvsav Date: Sun, 22 Oct 2023 22:07:37 +0400 Subject: [PATCH 002/121] replace Tabs with spaces --- src/merge_sort.h | 100 +++++++++++++++++++++++------------------------ src/print.h | 12 +++--- 2 files changed, 56 insertions(+), 56 deletions(-) diff --git a/src/merge_sort.h b/src/merge_sort.h index 05f61b4..e92d49a 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -3,54 +3,54 @@ namespace sc { - template - static std::vector merge(const std::vector& a, const std::vector& b) - { - std::vector result; - result.reserve(a.size() + b.size()); - - size_t a_i = 0; - size_t b_i = 0; - - while (a_i < a.size() && b_i < b.size()) - { - if (a[a_i] < b[b_i]) - result.push_back(a[a_i++]); - else - result.push_back(b[b_i++]); - } - - while (a_i < a.size()) - result.push_back(a[a_i++]); - - while (b_i < b.size()) - result.push_back(b[b_i++]); - - return result; - } - - template - static std::vector merge_sort_internal(TIterator begin, TIterator end) - { - auto size = end - begin; - - if (size == 0) - return std::vector(); - else if (size == 1) - return std::vector(1, *begin); - - auto middle = begin + size / 2; - - auto left_part = merge_sort_internal(begin, middle); - auto right_part = merge_sort_internal(middle, end); - - return merge(left_part, right_part); - } - - template - void merge_sort(TIterator begin, TIterator end) - { - auto result = merge_sort_internal(begin, end); - std::copy(result.begin(), result.end(), begin); - } + template + static std::vector merge(const std::vector& a, const std::vector& b) + { + std::vector result; + result.reserve(a.size() + b.size()); + + size_t a_i = 0; + size_t b_i = 0; + + while (a_i < a.size() && b_i < b.size()) + { + if (a[a_i] < b[b_i]) + result.push_back(a[a_i++]); + else + result.push_back(b[b_i++]); + } + + while (a_i < a.size()) + result.push_back(a[a_i++]); + + while (b_i < b.size()) + result.push_back(b[b_i++]); + + return result; + } + + template + static std::vector merge_sort_internal(TIterator begin, TIterator end) + { + auto size = end - begin; + + if (size == 0) + return std::vector(); + else if (size == 1) + return std::vector(1, *begin); + + auto middle = begin + size / 2; + + auto left_part = merge_sort_internal(begin, middle); + auto right_part = merge_sort_internal(middle, end); + + return merge(left_part, right_part); + } + + template + void merge_sort(TIterator begin, TIterator end) + { + auto result = merge_sort_internal(begin, end); + std::copy(result.begin(), result.end(), begin); + } } diff --git a/src/print.h b/src/print.h index ab7cc49..2199fe3 100755 --- a/src/print.h +++ b/src/print.h @@ -2,10 +2,10 @@ namespace sc { - template - void print(TIterator begin, TIterator end, const std::string& delimeter) - { - for (auto i = begin; i != end; i++) - std::cout << *i << delimeter; - } + template + void print(TIterator begin, TIterator end, const std::string& delimeter) + { + for (auto i = begin; i != end; i++) + std::cout << *i << delimeter; + } } From 0a1fbe196a81787fd4d8de6ae7c9b9390955307c Mon Sep 17 00:00:00 2001 From: dvsav Date: Mon, 23 Oct 2023 22:25:47 +0400 Subject: [PATCH 003/121] merge_sort: static assert random access iterator --- src/main.cpp | 3 +++ src/merge_sort.h | 5 +++++ 2 files changed, 8 insertions(+) diff --git a/src/main.cpp b/src/main.cpp index 23f0c93..abe9cea 100755 --- a/src/main.cpp +++ b/src/main.cpp @@ -1,6 +1,9 @@ #include "print.h" #include "merge_sort.h" +#include +#include +#include #include int main(int argc, char** argv) diff --git a/src/merge_sort.h b/src/merge_sort.h index e92d49a..a0364e3 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -50,6 +50,11 @@ namespace sc template void merge_sort(TIterator begin, TIterator end) { + static_assert( + std::is_same::iterator_category, + std::random_access_iterator_tag>::value, + "TIterator must be a random-access iterator."); + auto result = merge_sort_internal(begin, end); std::copy(result.begin(), result.end(), begin); } From 6bdde28c765ab202b88dd2bd61993978c73a1b66 Mon Sep 17 00:00:00 2001 From: dvsav Date: Mon, 23 Oct 2023 22:54:21 +0400 Subject: [PATCH 004/121] merge_sort: add TComparator as a template parameter to allow for sorting in descending order and custom comparison operations --- src/main.cpp | 3 ++- src/merge_sort.h | 35 ++++++++++++++++++++++++++++------- 2 files changed, 30 insertions(+), 8 deletions(-) diff --git a/src/main.cpp b/src/main.cpp index abe9cea..9442592 100755 --- a/src/main.cpp +++ b/src/main.cpp @@ -9,7 +9,8 @@ int main(int argc, char** argv) { std::vector vec{ 5, 2, 8, 15, 1, -6, 7 }; - sc::merge_sort(vec.begin(), vec.end()); + sc::merge_sort::iterator, sc::ReverseComparator >(vec.begin(), vec.end()); + //sc::merge_sort(vec.begin(), vec.end()); sc::print(vec.begin(), vec.end(), " "); return 0; diff --git a/src/merge_sort.h b/src/merge_sort.h index a0364e3..74c6f1a 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -4,6 +4,20 @@ namespace sc { template + class DefaultComparator + { + public: + static bool LessThan(const T& a, const T& b) { return a < b; } + }; + + template + class ReverseComparator + { + public: + static bool LessThan(const T& a, const T& b) { return a > b; } + }; + + template > static std::vector merge(const std::vector& a, const std::vector& b) { std::vector result; @@ -14,7 +28,7 @@ namespace sc while (a_i < a.size() && b_i < b.size()) { - if (a[a_i] < b[b_i]) + if (TComparator::LessThan(a[a_i], b[b_i])) result.push_back(a[a_i++]); else result.push_back(b[b_i++]); @@ -29,7 +43,7 @@ namespace sc return result; } - template + template > static std::vector merge_sort_internal(TIterator begin, TIterator end) { auto size = end - begin; @@ -41,21 +55,28 @@ namespace sc auto middle = begin + size / 2; - auto left_part = merge_sort_internal(begin, middle); - auto right_part = merge_sort_internal(middle, end); + auto left_part = merge_sort_internal(begin, middle); + auto right_part = merge_sort_internal(middle, end); - return merge(left_part, right_part); + return merge(left_part, right_part); } - template + template > void merge_sort(TIterator begin, TIterator end) { + // Check that TIterator is a random-access iterator static_assert( std::is_same::iterator_category, std::random_access_iterator_tag>::value, "TIterator must be a random-access iterator."); - auto result = merge_sort_internal(begin, end); + // Check for the existence of a member function "LessThan" in TComparator type + static_assert( + std::is_same::value, + "LessThan function is missing in TComparator"); + + auto result = merge_sort_internal(begin, end); std::copy(result.begin(), result.end(), begin); } } From f771c3f6381b1960153fe5de451b2490dbd32e99 Mon Sep 17 00:00:00 2001 From: dvsav Date: Mon, 23 Oct 2023 23:01:55 +0400 Subject: [PATCH 005/121] merge_sort: add Doxygen comment; rename namespace sc to cs (computer science) --- src/main.cpp | 6 +++--- src/merge_sort.h | 12 +++++++++++- src/print.h | 2 +- 3 files changed, 15 insertions(+), 5 deletions(-) diff --git a/src/main.cpp b/src/main.cpp index 9442592..28e819b 100755 --- a/src/main.cpp +++ b/src/main.cpp @@ -9,9 +9,9 @@ int main(int argc, char** argv) { std::vector vec{ 5, 2, 8, 15, 1, -6, 7 }; - sc::merge_sort::iterator, sc::ReverseComparator >(vec.begin(), vec.end()); - //sc::merge_sort(vec.begin(), vec.end()); - sc::print(vec.begin(), vec.end(), " "); + cs::merge_sort::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); + //cs::merge_sort(vec.begin(), vec.end()); + cs::print(vec.begin(), vec.end(), " "); return 0; } \ No newline at end of file diff --git a/src/merge_sort.h b/src/merge_sort.h index 74c6f1a..f756e49 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -1,7 +1,7 @@ #include #include -namespace sc +namespace cs { template class DefaultComparator @@ -61,6 +61,16 @@ namespace sc return merge(left_part, right_part); } + /** + * @brief Sort specified range of values using merge sort algorithm. + * + * @tparam TIterator Iterator type (must be a random access iterator). + * @tparam TComparator Comparator type (must have a static member function bool LessThan(const T& a, const T& b) + * where T is the value type of container being sorted). + * + * @param begin - Iterator specifying the beginning of a range to be sorted. + * @param end - Iterator specifying the end of a range to be sorted. + */ template > void merge_sort(TIterator begin, TIterator end) { diff --git a/src/print.h b/src/print.h index 2199fe3..cc35c31 100755 --- a/src/print.h +++ b/src/print.h @@ -1,6 +1,6 @@ #include -namespace sc +namespace cs { template void print(TIterator begin, TIterator end, const std::string& delimeter) From c2a47b3d8f098445a7da0239e6c8bb73784d6ecf Mon Sep 17 00:00:00 2001 From: dvsav Date: Tue, 24 Oct 2023 22:45:45 +0400 Subject: [PATCH 006/121] add quick_sort_lomuto_partition function --- .../computer-science/computer-science.vcxproj | 2 + .../computer-science.vcxproj.filters | 6 ++ src/main.cpp | 8 ++- src/merge_sort.h | 20 ++---- src/print.h | 2 + src/quick_sort.h | 64 +++++++++++++++++++ src/utility.h | 26 ++++++++ 7 files changed, 111 insertions(+), 17 deletions(-) create mode 100755 src/quick_sort.h create mode 100755 src/utility.h diff --git a/build/vs2019/computer-science/computer-science.vcxproj b/build/vs2019/computer-science/computer-science.vcxproj index bd04630..21a1a2e 100755 --- a/build/vs2019/computer-science/computer-science.vcxproj +++ b/build/vs2019/computer-science/computer-science.vcxproj @@ -141,6 +141,8 @@ + + diff --git a/build/vs2019/computer-science/computer-science.vcxproj.filters b/build/vs2019/computer-science/computer-science.vcxproj.filters index d16179a..8be6641 100755 --- a/build/vs2019/computer-science/computer-science.vcxproj.filters +++ b/build/vs2019/computer-science/computer-science.vcxproj.filters @@ -21,6 +21,12 @@ Header Files + + Header Files + + + Header Files + diff --git a/src/main.cpp b/src/main.cpp index 28e819b..0e56846 100755 --- a/src/main.cpp +++ b/src/main.cpp @@ -1,5 +1,7 @@ #include "print.h" #include "merge_sort.h" +#include "quick_sort.h" +#include "utility.h" #include #include @@ -8,9 +10,11 @@ int main(int argc, char** argv) { - std::vector vec{ 5, 2, 8, 15, 1, -6, 7 }; - cs::merge_sort::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); + std::vector vec{ 5, 2, 8, 15, 48, 1, -6, 7 }; + //cs::merge_sort::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); //cs::merge_sort(vec.begin(), vec.end()); + //cs::quick_sort(vec.begin(), vec.end()); + cs::quick_sort_lomuto_partition::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); cs::print(vec.begin(), vec.end(), " "); return 0; diff --git a/src/merge_sort.h b/src/merge_sort.h index f756e49..7cda54f 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -1,22 +1,12 @@ +#pragma once + +#include "utility.h" + #include #include namespace cs { - template - class DefaultComparator - { - public: - static bool LessThan(const T& a, const T& b) { return a < b; } - }; - - template - class ReverseComparator - { - public: - static bool LessThan(const T& a, const T& b) { return a > b; } - }; - template > static std::vector merge(const std::vector& a, const std::vector& b) { @@ -66,7 +56,7 @@ namespace cs * * @tparam TIterator Iterator type (must be a random access iterator). * @tparam TComparator Comparator type (must have a static member function bool LessThan(const T& a, const T& b) - * where T is the value type of container being sorted). + * where T is the value type of container being sorted). For example @see DefaultComparator, @see ReverseComparator. * * @param begin - Iterator specifying the beginning of a range to be sorted. * @param end - Iterator specifying the end of a range to be sorted. diff --git a/src/print.h b/src/print.h index cc35c31..01271c1 100755 --- a/src/print.h +++ b/src/print.h @@ -1,3 +1,5 @@ +#pragma once + #include namespace cs diff --git a/src/quick_sort.h b/src/quick_sort.h new file mode 100755 index 0000000..84a9bcf --- /dev/null +++ b/src/quick_sort.h @@ -0,0 +1,64 @@ +#pragma once + +#include "utility.h" + +#include + +namespace cs +{ + template > + TIterator lomuto_partition(TIterator begin, TIterator end) + { + // pick the last element in the range as the pivot element + auto pivot = end - 1; + auto i = begin; + + for (auto j = begin; j != end; j++) + { + if (TComparator::LessThanOrEqualTo(*j, *pivot)) + { + std::swap(*i, *j); + i++; + } + } + + // Everything in range [0...i-2] is <= pivot + // Everything in range [i...end) is > pivot + return i - 1; + } + + /** + * @brief Sort specified range of values using quick sort algorithm using Lomuto partitioning scheme. + * + * @tparam TIterator Iterator type (must be a random access iterator). + * @tparam TComparator Comparator type (must have a static member function bool LessThanOrEqualTo(const T& a, const T& b) + * where T is the value type of container being sorted). For example @see DefaultComparator, @see ReverseComparator. + * + * @param begin - Iterator specifying the beginning of a range to be sorted. + * @param end - Iterator specifying the end of a range to be sorted. + */ + template > + void quick_sort_lomuto_partition(TIterator begin, TIterator end) + { + // Check that TIterator is a random-access iterator + static_assert( + std::is_same::iterator_category, + std::random_access_iterator_tag>::value, + "TIterator must be a random-access iterator."); + + // Check for the existence of a member function "LessThan" in TComparator type + static_assert( + std::is_same::value, + "LessThanOrEqualTo function is missing in TComparator"); + + auto size = end - begin; + + if (size > 1) + { + auto pivot = lomuto_partition(begin, end); + quick_sort_lomuto_partition(begin, pivot); + quick_sort_lomuto_partition(pivot + 1, end); + } + } +} diff --git a/src/utility.h b/src/utility.h new file mode 100755 index 0000000..6ba0680 --- /dev/null +++ b/src/utility.h @@ -0,0 +1,26 @@ +#pragma once + +namespace cs +{ + template + class DefaultComparator + { + public: + static bool LessThan(const T& a, const T& b) { return a < b; } + static bool EqualTo(const T& a, const T& b) { return a == b; } + static bool LessThanOrEqualTo(const T& a, const T& b) { return a <= b; } + static bool GreaterThan(const T& a, const T& b) { return a > b; } + static bool GreaterThanOrEqualTo(const T& a, const T& b) { return a >= b; } + }; + + template + class ReverseComparator + { + public: + static bool LessThan(const T& a, const T& b) { return a > b; } + static bool EqualTo(const T& a, const T& b) { return a == b; } + static bool LessThanOrEqualTo(const T& a, const T& b) { return a >= b; } + static bool GreaterThan(const T& a, const T& b) { return a < b; } + static bool GreaterThanOrEqualTo(const T& a, const T& b) { return a <= b; } + }; +} From 7426d0ca7c9a56481ee881773eb196e0b3ed255a Mon Sep 17 00:00:00 2001 From: dvsav Date: Wed, 25 Oct 2023 23:36:22 +0400 Subject: [PATCH 007/121] quick_sort.h: add function quick_sort_randomized_partition --- src/main.cpp | 24 +++++++++----- src/merge_sort.h | 4 +-- src/print.h | 2 +- src/quick_sort.h | 86 +++++++++++++++++++++++++++++++++++++++++++++--- 4 files changed, 100 insertions(+), 16 deletions(-) diff --git a/src/main.cpp b/src/main.cpp index 0e56846..3490af9 100755 --- a/src/main.cpp +++ b/src/main.cpp @@ -1,21 +1,27 @@ -#include "print.h" -#include "merge_sort.h" -#include "quick_sort.h" -#include "utility.h" +#include "print.h" // for cs::print +#include "merge_sort.h" // for cs::merge_sort +#include "quick_sort.h" // for cs::quick_sort_lomuto_partition, cs::quick_sort_randomized_partition +#include "utility.h" // for cs::ReverseComparator -#include #include -#include #include int main(int argc, char** argv) { - std::vector vec{ 5, 2, 8, 15, 48, 1, -6, 7 }; + std::vector vec{ 5, 2, 8, 15, 48, 1, -6, 7, 3, 8, -10 }; + + cs::print(vec.begin(), vec.end(), " "); + std::cout << std::endl; + //cs::merge_sort::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); //cs::merge_sort(vec.begin(), vec.end()); - //cs::quick_sort(vec.begin(), vec.end()); - cs::quick_sort_lomuto_partition::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); + //cs::quick_sort_lomuto_partition(vec.begin(), vec.end()); + //cs::quick_sort_lomuto_partition::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); + //cs::quick_sort_randomized_partition(vec.begin(), vec.end()); + cs::quick_sort_randomized_partition::iterator, cs::ReverseComparator >(vec.begin(), vec.end()); + cs::print(vec.begin(), vec.end(), " "); + std::cout << std::endl; return 0; } \ No newline at end of file diff --git a/src/merge_sort.h b/src/merge_sort.h index 7cda54f..b0c81a9 100755 --- a/src/merge_sort.h +++ b/src/merge_sort.h @@ -2,8 +2,8 @@ #include "utility.h" -#include -#include +#include // for std::copy +#include // for std::vector namespace cs { diff --git a/src/print.h b/src/print.h index 01271c1..6517fa7 100755 --- a/src/print.h +++ b/src/print.h @@ -1,6 +1,6 @@ #pragma once -#include +#include // for std::cout namespace cs { diff --git a/src/quick_sort.h b/src/quick_sort.h index 84a9bcf..520b2a4 100755 --- a/src/quick_sort.h +++ b/src/quick_sort.h @@ -2,17 +2,43 @@ #include "utility.h" -#include +#include // for std::swap +#include // for std::random_device, std::mt19937, std::uniform_int_distribution namespace cs { + template > + TIterator partition(TIterator begin, TIterator end, TIterator pivot) + { + // Remember pivot element value + auto pivot_value = *pivot; + // Move pivot element to the end of the range. Why? -Because it should be swapped last to appear at the border of two partitions. + // Why is it important that the pivot element end up at the border of two partitions? -Because then it can be excluded from further consideration, because its position will never change. + std::swap( *pivot, *(end - 1) ); + + auto i = begin; + for (auto j = begin; j != end; j++) + { + if (TComparator::LessThanOrEqualTo(*j, pivot_value)) + { + std::swap(*i, *j); + i++; + } + } + + // Everything in range [0...i-2] is <= pivot + // Everything in range [i...end) is > pivot + return i - 1; + } + template > TIterator lomuto_partition(TIterator begin, TIterator end) { - // pick the last element in the range as the pivot element + // Pick the last element in the range as the pivot element. Why? -Because it should be swapped last to appear at the border of two partitions. + // Why is it important that the pivot element end up at the border of two partitions? -Because then it can be excluded from further consideration, because its position will never change. auto pivot = end - 1; - auto i = begin; + auto i = begin; for (auto j = begin; j != end; j++) { if (TComparator::LessThanOrEqualTo(*j, *pivot)) @@ -23,12 +49,13 @@ namespace cs } // Everything in range [0...i-2] is <= pivot + // pivot element itself appears at position (i-1) // Everything in range [i...end) is > pivot return i - 1; } /** - * @brief Sort specified range of values using quick sort algorithm using Lomuto partitioning scheme. + * @brief Sort specified range of values using quick sort algorithm with Lomuto partitioning scheme. * * @tparam TIterator Iterator type (must be a random access iterator). * @tparam TComparator Comparator type (must have a static member function bool LessThanOrEqualTo(const T& a, const T& b) @@ -61,4 +88,55 @@ namespace cs quick_sort_lomuto_partition(pivot + 1, end); } } + + template + void quick_sort_randomized_partition_internal(TIterator begin, TIterator end, std::mt19937& randomNumberGenerator) + { + auto size = end - begin; + + if (size > 1) + { + std::uniform_int_distribution uint_dist(0, size - 1); // generates numbers in range [0, size - 1] + auto pivot = partition(begin, end, begin + uint_dist(randomNumberGenerator)); + quick_sort_randomized_partition_internal(begin, pivot, randomNumberGenerator); + quick_sort_randomized_partition_internal(pivot + 1, end, randomNumberGenerator); + } + } + + /** + * @brief Sort specified range of values using quick sort algorithm with randomized partitioning scheme. + * + * @tparam TIterator Iterator type (must be a random access iterator). + * @tparam TComparator Comparator type (must have a static member function bool LessThanOrEqualTo(const T& a, const T& b) + * where T is the value type of container being sorted). For example @see DefaultComparator, @see ReverseComparator. + * + * @param begin - Iterator specifying the beginning of a range to be sorted. + * @param end - Iterator specifying the end of a range to be sorted. + */ + template > + void quick_sort_randomized_partition(TIterator begin, TIterator end) + { + // Check that TIterator is a random-access iterator + static_assert( + std::is_same::iterator_category, + std::random_access_iterator_tag>::value, + "TIterator must be a random-access iterator."); + + // Check for the existence of a member function "LessThan" in TComparator type + static_assert( + std::is_same::value, + "LessThanOrEqualTo function is missing in TComparator"); + + auto size = end - begin; + + if (size > 1) + { + std::random_device seed_value; + std::mt19937 randomNumberGenerator; + randomNumberGenerator.seed(seed_value()); + + quick_sort_randomized_partition_internal(begin, end, randomNumberGenerator); + } + } } From ed32ab49f52a67f07a05471d810d900fa056e056 Mon Sep 17 00:00:00 2001 From: dvsav Date: Wed, 25 Oct 2023 23:38:10 +0400 Subject: [PATCH 008/121] quick_sort.h: fix comment --- src/quick_sort.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/quick_sort.h b/src/quick_sort.h index 520b2a4..291ddc7 100755 --- a/src/quick_sort.h +++ b/src/quick_sort.h @@ -73,7 +73,7 @@ namespace cs std::random_access_iterator_tag>::value, "TIterator must be a random-access iterator."); - // Check for the existence of a member function "LessThan" in TComparator type + // Check for the existence of a member function "LessThanOrEqualTo" in TComparator type static_assert( std::is_same::value, @@ -122,7 +122,7 @@ namespace cs std::random_access_iterator_tag>::value, "TIterator must be a random-access iterator."); - // Check for the existence of a member function "LessThan" in TComparator type + // Check for the existence of a member function "LessThanOrEqualTo" in TComparator type static_assert( std::is_same::value, From bf4973216c54e0653844f68fb56daf56ccfc2b2c Mon Sep 17 00:00:00 2001 From: dvsav Date: Thu, 26 Oct 2023 23:08:52 +0400 Subject: [PATCH 009/121] add Catch2 (v2, single header) as a unit test framework; add a testcase for sorting functions; utility: add function files_textually_equal; print.h: add ostream parameter and overloaded function print --- .../computer-science/computer-science.vcxproj | 1 + .../computer-science.vcxproj.filters | 3 + src/Catch2/LICENSE_1_0.txt | 23 + src/Catch2/catch.hpp | 17976 ++++++++++++++++ src/main.cpp | 63 +- src/print.h | 10 +- src/utility.cpp | 42 + src/utility.h | 17 + 8 files changed, 18117 insertions(+), 18 deletions(-) create mode 100755 src/Catch2/LICENSE_1_0.txt create mode 100755 src/Catch2/catch.hpp create mode 100755 src/utility.cpp diff --git a/build/vs2019/computer-science/computer-science.vcxproj b/build/vs2019/computer-science/computer-science.vcxproj index 21a1a2e..b6f4b42 100755 --- a/build/vs2019/computer-science/computer-science.vcxproj +++ b/build/vs2019/computer-science/computer-science.vcxproj @@ -146,6 +146,7 @@ + diff --git a/build/vs2019/computer-science/computer-science.vcxproj.filters b/build/vs2019/computer-science/computer-science.vcxproj.filters index 8be6641..c08e706 100755 --- a/build/vs2019/computer-science/computer-science.vcxproj.filters +++ b/build/vs2019/computer-science/computer-science.vcxproj.filters @@ -32,5 +32,8 @@ Source Files + + Source Files + \ No newline at end of file diff --git a/src/Catch2/LICENSE_1_0.txt b/src/Catch2/LICENSE_1_0.txt new file mode 100755 index 0000000..36b7cd9 --- /dev/null +++ b/src/Catch2/LICENSE_1_0.txt @@ -0,0 +1,23 @@ +Boost Software License - Version 1.0 - August 17th, 2003 + +Permission is hereby granted, free of charge, to any person or organization +obtaining a copy of the software and accompanying documentation covered by +this license (the "Software") to use, reproduce, display, distribute, +execute, and transmit the Software, and to prepare derivative works of the +Software, and to permit third-parties to whom the Software is furnished to +do so, all subject to the following: + +The copyright notices in the Software and this entire statement, including +the above license grant, this restriction and the following disclaimer, +must be included in all copies of the Software, in whole or in part, and +all derivative works of the Software, unless such copies or derivative +works are solely in the form of machine-executable object code generated by +a source language processor. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT +SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE +FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, +ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER +DEALINGS IN THE SOFTWARE. diff --git a/src/Catch2/catch.hpp b/src/Catch2/catch.hpp new file mode 100755 index 0000000..9b309bd --- /dev/null +++ b/src/Catch2/catch.hpp @@ -0,0 +1,17976 @@ +/* + * Catch v2.13.10 + * Generated: 2022-10-16 11:01:23.452308 + * ---------------------------------------------------------- + * This file has been merged from multiple headers. Please don't edit it directly + * Copyright (c) 2022 Two Blue Cubes Ltd. All rights reserved. + * + * Distributed under the Boost Software License, Version 1.0. (See accompanying + * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + */ +#ifndef TWOBLUECUBES_SINGLE_INCLUDE_CATCH_HPP_INCLUDED +#define TWOBLUECUBES_SINGLE_INCLUDE_CATCH_HPP_INCLUDED +// start catch.hpp + + +#define CATCH_VERSION_MAJOR 2 +#define CATCH_VERSION_MINOR 13 +#define CATCH_VERSION_PATCH 10 + +#ifdef __clang__ +# pragma clang system_header +#elif defined __GNUC__ +# pragma GCC system_header +#endif + +// start catch_suppress_warnings.h + +#ifdef __clang__ +# ifdef __ICC // icpc defines the __clang__ macro +# pragma warning(push) +# pragma warning(disable: 161 1682) +# else // __ICC +# pragma clang diagnostic push +# pragma clang diagnostic ignored "-Wpadded" +# pragma clang diagnostic ignored "-Wswitch-enum" +# pragma clang diagnostic ignored "-Wcovered-switch-default" +# endif +#elif defined __GNUC__ + // Because REQUIREs trigger GCC's -Wparentheses, and because still + // supported version of g++ have only buggy support for _Pragmas, + // Wparentheses have to be suppressed globally. +# pragma GCC diagnostic ignored "-Wparentheses" // See #674 for details + +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wunused-variable" +# pragma GCC diagnostic ignored "-Wpadded" +#endif +// end catch_suppress_warnings.h +#if defined(CATCH_CONFIG_MAIN) || defined(CATCH_CONFIG_RUNNER) +# define CATCH_IMPL +# define CATCH_CONFIG_ALL_PARTS +#endif + +// In the impl file, we want to have access to all parts of the headers +// Can also be used to sanely support PCHs +#if defined(CATCH_CONFIG_ALL_PARTS) +# define CATCH_CONFIG_EXTERNAL_INTERFACES +# if defined(CATCH_CONFIG_DISABLE_MATCHERS) +# undef CATCH_CONFIG_DISABLE_MATCHERS +# endif +# if !defined(CATCH_CONFIG_ENABLE_CHRONO_STRINGMAKER) +# define CATCH_CONFIG_ENABLE_CHRONO_STRINGMAKER +# endif +#endif + +#if !defined(CATCH_CONFIG_IMPL_ONLY) +// start catch_platform.h + +// See e.g.: +// https://opensource.apple.com/source/CarbonHeaders/CarbonHeaders-18.1/TargetConditionals.h.auto.html +#ifdef __APPLE__ +# include +# if (defined(TARGET_OS_OSX) && TARGET_OS_OSX == 1) || \ + (defined(TARGET_OS_MAC) && TARGET_OS_MAC == 1) +# define CATCH_PLATFORM_MAC +# elif (defined(TARGET_OS_IPHONE) && TARGET_OS_IPHONE == 1) +# define CATCH_PLATFORM_IPHONE +# endif + +#elif defined(linux) || defined(__linux) || defined(__linux__) +# define CATCH_PLATFORM_LINUX + +#elif defined(WIN32) || defined(__WIN32__) || defined(_WIN32) || defined(_MSC_VER) || defined(__MINGW32__) +# define CATCH_PLATFORM_WINDOWS +#endif + +// end catch_platform.h + +#ifdef CATCH_IMPL +# ifndef CLARA_CONFIG_MAIN +# define CLARA_CONFIG_MAIN_NOT_DEFINED +# define CLARA_CONFIG_MAIN +# endif +#endif + +// start catch_user_interfaces.h + +namespace Catch { + unsigned int rngSeed(); +} + +// end catch_user_interfaces.h +// start catch_tag_alias_autoregistrar.h + +// start catch_common.h + +// start catch_compiler_capabilities.h + +// Detect a number of compiler features - by compiler +// The following features are defined: +// +// CATCH_CONFIG_COUNTER : is the __COUNTER__ macro supported? +// CATCH_CONFIG_WINDOWS_SEH : is Windows SEH supported? +// CATCH_CONFIG_POSIX_SIGNALS : are POSIX signals supported? +// CATCH_CONFIG_DISABLE_EXCEPTIONS : Are exceptions enabled? +// **************** +// Note to maintainers: if new toggles are added please document them +// in configuration.md, too +// **************** + +// In general each macro has a _NO_ form +// (e.g. CATCH_CONFIG_NO_POSIX_SIGNALS) which disables the feature. +// Many features, at point of detection, define an _INTERNAL_ macro, so they +// can be combined, en-mass, with the _NO_ forms later. + +#ifdef __cplusplus + +# if (__cplusplus >= 201402L) || (defined(_MSVC_LANG) && _MSVC_LANG >= 201402L) +# define CATCH_CPP14_OR_GREATER +# endif + +# if (__cplusplus >= 201703L) || (defined(_MSVC_LANG) && _MSVC_LANG >= 201703L) +# define CATCH_CPP17_OR_GREATER +# endif + +#endif + +// Only GCC compiler should be used in this block, so other compilers trying to +// mask themselves as GCC should be ignored. +#if defined(__GNUC__) && !defined(__clang__) && !defined(__ICC) && !defined(__CUDACC__) && !defined(__LCC__) +# define CATCH_INTERNAL_START_WARNINGS_SUPPRESSION _Pragma( "GCC diagnostic push" ) +# define CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION _Pragma( "GCC diagnostic pop" ) + +# define CATCH_INTERNAL_IGNORE_BUT_WARN(...) (void)__builtin_constant_p(__VA_ARGS__) + +#endif + +#if defined(__clang__) + +# define CATCH_INTERNAL_START_WARNINGS_SUPPRESSION _Pragma( "clang diagnostic push" ) +# define CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION _Pragma( "clang diagnostic pop" ) + +// As of this writing, IBM XL's implementation of __builtin_constant_p has a bug +// which results in calls to destructors being emitted for each temporary, +// without a matching initialization. In practice, this can result in something +// like `std::string::~string` being called on an uninitialized value. +// +// For example, this code will likely segfault under IBM XL: +// ``` +// REQUIRE(std::string("12") + "34" == "1234") +// ``` +// +// Therefore, `CATCH_INTERNAL_IGNORE_BUT_WARN` is not implemented. +# if !defined(__ibmxl__) && !defined(__CUDACC__) +# define CATCH_INTERNAL_IGNORE_BUT_WARN(...) (void)__builtin_constant_p(__VA_ARGS__) /* NOLINT(cppcoreguidelines-pro-type-vararg, hicpp-vararg) */ +# endif + +# define CATCH_INTERNAL_SUPPRESS_GLOBALS_WARNINGS \ + _Pragma( "clang diagnostic ignored \"-Wexit-time-destructors\"" ) \ + _Pragma( "clang diagnostic ignored \"-Wglobal-constructors\"") + +# define CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS \ + _Pragma( "clang diagnostic ignored \"-Wparentheses\"" ) + +# define CATCH_INTERNAL_SUPPRESS_UNUSED_WARNINGS \ + _Pragma( "clang diagnostic ignored \"-Wunused-variable\"" ) + +# define CATCH_INTERNAL_SUPPRESS_ZERO_VARIADIC_WARNINGS \ + _Pragma( "clang diagnostic ignored \"-Wgnu-zero-variadic-macro-arguments\"" ) + +# define CATCH_INTERNAL_SUPPRESS_UNUSED_TEMPLATE_WARNINGS \ + _Pragma( "clang diagnostic ignored \"-Wunused-template\"" ) + +#endif // __clang__ + +//////////////////////////////////////////////////////////////////////////////// +// Assume that non-Windows platforms support posix signals by default +#if !defined(CATCH_PLATFORM_WINDOWS) + #define CATCH_INTERNAL_CONFIG_POSIX_SIGNALS +#endif + +//////////////////////////////////////////////////////////////////////////////// +// We know some environments not to support full POSIX signals +#if defined(__CYGWIN__) || defined(__QNX__) || defined(__EMSCRIPTEN__) || defined(__DJGPP__) + #define CATCH_INTERNAL_CONFIG_NO_POSIX_SIGNALS +#endif + +#ifdef __OS400__ +# define CATCH_INTERNAL_CONFIG_NO_POSIX_SIGNALS +# define CATCH_CONFIG_COLOUR_NONE +#endif + +//////////////////////////////////////////////////////////////////////////////// +// Android somehow still does not support std::to_string +#if defined(__ANDROID__) +# define CATCH_INTERNAL_CONFIG_NO_CPP11_TO_STRING +# define CATCH_INTERNAL_CONFIG_ANDROID_LOGWRITE +#endif + +//////////////////////////////////////////////////////////////////////////////// +// Not all Windows environments support SEH properly +#if defined(__MINGW32__) +# define CATCH_INTERNAL_CONFIG_NO_WINDOWS_SEH +#endif + +//////////////////////////////////////////////////////////////////////////////// +// PS4 +#if defined(__ORBIS__) +# define CATCH_INTERNAL_CONFIG_NO_NEW_CAPTURE +#endif + +//////////////////////////////////////////////////////////////////////////////// +// Cygwin +#ifdef __CYGWIN__ + +// Required for some versions of Cygwin to declare gettimeofday +// see: http://stackoverflow.com/questions/36901803/gettimeofday-not-declared-in-this-scope-cygwin +# define _BSD_SOURCE +// some versions of cygwin (most) do not support std::to_string. Use the libstd check. +// https://gcc.gnu.org/onlinedocs/gcc-4.8.2/libstdc++/api/a01053_source.html line 2812-2813 +# if !((__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99) \ + && !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF)) + +# define CATCH_INTERNAL_CONFIG_NO_CPP11_TO_STRING + +# endif +#endif // __CYGWIN__ + +//////////////////////////////////////////////////////////////////////////////// +// Visual C++ +#if defined(_MSC_VER) + +// Universal Windows platform does not support SEH +// Or console colours (or console at all...) +# if defined(WINAPI_FAMILY) && (WINAPI_FAMILY == WINAPI_FAMILY_APP) +# define CATCH_CONFIG_COLOUR_NONE +# else +# define CATCH_INTERNAL_CONFIG_WINDOWS_SEH +# endif + +# if !defined(__clang__) // Handle Clang masquerading for msvc + +// MSVC traditional preprocessor needs some workaround for __VA_ARGS__ +// _MSVC_TRADITIONAL == 0 means new conformant preprocessor +// _MSVC_TRADITIONAL == 1 means old traditional non-conformant preprocessor +# if !defined(_MSVC_TRADITIONAL) || (defined(_MSVC_TRADITIONAL) && _MSVC_TRADITIONAL) +# define CATCH_INTERNAL_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR +# endif // MSVC_TRADITIONAL + +// Only do this if we're not using clang on Windows, which uses `diagnostic push` & `diagnostic pop` +# define CATCH_INTERNAL_START_WARNINGS_SUPPRESSION __pragma( warning(push) ) +# define CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION __pragma( warning(pop) ) +# endif // __clang__ + +#endif // _MSC_VER + +#if defined(_REENTRANT) || defined(_MSC_VER) +// Enable async processing, as -pthread is specified or no additional linking is required +# define CATCH_INTERNAL_CONFIG_USE_ASYNC +#endif // _MSC_VER + +//////////////////////////////////////////////////////////////////////////////// +// Check if we are compiled with -fno-exceptions or equivalent +#if defined(__EXCEPTIONS) || defined(__cpp_exceptions) || defined(_CPPUNWIND) +# define CATCH_INTERNAL_CONFIG_EXCEPTIONS_ENABLED +#endif + +//////////////////////////////////////////////////////////////////////////////// +// DJGPP +#ifdef __DJGPP__ +# define CATCH_INTERNAL_CONFIG_NO_WCHAR +#endif // __DJGPP__ + +//////////////////////////////////////////////////////////////////////////////// +// Embarcadero C++Build +#if defined(__BORLANDC__) + #define CATCH_INTERNAL_CONFIG_POLYFILL_ISNAN +#endif + +//////////////////////////////////////////////////////////////////////////////// + +// Use of __COUNTER__ is suppressed during code analysis in +// CLion/AppCode 2017.2.x and former, because __COUNTER__ is not properly +// handled by it. +// Otherwise all supported compilers support COUNTER macro, +// but user still might want to turn it off +#if ( !defined(__JETBRAINS_IDE__) || __JETBRAINS_IDE__ >= 20170300L ) + #define CATCH_INTERNAL_CONFIG_COUNTER +#endif + +//////////////////////////////////////////////////////////////////////////////// + +// RTX is a special version of Windows that is real time. +// This means that it is detected as Windows, but does not provide +// the same set of capabilities as real Windows does. +#if defined(UNDER_RTSS) || defined(RTX64_BUILD) + #define CATCH_INTERNAL_CONFIG_NO_WINDOWS_SEH + #define CATCH_INTERNAL_CONFIG_NO_ASYNC + #define CATCH_CONFIG_COLOUR_NONE +#endif + +#if !defined(_GLIBCXX_USE_C99_MATH_TR1) +#define CATCH_INTERNAL_CONFIG_GLOBAL_NEXTAFTER +#endif + +// Various stdlib support checks that require __has_include +#if defined(__has_include) + // Check if string_view is available and usable + #if __has_include() && defined(CATCH_CPP17_OR_GREATER) + # define CATCH_INTERNAL_CONFIG_CPP17_STRING_VIEW + #endif + + // Check if optional is available and usable + # if __has_include() && defined(CATCH_CPP17_OR_GREATER) + # define CATCH_INTERNAL_CONFIG_CPP17_OPTIONAL + # endif // __has_include() && defined(CATCH_CPP17_OR_GREATER) + + // Check if byte is available and usable + # if __has_include() && defined(CATCH_CPP17_OR_GREATER) + # include + # if defined(__cpp_lib_byte) && (__cpp_lib_byte > 0) + # define CATCH_INTERNAL_CONFIG_CPP17_BYTE + # endif + # endif // __has_include() && defined(CATCH_CPP17_OR_GREATER) + + // Check if variant is available and usable + # if __has_include() && defined(CATCH_CPP17_OR_GREATER) + # if defined(__clang__) && (__clang_major__ < 8) + // work around clang bug with libstdc++ https://bugs.llvm.org/show_bug.cgi?id=31852 + // fix should be in clang 8, workaround in libstdc++ 8.2 + # include + # if defined(__GLIBCXX__) && defined(_GLIBCXX_RELEASE) && (_GLIBCXX_RELEASE < 9) + # define CATCH_CONFIG_NO_CPP17_VARIANT + # else + # define CATCH_INTERNAL_CONFIG_CPP17_VARIANT + # endif // defined(__GLIBCXX__) && defined(_GLIBCXX_RELEASE) && (_GLIBCXX_RELEASE < 9) + # else + # define CATCH_INTERNAL_CONFIG_CPP17_VARIANT + # endif // defined(__clang__) && (__clang_major__ < 8) + # endif // __has_include() && defined(CATCH_CPP17_OR_GREATER) +#endif // defined(__has_include) + +#if defined(CATCH_INTERNAL_CONFIG_COUNTER) && !defined(CATCH_CONFIG_NO_COUNTER) && !defined(CATCH_CONFIG_COUNTER) +# define CATCH_CONFIG_COUNTER +#endif +#if defined(CATCH_INTERNAL_CONFIG_WINDOWS_SEH) && !defined(CATCH_CONFIG_NO_WINDOWS_SEH) && !defined(CATCH_CONFIG_WINDOWS_SEH) && !defined(CATCH_INTERNAL_CONFIG_NO_WINDOWS_SEH) +# define CATCH_CONFIG_WINDOWS_SEH +#endif +// This is set by default, because we assume that unix compilers are posix-signal-compatible by default. +#if defined(CATCH_INTERNAL_CONFIG_POSIX_SIGNALS) && !defined(CATCH_INTERNAL_CONFIG_NO_POSIX_SIGNALS) && !defined(CATCH_CONFIG_NO_POSIX_SIGNALS) && !defined(CATCH_CONFIG_POSIX_SIGNALS) +# define CATCH_CONFIG_POSIX_SIGNALS +#endif +// This is set by default, because we assume that compilers with no wchar_t support are just rare exceptions. +#if !defined(CATCH_INTERNAL_CONFIG_NO_WCHAR) && !defined(CATCH_CONFIG_NO_WCHAR) && !defined(CATCH_CONFIG_WCHAR) +# define CATCH_CONFIG_WCHAR +#endif + +#if !defined(CATCH_INTERNAL_CONFIG_NO_CPP11_TO_STRING) && !defined(CATCH_CONFIG_NO_CPP11_TO_STRING) && !defined(CATCH_CONFIG_CPP11_TO_STRING) +# define CATCH_CONFIG_CPP11_TO_STRING +#endif + +#if defined(CATCH_INTERNAL_CONFIG_CPP17_OPTIONAL) && !defined(CATCH_CONFIG_NO_CPP17_OPTIONAL) && !defined(CATCH_CONFIG_CPP17_OPTIONAL) +# define CATCH_CONFIG_CPP17_OPTIONAL +#endif + +#if defined(CATCH_INTERNAL_CONFIG_CPP17_STRING_VIEW) && !defined(CATCH_CONFIG_NO_CPP17_STRING_VIEW) && !defined(CATCH_CONFIG_CPP17_STRING_VIEW) +# define CATCH_CONFIG_CPP17_STRING_VIEW +#endif + +#if defined(CATCH_INTERNAL_CONFIG_CPP17_VARIANT) && !defined(CATCH_CONFIG_NO_CPP17_VARIANT) && !defined(CATCH_CONFIG_CPP17_VARIANT) +# define CATCH_CONFIG_CPP17_VARIANT +#endif + +#if defined(CATCH_INTERNAL_CONFIG_CPP17_BYTE) && !defined(CATCH_CONFIG_NO_CPP17_BYTE) && !defined(CATCH_CONFIG_CPP17_BYTE) +# define CATCH_CONFIG_CPP17_BYTE +#endif + +#if defined(CATCH_CONFIG_EXPERIMENTAL_REDIRECT) +# define CATCH_INTERNAL_CONFIG_NEW_CAPTURE +#endif + +#if defined(CATCH_INTERNAL_CONFIG_NEW_CAPTURE) && !defined(CATCH_INTERNAL_CONFIG_NO_NEW_CAPTURE) && !defined(CATCH_CONFIG_NO_NEW_CAPTURE) && !defined(CATCH_CONFIG_NEW_CAPTURE) +# define CATCH_CONFIG_NEW_CAPTURE +#endif + +#if !defined(CATCH_INTERNAL_CONFIG_EXCEPTIONS_ENABLED) && !defined(CATCH_CONFIG_DISABLE_EXCEPTIONS) +# define CATCH_CONFIG_DISABLE_EXCEPTIONS +#endif + +#if defined(CATCH_INTERNAL_CONFIG_POLYFILL_ISNAN) && !defined(CATCH_CONFIG_NO_POLYFILL_ISNAN) && !defined(CATCH_CONFIG_POLYFILL_ISNAN) +# define CATCH_CONFIG_POLYFILL_ISNAN +#endif + +#if defined(CATCH_INTERNAL_CONFIG_USE_ASYNC) && !defined(CATCH_INTERNAL_CONFIG_NO_ASYNC) && !defined(CATCH_CONFIG_NO_USE_ASYNC) && !defined(CATCH_CONFIG_USE_ASYNC) +# define CATCH_CONFIG_USE_ASYNC +#endif + +#if defined(CATCH_INTERNAL_CONFIG_ANDROID_LOGWRITE) && !defined(CATCH_CONFIG_NO_ANDROID_LOGWRITE) && !defined(CATCH_CONFIG_ANDROID_LOGWRITE) +# define CATCH_CONFIG_ANDROID_LOGWRITE +#endif + +#if defined(CATCH_INTERNAL_CONFIG_GLOBAL_NEXTAFTER) && !defined(CATCH_CONFIG_NO_GLOBAL_NEXTAFTER) && !defined(CATCH_CONFIG_GLOBAL_NEXTAFTER) +# define CATCH_CONFIG_GLOBAL_NEXTAFTER +#endif + +// Even if we do not think the compiler has that warning, we still have +// to provide a macro that can be used by the code. +#if !defined(CATCH_INTERNAL_START_WARNINGS_SUPPRESSION) +# define CATCH_INTERNAL_START_WARNINGS_SUPPRESSION +#endif +#if !defined(CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION) +# define CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION +#endif +#if !defined(CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS) +# define CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS +#endif +#if !defined(CATCH_INTERNAL_SUPPRESS_GLOBALS_WARNINGS) +# define CATCH_INTERNAL_SUPPRESS_GLOBALS_WARNINGS +#endif +#if !defined(CATCH_INTERNAL_SUPPRESS_UNUSED_WARNINGS) +# define CATCH_INTERNAL_SUPPRESS_UNUSED_WARNINGS +#endif +#if !defined(CATCH_INTERNAL_SUPPRESS_ZERO_VARIADIC_WARNINGS) +# define CATCH_INTERNAL_SUPPRESS_ZERO_VARIADIC_WARNINGS +#endif + +// The goal of this macro is to avoid evaluation of the arguments, but +// still have the compiler warn on problems inside... +#if !defined(CATCH_INTERNAL_IGNORE_BUT_WARN) +# define CATCH_INTERNAL_IGNORE_BUT_WARN(...) +#endif + +#if defined(__APPLE__) && defined(__apple_build_version__) && (__clang_major__ < 10) +# undef CATCH_INTERNAL_SUPPRESS_UNUSED_TEMPLATE_WARNINGS +#elif defined(__clang__) && (__clang_major__ < 5) +# undef CATCH_INTERNAL_SUPPRESS_UNUSED_TEMPLATE_WARNINGS +#endif + +#if !defined(CATCH_INTERNAL_SUPPRESS_UNUSED_TEMPLATE_WARNINGS) +# define CATCH_INTERNAL_SUPPRESS_UNUSED_TEMPLATE_WARNINGS +#endif + +#if defined(CATCH_CONFIG_DISABLE_EXCEPTIONS) +#define CATCH_TRY if ((true)) +#define CATCH_CATCH_ALL if ((false)) +#define CATCH_CATCH_ANON(type) if ((false)) +#else +#define CATCH_TRY try +#define CATCH_CATCH_ALL catch (...) +#define CATCH_CATCH_ANON(type) catch (type) +#endif + +#if defined(CATCH_INTERNAL_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR) && !defined(CATCH_CONFIG_NO_TRADITIONAL_MSVC_PREPROCESSOR) && !defined(CATCH_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR) +#define CATCH_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR +#endif + +// end catch_compiler_capabilities.h +#define INTERNAL_CATCH_UNIQUE_NAME_LINE2( name, line ) name##line +#define INTERNAL_CATCH_UNIQUE_NAME_LINE( name, line ) INTERNAL_CATCH_UNIQUE_NAME_LINE2( name, line ) +#ifdef CATCH_CONFIG_COUNTER +# define INTERNAL_CATCH_UNIQUE_NAME( name ) INTERNAL_CATCH_UNIQUE_NAME_LINE( name, __COUNTER__ ) +#else +# define INTERNAL_CATCH_UNIQUE_NAME( name ) INTERNAL_CATCH_UNIQUE_NAME_LINE( name, __LINE__ ) +#endif + +#include +#include +#include + +// We need a dummy global operator<< so we can bring it into Catch namespace later +struct Catch_global_namespace_dummy {}; +std::ostream& operator<<(std::ostream&, Catch_global_namespace_dummy); + +namespace Catch { + + struct CaseSensitive { enum Choice { + Yes, + No + }; }; + + class NonCopyable { + NonCopyable( NonCopyable const& ) = delete; + NonCopyable( NonCopyable && ) = delete; + NonCopyable& operator = ( NonCopyable const& ) = delete; + NonCopyable& operator = ( NonCopyable && ) = delete; + + protected: + NonCopyable(); + virtual ~NonCopyable(); + }; + + struct SourceLineInfo { + + SourceLineInfo() = delete; + SourceLineInfo( char const* _file, std::size_t _line ) noexcept + : file( _file ), + line( _line ) + {} + + SourceLineInfo( SourceLineInfo const& other ) = default; + SourceLineInfo& operator = ( SourceLineInfo const& ) = default; + SourceLineInfo( SourceLineInfo&& ) noexcept = default; + SourceLineInfo& operator = ( SourceLineInfo&& ) noexcept = default; + + bool empty() const noexcept { return file[0] == '\0'; } + bool operator == ( SourceLineInfo const& other ) const noexcept; + bool operator < ( SourceLineInfo const& other ) const noexcept; + + char const* file; + std::size_t line; + }; + + std::ostream& operator << ( std::ostream& os, SourceLineInfo const& info ); + + // Bring in operator<< from global namespace into Catch namespace + // This is necessary because the overload of operator<< above makes + // lookup stop at namespace Catch + using ::operator<<; + + // Use this in variadic streaming macros to allow + // >> +StreamEndStop + // as well as + // >> stuff +StreamEndStop + struct StreamEndStop { + std::string operator+() const; + }; + template + T const& operator + ( T const& value, StreamEndStop ) { + return value; + } +} + +#define CATCH_INTERNAL_LINEINFO \ + ::Catch::SourceLineInfo( __FILE__, static_cast( __LINE__ ) ) + +// end catch_common.h +namespace Catch { + + struct RegistrarForTagAliases { + RegistrarForTagAliases( char const* alias, char const* tag, SourceLineInfo const& lineInfo ); + }; + +} // end namespace Catch + +#define CATCH_REGISTER_TAG_ALIAS( alias, spec ) \ + CATCH_INTERNAL_START_WARNINGS_SUPPRESSION \ + CATCH_INTERNAL_SUPPRESS_GLOBALS_WARNINGS \ + namespace{ Catch::RegistrarForTagAliases INTERNAL_CATCH_UNIQUE_NAME( AutoRegisterTagAlias )( alias, spec, CATCH_INTERNAL_LINEINFO ); } \ + CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION + +// end catch_tag_alias_autoregistrar.h +// start catch_test_registry.h + +// start catch_interfaces_testcase.h + +#include + +namespace Catch { + + class TestSpec; + + struct ITestInvoker { + virtual void invoke () const = 0; + virtual ~ITestInvoker(); + }; + + class TestCase; + struct IConfig; + + struct ITestCaseRegistry { + virtual ~ITestCaseRegistry(); + virtual std::vector const& getAllTests() const = 0; + virtual std::vector const& getAllTestsSorted( IConfig const& config ) const = 0; + }; + + bool isThrowSafe( TestCase const& testCase, IConfig const& config ); + bool matchTest( TestCase const& testCase, TestSpec const& testSpec, IConfig const& config ); + std::vector filterTests( std::vector const& testCases, TestSpec const& testSpec, IConfig const& config ); + std::vector const& getAllTestCasesSorted( IConfig const& config ); + +} + +// end catch_interfaces_testcase.h +// start catch_stringref.h + +#include +#include +#include +#include + +namespace Catch { + + /// A non-owning string class (similar to the forthcoming std::string_view) + /// Note that, because a StringRef may be a substring of another string, + /// it may not be null terminated. + class StringRef { + public: + using size_type = std::size_t; + using const_iterator = const char*; + + private: + static constexpr char const* const s_empty = ""; + + char const* m_start = s_empty; + size_type m_size = 0; + + public: // construction + constexpr StringRef() noexcept = default; + + StringRef( char const* rawChars ) noexcept; + + constexpr StringRef( char const* rawChars, size_type size ) noexcept + : m_start( rawChars ), + m_size( size ) + {} + + StringRef( std::string const& stdString ) noexcept + : m_start( stdString.c_str() ), + m_size( stdString.size() ) + {} + + explicit operator std::string() const { + return std::string(m_start, m_size); + } + + public: // operators + auto operator == ( StringRef const& other ) const noexcept -> bool; + auto operator != (StringRef const& other) const noexcept -> bool { + return !(*this == other); + } + + auto operator[] ( size_type index ) const noexcept -> char { + assert(index < m_size); + return m_start[index]; + } + + public: // named queries + constexpr auto empty() const noexcept -> bool { + return m_size == 0; + } + constexpr auto size() const noexcept -> size_type { + return m_size; + } + + // Returns the current start pointer. If the StringRef is not + // null-terminated, throws std::domain_exception + auto c_str() const -> char const*; + + public: // substrings and searches + // Returns a substring of [start, start + length). + // If start + length > size(), then the substring is [start, size()). + // If start > size(), then the substring is empty. + auto substr( size_type start, size_type length ) const noexcept -> StringRef; + + // Returns the current start pointer. May not be null-terminated. + auto data() const noexcept -> char const*; + + constexpr auto isNullTerminated() const noexcept -> bool { + return m_start[m_size] == '\0'; + } + + public: // iterators + constexpr const_iterator begin() const { return m_start; } + constexpr const_iterator end() const { return m_start + m_size; } + }; + + auto operator += ( std::string& lhs, StringRef const& sr ) -> std::string&; + auto operator << ( std::ostream& os, StringRef const& sr ) -> std::ostream&; + + constexpr auto operator "" _sr( char const* rawChars, std::size_t size ) noexcept -> StringRef { + return StringRef( rawChars, size ); + } +} // namespace Catch + +constexpr auto operator "" _catch_sr( char const* rawChars, std::size_t size ) noexcept -> Catch::StringRef { + return Catch::StringRef( rawChars, size ); +} + +// end catch_stringref.h +// start catch_preprocessor.hpp + + +#define CATCH_RECURSION_LEVEL0(...) __VA_ARGS__ +#define CATCH_RECURSION_LEVEL1(...) CATCH_RECURSION_LEVEL0(CATCH_RECURSION_LEVEL0(CATCH_RECURSION_LEVEL0(__VA_ARGS__))) +#define CATCH_RECURSION_LEVEL2(...) CATCH_RECURSION_LEVEL1(CATCH_RECURSION_LEVEL1(CATCH_RECURSION_LEVEL1(__VA_ARGS__))) +#define CATCH_RECURSION_LEVEL3(...) CATCH_RECURSION_LEVEL2(CATCH_RECURSION_LEVEL2(CATCH_RECURSION_LEVEL2(__VA_ARGS__))) +#define CATCH_RECURSION_LEVEL4(...) CATCH_RECURSION_LEVEL3(CATCH_RECURSION_LEVEL3(CATCH_RECURSION_LEVEL3(__VA_ARGS__))) +#define CATCH_RECURSION_LEVEL5(...) CATCH_RECURSION_LEVEL4(CATCH_RECURSION_LEVEL4(CATCH_RECURSION_LEVEL4(__VA_ARGS__))) + +#ifdef CATCH_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR +#define INTERNAL_CATCH_EXPAND_VARGS(...) __VA_ARGS__ +// MSVC needs more evaluations +#define CATCH_RECURSION_LEVEL6(...) CATCH_RECURSION_LEVEL5(CATCH_RECURSION_LEVEL5(CATCH_RECURSION_LEVEL5(__VA_ARGS__))) +#define CATCH_RECURSE(...) CATCH_RECURSION_LEVEL6(CATCH_RECURSION_LEVEL6(__VA_ARGS__)) +#else +#define CATCH_RECURSE(...) CATCH_RECURSION_LEVEL5(__VA_ARGS__) +#endif + +#define CATCH_REC_END(...) +#define CATCH_REC_OUT + +#define CATCH_EMPTY() +#define CATCH_DEFER(id) id CATCH_EMPTY() + +#define CATCH_REC_GET_END2() 0, CATCH_REC_END +#define CATCH_REC_GET_END1(...) CATCH_REC_GET_END2 +#define CATCH_REC_GET_END(...) CATCH_REC_GET_END1 +#define CATCH_REC_NEXT0(test, next, ...) next CATCH_REC_OUT +#define CATCH_REC_NEXT1(test, next) CATCH_DEFER ( CATCH_REC_NEXT0 ) ( test, next, 0) +#define CATCH_REC_NEXT(test, next) CATCH_REC_NEXT1(CATCH_REC_GET_END test, next) + +#define CATCH_REC_LIST0(f, x, peek, ...) , f(x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST1) ) ( f, peek, __VA_ARGS__ ) +#define CATCH_REC_LIST1(f, x, peek, ...) , f(x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST0) ) ( f, peek, __VA_ARGS__ ) +#define CATCH_REC_LIST2(f, x, peek, ...) f(x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST1) ) ( f, peek, __VA_ARGS__ ) + +#define CATCH_REC_LIST0_UD(f, userdata, x, peek, ...) , f(userdata, x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST1_UD) ) ( f, userdata, peek, __VA_ARGS__ ) +#define CATCH_REC_LIST1_UD(f, userdata, x, peek, ...) , f(userdata, x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST0_UD) ) ( f, userdata, peek, __VA_ARGS__ ) +#define CATCH_REC_LIST2_UD(f, userdata, x, peek, ...) f(userdata, x) CATCH_DEFER ( CATCH_REC_NEXT(peek, CATCH_REC_LIST1_UD) ) ( f, userdata, peek, __VA_ARGS__ ) + +// Applies the function macro `f` to each of the remaining parameters, inserts commas between the results, +// and passes userdata as the first parameter to each invocation, +// e.g. CATCH_REC_LIST_UD(f, x, a, b, c) evaluates to f(x, a), f(x, b), f(x, c) +#define CATCH_REC_LIST_UD(f, userdata, ...) CATCH_RECURSE(CATCH_REC_LIST2_UD(f, userdata, __VA_ARGS__, ()()(), ()()(), ()()(), 0)) + +#define CATCH_REC_LIST(f, ...) CATCH_RECURSE(CATCH_REC_LIST2(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0)) + +#define INTERNAL_CATCH_EXPAND1(param) INTERNAL_CATCH_EXPAND2(param) +#define INTERNAL_CATCH_EXPAND2(...) INTERNAL_CATCH_NO## __VA_ARGS__ +#define INTERNAL_CATCH_DEF(...) INTERNAL_CATCH_DEF __VA_ARGS__ +#define INTERNAL_CATCH_NOINTERNAL_CATCH_DEF +#define INTERNAL_CATCH_STRINGIZE(...) INTERNAL_CATCH_STRINGIZE2(__VA_ARGS__) +#ifndef CATCH_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR +#define INTERNAL_CATCH_STRINGIZE2(...) #__VA_ARGS__ +#define INTERNAL_CATCH_STRINGIZE_WITHOUT_PARENS(param) INTERNAL_CATCH_STRINGIZE(INTERNAL_CATCH_REMOVE_PARENS(param)) +#else +// MSVC is adding extra space and needs another indirection to expand INTERNAL_CATCH_NOINTERNAL_CATCH_DEF +#define INTERNAL_CATCH_STRINGIZE2(...) INTERNAL_CATCH_STRINGIZE3(__VA_ARGS__) +#define INTERNAL_CATCH_STRINGIZE3(...) #__VA_ARGS__ +#define INTERNAL_CATCH_STRINGIZE_WITHOUT_PARENS(param) (INTERNAL_CATCH_STRINGIZE(INTERNAL_CATCH_REMOVE_PARENS(param)) + 1) +#endif + +#define INTERNAL_CATCH_MAKE_NAMESPACE2(...) ns_##__VA_ARGS__ +#define INTERNAL_CATCH_MAKE_NAMESPACE(name) INTERNAL_CATCH_MAKE_NAMESPACE2(name) + +#define INTERNAL_CATCH_REMOVE_PARENS(...) INTERNAL_CATCH_EXPAND1(INTERNAL_CATCH_DEF __VA_ARGS__) + +#ifndef CATCH_CONFIG_TRADITIONAL_MSVC_PREPROCESSOR +#define INTERNAL_CATCH_MAKE_TYPE_LIST2(...) decltype(get_wrapper()) +#define INTERNAL_CATCH_MAKE_TYPE_LIST(...) INTERNAL_CATCH_MAKE_TYPE_LIST2(INTERNAL_CATCH_REMOVE_PARENS(__VA_ARGS__)) +#else +#define INTERNAL_CATCH_MAKE_TYPE_LIST2(...) INTERNAL_CATCH_EXPAND_VARGS(decltype(get_wrapper())) +#define INTERNAL_CATCH_MAKE_TYPE_LIST(...) INTERNAL_CATCH_EXPAND_VARGS(INTERNAL_CATCH_MAKE_TYPE_LIST2(INTERNAL_CATCH_REMOVE_PARENS(__VA_ARGS__))) +#endif + +#define INTERNAL_CATCH_MAKE_TYPE_LISTS_FROM_TYPES(...)\ + CATCH_REC_LIST(INTERNAL_CATCH_MAKE_TYPE_LIST,__VA_ARGS__) + +#define INTERNAL_CATCH_REMOVE_PARENS_1_ARG(_0) INTERNAL_CATCH_REMOVE_PARENS(_0) +#define INTERNAL_CATCH_REMOVE_PARENS_2_ARG(_0, _1) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_1_ARG(_1) +#define INTERNAL_CATCH_REMOVE_PARENS_3_ARG(_0, _1, _2) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_2_ARG(_1, _2) +#define INTERNAL_CATCH_REMOVE_PARENS_4_ARG(_0, _1, _2, _3) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_3_ARG(_1, _2, _3) +#define INTERNAL_CATCH_REMOVE_PARENS_5_ARG(_0, _1, _2, _3, _4) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_4_ARG(_1, _2, _3, _4) +#define INTERNAL_CATCH_REMOVE_PARENS_6_ARG(_0, _1, _2, _3, _4, _5) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_5_ARG(_1, _2, _3, _4, _5) +#define INTERNAL_CATCH_REMOVE_PARENS_7_ARG(_0, _1, _2, _3, _4, _5, _6) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_6_ARG(_1, _2, _3, _4, _5, _6) +#define INTERNAL_CATCH_REMOVE_PARENS_8_ARG(_0, _1, _2, _3, _4, _5, _6, _7) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_7_ARG(_1, _2, _3, _4, _5, _6, _7) +#define INTERNAL_CATCH_REMOVE_PARENS_9_ARG(_0, _1, _2, _3, _4, _5, _6, _7, _8) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_8_ARG(_1, _2, _3, _4, _5, _6, _7, _8) +#define INTERNAL_CATCH_REMOVE_PARENS_10_ARG(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_9_ARG(_1, _2, _3, _4, _5, _6, _7, _8, _9) +#define INTERNAL_CATCH_REMOVE_PARENS_11_ARG(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10) INTERNAL_CATCH_REMOVE_PARENS(_0), INTERNAL_CATCH_REMOVE_PARENS_10_ARG(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10) + +#define INTERNAL_CATCH_VA_NARGS_IMPL(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, N, ...) N + +#define INTERNAL_CATCH_TYPE_GEN\ + template struct TypeList {};\ + template\ + constexpr auto get_wrapper() noexcept -> TypeList { return {}; }\ + template class...> struct TemplateTypeList{};\ + template class...Cs>\ + constexpr auto get_wrapper() noexcept -> TemplateTypeList { return {}; }\ + template\ + struct append;\ + template\ + struct rewrap;\ + template class, typename...>\ + struct create;\ + template class, typename>\ + struct convert;\ + \ + template \ + struct append { using type = T; };\ + template< template class L1, typename...E1, template class L2, typename...E2, typename...Rest>\ + struct append, L2, Rest...> { using type = typename append, Rest...>::type; };\ + template< template class L1, typename...E1, typename...Rest>\ + struct append, TypeList, Rest...> { using type = L1; };\ + \ + template< template class Container, template class List, typename...elems>\ + struct rewrap, List> { using type = TypeList>; };\ + template< template class Container, template class List, class...Elems, typename...Elements>\ + struct rewrap, List, Elements...> { using type = typename append>, typename rewrap, Elements...>::type>::type; };\ + \ + template