diff --git a/SClinux/main.cpp b/SClinux/main.cpp
index 59b4b02e9c19b86169ec4f44a8335355d38b0b77..0d035c0b6d4d7e328be13557643d68aa5f04daf2 100644
--- a/SClinux/main.cpp
+++ b/SClinux/main.cpp
@@ -1,10 +1,6 @@
#include "stdafx.h"
-
-#include "structs.h"
#include "mains.h"
-#include <random>
-
using namespace std;
int main(int argc, char **argv)
diff --git a/SCwin/SCwin.args.json b/SCwin/SCwin.args.json
index 8cd1935652b163696c88948bc0244671197a5cb3..b780f9672853adba78649d7da92f32762f604075 100644
--- a/SCwin/SCwin.args.json
+++ b/SCwin/SCwin.args.json
@@ -10,7 +10,7 @@
},
{
"Id": "36286d82-7571-4f5b-9d07-dfab2d3e1ac2",
- "Command": "-in "
+ "Command": "-pout"
},
{
"Id": "986392be-8394-4f55-af78-251180ca4acd",
@@ -72,9 +72,17 @@
"Id": "9cac09c4-71ed-49b9-9207-9d5d6e352849",
"Command": "-op 4"
},
+ {
+ "Id": "fe43848e-0a9a-46c7-aefe-6e02c688e69d",
+ "Command": "-m lcss"
+ },
+ {
+ "Id": "add63608-14a7-4def-9cb1-7278cc343b0c",
+ "Command": "-op 6"
+ },
{
"Id": "1ff9530d-1d8f-4348-8eb7-96ce5091f7e8",
- "Command": "-pr 4"
+ "Command": "-pr 2"
},
{
"Id": "1b30753d-e053-479c-b0cb-ad83a7009c9f",
@@ -82,7 +90,7 @@
},
{
"Id": "7ca22c6e-0b52-4357-9fc7-995b2c0c0164",
- "Command": "-paa 5"
+ "Command": "-shift"
},
{
"Id": "ffa5ab9f-8524-4479-a79b-dade7c3d1508",
@@ -90,7 +98,7 @@
},
{
"Id": "cd60865d-7f0b-4ee2-b7e7-b2debb07b834",
- "Command": "-dist 4"
+ "Command": "-tt 0 -ta 0 -te 0"
},
{
"Id": "827df8ff-ff78-4e42-a7ff-23929a9e03a2",
@@ -102,7 +110,7 @@
},
{
"Id": "fcaac480-da78-4fb0-89f7-8edc217a986d",
- "Command": "-c c:\\code\\data\\sc\\c31.txt"
+ "Command": "-gt c:\\code\\data\\sc\\c31.txt"
},
{
"Id": "35f58106-c0db-41a2-a509-a11d3975cef5",
@@ -110,7 +118,7 @@
},
{
"Id": "f08d0acd-19e1-40ec-9180-31b29bd11ad1",
- "Command": "-s 4"
+ "Command": "-w 10"
},
{
"Id": "1163ea92-2da9-4567-81c5-8fabca59fdcc",
@@ -126,7 +134,7 @@
},
{
"Id": "eebf3b27-0fdc-4a84-81eb-fec4308c6032",
- "Command": "-pr 2"
+ "Command": "-pr 1"
},
{
"Id": "c9c3410e-67ed-4f97-9290-8e3533731181",
diff --git a/SCwin/SCwin.vcxproj b/SCwin/SCwin.vcxproj
index 552005ed5ffca0a268316188f98d17be5f5c1dbc..15388099a520256810161df919758b41a8483355 100644
--- a/SCwin/SCwin.vcxproj
+++ b/SCwin/SCwin.vcxproj
@@ -106,6 +106,7 @@
<OpenMPSupport>true</OpenMPSupport>
<WholeProgramOptimization>false</WholeProgramOptimization>
<IntrinsicFunctions>true</IntrinsicFunctions>
+ <LanguageStandard>stdcpp17</LanguageStandard>
</ClCompile>
<Link>
<SubSystem>Console</SubSystem>
@@ -138,7 +139,7 @@
<TreatWarningAsError>false</TreatWarningAsError>
<EnableEnhancedInstructionSet>AdvancedVectorExtensions2</EnableEnhancedInstructionSet>
<AdditionalOptions>/Qvec-report:1 %(AdditionalOptions)</AdditionalOptions>
- <BrowseInformation>true</BrowseInformation>
+ <BrowseInformation>false</BrowseInformation>
</ClCompile>
<Link>
<SubSystem>Console</SubSystem>
@@ -156,6 +157,9 @@
<ItemGroup>
<ClCompile Include="main.cpp" />
</ItemGroup>
+ <ItemGroup>
+ <ClInclude Include="doctest.h" />
+ </ItemGroup>
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
<ImportGroup Label="ExtensionTargets">
</ImportGroup>
diff --git a/SCwin/SCwin.vcxproj.filters b/SCwin/SCwin.vcxproj.filters
index 31e103f9d6177369cd64003809e8423c50ecd1a3..c67db6de3c5ad82c764e04697bdcafc0ce351ce5 100644
--- a/SCwin/SCwin.vcxproj.filters
+++ b/SCwin/SCwin.vcxproj.filters
@@ -22,4 +22,9 @@
<Filter>Source Files</Filter>
</ClCompile>
</ItemGroup>
+ <ItemGroup>
+ <ClInclude Include="doctest.h">
+ <Filter>Header Files</Filter>
+ </ClInclude>
+ </ItemGroup>
</Project>
\ No newline at end of file
diff --git a/SCwin/doctest.h b/SCwin/doctest.h
new file mode 100644
index 0000000000000000000000000000000000000000..27431bd5a5c8ee4776492d4b565b7133e8359479
--- /dev/null
+++ b/SCwin/doctest.h
@@ -0,0 +1,5767 @@
+// ======================================================================
+// == DO NOT MODIFY THIS FILE BY HAND - IT IS AUTO GENERATED BY CMAKE! ==
+// ======================================================================
+//
+// doctest.h - the lightest feature-rich C++ single-header testing framework for unit tests and TDD
+//
+// Copyright (c) 2016-2017 Viktor Kirilov
+//
+// Distributed under the MIT Software License
+// See accompanying file LICENSE.txt or copy at
+// https://opensource.org/licenses/MIT
+//
+// The documentation can be found at the library's page:
+// https://github.com/onqtam/doctest/blob/master/doc/markdown/readme.md
+//
+// =================================================================================================
+// =================================================================================================
+// =================================================================================================
+//
+// The library is heavily influenced by Catch - https://github.com/philsquared/Catch
+// which uses the Boost Software License - Version 1.0
+// see here - https://github.com/philsquared/Catch/blob/master/LICENSE_1_0.txt
+//
+// The concept of subcases (sections in Catch) and expression decomposition are from there.
+// Some parts of the code are taken directly:
+// - stringification - the detection of "ostream& operator<<(ostream&, const T&)" and StringMaker<>
+// - the Approx() helper class for floating point comparison
+// - colors in the console
+// - breaking into a debugger
+// - signal / SEH handling
+// - timer
+//
+// The expression decomposing templates are taken from lest - https://github.com/martinmoene/lest
+// which uses the Boost Software License - Version 1.0
+// see here - https://github.com/martinmoene/lest/blob/master/LICENSE_1_0.txt
+//
+// The type list and the foreach algorithm on it for C++98 are taken from Loki
+// - http://loki-lib.sourceforge.net/
+// - https://en.wikipedia.org/wiki/Loki_%28C%2B%2B%29
+// - https://github.com/snaewe/loki-lib
+// which uses the MIT Software License
+//
+// =================================================================================================
+// =================================================================================================
+// =================================================================================================
+
+// Suppress this globally (without push/pop) - there is no way to silence it in the
+// expression decomposition macros _Pragma() in macros doesn't work for the c++ front-end of g++
+// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=55578
+// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=69543
+// Also the warning is completely worthless nowadays - http://stackoverflow.com/questions/14016993
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic ignored "-Waggregate-return"
+#endif
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunknown-pragmas"
+#pragma clang diagnostic ignored "-Wnon-virtual-dtor"
+#pragma clang diagnostic ignored "-Wweak-vtables"
+#pragma clang diagnostic ignored "-Wpadded"
+#pragma clang diagnostic ignored "-Wdeprecated"
+#pragma clang diagnostic ignored "-Wmissing-prototypes"
+#pragma clang diagnostic ignored "-Wunused-local-typedef"
+#pragma clang diagnostic ignored "-Wzero-as-null-pointer-constant"
+#pragma clang diagnostic ignored "-Wc++11-long-long"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wunknown-pragmas"
+#pragma GCC diagnostic ignored "-Weffc++"
+#pragma GCC diagnostic ignored "-Wstrict-overflow"
+#pragma GCC diagnostic ignored "-Wstrict-aliasing"
+#pragma GCC diagnostic ignored "-Wctor-dtor-privacy"
+#pragma GCC diagnostic ignored "-Wmissing-declarations"
+#pragma GCC diagnostic ignored "-Wnon-virtual-dtor"
+#pragma GCC diagnostic ignored "-Winline"
+#pragma GCC diagnostic ignored "-Wlong-long"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic ignored "-Wzero-as-null-pointer-constant"
+#endif // > gcc 4.6
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 7)
+#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
+#endif // > gcc 4.7
+#if __GNUC__ > 5 || (__GNUC__ == 5 && __GNUC_MINOR__ > 3)
+#pragma GCC diagnostic ignored "-Wuseless-cast"
+#endif // > gcc 5.3
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4996) // The compiler encountered a deprecated declaration
+#pragma warning(disable : 4706) // assignment within conditional expression
+#pragma warning(disable : 4512) // 'class' : assignment operator could not be generated
+#pragma warning(disable : 4127) // conditional expression is constant
+#endif // _MSC_VER
+
+#ifndef DOCTEST_LIBRARY_INCLUDED
+#define DOCTEST_LIBRARY_INCLUDED
+
+#define DOCTEST_VERSION_MAJOR 1
+#define DOCTEST_VERSION_MINOR 2
+#define DOCTEST_VERSION_PATCH 1
+#define DOCTEST_VERSION_STR "1.2.1"
+
+#define DOCTEST_VERSION \
+ (DOCTEST_VERSION_MAJOR * 10000 + DOCTEST_VERSION_MINOR * 100 + DOCTEST_VERSION_PATCH)
+
+// =================================================================================================
+// == FEATURE DETECTION ============================================================================
+// =================================================================================================
+
+#if __cplusplus >= 201103L
+#ifndef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#ifndef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#ifndef DOCTEST_CONFIG_WITH_NULLPTR
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+#ifndef DOCTEST_CONFIG_WITH_LONG_LONG
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#ifndef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // __cplusplus >= 201103L
+
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif // __has_feature
+
+// MSVC C++11 feature support table: https://msdn.microsoft.com/en-us/library/hh567368.aspx
+// GCC C++11 feature support table: https://gcc.gnu.org/projects/cxx-status.html
+// MSVC version table:
+// MSVC++ 15.0 _MSC_VER == 1910 (Visual Studio 2017)
+// MSVC++ 14.0 _MSC_VER == 1900 (Visual Studio 2015)
+// MSVC++ 12.0 _MSC_VER == 1800 (Visual Studio 2013)
+// MSVC++ 11.0 _MSC_VER == 1700 (Visual Studio 2012)
+// MSVC++ 10.0 _MSC_VER == 1600 (Visual Studio 2010)
+// MSVC++ 9.0 _MSC_VER == 1500 (Visual Studio 2008)
+// MSVC++ 8.0 _MSC_VER == 1400 (Visual Studio 2005)
+
+// deleted functions
+
+#ifndef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#if defined(_MSC_VER) && (_MSC_VER >= 1800)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // _MSC_VER
+#if defined(__clang__) && __has_feature(cxx_deleted_functions)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 4) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // __GNUC__
+#endif // DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+
+#if defined(DOCTEST_CONFIG_NO_DELETED_FUNCTIONS) && defined(DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS)
+#undef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // DOCTEST_CONFIG_NO_DELETED_FUNCTIONS
+
+// rvalue references
+
+#ifndef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#if defined(_MSC_VER) && (_MSC_VER >= 1600)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // _MSC_VER
+#if defined(__clang__) && __has_feature(cxx_rvalue_references)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 3) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // __GNUC__
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+#if defined(DOCTEST_CONFIG_NO_RVALUE_REFERENCES) && defined(DOCTEST_CONFIG_WITH_RVALUE_REFERENCES)
+#undef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // DOCTEST_CONFIG_NO_RVALUE_REFERENCES
+
+// nullptr
+
+#ifndef DOCTEST_CONFIG_WITH_NULLPTR
+#if defined(__clang__) && __has_feature(cxx_nullptr)
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 6) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // __GNUC__
+#if defined(_MSC_VER) && (_MSC_VER >= 1600) // MSVC 2010
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // _MSC_VER
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+#if defined(DOCTEST_CONFIG_NO_NULLPTR) && defined(DOCTEST_CONFIG_WITH_NULLPTR)
+#undef DOCTEST_CONFIG_WITH_NULLPTR
+#endif // DOCTEST_CONFIG_NO_NULLPTR
+
+// variadic macros
+
+#ifndef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#if defined(_MSC_VER) && _MSC_VER > 1400 && !defined(__EDGE__)
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // _MSC_VER
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 1) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // __GNUC__ and clang
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#if defined(DOCTEST_CONFIG_NO_VARIADIC_MACROS) && defined(DOCTEST_CONFIG_WITH_VARIADIC_MACROS)
+#undef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // DOCTEST_CONFIG_NO_VARIADIC_MACROS
+
+// long long
+
+#ifndef DOCTEST_CONFIG_WITH_LONG_LONG
+#if defined(_MSC_VER) && (_MSC_VER >= 1400)
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // _MSC_VER
+#if(defined(__clang__) || \
+ (defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 5) || __GNUC__ > 4))) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // __GNUC__ and clang
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#if defined(DOCTEST_CONFIG_NO_LONG_LONG) && defined(DOCTEST_CONFIG_WITH_LONG_LONG)
+#undef DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // DOCTEST_CONFIG_NO_LONG_LONG
+
+// static_assert
+
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#if defined(__clang__) && __has_feature(cxx_static_assert)
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 3) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // __GNUC__
+#if defined(_MSC_VER) && (_MSC_VER >= 1600) // MSVC 2010
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // _MSC_VER
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+#if defined(DOCTEST_CONFIG_NO_STATIC_ASSERT) && defined(DOCTEST_CONFIG_WITH_STATIC_ASSERT)
+#undef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // DOCTEST_CONFIG_NO_STATIC_ASSERT
+
+// other stuff...
+
+#if defined(DOCTEST_CONFIG_WITH_RVALUE_REFERENCES) || defined(DOCTEST_CONFIG_WITH_LONG_LONG) || \
+ defined(DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS) || defined(DOCTEST_CONFIG_WITH_NULLPTR) || \
+ defined(DOCTEST_CONFIG_WITH_VARIADIC_MACROS) || defined(DOCTEST_CONFIG_WITH_STATIC_ASSERT)
+#define DOCTEST_NO_CPP11_COMPAT
+#endif // c++11 stuff
+
+#if defined(__clang__) && defined(DOCTEST_NO_CPP11_COMPAT)
+#pragma clang diagnostic ignored "-Wc++98-compat"
+#pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif // __clang__ && DOCTEST_NO_CPP11_COMPAT
+
+#if defined(_MSC_VER) && !defined(DOCTEST_CONFIG_WINDOWS_SEH)
+#define DOCTEST_CONFIG_WINDOWS_SEH
+#endif // _MSC_VER
+#if defined(DOCTEST_CONFIG_NO_WINDOWS_SEH) && defined(DOCTEST_CONFIG_WINDOWS_SEH)
+#undef DOCTEST_CONFIG_WINDOWS_SEH
+#endif // DOCTEST_CONFIG_NO_WINDOWS_SEH
+
+#if !defined(_WIN32) && !defined(__QNX__) && !defined(DOCTEST_CONFIG_POSIX_SIGNALS)
+#define DOCTEST_CONFIG_POSIX_SIGNALS
+#endif // _WIN32
+#if defined(DOCTEST_CONFIG_NO_POSIX_SIGNALS) && defined(DOCTEST_CONFIG_POSIX_SIGNALS)
+#undef DOCTEST_CONFIG_POSIX_SIGNALS
+#endif // DOCTEST_CONFIG_NO_POSIX_SIGNALS
+
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+#if defined(__GNUC__) && !defined(__EXCEPTIONS)
+#define DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // clang and gcc
+// in MSVC _HAS_EXCEPTIONS is defined in a header instead of as a project define
+// so we can't do the automatic detection for MSVC without including some header
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+#define DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#if defined(DOCTEST_CONFIG_NO_EXCEPTIONS) && !defined(DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS)
+#define DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS && !DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+
+#if defined(DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN) && !defined(DOCTEST_CONFIG_IMPLEMENT)
+#define DOCTEST_CONFIG_IMPLEMENT
+#endif // DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+
+#if defined _WIN32 || defined __CYGWIN__
+#ifdef __GNUC__
+#define DOCTEST_SYMBOL_EXPORT __attribute__((dllexport))
+#define DOCTEST_SYMBOL_IMPORT __attribute__((dllimport))
+#else // __GNUC__
+#define DOCTEST_SYMBOL_EXPORT __declspec(dllexport)
+#define DOCTEST_SYMBOL_IMPORT __declspec(dllimport)
+#endif // __GNUC__
+#else // _WIN32
+#define DOCTEST_SYMBOL_EXPORT __attribute__((visibility("default")))
+#define DOCTEST_SYMBOL_IMPORT
+#endif // _WIN32
+
+#ifdef DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+#ifdef DOCTEST_CONFIG_IMPLEMENT
+#define DOCTEST_INTERFACE DOCTEST_SYMBOL_EXPORT
+#else // DOCTEST_CONFIG_IMPLEMENT
+#define DOCTEST_INTERFACE DOCTEST_SYMBOL_IMPORT
+#endif // DOCTEST_CONFIG_IMPLEMENT
+#else // DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+#define DOCTEST_INTERFACE
+#endif // DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+
+#ifdef _MSC_VER
+#define DOCTEST_NOINLINE __declspec(noinline)
+#else // _MSC_VER
+#define DOCTEST_NOINLINE __attribute__((noinline))
+#endif // _MSC_VER
+
+#ifndef DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK
+#define DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK 5
+#endif // DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK
+
+// =================================================================================================
+// == FEATURE DETECTION END ========================================================================
+// =================================================================================================
+
+// internal macros for string concatenation and anonymous variable name generation
+#define DOCTEST_CAT_IMPL(s1, s2) s1##s2
+#define DOCTEST_CAT(s1, s2) DOCTEST_CAT_IMPL(s1, s2)
+#ifdef __COUNTER__ // not standard and may be missing for some compilers
+#define DOCTEST_ANONYMOUS(x) DOCTEST_CAT(x, __COUNTER__)
+#else // __COUNTER__
+#define DOCTEST_ANONYMOUS(x) DOCTEST_CAT(x, __LINE__)
+#endif // __COUNTER__
+
+// macro for making a string out of an identifier
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TOSTR_IMPL(...) #__VA_ARGS__
+#define DOCTEST_TOSTR(...) DOCTEST_TOSTR_IMPL(__VA_ARGS__)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TOSTR_IMPL(x) #x
+#define DOCTEST_TOSTR(x) DOCTEST_TOSTR_IMPL(x)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+// for concatenating literals and making the result a string
+#define DOCTEST_STR_CONCAT_TOSTR(s1, s2) DOCTEST_TOSTR(s1) DOCTEST_TOSTR(s2)
+
+// counts the number of elements in a C string
+#define DOCTEST_COUNTOF(x) (sizeof(x) / sizeof(x[0]))
+
+#ifndef DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+#define DOCTEST_REF_WRAP(x) x&
+#else // DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+#define DOCTEST_REF_WRAP(x) x
+#endif // DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+
+// not using __APPLE__ because... this is how Catch does it
+#if defined(__MAC_OS_X_VERSION_MIN_REQUIRED)
+#define DOCTEST_PLATFORM_MAC
+#elif defined(__IPHONE_OS_VERSION_MIN_REQUIRED)
+#define DOCTEST_PLATFORM_IPHONE
+#elif defined(_WIN32) || defined(_MSC_VER)
+#define DOCTEST_PLATFORM_WINDOWS
+#else
+#define DOCTEST_PLATFORM_LINUX
+#endif
+
+#if defined(__clang__)
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) \
+ _Pragma("clang diagnostic push") \
+ _Pragma("clang diagnostic ignored \"-Wglobal-constructors\"") static int var
+#define DOCTEST_GLOBAL_NO_WARNINGS_END() _Pragma("clang diagnostic pop")
+#elif defined(__GNUC__)
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) static int var __attribute__((unused))
+#define DOCTEST_GLOBAL_NO_WARNINGS_END()
+#else // MSVC / other
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) static int var
+#define DOCTEST_GLOBAL_NO_WARNINGS_END()
+#endif // MSVC / other
+
+// should probably take a look at https://github.com/scottt/debugbreak
+#ifdef DOCTEST_PLATFORM_MAC
+#define DOCTEST_BREAK_INTO_DEBUGGER() __asm__("int $3\n" : :)
+#elif defined(_MSC_VER)
+#define DOCTEST_BREAK_INTO_DEBUGGER() __debugbreak()
+#elif defined(__MINGW32__)
+extern "C" __declspec(dllimport) void __stdcall DebugBreak();
+#define DOCTEST_BREAK_INTO_DEBUGGER() ::DebugBreak()
+#else // linux
+#define DOCTEST_BREAK_INTO_DEBUGGER() ((void)0)
+#endif // linux
+
+#ifdef __clang__
+// to detect if libc++ is being used with clang (the _LIBCPP_VERSION identifier)
+#include <ciso646>
+#endif // __clang__
+
+#ifdef _LIBCPP_VERSION
+// not forward declaring ostream for libc++ because I had some problems (inline namespaces vs c++98)
+// so the <iosfwd> header is used - also it is very light and doesn't drag a ton of stuff
+#include <iosfwd>
+#else // _LIBCPP_VERSION
+#ifndef DOCTEST_CONFIG_USE_IOSFWD
+namespace std
+{
+ template <class charT>
+ struct char_traits;
+ template <>
+ struct char_traits<char>;
+ template <class charT, class traits>
+ class basic_ostream;
+ typedef basic_ostream<char, char_traits<char> > ostream;
+} // namespace std
+#else // DOCTEST_CONFIG_USE_IOSFWD
+#include <iosfwd>
+#endif // DOCTEST_CONFIG_USE_IOSFWD
+#endif // _LIBCPP_VERSION
+
+// static assert macro - because of the c++98 support requires that the message is an
+// identifier (no spaces and not a C string) - example without quotes: I_am_a_message
+// taken from here: http://stackoverflow.com/a/1980156/3162383
+#ifdef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_STATIC_ASSERT(expression, message) static_assert(expression, #message)
+#else // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_STATIC_ASSERT(expression, message) \
+ struct DOCTEST_CAT(__static_assertion_at_line_, __LINE__) \
+ { \
+ doctest::detail::static_assert_impl::StaticAssertion<static_cast<bool>((expression))> \
+ DOCTEST_CAT(DOCTEST_CAT(DOCTEST_CAT(STATIC_ASSERTION_FAILED_AT_LINE_, __LINE__), \
+ _), \
+ message); \
+ }; \
+ typedef doctest::detail::static_assert_impl::StaticAssertionTest<static_cast<int>( \
+ sizeof(DOCTEST_CAT(__static_assertion_at_line_, __LINE__)))> \
+ DOCTEST_CAT(__static_assertion_test_at_line_, __LINE__)
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+#ifdef _LIBCPP_VERSION
+#include <cstddef>
+#else // _LIBCPP_VERSION
+namespace std
+{
+ typedef decltype(nullptr) nullptr_t;
+}
+#endif // _LIBCPP_VERSION
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+#ifndef DOCTEST_CONFIG_DISABLE
+namespace doctest
+{
+ namespace detail
+ {
+ struct TestSuite
+ {
+ const char* m_test_suite;
+ const char* m_description;
+ bool m_skip;
+ bool m_may_fail;
+ bool m_should_fail;
+ int m_expected_failures;
+ double m_timeout;
+
+ TestSuite& operator*(const char* in) {
+ m_test_suite = in;
+ // clear state
+ m_description = 0;
+ m_skip = false;
+ m_may_fail = false;
+ m_should_fail = false;
+ m_expected_failures = 0;
+ m_timeout = 0;
+ return *this;
+ }
+
+ template <typename T>
+ TestSuite& operator*(const T& in) {
+ in.fill(*this);
+ return *this;
+ }
+ };
+ } // namespace detail
+} // namespace doctest
+
+ // in a separate namespace outside of doctest because the DOCTEST_TEST_SUITE macro
+ // introduces an anonymous namespace in which getCurrentTestSuite gets overridden
+namespace doctest_detail_test_suite_ns
+{
+ DOCTEST_INTERFACE doctest::detail::TestSuite& getCurrentTestSuite();
+} // namespace doctest_detail_test_suite_ns
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+namespace doctest
+{
+ // A 24 byte string class (can be as small as 17 for x64 and 13 for x86) that can hold strings with length
+ // of up to 23 chars on the stack before going on the heap - the last byte of the buffer is used for:
+ // - "is small" bit - the highest bit - if "0" then it is small - otherwise its "1" (128)
+ // - if small - capacity left before going on the heap - using the lowest 5 bits
+ // - if small - 2 bits are left unused - the second and third highest ones
+ // - if small - acts as a null terminator if strlen() is 23 (24 including the null terminator)
+ // and the "is small" bit remains "0" ("as well as the capacity left") so its OK
+ // Idea taken from this lecture about the string implementation of facebook/folly - fbstring
+ // https://www.youtube.com/watch?v=kPR8h4-qZdk
+ // TODO:
+ // - optimizations - like not deleting memory unnecessarily in operator= and etc.
+ // - resize/reserve/clear
+ // - substr
+ // - replace
+ // - back/front
+ // - iterator stuff
+ // - find & friends
+ // - push_back/pop_back
+ // - assign/insert/erase
+ // - relational operators as free functions - taking const char* as one of the params
+ class DOCTEST_INTERFACE String
+ {
+ static const unsigned len = 24; //!OCLINT avoid private static members
+ static const unsigned last = len - 1; //!OCLINT avoid private static members
+
+ struct view // len should be more than sizeof(view) - because of the final byte for flags
+ {
+ char* ptr;
+ unsigned size;
+ unsigned capacity;
+ };
+
+ union
+ {
+ char buf[len];
+ view data;
+ };
+
+ void copy(const String& other);
+
+ void setOnHeap() { *reinterpret_cast<unsigned char*>(&buf[last]) = 128; }
+ void setLast(unsigned in = last) { buf[last] = char(in); }
+
+ public:
+ String() {
+ buf[0] = '\0';
+ setLast();
+ }
+
+ String(const char* in);
+
+ String(const String& other) { copy(other); }
+
+ ~String() {
+ if (!isOnStack())
+ delete[] data.ptr;
+ }
+
+ // GCC 4.9/5/6 report Wstrict-overflow when optimizations are ON and it got inlined in the vector class somewhere...
+ // see commit 574ef95f0cd379118be5011704664e4b5351f1e0 and build https://travis-ci.org/onqtam/doctest/builds/230671611
+ DOCTEST_NOINLINE String& operator=(const String& other) {
+ if (!isOnStack())
+ delete[] data.ptr;
+
+ copy(other);
+
+ return *this;
+ }
+ String& operator+=(const String& other);
+
+ String operator+(const String& other) const { return String(*this) += other; }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ String(String&& other);
+ String& operator=(String&& other);
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+ bool isOnStack() const { return (buf[last] & 128) == 0; }
+
+ char operator[](unsigned i) const { return const_cast<String*>(this)->operator[](i); } // NOLINT
+ char& operator[](unsigned i) {
+ if (isOnStack())
+ return reinterpret_cast<char*>(buf)[i];
+ return data.ptr[i];
+ }
+
+ const char* c_str() const { return const_cast<String*>(this)->c_str(); } // NOLINT
+ char* c_str() {
+ if (isOnStack())
+ return reinterpret_cast<char*>(buf);
+ return data.ptr;
+ }
+
+ unsigned size() const {
+ if (isOnStack())
+ return last - (unsigned(buf[last]) & 31); // using "last" would work only if "len" is 32
+ return data.size;
+ }
+
+ unsigned capacity() const {
+ if (isOnStack())
+ return len;
+ return data.capacity;
+ }
+
+ int compare(const char* other, bool no_case = false) const;
+ int compare(const String& other, bool no_case = false) const;
+ };
+
+ // clang-format off
+ inline bool operator==(const String& lhs, const String& rhs) { return lhs.compare(rhs) == 0; }
+ inline bool operator!=(const String& lhs, const String& rhs) { return lhs.compare(rhs) != 0; }
+ inline bool operator< (const String& lhs, const String& rhs) { return lhs.compare(rhs) < 0; }
+ inline bool operator> (const String& lhs, const String& rhs) { return lhs.compare(rhs) > 0; }
+ inline bool operator<=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) < 0 : true; }
+ inline bool operator>=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) > 0 : true; }
+ // clang-format on
+
+ DOCTEST_INTERFACE std::ostream& operator<<(std::ostream& stream, const String& in);
+
+ namespace detail
+ {
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+ namespace static_assert_impl
+ {
+ template <bool>
+ struct StaticAssertion;
+
+ template <>
+ struct StaticAssertion<true>
+ {};
+
+ template <int i>
+ struct StaticAssertionTest
+ {};
+ } // namespace static_assert_impl
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+ namespace traits
+ {
+ template <typename T>
+ struct remove_const
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_const<const T>
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_volatile
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_volatile<volatile T>
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_cv
+ {
+ typedef typename remove_volatile<typename remove_const<T>::type>::type type;
+ };
+
+ template <typename T>
+ struct is_pointer_helper
+ {
+ static const bool value = false;
+ };
+
+ template <typename T>
+ struct is_pointer_helper<T*>
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = true;
+ };
+
+ template <typename T>
+ struct is_pointer
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = is_pointer_helper<typename remove_cv<T>::type>::value;
+ };
+
+ template <bool CONDITION, typename TYPE = void>
+ struct enable_if
+ {};
+
+ template <typename TYPE>
+ struct enable_if<true, TYPE>
+ {
+ typedef TYPE type;
+ };
+
+ template <typename T>
+ struct remove_reference
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_reference<T&>
+ {
+ typedef T type;
+ };
+
+ template <typename T, typename AT_1 = void>
+ class is_constructible_impl
+ {
+ private:
+ template <typename C_T, typename C_AT_1>
+ static bool test(typename enable_if< //!OCLINT avoid private static members
+ sizeof(C_T) ==
+ sizeof(C_T(static_cast<C_AT_1>(
+ *static_cast<typename remove_reference<C_AT_1>::type*>(
+ 0))))>::type*);
+
+ template <typename, typename>
+ static int test(...); //!OCLINT avoid private static members
+
+ public:
+ static const bool value = sizeof(test<T, AT_1>(0)) == sizeof(bool);
+ };
+
+ template <typename T>
+ class is_constructible_impl<T, void>
+ {
+ private:
+ template <typename C_T>
+ static C_T testFun(C_T); //!OCLINT avoid private static members
+
+ template <typename C_T>
+ static bool test(typename enable_if< //!OCLINT avoid private static members
+ sizeof(C_T) == sizeof(testFun(C_T()))>::type*);
+
+ template <typename>
+ static int test(...); //!OCLINT avoid private static members
+
+ public:
+ static const bool value = sizeof(test<T>(0)) == sizeof(bool);
+ };
+
+ // is_constructible<> taken from here: http://stackoverflow.com/a/40443701/3162383
+ // for GCC/Clang gives the same results as std::is_constructible<> - see here: https://wandbox.org/permlink/bNWr7Ii2fuz4Vf7A
+ // modifications:
+ // - reworked to support only 1 argument (mainly because of MSVC...)
+ // - removed pointer support
+ // MSVC support:
+ // - for versions before 2012 read the CAUTION comment below
+ // currently intended for use only in the Approx() helper for strong typedefs of double - see issue #62
+#ifndef _MSC_VER
+ template <typename T, typename AT_1 = void>
+ class is_constructible
+ {
+ public:
+ static const bool value = is_pointer<typename remove_reference<T>::type>::value ?
+ false :
+ is_constructible_impl<T, AT_1>::value;
+ };
+#elif defined(_MSC_VER) && (_MSC_VER >= 1700)
+ template <typename T, typename AT_1>
+ struct is_constructible
+ {
+ static const bool value = __is_constructible(T, AT_1);
+ };
+#elif defined(_MSC_VER)
+ // !!! USE WITH CAUTION !!!
+ // will always return false - unable to implement this for versions of MSVC older than 2012 for now...
+ template <typename T, typename AT_1>
+ struct is_constructible
+ {
+ static const bool value = false;
+ };
+#endif // _MSC_VER
+ } // namespace traits
+
+ template <typename T>
+ struct deferred_false
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = false;
+ };
+
+ // to silence the warning "-Wzero-as-null-pointer-constant" only for gcc 5 for the Approx template ctor - pragmas don't work for it...
+ inline void* getNull() { return 0; }
+
+ namespace has_insertion_operator_impl
+ {
+ typedef char no;
+ typedef char yes[2];
+
+ struct any_t
+ {
+ template <typename T>
+ // cppcheck-suppress noExplicitConstructor
+ any_t(const DOCTEST_REF_WRAP(T));
+ };
+
+ yes& testStreamable(std::ostream&);
+ no testStreamable(no);
+
+ no operator<<(const std::ostream&, const any_t&);
+
+ template <typename T>
+ struct has_insertion_operator
+ {
+ static std::ostream& s;
+ static const DOCTEST_REF_WRAP(T) t;
+ static const bool value = sizeof(testStreamable(s << t)) == sizeof(yes);
+ };
+ } // namespace has_insertion_operator_impl
+
+ template <typename T>
+ struct has_insertion_operator : has_insertion_operator_impl::has_insertion_operator<T>
+ {};
+
+ DOCTEST_INTERFACE void my_memcpy(void* dest, const void* src, unsigned num);
+ DOCTEST_INTERFACE unsigned my_strlen(const char* in);
+
+ DOCTEST_INTERFACE std::ostream* createStream();
+ DOCTEST_INTERFACE String getStreamResult(std::ostream*);
+ DOCTEST_INTERFACE void freeStream(std::ostream*);
+
+ template <bool C>
+ struct StringMakerBase
+ {
+ template <typename T>
+ static String convert(const DOCTEST_REF_WRAP(T)) {
+ return "{?}";
+ }
+ };
+
+ template <>
+ struct StringMakerBase<true>
+ {
+ template <typename T>
+ static String convert(const DOCTEST_REF_WRAP(T) in) {
+ std::ostream* stream = createStream();
+ *stream << in;
+ String result = getStreamResult(stream);
+ freeStream(stream);
+ return result;
+ }
+ };
+
+ DOCTEST_INTERFACE String rawMemoryToString(const void* object, unsigned size);
+
+ template <typename T>
+ String rawMemoryToString(const DOCTEST_REF_WRAP(T) object) {
+ return rawMemoryToString(&object, sizeof(object));
+ }
+
+ class NullType
+ {};
+
+ template <class T, class U>
+ struct Typelist
+ {
+ typedef T Head;
+ typedef U Tail;
+ };
+
+ // type of recursive function
+ template <class TList, class Callable>
+ struct ForEachType;
+
+ // Recursion rule
+ template <class Head, class Tail, class Callable>
+ struct ForEachType<Typelist<Head, Tail>, Callable> : public ForEachType<Tail, Callable>
+ {
+ enum
+ {
+ value = 1 + ForEachType<Tail, Callable>::value
+ };
+
+ explicit ForEachType(Callable& callable)
+ : ForEachType<Tail, Callable>(callable) {
+#if defined(_MSC_VER) && _MSC_VER <= 1900
+ callable.operator()<value, Head>();
+#else // _MSC_VER
+ callable.template operator()<value, Head>();
+#endif // _MSC_VER
+ }
+ };
+
+ // Recursion end
+ template <class Head, class Callable>
+ struct ForEachType<Typelist<Head, NullType>, Callable>
+ {
+ public:
+ enum
+ {
+ value = 0
+ };
+
+ explicit ForEachType(Callable& callable) {
+#if defined(_MSC_VER) && _MSC_VER <= 1900
+ callable.operator()<value, Head>();
+#else // _MSC_VER
+ callable.template operator()<value, Head>();
+#endif // _MSC_VER
+ }
+ };
+
+ template <typename T>
+ const char* type_to_string() {
+ return "<>";
+ }
+ } // namespace detail
+
+ template <typename T1 = detail::NullType, typename T2 = detail::NullType,
+ typename T3 = detail::NullType, typename T4 = detail::NullType,
+ typename T5 = detail::NullType, typename T6 = detail::NullType,
+ typename T7 = detail::NullType, typename T8 = detail::NullType,
+ typename T9 = detail::NullType, typename T10 = detail::NullType,
+ typename T11 = detail::NullType, typename T12 = detail::NullType,
+ typename T13 = detail::NullType, typename T14 = detail::NullType,
+ typename T15 = detail::NullType, typename T16 = detail::NullType,
+ typename T17 = detail::NullType, typename T18 = detail::NullType,
+ typename T19 = detail::NullType, typename T20 = detail::NullType,
+ typename T21 = detail::NullType, typename T22 = detail::NullType,
+ typename T23 = detail::NullType, typename T24 = detail::NullType,
+ typename T25 = detail::NullType, typename T26 = detail::NullType,
+ typename T27 = detail::NullType, typename T28 = detail::NullType,
+ typename T29 = detail::NullType, typename T30 = detail::NullType,
+ typename T31 = detail::NullType, typename T32 = detail::NullType,
+ typename T33 = detail::NullType, typename T34 = detail::NullType,
+ typename T35 = detail::NullType, typename T36 = detail::NullType,
+ typename T37 = detail::NullType, typename T38 = detail::NullType,
+ typename T39 = detail::NullType, typename T40 = detail::NullType,
+ typename T41 = detail::NullType, typename T42 = detail::NullType,
+ typename T43 = detail::NullType, typename T44 = detail::NullType,
+ typename T45 = detail::NullType, typename T46 = detail::NullType,
+ typename T47 = detail::NullType, typename T48 = detail::NullType,
+ typename T49 = detail::NullType, typename T50 = detail::NullType,
+ typename T51 = detail::NullType, typename T52 = detail::NullType,
+ typename T53 = detail::NullType, typename T54 = detail::NullType,
+ typename T55 = detail::NullType, typename T56 = detail::NullType,
+ typename T57 = detail::NullType, typename T58 = detail::NullType,
+ typename T59 = detail::NullType, typename T60 = detail::NullType>
+ struct Types
+ {
+ private:
+ typedef typename Types<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17,
+ T18, T19, T20, T21, T22, T23, T24, T25, T26, T27, T28, T29, T30, T31,
+ T32, T33, T34, T35, T36, T37, T38, T39, T40, T41, T42, T43, T44, T45,
+ T46, T47, T48, T49, T50, T51, T52, T53, T54, T55, T56, T57, T58, T59,
+ T60>::Result TailResult;
+
+ public:
+ typedef detail::Typelist<T1, TailResult> Result;
+ };
+
+ template <>
+ struct Types<>
+ {
+ typedef detail::NullType Result;
+ };
+
+ template <typename T>
+ struct StringMaker : detail::StringMakerBase<detail::has_insertion_operator<T>::value>
+ {};
+
+ template <typename T>
+ struct StringMaker<T*>
+ {
+ template <typename U>
+ static String convert(U* p) {
+ if (p)
+ return detail::rawMemoryToString(p);
+ return "NULL";
+ }
+ };
+
+ template <typename R, typename C>
+ struct StringMaker<R C::*>
+ {
+ static String convert(R C::*p) {
+ if (p)
+ return detail::rawMemoryToString(p);
+ return "NULL";
+ }
+ };
+
+ template <typename T>
+ String toString(const DOCTEST_REF_WRAP(T) value) {
+ return StringMaker<T>::convert(value);
+ }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE String toString(char* in);
+ DOCTEST_INTERFACE String toString(const char* in);
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE String toString(bool in);
+ DOCTEST_INTERFACE String toString(float in);
+ DOCTEST_INTERFACE String toString(double in);
+ DOCTEST_INTERFACE String toString(double long in);
+
+ DOCTEST_INTERFACE String toString(char in);
+ DOCTEST_INTERFACE String toString(char signed in);
+ DOCTEST_INTERFACE String toString(char unsigned in);
+ DOCTEST_INTERFACE String toString(int short in);
+ DOCTEST_INTERFACE String toString(int short unsigned in);
+ DOCTEST_INTERFACE String toString(int in);
+ DOCTEST_INTERFACE String toString(int unsigned in);
+ DOCTEST_INTERFACE String toString(int long in);
+ DOCTEST_INTERFACE String toString(int long unsigned in);
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_INTERFACE String toString(int long long in);
+ DOCTEST_INTERFACE String toString(int long long unsigned in);
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+ DOCTEST_INTERFACE String toString(std::nullptr_t in);
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+ class DOCTEST_INTERFACE Approx
+ {
+ public:
+ explicit Approx(double value);
+
+ Approx operator()(double value) const {
+ Approx approx(value);
+ approx.epsilon(m_epsilon);
+ approx.scale(m_scale);
+ return approx;
+ }
+
+ template <typename T>
+ explicit Approx(const T& value,
+ typename detail::traits::enable_if<
+ detail::traits::is_constructible<double, T>::value>::type* =
+ static_cast<T*>(detail::getNull())) {
+ *this = Approx(static_cast<double>(value));
+ }
+
+ // clang-format off
+ // overloads for double - the first one is necessary as it is in the implementation part of doctest
+ // as for the others - keeping them for potentially faster compile times
+ DOCTEST_INTERFACE friend bool operator==(double lhs, Approx const& rhs);
+ friend bool operator==(Approx const& lhs, double rhs) { return operator==(rhs, lhs); }
+ friend bool operator!=(double lhs, Approx const& rhs) { return !operator==(lhs, rhs); }
+ friend bool operator!=(Approx const& lhs, double rhs) { return !operator==(rhs, lhs); }
+ friend bool operator<=(double lhs, Approx const& rhs) { return lhs < rhs.m_value || lhs == rhs; }
+ friend bool operator<=(Approx const& lhs, double rhs) { return lhs.m_value < rhs || lhs == rhs; }
+ friend bool operator>=(double lhs, Approx const& rhs) { return lhs > rhs.m_value || lhs == rhs; }
+ friend bool operator>=(Approx const& lhs, double rhs) { return lhs.m_value > rhs || lhs == rhs; }
+ friend bool operator< (double lhs, Approx const& rhs) { return lhs < rhs.m_value && lhs != rhs; }
+ friend bool operator< (Approx const& lhs, double rhs) { return lhs.m_value < rhs && lhs != rhs; }
+ friend bool operator> (double lhs, Approx const& rhs) { return lhs > rhs.m_value && lhs != rhs; }
+ friend bool operator> (Approx const& lhs, double rhs) { return lhs.m_value > rhs && lhs != rhs; }
+
+#define DOCTEST_APPROX_PREFIX \
+ template <typename T> friend typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value, bool>::type
+
+ DOCTEST_APPROX_PREFIX operator==(const T& lhs, const Approx& rhs) { return operator==(double(lhs), rhs); }
+ DOCTEST_APPROX_PREFIX operator==(const Approx& lhs, const T& rhs) { return operator==(rhs, lhs); }
+ DOCTEST_APPROX_PREFIX operator!=(const T& lhs, const Approx& rhs) { return !operator==(lhs, rhs); }
+ DOCTEST_APPROX_PREFIX operator!=(const Approx& lhs, const T& rhs) { return !operator==(rhs, lhs); }
+ DOCTEST_APPROX_PREFIX operator<=(const T& lhs, const Approx& rhs) { return double(lhs) < rhs.m_value || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator<=(const Approx& lhs, const T& rhs) { return lhs.m_value < double(rhs) || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator>=(const T& lhs, const Approx& rhs) { return double(lhs) > rhs.m_value || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator>=(const Approx& lhs, const T& rhs) { return lhs.m_value > double(rhs) || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator< (const T& lhs, const Approx& rhs) { return double(lhs) < rhs.m_value && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator< (const Approx& lhs, const T& rhs) { return lhs.m_value < double(rhs) && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator> (const T& lhs, const Approx& rhs) { return double(lhs) > rhs.m_value && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator> (const Approx& lhs, const T& rhs) { return lhs.m_value > double(rhs) && lhs != rhs; }
+#undef DOCTEST_APPROX_PREFIX
+ // clang-format on
+
+ Approx& epsilon(double newEpsilon) {
+ m_epsilon = (newEpsilon);
+ return *this;
+ }
+
+ template <typename T>
+ typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value,
+ Approx&>::type
+ epsilon(const T& newEpsilon) {
+ m_epsilon = static_cast<double>(newEpsilon);
+ return *this;
+ }
+
+ Approx& scale(double newScale) {
+ m_scale = (newScale);
+ return *this;
+ }
+
+ template <typename T>
+ typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value,
+ Approx&>::type
+ scale(const T& newScale) {
+ m_scale = static_cast<double>(newScale);
+ return *this;
+ }
+
+ String toString() const;
+
+ private:
+ double m_epsilon;
+ double m_scale;
+ double m_value;
+ };
+
+ template <>
+ inline String toString<Approx>(const DOCTEST_REF_WRAP(Approx) value) {
+ return value.toString();
+ }
+
+#if !defined(DOCTEST_CONFIG_DISABLE)
+
+ namespace detail
+ {
+ // the function type this library works with
+ typedef void(*funcType)();
+
+ namespace assertType
+ {
+ enum Enum
+ {
+ // macro traits
+
+ is_warn = 1,
+ is_check = 2,
+ is_require = 4,
+
+ is_throws = 8,
+ is_throws_as = 16,
+ is_nothrow = 32,
+
+ is_fast = 64, // not checked anywhere - used just to distinguish the types
+ is_false = 128,
+ is_unary = 256,
+
+ is_eq = 512,
+ is_ne = 1024,
+
+ is_lt = 2048,
+ is_gt = 4096,
+
+ is_ge = 8192,
+ is_le = 16384,
+
+ // macro types
+
+ DT_WARN = is_warn,
+ DT_CHECK = is_check,
+ DT_REQUIRE = is_require,
+
+ DT_WARN_FALSE = is_false | is_warn,
+ DT_CHECK_FALSE = is_false | is_check,
+ DT_REQUIRE_FALSE = is_false | is_require,
+
+ DT_WARN_THROWS = is_throws | is_warn,
+ DT_CHECK_THROWS = is_throws | is_check,
+ DT_REQUIRE_THROWS = is_throws | is_require,
+
+ DT_WARN_THROWS_AS = is_throws_as | is_warn,
+ DT_CHECK_THROWS_AS = is_throws_as | is_check,
+ DT_REQUIRE_THROWS_AS = is_throws_as | is_require,
+
+ DT_WARN_NOTHROW = is_nothrow | is_warn,
+ DT_CHECK_NOTHROW = is_nothrow | is_check,
+ DT_REQUIRE_NOTHROW = is_nothrow | is_require,
+
+ DT_WARN_EQ = is_eq | is_warn,
+ DT_CHECK_EQ = is_eq | is_check,
+ DT_REQUIRE_EQ = is_eq | is_require,
+
+ DT_WARN_NE = is_ne | is_warn,
+ DT_CHECK_NE = is_ne | is_check,
+ DT_REQUIRE_NE = is_ne | is_require,
+
+ DT_WARN_GT = is_gt | is_warn,
+ DT_CHECK_GT = is_gt | is_check,
+ DT_REQUIRE_GT = is_gt | is_require,
+
+ DT_WARN_LT = is_lt | is_warn,
+ DT_CHECK_LT = is_lt | is_check,
+ DT_REQUIRE_LT = is_lt | is_require,
+
+ DT_WARN_GE = is_ge | is_warn,
+ DT_CHECK_GE = is_ge | is_check,
+ DT_REQUIRE_GE = is_ge | is_require,
+
+ DT_WARN_LE = is_le | is_warn,
+ DT_CHECK_LE = is_le | is_check,
+ DT_REQUIRE_LE = is_le | is_require,
+
+ DT_WARN_UNARY = is_unary | is_warn,
+ DT_CHECK_UNARY = is_unary | is_check,
+ DT_REQUIRE_UNARY = is_unary | is_require,
+
+ DT_WARN_UNARY_FALSE = is_false | is_unary | is_warn,
+ DT_CHECK_UNARY_FALSE = is_false | is_unary | is_check,
+ DT_REQUIRE_UNARY_FALSE = is_false | is_unary | is_require,
+
+ DT_FAST_WARN_EQ = is_fast | is_eq | is_warn,
+ DT_FAST_CHECK_EQ = is_fast | is_eq | is_check,
+ DT_FAST_REQUIRE_EQ = is_fast | is_eq | is_require,
+
+ DT_FAST_WARN_NE = is_fast | is_ne | is_warn,
+ DT_FAST_CHECK_NE = is_fast | is_ne | is_check,
+ DT_FAST_REQUIRE_NE = is_fast | is_ne | is_require,
+
+ DT_FAST_WARN_GT = is_fast | is_gt | is_warn,
+ DT_FAST_CHECK_GT = is_fast | is_gt | is_check,
+ DT_FAST_REQUIRE_GT = is_fast | is_gt | is_require,
+
+ DT_FAST_WARN_LT = is_fast | is_lt | is_warn,
+ DT_FAST_CHECK_LT = is_fast | is_lt | is_check,
+ DT_FAST_REQUIRE_LT = is_fast | is_lt | is_require,
+
+ DT_FAST_WARN_GE = is_fast | is_ge | is_warn,
+ DT_FAST_CHECK_GE = is_fast | is_ge | is_check,
+ DT_FAST_REQUIRE_GE = is_fast | is_ge | is_require,
+
+ DT_FAST_WARN_LE = is_fast | is_le | is_warn,
+ DT_FAST_CHECK_LE = is_fast | is_le | is_check,
+ DT_FAST_REQUIRE_LE = is_fast | is_le | is_require,
+
+ DT_FAST_WARN_UNARY = is_fast | is_unary | is_warn,
+ DT_FAST_CHECK_UNARY = is_fast | is_unary | is_check,
+ DT_FAST_REQUIRE_UNARY = is_fast | is_unary | is_require,
+
+ DT_FAST_WARN_UNARY_FALSE = is_fast | is_false | is_unary | is_warn,
+ DT_FAST_CHECK_UNARY_FALSE = is_fast | is_false | is_unary | is_check,
+ DT_FAST_REQUIRE_UNARY_FALSE = is_fast | is_false | is_unary | is_require
+ };
+ } // namespace assertType
+
+ DOCTEST_INTERFACE const char* getAssertString(assertType::Enum val);
+
+ // clang-format off
+ template<class T> struct decay_array { typedef T type; };
+ template<class T, unsigned N> struct decay_array<T[N]> { typedef T* type; };
+ template<class T> struct decay_array<T[]> { typedef T* type; };
+
+ template<class T> struct not_char_pointer { enum { value = 1 }; };
+ template<> struct not_char_pointer<char*> { enum { value = 0 }; };
+ template<> struct not_char_pointer<const char*> { enum { value = 0 }; };
+
+ template<class T> struct can_use_op : not_char_pointer<typename decay_array<T>::type> {};
+ // clang-format on
+
+ struct TestFailureException
+ {};
+
+ DOCTEST_INTERFACE bool checkIfShouldThrow(assertType::Enum assert_type);
+ DOCTEST_INTERFACE void fastAssertThrowIfFlagSet(int flags);
+ DOCTEST_INTERFACE void throwException();
+
+ struct TestAccessibleContextState
+ {
+ bool no_throw; // to skip exceptions-related assertion macros
+ bool success; // include successful assertions in output
+ };
+
+ struct ContextState;
+
+ DOCTEST_INTERFACE TestAccessibleContextState* getTestsContextState();
+
+ struct DOCTEST_INTERFACE SubcaseSignature
+ {
+ const char* m_name;
+ const char* m_file;
+ int m_line;
+
+ SubcaseSignature(const char* name, const char* file, int line)
+ : m_name(name)
+ , m_file(file)
+ , m_line(line) {}
+
+ bool operator<(const SubcaseSignature& other) const;
+ };
+
+ // cppcheck-suppress copyCtorAndEqOperator
+ struct DOCTEST_INTERFACE Subcase
+ {
+ SubcaseSignature m_signature;
+ bool m_entered;
+
+ Subcase(const char* name, const char* file, int line);
+ Subcase(const Subcase& other);
+ ~Subcase();
+
+ operator bool() const { return m_entered; }
+ };
+
+ template <typename L, typename R>
+ String stringifyBinaryExpr(const DOCTEST_REF_WRAP(L) lhs, const char* op,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ return toString(lhs) + op + toString(rhs);
+ }
+
+ struct DOCTEST_INTERFACE Result
+ {
+ bool m_passed;
+ String m_decomposition;
+
+ ~Result();
+
+ DOCTEST_NOINLINE Result(bool passed = false, const String& decomposition = String())
+ : m_passed(passed)
+ , m_decomposition(decomposition) {}
+
+ DOCTEST_NOINLINE Result(const Result& other)
+ : m_passed(other.m_passed)
+ , m_decomposition(other.m_decomposition) {}
+
+ Result& operator=(const Result& other);
+
+ operator bool() { return !m_passed; }
+
+ // clang-format off
+ // forbidding some expressions based on this table: http://en.cppreference.com/w/cpp/language/operator_precedence
+ template <typename R> Result& operator& (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator^ (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator| (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator&& (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator|| (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator== (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator!= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator< (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator> (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator<= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator>= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator+= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator-= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator*= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator/= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator%= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator<<=(const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator>>=(const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator&= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator^= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator|= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ // clang-format on
+ };
+
+#ifndef DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wsign-conversion"
+#pragma clang diagnostic ignored "-Wsign-compare"
+ //#pragma clang diagnostic ignored "-Wdouble-promotion"
+ //#pragma clang diagnostic ignored "-Wconversion"
+ //#pragma clang diagnostic ignored "-Wfloat-equal"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+#pragma GCC diagnostic ignored "-Wsign-compare"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 5)
+ //#pragma GCC diagnostic ignored "-Wdouble-promotion"
+#endif // > gcc 4.5
+ //#pragma GCC diagnostic ignored "-Wconversion"
+ //#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+ // http://stackoverflow.com/questions/39479163 what's the difference between C4018 and C4389
+#pragma warning(disable : 4389) // 'operator' : signed/unsigned mismatch
+#pragma warning(disable : 4018) // 'expression' : signed/unsigned mismatch
+ //#pragma warning(disable : 4805) // 'operation' : unsafe mix of type 'type' and type 'type' in operation
+#endif // _MSC_VER
+
+#endif // DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+ // clang-format off
+#ifndef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_COMPARISON_RETURN_TYPE bool
+#else // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_COMPARISON_RETURN_TYPE typename traits::enable_if<can_use_op<L>::value || can_use_op<R>::value, bool>::type
+ inline bool eq(const char* lhs, const char* rhs) { return String(lhs) == String(rhs); }
+ inline bool ne(const char* lhs, const char* rhs) { return String(lhs) != String(rhs); }
+ inline bool lt(const char* lhs, const char* rhs) { return String(lhs) < String(rhs); }
+ inline bool gt(const char* lhs, const char* rhs) { return String(lhs) > String(rhs); }
+ inline bool le(const char* lhs, const char* rhs) { return String(lhs) <= String(rhs); }
+ inline bool ge(const char* lhs, const char* rhs) { return String(lhs) >= String(rhs); }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE eq(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs == rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE ne(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs != rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE lt(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs < rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE gt(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs > rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE le(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs <= rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE ge(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs >= rhs; }
+ // clang-format on
+
+#ifndef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_CMP_EQ(l, r) l == r
+#define DOCTEST_CMP_NE(l, r) l != r
+#define DOCTEST_CMP_GT(l, r) l > r
+#define DOCTEST_CMP_LT(l, r) l < r
+#define DOCTEST_CMP_GE(l, r) l >= r
+#define DOCTEST_CMP_LE(l, r) l <= r
+#else // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_CMP_EQ(l, r) eq(l, r)
+#define DOCTEST_CMP_NE(l, r) ne(l, r)
+#define DOCTEST_CMP_GT(l, r) gt(l, r)
+#define DOCTEST_CMP_LT(l, r) lt(l, r)
+#define DOCTEST_CMP_GE(l, r) ge(l, r)
+#define DOCTEST_CMP_LE(l, r) le(l, r)
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+
+#define DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(op, op_str, op_macro) \
+ template <typename R> \
+ DOCTEST_NOINLINE Result operator op(const DOCTEST_REF_WRAP(R) rhs) { \
+ bool res = op_macro(lhs, rhs); \
+ if(m_assert_type & assertType::is_false) \
+ res = !res; \
+ if(!res || doctest::detail::getTestsContextState()->success) \
+ return Result(res, stringifyBinaryExpr(lhs, op_str, rhs)); \
+ return Result(res); \
+ }
+
+#define DOCTEST_FORBIT_EXPRESSION(op) \
+ template <typename R> \
+ Expression_lhs& operator op(const R&) { \
+ DOCTEST_STATIC_ASSERT(deferred_false<R>::value, \
+ Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); \
+ return *this; \
+ }
+
+ template <typename L>
+ // cppcheck-suppress copyCtorAndEqOperator
+ struct Expression_lhs
+ {
+ L lhs;
+ assertType::Enum m_assert_type;
+
+ explicit Expression_lhs(L in, assertType::Enum assert_type)
+ : lhs(in)
+ , m_assert_type(assert_type) {}
+
+ Expression_lhs(const Expression_lhs& other)
+ : lhs(other.lhs) {}
+
+ DOCTEST_NOINLINE operator Result() {
+ bool res = !!lhs;
+ if (m_assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ res = !res;
+
+ if (!res || getTestsContextState()->success)
+ return Result(res, toString(lhs));
+ return Result(res);
+ }
+
+ // clang-format off
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(== , " == ", DOCTEST_CMP_EQ) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(!= , " != ", DOCTEST_CMP_NE) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(>, " > ", DOCTEST_CMP_GT) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(<, " < ", DOCTEST_CMP_LT) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(>= , " >= ", DOCTEST_CMP_GE) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(<= , " <= ", DOCTEST_CMP_LE) //!OCLINT bitwise operator in conditional
+ // clang-format on
+
+ // forbidding some expressions based on this table: http://en.cppreference.com/w/cpp/language/operator_precedence
+ DOCTEST_FORBIT_EXPRESSION(&)
+ DOCTEST_FORBIT_EXPRESSION(^)
+ DOCTEST_FORBIT_EXPRESSION(| )
+ DOCTEST_FORBIT_EXPRESSION(&&)
+ DOCTEST_FORBIT_EXPRESSION(|| )
+ DOCTEST_FORBIT_EXPRESSION(= )
+ DOCTEST_FORBIT_EXPRESSION(+= )
+ DOCTEST_FORBIT_EXPRESSION(-= )
+ DOCTEST_FORBIT_EXPRESSION(*= )
+ DOCTEST_FORBIT_EXPRESSION(/= )
+ DOCTEST_FORBIT_EXPRESSION(%= )
+ DOCTEST_FORBIT_EXPRESSION(<<= )
+ DOCTEST_FORBIT_EXPRESSION(>>= )
+ DOCTEST_FORBIT_EXPRESSION(&= )
+ DOCTEST_FORBIT_EXPRESSION(^= )
+ DOCTEST_FORBIT_EXPRESSION(|= )
+ // these 2 are unfortunate because they should be allowed - they have higher precedence over the comparisons, but the
+ // ExpressionDecomposer class uses the left shift operator to capture the left operand of the binary expression...
+ DOCTEST_FORBIT_EXPRESSION(<< )
+ DOCTEST_FORBIT_EXPRESSION(>> )
+ };
+
+#ifndef DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
+
+#endif // DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+ struct ExpressionDecomposer
+ {
+ assertType::Enum m_assert_type;
+
+ ExpressionDecomposer(assertType::Enum assert_type)
+ : m_assert_type(assert_type) {}
+
+ // The right operator for capturing expressions is "<=" instead of "<<" (based on the operator precedence table)
+ // but then there will be warnings from GCC about "-Wparentheses" and since "_Pragma()" is problematic this will stay for now...
+ // https://github.com/philsquared/Catch/issues/870
+ // https://github.com/philsquared/Catch/issues/565
+ template <typename L>
+ Expression_lhs<const DOCTEST_REF_WRAP(L)> operator<<(const DOCTEST_REF_WRAP(L) operand) {
+ return Expression_lhs<const DOCTEST_REF_WRAP(L)>(operand, m_assert_type);
+ }
+ };
+
+ struct DOCTEST_INTERFACE TestCase
+ {
+ // not used for determining uniqueness
+ funcType m_test; // a function pointer to the test case
+ String m_full_name; // contains the name (only for templated test cases!) + the template type
+ const char* m_name; // name of the test case
+ const char* m_type; // for templated test cases - gets appended to the real name
+ const char* m_test_suite; // the test suite in which the test was added
+ const char* m_description;
+ bool m_skip;
+ bool m_may_fail;
+ bool m_should_fail;
+ int m_expected_failures;
+ double m_timeout;
+
+ // fields by which uniqueness of test cases shall be determined
+ const char* m_file; // the file in which the test was registered
+ unsigned m_line; // the line where the test was registered
+ int m_template_id; // an ID used to distinguish between the different versions of a templated test case
+
+ TestCase(funcType test, const char* file, unsigned line, const TestSuite& test_suite,
+ const char* type = "", int template_id = -1);
+
+ // for gcc 4.7
+ DOCTEST_NOINLINE ~TestCase() {}
+
+ TestCase& operator*(const char* in);
+
+ template <typename T>
+ TestCase& operator*(const T& in) {
+ in.fill(*this);
+ return *this;
+ }
+
+ TestCase(const TestCase& other) { *this = other; }
+
+ TestCase& operator=(const TestCase& other);
+
+ bool operator<(const TestCase& other) const;
+ };
+
+ // forward declarations of functions used by the macros
+ DOCTEST_INTERFACE int regTest(const TestCase& tc);
+ DOCTEST_INTERFACE int setTestSuite(const TestSuite& ts);
+
+ DOCTEST_INTERFACE void addFailedAssert(assertType::Enum assert_type);
+
+ DOCTEST_INTERFACE void logTestStart(const TestCase& tc);
+ DOCTEST_INTERFACE void logTestEnd();
+
+ DOCTEST_INTERFACE void logTestException(const String& what, bool crash = false);
+
+ DOCTEST_INTERFACE void logAssert(bool passed, const char* decomposition, bool threw,
+ const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file, int line);
+
+ DOCTEST_INTERFACE void logAssertThrows(bool threw, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE void logAssertThrowsAs(bool threw, bool threw_as, const char* as,
+ const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE void logAssertNothrow(bool threw, const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE bool isDebuggerActive();
+ DOCTEST_INTERFACE void writeToDebugConsole(const String&);
+
+ namespace binaryAssertComparison
+ {
+ enum Enum
+ {
+ eq = 0,
+ ne,
+ gt,
+ lt,
+ ge,
+ le
+ };
+ } // namespace binaryAssertComparison
+
+ // clang-format off
+ template <int, class L, class R> struct RelationalComparator { bool operator()(const DOCTEST_REF_WRAP(L), const DOCTEST_REF_WRAP(R)) const { return false; } };
+ template <class L, class R> struct RelationalComparator<0, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return eq(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<1, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return ne(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<2, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return gt(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<3, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return lt(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<4, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return ge(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<5, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return le(lhs, rhs); } };
+ // clang-format on
+
+ struct DOCTEST_INTERFACE ResultBuilder
+ {
+ assertType::Enum m_assert_type;
+ const char* m_file;
+ int m_line;
+ const char* m_expr;
+ const char* m_exception_type;
+
+ Result m_result;
+ bool m_threw;
+ bool m_threw_as;
+ bool m_failed;
+ String m_exception;
+
+ ResultBuilder(assertType::Enum assert_type, const char* file, int line, const char* expr,
+ const char* exception_type = "");
+
+ ~ResultBuilder();
+
+ void setResult(const Result& res) { m_result = res; }
+
+ template <int comparison, typename L, typename R>
+ DOCTEST_NOINLINE void binary_assert(const DOCTEST_REF_WRAP(L) lhs,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ m_result.m_passed = RelationalComparator<comparison, L, R>()(lhs, rhs);
+ if (!m_result.m_passed || getTestsContextState()->success)
+ m_result.m_decomposition = stringifyBinaryExpr(lhs, ", ", rhs);
+ }
+
+ template <typename L>
+ DOCTEST_NOINLINE void unary_assert(const DOCTEST_REF_WRAP(L) val) {
+ m_result.m_passed = !!val;
+
+ if (m_assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ m_result.m_passed = !m_result.m_passed;
+
+ if (!m_result.m_passed || getTestsContextState()->success)
+ m_result.m_decomposition = toString(val);
+ }
+
+ void unexpectedExceptionOccurred();
+
+ bool log();
+ void react() const;
+ };
+
+ namespace assertAction
+ {
+ enum Enum
+ {
+ nothing = 0,
+ dbgbreak = 1,
+ shouldthrow = 2
+ };
+ } // namespace assertAction
+
+ template <int comparison, typename L, typename R>
+ DOCTEST_NOINLINE int fast_binary_assert(assertType::Enum assert_type, const char* file,
+ int line, const char* expr,
+ const DOCTEST_REF_WRAP(L) lhs,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ ResultBuilder rb(assert_type, file, line, expr);
+
+ rb.m_result.m_passed = RelationalComparator<comparison, L, R>()(lhs, rhs);
+
+ if (!rb.m_result.m_passed || getTestsContextState()->success)
+ rb.m_result.m_decomposition = stringifyBinaryExpr(lhs, ", ", rhs);
+
+ int res = 0;
+
+ if (rb.log())
+ res |= assertAction::dbgbreak;
+
+ if (rb.m_failed && checkIfShouldThrow(assert_type))
+ res |= assertAction::shouldthrow;
+
+#ifdef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+ // #########################################################################################
+ // IF THE DEBUGGER BREAKS HERE - GO 1 LEVEL UP IN THE CALLSTACK TO SEE THE FAILING ASSERTION
+ // THIS IS THE EFFECT OF HAVING 'DOCTEST_CONFIG_SUPER_FAST_ASSERTS' DEFINED
+ // #########################################################################################
+ if (res & assertAction::dbgbreak)
+ DOCTEST_BREAK_INTO_DEBUGGER();
+ fastAssertThrowIfFlagSet(res);
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ return res;
+ }
+
+ template <typename L>
+ DOCTEST_NOINLINE int fast_unary_assert(assertType::Enum assert_type, const char* file, int line,
+ const char* val_str, const DOCTEST_REF_WRAP(L) val) {
+ ResultBuilder rb(assert_type, file, line, val_str);
+
+ rb.m_result.m_passed = !!val;
+
+ if (assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ rb.m_result.m_passed = !rb.m_result.m_passed;
+
+ if (!rb.m_result.m_passed || getTestsContextState()->success)
+ rb.m_result.m_decomposition = toString(val);
+
+ int res = 0;
+
+ if (rb.log())
+ res |= assertAction::dbgbreak;
+
+ if (rb.m_failed && checkIfShouldThrow(assert_type))
+ res |= assertAction::shouldthrow;
+
+#ifdef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+ // #########################################################################################
+ // IF THE DEBUGGER BREAKS HERE - GO 1 LEVEL UP IN THE CALLSTACK TO SEE THE FAILING ASSERTION
+ // THIS IS THE EFFECT OF HAVING 'DOCTEST_CONFIG_SUPER_FAST_ASSERTS' DEFINED
+ // #########################################################################################
+ if (res & assertAction::dbgbreak)
+ DOCTEST_BREAK_INTO_DEBUGGER();
+ fastAssertThrowIfFlagSet(res);
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ return res;
+ }
+
+ struct DOCTEST_INTERFACE IExceptionTranslator //!OCLINT destructor of virtual class
+ {
+ virtual ~IExceptionTranslator();
+ virtual bool translate(String&) const = 0;
+ };
+
+ template <typename T>
+ class ExceptionTranslator : public IExceptionTranslator //!OCLINT destructor of virtual class
+ {
+ public:
+ explicit ExceptionTranslator(String(*translateFunction)(T))
+ : m_translateFunction(translateFunction) {}
+
+ bool translate(String& res) const {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ try {
+ throw;
+ // cppcheck-suppress catchExceptionByValue
+ }
+ catch (T ex) { // NOLINT
+ res = m_translateFunction(ex); //!OCLINT parameter reassignment
+ return true;
+ }
+ catch (...) {} //!OCLINT - empty catch statement
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ ((void)res); // to silence -Wunused-parameter
+ return false;
+ }
+
+ protected:
+ String(*m_translateFunction)(T);
+ };
+
+ DOCTEST_INTERFACE void registerExceptionTranslatorImpl(
+ const IExceptionTranslator* translateFunction);
+
+ // FIX FOR VISUAL STUDIO VERSIONS PRIOR TO 2015 - they failed to compile the call to operator<< with
+ // std::ostream passed as a reference noting that there is a use of an undefined type (which there isn't)
+ DOCTEST_INTERFACE void writeStringToStream(std::ostream* stream, const String& str);
+
+ template <bool C>
+ struct StringStreamBase
+ {
+ template <typename T>
+ static void convert(std::ostream* stream, const T& in) {
+ writeStringToStream(stream, toString(in));
+ }
+
+ // always treat char* as a string in this context - no matter
+ // if DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING is defined
+ static void convert(std::ostream* stream, const char* in) {
+ writeStringToStream(stream, String(in));
+ }
+ };
+
+ template <>
+ struct StringStreamBase<true>
+ {
+ template <typename T>
+ static void convert(std::ostream* stream, const T& in) {
+ *stream << in;
+ }
+ };
+
+ template <typename T>
+ struct StringStream : StringStreamBase<has_insertion_operator<T>::value>
+ {};
+
+ template <typename T>
+ void toStream(std::ostream* stream, const T& value) {
+ StringStream<T>::convert(stream, value);
+ }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char* in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, const char* in);
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, bool in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, float in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, double in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, double long in);
+
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char signed in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int short in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int short unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long unsigned in);
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long long in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long long unsigned in);
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+ struct IContextScope //!OCLINT destructor of virtual class
+ {
+ virtual void build(std::ostream*) = 0;
+ };
+
+ DOCTEST_INTERFACE void addToContexts(IContextScope* ptr);
+ DOCTEST_INTERFACE void popFromContexts();
+ DOCTEST_INTERFACE void useContextIfExceptionOccurred(IContextScope* ptr);
+
+ // cppcheck-suppress copyCtorAndEqOperator
+ class ContextBuilder
+ {
+ friend class ContextScope;
+
+ struct ICapture //!OCLINT destructor of virtual class
+ {
+ virtual void toStream(std::ostream*) const = 0;
+ };
+
+ template <typename T>
+ struct Capture : ICapture //!OCLINT destructor of virtual class
+ {
+ const T* capture;
+
+ explicit Capture(const T* in)
+ : capture(in) {}
+ virtual void toStream(std::ostream* stream) const { // override
+ doctest::detail::toStream(stream, *capture);
+ }
+ };
+
+ struct Chunk
+ {
+ char buf[sizeof(Capture<char>)]; // place to construct a Capture<T>
+ };
+
+ struct Node
+ {
+ Chunk chunk;
+ Node* next;
+ };
+
+ Chunk stackChunks[DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK];
+ int numCaptures;
+ Node* head;
+ Node* tail;
+
+ void build(std::ostream* stream) const {
+ int curr = 0;
+ // iterate over small buffer
+ while (curr < numCaptures && curr < DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK)
+ reinterpret_cast<const ICapture*>(stackChunks[curr++].buf)->toStream(stream);
+ // iterate over list
+ Node* curr_elem = head;
+ while (curr < numCaptures) {
+ reinterpret_cast<const ICapture*>(curr_elem->chunk.buf)->toStream(stream);
+ curr_elem = curr_elem->next;
+ ++curr;
+ }
+ }
+
+ // steal the contents of the other - acting as a move constructor...
+ DOCTEST_NOINLINE ContextBuilder(ContextBuilder& other)
+ : numCaptures(other.numCaptures)
+ , head(other.head)
+ , tail(other.tail) {
+ other.numCaptures = 0;
+ other.head = 0;
+ other.tail = 0;
+ my_memcpy(stackChunks, other.stackChunks,
+ unsigned(int(sizeof(Chunk)) * DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK));
+ }
+
+ public:
+ // cppcheck-suppress uninitMemberVar
+ DOCTEST_NOINLINE ContextBuilder() // NOLINT
+ : numCaptures(0)
+ , head(0)
+ , tail(0) {}
+
+ template <typename T>
+ DOCTEST_NOINLINE ContextBuilder& operator<<(T& in) {
+ Capture<T> temp(&in);
+
+ // construct either on stack or on heap
+ // copy the bytes for the whole object - including the vtable because we cant construct
+ // the object directly in the buffer using placement new - need the <new> header...
+ if (numCaptures < DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK) {
+ my_memcpy(stackChunks[numCaptures].buf, &temp, sizeof(Chunk));
+ }
+ else {
+ Node* curr = new Node;
+ curr->next = 0;
+ if (tail) {
+ tail->next = curr;
+ tail = curr;
+ }
+ else {
+ head = tail = curr;
+ }
+
+ my_memcpy(tail->chunk.buf, &temp, sizeof(Chunk));
+ }
+ ++numCaptures;
+ return *this;
+ }
+
+ DOCTEST_NOINLINE ~ContextBuilder() {
+ // free the linked list - the ones on the stack are left as-is
+ // no destructors are called at all - there is no need
+ while (head) {
+ Node* next = head->next;
+ delete head;
+ head = next;
+ }
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ template <typename T>
+ ContextBuilder& operator<<(const T&&) {
+ DOCTEST_STATIC_ASSERT(
+ deferred_false<T>::value,
+ Cannot_pass_temporaries_or_rvalues_to_the_streaming_operator_because_it_caches_pointers_to_the_passed_objects_for_lazy_evaluation);
+ return *this;
+ }
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ };
+
+ class ContextScope : public IContextScope //!OCLINT destructor of virtual class
+ {
+ ContextBuilder contextBuilder;
+ bool built;
+
+ public:
+ DOCTEST_NOINLINE explicit ContextScope(ContextBuilder& temp)
+ : contextBuilder(temp)
+ , built(false) {
+ addToContexts(this);
+ }
+
+ DOCTEST_NOINLINE ~ContextScope() {
+ if (!built)
+ useContextIfExceptionOccurred(this);
+ popFromContexts();
+ }
+
+ void build(std::ostream* stream) {
+ built = true;
+ contextBuilder.build(stream);
+ }
+ };
+
+ class DOCTEST_INTERFACE MessageBuilder
+ {
+ std::ostream* m_stream;
+ const char* m_file;
+ int m_line;
+ doctest::detail::assertType::Enum m_severity;
+
+ public:
+ MessageBuilder(const char* file, int line, doctest::detail::assertType::Enum severity);
+ ~MessageBuilder();
+
+ template <typename T>
+ MessageBuilder& operator<<(const T& in) {
+ doctest::detail::toStream(m_stream, in);
+ return *this;
+ }
+
+ bool log();
+ void react();
+ };
+ } // namespace detail
+
+ struct test_suite
+ {
+ const char* data;
+ test_suite(const char* in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_test_suite = data; }
+ void fill(detail::TestSuite& state) const { state.m_test_suite = data; }
+ };
+
+ struct description
+ {
+ const char* data;
+ description(const char* in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_description = data; }
+ void fill(detail::TestSuite& state) const { state.m_description = data; }
+ };
+
+ struct skip
+ {
+ bool data;
+ skip(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_skip = data; }
+ void fill(detail::TestSuite& state) const { state.m_skip = data; }
+ };
+
+ struct timeout
+ {
+ double data;
+ timeout(double in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_timeout = data; }
+ void fill(detail::TestSuite& state) const { state.m_timeout = data; }
+ };
+
+ struct may_fail
+ {
+ bool data;
+ may_fail(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_may_fail = data; }
+ void fill(detail::TestSuite& state) const { state.m_may_fail = data; }
+ };
+
+ struct should_fail
+ {
+ bool data;
+ should_fail(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_should_fail = data; }
+ void fill(detail::TestSuite& state) const { state.m_should_fail = data; }
+ };
+
+ struct expected_failures
+ {
+ int data;
+ expected_failures(int in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_expected_failures = data; }
+ void fill(detail::TestSuite& state) const { state.m_expected_failures = data; }
+ };
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+#ifndef DOCTEST_CONFIG_DISABLE
+ template <typename T>
+ int registerExceptionTranslator(String(*translateFunction)(T)) {
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wexit-time-destructors"
+#endif // __clang__
+ static detail::ExceptionTranslator<T> exceptionTranslator(translateFunction);
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+ detail::registerExceptionTranslatorImpl(&exceptionTranslator);
+ return 0;
+ }
+
+#else // DOCTEST_CONFIG_DISABLE
+ template <typename T>
+ int registerExceptionTranslator(String(*)(T)) {
+ return 0;
+ }
+#endif // DOCTEST_CONFIG_DISABLE
+
+ DOCTEST_INTERFACE bool isRunningInTest();
+
+ // cppcheck-suppress noCopyConstructor
+ class DOCTEST_INTERFACE Context
+ {
+#if !defined(DOCTEST_CONFIG_DISABLE)
+ detail::ContextState* p;
+
+ void parseArgs(int argc, const char* const* argv, bool withDefaults = false);
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+ public:
+ explicit Context(int argc = 0, const char* const* argv = 0);
+
+ ~Context();
+
+ void applyCommandLine(int argc, const char* const* argv);
+
+ void addFilter(const char* filter, const char* value);
+ void clearFilters();
+ void setOption(const char* option, int value);
+ void setOption(const char* option, const char* value);
+
+ bool shouldExit();
+
+ int run();
+ };
+
+} // namespace doctest
+
+ // if registering is not disabled
+#if !defined(DOCTEST_CONFIG_DISABLE)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_EXPAND_VA_ARGS(...) __VA_ARGS__
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_EXPAND_VA_ARGS
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_STRIP_PARENS(x) x
+#define DOCTEST_HANDLE_BRACED_VA_ARGS(expr) DOCTEST_STRIP_PARENS(DOCTEST_EXPAND_VA_ARGS expr)
+
+ // registers the test by initializing a dummy var with a function
+#define DOCTEST_REGISTER_FUNCTION(f, decorators) \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = doctest::detail::regTest( \
+ doctest::detail::TestCase(f, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite()) * \
+ decorators); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END()
+
+#define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, decorators) \
+ namespace \
+ { \
+ struct der : base \
+ { void f(); }; \
+ static void func() { \
+ der v; \
+ v.f(); \
+ } \
+ DOCTEST_REGISTER_FUNCTION(func, decorators) \
+ } \
+ inline DOCTEST_NOINLINE void der::f()
+
+#define DOCTEST_CREATE_AND_REGISTER_FUNCTION(f, decorators) \
+ static void f(); \
+ DOCTEST_REGISTER_FUNCTION(f, decorators) \
+ static void f()
+
+ // for registering tests
+#define DOCTEST_TEST_CASE(decorators) \
+ DOCTEST_CREATE_AND_REGISTER_FUNCTION(DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), decorators)
+
+ // for registering tests with a fixture
+#define DOCTEST_TEST_CASE_FIXTURE(c, decorators) \
+ DOCTEST_IMPLEMENT_FIXTURE(DOCTEST_ANONYMOUS(_DOCTEST_ANON_CLASS_), c, \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), decorators)
+
+ // for converting types to strings without the <typeinfo> header and demangling
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING_IMPL(...) \
+ template <> \
+ inline const char* type_to_string<__VA_ARGS__>() { \
+ return "<" #__VA_ARGS__ ">"; \
+ }
+#define DOCTEST_TYPE_TO_STRING(...) \
+ namespace doctest \
+ { \
+ namespace detail \
+ { DOCTEST_TYPE_TO_STRING_IMPL(__VA_ARGS__) } \
+ } \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING_IMPL(x) \
+ template <> \
+ inline const char* type_to_string<x>() { \
+ return "<" #x ">"; \
+ }
+#define DOCTEST_TYPE_TO_STRING(x) \
+ namespace doctest \
+ { \
+ namespace detail \
+ { DOCTEST_TYPE_TO_STRING_IMPL(x) } \
+ } \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for typed tests
+#define DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, types, anon) \
+ template <typename T> \
+ inline void anon(); \
+ struct DOCTEST_CAT(anon, FUNCTOR) \
+ { \
+ template <int Index, typename Type> \
+ void operator()() { \
+ doctest::detail::regTest( \
+ doctest::detail::TestCase(anon<Type>, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite(), \
+ doctest::detail::type_to_string<Type>(), Index) * \
+ decorators); \
+ } \
+ }; \
+ inline int DOCTEST_CAT(anon, REG_FUNC)() { \
+ DOCTEST_CAT(anon, FUNCTOR) registrar; \
+ doctest::detail::ForEachType<DOCTEST_HANDLE_BRACED_VA_ARGS(types)::Result, \
+ DOCTEST_CAT(anon, FUNCTOR)> \
+ doIt(registrar); \
+ return 0; \
+ } \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_CAT(anon, DUMMY)) = DOCTEST_CAT(anon, REG_FUNC)(); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ template <typename T> \
+ inline void anon()
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE(decorators, T, ...) \
+ DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, (__VA_ARGS__), \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE(decorators, T, types) \
+ DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, types, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE_IMPL(decorators, T, id, anon) \
+ template <typename T> \
+ inline void anon(); \
+ struct DOCTEST_CAT(id, _FUNCTOR) \
+ { \
+ int m_line; \
+ DOCTEST_CAT(id, _FUNCTOR) \
+ (int line) \
+ : m_line(line) {} \
+ template <int Index, typename Type> \
+ void operator()() { \
+ doctest::detail::regTest( \
+ doctest::detail::TestCase(anon<Type>, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite(), \
+ doctest::detail::type_to_string<Type>(), \
+ m_line * 1000 + Index) * \
+ decorators); \
+ } \
+ }; \
+ template <typename T> \
+ inline void anon()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE(decorators, T, id) \
+ DOCTEST_TEST_CASE_TEMPLATE_DEFINE_IMPL(decorators, T, id, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, types, anon) \
+ static int DOCTEST_CAT(anon, REG_FUNC)() { \
+ DOCTEST_CAT(id, _FUNCTOR) registrar(__LINE__); \
+ doctest::detail::ForEachType<DOCTEST_HANDLE_BRACED_VA_ARGS(types)::Result, \
+ DOCTEST_CAT(id, _FUNCTOR)> \
+ doIt(registrar); \
+ return 0; \
+ } \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_CAT(anon, DUMMY)) = DOCTEST_CAT(anon, REG_FUNC)(); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, ...) \
+ DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, (__VA_ARGS__), \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, types) \
+ DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, types, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for subcases
+#if defined(__GNUC__)
+#define DOCTEST_SUBCASE(name) \
+ if(const doctest::detail::Subcase & DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUBCASE_) \
+ __attribute__((unused)) = \
+ doctest::detail::Subcase(name, __FILE__, __LINE__))
+#else // __GNUC__
+#define DOCTEST_SUBCASE(name) \
+ if(const doctest::detail::Subcase & DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUBCASE_) = \
+ doctest::detail::Subcase(name, __FILE__, __LINE__))
+#endif // __GNUC__
+
+ // for grouping tests in test suites by using code blocks
+#define DOCTEST_TEST_SUITE_IMPL(decorators, ns_name) \
+ namespace ns_name \
+ { \
+ namespace doctest_detail_test_suite_ns \
+ { \
+ inline DOCTEST_NOINLINE doctest::detail::TestSuite& getCurrentTestSuite() { \
+ static doctest::detail::TestSuite data; \
+ static bool inited = false; \
+ if(!inited) { \
+ data* decorators; \
+ inited = true; \
+ } \
+ return data; \
+ } \
+ } \
+ } \
+ namespace ns_name
+
+#define DOCTEST_TEST_SUITE(decorators) \
+ DOCTEST_TEST_SUITE_IMPL(decorators, DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUITE_))
+
+ // for starting a testsuite block
+#define DOCTEST_TEST_SUITE_BEGIN(decorators) \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = \
+ doctest::detail::setTestSuite(doctest::detail::TestSuite() * decorators); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for ending a testsuite block
+#define DOCTEST_TEST_SUITE_END \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = \
+ doctest::detail::setTestSuite(doctest::detail::TestSuite() * ""); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for registering exception translators
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR_IMPL(translatorName, signature) \
+ static doctest::String translatorName(signature); \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_)) = \
+ doctest::registerExceptionTranslator(translatorName); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ static doctest::String translatorName(signature)
+
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR(signature) \
+ DOCTEST_REGISTER_EXCEPTION_TRANSLATOR_IMPL(DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_), \
+ signature)
+
+ // for logging
+#define DOCTEST_INFO(x) \
+ doctest::detail::ContextScope DOCTEST_ANONYMOUS(_DOCTEST_CAPTURE_)( \
+ doctest::detail::ContextBuilder() << x)
+#define DOCTEST_CAPTURE(x) DOCTEST_INFO(#x " := " << x)
+
+#define DOCTEST_ADD_AT_IMPL(type, file, line, mb, x) \
+ do { \
+ doctest::detail::MessageBuilder mb(file, line, doctest::detail::assertType::type); \
+ mb << x; \
+ if(mb.log()) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ mb.react(); \
+ } while((void)0, 0)
+
+ // clang-format off
+#define DOCTEST_ADD_MESSAGE_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_warn, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+#define DOCTEST_ADD_FAIL_CHECK_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_check, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+#define DOCTEST_ADD_FAIL_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_require, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+ // clang-format on
+
+#define DOCTEST_MESSAGE(x) DOCTEST_ADD_MESSAGE_AT(__FILE__, __LINE__, x)
+#define DOCTEST_FAIL_CHECK(x) DOCTEST_ADD_FAIL_CHECK_AT(__FILE__, __LINE__, x)
+#define DOCTEST_FAIL(x) DOCTEST_ADD_FAIL_AT(__FILE__, __LINE__, x)
+
+#if __cplusplus >= 201402L || (defined(_MSC_VER) && _MSC_VER >= 1910)
+template <class T, T x>
+constexpr T to_lvalue = x;
+#define DOCTEST_TO_LVALUE(...) to_lvalue<decltype(__VA_ARGS__), __VA_ARGS__>
+#else
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TO_LVALUE(...) TO_LVALUE_CAN_BE_USED_ONLY_IN_CPP14_MODE_OR_WITH_VS_2017_OR_NEWER
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TO_LVALUE(x) TO_LVALUE_CAN_BE_USED_ONLY_IN_CPP14_MODE_OR_WITH_VS_2017_OR_NEWER
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // TO_LVALUE hack for logging macros like INFO()
+
+ // common code in asserts - for convenience
+#define DOCTEST_ASSERT_LOG_AND_REACT(rb) \
+ if(rb.log()) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ rb.react()
+
+#ifdef DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#define DOCTEST_WRAP_IN_TRY(x) x;
+#else // DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#define DOCTEST_WRAP_IN_TRY(x) \
+ try { \
+ x; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); }
+#endif // DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+
+#define DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type) \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY(_DOCTEST_RB.setResult( \
+ doctest::detail::ExpressionDecomposer(doctest::detail::assertType::assert_type) \
+ << DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB)
+
+#if defined(__clang__)
+#define DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type) \
+ _Pragma("clang diagnostic push") \
+ _Pragma("clang diagnostic ignored \"-Woverloaded-shift-op-parentheses\"") \
+ DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type); \
+ _Pragma("clang diagnostic pop")
+#else // __clang__
+#define DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type) DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type);
+#endif // __clang__
+
+#define DOCTEST_ASSERT_IMPLEMENT_1(expr, assert_type) \
+ do { \
+ DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type); \
+ } while((void)0, 0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_WARN)
+#define DOCTEST_CHECK(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_CHECK)
+#define DOCTEST_REQUIRE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_REQUIRE)
+#define DOCTEST_WARN_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_WARN_FALSE)
+#define DOCTEST_CHECK_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_CHECK_FALSE)
+#define DOCTEST_REQUIRE_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_REQUIRE_FALSE)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_WARN)
+#define DOCTEST_CHECK(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_CHECK)
+#define DOCTEST_REQUIRE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_REQUIRE)
+#define DOCTEST_WARN_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_WARN_FALSE)
+#define DOCTEST_CHECK_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_CHECK_FALSE)
+#define DOCTEST_REQUIRE_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_REQUIRE_FALSE)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_WARN); } while((void)0, 0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_CHECK); } while((void)0, 0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_REQUIRE); } while((void)0, 0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_WARN_FALSE); } while((void)0, 0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_CHECK_FALSE); } while((void)0, 0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_REQUIRE_FALSE); } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_WARN); } while((void)0, 0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_CHECK); } while((void)0, 0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_REQUIRE); } while((void)0, 0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_WARN_FALSE); } while((void)0, 0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_CHECK_FALSE); } while((void)0, 0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_REQUIRE_FALSE); } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#define DOCTEST_ASSERT_THROWS(expr, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #expr); \
+ try { \
+ expr; \
+ } catch(...) { _DOCTEST_RB.m_threw = true; } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_ASSERT_THROWS_AS(expr, as, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #expr, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(as))); \
+ try { \
+ expr; \
+ } catch(DOCTEST_HANDLE_BRACED_VA_ARGS(as)) { \
+ _DOCTEST_RB.m_threw = true; \
+ _DOCTEST_RB.m_threw_as = true; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_ASSERT_NOTHROW(expr, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #expr); \
+ try { \
+ expr; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_WARN_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_WARN_THROWS)
+#define DOCTEST_CHECK_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_CHECK_THROWS)
+#define DOCTEST_REQUIRE_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_REQUIRE_THROWS)
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_WARN_THROWS_AS)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_CHECK_THROWS_AS)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_REQUIRE_THROWS_AS)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_WARN_THROWS_AS)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_CHECK_THROWS_AS)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_REQUIRE_THROWS_AS)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#define DOCTEST_WARN_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_WARN_NOTHROW)
+#define DOCTEST_CHECK_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_CHECK_NOTHROW)
+#define DOCTEST_REQUIRE_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_REQUIRE_NOTHROW)
+
+ // clang-format off
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_NOTHROW(expr); } while((void)0, 0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_NOTHROW(expr); } while((void)0, 0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_NOTHROW(expr); } while((void)0, 0)
+ // clang-format on
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_BINARY_ASSERT(assert_type, expr, comp) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY( \
+ _DOCTEST_RB.binary_assert<doctest::detail::binaryAssertComparison::comp>( \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_BINARY_ASSERT(assert_type, lhs, rhs, comp) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #lhs ", " #rhs); \
+ DOCTEST_WRAP_IN_TRY( \
+ _DOCTEST_RB.binary_assert<doctest::detail::binaryAssertComparison::comp>(lhs, \
+ rhs)) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_UNARY_ASSERT(assert_type, expr) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY(_DOCTEST_RB.unary_assert(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_EQ(...) DOCTEST_BINARY_ASSERT(DT_WARN_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_CHECK_EQ(...) DOCTEST_BINARY_ASSERT(DT_CHECK_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_REQUIRE_EQ(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_WARN_NE(...) DOCTEST_BINARY_ASSERT(DT_WARN_NE, (__VA_ARGS__), ne)
+#define DOCTEST_CHECK_NE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_NE, (__VA_ARGS__), ne)
+#define DOCTEST_REQUIRE_NE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_NE, (__VA_ARGS__), ne)
+#define DOCTEST_WARN_GT(...) DOCTEST_BINARY_ASSERT(DT_WARN_GT, (__VA_ARGS__), gt)
+#define DOCTEST_CHECK_GT(...) DOCTEST_BINARY_ASSERT(DT_CHECK_GT, (__VA_ARGS__), gt)
+#define DOCTEST_REQUIRE_GT(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GT, (__VA_ARGS__), gt)
+#define DOCTEST_WARN_LT(...) DOCTEST_BINARY_ASSERT(DT_WARN_LT, (__VA_ARGS__), lt)
+#define DOCTEST_CHECK_LT(...) DOCTEST_BINARY_ASSERT(DT_CHECK_LT, (__VA_ARGS__), lt)
+#define DOCTEST_REQUIRE_LT(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LT, (__VA_ARGS__), lt)
+#define DOCTEST_WARN_GE(...) DOCTEST_BINARY_ASSERT(DT_WARN_GE, (__VA_ARGS__), ge)
+#define DOCTEST_CHECK_GE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_GE, (__VA_ARGS__), ge)
+#define DOCTEST_REQUIRE_GE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GE, (__VA_ARGS__), ge)
+#define DOCTEST_WARN_LE(...) DOCTEST_BINARY_ASSERT(DT_WARN_LE, (__VA_ARGS__), le)
+#define DOCTEST_CHECK_LE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_LE, (__VA_ARGS__), le)
+#define DOCTEST_REQUIRE_LE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LE, (__VA_ARGS__), le)
+
+#define DOCTEST_WARN_UNARY(...) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY, (__VA_ARGS__))
+#define DOCTEST_CHECK_UNARY(...) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY, (__VA_ARGS__))
+#define DOCTEST_REQUIRE_UNARY(...) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY, (__VA_ARGS__))
+#define DOCTEST_WARN_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_CHECK_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_REQUIRE_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY_FALSE, (__VA_ARGS__))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_EQ, lhs, rhs, eq)
+#define DOCTEST_CHECK_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_EQ, lhs, rhs, eq)
+#define DOCTEST_REQUIRE_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_EQ, lhs, rhs, eq)
+#define DOCTEST_WARN_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_NE, lhs, rhs, ne)
+#define DOCTEST_CHECK_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_NE, lhs, rhs, ne)
+#define DOCTEST_REQUIRE_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_NE, lhs, rhs, ne)
+#define DOCTEST_WARN_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_GT, lhs, rhs, gt)
+#define DOCTEST_CHECK_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_GT, lhs, rhs, gt)
+#define DOCTEST_REQUIRE_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GT, lhs, rhs, gt)
+#define DOCTEST_WARN_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_LT, lhs, rhs, lt)
+#define DOCTEST_CHECK_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_LT, lhs, rhs, lt)
+#define DOCTEST_REQUIRE_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LT, lhs, rhs, lt)
+#define DOCTEST_WARN_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_GE, lhs, rhs, ge)
+#define DOCTEST_CHECK_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_GE, lhs, rhs, ge)
+#define DOCTEST_REQUIRE_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GE, lhs, rhs, ge)
+#define DOCTEST_WARN_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_LE, lhs, rhs, le)
+#define DOCTEST_CHECK_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_LE, lhs, rhs, le)
+#define DOCTEST_REQUIRE_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LE, lhs, rhs, le)
+
+#define DOCTEST_WARN_UNARY(v) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY, v)
+#define DOCTEST_CHECK_UNARY(v) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY, v)
+#define DOCTEST_REQUIRE_UNARY(v) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY, v)
+#define DOCTEST_WARN_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY_FALSE, v)
+#define DOCTEST_CHECK_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY_FALSE, v)
+#define DOCTEST_REQUIRE_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY_FALSE, v)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#ifndef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, expr, comparison) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_binary_assert< \
+ doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr)); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, lhs, rhs, comparison) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_binary_assert< \
+ doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #lhs ", " #rhs, lhs, \
+ rhs); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_FAST_UNARY_ASSERT(assert_type, expr) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_unary_assert( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr)); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+
+#else // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, expr, comparison) \
+ doctest::detail::fast_binary_assert<doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, lhs, rhs, comparison) \
+ doctest::detail::fast_binary_assert<doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #lhs ", " #rhs, lhs, \
+ rhs)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_FAST_UNARY_ASSERT(assert_type, expr) \
+ doctest::detail::fast_unary_assert(doctest::detail::assertType::assert_type, __FILE__, \
+ __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))
+
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_WARN_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_CHECK_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_REQUIRE_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_WARN_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_CHECK_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_REQUIRE_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_WARN_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_CHECK_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_REQUIRE_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_WARN_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_CHECK_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_REQUIRE_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_WARN_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_CHECK_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_REQUIRE_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_WARN_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LE, (__VA_ARGS__), le)
+#define DOCTEST_FAST_CHECK_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LE, (__VA_ARGS__), le)
+#define DOCTEST_FAST_REQUIRE_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LE, (__VA_ARGS__), le)
+
+#define DOCTEST_FAST_WARN_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_CHECK_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_REQUIRE_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_WARN_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY_FALSE, (__VA_ARGS__))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_WARN_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_EQ, l, r, eq)
+#define DOCTEST_FAST_CHECK_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_EQ, l, r, eq)
+#define DOCTEST_FAST_REQUIRE_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_EQ, l, r, eq)
+#define DOCTEST_FAST_WARN_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_NE, l, r, ne)
+#define DOCTEST_FAST_CHECK_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_NE, l, r, ne)
+#define DOCTEST_FAST_REQUIRE_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_NE, l, r, ne)
+#define DOCTEST_FAST_WARN_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GT, l, r, gt)
+#define DOCTEST_FAST_CHECK_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GT, l, r, gt)
+#define DOCTEST_FAST_REQUIRE_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GT, l, r, gt)
+#define DOCTEST_FAST_WARN_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LT, l, r, lt)
+#define DOCTEST_FAST_CHECK_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LT, l, r, lt)
+#define DOCTEST_FAST_REQUIRE_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LT, l, r, lt)
+#define DOCTEST_FAST_WARN_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GE, l, r, ge)
+#define DOCTEST_FAST_CHECK_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GE, l, r, ge)
+#define DOCTEST_FAST_REQUIRE_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GE, l, r, ge)
+#define DOCTEST_FAST_WARN_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LE, l, r, le)
+#define DOCTEST_FAST_CHECK_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LE, l, r, le)
+#define DOCTEST_FAST_REQUIRE_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LE, l, r, le)
+
+#define DOCTEST_FAST_WARN_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY, v)
+#define DOCTEST_FAST_CHECK_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY, v)
+#define DOCTEST_FAST_REQUIRE_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY, v)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY_FALSE, v)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY_FALSE, v)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY_FALSE, v)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS
+
+#undef DOCTEST_WARN_THROWS
+#undef DOCTEST_CHECK_THROWS
+#undef DOCTEST_REQUIRE_THROWS
+#undef DOCTEST_WARN_THROWS_AS
+#undef DOCTEST_CHECK_THROWS_AS
+#undef DOCTEST_REQUIRE_THROWS_AS
+#undef DOCTEST_WARN_NOTHROW
+#undef DOCTEST_CHECK_NOTHROW
+#undef DOCTEST_REQUIRE_NOTHROW
+
+#undef DOCTEST_WARN_THROWS_MESSAGE
+#undef DOCTEST_CHECK_THROWS_MESSAGE
+#undef DOCTEST_REQUIRE_THROWS_MESSAGE
+#undef DOCTEST_WARN_THROWS_AS_MESSAGE
+#undef DOCTEST_CHECK_THROWS_AS_MESSAGE
+#undef DOCTEST_REQUIRE_THROWS_AS_MESSAGE
+#undef DOCTEST_WARN_NOTHROW_MESSAGE
+#undef DOCTEST_CHECK_NOTHROW_MESSAGE
+#undef DOCTEST_REQUIRE_NOTHROW_MESSAGE
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#define DOCTEST_WARN_THROWS(expr) ((void)0)
+#define DOCTEST_CHECK_THROWS(expr) ((void)0)
+#define DOCTEST_REQUIRE_THROWS(expr) ((void)0)
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_NOTHROW(expr) ((void)0)
+#define DOCTEST_CHECK_NOTHROW(expr) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW(expr) ((void)0)
+
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) ((void)0)
+
+#else // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#undef DOCTEST_REQUIRE
+#undef DOCTEST_REQUIRE_FALSE
+#undef DOCTEST_REQUIRE_MESSAGE
+#undef DOCTEST_REQUIRE_FALSE_MESSAGE
+#undef DOCTEST_REQUIRE_EQ
+#undef DOCTEST_REQUIRE_NE
+#undef DOCTEST_REQUIRE_GT
+#undef DOCTEST_REQUIRE_LT
+#undef DOCTEST_REQUIRE_GE
+#undef DOCTEST_REQUIRE_LE
+#undef DOCTEST_REQUIRE_UNARY
+#undef DOCTEST_REQUIRE_UNARY_FALSE
+#undef DOCTEST_FAST_REQUIRE_EQ
+#undef DOCTEST_FAST_REQUIRE_NE
+#undef DOCTEST_FAST_REQUIRE_GT
+#undef DOCTEST_FAST_REQUIRE_LT
+#undef DOCTEST_FAST_REQUIRE_GE
+#undef DOCTEST_FAST_REQUIRE_LE
+#undef DOCTEST_FAST_REQUIRE_UNARY
+#undef DOCTEST_FAST_REQUIRE_UNARY_FALSE
+
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+ // =================================================================================================
+ // == WHAT FOLLOWS IS VERSIONS OF THE MACROS THAT DO NOT DO ANY REGISTERING! ==
+ // == THIS CAN BE ENABLED BY DEFINING DOCTEST_CONFIG_DISABLE GLOBALLY! ==
+ // =================================================================================================
+#else // DOCTEST_CONFIG_DISABLE
+
+#define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, name) \
+ namespace \
+ { \
+ template <typename T> \
+ struct der : base \
+ { void f(); }; \
+ } \
+ template <typename T> \
+ inline void der<T>::f()
+
+#define DOCTEST_CREATE_AND_REGISTER_FUNCTION(f, name) \
+ template <typename T> \
+ static inline void f()
+
+ // for registering tests
+#define DOCTEST_TEST_CASE(name) \
+ DOCTEST_CREATE_AND_REGISTER_FUNCTION(DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), name)
+
+ // for registering tests with a fixture
+#define DOCTEST_TEST_CASE_FIXTURE(x, name) \
+ DOCTEST_IMPLEMENT_FIXTURE(DOCTEST_ANONYMOUS(_DOCTEST_ANON_CLASS_), x, \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), name)
+
+ // for converting types to strings without the <typeinfo> header and demangling
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING(...) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#define DOCTEST_TYPE_TO_STRING_IMPL(...)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING(x) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#define DOCTEST_TYPE_TO_STRING_IMPL(x)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for typed tests
+#define DOCTEST_TEST_CASE_TEMPLATE(name, type, types) \
+ template <typename type> \
+ inline void DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_)()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE(name, type, id) \
+ template <typename type> \
+ inline void DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_)()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, types) \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for subcases
+#define DOCTEST_SUBCASE(name)
+
+ // for a testsuite block
+#define DOCTEST_TEST_SUITE(name) namespace
+
+ // for starting a testsuite block
+#define DOCTEST_TEST_SUITE_BEGIN(name) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for ending a testsuite block
+#define DOCTEST_TEST_SUITE_END typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR(signature) \
+ template <typename T> \
+ static inline doctest::String DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_)(signature)
+
+#define DOCTEST_INFO(x) ((void)0)
+#define DOCTEST_CAPTURE(x) ((void)0)
+#define DOCTEST_ADD_MESSAGE_AT(file, line, x) ((void)0)
+#define DOCTEST_ADD_FAIL_CHECK_AT(file, line, x) ((void)0)
+#define DOCTEST_ADD_FAIL_AT(file, line, x) ((void)0)
+#define DOCTEST_MESSAGE(x) ((void)0)
+#define DOCTEST_FAIL_CHECK(x) ((void)0)
+#define DOCTEST_FAIL(x) ((void)0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(...) ((void)0)
+#define DOCTEST_CHECK(...) ((void)0)
+#define DOCTEST_REQUIRE(...) ((void)0)
+#define DOCTEST_WARN_FALSE(...) ((void)0)
+#define DOCTEST_CHECK_FALSE(...) ((void)0)
+#define DOCTEST_REQUIRE_FALSE(...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(expr) ((void)0)
+#define DOCTEST_CHECK(expr) ((void)0)
+#define DOCTEST_REQUIRE(expr) ((void)0)
+#define DOCTEST_WARN_FALSE(expr) ((void)0)
+#define DOCTEST_CHECK_FALSE(expr) ((void)0)
+#define DOCTEST_REQUIRE_FALSE(expr) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) ((void)0)
+
+#define DOCTEST_WARN_THROWS(expr) ((void)0)
+#define DOCTEST_CHECK_THROWS(expr) ((void)0)
+#define DOCTEST_REQUIRE_THROWS(expr) ((void)0)
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_NOTHROW(expr) ((void)0)
+#define DOCTEST_CHECK_NOTHROW(expr) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW(expr) ((void)0)
+
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) ((void)0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_EQ(...) ((void)0)
+#define DOCTEST_CHECK_EQ(...) ((void)0)
+#define DOCTEST_REQUIRE_EQ(...) ((void)0)
+#define DOCTEST_WARN_NE(...) ((void)0)
+#define DOCTEST_CHECK_NE(...) ((void)0)
+#define DOCTEST_REQUIRE_NE(...) ((void)0)
+#define DOCTEST_WARN_GT(...) ((void)0)
+#define DOCTEST_CHECK_GT(...) ((void)0)
+#define DOCTEST_REQUIRE_GT(...) ((void)0)
+#define DOCTEST_WARN_LT(...) ((void)0)
+#define DOCTEST_CHECK_LT(...) ((void)0)
+#define DOCTEST_REQUIRE_LT(...) ((void)0)
+#define DOCTEST_WARN_GE(...) ((void)0)
+#define DOCTEST_CHECK_GE(...) ((void)0)
+#define DOCTEST_REQUIRE_GE(...) ((void)0)
+#define DOCTEST_WARN_LE(...) ((void)0)
+#define DOCTEST_CHECK_LE(...) ((void)0)
+#define DOCTEST_REQUIRE_LE(...) ((void)0)
+
+#define DOCTEST_WARN_UNARY(...) ((void)0)
+#define DOCTEST_CHECK_UNARY(...) ((void)0)
+#define DOCTEST_REQUIRE_UNARY(...) ((void)0)
+#define DOCTEST_WARN_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_CHECK_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_REQUIRE_UNARY_FALSE(...) ((void)0)
+
+#define DOCTEST_FAST_WARN_EQ(...) ((void)0)
+#define DOCTEST_FAST_CHECK_EQ(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_EQ(...) ((void)0)
+#define DOCTEST_FAST_WARN_NE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_NE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_NE(...) ((void)0)
+#define DOCTEST_FAST_WARN_GT(...) ((void)0)
+#define DOCTEST_FAST_CHECK_GT(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GT(...) ((void)0)
+#define DOCTEST_FAST_WARN_LT(...) ((void)0)
+#define DOCTEST_FAST_CHECK_LT(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LT(...) ((void)0)
+#define DOCTEST_FAST_WARN_GE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_GE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GE(...) ((void)0)
+#define DOCTEST_FAST_WARN_LE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_LE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LE(...) ((void)0)
+
+#define DOCTEST_FAST_WARN_UNARY(...) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY(...) ((void)0)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(...) ((void)0)
+
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_NE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_NE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_NE(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_GT(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_GT(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_GT(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_LT(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_LT(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_LT(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_GE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_GE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_GE(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_LE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_LE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_LE(lhs, rhs) ((void)0)
+
+#define DOCTEST_WARN_UNARY(val) ((void)0)
+#define DOCTEST_CHECK_UNARY(val) ((void)0)
+#define DOCTEST_REQUIRE_UNARY(val) ((void)0)
+#define DOCTEST_WARN_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_CHECK_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_REQUIRE_UNARY_FALSE(val) ((void)0)
+
+#define DOCTEST_FAST_WARN_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_LE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_LE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LE(lhs, rhs) ((void)0)
+
+#define DOCTEST_FAST_WARN_UNARY(val) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY(val) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY(val) ((void)0)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(val) ((void)0)
+
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+ // BDD style macros
+ // clang-format off
+#define DOCTEST_SCENARIO(name) TEST_CASE(" Scenario: " name)
+#define DOCTEST_GIVEN(name) SUBCASE(" Given: " name)
+#define DOCTEST_WHEN(name) SUBCASE(" When: " name)
+#define DOCTEST_AND_WHEN(name) SUBCASE("And when: " name)
+#define DOCTEST_THEN(name) SUBCASE(" Then: " name)
+#define DOCTEST_AND_THEN(name) SUBCASE(" And: " name)
+ // clang-format on
+
+ // == SHORT VERSIONS OF THE MACROS
+#if !defined(DOCTEST_CONFIG_NO_SHORT_MACRO_NAMES)
+
+#define TEST_CASE DOCTEST_TEST_CASE
+#define TEST_CASE_FIXTURE DOCTEST_TEST_CASE_FIXTURE
+#define TYPE_TO_STRING DOCTEST_TYPE_TO_STRING
+#define TEST_CASE_TEMPLATE DOCTEST_TEST_CASE_TEMPLATE
+#define TEST_CASE_TEMPLATE_DEFINE DOCTEST_TEST_CASE_TEMPLATE_DEFINE
+#define TEST_CASE_TEMPLATE_INSTANTIATE DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE
+#define SUBCASE DOCTEST_SUBCASE
+#define TEST_SUITE DOCTEST_TEST_SUITE
+#define TEST_SUITE_BEGIN DOCTEST_TEST_SUITE_BEGIN
+#define TEST_SUITE_END DOCTEST_TEST_SUITE_END
+#define REGISTER_EXCEPTION_TRANSLATOR DOCTEST_REGISTER_EXCEPTION_TRANSLATOR
+#define INFO DOCTEST_INFO
+#define CAPTURE DOCTEST_CAPTURE
+#define ADD_MESSAGE_AT DOCTEST_ADD_MESSAGE_AT
+#define ADD_FAIL_CHECK_AT DOCTEST_ADD_FAIL_CHECK_AT
+#define ADD_FAIL_AT DOCTEST_ADD_FAIL_AT
+#define MESSAGE DOCTEST_MESSAGE
+#define FAIL_CHECK DOCTEST_FAIL_CHECK
+#define FAIL DOCTEST_FAIL
+#define TO_LVALUE DOCTEST_TO_LVALUE
+
+#define WARN DOCTEST_WARN
+#define WARN_FALSE DOCTEST_WARN_FALSE
+#define WARN_THROWS DOCTEST_WARN_THROWS
+#define WARN_THROWS_AS DOCTEST_WARN_THROWS_AS
+#define WARN_NOTHROW DOCTEST_WARN_NOTHROW
+#define CHECK DOCTEST_CHECK
+#define CHECK_FALSE DOCTEST_CHECK_FALSE
+#define CHECK_THROWS DOCTEST_CHECK_THROWS
+#define CHECK_THROWS_AS DOCTEST_CHECK_THROWS_AS
+#define CHECK_NOTHROW DOCTEST_CHECK_NOTHROW
+#define REQUIRE DOCTEST_REQUIRE
+#define REQUIRE_FALSE DOCTEST_REQUIRE_FALSE
+#define REQUIRE_THROWS DOCTEST_REQUIRE_THROWS
+#define REQUIRE_THROWS_AS DOCTEST_REQUIRE_THROWS_AS
+#define REQUIRE_NOTHROW DOCTEST_REQUIRE_NOTHROW
+
+#define WARN_MESSAGE DOCTEST_WARN_MESSAGE
+#define WARN_FALSE_MESSAGE DOCTEST_WARN_FALSE_MESSAGE
+#define WARN_THROWS_MESSAGE DOCTEST_WARN_THROWS_MESSAGE
+#define WARN_THROWS_AS_MESSAGE DOCTEST_WARN_THROWS_AS_MESSAGE
+#define WARN_NOTHROW_MESSAGE DOCTEST_WARN_NOTHROW_MESSAGE
+#define CHECK_MESSAGE DOCTEST_CHECK_MESSAGE
+#define CHECK_FALSE_MESSAGE DOCTEST_CHECK_FALSE_MESSAGE
+#define CHECK_THROWS_MESSAGE DOCTEST_CHECK_THROWS_MESSAGE
+#define CHECK_THROWS_AS_MESSAGE DOCTEST_CHECK_THROWS_AS_MESSAGE
+#define CHECK_NOTHROW_MESSAGE DOCTEST_CHECK_NOTHROW_MESSAGE
+#define REQUIRE_MESSAGE DOCTEST_REQUIRE_MESSAGE
+#define REQUIRE_FALSE_MESSAGE DOCTEST_REQUIRE_FALSE_MESSAGE
+#define REQUIRE_THROWS_MESSAGE DOCTEST_REQUIRE_THROWS_MESSAGE
+#define REQUIRE_THROWS_AS_MESSAGE DOCTEST_REQUIRE_THROWS_AS_MESSAGE
+#define REQUIRE_NOTHROW_MESSAGE DOCTEST_REQUIRE_NOTHROW_MESSAGE
+
+#define SCENARIO DOCTEST_SCENARIO
+#define GIVEN DOCTEST_GIVEN
+#define WHEN DOCTEST_WHEN
+#define AND_WHEN DOCTEST_AND_WHEN
+#define THEN DOCTEST_THEN
+#define AND_THEN DOCTEST_AND_THEN
+
+#define WARN_EQ DOCTEST_WARN_EQ
+#define CHECK_EQ DOCTEST_CHECK_EQ
+#define REQUIRE_EQ DOCTEST_REQUIRE_EQ
+#define WARN_NE DOCTEST_WARN_NE
+#define CHECK_NE DOCTEST_CHECK_NE
+#define REQUIRE_NE DOCTEST_REQUIRE_NE
+#define WARN_GT DOCTEST_WARN_GT
+#define CHECK_GT DOCTEST_CHECK_GT
+#define REQUIRE_GT DOCTEST_REQUIRE_GT
+#define WARN_LT DOCTEST_WARN_LT
+#define CHECK_LT DOCTEST_CHECK_LT
+#define REQUIRE_LT DOCTEST_REQUIRE_LT
+#define WARN_GE DOCTEST_WARN_GE
+#define CHECK_GE DOCTEST_CHECK_GE
+#define REQUIRE_GE DOCTEST_REQUIRE_GE
+#define WARN_LE DOCTEST_WARN_LE
+#define CHECK_LE DOCTEST_CHECK_LE
+#define REQUIRE_LE DOCTEST_REQUIRE_LE
+#define WARN_UNARY DOCTEST_WARN_UNARY
+#define CHECK_UNARY DOCTEST_CHECK_UNARY
+#define REQUIRE_UNARY DOCTEST_REQUIRE_UNARY
+#define WARN_UNARY_FALSE DOCTEST_WARN_UNARY_FALSE
+#define CHECK_UNARY_FALSE DOCTEST_CHECK_UNARY_FALSE
+#define REQUIRE_UNARY_FALSE DOCTEST_REQUIRE_UNARY_FALSE
+
+#define FAST_WARN_EQ DOCTEST_FAST_WARN_EQ
+#define FAST_CHECK_EQ DOCTEST_FAST_CHECK_EQ
+#define FAST_REQUIRE_EQ DOCTEST_FAST_REQUIRE_EQ
+#define FAST_WARN_NE DOCTEST_FAST_WARN_NE
+#define FAST_CHECK_NE DOCTEST_FAST_CHECK_NE
+#define FAST_REQUIRE_NE DOCTEST_FAST_REQUIRE_NE
+#define FAST_WARN_GT DOCTEST_FAST_WARN_GT
+#define FAST_CHECK_GT DOCTEST_FAST_CHECK_GT
+#define FAST_REQUIRE_GT DOCTEST_FAST_REQUIRE_GT
+#define FAST_WARN_LT DOCTEST_FAST_WARN_LT
+#define FAST_CHECK_LT DOCTEST_FAST_CHECK_LT
+#define FAST_REQUIRE_LT DOCTEST_FAST_REQUIRE_LT
+#define FAST_WARN_GE DOCTEST_FAST_WARN_GE
+#define FAST_CHECK_GE DOCTEST_FAST_CHECK_GE
+#define FAST_REQUIRE_GE DOCTEST_FAST_REQUIRE_GE
+#define FAST_WARN_LE DOCTEST_FAST_WARN_LE
+#define FAST_CHECK_LE DOCTEST_FAST_CHECK_LE
+#define FAST_REQUIRE_LE DOCTEST_FAST_REQUIRE_LE
+#define FAST_WARN_UNARY DOCTEST_FAST_WARN_UNARY
+#define FAST_CHECK_UNARY DOCTEST_FAST_CHECK_UNARY
+#define FAST_REQUIRE_UNARY DOCTEST_FAST_REQUIRE_UNARY
+#define FAST_WARN_UNARY_FALSE DOCTEST_FAST_WARN_UNARY_FALSE
+#define FAST_CHECK_UNARY_FALSE DOCTEST_FAST_CHECK_UNARY_FALSE
+#define FAST_REQUIRE_UNARY_FALSE DOCTEST_FAST_REQUIRE_UNARY_FALSE
+
+#endif // DOCTEST_CONFIG_NO_SHORT_MACRO_NAMES
+
+ // this is here to clear the 'current test suite' for the current translation unit - at the top
+DOCTEST_TEST_SUITE_END();
+
+// add stringification for primitive/fundamental types
+namespace doctest
+{
+ namespace detail
+ {
+ DOCTEST_TYPE_TO_STRING_IMPL(bool)
+ DOCTEST_TYPE_TO_STRING_IMPL(float)
+ DOCTEST_TYPE_TO_STRING_IMPL(double)
+ DOCTEST_TYPE_TO_STRING_IMPL(long double)
+ DOCTEST_TYPE_TO_STRING_IMPL(char)
+ DOCTEST_TYPE_TO_STRING_IMPL(signed char)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned char)
+ DOCTEST_TYPE_TO_STRING_IMPL(wchar_t)
+ DOCTEST_TYPE_TO_STRING_IMPL(short int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned short int)
+ DOCTEST_TYPE_TO_STRING_IMPL(int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned int)
+ DOCTEST_TYPE_TO_STRING_IMPL(long int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned long int)
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_TYPE_TO_STRING_IMPL(long long int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned long long int)
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+ } // namespace detail
+} // namespace doctest
+
+#endif // DOCTEST_LIBRARY_INCLUDED
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
+
+#ifndef DOCTEST_SINGLE_HEADER
+#define DOCTEST_SINGLE_HEADER
+#endif // DOCTEST_SINGLE_HEADER
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunknown-pragmas"
+#pragma clang diagnostic ignored "-Wpadded"
+#pragma clang diagnostic ignored "-Wglobal-constructors"
+#pragma clang diagnostic ignored "-Wexit-time-destructors"
+#pragma clang diagnostic ignored "-Wmissing-prototypes"
+#pragma clang diagnostic ignored "-Wsign-conversion"
+#pragma clang diagnostic ignored "-Wshorten-64-to-32"
+#pragma clang diagnostic ignored "-Wmissing-variable-declarations"
+#pragma clang diagnostic ignored "-Wswitch"
+#pragma clang diagnostic ignored "-Wswitch-enum"
+#pragma clang diagnostic ignored "-Wcovered-switch-default"
+#pragma clang diagnostic ignored "-Wmissing-noreturn"
+#pragma clang diagnostic ignored "-Wunused-local-typedef"
+#pragma clang diagnostic ignored "-Wdisabled-macro-expansion"
+#pragma clang diagnostic ignored "-Wmissing-braces"
+#pragma clang diagnostic ignored "-Wmissing-field-initializers"
+#pragma clang diagnostic ignored "-Wzero-as-null-pointer-constant"
+#pragma clang diagnostic ignored "-Wc++11-long-long"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wunknown-pragmas"
+#pragma GCC diagnostic ignored "-Wconversion"
+#pragma GCC diagnostic ignored "-Weffc++"
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+#pragma GCC diagnostic ignored "-Wstrict-overflow"
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+#pragma GCC diagnostic ignored "-Wmissing-braces"
+#pragma GCC diagnostic ignored "-Wmissing-declarations"
+#pragma GCC diagnostic ignored "-Winline"
+#pragma GCC diagnostic ignored "-Wswitch"
+#pragma GCC diagnostic ignored "-Wswitch-enum"
+#pragma GCC diagnostic ignored "-Wswitch-default"
+#pragma GCC diagnostic ignored "-Wunsafe-loop-optimizations"
+#pragma GCC diagnostic ignored "-Wlong-long"
+#pragma GCC diagnostic ignored "-Wold-style-cast"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic ignored "-Wzero-as-null-pointer-constant"
+#endif // > gcc 4.6
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 7)
+#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
+#endif // > gcc 4.7
+#if __GNUC__ > 5 || (__GNUC__ == 5 && __GNUC_MINOR__ > 3)
+#pragma GCC diagnostic ignored "-Wuseless-cast"
+#endif // > gcc 5.3
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4996) // The compiler encountered a deprecated declaration
+#pragma warning(disable : 4267) // 'var' : conversion from 'size_t' to 'type', possible loss of data
+#pragma warning(disable : 4706) // assignment within conditional expression
+#pragma warning(disable : 4512) // 'class' : assignment operator could not be generated
+#pragma warning(disable : 4127) // conditional expression is constant
+#pragma warning(disable : 4530) // C++ exception handler used, but unwind semantics are not enabled
+#pragma warning(disable : 4577) // 'noexcept' used with no exception handling mode specified
+#endif // _MSC_VER
+
+#if defined(DOCTEST_CONFIG_IMPLEMENT) || !defined(DOCTEST_SINGLE_HEADER)
+#ifndef DOCTEST_LIBRARY_IMPLEMENTATION
+#define DOCTEST_LIBRARY_IMPLEMENTATION
+
+#ifndef DOCTEST_SINGLE_HEADER
+#include "doctest_fwd.h"
+#endif // DOCTEST_SINGLE_HEADER
+
+#if defined(__clang__) && defined(DOCTEST_NO_CPP11_COMPAT)
+#pragma clang diagnostic ignored "-Wc++98-compat"
+#pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif // __clang__ && DOCTEST_NO_CPP11_COMPAT
+
+ // snprintf() not in the C++98 standard
+#ifdef _MSC_VER
+#define DOCTEST_SNPRINTF _snprintf
+#else
+#define DOCTEST_SNPRINTF std::snprintf
+#endif
+
+#define DOCTEST_LOG_START() \
+ do { \
+ if(!contextState->hasLoggedCurrentTestStart) { \
+ doctest::detail::logTestStart(*contextState->currentTest); \
+ contextState->hasLoggedCurrentTestStart = true; \
+ } \
+ } while(false)
+
+ // required includes - will go only in one translation unit!
+#include <ctime>
+#include <cmath>
+ // borland (Embarcadero) compiler requires math.h and not cmath - https://github.com/onqtam/doctest/pull/37
+#ifdef __BORLANDC__
+#include <math.h>
+#endif // __BORLANDC__
+#include <new>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <limits>
+#include <utility>
+#include <sstream>
+#include <iomanip>
+#include <vector>
+#include <set>
+#include <exception>
+#include <stdexcept>
+#include <csignal>
+#include <cfloat>
+#ifndef _MSC_VER
+#include <stdint.h>
+#endif // _MSC_VER
+
+namespace doctest
+{
+ namespace detail
+ {
+ // lowers ascii letters
+ char tolower(const char c) { return (c >= 'A' && c <= 'Z') ? static_cast<char>(c + 32) : c; }
+
+ template <typename T>
+ T my_max(const T& lhs, const T& rhs) {
+ return lhs > rhs ? lhs : rhs;
+ }
+
+ // case insensitive strcmp
+ int stricmp(char const* a, char const* b) {
+ for (;; a++, b++) {
+ int d = tolower(*a) - tolower(*b);
+ if (d != 0 || !*a)
+ return d;
+ }
+ }
+
+ void my_memcpy(void* dest, const void* src, unsigned num) {
+ const char* csrc = static_cast<const char*>(src);
+ char* cdest = static_cast<char*>(dest);
+ for (unsigned i = 0; i < num; ++i)
+ cdest[i] = csrc[i];
+ }
+
+ // not using std::strlen() because of valgrind errors when optimizations are turned on
+ // 'Invalid read of size 4' when the test suite len (with '\0') is not a multiple of 4
+ // for details see http://stackoverflow.com/questions/35671155
+ unsigned my_strlen(const char* in) {
+ const char* temp = in;
+ while (temp && *temp)
+ ++temp;
+ return unsigned(temp - in);
+ }
+
+ template <typename T>
+ String fpToString(T value, int precision) {
+ std::ostringstream oss;
+ oss << std::setprecision(precision) << std::fixed << value;
+ std::string d = oss.str();
+ size_t i = d.find_last_not_of('0');
+ if (i != std::string::npos && i != d.size() - 1) {
+ if (d[i] == '.')
+ i++;
+ d = d.substr(0, i + 1);
+ }
+ return d.c_str();
+ }
+
+ struct Endianness
+ {
+ enum Arch
+ {
+ Big,
+ Little
+ };
+
+ static Arch which() {
+ union _
+ {
+ int asInt;
+ char asChar[sizeof(int)];
+ } u;
+
+ u.asInt = 1; // NOLINT
+ return (u.asChar[sizeof(int) - 1] == 1) ? Big : Little; // NOLINT
+ }
+ };
+
+ String rawMemoryToString(const void* object, unsigned size) {
+ // Reverse order for little endian architectures
+ int i = 0, end = static_cast<int>(size), inc = 1;
+ if (Endianness::which() == Endianness::Little) {
+ i = end - 1;
+ end = inc = -1;
+ }
+
+ unsigned char const* bytes = static_cast<unsigned char const*>(object);
+ std::ostringstream os;
+ os << "0x" << std::setfill('0') << std::hex;
+ for (; i != end; i += inc)
+ os << std::setw(2) << static_cast<unsigned>(bytes[i]);
+ return os.str().c_str();
+ }
+
+ std::ostream* createStream() { return new std::ostringstream(); }
+ String getStreamResult(std::ostream* in) {
+ return static_cast<std::ostringstream*>(in)->str().c_str(); // NOLINT
+ }
+ void freeStream(std::ostream* in) { delete in; }
+
+#ifndef DOCTEST_CONFIG_DISABLE
+
+ // this holds both parameters for the command line and runtime data for tests
+ struct ContextState : TestAccessibleContextState //!OCLINT too many fields
+ {
+ // == parameters from the command line
+
+ std::vector<std::vector<String> > filters;
+
+ String order_by; // how tests should be ordered
+ unsigned rand_seed; // the seed for rand ordering
+
+ unsigned first; // the first (matching) test to be executed
+ unsigned last; // the last (matching) test to be executed
+
+ int abort_after; // stop tests after this many failed assertions
+ int subcase_filter_levels; // apply the subcase filters for the first N levels
+ bool case_sensitive; // if filtering should be case sensitive
+ bool exit; // if the program should be exited after the tests are ran/whatever
+ bool duration; // print the time duration of each test case
+ bool no_exitcode; // if the framework should return 0 as the exitcode
+ bool no_run; // to not run the tests at all (can be done with an "*" exclude)
+ bool no_version; // to not print the version of the framework
+ bool no_colors; // if output to the console should be colorized
+ bool force_colors; // forces the use of colors even when a tty cannot be detected
+ bool no_breaks; // to not break into the debugger
+ bool no_skip; // don't skip test cases which are marked to be skipped
+ bool no_path_in_filenames; // if the path to files should be removed from the output
+ bool no_line_numbers; // if source code line numbers should be omitted from the output
+ bool no_skipped_summary; // don't print "skipped" in the summary !!! UNDOCUMENTED !!!
+
+ bool help; // to print the help
+ bool version; // to print the version
+ bool count; // if only the count of matching tests is to be retreived
+ bool list_test_cases; // to list all tests matching the filters
+ bool list_test_suites; // to list all suites matching the filters
+
+ // == data for the tests being ran
+
+ unsigned numTestsPassingFilters;
+ unsigned numTestSuitesPassingFilters;
+ unsigned numFailed;
+ const TestCase* currentTest;
+ bool hasLoggedCurrentTestStart;
+ int numAssertionsForCurrentTestcase;
+ int numAssertions;
+ int numFailedAssertionsForCurrentTestcase;
+ int numFailedAssertions;
+ bool hasCurrentTestFailed;
+
+ std::vector<IContextScope*> contexts; // for logging with INFO() and friends
+ std::vector<std::string> exceptionalContexts; // logging from INFO() due to an exception
+
+ // stuff for subcases
+ std::set<SubcaseSignature> subcasesPassed;
+ std::set<int> subcasesEnteredLevels;
+ std::vector<Subcase> subcasesStack;
+ int subcasesCurrentLevel;
+ bool subcasesHasSkipped;
+
+ void resetRunData() {
+ numTestsPassingFilters = 0;
+ numTestSuitesPassingFilters = 0;
+ numFailed = 0;
+ numAssertions = 0;
+ numFailedAssertions = 0;
+ numFailedAssertionsForCurrentTestcase = 0;
+ }
+
+ // cppcheck-suppress uninitMemberVar
+ ContextState()
+ : filters(8) // 8 different filters total
+ {
+ resetRunData();
+ }
+ };
+
+ ContextState* contextState = 0;
+#endif // DOCTEST_CONFIG_DISABLE
+ } // namespace detail
+
+ void String::copy(const String& other) {
+ if (other.isOnStack()) {
+ detail::my_memcpy(buf, other.buf, len);
+ }
+ else {
+ setOnHeap();
+ data.size = other.data.size;
+ data.capacity = data.size + 1;
+ data.ptr = new char[data.capacity];
+ detail::my_memcpy(data.ptr, other.data.ptr, data.size + 1);
+ }
+ }
+
+ String::String(const char* in) {
+ unsigned in_len = detail::my_strlen(in);
+ if (in_len <= last) {
+ detail::my_memcpy(buf, in, in_len + 1);
+ setLast(last - in_len);
+ }
+ else {
+ setOnHeap();
+ data.size = in_len;
+ data.capacity = data.size + 1;
+ data.ptr = new char[data.capacity];
+ detail::my_memcpy(data.ptr, in, in_len + 1);
+ }
+ }
+
+ String& String::operator+=(const String& other) {
+ unsigned my_old_size = size();
+ unsigned other_size = other.size();
+ unsigned total_size = my_old_size + other_size;
+ if (isOnStack()) {
+ if (total_size < len) {
+ // append to the current stack space
+ detail::my_memcpy(buf + my_old_size, other.c_str(), other_size + 1);
+ setLast(last - total_size);
+ }
+ else {
+ // alloc new chunk
+ char* temp = new char[total_size + 1];
+ // copy current data to new location before writing in the union
+ detail::my_memcpy(temp, buf, my_old_size); // skip the +1 ('\0') for speed
+ // update data in union
+ setOnHeap();
+ data.size = total_size;
+ data.capacity = data.size + 1;
+ data.ptr = temp;
+ // transfer the rest of the data
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ }
+ else {
+ if (data.capacity > total_size) {
+ // append to the current heap block
+ data.size = total_size;
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ else {
+ // resize
+ data.capacity *= 2;
+ if (data.capacity <= total_size)
+ data.capacity = total_size + 1;
+ // alloc new chunk
+ char* temp = new char[data.capacity];
+ // copy current data to new location before releasing it
+ detail::my_memcpy(temp, data.ptr, my_old_size); // skip the +1 ('\0') for speed
+ // release old chunk
+ delete[] data.ptr;
+ // update the rest of the union members
+ data.size = total_size;
+ data.ptr = temp;
+ // transfer the rest of the data
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ }
+
+ return *this;
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ String::String(String&& other) {
+ detail::my_memcpy(buf, other.buf, len);
+ other.buf[0] = '\0';
+ other.setLast();
+ }
+
+ String& String::operator=(String&& other) {
+ if (!isOnStack())
+ delete[] data.ptr;
+ detail::my_memcpy(buf, other.buf, len);
+ other.buf[0] = '\0';
+ other.setLast();
+ return *this;
+ }
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+ int String::compare(const char* other, bool no_case) const {
+ if (no_case)
+ return detail::stricmp(c_str(), other);
+ return std::strcmp(c_str(), other);
+ }
+
+ int String::compare(const String& other, bool no_case) const {
+ return compare(other.c_str(), no_case);
+ }
+
+ std::ostream& operator<<(std::ostream& stream, const String& in) {
+ stream << in.c_str();
+ return stream;
+ }
+
+ Approx::Approx(double value)
+ : m_epsilon(static_cast<double>(std::numeric_limits<float>::epsilon()) * 100)
+ , m_scale(1.0)
+ , m_value(value) {}
+
+ bool operator==(double lhs, Approx const& rhs) {
+ // Thanks to Richard Harris for his help refining this formula
+ return std::fabs(lhs - rhs.m_value) <
+ rhs.m_epsilon * (rhs.m_scale + detail::my_max(std::fabs(lhs), std::fabs(rhs.m_value)));
+ }
+
+ String Approx::toString() const { return String("Approx( ") + doctest::toString(m_value) + " )"; }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ String toString(char* in) { return toString(static_cast<const char*>(in)); }
+ String toString(const char* in) { return String("\"") + (in ? in : "{null string}") + "\""; }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ String toString(bool in) { return in ? "true" : "false"; }
+ String toString(float in) { return detail::fpToString(in, 5) + "f"; }
+ String toString(double in) { return detail::fpToString(in, 10); }
+ String toString(double long in) { return detail::fpToString(in, 15); }
+
+ String toString(char in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(char signed in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(char unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%ud", in);
+ return buf;
+ }
+
+ String toString(int short in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(int short unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%u", in);
+ return buf;
+ }
+
+ String toString(int in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(int unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%u", in);
+ return buf;
+ }
+
+ String toString(int long in) {
+ char buf[64];
+ std::sprintf(buf, "%ld", in);
+ return buf;
+ }
+
+ String toString(int long unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%lu", in);
+ return buf;
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ String toString(int long long in) {
+ char buf[64];
+ std::sprintf(buf, "%lld", in);
+ return buf;
+ }
+ String toString(int long long unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%llu", in);
+ return buf;
+ }
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+ String toString(std::nullptr_t) { return "nullptr"; }
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+} // namespace doctest
+
+#ifdef DOCTEST_CONFIG_DISABLE
+namespace doctest
+{
+ bool isRunningInTest() { return false; }
+ Context::Context(int, const char* const*) {}
+ Context::~Context() {}
+ void Context::applyCommandLine(int, const char* const*) {}
+ void Context::addFilter(const char*, const char*) {}
+ void Context::clearFilters() {}
+ void Context::setOption(const char*, int) {}
+ void Context::setOption(const char*, const char*) {}
+ bool Context::shouldExit() { return false; }
+ int Context::run() { return 0; }
+} // namespace doctest
+#else // DOCTEST_CONFIG_DISABLE
+
+#if !defined(DOCTEST_CONFIG_COLORS_NONE)
+#if !defined(DOCTEST_CONFIG_COLORS_WINDOWS) && !defined(DOCTEST_CONFIG_COLORS_ANSI)
+#ifdef DOCTEST_PLATFORM_WINDOWS
+#define DOCTEST_CONFIG_COLORS_WINDOWS
+#else // linux
+#define DOCTEST_CONFIG_COLORS_ANSI
+#endif // platform
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS && DOCTEST_CONFIG_COLORS_ANSI
+#endif // DOCTEST_CONFIG_COLORS_NONE
+
+#define DOCTEST_PRINTF_COLORED(buffer, color) \
+ do { \
+ doctest::detail::Color col(color); \
+ std::printf("%s", buffer); \
+ } while((void)0, 0)
+
+ // the buffer size used for snprintf() calls
+#if !defined(DOCTEST_SNPRINTF_BUFFER_LENGTH)
+#define DOCTEST_SNPRINTF_BUFFER_LENGTH 1024
+#endif // DOCTEST_SNPRINTF_BUFFER_LENGTH
+
+#if defined(_MSC_VER) || defined(__MINGW32__)
+#if defined(_MSC_VER) && _MSC_VER >= 1700
+#define DOCTEST_WINDOWS_SAL_IN_OPT _In_opt_
+#else // _MSC_VER
+#define DOCTEST_WINDOWS_SAL_IN_OPT
+#endif // _MSC_VER
+extern "C" __declspec(dllimport) void __stdcall OutputDebugStringA(
+ DOCTEST_WINDOWS_SAL_IN_OPT const char*);
+extern "C" __declspec(dllimport) int __stdcall IsDebuggerPresent();
+#endif // _MSC_VER || __MINGW32__
+
+#ifdef DOCTEST_CONFIG_COLORS_ANSI
+#include <unistd.h>
+#endif // DOCTEST_CONFIG_COLORS_ANSI
+
+#ifdef _WIN32
+
+// defines for a leaner windows.h
+#ifndef WIN32_MEAN_AND_LEAN
+#define WIN32_MEAN_AND_LEAN
+#endif // WIN32_MEAN_AND_LEAN
+#ifndef VC_EXTRA_LEAN
+#define VC_EXTRA_LEAN
+#endif // VC_EXTRA_LEAN
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif // NOMINMAX
+
+// not sure what AfxWin.h is for - here I do what Catch does
+#ifdef __AFXDLL
+#include <AfxWin.h>
+#else
+#include <windows.h>
+#endif
+#include <io.h>
+
+#else // _WIN32
+
+#include <sys/time.h>
+
+#endif // _WIN32
+
+namespace doctest_detail_test_suite_ns
+{
+ // holds the current test suite
+ doctest::detail::TestSuite& getCurrentTestSuite() {
+ static doctest::detail::TestSuite data;
+ return data;
+ }
+} // namespace doctest_detail_test_suite_ns
+
+namespace doctest
+{
+ namespace detail
+ {
+ TestCase::TestCase(funcType test, const char* file, unsigned line, const TestSuite& test_suite,
+ const char* type, int template_id)
+ : m_test(test)
+ , m_name(0)
+ , m_type(type)
+ , m_test_suite(test_suite.m_test_suite)
+ , m_description(test_suite.m_description)
+ , m_skip(test_suite.m_skip)
+ , m_may_fail(test_suite.m_may_fail)
+ , m_should_fail(test_suite.m_should_fail)
+ , m_expected_failures(test_suite.m_expected_failures)
+ , m_timeout(test_suite.m_timeout)
+ , m_file(file)
+ , m_line(line)
+ , m_template_id(template_id) {}
+
+ TestCase& TestCase::operator*(const char* in) {
+ m_name = in;
+ // make a new name with an appended type for templated test case
+ if (m_template_id != -1) {
+ m_full_name = String(m_name) + m_type;
+ // redirect the name to point to the newly constructed full name
+ m_name = m_full_name.c_str();
+ }
+ return *this;
+ }
+
+ TestCase& TestCase::operator=(const TestCase& other) {
+ m_test = other.m_test;
+ m_full_name = other.m_full_name;
+ m_name = other.m_name;
+ m_type = other.m_type;
+ m_test_suite = other.m_test_suite;
+ m_description = other.m_description;
+ m_skip = other.m_skip;
+ m_may_fail = other.m_may_fail;
+ m_should_fail = other.m_should_fail;
+ m_expected_failures = other.m_expected_failures;
+ m_timeout = other.m_timeout;
+ m_file = other.m_file;
+ m_line = other.m_line;
+ m_template_id = other.m_template_id;
+
+ if (m_template_id != -1)
+ m_name = m_full_name.c_str();
+ return *this;
+ }
+
+ bool TestCase::operator<(const TestCase& other) const {
+ if (m_line != other.m_line)
+ return m_line < other.m_line;
+ int file_cmp = std::strcmp(m_file, other.m_file);
+ if (file_cmp != 0)
+ return file_cmp < 0;
+ return m_template_id < other.m_template_id;
+ }
+
+ const char* getAssertString(assertType::Enum val) {
+ switch (val) { //!OCLINT missing default in switch statements
+ // clang-format off
+ case assertType::DT_WARN: return "WARN";
+ case assertType::DT_CHECK: return "CHECK";
+ case assertType::DT_REQUIRE: return "REQUIRE";
+
+ case assertType::DT_WARN_FALSE: return "WARN_FALSE";
+ case assertType::DT_CHECK_FALSE: return "CHECK_FALSE";
+ case assertType::DT_REQUIRE_FALSE: return "REQUIRE_FALSE";
+
+ case assertType::DT_WARN_THROWS: return "WARN_THROWS";
+ case assertType::DT_CHECK_THROWS: return "CHECK_THROWS";
+ case assertType::DT_REQUIRE_THROWS: return "REQUIRE_THROWS";
+
+ case assertType::DT_WARN_THROWS_AS: return "WARN_THROWS_AS";
+ case assertType::DT_CHECK_THROWS_AS: return "CHECK_THROWS_AS";
+ case assertType::DT_REQUIRE_THROWS_AS: return "REQUIRE_THROWS_AS";
+
+ case assertType::DT_WARN_NOTHROW: return "WARN_NOTHROW";
+ case assertType::DT_CHECK_NOTHROW: return "CHECK_NOTHROW";
+ case assertType::DT_REQUIRE_NOTHROW: return "REQUIRE_NOTHROW";
+
+ case assertType::DT_WARN_EQ: return "WARN_EQ";
+ case assertType::DT_CHECK_EQ: return "CHECK_EQ";
+ case assertType::DT_REQUIRE_EQ: return "REQUIRE_EQ";
+ case assertType::DT_WARN_NE: return "WARN_NE";
+ case assertType::DT_CHECK_NE: return "CHECK_NE";
+ case assertType::DT_REQUIRE_NE: return "REQUIRE_NE";
+ case assertType::DT_WARN_GT: return "WARN_GT";
+ case assertType::DT_CHECK_GT: return "CHECK_GT";
+ case assertType::DT_REQUIRE_GT: return "REQUIRE_GT";
+ case assertType::DT_WARN_LT: return "WARN_LT";
+ case assertType::DT_CHECK_LT: return "CHECK_LT";
+ case assertType::DT_REQUIRE_LT: return "REQUIRE_LT";
+ case assertType::DT_WARN_GE: return "WARN_GE";
+ case assertType::DT_CHECK_GE: return "CHECK_GE";
+ case assertType::DT_REQUIRE_GE: return "REQUIRE_GE";
+ case assertType::DT_WARN_LE: return "WARN_LE";
+ case assertType::DT_CHECK_LE: return "CHECK_LE";
+ case assertType::DT_REQUIRE_LE: return "REQUIRE_LE";
+
+ case assertType::DT_WARN_UNARY: return "WARN_UNARY";
+ case assertType::DT_CHECK_UNARY: return "CHECK_UNARY";
+ case assertType::DT_REQUIRE_UNARY: return "REQUIRE_UNARY";
+ case assertType::DT_WARN_UNARY_FALSE: return "WARN_UNARY_FALSE";
+ case assertType::DT_CHECK_UNARY_FALSE: return "CHECK_UNARY_FALSE";
+ case assertType::DT_REQUIRE_UNARY_FALSE: return "REQUIRE_UNARY_FALSE";
+
+ case assertType::DT_FAST_WARN_EQ: return "FAST_WARN_EQ";
+ case assertType::DT_FAST_CHECK_EQ: return "FAST_CHECK_EQ";
+ case assertType::DT_FAST_REQUIRE_EQ: return "FAST_REQUIRE_EQ";
+ case assertType::DT_FAST_WARN_NE: return "FAST_WARN_NE";
+ case assertType::DT_FAST_CHECK_NE: return "FAST_CHECK_NE";
+ case assertType::DT_FAST_REQUIRE_NE: return "FAST_REQUIRE_NE";
+ case assertType::DT_FAST_WARN_GT: return "FAST_WARN_GT";
+ case assertType::DT_FAST_CHECK_GT: return "FAST_CHECK_GT";
+ case assertType::DT_FAST_REQUIRE_GT: return "FAST_REQUIRE_GT";
+ case assertType::DT_FAST_WARN_LT: return "FAST_WARN_LT";
+ case assertType::DT_FAST_CHECK_LT: return "FAST_CHECK_LT";
+ case assertType::DT_FAST_REQUIRE_LT: return "FAST_REQUIRE_LT";
+ case assertType::DT_FAST_WARN_GE: return "FAST_WARN_GE";
+ case assertType::DT_FAST_CHECK_GE: return "FAST_CHECK_GE";
+ case assertType::DT_FAST_REQUIRE_GE: return "FAST_REQUIRE_GE";
+ case assertType::DT_FAST_WARN_LE: return "FAST_WARN_LE";
+ case assertType::DT_FAST_CHECK_LE: return "FAST_CHECK_LE";
+ case assertType::DT_FAST_REQUIRE_LE: return "FAST_REQUIRE_LE";
+
+ case assertType::DT_FAST_WARN_UNARY: return "FAST_WARN_UNARY";
+ case assertType::DT_FAST_CHECK_UNARY: return "FAST_CHECK_UNARY";
+ case assertType::DT_FAST_REQUIRE_UNARY: return "FAST_REQUIRE_UNARY";
+ case assertType::DT_FAST_WARN_UNARY_FALSE: return "FAST_WARN_UNARY_FALSE";
+ case assertType::DT_FAST_CHECK_UNARY_FALSE: return "FAST_CHECK_UNARY_FALSE";
+ case assertType::DT_FAST_REQUIRE_UNARY_FALSE: return "FAST_REQUIRE_UNARY_FALSE";
+ // clang-format on
+ }
+ return "";
+ }
+
+ bool checkIfShouldThrow(assertType::Enum assert_type) {
+ if (assert_type & assertType::is_require) //!OCLINT bitwise operator in conditional
+ return true;
+
+ if ((assert_type & assertType::is_check) //!OCLINT bitwise operator in conditional
+ && contextState->abort_after > 0 &&
+ contextState->numFailedAssertions >= contextState->abort_after)
+ return true;
+
+ return false;
+ }
+ void fastAssertThrowIfFlagSet(int flags) {
+ if (flags & assertAction::shouldthrow) //!OCLINT bitwise operator in conditional
+ throwException();
+ }
+ void throwException() {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ throw TestFailureException();
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+
+ // matching of a string against a wildcard mask (case sensitivity configurable) taken from
+ // http://www.emoticode.net/c/simple-wildcard-string-compare-globbing-function.html
+ int wildcmp(const char* str, const char* wild, bool caseSensitive) {
+ const char* cp = 0;
+ const char* mp = 0;
+
+ // rolled my own tolower() to not include more headers
+ while ((*str) && (*wild != '*')) {
+ if ((caseSensitive ? (*wild != *str) : (tolower(*wild) != tolower(*str))) &&
+ (*wild != '?')) {
+ return 0;
+ }
+ wild++;
+ str++;
+ }
+
+ while (*str) {
+ if (*wild == '*') {
+ if (!*++wild) {
+ return 1;
+ }
+ mp = wild;
+ cp = str + 1;
+ }
+ else if ((caseSensitive ? (*wild == *str) : (tolower(*wild) == tolower(*str))) ||
+ (*wild == '?')) {
+ wild++;
+ str++;
+ }
+ else {
+ wild = mp; //!OCLINT parameter reassignment
+ str = cp++; //!OCLINT parameter reassignment
+ }
+ }
+
+ while (*wild == '*') {
+ wild++;
+ }
+ return !*wild;
+ }
+
+ //// C string hash function (djb2) - taken from http://www.cse.yorku.ca/~oz/hash.html
+ //unsigned hashStr(unsigned const char* str) {
+ // unsigned long hash = 5381;
+ // char c;
+ // while((c = *str++))
+ // hash = ((hash << 5) + hash) + c; // hash * 33 + c
+ // return hash;
+ //}
+
+ // checks if the name matches any of the filters (and can be configured what to do when empty)
+ bool matchesAny(const char* name, const std::vector<String>& filters, int matchEmpty,
+ bool caseSensitive) {
+ if (filters.empty() && matchEmpty)
+ return true;
+ for (unsigned i = 0; i < filters.size(); ++i)
+ if (wildcmp(name, filters[i].c_str(), caseSensitive))
+ return true;
+ return false;
+ }
+
+#ifdef _WIN32
+
+ typedef unsigned long long UInt64;
+
+ UInt64 getCurrentTicks() {
+ static UInt64 hz = 0, hzo = 0;
+ if (!hz) {
+ QueryPerformanceFrequency(reinterpret_cast<LARGE_INTEGER*>(&hz));
+ QueryPerformanceCounter(reinterpret_cast<LARGE_INTEGER*>(&hzo));
+ }
+ UInt64 t;
+ QueryPerformanceCounter(reinterpret_cast<LARGE_INTEGER*>(&t));
+ return ((t - hzo) * 1000000) / hz;
+ }
+#else // _WIN32
+
+ typedef uint64_t UInt64;
+
+ UInt64 getCurrentTicks() {
+ timeval t;
+ gettimeofday(&t, 0);
+ return static_cast<UInt64>(t.tv_sec) * 1000000 + static_cast<UInt64>(t.tv_usec);
+ }
+#endif // _WIN32
+
+ class Timer
+ {
+ public:
+ Timer()
+ : m_ticks(0) {}
+ void start() { m_ticks = getCurrentTicks(); }
+ unsigned int getElapsedMicroseconds() const {
+ return static_cast<unsigned int>(getCurrentTicks() - m_ticks);
+ }
+ unsigned int getElapsedMilliseconds() const {
+ return static_cast<unsigned int>(getElapsedMicroseconds() / 1000);
+ }
+ double getElapsedSeconds() const { return getElapsedMicroseconds() / 1000000.0; }
+
+ private:
+ UInt64 m_ticks;
+ };
+
+ TestAccessibleContextState* getTestsContextState() { return contextState; }
+
+ bool SubcaseSignature::operator<(const SubcaseSignature& other) const {
+ if (m_line != other.m_line)
+ return m_line < other.m_line;
+ if (std::strcmp(m_file, other.m_file) != 0)
+ return std::strcmp(m_file, other.m_file) < 0;
+ return std::strcmp(m_name, other.m_name) < 0;
+ }
+
+ Subcase::Subcase(const char* name, const char* file, int line)
+ : m_signature(name, file, line)
+ , m_entered(false) {
+ ContextState* s = contextState;
+
+ // if we have already completed it
+ if (s->subcasesPassed.count(m_signature) != 0)
+ return;
+
+ // check subcase filters
+ if (s->subcasesCurrentLevel < s->subcase_filter_levels) {
+ if (!matchesAny(m_signature.m_name, s->filters[6], 1, s->case_sensitive))
+ return;
+ if (matchesAny(m_signature.m_name, s->filters[7], 0, s->case_sensitive))
+ return;
+ }
+
+ // if a Subcase on the same level has already been entered
+ if (s->subcasesEnteredLevels.count(s->subcasesCurrentLevel) != 0) {
+ s->subcasesHasSkipped = true;
+ return;
+ }
+
+ s->subcasesStack.push_back(*this);
+ if (s->hasLoggedCurrentTestStart)
+ logTestEnd();
+ s->hasLoggedCurrentTestStart = false;
+
+ s->subcasesEnteredLevels.insert(s->subcasesCurrentLevel++);
+ m_entered = true;
+ }
+
+ Subcase::Subcase(const Subcase& other)
+ : m_signature(other.m_signature.m_name, other.m_signature.m_file,
+ other.m_signature.m_line)
+ , m_entered(other.m_entered) {}
+
+ Subcase::~Subcase() {
+ if (m_entered) {
+ ContextState* s = contextState;
+
+ s->subcasesCurrentLevel--;
+ // only mark the subcase as passed if no subcases have been skipped
+ if (s->subcasesHasSkipped == false)
+ s->subcasesPassed.insert(m_signature);
+
+ if (!s->subcasesStack.empty())
+ s->subcasesStack.pop_back();
+ if (s->hasLoggedCurrentTestStart)
+ logTestEnd();
+ s->hasLoggedCurrentTestStart = false;
+ }
+ }
+
+ Result::~Result() {}
+
+ Result& Result::operator=(const Result& other) {
+ m_passed = other.m_passed;
+ m_decomposition = other.m_decomposition;
+
+ return *this;
+ }
+
+ // for sorting tests by file/line
+ int fileOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+#ifdef _MSC_VER
+ // this is needed because MSVC gives different case for drive letters
+ // for __FILE__ when evaluated in a header and a source file
+ int res = stricmp(lhs->m_file, rhs->m_file);
+#else // _MSC_VER
+ int res = std::strcmp(lhs->m_file, rhs->m_file);
+#endif // _MSC_VER
+ if (res != 0)
+ return res;
+ return static_cast<int>(lhs->m_line - rhs->m_line);
+ }
+
+ // for sorting tests by suite/file/line
+ int suiteOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+
+ int res = std::strcmp(lhs->m_test_suite, rhs->m_test_suite);
+ if (res != 0)
+ return res;
+ return fileOrderComparator(a, b);
+ }
+
+ // for sorting tests by name/suite/file/line
+ int nameOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+
+ int res_name = std::strcmp(lhs->m_name, rhs->m_name);
+ if (res_name != 0)
+ return res_name;
+ return suiteOrderComparator(a, b);
+ }
+
+ // sets the current test suite
+ int setTestSuite(const TestSuite& ts) {
+ doctest_detail_test_suite_ns::getCurrentTestSuite() = ts;
+ return 0;
+ }
+
+ // all the registered tests
+ std::set<TestCase>& getRegisteredTests() {
+ static std::set<TestCase> data;
+ return data;
+ }
+
+ // used by the macros for registering tests
+ int regTest(const TestCase& tc) {
+ getRegisteredTests().insert(tc);
+ return 0;
+ }
+
+ struct Color
+ {
+ enum Code
+ {
+ None = 0,
+ White,
+ Red,
+ Green,
+ Blue,
+ Cyan,
+ Yellow,
+ Grey,
+
+ Bright = 0x10,
+
+ BrightRed = Bright | Red,
+ BrightGreen = Bright | Green,
+ LightGrey = Bright | Grey,
+ BrightWhite = Bright | White
+ };
+ explicit Color(Code code) { use(code); }
+ ~Color() { use(None); }
+
+ static void use(Code code);
+ static void init();
+ };
+
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ HANDLE g_stdoutHandle;
+ WORD g_originalForegroundAttributes;
+ WORD g_originalBackgroundAttributes;
+ bool g_attrsInitted = false;
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+
+ void Color::init() {
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ if (!g_attrsInitted) {
+ g_stdoutHandle = GetStdHandle(STD_OUTPUT_HANDLE);
+ g_attrsInitted = true;
+ CONSOLE_SCREEN_BUFFER_INFO csbiInfo;
+ GetConsoleScreenBufferInfo(g_stdoutHandle, &csbiInfo);
+ g_originalForegroundAttributes =
+ csbiInfo.wAttributes &
+ ~(BACKGROUND_GREEN | BACKGROUND_RED | BACKGROUND_BLUE | BACKGROUND_INTENSITY);
+ g_originalBackgroundAttributes =
+ csbiInfo.wAttributes &
+ ~(FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY);
+ }
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+ }
+
+ void Color::use(Code
+#ifndef DOCTEST_CONFIG_COLORS_NONE
+ code
+#endif // DOCTEST_CONFIG_COLORS_NONE
+ ) {
+ const ContextState* p = contextState;
+ if (p->no_colors)
+ return;
+#ifdef DOCTEST_CONFIG_COLORS_ANSI
+ if (isatty(STDOUT_FILENO) == false && p->force_colors == false)
+ return;
+
+ const char* col = "";
+ // clang-format off
+ switch (code) { //!OCLINT missing break in switch statement / unnecessary default statement in covered switch statement
+ case Color::Red: col = "[0;31m"; break;
+ case Color::Green: col = "[0;32m"; break;
+ case Color::Blue: col = "[0;34m"; break;
+ case Color::Cyan: col = "[0;36m"; break;
+ case Color::Yellow: col = "[0;33m"; break;
+ case Color::Grey: col = "[1;30m"; break;
+ case Color::LightGrey: col = "[0;37m"; break;
+ case Color::BrightRed: col = "[1;31m"; break;
+ case Color::BrightGreen: col = "[1;32m"; break;
+ case Color::BrightWhite: col = "[1;37m"; break;
+ case Color::Bright: // invalid
+ case Color::None:
+ case Color::White:
+ default: col = "[0m";
+ }
+ // clang-format on
+ std::printf("\033%s", col);
+#endif // DOCTEST_CONFIG_COLORS_ANSI
+
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ if (isatty(fileno(stdout)) == false && p->force_colors == false)
+ return;
+
+#define DOCTEST_SET_ATTR(x) \
+ SetConsoleTextAttribute(g_stdoutHandle, x | g_originalBackgroundAttributes)
+
+ // clang-format off
+ switch (code) {
+ case Color::White: DOCTEST_SET_ATTR(FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE); break;
+ case Color::Red: DOCTEST_SET_ATTR(FOREGROUND_RED); break;
+ case Color::Green: DOCTEST_SET_ATTR(FOREGROUND_GREEN); break;
+ case Color::Blue: DOCTEST_SET_ATTR(FOREGROUND_BLUE); break;
+ case Color::Cyan: DOCTEST_SET_ATTR(FOREGROUND_BLUE | FOREGROUND_GREEN); break;
+ case Color::Yellow: DOCTEST_SET_ATTR(FOREGROUND_RED | FOREGROUND_GREEN); break;
+ case Color::Grey: DOCTEST_SET_ATTR(0); break;
+ case Color::LightGrey: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY); break;
+ case Color::BrightRed: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_RED); break;
+ case Color::BrightGreen: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_GREEN); break;
+ case Color::BrightWhite: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE); break;
+ case Color::None:
+ case Color::Bright: // invalid
+ default: DOCTEST_SET_ATTR(g_originalForegroundAttributes);
+ }
+ // clang-format on
+#undef DOCTEST_SET_ATTR
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+ }
+
+ IExceptionTranslator::~IExceptionTranslator() {}
+
+ std::vector<const IExceptionTranslator*>& getExceptionTranslators() {
+ static std::vector<const IExceptionTranslator*> data;
+ return data;
+ }
+
+ void registerExceptionTranslatorImpl(const IExceptionTranslator* translateFunction) {
+ getExceptionTranslators().push_back(translateFunction);
+ }
+
+ String translateActiveException() {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ String res;
+ std::vector<const IExceptionTranslator*>& translators = getExceptionTranslators();
+ for (size_t i = 0; i < translators.size(); ++i)
+ if (translators[i]->translate(res))
+ return res;
+ // clang-format off
+ try {
+ throw;
+ }
+ catch (std::exception& ex) {
+ return ex.what();
+ }
+ catch (std::string& msg) {
+ return msg.c_str();
+ }
+ catch (const char* msg) {
+ return msg;
+ }
+ catch (...) {
+ return "unknown exception";
+ }
+ // clang-format on
+#else // DOCTEST_CONFIG_NO_EXCEPTIONS
+ return "";
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+
+ void writeStringToStream(std::ostream* stream, const String& str) { *stream << str; }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ void toStream(std::ostream* stream, char* in) { *stream << in; }
+ void toStream(std::ostream* stream, const char* in) { *stream << in; }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ void toStream(std::ostream* stream, bool in) {
+ *stream << std::boolalpha << in << std::noboolalpha;
+ }
+ void toStream(std::ostream* stream, float in) { *stream << in; }
+ void toStream(std::ostream* stream, double in) { *stream << in; }
+ void toStream(std::ostream* stream, double long in) { *stream << in; }
+
+ void toStream(std::ostream* stream, char in) { *stream << in; }
+ void toStream(std::ostream* stream, char signed in) { *stream << in; }
+ void toStream(std::ostream* stream, char unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int short in) { *stream << in; }
+ void toStream(std::ostream* stream, int short unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int in) { *stream << in; }
+ void toStream(std::ostream* stream, int unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int long in) { *stream << in; }
+ void toStream(std::ostream* stream, int long unsigned in) { *stream << in; }
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ void toStream(std::ostream* stream, int long long in) { *stream << in; }
+ void toStream(std::ostream* stream, int long long unsigned in) { *stream << in; }
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+ void addToContexts(IContextScope* ptr) { contextState->contexts.push_back(ptr); }
+ void popFromContexts() { contextState->contexts.pop_back(); }
+ void useContextIfExceptionOccurred(IContextScope* ptr) {
+ if (std::uncaught_exception()) {
+ std::ostringstream stream;
+ ptr->build(&stream);
+ contextState->exceptionalContexts.push_back(stream.str());
+ }
+ }
+
+ void printSummary();
+
+#if !defined(DOCTEST_CONFIG_POSIX_SIGNALS) && !defined(DOCTEST_CONFIG_WINDOWS_SEH)
+ void reportFatal(const std::string&) {}
+ struct FatalConditionHandler
+ {
+ void reset() {}
+ };
+#else // DOCTEST_CONFIG_POSIX_SIGNALS || DOCTEST_CONFIG_WINDOWS_SEH
+
+ void reportFatal(const std::string& message) {
+ DOCTEST_LOG_START();
+
+ contextState->numAssertions += contextState->numAssertionsForCurrentTestcase;
+ logTestException(message.c_str(), true);
+ logTestEnd();
+ contextState->numFailed++;
+
+ printSummary();
+ }
+
+#ifdef DOCTEST_PLATFORM_WINDOWS
+
+ struct SignalDefs
+ {
+ DWORD id;
+ const char* name;
+ };
+ // There is no 1-1 mapping between signals and windows exceptions.
+ // Windows can easily distinguish between SO and SigSegV,
+ // but SigInt, SigTerm, etc are handled differently.
+ SignalDefs signalDefs[] = {
+ { EXCEPTION_ILLEGAL_INSTRUCTION, "SIGILL - Illegal instruction signal" },
+ { EXCEPTION_STACK_OVERFLOW, "SIGSEGV - Stack overflow" },
+ { EXCEPTION_ACCESS_VIOLATION, "SIGSEGV - Segmentation violation signal" },
+ { EXCEPTION_INT_DIVIDE_BY_ZERO, "Divide by zero error" },
+ };
+
+ struct FatalConditionHandler
+ {
+ static LONG CALLBACK handleVectoredException(PEXCEPTION_POINTERS ExceptionInfo) {
+ for (size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ if (ExceptionInfo->ExceptionRecord->ExceptionCode == signalDefs[i].id) {
+ reportFatal(signalDefs[i].name);
+ }
+ }
+ // If its not an exception we care about, pass it along.
+ // This stops us from eating debugger breaks etc.
+ return EXCEPTION_CONTINUE_SEARCH;
+ }
+
+ FatalConditionHandler() {
+ isSet = true;
+ // 32k seems enough for doctest to handle stack overflow,
+ // but the value was found experimentally, so there is no strong guarantee
+ guaranteeSize = 32 * 1024;
+ exceptionHandlerHandle = 0;
+ // Register as first handler in current chain
+ exceptionHandlerHandle = AddVectoredExceptionHandler(1, handleVectoredException);
+ // Pass in guarantee size to be filled
+ SetThreadStackGuarantee(&guaranteeSize);
+ }
+
+ static void reset() {
+ if (isSet) {
+ // Unregister handler and restore the old guarantee
+ RemoveVectoredExceptionHandler(exceptionHandlerHandle);
+ SetThreadStackGuarantee(&guaranteeSize);
+ exceptionHandlerHandle = 0;
+ isSet = false;
+ }
+ }
+
+ ~FatalConditionHandler() { reset(); }
+
+ private:
+ static bool isSet;
+ static ULONG guaranteeSize;
+ static PVOID exceptionHandlerHandle;
+ };
+
+ bool FatalConditionHandler::isSet = false;
+ ULONG FatalConditionHandler::guaranteeSize = 0;
+ PVOID FatalConditionHandler::exceptionHandlerHandle = 0;
+
+#else // DOCTEST_PLATFORM_WINDOWS
+
+ struct SignalDefs
+ {
+ int id;
+ const char* name;
+ };
+ SignalDefs signalDefs[] = { { SIGINT, "SIGINT - Terminal interrupt signal" },
+ { SIGILL, "SIGILL - Illegal instruction signal" },
+ { SIGFPE, "SIGFPE - Floating point error signal" },
+ { SIGSEGV, "SIGSEGV - Segmentation violation signal" },
+ { SIGTERM, "SIGTERM - Termination request signal" },
+ { SIGABRT, "SIGABRT - Abort (abnormal termination) signal" } };
+
+ struct FatalConditionHandler
+ {
+ static bool isSet;
+ static struct sigaction oldSigActions[sizeof(signalDefs) / sizeof(SignalDefs)];
+ static stack_t oldSigStack;
+ static char altStackMem[SIGSTKSZ];
+
+ static void handleSignal(int sig) {
+ std::string name = "<unknown signal>";
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ SignalDefs& def = signalDefs[i];
+ if (sig == def.id) {
+ name = def.name;
+ break;
+ }
+ }
+ reset();
+ reportFatal(name);
+ raise(sig);
+ }
+
+ FatalConditionHandler() {
+ isSet = true;
+ stack_t sigStack;
+ sigStack.ss_sp = altStackMem;
+ sigStack.ss_size = SIGSTKSZ;
+ sigStack.ss_flags = 0;
+ sigaltstack(&sigStack, &oldSigStack);
+ struct sigaction sa = { 0 };
+
+ sa.sa_handler = handleSignal; // NOLINT
+ sa.sa_flags = SA_ONSTACK;
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ sigaction(signalDefs[i].id, &sa, &oldSigActions[i]);
+ }
+ }
+
+ ~FatalConditionHandler() { reset(); }
+ static void reset() {
+ if (isSet) {
+ // Set signals back to previous values -- hopefully nobody overwrote them in the meantime
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ sigaction(signalDefs[i].id, &oldSigActions[i], 0);
+ }
+ // Return the old stack
+ sigaltstack(&oldSigStack, 0);
+ isSet = false;
+ }
+ }
+ };
+
+ bool FatalConditionHandler::isSet = false;
+ struct sigaction FatalConditionHandler::oldSigActions[sizeof(signalDefs) / sizeof(SignalDefs)] =
+ {};
+ stack_t FatalConditionHandler::oldSigStack = {};
+ char FatalConditionHandler::altStackMem[SIGSTKSZ] = {};
+
+#endif // DOCTEST_PLATFORM_WINDOWS
+#endif // DOCTEST_CONFIG_POSIX_SIGNALS || DOCTEST_CONFIG_WINDOWS_SEH
+
+ // depending on the current options this will remove the path of filenames
+ const char* fileForOutput(const char* file) {
+ if (contextState->no_path_in_filenames) {
+ const char* back = std::strrchr(file, '\\');
+ const char* forward = std::strrchr(file, '/');
+ if (back || forward) {
+ if (back > forward)
+ forward = back;
+ return forward + 1;
+ }
+ }
+ return file;
+ }
+
+ // depending on the current options this will substitute the line numbers with 0
+ int lineForOutput(int line) {
+ if (contextState->no_line_numbers)
+ return 0;
+ return line;
+ }
+
+#ifdef DOCTEST_PLATFORM_MAC
+#include <sys/types.h>
+#include <unistd.h>
+#include <sys/sysctl.h>
+ // The following function is taken directly from the following technical note:
+ // http://developer.apple.com/library/mac/#qa/qa2004/qa1361.html
+ // Returns true if the current process is being debugged (either
+ // running under the debugger or has a debugger attached post facto).
+ bool isDebuggerActive() {
+ int mib[4];
+ kinfo_proc info;
+ size_t size;
+ // Initialize the flags so that, if sysctl fails for some bizarre
+ // reason, we get a predictable result.
+ info.kp_proc.p_flag = 0;
+ // Initialize mib, which tells sysctl the info we want, in this case
+ // we're looking for information about a specific process ID.
+ mib[0] = CTL_KERN;
+ mib[1] = KERN_PROC;
+ mib[2] = KERN_PROC_PID;
+ mib[3] = getpid();
+ // Call sysctl.
+ size = sizeof(info);
+ if (sysctl(mib, sizeof(mib) / sizeof(*mib), &info, &size, 0, 0) != 0) {
+ fprintf(stderr, "\n** Call to sysctl failed - unable to determine if debugger is "
+ "active **\n\n");
+ return false;
+ }
+ // We're being debugged if the P_TRACED flag is set.
+ return ((info.kp_proc.p_flag & P_TRACED) != 0);
+ }
+#elif defined(_MSC_VER) || defined(__MINGW32__)
+ bool isDebuggerActive() { return ::IsDebuggerPresent() != 0; }
+#else
+ bool isDebuggerActive() { return false; }
+#endif // Platform
+
+#ifdef DOCTEST_PLATFORM_WINDOWS
+ void myOutputDebugString(const String& text) { ::OutputDebugStringA(text.c_str()); }
+#else
+ // TODO: integration with XCode and other IDEs
+ void myOutputDebugString(const String&) {}
+#endif // Platform
+
+ const char* getSeparator() {
+ return "===============================================================================\n";
+ }
+
+ void printToDebugConsole(const String& text) {
+ if (isDebuggerActive())
+ myOutputDebugString(text.c_str());
+ }
+
+ void addFailedAssert(assertType::Enum assert_type) {
+ if ((assert_type & assertType::is_warn) == 0) { //!OCLINT bitwise operator in conditional
+ contextState->numFailedAssertions++;
+ contextState->numFailedAssertionsForCurrentTestcase++;
+ contextState->hasCurrentTestFailed = true;
+ }
+ }
+
+ void logTestStart(const TestCase& tc) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)\n", fileForOutput(tc.m_file),
+ lineForOutput(tc.m_line));
+
+ char ts1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(ts1, DOCTEST_COUNTOF(ts1), "TEST SUITE: ");
+ char ts2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(ts2, DOCTEST_COUNTOF(ts2), "%s\n", tc.m_test_suite);
+ char n1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(n1, DOCTEST_COUNTOF(n1), "TEST CASE: ");
+ char n2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(n2, DOCTEST_COUNTOF(n2), "%s\n", tc.m_name);
+ char d1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(d1, DOCTEST_COUNTOF(d1), "DESCRIPTION: ");
+ char d2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(d2, DOCTEST_COUNTOF(d2), "%s\n", tc.m_description);
+
+ // hack for BDD style of macros - to not print "TEST CASE:"
+ char scenario[] = " Scenario:";
+ if (std::string(tc.m_name).substr(0, DOCTEST_COUNTOF(scenario) - 1) == scenario)
+ n1[0] = '\0';
+
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+
+ String forDebugConsole;
+ if (tc.m_description) {
+ DOCTEST_PRINTF_COLORED(d1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(d2, Color::None);
+ forDebugConsole += d1;
+ forDebugConsole += d2;
+ }
+ if (tc.m_test_suite[0] != '\0') {
+ DOCTEST_PRINTF_COLORED(ts1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(ts2, Color::None);
+ forDebugConsole += ts1;
+ forDebugConsole += ts2;
+ }
+ DOCTEST_PRINTF_COLORED(n1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(n2, Color::None);
+
+ String subcaseStuff;
+ std::vector<Subcase>& subcasesStack = contextState->subcasesStack;
+ for (unsigned i = 0; i < subcasesStack.size(); ++i) {
+ if (subcasesStack[i].m_signature.m_name[0] != '\0') {
+ char subcase[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(subcase, DOCTEST_COUNTOF(loc), " %s\n",
+ subcasesStack[i].m_signature.m_name);
+ DOCTEST_PRINTF_COLORED(subcase, Color::None);
+ subcaseStuff += subcase;
+ }
+ }
+
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(getSeparator()) + loc + forDebugConsole.c_str() + n1 + n2 +
+ subcaseStuff.c_str() + "\n");
+ }
+
+ void logTestEnd() {}
+
+ void logTestException(const String& what, bool crash) {
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), "TEST CASE FAILED!\n");
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info1[0] = 0;
+ info2[0] = 0;
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1),
+ crash ? "crashed:\n" : "threw exception:\n");
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), " %s\n", what.c_str());
+
+ std::string contextStr;
+
+ if (!contextState->exceptionalContexts.empty()) {
+ contextStr += "with context:\n";
+ for (size_t i = contextState->exceptionalContexts.size(); i > 0; --i) {
+ contextStr += " ";
+ contextStr += contextState->exceptionalContexts[i - 1];
+ contextStr += "\n";
+ }
+ }
+
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::None);
+ DOCTEST_PRINTF_COLORED(info2, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(contextStr.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(msg) + info1 + info2 + contextStr.c_str() + "\n");
+ }
+
+ String logContext() {
+ std::ostringstream stream;
+ std::vector<IContextScope*>& contexts = contextState->contexts;
+ if (!contexts.empty())
+ stream << "with context:\n";
+ for (size_t i = 0; i < contexts.size(); ++i) {
+ stream << " ";
+ contexts[i]->build(&stream);
+ stream << "\n";
+ }
+ return stream.str().c_str();
+ }
+
+ const char* getFailString(assertType::Enum assert_type) {
+ if (assert_type & assertType::is_warn) //!OCLINT bitwise operator in conditional
+ return "WARNING";
+ if (assert_type & assertType::is_check) //!OCLINT bitwise operator in conditional
+ return "ERROR";
+ if (assert_type & assertType::is_require) //!OCLINT bitwise operator in conditional
+ return "FATAL ERROR";
+ return "";
+ }
+
+ void logAssert(bool passed, const char* decomposition, bool threw, const String& exception,
+ const char* expr, assertType::Enum assert_type, const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ passed ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+ if (threw) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+ else {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "with expansion:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s( %s )\n",
+ getAssertString(assert_type), decomposition);
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ passed ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ void logAssertThrows(bool threw, const char* expr, assertType::Enum assert_type,
+ const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+
+ if (!threw)
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "didn't throw at all\n");
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + context.c_str() + "\n");
+ }
+
+ void logAssertThrowsAs(bool threw, bool threw_as, const char* as, const String& exception,
+ const char* expr, assertType::Enum assert_type, const char* file,
+ int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw_as ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s, %s )\n",
+ getAssertString(assert_type), expr, as);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+
+ if (!threw) { //!OCLINT inverted logic
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "didn't throw at all\n");
+ }
+ else if (!threw_as) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw a different exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw_as ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ void logAssertNothrow(bool threw, const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw ? getFailString(assert_type) : "PASSED");
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+ if (threw) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw ? isWarn ? Color::Yellow : Color::Red : Color::BrightGreen);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ ResultBuilder::ResultBuilder(assertType::Enum assert_type, const char* file, int line,
+ const char* expr, const char* exception_type)
+ : m_assert_type(assert_type)
+ , m_file(file)
+ , m_line(line)
+ , m_expr(expr)
+ , m_exception_type(exception_type)
+ , m_threw(false)
+ , m_threw_as(false)
+ , m_failed(false) {
+#ifdef _MSC_VER
+ if (m_expr[0] == ' ') // this happens when variadic macros are disabled under MSVC
+ ++m_expr;
+#endif // _MSC_VER
+ }
+
+ ResultBuilder::~ResultBuilder() {}
+
+ void ResultBuilder::unexpectedExceptionOccurred() {
+ m_threw = true;
+
+ m_exception = translateActiveException();
+ }
+
+ bool ResultBuilder::log() {
+ if ((m_assert_type & assertType::is_warn) == 0) //!OCLINT bitwise operator in conditional
+ contextState->numAssertionsForCurrentTestcase++;
+
+ if (m_assert_type & assertType::is_throws) { //!OCLINT bitwise operator in conditional
+ m_failed = !m_threw;
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_throws_as) {
+ m_failed = !m_threw_as;
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_nothrow) {
+ m_failed = m_threw;
+ }
+ else {
+ m_failed = m_result;
+ }
+
+ if (m_failed || contextState->success) {
+ DOCTEST_LOG_START();
+
+ if (m_assert_type & assertType::is_throws) { //!OCLINT bitwise operator in conditional
+ logAssertThrows(m_threw, m_expr, m_assert_type, m_file, m_line);
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_throws_as) {
+ logAssertThrowsAs(m_threw, m_threw_as, m_exception_type, m_exception, m_expr,
+ m_assert_type, m_file, m_line);
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_nothrow) {
+ logAssertNothrow(m_threw, m_exception, m_expr, m_assert_type, m_file, m_line);
+ }
+ else {
+ logAssert(m_result.m_passed, m_result.m_decomposition.c_str(), m_threw, m_exception,
+ m_expr, m_assert_type, m_file, m_line);
+ }
+ }
+
+ if (m_failed)
+ addFailedAssert(m_assert_type);
+
+ return m_failed && isDebuggerActive() && !contextState->no_breaks; // break into debugger
+ }
+
+ void ResultBuilder::react() const {
+ if (m_failed && checkIfShouldThrow(m_assert_type))
+ throwException();
+ }
+
+ MessageBuilder::MessageBuilder(const char* file, int line,
+ doctest::detail::assertType::Enum severity)
+ : m_stream(createStream())
+ , m_file(file)
+ , m_line(line)
+ , m_severity(severity) {}
+
+ bool MessageBuilder::log() {
+ DOCTEST_LOG_START();
+
+ bool is_warn = m_severity & doctest::detail::assertType::is_warn;
+
+ // warn is just a message in this context so we dont treat it as an assert
+ if (!is_warn) {
+ contextState->numAssertionsForCurrentTestcase++;
+ addFailedAssert(m_severity);
+ }
+
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(m_file),
+ lineForOutput(m_line));
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ is_warn ? "MESSAGE" : getFailString(m_severity));
+
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg, is_warn ? Color::Yellow : Color::Red);
+
+ String info = getStreamResult(m_stream);
+ if (info.size()) {
+ DOCTEST_PRINTF_COLORED(" ", Color::None);
+ DOCTEST_PRINTF_COLORED(info.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+ }
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + " " + info.c_str() + "\n" + context.c_str() +
+ "\n");
+
+ return isDebuggerActive() && !contextState->no_breaks && !is_warn; // break into debugger
+ }
+
+ void MessageBuilder::react() {
+ if (m_severity & assertType::is_require) //!OCLINT bitwise operator in conditional
+ throwException();
+ }
+
+ MessageBuilder::~MessageBuilder() { freeStream(m_stream); }
+
+ // the implementation of parseFlag()
+ bool parseFlagImpl(int argc, const char* const* argv, const char* pattern) {
+ for (int i = argc - 1; i >= 0; --i) {
+ const char* temp = std::strstr(argv[i], pattern);
+ if (temp && my_strlen(temp) == my_strlen(pattern)) {
+ // eliminate strings in which the chars before the option are not '-'
+ bool noBadCharsFound = true; //!OCLINT prefer early exits and continue
+ while (temp != argv[i]) {
+ if (*--temp != '-') {
+ noBadCharsFound = false;
+ break;
+ }
+ }
+ if (noBadCharsFound && argv[i][0] == '-')
+ return true;
+ }
+ }
+ return false;
+ }
+
+ // locates a flag on the command line
+ bool parseFlag(int argc, const char* const* argv, const char* pattern) {
+#ifndef DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ if (!parseFlagImpl(argc, argv, pattern))
+ return parseFlagImpl(argc, argv, pattern + 3); // 3 for "dt-"
+ return true;
+#else // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ return parseFlagImpl(argc, argv, pattern);
+#endif // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ }
+
+ // the implementation of parseOption()
+ bool parseOptionImpl(int argc, const char* const* argv, const char* pattern, String& res) {
+ for (int i = argc - 1; i >= 0; --i) {
+ const char* temp = std::strstr(argv[i], pattern);
+ if (temp) { //!OCLINT prefer early exits and continue
+ // eliminate matches in which the chars before the option are not '-'
+ bool noBadCharsFound = true;
+ const char* curr = argv[i];
+ while (curr != temp) {
+ if (*curr++ != '-') {
+ noBadCharsFound = false;
+ break;
+ }
+ }
+ if (noBadCharsFound && argv[i][0] == '-') {
+ temp += my_strlen(pattern);
+ unsigned len = my_strlen(temp);
+ if (len) {
+ res = temp;
+ return true;
+ }
+ }
+ }
+ }
+ return false;
+ }
+
+ // parses an option and returns the string after the '=' character
+ bool parseOption(int argc, const char* const* argv, const char* pattern, String& res,
+ const String& defaultVal = String()) {
+ res = defaultVal;
+#ifndef DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ if (!parseOptionImpl(argc, argv, pattern, res))
+ return parseOptionImpl(argc, argv, pattern + 3, res); // 3 for "dt-"
+ return true;
+#else // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ return parseOptionImpl(argc, argv, pattern, res);
+#endif // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ }
+
+ // parses a comma separated list of words after a pattern in one of the arguments in argv
+ bool parseCommaSepArgs(int argc, const char* const* argv, const char* pattern,
+ std::vector<String>& res) {
+ String filtersString;
+ if (parseOption(argc, argv, pattern, filtersString)) {
+ // tokenize with "," as a separator
+ // cppcheck-suppress strtokCalled
+ char* pch = std::strtok(filtersString.c_str(), ","); // modifies the string
+ while (pch != 0) {
+ if (my_strlen(pch))
+ res.push_back(pch);
+ // uses the strtok() internal state to go to the next token
+ // cppcheck-suppress strtokCalled
+ pch = std::strtok(0, ",");
+ }
+ return true;
+ }
+ return false;
+ }
+
+ enum optionType
+ {
+ option_bool,
+ option_int
+ };
+
+ // parses an int/bool option from the command line
+ bool parseIntOption(int argc, const char* const* argv, const char* pattern, optionType type,
+ int& res) {
+ String parsedValue;
+ if (!parseOption(argc, argv, pattern, parsedValue))
+ return false;
+
+ if (type == 0) {
+ // boolean
+ const char positive[][5] = { "1", "true", "on", "yes" }; // 5 - strlen("true") + 1
+ const char negative[][6] = { "0", "false", "off", "no" }; // 6 - strlen("false") + 1
+
+ // if the value matches any of the positive/negative possibilities
+ for (unsigned i = 0; i < 4; i++) {
+ if (parsedValue.compare(positive[i], true) == 0) {
+ res = 1; //!OCLINT parameter reassignment
+ return true;
+ }
+ if (parsedValue.compare(negative[i], true) == 0) {
+ res = 0; //!OCLINT parameter reassignment
+ return true;
+ }
+ }
+ }
+ else {
+ // integer
+ int theInt = std::atoi(parsedValue.c_str()); // NOLINT
+ if (theInt != 0) {
+ res = theInt; //!OCLINT parameter reassignment
+ return true;
+ }
+ }
+ return false;
+ }
+
+ void printVersion() {
+ if (contextState->no_version == false) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("doctest version is \"%s\"\n", DOCTEST_VERSION_STR);
+ }
+ }
+
+ void printHelp() {
+ printVersion();
+ // clang-format off
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("boolean values: \"1/on/yes/true\" or \"0/off/no/false\"\n");
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("filter values: \"str1,str2,str3\" (comma separated strings)\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("filters use wildcards for matching strings\n");
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("something passes a filter if any of the strings in a filter matches\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("ALL FLAGS, OPTIONS AND FILTERS ALSO AVAILABLE WITH A \"dt-\" PREFIX!!!\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("Query flags - the program quits after them. Available:\n\n");
+ std::printf(" -?, --help, -h prints this message\n");
+ std::printf(" -v, --version prints the version\n");
+ std::printf(" -c, --count prints the number of matching tests\n");
+ std::printf(" -ltc, --list-test-cases lists all matching tests by name\n");
+ std::printf(" -lts, --list-test-suites lists all matching test suites\n\n");
+ // ========================================================================================= << 79
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("The available <int>/<string> options/filters are:\n\n");
+ std::printf(" -tc, --test-case=<filters> filters tests by their name\n");
+ std::printf(" -tce, --test-case-exclude=<filters> filters OUT tests by their name\n");
+ std::printf(" -sf, --source-file=<filters> filters tests by their file\n");
+ std::printf(" -sfe, --source-file-exclude=<filters> filters OUT tests by their file\n");
+ std::printf(" -ts, --test-suite=<filters> filters tests by their test suite\n");
+ std::printf(" -tse, --test-suite-exclude=<filters> filters OUT tests by their test suite\n");
+ std::printf(" -sc, --subcase=<filters> filters subcases by their name\n");
+ std::printf(" -sce, --subcase-exclude=<filters> filters OUT subcases by their name\n");
+ std::printf(" -ob, --order-by=<string> how the tests should be ordered\n");
+ std::printf(" <string> - by [file/suite/name/rand]\n");
+ std::printf(" -rs, --rand-seed=<int> seed for random ordering\n");
+ std::printf(" -f, --first=<int> the first test passing the filters to\n");
+ std::printf(" execute - for range-based execution\n");
+ std::printf(" -l, --last=<int> the last test passing the filters to\n");
+ std::printf(" execute - for range-based execution\n");
+ std::printf(" -aa, --abort-after=<int> stop after <int> failed assertions\n");
+ std::printf(" -scfl,--subcase-filter-levels=<int> apply filters for the first <int> levels\n");
+ DOCTEST_PRINTF_COLORED("\n[doctest] ", Color::Cyan);
+ std::printf("Bool options - can be used like flags and true is assumed. Available:\n\n");
+ std::printf(" -s, --success=<bool> include successful assertions in output\n");
+ std::printf(" -cs, --case-sensitive=<bool> filters being treated as case sensitive\n");
+ std::printf(" -e, --exit=<bool> exits after the tests finish\n");
+ std::printf(" -d, --duration=<bool> prints the time duration of each test\n");
+ std::printf(" -nt, --no-throw=<bool> skips exceptions-related assert checks\n");
+ std::printf(" -ne, --no-exitcode=<bool> returns (or exits) always with success\n");
+ std::printf(" -nr, --no-run=<bool> skips all runtime doctest operations\n");
+ std::printf(" -nv, --no-version=<bool> omit the framework version in the output\n");
+ std::printf(" -nc, --no-colors=<bool> disables colors in output\n");
+ std::printf(" -fc, --force-colors=<bool> use colors even when not in a tty\n");
+ std::printf(" -nb, --no-breaks=<bool> disables breakpoints in debuggers\n");
+ std::printf(" -ns, --no-skip=<bool> don't skip test cases marked as skip\n");
+ std::printf(" -npf, --no-path-filenames=<bool> only filenames and no paths in output\n");
+ std::printf(" -nln, --no-line-numbers=<bool> 0 instead of real line numbers in output\n");
+ // ========================================================================================= << 79
+ // clang-format on
+
+ DOCTEST_PRINTF_COLORED("\n[doctest] ", Color::Cyan);
+ std::printf("for more information visit the project documentation\n\n");
+ }
+
+ void printSummary() {
+ const ContextState* p = contextState;
+
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ if (p->count || p->list_test_cases) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("unskipped test cases passing the current filters: %u\n",
+ p->numTestsPassingFilters);
+ }
+ else if (p->list_test_suites) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("unskipped test cases passing the current filters: %u\n",
+ p->numTestsPassingFilters);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("test suites with unskipped test cases passing the current filters: %u\n",
+ p->numTestSuitesPassingFilters);
+ }
+ else {
+ bool anythingFailed = p->numFailed > 0 || p->numFailedAssertions > 0;
+
+ char buff[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "test cases: %6u",
+ p->numTestsPassingFilters);
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d passed",
+ p->numTestsPassingFilters - p->numFailed);
+ DOCTEST_PRINTF_COLORED(buff,
+ (p->numTestsPassingFilters == 0 || anythingFailed) ?
+ Color::None :
+ Color::Green);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6u failed", p->numFailed);
+ DOCTEST_PRINTF_COLORED(buff, p->numFailed > 0 ? Color::Red : Color::None);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ if (p->no_skipped_summary == false) {
+ int numSkipped = static_cast<unsigned>(getRegisteredTests().size()) -
+ p->numTestsPassingFilters;
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d skipped", numSkipped);
+ DOCTEST_PRINTF_COLORED(buff, numSkipped == 0 ? Color::None : Color::Yellow);
+ }
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "assertions: %6d", p->numAssertions);
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d passed",
+ p->numAssertions - p->numFailedAssertions);
+ DOCTEST_PRINTF_COLORED(
+ buff, (p->numAssertions == 0 || anythingFailed) ? Color::None : Color::Green);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d failed", p->numFailedAssertions);
+ DOCTEST_PRINTF_COLORED(buff, p->numFailedAssertions > 0 ? Color::Red : Color::None);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " |\n");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("Status: ", Color::None);
+ const char* result = (p->numFailed > 0) ? "FAILURE!\n" : "SUCCESS!\n";
+ DOCTEST_PRINTF_COLORED(result, p->numFailed > 0 ? Color::Red : Color::Green);
+ }
+
+ // remove any coloring
+ DOCTEST_PRINTF_COLORED("", Color::None);
+ }
+ } // namespace detail
+
+ bool isRunningInTest() { return detail::contextState != 0; }
+
+ Context::Context(int argc, const char* const* argv)
+ : p(new detail::ContextState) {
+ parseArgs(argc, argv, true);
+ }
+
+ Context::~Context() { delete p; }
+
+ void Context::applyCommandLine(int argc, const char* const* argv) { parseArgs(argc, argv); }
+
+ // parses args
+ void Context::parseArgs(int argc, const char* const* argv, bool withDefaults) {
+ using namespace detail;
+
+ // clang-format off
+ parseCommaSepArgs(argc, argv, "dt-source-file=", p->filters[0]);
+ parseCommaSepArgs(argc, argv, "dt-sf=", p->filters[0]);
+ parseCommaSepArgs(argc, argv, "dt-source-file-exclude=", p->filters[1]);
+ parseCommaSepArgs(argc, argv, "dt-sfe=", p->filters[1]);
+ parseCommaSepArgs(argc, argv, "dt-test-suite=", p->filters[2]);
+ parseCommaSepArgs(argc, argv, "dt-ts=", p->filters[2]);
+ parseCommaSepArgs(argc, argv, "dt-test-suite-exclude=", p->filters[3]);
+ parseCommaSepArgs(argc, argv, "dt-tse=", p->filters[3]);
+ parseCommaSepArgs(argc, argv, "dt-test-case=", p->filters[4]);
+ parseCommaSepArgs(argc, argv, "dt-tc=", p->filters[4]);
+ parseCommaSepArgs(argc, argv, "dt-test-case-exclude=", p->filters[5]);
+ parseCommaSepArgs(argc, argv, "dt-tce=", p->filters[5]);
+ parseCommaSepArgs(argc, argv, "dt-subcase=", p->filters[6]);
+ parseCommaSepArgs(argc, argv, "dt-sc=", p->filters[6]);
+ parseCommaSepArgs(argc, argv, "dt-subcase-exclude=", p->filters[7]);
+ parseCommaSepArgs(argc, argv, "dt-sce=", p->filters[7]);
+ // clang-format on
+
+ int intRes = 0;
+ String strRes;
+
+#define DOCTEST_PARSE_AS_BOOL_OR_FLAG(name, sname, var, default) \
+ if(parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), option_bool, intRes) || \
+ parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), option_bool, intRes)) \
+ p->var = !!intRes; \
+ else if(parseFlag(argc, argv, #name) || parseFlag(argc, argv, #sname)) \
+ p->var = true; \
+ else if(withDefaults) \
+ p->var = default
+
+#define DOCTEST_PARSE_INT_OPTION(name, sname, var, default) \
+ if(parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), option_int, intRes) || \
+ parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), option_int, intRes)) \
+ p->var = intRes; \
+ else if(withDefaults) \
+ p->var = default
+
+#define DOCTEST_PARSE_STR_OPTION(name, sname, var, default) \
+ if(parseOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), strRes, default) || \
+ parseOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), strRes, default) || \
+ withDefaults) \
+ p->var = strRes
+
+ // clang-format off
+ DOCTEST_PARSE_STR_OPTION(dt - order - by, dt - ob, order_by, "file");
+ DOCTEST_PARSE_INT_OPTION(dt - rand - seed, dt - rs, rand_seed, 0);
+
+ DOCTEST_PARSE_INT_OPTION(dt - first, dt - f, first, 1);
+ DOCTEST_PARSE_INT_OPTION(dt - last, dt - l, last, 0);
+
+ DOCTEST_PARSE_INT_OPTION(dt - abort - after, dt - aa, abort_after, 0);
+ DOCTEST_PARSE_INT_OPTION(dt - subcase - filter - levels, dt - scfl, subcase_filter_levels, 2000000000);
+
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - success, dt - s, success, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - case-sensitive, dt - cs, case_sensitive, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - exit, dt - e, exit, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - duration, dt - d, duration, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - throw, dt - nt, no_throw, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - exitcode, dt - ne, no_exitcode, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - run, dt - nr, no_run, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - version, dt - nv, no_version, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - colors, dt - nc, no_colors, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - force - colors, dt - fc, force_colors, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - breaks, dt - nb, no_breaks, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - skip, dt - ns, no_skip, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - path - filenames, dt - npf, no_path_in_filenames, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - line - numbers, dt - nln, no_line_numbers, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - skipped - summary, dt - nss, no_skipped_summary, false);
+ // clang-format on
+
+#undef DOCTEST_PARSE_STR_OPTION
+#undef DOCTEST_PARSE_INT_OPTION
+#undef DOCTEST_PARSE_AS_BOOL_OR_FLAG
+
+ if (withDefaults) {
+ p->help = false;
+ p->version = false;
+ p->count = false;
+ p->list_test_cases = false;
+ p->list_test_suites = false;
+ }
+ if (parseFlag(argc, argv, "dt-help") || parseFlag(argc, argv, "dt-h") ||
+ parseFlag(argc, argv, "dt-?")) {
+ p->help = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-version") || parseFlag(argc, argv, "dt-v")) {
+ p->version = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-count") || parseFlag(argc, argv, "dt-c")) {
+ p->count = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-list-test-cases") || parseFlag(argc, argv, "dt-ltc")) {
+ p->list_test_cases = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-list-test-suites") || parseFlag(argc, argv, "dt-lts")) {
+ p->list_test_suites = true;
+ p->exit = true;
+ }
+ }
+
+ // allows the user to add procedurally to the filters from the command line
+ void Context::addFilter(const char* filter, const char* value) { setOption(filter, value); }
+
+ // allows the user to clear all filters from the command line
+ void Context::clearFilters() {
+ for (unsigned i = 0; i < p->filters.size(); ++i)
+ p->filters[i].clear();
+ }
+
+ // allows the user to override procedurally the int/bool options from the command line
+ void Context::setOption(const char* option, int value) {
+ setOption(option, toString(value).c_str());
+ }
+
+ // allows the user to override procedurally the string options from the command line
+ void Context::setOption(const char* option, const char* value) {
+ String argv = String("-") + option + "=" + value;
+ const char* lvalue = argv.c_str();
+ parseArgs(1, &lvalue);
+ }
+
+ // users should query this in their main() and exit the program if true
+ bool Context::shouldExit() { return p->exit; }
+
+ // the main function that does all the filtering and test running
+ int Context::run() {
+ using namespace detail;
+
+ Color::init();
+
+ contextState = p;
+ p->resetRunData();
+
+ // handle version, help and no_run
+ if (p->no_run || p->version || p->help) {
+ if (p->version)
+ printVersion();
+ if (p->help)
+ printHelp();
+
+ contextState = 0;
+
+ return EXIT_SUCCESS;
+ }
+
+ printVersion();
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("run with \"--help\" for options\n");
+
+ unsigned i = 0; // counter used for loops - here for VC6
+
+ std::set<TestCase>& registeredTests = getRegisteredTests();
+
+ std::vector<const TestCase*> testArray;
+ for (std::set<TestCase>::iterator it = registeredTests.begin(); it != registeredTests.end();
+ ++it)
+ testArray.push_back(&(*it));
+
+ // sort the collected records
+ if (!testArray.empty()) {
+ if (p->order_by.compare("file", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), fileOrderComparator);
+ }
+ else if (p->order_by.compare("suite", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), suiteOrderComparator);
+ }
+ else if (p->order_by.compare("name", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), nameOrderComparator);
+ }
+ else if (p->order_by.compare("rand", true) == 0) {
+ std::srand(p->rand_seed);
+
+ // random_shuffle implementation
+ const TestCase** first = &testArray[0];
+ for (i = testArray.size() - 1; i > 0; --i) {
+ int idxToSwap = std::rand() % (i + 1); // NOLINT
+
+ const TestCase* temp = first[i];
+
+ first[i] = first[idxToSwap];
+ first[idxToSwap] = temp;
+ }
+ }
+ }
+
+ if (p->list_test_cases) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("listing all test case names\n");
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ }
+
+ std::set<String> testSuitesPassingFilters;
+ if (p->list_test_suites) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("listing all test suites\n");
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ }
+
+ // invoke the registered functions if they match the filter criteria (or just count them)
+ for (i = 0; i < testArray.size(); i++) {
+ const TestCase& data = *testArray[i];
+
+ if (data.m_skip && !p->no_skip)
+ continue;
+
+ if (!matchesAny(data.m_file, p->filters[0], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_file, p->filters[1], 0, p->case_sensitive))
+ continue;
+ if (!matchesAny(data.m_test_suite, p->filters[2], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_test_suite, p->filters[3], 0, p->case_sensitive))
+ continue;
+ if (!matchesAny(data.m_name, p->filters[4], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_name, p->filters[5], 0, p->case_sensitive))
+ continue;
+
+ p->numTestsPassingFilters++;
+
+ // do not execute the test if we are to only count the number of filter passing tests
+ if (p->count)
+ continue;
+
+ // print the name of the test and don't execute it
+ if (p->list_test_cases) {
+ std::printf("%s\n", data.m_name);
+ continue;
+ }
+
+ // print the name of the test suite if not done already and don't execute it
+ if (p->list_test_suites) {
+ if ((testSuitesPassingFilters.count(data.m_test_suite) == 0) &&
+ data.m_test_suite[0] != '\0') {
+ std::printf("%s\n", data.m_test_suite);
+ testSuitesPassingFilters.insert(data.m_test_suite);
+ p->numTestSuitesPassingFilters++;
+ }
+ continue;
+ }
+
+ // skip the test if it is not in the execution range
+ if ((p->last < p->numTestsPassingFilters && p->first <= p->last) ||
+ (p->first > p->numTestsPassingFilters))
+ continue;
+
+ // execute the test if it passes all the filtering
+ {
+ p->currentTest = &data;
+
+ bool failed = false;
+ p->hasLoggedCurrentTestStart = false;
+ p->numFailedAssertionsForCurrentTestcase = 0;
+ p->subcasesPassed.clear();
+ double duration = 0;
+ Timer timer;
+ timer.start();
+ do {
+ // if the start has been logged from a previous iteration of this loop
+ if (p->hasLoggedCurrentTestStart)
+ logTestEnd();
+ p->hasLoggedCurrentTestStart = false;
+
+ // if logging successful tests - force the start log
+ if (p->success)
+ DOCTEST_LOG_START();
+
+ // reset the assertion state
+ p->numAssertionsForCurrentTestcase = 0;
+ p->hasCurrentTestFailed = false;
+
+ // reset some of the fields for subcases (except for the set of fully passed ones)
+ p->subcasesHasSkipped = false;
+ p->subcasesCurrentLevel = 0;
+ p->subcasesEnteredLevels.clear();
+
+ // reset stuff for logging with INFO()
+ p->exceptionalContexts.clear();
+
+ // execute the test
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ try {
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ FatalConditionHandler fatalConditionHandler; // Handle signals
+ data.m_test();
+ fatalConditionHandler.reset();
+ if (contextState->hasCurrentTestFailed)
+ failed = true;
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+ catch (const TestFailureException&) { failed = true; }
+ catch (...) {
+ DOCTEST_LOG_START();
+ logTestException(translateActiveException());
+ failed = true;
+ }
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+ p->numAssertions += p->numAssertionsForCurrentTestcase;
+
+ // exit this loop if enough assertions have failed
+ if (p->abort_after > 0 && p->numFailedAssertions >= p->abort_after) {
+ p->subcasesHasSkipped = false;
+ DOCTEST_PRINTF_COLORED("Aborting - too many failed asserts!\n", Color::Red);
+ }
+
+ } while (p->subcasesHasSkipped == true);
+
+ duration = timer.getElapsedSeconds();
+
+ if (Approx(p->currentTest->m_timeout).epsilon(DBL_EPSILON) != 0 &&
+ Approx(duration).epsilon(DBL_EPSILON) > p->currentTest->m_timeout) {
+ failed = true;
+ DOCTEST_LOG_START();
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg),
+ "Test case exceeded time limit of %.6f!\n",
+ p->currentTest->m_timeout);
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ }
+
+ if (p->duration) {
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), "%.6f s: %s\n", duration,
+ p->currentTest->m_name);
+ DOCTEST_PRINTF_COLORED(msg, Color::None);
+ }
+
+ if (data.m_should_fail) {
+ DOCTEST_LOG_START();
+ if (failed) {
+ failed = false;
+ DOCTEST_PRINTF_COLORED("Failed as expected so marking it as not failed\n",
+ Color::Yellow);
+ }
+ else {
+ failed = true;
+ DOCTEST_PRINTF_COLORED("Should have failed but didn't! Marking it as failed!\n",
+ Color::Red);
+ }
+ }
+ else if (failed && data.m_may_fail) {
+ DOCTEST_LOG_START();
+ failed = false;
+ DOCTEST_PRINTF_COLORED("Allowed to fail so marking it as not failed\n",
+ Color::Yellow);
+ }
+ else if (data.m_expected_failures > 0) {
+ DOCTEST_LOG_START();
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ if (p->numFailedAssertionsForCurrentTestcase == data.m_expected_failures) {
+ failed = false;
+ DOCTEST_SNPRINTF(
+ msg, DOCTEST_COUNTOF(msg),
+ "Failed exactly %d times as expected so marking it as not failed!\n",
+ data.m_expected_failures);
+ DOCTEST_PRINTF_COLORED(msg, Color::Yellow);
+ }
+ else {
+ failed = true;
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg),
+ "Didn't fail exactly %d times so marking it as failed!\n",
+ data.m_expected_failures);
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ }
+ }
+
+ if (p->hasLoggedCurrentTestStart)
+ logTestEnd();
+
+ if (failed) // if any subcase has failed - the whole test case has failed
+ p->numFailed++;
+
+ // stop executing tests if enough assertions have failed
+ if (p->abort_after > 0 && p->numFailedAssertions >= p->abort_after)
+ break;
+ }
+ }
+
+ printSummary();
+
+ contextState = 0;
+
+ if (p->numFailed && !p->no_exitcode)
+ return EXIT_FAILURE;
+ return EXIT_SUCCESS;
+ }
+} // namespace doctest
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+#ifdef DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+int main(int argc, char** argv) { return doctest::Context(argc, argv).run(); }
+#endif // DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+
+#endif // DOCTEST_LIBRARY_IMPLEMENTATION
+#endif // DOCTEST_CONFIG_IMPLEMENT
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
\ No newline at end of file
diff --git a/SCwin/main.cpp b/SCwin/main.cpp
index 488baa7ac03e4d05a0590c23d832fe802200a070..717c72738dad107f146db343b5247236f9aaa429 100644
--- a/SCwin/main.cpp
+++ b/SCwin/main.cpp
@@ -1,20 +1,6 @@
-#pragma once
#include "stdafx.h"
-#include "structs.h"
#include "mains.h"
-#include "parameter.h"
-#include "dataParser.h"
-#include "print.h"
-#include "operation.h"
-#include "dtw.h"
-#include "lcss.h"
-#include "pdtw.h"
-#include "help.h"
-#include "calcul.h"
-#include "draw.h"
-
-#include <random>
using namespace std;
@@ -24,80 +10,7 @@ int main(int argc, char **argv)
for (int i = 1; i < argc; i++)
args.push_back(argv[i]);
- mains::entry_main(args);
-
- //vector<string> scripts;
- //for (size_t i = 0; i < args.size() - 1; i++)
- //{
- // if (args[i] == "-script")
- // {
- // scripts = dataParser::readFileByLine(args[i + 1]);
- // break;
- // }
- //}
- //
- //if (scripts.size() > 0)
- //{
- // //size_t start = args.size() >= 3 ? stoi(args[2]) - 1 : 0;
- // //size_t end = args.size() == 4 ? stoi(args[3]) : scripts.size();
- // for (size_t i = 0; i < scripts.size(); i++)
- // {
- // auto argsSub = help::split(scripts[i], " \t");
- // parameter::parameterPriority(argsSub, args);
- // mains::mainLogic(argsSub);
- // }
- //}
- //else
- // mains::mainLogic(args);
+ mains::main_entry(args);
return 0;
-}
-
-//auto f = dataParser::getFolderFileNames("c:\\code\\data\\sc\\shs_cut_chord_distances");
-//auto c = dataParser::getClusters(f, "c:\\code\\data\\sh\\cTrainCut.txt");
-//
-//vtr2<int> mx(999);
-//for (size_t i = 0; i < 999; i++)
-//{
-// vtr<int> row(999);
-// mx[i] = row;
-//}
-
-//std::random_device rd;
-//std::mt19937 gen(rd());
-
-//for (size_t u = 0; u < 100; u++)
-//{
-// for (size_t i = 0; i < 999; i++)
-// {
-// int min = 1;
-// int max = 999;
-// int cc = 0;
-// map<int, int> isIn;
-// for (int j = 0; j < 999; j++)
-// {
-// std::uniform_int_distribution<int> dis(min, max);
-// while (true) {
-// int tmp = dis(gen);
-
-// if (isIn.count(tmp) > 0)
-// {
-// if (tmp == max)
-// while (isIn.count(max) > 0) {
-// max--;
-// }
-// }
-// else {
-// isIn[tmp] = tmp;
-// mx[j][i] = tmp;
-// cc++;
-// break;
-// }
-// }
-// }
-// //cout << cc << endl;
-// }
-
-// auto s = calcul::scoreMap(mx, c);
-// cout << s[999] << endl;
-//}
\ No newline at end of file
+}
\ No newline at end of file
diff --git a/SequenceComparison.sln b/SequenceComparison.sln
index c152e7de57c52c521eff9b93336a83af5a2bc574..7af9028fb7c0ec8c166bde19ff86f20213bf4904 100644
--- a/SequenceComparison.sln
+++ b/SequenceComparison.sln
@@ -1,7 +1,7 @@
Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio 15
-VisualStudioVersion = 15.0.26430.15
+VisualStudioVersion = 15.0.26730.3
MinimumVisualStudioVersion = 10.0.40219.1
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "SequenceComparison", "SequenceComparison\SequenceComparison.vcxitems", "{47CB85A2-54D1-498A-80ED-BBB0B2D2F55F}"
EndProject
@@ -17,16 +17,17 @@ Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cimglib", "..\cimglib\cimgl
EndProject
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "sclinuxso", "sclinuxso\sclinuxso.vcxproj", "{9FD8B983-5F44-447D-851A-B25D54393FE3}"
EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cimg", "cimg\cimg.vcxproj", "{DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}"
-EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "wraper", "wraper\wraper.csproj", "{EACB9AAB-8B70-4E9F-9F2B-DA2A4B24050F}"
EndProject
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "scdll", "scdll\scdll.vcxproj", "{2B5BAB52-04E3-43F7-8C69-4E8B5E89E9EE}"
EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unit", "unit\unit.vcxproj", "{751DD303-54B9-468C-816F-646EA93E6E93}"
+EndProject
Global
GlobalSection(SharedMSBuildProjectFiles) = preSolution
SequenceComparison\SequenceComparison.vcxitems*{2b5bab52-04e3-43f7-8c69-4e8b5e89e9ee}*SharedItemsImports = 4
SequenceComparison\SequenceComparison.vcxitems*{47cb85a2-54d1-498a-80ed-bbb0b2d2f55f}*SharedItemsImports = 9
+ SequenceComparison\SequenceComparison.vcxitems*{751dd303-54b9-468c-816f-646ea93e6e93}*SharedItemsImports = 4
SequenceComparison\SequenceComparison.vcxitems*{7ba89670-c925-4ec3-9a96-067a96af2ef7}*SharedItemsImports = 4
SequenceComparison\SequenceComparison.vcxitems*{812016bb-1791-487e-8d44-e176ea73030e}*SharedItemsImports = 4
SequenceComparison\SequenceComparison.vcxitems*{968aae29-89f6-408c-a27f-435b9ead9f7e}*SharedItemsImports = 4
@@ -118,18 +119,6 @@ Global
{9FD8B983-5F44-447D-851A-B25D54393FE3}.Release|x64.Build.0 = Release|x64
{9FD8B983-5F44-447D-851A-B25D54393FE3}.Release|x86.ActiveCfg = Release|x86
{9FD8B983-5F44-447D-851A-B25D54393FE3}.Release|x86.Build.0 = Release|x86
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|Any CPU.ActiveCfg = Debug|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|ARM.ActiveCfg = Debug|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|x64.ActiveCfg = Debug|x64
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|x64.Build.0 = Debug|x64
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|x86.ActiveCfg = Debug|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Debug|x86.Build.0 = Debug|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|Any CPU.ActiveCfg = Release|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|ARM.ActiveCfg = Release|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|x64.ActiveCfg = Release|x64
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|x64.Build.0 = Release|x64
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|x86.ActiveCfg = Release|Win32
- {DD81DA8B-F92B-4E3D-AA9D-B39C8AE0F4A3}.Release|x86.Build.0 = Release|Win32
{EACB9AAB-8B70-4E9F-9F2B-DA2A4B24050F}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{EACB9AAB-8B70-4E9F-9F2B-DA2A4B24050F}.Debug|Any CPU.Build.0 = Debug|Any CPU
{EACB9AAB-8B70-4E9F-9F2B-DA2A4B24050F}.Debug|ARM.ActiveCfg = Debug|Any CPU
@@ -158,8 +147,23 @@ Global
{2B5BAB52-04E3-43F7-8C69-4E8B5E89E9EE}.Release|x64.Build.0 = Release|x64
{2B5BAB52-04E3-43F7-8C69-4E8B5E89E9EE}.Release|x86.ActiveCfg = Release|Win32
{2B5BAB52-04E3-43F7-8C69-4E8B5E89E9EE}.Release|x86.Build.0 = Release|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|Any CPU.ActiveCfg = Debug|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|ARM.ActiveCfg = Debug|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|x64.ActiveCfg = Debug|x64
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|x64.Build.0 = Debug|x64
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|x86.ActiveCfg = Debug|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Debug|x86.Build.0 = Debug|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|Any CPU.ActiveCfg = Release|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|ARM.ActiveCfg = Release|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|x64.ActiveCfg = Release|x64
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|x64.Build.0 = Release|x64
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|x86.ActiveCfg = Release|Win32
+ {751DD303-54B9-468C-816F-646EA93E6E93}.Release|x86.Build.0 = Release|Win32
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
EndGlobalSection
+ GlobalSection(ExtensibilityGlobals) = postSolution
+ SolutionGuid = {62DC8242-8506-42AB-A0DD-41F95FCA2688}
+ EndGlobalSection
EndGlobal
diff --git a/SequenceComparison/CMakeLists.txt b/SequenceComparison/CMakeLists.txt
new file mode 100644
index 0000000000000000000000000000000000000000..4f4778e308d1e22dd16ce5e659a2eead929a6ab6
--- /dev/null
+++ b/SequenceComparison/CMakeLists.txt
@@ -0,0 +1,122 @@
+cmake_minimum_required(VERSION 3.2)
+
+#set(CMAKE_VERBOSE_MAKEFILE on)
+project(pmsa)
+
+if(NOT CMAKE_BUILD_TYPE)
+ set(CMAKE_BUILD_TYPE Release)
+endif()
+
+set(CMAKE_CXX_FLAGS "-std=c++14 -Wall -pedantic -lstdc++fs -lX11")
+set(CMAKE_CXX_FLAGS_RELEASE "-O3")
+set(CMAKE_CXX_FLAGS_DEBUG "-g")
+
+find_package(OpenMP)
+if(OPENMP_FOUND)
+ message(STATUS "STATUS: openmp found")
+ set (CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${OpenMP_CXX_FLAGS}")
+endif()
+
+if(MPI_FOUND)
+ message(STATUS "STATUS: mpi found")
+else()
+ message(STATUS "STATUS: mpi not found")
+endif()
+
+if(X11_FOUND)
+ message(STATUS "STATUS: X11 found")
+else()
+ message(STATUS "STATUS: X11 not found")
+endif()
+
+
+SET(DEPEND_EXT
+ /usr/lib/x86_64-linux-gnu/libX11.so
+ /usr/lib/gcc/x86_64-linux-gnu/7.2.0/libstdc++fs.a
+)
+
+add_library(msalib
+ mains.cpp
+ parameter.cpp
+ calcul.cpp
+ help.cpp
+ parser.cpp
+ operation.cpp
+ dtw.cpp
+ lcss.cpp
+ print.cpp
+)
+
+add_executable(
+ msa
+ main.cpp
+ #mains.cpp
+ #parameter.cpp
+ #help.cpp
+ #parser.cpp
+ #operation.cpp
+ #dtw.cpp
+ #lcss.cpp
+ #calcul.cpp
+ #print.cpp
+)
+
+target_link_libraries(msa msalib ${DEPEND_EXT})
+
+add_executable(
+ unit
+ unitmain.cpp
+ ut_dtw.cpp
+ ut_op.cpp
+ ut_help.cpp
+)
+
+target_link_libraries(unit msalib ${DEPEND_EXT} )
+
+#add_library(help_o help.cpp)
+#add_library(calcul_o calcul.cpp)
+#add_library(parameter_o parameter.cpp)
+#add_library(dtw_o dtw.cpp)
+#add_library(lcss_o lcss.cpp)
+#add_library(print_o print.cpp)
+#add_library(dataParser_o dataParser.cpp)
+
+#set(DEPEND_MSA
+# parameter_o
+# help_o
+# calcul_o
+# dtw_o
+# lcss_o
+#)
+#
+#set(DEPEND_UNIT
+# parameter_o
+# help_o
+# calcul_o
+# dtw_o
+#)
+#
+#add_executable(
+# msa
+# main.cpp
+# mains.cpp
+# dataParser.cpp
+# operation.cpp
+# print.cpp
+#)
+#
+#add_executable(
+# unit
+# unitmain.cpp
+# ut_dtw.cpp
+#)
+#
+#SET(DEPEND_EXT
+# /usr/lib//x86_64-linux-gnu/libX11.so
+# /usr/lib/gcc/x86_64-linux-gnu/7.1.0/libstdc++fs.a
+#)
+#
+#target_link_libraries(msa ${DEPEND_MSA} ${DEPEND_EXT})
+#target_link_libraries(unit ${DEPEND_UNIT} ${DEPEND_EXT})
+
+#set_target_properties(msa PROPERTIES PREFIX "")
\ No newline at end of file
diff --git a/SequenceComparison/SequenceComparison.vcxitems b/SequenceComparison/SequenceComparison.vcxitems
index 08e81ca1d44ec6cbde16601c9ae30c603bffda7b..7548d0eefa6f217b3e5bd33b1ed08aa138b91927 100644
--- a/SequenceComparison/SequenceComparison.vcxitems
+++ b/SequenceComparison/SequenceComparison.vcxitems
@@ -16,7 +16,8 @@
<ItemGroup>
<ClInclude Include="$(MSBuildThisFileDirectory)calcul.h" />
<ClInclude Include="$(MSBuildThisFileDirectory)CImg.h" />
- <ClInclude Include="$(MSBuildThisFileDirectory)dataParser.h" />
+ <ClInclude Include="$(MSBuildThisFileDirectory)parser.h" />
+ <ClInclude Include="$(MSBuildThisFileDirectory)doctest.h" />
<ClInclude Include="$(MSBuildThisFileDirectory)matrix.h" />
<ClInclude Include="$(MSBuildThisFileDirectory)draw.h" />
<ClInclude Include="$(MSBuildThisFileDirectory)dtw.h" />
@@ -35,7 +36,7 @@
</ItemGroup>
<ItemGroup>
<ClCompile Include="$(MSBuildThisFileDirectory)calcul.cpp" />
- <ClCompile Include="$(MSBuildThisFileDirectory)dataParser.cpp">
+ <ClCompile Include="$(MSBuildThisFileDirectory)parser.cpp">
<AdditionalOptions>
</AdditionalOptions>
<CompileAs>CompileAsCpp</CompileAs>
@@ -60,4 +61,7 @@
<ExcludedFromBuild>false</ExcludedFromBuild>
</ClInclude>
</ItemGroup>
+ <ItemGroup>
+ <Text Include="$(MSBuildThisFileDirectory)CMakeLists.txt" />
+ </ItemGroup>
</Project>
\ No newline at end of file
diff --git a/SequenceComparison/calcul.cpp b/SequenceComparison/calcul.cpp
index 18edf387d44c3d74b7bea643a49222620b2dce17..147e6eb1bebfb61f2eaa4c3a7e646e8764b98f73 100644
--- a/SequenceComparison/calcul.cpp
+++ b/SequenceComparison/calcul.cpp
@@ -434,12 +434,7 @@ double calcul::score_multi_dtw(vtr3<double> const &input, vtr3<double> const &ou
double calcul::score_averageRank(int ref, vtr<int> const &queryAnswer, input_clusters const &clusters)
{
- int clusterSize = 0;
-
- /*if (clusters.size.size() < ref)
- return 0;
- else*/
- clusterSize = clusters.getClusterSize(ref);
+ int clusterSize = clusters.getClusterSize(ref);
int counter = 0;
double averageRank = 0;
@@ -447,7 +442,7 @@ double calcul::score_averageRank(int ref, vtr<int> const &queryAnswer, input_clu
{
if (clusters.getClusterID(queryAnswer[i]) == clusters.getClusterID(ref))
{
- averageRank += (int)i+1;
+ averageRank += (int)i + 1;
counter++;
if (counter == clusterSize - 1)
break;
@@ -460,12 +455,7 @@ double calcul::score_averageRank(int ref, vtr<int> const &queryAnswer, input_clu
double calcul::score_averagePrecision(int ref, vtr<int> const &queryAnswer, input_clusters const &clusters)
{
- int clusterSize = 0;
-
- /*if (clusters.size.size() < ref)
- return 0;
- else*/
- clusterSize = clusters.getClusterSize(ref);
+ int clusterSize = clusters.getClusterSize(ref);
double pr = 0;
int counter = 0;
@@ -514,12 +504,7 @@ double calcul::score_map(vtr<double> const &averagePrecisions)
double calcul::score_precision(int ref, vtr<int> const &queryAnswer, input_clusters const &clusters)
{
- int clusterSize = 0;
-
- /*if (clusters.size.size() < ref)
- return 0;
- else*/
- clusterSize = clusters.getClusterSize(ref);
+ int clusterSize = clusters.getClusterSize(ref);
int truePositives = 0;
int falsePositives = 0;
diff --git a/SequenceComparison/doctest.h b/SequenceComparison/doctest.h
new file mode 100644
index 0000000000000000000000000000000000000000..27431bd5a5c8ee4776492d4b565b7133e8359479
--- /dev/null
+++ b/SequenceComparison/doctest.h
@@ -0,0 +1,5767 @@
+// ======================================================================
+// == DO NOT MODIFY THIS FILE BY HAND - IT IS AUTO GENERATED BY CMAKE! ==
+// ======================================================================
+//
+// doctest.h - the lightest feature-rich C++ single-header testing framework for unit tests and TDD
+//
+// Copyright (c) 2016-2017 Viktor Kirilov
+//
+// Distributed under the MIT Software License
+// See accompanying file LICENSE.txt or copy at
+// https://opensource.org/licenses/MIT
+//
+// The documentation can be found at the library's page:
+// https://github.com/onqtam/doctest/blob/master/doc/markdown/readme.md
+//
+// =================================================================================================
+// =================================================================================================
+// =================================================================================================
+//
+// The library is heavily influenced by Catch - https://github.com/philsquared/Catch
+// which uses the Boost Software License - Version 1.0
+// see here - https://github.com/philsquared/Catch/blob/master/LICENSE_1_0.txt
+//
+// The concept of subcases (sections in Catch) and expression decomposition are from there.
+// Some parts of the code are taken directly:
+// - stringification - the detection of "ostream& operator<<(ostream&, const T&)" and StringMaker<>
+// - the Approx() helper class for floating point comparison
+// - colors in the console
+// - breaking into a debugger
+// - signal / SEH handling
+// - timer
+//
+// The expression decomposing templates are taken from lest - https://github.com/martinmoene/lest
+// which uses the Boost Software License - Version 1.0
+// see here - https://github.com/martinmoene/lest/blob/master/LICENSE_1_0.txt
+//
+// The type list and the foreach algorithm on it for C++98 are taken from Loki
+// - http://loki-lib.sourceforge.net/
+// - https://en.wikipedia.org/wiki/Loki_%28C%2B%2B%29
+// - https://github.com/snaewe/loki-lib
+// which uses the MIT Software License
+//
+// =================================================================================================
+// =================================================================================================
+// =================================================================================================
+
+// Suppress this globally (without push/pop) - there is no way to silence it in the
+// expression decomposition macros _Pragma() in macros doesn't work for the c++ front-end of g++
+// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=55578
+// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=69543
+// Also the warning is completely worthless nowadays - http://stackoverflow.com/questions/14016993
+#if defined(__GNUC__) && !defined(__clang__)
+#pragma GCC diagnostic ignored "-Waggregate-return"
+#endif
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunknown-pragmas"
+#pragma clang diagnostic ignored "-Wnon-virtual-dtor"
+#pragma clang diagnostic ignored "-Wweak-vtables"
+#pragma clang diagnostic ignored "-Wpadded"
+#pragma clang diagnostic ignored "-Wdeprecated"
+#pragma clang diagnostic ignored "-Wmissing-prototypes"
+#pragma clang diagnostic ignored "-Wunused-local-typedef"
+#pragma clang diagnostic ignored "-Wzero-as-null-pointer-constant"
+#pragma clang diagnostic ignored "-Wc++11-long-long"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wunknown-pragmas"
+#pragma GCC diagnostic ignored "-Weffc++"
+#pragma GCC diagnostic ignored "-Wstrict-overflow"
+#pragma GCC diagnostic ignored "-Wstrict-aliasing"
+#pragma GCC diagnostic ignored "-Wctor-dtor-privacy"
+#pragma GCC diagnostic ignored "-Wmissing-declarations"
+#pragma GCC diagnostic ignored "-Wnon-virtual-dtor"
+#pragma GCC diagnostic ignored "-Winline"
+#pragma GCC diagnostic ignored "-Wlong-long"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic ignored "-Wzero-as-null-pointer-constant"
+#endif // > gcc 4.6
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 7)
+#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
+#endif // > gcc 4.7
+#if __GNUC__ > 5 || (__GNUC__ == 5 && __GNUC_MINOR__ > 3)
+#pragma GCC diagnostic ignored "-Wuseless-cast"
+#endif // > gcc 5.3
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4996) // The compiler encountered a deprecated declaration
+#pragma warning(disable : 4706) // assignment within conditional expression
+#pragma warning(disable : 4512) // 'class' : assignment operator could not be generated
+#pragma warning(disable : 4127) // conditional expression is constant
+#endif // _MSC_VER
+
+#ifndef DOCTEST_LIBRARY_INCLUDED
+#define DOCTEST_LIBRARY_INCLUDED
+
+#define DOCTEST_VERSION_MAJOR 1
+#define DOCTEST_VERSION_MINOR 2
+#define DOCTEST_VERSION_PATCH 1
+#define DOCTEST_VERSION_STR "1.2.1"
+
+#define DOCTEST_VERSION \
+ (DOCTEST_VERSION_MAJOR * 10000 + DOCTEST_VERSION_MINOR * 100 + DOCTEST_VERSION_PATCH)
+
+// =================================================================================================
+// == FEATURE DETECTION ============================================================================
+// =================================================================================================
+
+#if __cplusplus >= 201103L
+#ifndef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#ifndef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#ifndef DOCTEST_CONFIG_WITH_NULLPTR
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+#ifndef DOCTEST_CONFIG_WITH_LONG_LONG
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#ifndef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // __cplusplus >= 201103L
+
+#ifndef __has_feature
+#define __has_feature(x) 0
+#endif // __has_feature
+
+// MSVC C++11 feature support table: https://msdn.microsoft.com/en-us/library/hh567368.aspx
+// GCC C++11 feature support table: https://gcc.gnu.org/projects/cxx-status.html
+// MSVC version table:
+// MSVC++ 15.0 _MSC_VER == 1910 (Visual Studio 2017)
+// MSVC++ 14.0 _MSC_VER == 1900 (Visual Studio 2015)
+// MSVC++ 12.0 _MSC_VER == 1800 (Visual Studio 2013)
+// MSVC++ 11.0 _MSC_VER == 1700 (Visual Studio 2012)
+// MSVC++ 10.0 _MSC_VER == 1600 (Visual Studio 2010)
+// MSVC++ 9.0 _MSC_VER == 1500 (Visual Studio 2008)
+// MSVC++ 8.0 _MSC_VER == 1400 (Visual Studio 2005)
+
+// deleted functions
+
+#ifndef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#if defined(_MSC_VER) && (_MSC_VER >= 1800)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // _MSC_VER
+#if defined(__clang__) && __has_feature(cxx_deleted_functions)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 4) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // __GNUC__
+#endif // DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+
+#if defined(DOCTEST_CONFIG_NO_DELETED_FUNCTIONS) && defined(DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS)
+#undef DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS
+#endif // DOCTEST_CONFIG_NO_DELETED_FUNCTIONS
+
+// rvalue references
+
+#ifndef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#if defined(_MSC_VER) && (_MSC_VER >= 1600)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // _MSC_VER
+#if defined(__clang__) && __has_feature(cxx_rvalue_references)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 3) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // __GNUC__
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+#if defined(DOCTEST_CONFIG_NO_RVALUE_REFERENCES) && defined(DOCTEST_CONFIG_WITH_RVALUE_REFERENCES)
+#undef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+#endif // DOCTEST_CONFIG_NO_RVALUE_REFERENCES
+
+// nullptr
+
+#ifndef DOCTEST_CONFIG_WITH_NULLPTR
+#if defined(__clang__) && __has_feature(cxx_nullptr)
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 6) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // __GNUC__
+#if defined(_MSC_VER) && (_MSC_VER >= 1600) // MSVC 2010
+#define DOCTEST_CONFIG_WITH_NULLPTR
+#endif // _MSC_VER
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+#if defined(DOCTEST_CONFIG_NO_NULLPTR) && defined(DOCTEST_CONFIG_WITH_NULLPTR)
+#undef DOCTEST_CONFIG_WITH_NULLPTR
+#endif // DOCTEST_CONFIG_NO_NULLPTR
+
+// variadic macros
+
+#ifndef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#if defined(_MSC_VER) && _MSC_VER > 1400 && !defined(__EDGE__)
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // _MSC_VER
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 1) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // __GNUC__ and clang
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#if defined(DOCTEST_CONFIG_NO_VARIADIC_MACROS) && defined(DOCTEST_CONFIG_WITH_VARIADIC_MACROS)
+#undef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // DOCTEST_CONFIG_NO_VARIADIC_MACROS
+
+// long long
+
+#ifndef DOCTEST_CONFIG_WITH_LONG_LONG
+#if defined(_MSC_VER) && (_MSC_VER >= 1400)
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // _MSC_VER
+#if(defined(__clang__) || \
+ (defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 5) || __GNUC__ > 4))) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // __GNUC__ and clang
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#if defined(DOCTEST_CONFIG_NO_LONG_LONG) && defined(DOCTEST_CONFIG_WITH_LONG_LONG)
+#undef DOCTEST_CONFIG_WITH_LONG_LONG
+#endif // DOCTEST_CONFIG_NO_LONG_LONG
+
+// static_assert
+
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#if defined(__clang__) && __has_feature(cxx_static_assert)
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // __clang__
+#if defined(__GNUC__) && ((__GNUC__ == 4 && __GNUC_MINOR__ >= 3) || __GNUC__ > 4) && \
+ defined(__GXX_EXPERIMENTAL_CXX0X__)
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // __GNUC__
+#if defined(_MSC_VER) && (_MSC_VER >= 1600) // MSVC 2010
+#define DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // _MSC_VER
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+#if defined(DOCTEST_CONFIG_NO_STATIC_ASSERT) && defined(DOCTEST_CONFIG_WITH_STATIC_ASSERT)
+#undef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#endif // DOCTEST_CONFIG_NO_STATIC_ASSERT
+
+// other stuff...
+
+#if defined(DOCTEST_CONFIG_WITH_RVALUE_REFERENCES) || defined(DOCTEST_CONFIG_WITH_LONG_LONG) || \
+ defined(DOCTEST_CONFIG_WITH_DELETED_FUNCTIONS) || defined(DOCTEST_CONFIG_WITH_NULLPTR) || \
+ defined(DOCTEST_CONFIG_WITH_VARIADIC_MACROS) || defined(DOCTEST_CONFIG_WITH_STATIC_ASSERT)
+#define DOCTEST_NO_CPP11_COMPAT
+#endif // c++11 stuff
+
+#if defined(__clang__) && defined(DOCTEST_NO_CPP11_COMPAT)
+#pragma clang diagnostic ignored "-Wc++98-compat"
+#pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif // __clang__ && DOCTEST_NO_CPP11_COMPAT
+
+#if defined(_MSC_VER) && !defined(DOCTEST_CONFIG_WINDOWS_SEH)
+#define DOCTEST_CONFIG_WINDOWS_SEH
+#endif // _MSC_VER
+#if defined(DOCTEST_CONFIG_NO_WINDOWS_SEH) && defined(DOCTEST_CONFIG_WINDOWS_SEH)
+#undef DOCTEST_CONFIG_WINDOWS_SEH
+#endif // DOCTEST_CONFIG_NO_WINDOWS_SEH
+
+#if !defined(_WIN32) && !defined(__QNX__) && !defined(DOCTEST_CONFIG_POSIX_SIGNALS)
+#define DOCTEST_CONFIG_POSIX_SIGNALS
+#endif // _WIN32
+#if defined(DOCTEST_CONFIG_NO_POSIX_SIGNALS) && defined(DOCTEST_CONFIG_POSIX_SIGNALS)
+#undef DOCTEST_CONFIG_POSIX_SIGNALS
+#endif // DOCTEST_CONFIG_NO_POSIX_SIGNALS
+
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+#if defined(__GNUC__) && !defined(__EXCEPTIONS)
+#define DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // clang and gcc
+// in MSVC _HAS_EXCEPTIONS is defined in a header instead of as a project define
+// so we can't do the automatic detection for MSVC without including some header
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+#define DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#if defined(DOCTEST_CONFIG_NO_EXCEPTIONS) && !defined(DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS)
+#define DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS && !DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+
+#if defined(DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN) && !defined(DOCTEST_CONFIG_IMPLEMENT)
+#define DOCTEST_CONFIG_IMPLEMENT
+#endif // DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+
+#if defined _WIN32 || defined __CYGWIN__
+#ifdef __GNUC__
+#define DOCTEST_SYMBOL_EXPORT __attribute__((dllexport))
+#define DOCTEST_SYMBOL_IMPORT __attribute__((dllimport))
+#else // __GNUC__
+#define DOCTEST_SYMBOL_EXPORT __declspec(dllexport)
+#define DOCTEST_SYMBOL_IMPORT __declspec(dllimport)
+#endif // __GNUC__
+#else // _WIN32
+#define DOCTEST_SYMBOL_EXPORT __attribute__((visibility("default")))
+#define DOCTEST_SYMBOL_IMPORT
+#endif // _WIN32
+
+#ifdef DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+#ifdef DOCTEST_CONFIG_IMPLEMENT
+#define DOCTEST_INTERFACE DOCTEST_SYMBOL_EXPORT
+#else // DOCTEST_CONFIG_IMPLEMENT
+#define DOCTEST_INTERFACE DOCTEST_SYMBOL_IMPORT
+#endif // DOCTEST_CONFIG_IMPLEMENT
+#else // DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+#define DOCTEST_INTERFACE
+#endif // DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
+
+#ifdef _MSC_VER
+#define DOCTEST_NOINLINE __declspec(noinline)
+#else // _MSC_VER
+#define DOCTEST_NOINLINE __attribute__((noinline))
+#endif // _MSC_VER
+
+#ifndef DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK
+#define DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK 5
+#endif // DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK
+
+// =================================================================================================
+// == FEATURE DETECTION END ========================================================================
+// =================================================================================================
+
+// internal macros for string concatenation and anonymous variable name generation
+#define DOCTEST_CAT_IMPL(s1, s2) s1##s2
+#define DOCTEST_CAT(s1, s2) DOCTEST_CAT_IMPL(s1, s2)
+#ifdef __COUNTER__ // not standard and may be missing for some compilers
+#define DOCTEST_ANONYMOUS(x) DOCTEST_CAT(x, __COUNTER__)
+#else // __COUNTER__
+#define DOCTEST_ANONYMOUS(x) DOCTEST_CAT(x, __LINE__)
+#endif // __COUNTER__
+
+// macro for making a string out of an identifier
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TOSTR_IMPL(...) #__VA_ARGS__
+#define DOCTEST_TOSTR(...) DOCTEST_TOSTR_IMPL(__VA_ARGS__)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TOSTR_IMPL(x) #x
+#define DOCTEST_TOSTR(x) DOCTEST_TOSTR_IMPL(x)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+// for concatenating literals and making the result a string
+#define DOCTEST_STR_CONCAT_TOSTR(s1, s2) DOCTEST_TOSTR(s1) DOCTEST_TOSTR(s2)
+
+// counts the number of elements in a C string
+#define DOCTEST_COUNTOF(x) (sizeof(x) / sizeof(x[0]))
+
+#ifndef DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+#define DOCTEST_REF_WRAP(x) x&
+#else // DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+#define DOCTEST_REF_WRAP(x) x
+#endif // DOCTEST_CONFIG_ASSERTION_PARAMETERS_BY_VALUE
+
+// not using __APPLE__ because... this is how Catch does it
+#if defined(__MAC_OS_X_VERSION_MIN_REQUIRED)
+#define DOCTEST_PLATFORM_MAC
+#elif defined(__IPHONE_OS_VERSION_MIN_REQUIRED)
+#define DOCTEST_PLATFORM_IPHONE
+#elif defined(_WIN32) || defined(_MSC_VER)
+#define DOCTEST_PLATFORM_WINDOWS
+#else
+#define DOCTEST_PLATFORM_LINUX
+#endif
+
+#if defined(__clang__)
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) \
+ _Pragma("clang diagnostic push") \
+ _Pragma("clang diagnostic ignored \"-Wglobal-constructors\"") static int var
+#define DOCTEST_GLOBAL_NO_WARNINGS_END() _Pragma("clang diagnostic pop")
+#elif defined(__GNUC__)
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) static int var __attribute__((unused))
+#define DOCTEST_GLOBAL_NO_WARNINGS_END()
+#else // MSVC / other
+#define DOCTEST_GLOBAL_NO_WARNINGS(var) static int var
+#define DOCTEST_GLOBAL_NO_WARNINGS_END()
+#endif // MSVC / other
+
+// should probably take a look at https://github.com/scottt/debugbreak
+#ifdef DOCTEST_PLATFORM_MAC
+#define DOCTEST_BREAK_INTO_DEBUGGER() __asm__("int $3\n" : :)
+#elif defined(_MSC_VER)
+#define DOCTEST_BREAK_INTO_DEBUGGER() __debugbreak()
+#elif defined(__MINGW32__)
+extern "C" __declspec(dllimport) void __stdcall DebugBreak();
+#define DOCTEST_BREAK_INTO_DEBUGGER() ::DebugBreak()
+#else // linux
+#define DOCTEST_BREAK_INTO_DEBUGGER() ((void)0)
+#endif // linux
+
+#ifdef __clang__
+// to detect if libc++ is being used with clang (the _LIBCPP_VERSION identifier)
+#include <ciso646>
+#endif // __clang__
+
+#ifdef _LIBCPP_VERSION
+// not forward declaring ostream for libc++ because I had some problems (inline namespaces vs c++98)
+// so the <iosfwd> header is used - also it is very light and doesn't drag a ton of stuff
+#include <iosfwd>
+#else // _LIBCPP_VERSION
+#ifndef DOCTEST_CONFIG_USE_IOSFWD
+namespace std
+{
+ template <class charT>
+ struct char_traits;
+ template <>
+ struct char_traits<char>;
+ template <class charT, class traits>
+ class basic_ostream;
+ typedef basic_ostream<char, char_traits<char> > ostream;
+} // namespace std
+#else // DOCTEST_CONFIG_USE_IOSFWD
+#include <iosfwd>
+#endif // DOCTEST_CONFIG_USE_IOSFWD
+#endif // _LIBCPP_VERSION
+
+// static assert macro - because of the c++98 support requires that the message is an
+// identifier (no spaces and not a C string) - example without quotes: I_am_a_message
+// taken from here: http://stackoverflow.com/a/1980156/3162383
+#ifdef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_STATIC_ASSERT(expression, message) static_assert(expression, #message)
+#else // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+#define DOCTEST_STATIC_ASSERT(expression, message) \
+ struct DOCTEST_CAT(__static_assertion_at_line_, __LINE__) \
+ { \
+ doctest::detail::static_assert_impl::StaticAssertion<static_cast<bool>((expression))> \
+ DOCTEST_CAT(DOCTEST_CAT(DOCTEST_CAT(STATIC_ASSERTION_FAILED_AT_LINE_, __LINE__), \
+ _), \
+ message); \
+ }; \
+ typedef doctest::detail::static_assert_impl::StaticAssertionTest<static_cast<int>( \
+ sizeof(DOCTEST_CAT(__static_assertion_at_line_, __LINE__)))> \
+ DOCTEST_CAT(__static_assertion_test_at_line_, __LINE__)
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+#ifdef _LIBCPP_VERSION
+#include <cstddef>
+#else // _LIBCPP_VERSION
+namespace std
+{
+ typedef decltype(nullptr) nullptr_t;
+}
+#endif // _LIBCPP_VERSION
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+#ifndef DOCTEST_CONFIG_DISABLE
+namespace doctest
+{
+ namespace detail
+ {
+ struct TestSuite
+ {
+ const char* m_test_suite;
+ const char* m_description;
+ bool m_skip;
+ bool m_may_fail;
+ bool m_should_fail;
+ int m_expected_failures;
+ double m_timeout;
+
+ TestSuite& operator*(const char* in) {
+ m_test_suite = in;
+ // clear state
+ m_description = 0;
+ m_skip = false;
+ m_may_fail = false;
+ m_should_fail = false;
+ m_expected_failures = 0;
+ m_timeout = 0;
+ return *this;
+ }
+
+ template <typename T>
+ TestSuite& operator*(const T& in) {
+ in.fill(*this);
+ return *this;
+ }
+ };
+ } // namespace detail
+} // namespace doctest
+
+ // in a separate namespace outside of doctest because the DOCTEST_TEST_SUITE macro
+ // introduces an anonymous namespace in which getCurrentTestSuite gets overridden
+namespace doctest_detail_test_suite_ns
+{
+ DOCTEST_INTERFACE doctest::detail::TestSuite& getCurrentTestSuite();
+} // namespace doctest_detail_test_suite_ns
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+namespace doctest
+{
+ // A 24 byte string class (can be as small as 17 for x64 and 13 for x86) that can hold strings with length
+ // of up to 23 chars on the stack before going on the heap - the last byte of the buffer is used for:
+ // - "is small" bit - the highest bit - if "0" then it is small - otherwise its "1" (128)
+ // - if small - capacity left before going on the heap - using the lowest 5 bits
+ // - if small - 2 bits are left unused - the second and third highest ones
+ // - if small - acts as a null terminator if strlen() is 23 (24 including the null terminator)
+ // and the "is small" bit remains "0" ("as well as the capacity left") so its OK
+ // Idea taken from this lecture about the string implementation of facebook/folly - fbstring
+ // https://www.youtube.com/watch?v=kPR8h4-qZdk
+ // TODO:
+ // - optimizations - like not deleting memory unnecessarily in operator= and etc.
+ // - resize/reserve/clear
+ // - substr
+ // - replace
+ // - back/front
+ // - iterator stuff
+ // - find & friends
+ // - push_back/pop_back
+ // - assign/insert/erase
+ // - relational operators as free functions - taking const char* as one of the params
+ class DOCTEST_INTERFACE String
+ {
+ static const unsigned len = 24; //!OCLINT avoid private static members
+ static const unsigned last = len - 1; //!OCLINT avoid private static members
+
+ struct view // len should be more than sizeof(view) - because of the final byte for flags
+ {
+ char* ptr;
+ unsigned size;
+ unsigned capacity;
+ };
+
+ union
+ {
+ char buf[len];
+ view data;
+ };
+
+ void copy(const String& other);
+
+ void setOnHeap() { *reinterpret_cast<unsigned char*>(&buf[last]) = 128; }
+ void setLast(unsigned in = last) { buf[last] = char(in); }
+
+ public:
+ String() {
+ buf[0] = '\0';
+ setLast();
+ }
+
+ String(const char* in);
+
+ String(const String& other) { copy(other); }
+
+ ~String() {
+ if (!isOnStack())
+ delete[] data.ptr;
+ }
+
+ // GCC 4.9/5/6 report Wstrict-overflow when optimizations are ON and it got inlined in the vector class somewhere...
+ // see commit 574ef95f0cd379118be5011704664e4b5351f1e0 and build https://travis-ci.org/onqtam/doctest/builds/230671611
+ DOCTEST_NOINLINE String& operator=(const String& other) {
+ if (!isOnStack())
+ delete[] data.ptr;
+
+ copy(other);
+
+ return *this;
+ }
+ String& operator+=(const String& other);
+
+ String operator+(const String& other) const { return String(*this) += other; }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ String(String&& other);
+ String& operator=(String&& other);
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+ bool isOnStack() const { return (buf[last] & 128) == 0; }
+
+ char operator[](unsigned i) const { return const_cast<String*>(this)->operator[](i); } // NOLINT
+ char& operator[](unsigned i) {
+ if (isOnStack())
+ return reinterpret_cast<char*>(buf)[i];
+ return data.ptr[i];
+ }
+
+ const char* c_str() const { return const_cast<String*>(this)->c_str(); } // NOLINT
+ char* c_str() {
+ if (isOnStack())
+ return reinterpret_cast<char*>(buf);
+ return data.ptr;
+ }
+
+ unsigned size() const {
+ if (isOnStack())
+ return last - (unsigned(buf[last]) & 31); // using "last" would work only if "len" is 32
+ return data.size;
+ }
+
+ unsigned capacity() const {
+ if (isOnStack())
+ return len;
+ return data.capacity;
+ }
+
+ int compare(const char* other, bool no_case = false) const;
+ int compare(const String& other, bool no_case = false) const;
+ };
+
+ // clang-format off
+ inline bool operator==(const String& lhs, const String& rhs) { return lhs.compare(rhs) == 0; }
+ inline bool operator!=(const String& lhs, const String& rhs) { return lhs.compare(rhs) != 0; }
+ inline bool operator< (const String& lhs, const String& rhs) { return lhs.compare(rhs) < 0; }
+ inline bool operator> (const String& lhs, const String& rhs) { return lhs.compare(rhs) > 0; }
+ inline bool operator<=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) < 0 : true; }
+ inline bool operator>=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) > 0 : true; }
+ // clang-format on
+
+ DOCTEST_INTERFACE std::ostream& operator<<(std::ostream& stream, const String& in);
+
+ namespace detail
+ {
+#ifndef DOCTEST_CONFIG_WITH_STATIC_ASSERT
+ namespace static_assert_impl
+ {
+ template <bool>
+ struct StaticAssertion;
+
+ template <>
+ struct StaticAssertion<true>
+ {};
+
+ template <int i>
+ struct StaticAssertionTest
+ {};
+ } // namespace static_assert_impl
+#endif // DOCTEST_CONFIG_WITH_STATIC_ASSERT
+
+ namespace traits
+ {
+ template <typename T>
+ struct remove_const
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_const<const T>
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_volatile
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_volatile<volatile T>
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_cv
+ {
+ typedef typename remove_volatile<typename remove_const<T>::type>::type type;
+ };
+
+ template <typename T>
+ struct is_pointer_helper
+ {
+ static const bool value = false;
+ };
+
+ template <typename T>
+ struct is_pointer_helper<T*>
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = true;
+ };
+
+ template <typename T>
+ struct is_pointer
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = is_pointer_helper<typename remove_cv<T>::type>::value;
+ };
+
+ template <bool CONDITION, typename TYPE = void>
+ struct enable_if
+ {};
+
+ template <typename TYPE>
+ struct enable_if<true, TYPE>
+ {
+ typedef TYPE type;
+ };
+
+ template <typename T>
+ struct remove_reference
+ {
+ typedef T type;
+ };
+
+ template <typename T>
+ struct remove_reference<T&>
+ {
+ typedef T type;
+ };
+
+ template <typename T, typename AT_1 = void>
+ class is_constructible_impl
+ {
+ private:
+ template <typename C_T, typename C_AT_1>
+ static bool test(typename enable_if< //!OCLINT avoid private static members
+ sizeof(C_T) ==
+ sizeof(C_T(static_cast<C_AT_1>(
+ *static_cast<typename remove_reference<C_AT_1>::type*>(
+ 0))))>::type*);
+
+ template <typename, typename>
+ static int test(...); //!OCLINT avoid private static members
+
+ public:
+ static const bool value = sizeof(test<T, AT_1>(0)) == sizeof(bool);
+ };
+
+ template <typename T>
+ class is_constructible_impl<T, void>
+ {
+ private:
+ template <typename C_T>
+ static C_T testFun(C_T); //!OCLINT avoid private static members
+
+ template <typename C_T>
+ static bool test(typename enable_if< //!OCLINT avoid private static members
+ sizeof(C_T) == sizeof(testFun(C_T()))>::type*);
+
+ template <typename>
+ static int test(...); //!OCLINT avoid private static members
+
+ public:
+ static const bool value = sizeof(test<T>(0)) == sizeof(bool);
+ };
+
+ // is_constructible<> taken from here: http://stackoverflow.com/a/40443701/3162383
+ // for GCC/Clang gives the same results as std::is_constructible<> - see here: https://wandbox.org/permlink/bNWr7Ii2fuz4Vf7A
+ // modifications:
+ // - reworked to support only 1 argument (mainly because of MSVC...)
+ // - removed pointer support
+ // MSVC support:
+ // - for versions before 2012 read the CAUTION comment below
+ // currently intended for use only in the Approx() helper for strong typedefs of double - see issue #62
+#ifndef _MSC_VER
+ template <typename T, typename AT_1 = void>
+ class is_constructible
+ {
+ public:
+ static const bool value = is_pointer<typename remove_reference<T>::type>::value ?
+ false :
+ is_constructible_impl<T, AT_1>::value;
+ };
+#elif defined(_MSC_VER) && (_MSC_VER >= 1700)
+ template <typename T, typename AT_1>
+ struct is_constructible
+ {
+ static const bool value = __is_constructible(T, AT_1);
+ };
+#elif defined(_MSC_VER)
+ // !!! USE WITH CAUTION !!!
+ // will always return false - unable to implement this for versions of MSVC older than 2012 for now...
+ template <typename T, typename AT_1>
+ struct is_constructible
+ {
+ static const bool value = false;
+ };
+#endif // _MSC_VER
+ } // namespace traits
+
+ template <typename T>
+ struct deferred_false
+ // cppcheck-suppress unusedStructMember
+ {
+ static const bool value = false;
+ };
+
+ // to silence the warning "-Wzero-as-null-pointer-constant" only for gcc 5 for the Approx template ctor - pragmas don't work for it...
+ inline void* getNull() { return 0; }
+
+ namespace has_insertion_operator_impl
+ {
+ typedef char no;
+ typedef char yes[2];
+
+ struct any_t
+ {
+ template <typename T>
+ // cppcheck-suppress noExplicitConstructor
+ any_t(const DOCTEST_REF_WRAP(T));
+ };
+
+ yes& testStreamable(std::ostream&);
+ no testStreamable(no);
+
+ no operator<<(const std::ostream&, const any_t&);
+
+ template <typename T>
+ struct has_insertion_operator
+ {
+ static std::ostream& s;
+ static const DOCTEST_REF_WRAP(T) t;
+ static const bool value = sizeof(testStreamable(s << t)) == sizeof(yes);
+ };
+ } // namespace has_insertion_operator_impl
+
+ template <typename T>
+ struct has_insertion_operator : has_insertion_operator_impl::has_insertion_operator<T>
+ {};
+
+ DOCTEST_INTERFACE void my_memcpy(void* dest, const void* src, unsigned num);
+ DOCTEST_INTERFACE unsigned my_strlen(const char* in);
+
+ DOCTEST_INTERFACE std::ostream* createStream();
+ DOCTEST_INTERFACE String getStreamResult(std::ostream*);
+ DOCTEST_INTERFACE void freeStream(std::ostream*);
+
+ template <bool C>
+ struct StringMakerBase
+ {
+ template <typename T>
+ static String convert(const DOCTEST_REF_WRAP(T)) {
+ return "{?}";
+ }
+ };
+
+ template <>
+ struct StringMakerBase<true>
+ {
+ template <typename T>
+ static String convert(const DOCTEST_REF_WRAP(T) in) {
+ std::ostream* stream = createStream();
+ *stream << in;
+ String result = getStreamResult(stream);
+ freeStream(stream);
+ return result;
+ }
+ };
+
+ DOCTEST_INTERFACE String rawMemoryToString(const void* object, unsigned size);
+
+ template <typename T>
+ String rawMemoryToString(const DOCTEST_REF_WRAP(T) object) {
+ return rawMemoryToString(&object, sizeof(object));
+ }
+
+ class NullType
+ {};
+
+ template <class T, class U>
+ struct Typelist
+ {
+ typedef T Head;
+ typedef U Tail;
+ };
+
+ // type of recursive function
+ template <class TList, class Callable>
+ struct ForEachType;
+
+ // Recursion rule
+ template <class Head, class Tail, class Callable>
+ struct ForEachType<Typelist<Head, Tail>, Callable> : public ForEachType<Tail, Callable>
+ {
+ enum
+ {
+ value = 1 + ForEachType<Tail, Callable>::value
+ };
+
+ explicit ForEachType(Callable& callable)
+ : ForEachType<Tail, Callable>(callable) {
+#if defined(_MSC_VER) && _MSC_VER <= 1900
+ callable.operator()<value, Head>();
+#else // _MSC_VER
+ callable.template operator()<value, Head>();
+#endif // _MSC_VER
+ }
+ };
+
+ // Recursion end
+ template <class Head, class Callable>
+ struct ForEachType<Typelist<Head, NullType>, Callable>
+ {
+ public:
+ enum
+ {
+ value = 0
+ };
+
+ explicit ForEachType(Callable& callable) {
+#if defined(_MSC_VER) && _MSC_VER <= 1900
+ callable.operator()<value, Head>();
+#else // _MSC_VER
+ callable.template operator()<value, Head>();
+#endif // _MSC_VER
+ }
+ };
+
+ template <typename T>
+ const char* type_to_string() {
+ return "<>";
+ }
+ } // namespace detail
+
+ template <typename T1 = detail::NullType, typename T2 = detail::NullType,
+ typename T3 = detail::NullType, typename T4 = detail::NullType,
+ typename T5 = detail::NullType, typename T6 = detail::NullType,
+ typename T7 = detail::NullType, typename T8 = detail::NullType,
+ typename T9 = detail::NullType, typename T10 = detail::NullType,
+ typename T11 = detail::NullType, typename T12 = detail::NullType,
+ typename T13 = detail::NullType, typename T14 = detail::NullType,
+ typename T15 = detail::NullType, typename T16 = detail::NullType,
+ typename T17 = detail::NullType, typename T18 = detail::NullType,
+ typename T19 = detail::NullType, typename T20 = detail::NullType,
+ typename T21 = detail::NullType, typename T22 = detail::NullType,
+ typename T23 = detail::NullType, typename T24 = detail::NullType,
+ typename T25 = detail::NullType, typename T26 = detail::NullType,
+ typename T27 = detail::NullType, typename T28 = detail::NullType,
+ typename T29 = detail::NullType, typename T30 = detail::NullType,
+ typename T31 = detail::NullType, typename T32 = detail::NullType,
+ typename T33 = detail::NullType, typename T34 = detail::NullType,
+ typename T35 = detail::NullType, typename T36 = detail::NullType,
+ typename T37 = detail::NullType, typename T38 = detail::NullType,
+ typename T39 = detail::NullType, typename T40 = detail::NullType,
+ typename T41 = detail::NullType, typename T42 = detail::NullType,
+ typename T43 = detail::NullType, typename T44 = detail::NullType,
+ typename T45 = detail::NullType, typename T46 = detail::NullType,
+ typename T47 = detail::NullType, typename T48 = detail::NullType,
+ typename T49 = detail::NullType, typename T50 = detail::NullType,
+ typename T51 = detail::NullType, typename T52 = detail::NullType,
+ typename T53 = detail::NullType, typename T54 = detail::NullType,
+ typename T55 = detail::NullType, typename T56 = detail::NullType,
+ typename T57 = detail::NullType, typename T58 = detail::NullType,
+ typename T59 = detail::NullType, typename T60 = detail::NullType>
+ struct Types
+ {
+ private:
+ typedef typename Types<T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17,
+ T18, T19, T20, T21, T22, T23, T24, T25, T26, T27, T28, T29, T30, T31,
+ T32, T33, T34, T35, T36, T37, T38, T39, T40, T41, T42, T43, T44, T45,
+ T46, T47, T48, T49, T50, T51, T52, T53, T54, T55, T56, T57, T58, T59,
+ T60>::Result TailResult;
+
+ public:
+ typedef detail::Typelist<T1, TailResult> Result;
+ };
+
+ template <>
+ struct Types<>
+ {
+ typedef detail::NullType Result;
+ };
+
+ template <typename T>
+ struct StringMaker : detail::StringMakerBase<detail::has_insertion_operator<T>::value>
+ {};
+
+ template <typename T>
+ struct StringMaker<T*>
+ {
+ template <typename U>
+ static String convert(U* p) {
+ if (p)
+ return detail::rawMemoryToString(p);
+ return "NULL";
+ }
+ };
+
+ template <typename R, typename C>
+ struct StringMaker<R C::*>
+ {
+ static String convert(R C::*p) {
+ if (p)
+ return detail::rawMemoryToString(p);
+ return "NULL";
+ }
+ };
+
+ template <typename T>
+ String toString(const DOCTEST_REF_WRAP(T) value) {
+ return StringMaker<T>::convert(value);
+ }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE String toString(char* in);
+ DOCTEST_INTERFACE String toString(const char* in);
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE String toString(bool in);
+ DOCTEST_INTERFACE String toString(float in);
+ DOCTEST_INTERFACE String toString(double in);
+ DOCTEST_INTERFACE String toString(double long in);
+
+ DOCTEST_INTERFACE String toString(char in);
+ DOCTEST_INTERFACE String toString(char signed in);
+ DOCTEST_INTERFACE String toString(char unsigned in);
+ DOCTEST_INTERFACE String toString(int short in);
+ DOCTEST_INTERFACE String toString(int short unsigned in);
+ DOCTEST_INTERFACE String toString(int in);
+ DOCTEST_INTERFACE String toString(int unsigned in);
+ DOCTEST_INTERFACE String toString(int long in);
+ DOCTEST_INTERFACE String toString(int long unsigned in);
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_INTERFACE String toString(int long long in);
+ DOCTEST_INTERFACE String toString(int long long unsigned in);
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+ DOCTEST_INTERFACE String toString(std::nullptr_t in);
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+ class DOCTEST_INTERFACE Approx
+ {
+ public:
+ explicit Approx(double value);
+
+ Approx operator()(double value) const {
+ Approx approx(value);
+ approx.epsilon(m_epsilon);
+ approx.scale(m_scale);
+ return approx;
+ }
+
+ template <typename T>
+ explicit Approx(const T& value,
+ typename detail::traits::enable_if<
+ detail::traits::is_constructible<double, T>::value>::type* =
+ static_cast<T*>(detail::getNull())) {
+ *this = Approx(static_cast<double>(value));
+ }
+
+ // clang-format off
+ // overloads for double - the first one is necessary as it is in the implementation part of doctest
+ // as for the others - keeping them for potentially faster compile times
+ DOCTEST_INTERFACE friend bool operator==(double lhs, Approx const& rhs);
+ friend bool operator==(Approx const& lhs, double rhs) { return operator==(rhs, lhs); }
+ friend bool operator!=(double lhs, Approx const& rhs) { return !operator==(lhs, rhs); }
+ friend bool operator!=(Approx const& lhs, double rhs) { return !operator==(rhs, lhs); }
+ friend bool operator<=(double lhs, Approx const& rhs) { return lhs < rhs.m_value || lhs == rhs; }
+ friend bool operator<=(Approx const& lhs, double rhs) { return lhs.m_value < rhs || lhs == rhs; }
+ friend bool operator>=(double lhs, Approx const& rhs) { return lhs > rhs.m_value || lhs == rhs; }
+ friend bool operator>=(Approx const& lhs, double rhs) { return lhs.m_value > rhs || lhs == rhs; }
+ friend bool operator< (double lhs, Approx const& rhs) { return lhs < rhs.m_value && lhs != rhs; }
+ friend bool operator< (Approx const& lhs, double rhs) { return lhs.m_value < rhs && lhs != rhs; }
+ friend bool operator> (double lhs, Approx const& rhs) { return lhs > rhs.m_value && lhs != rhs; }
+ friend bool operator> (Approx const& lhs, double rhs) { return lhs.m_value > rhs && lhs != rhs; }
+
+#define DOCTEST_APPROX_PREFIX \
+ template <typename T> friend typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value, bool>::type
+
+ DOCTEST_APPROX_PREFIX operator==(const T& lhs, const Approx& rhs) { return operator==(double(lhs), rhs); }
+ DOCTEST_APPROX_PREFIX operator==(const Approx& lhs, const T& rhs) { return operator==(rhs, lhs); }
+ DOCTEST_APPROX_PREFIX operator!=(const T& lhs, const Approx& rhs) { return !operator==(lhs, rhs); }
+ DOCTEST_APPROX_PREFIX operator!=(const Approx& lhs, const T& rhs) { return !operator==(rhs, lhs); }
+ DOCTEST_APPROX_PREFIX operator<=(const T& lhs, const Approx& rhs) { return double(lhs) < rhs.m_value || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator<=(const Approx& lhs, const T& rhs) { return lhs.m_value < double(rhs) || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator>=(const T& lhs, const Approx& rhs) { return double(lhs) > rhs.m_value || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator>=(const Approx& lhs, const T& rhs) { return lhs.m_value > double(rhs) || lhs == rhs; }
+ DOCTEST_APPROX_PREFIX operator< (const T& lhs, const Approx& rhs) { return double(lhs) < rhs.m_value && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator< (const Approx& lhs, const T& rhs) { return lhs.m_value < double(rhs) && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator> (const T& lhs, const Approx& rhs) { return double(lhs) > rhs.m_value && lhs != rhs; }
+ DOCTEST_APPROX_PREFIX operator> (const Approx& lhs, const T& rhs) { return lhs.m_value > double(rhs) && lhs != rhs; }
+#undef DOCTEST_APPROX_PREFIX
+ // clang-format on
+
+ Approx& epsilon(double newEpsilon) {
+ m_epsilon = (newEpsilon);
+ return *this;
+ }
+
+ template <typename T>
+ typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value,
+ Approx&>::type
+ epsilon(const T& newEpsilon) {
+ m_epsilon = static_cast<double>(newEpsilon);
+ return *this;
+ }
+
+ Approx& scale(double newScale) {
+ m_scale = (newScale);
+ return *this;
+ }
+
+ template <typename T>
+ typename detail::traits::enable_if<detail::traits::is_constructible<double, T>::value,
+ Approx&>::type
+ scale(const T& newScale) {
+ m_scale = static_cast<double>(newScale);
+ return *this;
+ }
+
+ String toString() const;
+
+ private:
+ double m_epsilon;
+ double m_scale;
+ double m_value;
+ };
+
+ template <>
+ inline String toString<Approx>(const DOCTEST_REF_WRAP(Approx) value) {
+ return value.toString();
+ }
+
+#if !defined(DOCTEST_CONFIG_DISABLE)
+
+ namespace detail
+ {
+ // the function type this library works with
+ typedef void(*funcType)();
+
+ namespace assertType
+ {
+ enum Enum
+ {
+ // macro traits
+
+ is_warn = 1,
+ is_check = 2,
+ is_require = 4,
+
+ is_throws = 8,
+ is_throws_as = 16,
+ is_nothrow = 32,
+
+ is_fast = 64, // not checked anywhere - used just to distinguish the types
+ is_false = 128,
+ is_unary = 256,
+
+ is_eq = 512,
+ is_ne = 1024,
+
+ is_lt = 2048,
+ is_gt = 4096,
+
+ is_ge = 8192,
+ is_le = 16384,
+
+ // macro types
+
+ DT_WARN = is_warn,
+ DT_CHECK = is_check,
+ DT_REQUIRE = is_require,
+
+ DT_WARN_FALSE = is_false | is_warn,
+ DT_CHECK_FALSE = is_false | is_check,
+ DT_REQUIRE_FALSE = is_false | is_require,
+
+ DT_WARN_THROWS = is_throws | is_warn,
+ DT_CHECK_THROWS = is_throws | is_check,
+ DT_REQUIRE_THROWS = is_throws | is_require,
+
+ DT_WARN_THROWS_AS = is_throws_as | is_warn,
+ DT_CHECK_THROWS_AS = is_throws_as | is_check,
+ DT_REQUIRE_THROWS_AS = is_throws_as | is_require,
+
+ DT_WARN_NOTHROW = is_nothrow | is_warn,
+ DT_CHECK_NOTHROW = is_nothrow | is_check,
+ DT_REQUIRE_NOTHROW = is_nothrow | is_require,
+
+ DT_WARN_EQ = is_eq | is_warn,
+ DT_CHECK_EQ = is_eq | is_check,
+ DT_REQUIRE_EQ = is_eq | is_require,
+
+ DT_WARN_NE = is_ne | is_warn,
+ DT_CHECK_NE = is_ne | is_check,
+ DT_REQUIRE_NE = is_ne | is_require,
+
+ DT_WARN_GT = is_gt | is_warn,
+ DT_CHECK_GT = is_gt | is_check,
+ DT_REQUIRE_GT = is_gt | is_require,
+
+ DT_WARN_LT = is_lt | is_warn,
+ DT_CHECK_LT = is_lt | is_check,
+ DT_REQUIRE_LT = is_lt | is_require,
+
+ DT_WARN_GE = is_ge | is_warn,
+ DT_CHECK_GE = is_ge | is_check,
+ DT_REQUIRE_GE = is_ge | is_require,
+
+ DT_WARN_LE = is_le | is_warn,
+ DT_CHECK_LE = is_le | is_check,
+ DT_REQUIRE_LE = is_le | is_require,
+
+ DT_WARN_UNARY = is_unary | is_warn,
+ DT_CHECK_UNARY = is_unary | is_check,
+ DT_REQUIRE_UNARY = is_unary | is_require,
+
+ DT_WARN_UNARY_FALSE = is_false | is_unary | is_warn,
+ DT_CHECK_UNARY_FALSE = is_false | is_unary | is_check,
+ DT_REQUIRE_UNARY_FALSE = is_false | is_unary | is_require,
+
+ DT_FAST_WARN_EQ = is_fast | is_eq | is_warn,
+ DT_FAST_CHECK_EQ = is_fast | is_eq | is_check,
+ DT_FAST_REQUIRE_EQ = is_fast | is_eq | is_require,
+
+ DT_FAST_WARN_NE = is_fast | is_ne | is_warn,
+ DT_FAST_CHECK_NE = is_fast | is_ne | is_check,
+ DT_FAST_REQUIRE_NE = is_fast | is_ne | is_require,
+
+ DT_FAST_WARN_GT = is_fast | is_gt | is_warn,
+ DT_FAST_CHECK_GT = is_fast | is_gt | is_check,
+ DT_FAST_REQUIRE_GT = is_fast | is_gt | is_require,
+
+ DT_FAST_WARN_LT = is_fast | is_lt | is_warn,
+ DT_FAST_CHECK_LT = is_fast | is_lt | is_check,
+ DT_FAST_REQUIRE_LT = is_fast | is_lt | is_require,
+
+ DT_FAST_WARN_GE = is_fast | is_ge | is_warn,
+ DT_FAST_CHECK_GE = is_fast | is_ge | is_check,
+ DT_FAST_REQUIRE_GE = is_fast | is_ge | is_require,
+
+ DT_FAST_WARN_LE = is_fast | is_le | is_warn,
+ DT_FAST_CHECK_LE = is_fast | is_le | is_check,
+ DT_FAST_REQUIRE_LE = is_fast | is_le | is_require,
+
+ DT_FAST_WARN_UNARY = is_fast | is_unary | is_warn,
+ DT_FAST_CHECK_UNARY = is_fast | is_unary | is_check,
+ DT_FAST_REQUIRE_UNARY = is_fast | is_unary | is_require,
+
+ DT_FAST_WARN_UNARY_FALSE = is_fast | is_false | is_unary | is_warn,
+ DT_FAST_CHECK_UNARY_FALSE = is_fast | is_false | is_unary | is_check,
+ DT_FAST_REQUIRE_UNARY_FALSE = is_fast | is_false | is_unary | is_require
+ };
+ } // namespace assertType
+
+ DOCTEST_INTERFACE const char* getAssertString(assertType::Enum val);
+
+ // clang-format off
+ template<class T> struct decay_array { typedef T type; };
+ template<class T, unsigned N> struct decay_array<T[N]> { typedef T* type; };
+ template<class T> struct decay_array<T[]> { typedef T* type; };
+
+ template<class T> struct not_char_pointer { enum { value = 1 }; };
+ template<> struct not_char_pointer<char*> { enum { value = 0 }; };
+ template<> struct not_char_pointer<const char*> { enum { value = 0 }; };
+
+ template<class T> struct can_use_op : not_char_pointer<typename decay_array<T>::type> {};
+ // clang-format on
+
+ struct TestFailureException
+ {};
+
+ DOCTEST_INTERFACE bool checkIfShouldThrow(assertType::Enum assert_type);
+ DOCTEST_INTERFACE void fastAssertThrowIfFlagSet(int flags);
+ DOCTEST_INTERFACE void throwException();
+
+ struct TestAccessibleContextState
+ {
+ bool no_throw; // to skip exceptions-related assertion macros
+ bool success; // include successful assertions in output
+ };
+
+ struct ContextState;
+
+ DOCTEST_INTERFACE TestAccessibleContextState* getTestsContextState();
+
+ struct DOCTEST_INTERFACE SubcaseSignature
+ {
+ const char* m_name;
+ const char* m_file;
+ int m_line;
+
+ SubcaseSignature(const char* name, const char* file, int line)
+ : m_name(name)
+ , m_file(file)
+ , m_line(line) {}
+
+ bool operator<(const SubcaseSignature& other) const;
+ };
+
+ // cppcheck-suppress copyCtorAndEqOperator
+ struct DOCTEST_INTERFACE Subcase
+ {
+ SubcaseSignature m_signature;
+ bool m_entered;
+
+ Subcase(const char* name, const char* file, int line);
+ Subcase(const Subcase& other);
+ ~Subcase();
+
+ operator bool() const { return m_entered; }
+ };
+
+ template <typename L, typename R>
+ String stringifyBinaryExpr(const DOCTEST_REF_WRAP(L) lhs, const char* op,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ return toString(lhs) + op + toString(rhs);
+ }
+
+ struct DOCTEST_INTERFACE Result
+ {
+ bool m_passed;
+ String m_decomposition;
+
+ ~Result();
+
+ DOCTEST_NOINLINE Result(bool passed = false, const String& decomposition = String())
+ : m_passed(passed)
+ , m_decomposition(decomposition) {}
+
+ DOCTEST_NOINLINE Result(const Result& other)
+ : m_passed(other.m_passed)
+ , m_decomposition(other.m_decomposition) {}
+
+ Result& operator=(const Result& other);
+
+ operator bool() { return !m_passed; }
+
+ // clang-format off
+ // forbidding some expressions based on this table: http://en.cppreference.com/w/cpp/language/operator_precedence
+ template <typename R> Result& operator& (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator^ (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator| (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator&& (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator|| (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator== (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator!= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator< (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator> (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator<= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator>= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator+= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator-= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator*= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator/= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator%= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator<<=(const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator>>=(const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator&= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator^= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ template <typename R> Result& operator|= (const R&) { DOCTEST_STATIC_ASSERT(deferred_false<R>::value, Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); return *this; }
+ // clang-format on
+ };
+
+#ifndef DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wsign-conversion"
+#pragma clang diagnostic ignored "-Wsign-compare"
+ //#pragma clang diagnostic ignored "-Wdouble-promotion"
+ //#pragma clang diagnostic ignored "-Wconversion"
+ //#pragma clang diagnostic ignored "-Wfloat-equal"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+#pragma GCC diagnostic ignored "-Wsign-compare"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 5)
+ //#pragma GCC diagnostic ignored "-Wdouble-promotion"
+#endif // > gcc 4.5
+ //#pragma GCC diagnostic ignored "-Wconversion"
+ //#pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+ // http://stackoverflow.com/questions/39479163 what's the difference between C4018 and C4389
+#pragma warning(disable : 4389) // 'operator' : signed/unsigned mismatch
+#pragma warning(disable : 4018) // 'expression' : signed/unsigned mismatch
+ //#pragma warning(disable : 4805) // 'operation' : unsafe mix of type 'type' and type 'type' in operation
+#endif // _MSC_VER
+
+#endif // DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+ // clang-format off
+#ifndef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_COMPARISON_RETURN_TYPE bool
+#else // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_COMPARISON_RETURN_TYPE typename traits::enable_if<can_use_op<L>::value || can_use_op<R>::value, bool>::type
+ inline bool eq(const char* lhs, const char* rhs) { return String(lhs) == String(rhs); }
+ inline bool ne(const char* lhs, const char* rhs) { return String(lhs) != String(rhs); }
+ inline bool lt(const char* lhs, const char* rhs) { return String(lhs) < String(rhs); }
+ inline bool gt(const char* lhs, const char* rhs) { return String(lhs) > String(rhs); }
+ inline bool le(const char* lhs, const char* rhs) { return String(lhs) <= String(rhs); }
+ inline bool ge(const char* lhs, const char* rhs) { return String(lhs) >= String(rhs); }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE eq(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs == rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE ne(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs != rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE lt(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs < rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE gt(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs > rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE le(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs <= rhs; }
+ template <typename L, typename R> DOCTEST_COMPARISON_RETURN_TYPE ge(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) { return lhs >= rhs; }
+ // clang-format on
+
+#ifndef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_CMP_EQ(l, r) l == r
+#define DOCTEST_CMP_NE(l, r) l != r
+#define DOCTEST_CMP_GT(l, r) l > r
+#define DOCTEST_CMP_LT(l, r) l < r
+#define DOCTEST_CMP_GE(l, r) l >= r
+#define DOCTEST_CMP_LE(l, r) l <= r
+#else // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+#define DOCTEST_CMP_EQ(l, r) eq(l, r)
+#define DOCTEST_CMP_NE(l, r) ne(l, r)
+#define DOCTEST_CMP_GT(l, r) gt(l, r)
+#define DOCTEST_CMP_LT(l, r) lt(l, r)
+#define DOCTEST_CMP_GE(l, r) ge(l, r)
+#define DOCTEST_CMP_LE(l, r) le(l, r)
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+
+#define DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(op, op_str, op_macro) \
+ template <typename R> \
+ DOCTEST_NOINLINE Result operator op(const DOCTEST_REF_WRAP(R) rhs) { \
+ bool res = op_macro(lhs, rhs); \
+ if(m_assert_type & assertType::is_false) \
+ res = !res; \
+ if(!res || doctest::detail::getTestsContextState()->success) \
+ return Result(res, stringifyBinaryExpr(lhs, op_str, rhs)); \
+ return Result(res); \
+ }
+
+#define DOCTEST_FORBIT_EXPRESSION(op) \
+ template <typename R> \
+ Expression_lhs& operator op(const R&) { \
+ DOCTEST_STATIC_ASSERT(deferred_false<R>::value, \
+ Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison); \
+ return *this; \
+ }
+
+ template <typename L>
+ // cppcheck-suppress copyCtorAndEqOperator
+ struct Expression_lhs
+ {
+ L lhs;
+ assertType::Enum m_assert_type;
+
+ explicit Expression_lhs(L in, assertType::Enum assert_type)
+ : lhs(in)
+ , m_assert_type(assert_type) {}
+
+ Expression_lhs(const Expression_lhs& other)
+ : lhs(other.lhs) {}
+
+ DOCTEST_NOINLINE operator Result() {
+ bool res = !!lhs;
+ if (m_assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ res = !res;
+
+ if (!res || getTestsContextState()->success)
+ return Result(res, toString(lhs));
+ return Result(res);
+ }
+
+ // clang-format off
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(== , " == ", DOCTEST_CMP_EQ) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(!= , " != ", DOCTEST_CMP_NE) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(>, " > ", DOCTEST_CMP_GT) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(<, " < ", DOCTEST_CMP_LT) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(>= , " >= ", DOCTEST_CMP_GE) //!OCLINT bitwise operator in conditional
+ DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(<= , " <= ", DOCTEST_CMP_LE) //!OCLINT bitwise operator in conditional
+ // clang-format on
+
+ // forbidding some expressions based on this table: http://en.cppreference.com/w/cpp/language/operator_precedence
+ DOCTEST_FORBIT_EXPRESSION(&)
+ DOCTEST_FORBIT_EXPRESSION(^)
+ DOCTEST_FORBIT_EXPRESSION(| )
+ DOCTEST_FORBIT_EXPRESSION(&&)
+ DOCTEST_FORBIT_EXPRESSION(|| )
+ DOCTEST_FORBIT_EXPRESSION(= )
+ DOCTEST_FORBIT_EXPRESSION(+= )
+ DOCTEST_FORBIT_EXPRESSION(-= )
+ DOCTEST_FORBIT_EXPRESSION(*= )
+ DOCTEST_FORBIT_EXPRESSION(/= )
+ DOCTEST_FORBIT_EXPRESSION(%= )
+ DOCTEST_FORBIT_EXPRESSION(<<= )
+ DOCTEST_FORBIT_EXPRESSION(>>= )
+ DOCTEST_FORBIT_EXPRESSION(&= )
+ DOCTEST_FORBIT_EXPRESSION(^= )
+ DOCTEST_FORBIT_EXPRESSION(|= )
+ // these 2 are unfortunate because they should be allowed - they have higher precedence over the comparisons, but the
+ // ExpressionDecomposer class uses the left shift operator to capture the left operand of the binary expression...
+ DOCTEST_FORBIT_EXPRESSION(<< )
+ DOCTEST_FORBIT_EXPRESSION(>> )
+ };
+
+#ifndef DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
+
+#endif // DOCTEST_CONFIG_NO_COMPARISON_WARNING_SUPPRESSION
+
+ struct ExpressionDecomposer
+ {
+ assertType::Enum m_assert_type;
+
+ ExpressionDecomposer(assertType::Enum assert_type)
+ : m_assert_type(assert_type) {}
+
+ // The right operator for capturing expressions is "<=" instead of "<<" (based on the operator precedence table)
+ // but then there will be warnings from GCC about "-Wparentheses" and since "_Pragma()" is problematic this will stay for now...
+ // https://github.com/philsquared/Catch/issues/870
+ // https://github.com/philsquared/Catch/issues/565
+ template <typename L>
+ Expression_lhs<const DOCTEST_REF_WRAP(L)> operator<<(const DOCTEST_REF_WRAP(L) operand) {
+ return Expression_lhs<const DOCTEST_REF_WRAP(L)>(operand, m_assert_type);
+ }
+ };
+
+ struct DOCTEST_INTERFACE TestCase
+ {
+ // not used for determining uniqueness
+ funcType m_test; // a function pointer to the test case
+ String m_full_name; // contains the name (only for templated test cases!) + the template type
+ const char* m_name; // name of the test case
+ const char* m_type; // for templated test cases - gets appended to the real name
+ const char* m_test_suite; // the test suite in which the test was added
+ const char* m_description;
+ bool m_skip;
+ bool m_may_fail;
+ bool m_should_fail;
+ int m_expected_failures;
+ double m_timeout;
+
+ // fields by which uniqueness of test cases shall be determined
+ const char* m_file; // the file in which the test was registered
+ unsigned m_line; // the line where the test was registered
+ int m_template_id; // an ID used to distinguish between the different versions of a templated test case
+
+ TestCase(funcType test, const char* file, unsigned line, const TestSuite& test_suite,
+ const char* type = "", int template_id = -1);
+
+ // for gcc 4.7
+ DOCTEST_NOINLINE ~TestCase() {}
+
+ TestCase& operator*(const char* in);
+
+ template <typename T>
+ TestCase& operator*(const T& in) {
+ in.fill(*this);
+ return *this;
+ }
+
+ TestCase(const TestCase& other) { *this = other; }
+
+ TestCase& operator=(const TestCase& other);
+
+ bool operator<(const TestCase& other) const;
+ };
+
+ // forward declarations of functions used by the macros
+ DOCTEST_INTERFACE int regTest(const TestCase& tc);
+ DOCTEST_INTERFACE int setTestSuite(const TestSuite& ts);
+
+ DOCTEST_INTERFACE void addFailedAssert(assertType::Enum assert_type);
+
+ DOCTEST_INTERFACE void logTestStart(const TestCase& tc);
+ DOCTEST_INTERFACE void logTestEnd();
+
+ DOCTEST_INTERFACE void logTestException(const String& what, bool crash = false);
+
+ DOCTEST_INTERFACE void logAssert(bool passed, const char* decomposition, bool threw,
+ const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file, int line);
+
+ DOCTEST_INTERFACE void logAssertThrows(bool threw, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE void logAssertThrowsAs(bool threw, bool threw_as, const char* as,
+ const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE void logAssertNothrow(bool threw, const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file,
+ int line);
+
+ DOCTEST_INTERFACE bool isDebuggerActive();
+ DOCTEST_INTERFACE void writeToDebugConsole(const String&);
+
+ namespace binaryAssertComparison
+ {
+ enum Enum
+ {
+ eq = 0,
+ ne,
+ gt,
+ lt,
+ ge,
+ le
+ };
+ } // namespace binaryAssertComparison
+
+ // clang-format off
+ template <int, class L, class R> struct RelationalComparator { bool operator()(const DOCTEST_REF_WRAP(L), const DOCTEST_REF_WRAP(R)) const { return false; } };
+ template <class L, class R> struct RelationalComparator<0, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return eq(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<1, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return ne(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<2, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return gt(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<3, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return lt(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<4, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return ge(lhs, rhs); } };
+ template <class L, class R> struct RelationalComparator<5, L, R> { bool operator()(const DOCTEST_REF_WRAP(L) lhs, const DOCTEST_REF_WRAP(R) rhs) const { return le(lhs, rhs); } };
+ // clang-format on
+
+ struct DOCTEST_INTERFACE ResultBuilder
+ {
+ assertType::Enum m_assert_type;
+ const char* m_file;
+ int m_line;
+ const char* m_expr;
+ const char* m_exception_type;
+
+ Result m_result;
+ bool m_threw;
+ bool m_threw_as;
+ bool m_failed;
+ String m_exception;
+
+ ResultBuilder(assertType::Enum assert_type, const char* file, int line, const char* expr,
+ const char* exception_type = "");
+
+ ~ResultBuilder();
+
+ void setResult(const Result& res) { m_result = res; }
+
+ template <int comparison, typename L, typename R>
+ DOCTEST_NOINLINE void binary_assert(const DOCTEST_REF_WRAP(L) lhs,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ m_result.m_passed = RelationalComparator<comparison, L, R>()(lhs, rhs);
+ if (!m_result.m_passed || getTestsContextState()->success)
+ m_result.m_decomposition = stringifyBinaryExpr(lhs, ", ", rhs);
+ }
+
+ template <typename L>
+ DOCTEST_NOINLINE void unary_assert(const DOCTEST_REF_WRAP(L) val) {
+ m_result.m_passed = !!val;
+
+ if (m_assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ m_result.m_passed = !m_result.m_passed;
+
+ if (!m_result.m_passed || getTestsContextState()->success)
+ m_result.m_decomposition = toString(val);
+ }
+
+ void unexpectedExceptionOccurred();
+
+ bool log();
+ void react() const;
+ };
+
+ namespace assertAction
+ {
+ enum Enum
+ {
+ nothing = 0,
+ dbgbreak = 1,
+ shouldthrow = 2
+ };
+ } // namespace assertAction
+
+ template <int comparison, typename L, typename R>
+ DOCTEST_NOINLINE int fast_binary_assert(assertType::Enum assert_type, const char* file,
+ int line, const char* expr,
+ const DOCTEST_REF_WRAP(L) lhs,
+ const DOCTEST_REF_WRAP(R) rhs) {
+ ResultBuilder rb(assert_type, file, line, expr);
+
+ rb.m_result.m_passed = RelationalComparator<comparison, L, R>()(lhs, rhs);
+
+ if (!rb.m_result.m_passed || getTestsContextState()->success)
+ rb.m_result.m_decomposition = stringifyBinaryExpr(lhs, ", ", rhs);
+
+ int res = 0;
+
+ if (rb.log())
+ res |= assertAction::dbgbreak;
+
+ if (rb.m_failed && checkIfShouldThrow(assert_type))
+ res |= assertAction::shouldthrow;
+
+#ifdef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+ // #########################################################################################
+ // IF THE DEBUGGER BREAKS HERE - GO 1 LEVEL UP IN THE CALLSTACK TO SEE THE FAILING ASSERTION
+ // THIS IS THE EFFECT OF HAVING 'DOCTEST_CONFIG_SUPER_FAST_ASSERTS' DEFINED
+ // #########################################################################################
+ if (res & assertAction::dbgbreak)
+ DOCTEST_BREAK_INTO_DEBUGGER();
+ fastAssertThrowIfFlagSet(res);
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ return res;
+ }
+
+ template <typename L>
+ DOCTEST_NOINLINE int fast_unary_assert(assertType::Enum assert_type, const char* file, int line,
+ const char* val_str, const DOCTEST_REF_WRAP(L) val) {
+ ResultBuilder rb(assert_type, file, line, val_str);
+
+ rb.m_result.m_passed = !!val;
+
+ if (assert_type & assertType::is_false) //!OCLINT bitwise operator in conditional
+ rb.m_result.m_passed = !rb.m_result.m_passed;
+
+ if (!rb.m_result.m_passed || getTestsContextState()->success)
+ rb.m_result.m_decomposition = toString(val);
+
+ int res = 0;
+
+ if (rb.log())
+ res |= assertAction::dbgbreak;
+
+ if (rb.m_failed && checkIfShouldThrow(assert_type))
+ res |= assertAction::shouldthrow;
+
+#ifdef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+ // #########################################################################################
+ // IF THE DEBUGGER BREAKS HERE - GO 1 LEVEL UP IN THE CALLSTACK TO SEE THE FAILING ASSERTION
+ // THIS IS THE EFFECT OF HAVING 'DOCTEST_CONFIG_SUPER_FAST_ASSERTS' DEFINED
+ // #########################################################################################
+ if (res & assertAction::dbgbreak)
+ DOCTEST_BREAK_INTO_DEBUGGER();
+ fastAssertThrowIfFlagSet(res);
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ return res;
+ }
+
+ struct DOCTEST_INTERFACE IExceptionTranslator //!OCLINT destructor of virtual class
+ {
+ virtual ~IExceptionTranslator();
+ virtual bool translate(String&) const = 0;
+ };
+
+ template <typename T>
+ class ExceptionTranslator : public IExceptionTranslator //!OCLINT destructor of virtual class
+ {
+ public:
+ explicit ExceptionTranslator(String(*translateFunction)(T))
+ : m_translateFunction(translateFunction) {}
+
+ bool translate(String& res) const {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ try {
+ throw;
+ // cppcheck-suppress catchExceptionByValue
+ }
+ catch (T ex) { // NOLINT
+ res = m_translateFunction(ex); //!OCLINT parameter reassignment
+ return true;
+ }
+ catch (...) {} //!OCLINT - empty catch statement
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ ((void)res); // to silence -Wunused-parameter
+ return false;
+ }
+
+ protected:
+ String(*m_translateFunction)(T);
+ };
+
+ DOCTEST_INTERFACE void registerExceptionTranslatorImpl(
+ const IExceptionTranslator* translateFunction);
+
+ // FIX FOR VISUAL STUDIO VERSIONS PRIOR TO 2015 - they failed to compile the call to operator<< with
+ // std::ostream passed as a reference noting that there is a use of an undefined type (which there isn't)
+ DOCTEST_INTERFACE void writeStringToStream(std::ostream* stream, const String& str);
+
+ template <bool C>
+ struct StringStreamBase
+ {
+ template <typename T>
+ static void convert(std::ostream* stream, const T& in) {
+ writeStringToStream(stream, toString(in));
+ }
+
+ // always treat char* as a string in this context - no matter
+ // if DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING is defined
+ static void convert(std::ostream* stream, const char* in) {
+ writeStringToStream(stream, String(in));
+ }
+ };
+
+ template <>
+ struct StringStreamBase<true>
+ {
+ template <typename T>
+ static void convert(std::ostream* stream, const T& in) {
+ *stream << in;
+ }
+ };
+
+ template <typename T>
+ struct StringStream : StringStreamBase<has_insertion_operator<T>::value>
+ {};
+
+ template <typename T>
+ void toStream(std::ostream* stream, const T& value) {
+ StringStream<T>::convert(stream, value);
+ }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char* in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, const char* in);
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, bool in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, float in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, double in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, double long in);
+
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char signed in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, char unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int short in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int short unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int unsigned in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long unsigned in);
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long long in);
+ DOCTEST_INTERFACE void toStream(std::ostream* stream, int long long unsigned in);
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+ struct IContextScope //!OCLINT destructor of virtual class
+ {
+ virtual void build(std::ostream*) = 0;
+ };
+
+ DOCTEST_INTERFACE void addToContexts(IContextScope* ptr);
+ DOCTEST_INTERFACE void popFromContexts();
+ DOCTEST_INTERFACE void useContextIfExceptionOccurred(IContextScope* ptr);
+
+ // cppcheck-suppress copyCtorAndEqOperator
+ class ContextBuilder
+ {
+ friend class ContextScope;
+
+ struct ICapture //!OCLINT destructor of virtual class
+ {
+ virtual void toStream(std::ostream*) const = 0;
+ };
+
+ template <typename T>
+ struct Capture : ICapture //!OCLINT destructor of virtual class
+ {
+ const T* capture;
+
+ explicit Capture(const T* in)
+ : capture(in) {}
+ virtual void toStream(std::ostream* stream) const { // override
+ doctest::detail::toStream(stream, *capture);
+ }
+ };
+
+ struct Chunk
+ {
+ char buf[sizeof(Capture<char>)]; // place to construct a Capture<T>
+ };
+
+ struct Node
+ {
+ Chunk chunk;
+ Node* next;
+ };
+
+ Chunk stackChunks[DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK];
+ int numCaptures;
+ Node* head;
+ Node* tail;
+
+ void build(std::ostream* stream) const {
+ int curr = 0;
+ // iterate over small buffer
+ while (curr < numCaptures && curr < DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK)
+ reinterpret_cast<const ICapture*>(stackChunks[curr++].buf)->toStream(stream);
+ // iterate over list
+ Node* curr_elem = head;
+ while (curr < numCaptures) {
+ reinterpret_cast<const ICapture*>(curr_elem->chunk.buf)->toStream(stream);
+ curr_elem = curr_elem->next;
+ ++curr;
+ }
+ }
+
+ // steal the contents of the other - acting as a move constructor...
+ DOCTEST_NOINLINE ContextBuilder(ContextBuilder& other)
+ : numCaptures(other.numCaptures)
+ , head(other.head)
+ , tail(other.tail) {
+ other.numCaptures = 0;
+ other.head = 0;
+ other.tail = 0;
+ my_memcpy(stackChunks, other.stackChunks,
+ unsigned(int(sizeof(Chunk)) * DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK));
+ }
+
+ public:
+ // cppcheck-suppress uninitMemberVar
+ DOCTEST_NOINLINE ContextBuilder() // NOLINT
+ : numCaptures(0)
+ , head(0)
+ , tail(0) {}
+
+ template <typename T>
+ DOCTEST_NOINLINE ContextBuilder& operator<<(T& in) {
+ Capture<T> temp(&in);
+
+ // construct either on stack or on heap
+ // copy the bytes for the whole object - including the vtable because we cant construct
+ // the object directly in the buffer using placement new - need the <new> header...
+ if (numCaptures < DOCTEST_CONFIG_NUM_CAPTURES_ON_STACK) {
+ my_memcpy(stackChunks[numCaptures].buf, &temp, sizeof(Chunk));
+ }
+ else {
+ Node* curr = new Node;
+ curr->next = 0;
+ if (tail) {
+ tail->next = curr;
+ tail = curr;
+ }
+ else {
+ head = tail = curr;
+ }
+
+ my_memcpy(tail->chunk.buf, &temp, sizeof(Chunk));
+ }
+ ++numCaptures;
+ return *this;
+ }
+
+ DOCTEST_NOINLINE ~ContextBuilder() {
+ // free the linked list - the ones on the stack are left as-is
+ // no destructors are called at all - there is no need
+ while (head) {
+ Node* next = head->next;
+ delete head;
+ head = next;
+ }
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ template <typename T>
+ ContextBuilder& operator<<(const T&&) {
+ DOCTEST_STATIC_ASSERT(
+ deferred_false<T>::value,
+ Cannot_pass_temporaries_or_rvalues_to_the_streaming_operator_because_it_caches_pointers_to_the_passed_objects_for_lazy_evaluation);
+ return *this;
+ }
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ };
+
+ class ContextScope : public IContextScope //!OCLINT destructor of virtual class
+ {
+ ContextBuilder contextBuilder;
+ bool built;
+
+ public:
+ DOCTEST_NOINLINE explicit ContextScope(ContextBuilder& temp)
+ : contextBuilder(temp)
+ , built(false) {
+ addToContexts(this);
+ }
+
+ DOCTEST_NOINLINE ~ContextScope() {
+ if (!built)
+ useContextIfExceptionOccurred(this);
+ popFromContexts();
+ }
+
+ void build(std::ostream* stream) {
+ built = true;
+ contextBuilder.build(stream);
+ }
+ };
+
+ class DOCTEST_INTERFACE MessageBuilder
+ {
+ std::ostream* m_stream;
+ const char* m_file;
+ int m_line;
+ doctest::detail::assertType::Enum m_severity;
+
+ public:
+ MessageBuilder(const char* file, int line, doctest::detail::assertType::Enum severity);
+ ~MessageBuilder();
+
+ template <typename T>
+ MessageBuilder& operator<<(const T& in) {
+ doctest::detail::toStream(m_stream, in);
+ return *this;
+ }
+
+ bool log();
+ void react();
+ };
+ } // namespace detail
+
+ struct test_suite
+ {
+ const char* data;
+ test_suite(const char* in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_test_suite = data; }
+ void fill(detail::TestSuite& state) const { state.m_test_suite = data; }
+ };
+
+ struct description
+ {
+ const char* data;
+ description(const char* in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_description = data; }
+ void fill(detail::TestSuite& state) const { state.m_description = data; }
+ };
+
+ struct skip
+ {
+ bool data;
+ skip(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_skip = data; }
+ void fill(detail::TestSuite& state) const { state.m_skip = data; }
+ };
+
+ struct timeout
+ {
+ double data;
+ timeout(double in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_timeout = data; }
+ void fill(detail::TestSuite& state) const { state.m_timeout = data; }
+ };
+
+ struct may_fail
+ {
+ bool data;
+ may_fail(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_may_fail = data; }
+ void fill(detail::TestSuite& state) const { state.m_may_fail = data; }
+ };
+
+ struct should_fail
+ {
+ bool data;
+ should_fail(bool in = true)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_should_fail = data; }
+ void fill(detail::TestSuite& state) const { state.m_should_fail = data; }
+ };
+
+ struct expected_failures
+ {
+ int data;
+ expected_failures(int in)
+ : data(in) {}
+ void fill(detail::TestCase& state) const { state.m_expected_failures = data; }
+ void fill(detail::TestSuite& state) const { state.m_expected_failures = data; }
+ };
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+#ifndef DOCTEST_CONFIG_DISABLE
+ template <typename T>
+ int registerExceptionTranslator(String(*translateFunction)(T)) {
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wexit-time-destructors"
+#endif // __clang__
+ static detail::ExceptionTranslator<T> exceptionTranslator(translateFunction);
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+ detail::registerExceptionTranslatorImpl(&exceptionTranslator);
+ return 0;
+ }
+
+#else // DOCTEST_CONFIG_DISABLE
+ template <typename T>
+ int registerExceptionTranslator(String(*)(T)) {
+ return 0;
+ }
+#endif // DOCTEST_CONFIG_DISABLE
+
+ DOCTEST_INTERFACE bool isRunningInTest();
+
+ // cppcheck-suppress noCopyConstructor
+ class DOCTEST_INTERFACE Context
+ {
+#if !defined(DOCTEST_CONFIG_DISABLE)
+ detail::ContextState* p;
+
+ void parseArgs(int argc, const char* const* argv, bool withDefaults = false);
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+ public:
+ explicit Context(int argc = 0, const char* const* argv = 0);
+
+ ~Context();
+
+ void applyCommandLine(int argc, const char* const* argv);
+
+ void addFilter(const char* filter, const char* value);
+ void clearFilters();
+ void setOption(const char* option, int value);
+ void setOption(const char* option, const char* value);
+
+ bool shouldExit();
+
+ int run();
+ };
+
+} // namespace doctest
+
+ // if registering is not disabled
+#if !defined(DOCTEST_CONFIG_DISABLE)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_EXPAND_VA_ARGS(...) __VA_ARGS__
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_EXPAND_VA_ARGS
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_STRIP_PARENS(x) x
+#define DOCTEST_HANDLE_BRACED_VA_ARGS(expr) DOCTEST_STRIP_PARENS(DOCTEST_EXPAND_VA_ARGS expr)
+
+ // registers the test by initializing a dummy var with a function
+#define DOCTEST_REGISTER_FUNCTION(f, decorators) \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = doctest::detail::regTest( \
+ doctest::detail::TestCase(f, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite()) * \
+ decorators); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END()
+
+#define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, decorators) \
+ namespace \
+ { \
+ struct der : base \
+ { void f(); }; \
+ static void func() { \
+ der v; \
+ v.f(); \
+ } \
+ DOCTEST_REGISTER_FUNCTION(func, decorators) \
+ } \
+ inline DOCTEST_NOINLINE void der::f()
+
+#define DOCTEST_CREATE_AND_REGISTER_FUNCTION(f, decorators) \
+ static void f(); \
+ DOCTEST_REGISTER_FUNCTION(f, decorators) \
+ static void f()
+
+ // for registering tests
+#define DOCTEST_TEST_CASE(decorators) \
+ DOCTEST_CREATE_AND_REGISTER_FUNCTION(DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), decorators)
+
+ // for registering tests with a fixture
+#define DOCTEST_TEST_CASE_FIXTURE(c, decorators) \
+ DOCTEST_IMPLEMENT_FIXTURE(DOCTEST_ANONYMOUS(_DOCTEST_ANON_CLASS_), c, \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), decorators)
+
+ // for converting types to strings without the <typeinfo> header and demangling
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING_IMPL(...) \
+ template <> \
+ inline const char* type_to_string<__VA_ARGS__>() { \
+ return "<" #__VA_ARGS__ ">"; \
+ }
+#define DOCTEST_TYPE_TO_STRING(...) \
+ namespace doctest \
+ { \
+ namespace detail \
+ { DOCTEST_TYPE_TO_STRING_IMPL(__VA_ARGS__) } \
+ } \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING_IMPL(x) \
+ template <> \
+ inline const char* type_to_string<x>() { \
+ return "<" #x ">"; \
+ }
+#define DOCTEST_TYPE_TO_STRING(x) \
+ namespace doctest \
+ { \
+ namespace detail \
+ { DOCTEST_TYPE_TO_STRING_IMPL(x) } \
+ } \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for typed tests
+#define DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, types, anon) \
+ template <typename T> \
+ inline void anon(); \
+ struct DOCTEST_CAT(anon, FUNCTOR) \
+ { \
+ template <int Index, typename Type> \
+ void operator()() { \
+ doctest::detail::regTest( \
+ doctest::detail::TestCase(anon<Type>, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite(), \
+ doctest::detail::type_to_string<Type>(), Index) * \
+ decorators); \
+ } \
+ }; \
+ inline int DOCTEST_CAT(anon, REG_FUNC)() { \
+ DOCTEST_CAT(anon, FUNCTOR) registrar; \
+ doctest::detail::ForEachType<DOCTEST_HANDLE_BRACED_VA_ARGS(types)::Result, \
+ DOCTEST_CAT(anon, FUNCTOR)> \
+ doIt(registrar); \
+ return 0; \
+ } \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_CAT(anon, DUMMY)) = DOCTEST_CAT(anon, REG_FUNC)(); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ template <typename T> \
+ inline void anon()
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE(decorators, T, ...) \
+ DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, (__VA_ARGS__), \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE(decorators, T, types) \
+ DOCTEST_TEST_CASE_TEMPLATE_IMPL(decorators, T, types, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE_IMPL(decorators, T, id, anon) \
+ template <typename T> \
+ inline void anon(); \
+ struct DOCTEST_CAT(id, _FUNCTOR) \
+ { \
+ int m_line; \
+ DOCTEST_CAT(id, _FUNCTOR) \
+ (int line) \
+ : m_line(line) {} \
+ template <int Index, typename Type> \
+ void operator()() { \
+ doctest::detail::regTest( \
+ doctest::detail::TestCase(anon<Type>, __FILE__, __LINE__, \
+ doctest_detail_test_suite_ns::getCurrentTestSuite(), \
+ doctest::detail::type_to_string<Type>(), \
+ m_line * 1000 + Index) * \
+ decorators); \
+ } \
+ }; \
+ template <typename T> \
+ inline void anon()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE(decorators, T, id) \
+ DOCTEST_TEST_CASE_TEMPLATE_DEFINE_IMPL(decorators, T, id, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, types, anon) \
+ static int DOCTEST_CAT(anon, REG_FUNC)() { \
+ DOCTEST_CAT(id, _FUNCTOR) registrar(__LINE__); \
+ doctest::detail::ForEachType<DOCTEST_HANDLE_BRACED_VA_ARGS(types)::Result, \
+ DOCTEST_CAT(id, _FUNCTOR)> \
+ doIt(registrar); \
+ return 0; \
+ } \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_CAT(anon, DUMMY)) = DOCTEST_CAT(anon, REG_FUNC)(); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, ...) \
+ DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, (__VA_ARGS__), \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, types) \
+ DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE_IMPL(id, types, DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_))
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for subcases
+#if defined(__GNUC__)
+#define DOCTEST_SUBCASE(name) \
+ if(const doctest::detail::Subcase & DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUBCASE_) \
+ __attribute__((unused)) = \
+ doctest::detail::Subcase(name, __FILE__, __LINE__))
+#else // __GNUC__
+#define DOCTEST_SUBCASE(name) \
+ if(const doctest::detail::Subcase & DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUBCASE_) = \
+ doctest::detail::Subcase(name, __FILE__, __LINE__))
+#endif // __GNUC__
+
+ // for grouping tests in test suites by using code blocks
+#define DOCTEST_TEST_SUITE_IMPL(decorators, ns_name) \
+ namespace ns_name \
+ { \
+ namespace doctest_detail_test_suite_ns \
+ { \
+ inline DOCTEST_NOINLINE doctest::detail::TestSuite& getCurrentTestSuite() { \
+ static doctest::detail::TestSuite data; \
+ static bool inited = false; \
+ if(!inited) { \
+ data* decorators; \
+ inited = true; \
+ } \
+ return data; \
+ } \
+ } \
+ } \
+ namespace ns_name
+
+#define DOCTEST_TEST_SUITE(decorators) \
+ DOCTEST_TEST_SUITE_IMPL(decorators, DOCTEST_ANONYMOUS(_DOCTEST_ANON_SUITE_))
+
+ // for starting a testsuite block
+#define DOCTEST_TEST_SUITE_BEGIN(decorators) \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = \
+ doctest::detail::setTestSuite(doctest::detail::TestSuite() * decorators); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for ending a testsuite block
+#define DOCTEST_TEST_SUITE_END \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_VAR_)) = \
+ doctest::detail::setTestSuite(doctest::detail::TestSuite() * ""); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for registering exception translators
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR_IMPL(translatorName, signature) \
+ static doctest::String translatorName(signature); \
+ DOCTEST_GLOBAL_NO_WARNINGS(DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_)) = \
+ doctest::registerExceptionTranslator(translatorName); \
+ DOCTEST_GLOBAL_NO_WARNINGS_END() \
+ static doctest::String translatorName(signature)
+
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR(signature) \
+ DOCTEST_REGISTER_EXCEPTION_TRANSLATOR_IMPL(DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_), \
+ signature)
+
+ // for logging
+#define DOCTEST_INFO(x) \
+ doctest::detail::ContextScope DOCTEST_ANONYMOUS(_DOCTEST_CAPTURE_)( \
+ doctest::detail::ContextBuilder() << x)
+#define DOCTEST_CAPTURE(x) DOCTEST_INFO(#x " := " << x)
+
+#define DOCTEST_ADD_AT_IMPL(type, file, line, mb, x) \
+ do { \
+ doctest::detail::MessageBuilder mb(file, line, doctest::detail::assertType::type); \
+ mb << x; \
+ if(mb.log()) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ mb.react(); \
+ } while((void)0, 0)
+
+ // clang-format off
+#define DOCTEST_ADD_MESSAGE_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_warn, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+#define DOCTEST_ADD_FAIL_CHECK_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_check, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+#define DOCTEST_ADD_FAIL_AT(file, line, x) DOCTEST_ADD_AT_IMPL(is_require, file, line, DOCTEST_ANONYMOUS(_DOCTEST_MESSAGE_), x)
+ // clang-format on
+
+#define DOCTEST_MESSAGE(x) DOCTEST_ADD_MESSAGE_AT(__FILE__, __LINE__, x)
+#define DOCTEST_FAIL_CHECK(x) DOCTEST_ADD_FAIL_CHECK_AT(__FILE__, __LINE__, x)
+#define DOCTEST_FAIL(x) DOCTEST_ADD_FAIL_AT(__FILE__, __LINE__, x)
+
+#if __cplusplus >= 201402L || (defined(_MSC_VER) && _MSC_VER >= 1910)
+template <class T, T x>
+constexpr T to_lvalue = x;
+#define DOCTEST_TO_LVALUE(...) to_lvalue<decltype(__VA_ARGS__), __VA_ARGS__>
+#else
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TO_LVALUE(...) TO_LVALUE_CAN_BE_USED_ONLY_IN_CPP14_MODE_OR_WITH_VS_2017_OR_NEWER
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TO_LVALUE(x) TO_LVALUE_CAN_BE_USED_ONLY_IN_CPP14_MODE_OR_WITH_VS_2017_OR_NEWER
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#endif // TO_LVALUE hack for logging macros like INFO()
+
+ // common code in asserts - for convenience
+#define DOCTEST_ASSERT_LOG_AND_REACT(rb) \
+ if(rb.log()) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ rb.react()
+
+#ifdef DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#define DOCTEST_WRAP_IN_TRY(x) x;
+#else // DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+#define DOCTEST_WRAP_IN_TRY(x) \
+ try { \
+ x; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); }
+#endif // DOCTEST_CONFIG_NO_TRY_CATCH_IN_ASSERTS
+
+#define DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type) \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY(_DOCTEST_RB.setResult( \
+ doctest::detail::ExpressionDecomposer(doctest::detail::assertType::assert_type) \
+ << DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB)
+
+#if defined(__clang__)
+#define DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type) \
+ _Pragma("clang diagnostic push") \
+ _Pragma("clang diagnostic ignored \"-Woverloaded-shift-op-parentheses\"") \
+ DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type); \
+ _Pragma("clang diagnostic pop")
+#else // __clang__
+#define DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type) DOCTEST_ASSERT_IMPLEMENT_3(expr, assert_type);
+#endif // __clang__
+
+#define DOCTEST_ASSERT_IMPLEMENT_1(expr, assert_type) \
+ do { \
+ DOCTEST_ASSERT_IMPLEMENT_2(expr, assert_type); \
+ } while((void)0, 0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_WARN)
+#define DOCTEST_CHECK(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_CHECK)
+#define DOCTEST_REQUIRE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_REQUIRE)
+#define DOCTEST_WARN_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_WARN_FALSE)
+#define DOCTEST_CHECK_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_CHECK_FALSE)
+#define DOCTEST_REQUIRE_FALSE(...) DOCTEST_ASSERT_IMPLEMENT_1((__VA_ARGS__), DT_REQUIRE_FALSE)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_WARN)
+#define DOCTEST_CHECK(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_CHECK)
+#define DOCTEST_REQUIRE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_REQUIRE)
+#define DOCTEST_WARN_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_WARN_FALSE)
+#define DOCTEST_CHECK_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_CHECK_FALSE)
+#define DOCTEST_REQUIRE_FALSE(expr) DOCTEST_ASSERT_IMPLEMENT_1(expr, DT_REQUIRE_FALSE)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_WARN); } while((void)0, 0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_CHECK); } while((void)0, 0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_REQUIRE); } while((void)0, 0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_WARN_FALSE); } while((void)0, 0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_CHECK_FALSE); } while((void)0, 0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2((cond), DT_REQUIRE_FALSE); } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_WARN); } while((void)0, 0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_CHECK); } while((void)0, 0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_REQUIRE); } while((void)0, 0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_WARN_FALSE); } while((void)0, 0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_CHECK_FALSE); } while((void)0, 0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) do { DOCTEST_INFO(msg); DOCTEST_ASSERT_IMPLEMENT_2(cond, DT_REQUIRE_FALSE); } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#define DOCTEST_ASSERT_THROWS(expr, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #expr); \
+ try { \
+ expr; \
+ } catch(...) { _DOCTEST_RB.m_threw = true; } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_ASSERT_THROWS_AS(expr, as, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #expr, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(as))); \
+ try { \
+ expr; \
+ } catch(DOCTEST_HANDLE_BRACED_VA_ARGS(as)) { \
+ _DOCTEST_RB.m_threw = true; \
+ _DOCTEST_RB.m_threw_as = true; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_ASSERT_NOTHROW(expr, assert_type) \
+ do { \
+ if(!doctest::detail::getTestsContextState()->no_throw) { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #expr); \
+ try { \
+ expr; \
+ } catch(...) { _DOCTEST_RB.unexpectedExceptionOccurred(); } \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } \
+ } while((void)0, 0)
+
+#define DOCTEST_WARN_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_WARN_THROWS)
+#define DOCTEST_CHECK_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_CHECK_THROWS)
+#define DOCTEST_REQUIRE_THROWS(expr) DOCTEST_ASSERT_THROWS(expr, DT_REQUIRE_THROWS)
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_WARN_THROWS_AS)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_CHECK_THROWS_AS)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) DOCTEST_ASSERT_THROWS_AS(expr, (__VA_ARGS__), DT_REQUIRE_THROWS_AS)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_WARN_THROWS_AS)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_CHECK_THROWS_AS)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) DOCTEST_ASSERT_THROWS_AS(expr, ex, DT_REQUIRE_THROWS_AS)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#define DOCTEST_WARN_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_WARN_NOTHROW)
+#define DOCTEST_CHECK_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_CHECK_NOTHROW)
+#define DOCTEST_REQUIRE_NOTHROW(expr) DOCTEST_ASSERT_NOTHROW(expr, DT_REQUIRE_NOTHROW)
+
+ // clang-format off
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_THROWS(expr); } while((void)0, 0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_THROWS_AS(expr, ex); } while((void)0, 0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_WARN_NOTHROW(expr); } while((void)0, 0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_CHECK_NOTHROW(expr); } while((void)0, 0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) do { DOCTEST_INFO(msg); DOCTEST_REQUIRE_NOTHROW(expr); } while((void)0, 0)
+ // clang-format on
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_BINARY_ASSERT(assert_type, expr, comp) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY( \
+ _DOCTEST_RB.binary_assert<doctest::detail::binaryAssertComparison::comp>( \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_BINARY_ASSERT(assert_type, lhs, rhs, comp) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB(doctest::detail::assertType::assert_type, \
+ __FILE__, __LINE__, #lhs ", " #rhs); \
+ DOCTEST_WRAP_IN_TRY( \
+ _DOCTEST_RB.binary_assert<doctest::detail::binaryAssertComparison::comp>(lhs, \
+ rhs)) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_UNARY_ASSERT(assert_type, expr) \
+ do { \
+ doctest::detail::ResultBuilder _DOCTEST_RB( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))); \
+ DOCTEST_WRAP_IN_TRY(_DOCTEST_RB.unary_assert(DOCTEST_HANDLE_BRACED_VA_ARGS(expr))) \
+ DOCTEST_ASSERT_LOG_AND_REACT(_DOCTEST_RB); \
+ } while((void)0, 0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_EQ(...) DOCTEST_BINARY_ASSERT(DT_WARN_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_CHECK_EQ(...) DOCTEST_BINARY_ASSERT(DT_CHECK_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_REQUIRE_EQ(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_WARN_NE(...) DOCTEST_BINARY_ASSERT(DT_WARN_NE, (__VA_ARGS__), ne)
+#define DOCTEST_CHECK_NE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_NE, (__VA_ARGS__), ne)
+#define DOCTEST_REQUIRE_NE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_NE, (__VA_ARGS__), ne)
+#define DOCTEST_WARN_GT(...) DOCTEST_BINARY_ASSERT(DT_WARN_GT, (__VA_ARGS__), gt)
+#define DOCTEST_CHECK_GT(...) DOCTEST_BINARY_ASSERT(DT_CHECK_GT, (__VA_ARGS__), gt)
+#define DOCTEST_REQUIRE_GT(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GT, (__VA_ARGS__), gt)
+#define DOCTEST_WARN_LT(...) DOCTEST_BINARY_ASSERT(DT_WARN_LT, (__VA_ARGS__), lt)
+#define DOCTEST_CHECK_LT(...) DOCTEST_BINARY_ASSERT(DT_CHECK_LT, (__VA_ARGS__), lt)
+#define DOCTEST_REQUIRE_LT(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LT, (__VA_ARGS__), lt)
+#define DOCTEST_WARN_GE(...) DOCTEST_BINARY_ASSERT(DT_WARN_GE, (__VA_ARGS__), ge)
+#define DOCTEST_CHECK_GE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_GE, (__VA_ARGS__), ge)
+#define DOCTEST_REQUIRE_GE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GE, (__VA_ARGS__), ge)
+#define DOCTEST_WARN_LE(...) DOCTEST_BINARY_ASSERT(DT_WARN_LE, (__VA_ARGS__), le)
+#define DOCTEST_CHECK_LE(...) DOCTEST_BINARY_ASSERT(DT_CHECK_LE, (__VA_ARGS__), le)
+#define DOCTEST_REQUIRE_LE(...) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LE, (__VA_ARGS__), le)
+
+#define DOCTEST_WARN_UNARY(...) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY, (__VA_ARGS__))
+#define DOCTEST_CHECK_UNARY(...) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY, (__VA_ARGS__))
+#define DOCTEST_REQUIRE_UNARY(...) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY, (__VA_ARGS__))
+#define DOCTEST_WARN_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_CHECK_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_REQUIRE_UNARY_FALSE(...) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY_FALSE, (__VA_ARGS__))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_EQ, lhs, rhs, eq)
+#define DOCTEST_CHECK_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_EQ, lhs, rhs, eq)
+#define DOCTEST_REQUIRE_EQ(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_EQ, lhs, rhs, eq)
+#define DOCTEST_WARN_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_NE, lhs, rhs, ne)
+#define DOCTEST_CHECK_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_NE, lhs, rhs, ne)
+#define DOCTEST_REQUIRE_NE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_NE, lhs, rhs, ne)
+#define DOCTEST_WARN_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_GT, lhs, rhs, gt)
+#define DOCTEST_CHECK_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_GT, lhs, rhs, gt)
+#define DOCTEST_REQUIRE_GT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GT, lhs, rhs, gt)
+#define DOCTEST_WARN_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_LT, lhs, rhs, lt)
+#define DOCTEST_CHECK_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_LT, lhs, rhs, lt)
+#define DOCTEST_REQUIRE_LT(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LT, lhs, rhs, lt)
+#define DOCTEST_WARN_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_GE, lhs, rhs, ge)
+#define DOCTEST_CHECK_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_GE, lhs, rhs, ge)
+#define DOCTEST_REQUIRE_GE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_GE, lhs, rhs, ge)
+#define DOCTEST_WARN_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_WARN_LE, lhs, rhs, le)
+#define DOCTEST_CHECK_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_CHECK_LE, lhs, rhs, le)
+#define DOCTEST_REQUIRE_LE(lhs, rhs) DOCTEST_BINARY_ASSERT(DT_REQUIRE_LE, lhs, rhs, le)
+
+#define DOCTEST_WARN_UNARY(v) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY, v)
+#define DOCTEST_CHECK_UNARY(v) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY, v)
+#define DOCTEST_REQUIRE_UNARY(v) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY, v)
+#define DOCTEST_WARN_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_WARN_UNARY_FALSE, v)
+#define DOCTEST_CHECK_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_CHECK_UNARY_FALSE, v)
+#define DOCTEST_REQUIRE_UNARY_FALSE(v) DOCTEST_UNARY_ASSERT(DT_REQUIRE_UNARY_FALSE, v)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#ifndef DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, expr, comparison) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_binary_assert< \
+ doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr)); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, lhs, rhs, comparison) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_binary_assert< \
+ doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #lhs ", " #rhs, lhs, \
+ rhs); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_FAST_UNARY_ASSERT(assert_type, expr) \
+ do { \
+ int _DOCTEST_FAST_RES = doctest::detail::fast_unary_assert( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr)); \
+ if(_DOCTEST_FAST_RES & doctest::detail::assertAction::dbgbreak) \
+ DOCTEST_BREAK_INTO_DEBUGGER(); \
+ doctest::detail::fastAssertThrowIfFlagSet(_DOCTEST_FAST_RES); \
+ } while((void)0, 0)
+
+#else // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, expr, comparison) \
+ doctest::detail::fast_binary_assert<doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_BINARY_ASSERT(assert_type, lhs, rhs, comparison) \
+ doctest::detail::fast_binary_assert<doctest::detail::binaryAssertComparison::comparison>( \
+ doctest::detail::assertType::assert_type, __FILE__, __LINE__, #lhs ", " #rhs, lhs, \
+ rhs)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_FAST_UNARY_ASSERT(assert_type, expr) \
+ doctest::detail::fast_unary_assert(doctest::detail::assertType::assert_type, __FILE__, \
+ __LINE__, \
+ DOCTEST_TOSTR(DOCTEST_HANDLE_BRACED_VA_ARGS(expr)), \
+ DOCTEST_HANDLE_BRACED_VA_ARGS(expr))
+
+#endif // DOCTEST_CONFIG_SUPER_FAST_ASSERTS
+
+ // clang-format off
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_WARN_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_CHECK_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_REQUIRE_EQ(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_EQ, (__VA_ARGS__), eq)
+#define DOCTEST_FAST_WARN_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_CHECK_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_REQUIRE_NE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_NE, (__VA_ARGS__), ne)
+#define DOCTEST_FAST_WARN_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_CHECK_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_REQUIRE_GT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GT, (__VA_ARGS__), gt)
+#define DOCTEST_FAST_WARN_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_CHECK_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_REQUIRE_LT(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LT, (__VA_ARGS__), lt)
+#define DOCTEST_FAST_WARN_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_CHECK_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_REQUIRE_GE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GE, (__VA_ARGS__), ge)
+#define DOCTEST_FAST_WARN_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LE, (__VA_ARGS__), le)
+#define DOCTEST_FAST_CHECK_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LE, (__VA_ARGS__), le)
+#define DOCTEST_FAST_REQUIRE_LE(...) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LE, (__VA_ARGS__), le)
+
+#define DOCTEST_FAST_WARN_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_CHECK_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_REQUIRE_UNARY(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY, (__VA_ARGS__))
+#define DOCTEST_FAST_WARN_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY_FALSE, (__VA_ARGS__))
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(...) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY_FALSE, (__VA_ARGS__))
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_FAST_WARN_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_EQ, l, r, eq)
+#define DOCTEST_FAST_CHECK_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_EQ, l, r, eq)
+#define DOCTEST_FAST_REQUIRE_EQ(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_EQ, l, r, eq)
+#define DOCTEST_FAST_WARN_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_NE, l, r, ne)
+#define DOCTEST_FAST_CHECK_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_NE, l, r, ne)
+#define DOCTEST_FAST_REQUIRE_NE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_NE, l, r, ne)
+#define DOCTEST_FAST_WARN_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GT, l, r, gt)
+#define DOCTEST_FAST_CHECK_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GT, l, r, gt)
+#define DOCTEST_FAST_REQUIRE_GT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GT, l, r, gt)
+#define DOCTEST_FAST_WARN_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LT, l, r, lt)
+#define DOCTEST_FAST_CHECK_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LT, l, r, lt)
+#define DOCTEST_FAST_REQUIRE_LT(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LT, l, r, lt)
+#define DOCTEST_FAST_WARN_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_GE, l, r, ge)
+#define DOCTEST_FAST_CHECK_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_GE, l, r, ge)
+#define DOCTEST_FAST_REQUIRE_GE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_GE, l, r, ge)
+#define DOCTEST_FAST_WARN_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_WARN_LE, l, r, le)
+#define DOCTEST_FAST_CHECK_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_CHECK_LE, l, r, le)
+#define DOCTEST_FAST_REQUIRE_LE(l, r) DOCTEST_FAST_BINARY_ASSERT(DT_FAST_REQUIRE_LE, l, r, le)
+
+#define DOCTEST_FAST_WARN_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY, v)
+#define DOCTEST_FAST_CHECK_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY, v)
+#define DOCTEST_FAST_REQUIRE_UNARY(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY, v)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_WARN_UNARY_FALSE, v)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_CHECK_UNARY_FALSE, v)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(v) DOCTEST_FAST_UNARY_ASSERT(DT_FAST_REQUIRE_UNARY_FALSE, v)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+ // clang-format on
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS
+
+#undef DOCTEST_WARN_THROWS
+#undef DOCTEST_CHECK_THROWS
+#undef DOCTEST_REQUIRE_THROWS
+#undef DOCTEST_WARN_THROWS_AS
+#undef DOCTEST_CHECK_THROWS_AS
+#undef DOCTEST_REQUIRE_THROWS_AS
+#undef DOCTEST_WARN_NOTHROW
+#undef DOCTEST_CHECK_NOTHROW
+#undef DOCTEST_REQUIRE_NOTHROW
+
+#undef DOCTEST_WARN_THROWS_MESSAGE
+#undef DOCTEST_CHECK_THROWS_MESSAGE
+#undef DOCTEST_REQUIRE_THROWS_MESSAGE
+#undef DOCTEST_WARN_THROWS_AS_MESSAGE
+#undef DOCTEST_CHECK_THROWS_AS_MESSAGE
+#undef DOCTEST_REQUIRE_THROWS_AS_MESSAGE
+#undef DOCTEST_WARN_NOTHROW_MESSAGE
+#undef DOCTEST_CHECK_NOTHROW_MESSAGE
+#undef DOCTEST_REQUIRE_NOTHROW_MESSAGE
+
+#ifdef DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#define DOCTEST_WARN_THROWS(expr) ((void)0)
+#define DOCTEST_CHECK_THROWS(expr) ((void)0)
+#define DOCTEST_REQUIRE_THROWS(expr) ((void)0)
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_NOTHROW(expr) ((void)0)
+#define DOCTEST_CHECK_NOTHROW(expr) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW(expr) ((void)0)
+
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) ((void)0)
+
+#else // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#undef DOCTEST_REQUIRE
+#undef DOCTEST_REQUIRE_FALSE
+#undef DOCTEST_REQUIRE_MESSAGE
+#undef DOCTEST_REQUIRE_FALSE_MESSAGE
+#undef DOCTEST_REQUIRE_EQ
+#undef DOCTEST_REQUIRE_NE
+#undef DOCTEST_REQUIRE_GT
+#undef DOCTEST_REQUIRE_LT
+#undef DOCTEST_REQUIRE_GE
+#undef DOCTEST_REQUIRE_LE
+#undef DOCTEST_REQUIRE_UNARY
+#undef DOCTEST_REQUIRE_UNARY_FALSE
+#undef DOCTEST_FAST_REQUIRE_EQ
+#undef DOCTEST_FAST_REQUIRE_NE
+#undef DOCTEST_FAST_REQUIRE_GT
+#undef DOCTEST_FAST_REQUIRE_LT
+#undef DOCTEST_FAST_REQUIRE_GE
+#undef DOCTEST_FAST_REQUIRE_LE
+#undef DOCTEST_FAST_REQUIRE_UNARY
+#undef DOCTEST_FAST_REQUIRE_UNARY_FALSE
+
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS_BUT_WITH_ALL_ASSERTS
+
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+ // =================================================================================================
+ // == WHAT FOLLOWS IS VERSIONS OF THE MACROS THAT DO NOT DO ANY REGISTERING! ==
+ // == THIS CAN BE ENABLED BY DEFINING DOCTEST_CONFIG_DISABLE GLOBALLY! ==
+ // =================================================================================================
+#else // DOCTEST_CONFIG_DISABLE
+
+#define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, name) \
+ namespace \
+ { \
+ template <typename T> \
+ struct der : base \
+ { void f(); }; \
+ } \
+ template <typename T> \
+ inline void der<T>::f()
+
+#define DOCTEST_CREATE_AND_REGISTER_FUNCTION(f, name) \
+ template <typename T> \
+ static inline void f()
+
+ // for registering tests
+#define DOCTEST_TEST_CASE(name) \
+ DOCTEST_CREATE_AND_REGISTER_FUNCTION(DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), name)
+
+ // for registering tests with a fixture
+#define DOCTEST_TEST_CASE_FIXTURE(x, name) \
+ DOCTEST_IMPLEMENT_FIXTURE(DOCTEST_ANONYMOUS(_DOCTEST_ANON_CLASS_), x, \
+ DOCTEST_ANONYMOUS(_DOCTEST_ANON_FUNC_), name)
+
+ // for converting types to strings without the <typeinfo> header and demangling
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING(...) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#define DOCTEST_TYPE_TO_STRING_IMPL(...)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_TYPE_TO_STRING(x) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+#define DOCTEST_TYPE_TO_STRING_IMPL(x)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+ // for typed tests
+#define DOCTEST_TEST_CASE_TEMPLATE(name, type, types) \
+ template <typename type> \
+ inline void DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_)()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_DEFINE(name, type, id) \
+ template <typename type> \
+ inline void DOCTEST_ANONYMOUS(_DOCTEST_ANON_TMP_)()
+
+#define DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE(id, types) \
+ typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for subcases
+#define DOCTEST_SUBCASE(name)
+
+ // for a testsuite block
+#define DOCTEST_TEST_SUITE(name) namespace
+
+ // for starting a testsuite block
+#define DOCTEST_TEST_SUITE_BEGIN(name) typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+ // for ending a testsuite block
+#define DOCTEST_TEST_SUITE_END typedef int DOCTEST_ANONYMOUS(_DOCTEST_ANON_FOR_SEMICOLON_)
+
+#define DOCTEST_REGISTER_EXCEPTION_TRANSLATOR(signature) \
+ template <typename T> \
+ static inline doctest::String DOCTEST_ANONYMOUS(_DOCTEST_ANON_TRANSLATOR_)(signature)
+
+#define DOCTEST_INFO(x) ((void)0)
+#define DOCTEST_CAPTURE(x) ((void)0)
+#define DOCTEST_ADD_MESSAGE_AT(file, line, x) ((void)0)
+#define DOCTEST_ADD_FAIL_CHECK_AT(file, line, x) ((void)0)
+#define DOCTEST_ADD_FAIL_AT(file, line, x) ((void)0)
+#define DOCTEST_MESSAGE(x) ((void)0)
+#define DOCTEST_FAIL_CHECK(x) ((void)0)
+#define DOCTEST_FAIL(x) ((void)0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(...) ((void)0)
+#define DOCTEST_CHECK(...) ((void)0)
+#define DOCTEST_REQUIRE(...) ((void)0)
+#define DOCTEST_WARN_FALSE(...) ((void)0)
+#define DOCTEST_CHECK_FALSE(...) ((void)0)
+#define DOCTEST_REQUIRE_FALSE(...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN(expr) ((void)0)
+#define DOCTEST_CHECK(expr) ((void)0)
+#define DOCTEST_REQUIRE(expr) ((void)0)
+#define DOCTEST_WARN_FALSE(expr) ((void)0)
+#define DOCTEST_CHECK_FALSE(expr) ((void)0)
+#define DOCTEST_REQUIRE_FALSE(expr) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_CHECK_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_REQUIRE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_WARN_FALSE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_CHECK_FALSE_MESSAGE(cond, msg) ((void)0)
+#define DOCTEST_REQUIRE_FALSE_MESSAGE(cond, msg) ((void)0)
+
+#define DOCTEST_WARN_THROWS(expr) ((void)0)
+#define DOCTEST_CHECK_THROWS(expr) ((void)0)
+#define DOCTEST_REQUIRE_THROWS(expr) ((void)0)
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ...) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ...) ((void)0)
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS(expr, ex) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS(expr, ex) ((void)0)
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+#define DOCTEST_WARN_NOTHROW(expr) ((void)0)
+#define DOCTEST_CHECK_NOTHROW(expr) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW(expr) ((void)0)
+
+#define DOCTEST_WARN_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_WARN_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_CHECK_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_REQUIRE_THROWS_AS_MESSAGE(expr, ex, msg) ((void)0)
+#define DOCTEST_WARN_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_CHECK_NOTHROW_MESSAGE(expr, msg) ((void)0)
+#define DOCTEST_REQUIRE_NOTHROW_MESSAGE(expr, msg) ((void)0)
+
+#ifdef DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_EQ(...) ((void)0)
+#define DOCTEST_CHECK_EQ(...) ((void)0)
+#define DOCTEST_REQUIRE_EQ(...) ((void)0)
+#define DOCTEST_WARN_NE(...) ((void)0)
+#define DOCTEST_CHECK_NE(...) ((void)0)
+#define DOCTEST_REQUIRE_NE(...) ((void)0)
+#define DOCTEST_WARN_GT(...) ((void)0)
+#define DOCTEST_CHECK_GT(...) ((void)0)
+#define DOCTEST_REQUIRE_GT(...) ((void)0)
+#define DOCTEST_WARN_LT(...) ((void)0)
+#define DOCTEST_CHECK_LT(...) ((void)0)
+#define DOCTEST_REQUIRE_LT(...) ((void)0)
+#define DOCTEST_WARN_GE(...) ((void)0)
+#define DOCTEST_CHECK_GE(...) ((void)0)
+#define DOCTEST_REQUIRE_GE(...) ((void)0)
+#define DOCTEST_WARN_LE(...) ((void)0)
+#define DOCTEST_CHECK_LE(...) ((void)0)
+#define DOCTEST_REQUIRE_LE(...) ((void)0)
+
+#define DOCTEST_WARN_UNARY(...) ((void)0)
+#define DOCTEST_CHECK_UNARY(...) ((void)0)
+#define DOCTEST_REQUIRE_UNARY(...) ((void)0)
+#define DOCTEST_WARN_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_CHECK_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_REQUIRE_UNARY_FALSE(...) ((void)0)
+
+#define DOCTEST_FAST_WARN_EQ(...) ((void)0)
+#define DOCTEST_FAST_CHECK_EQ(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_EQ(...) ((void)0)
+#define DOCTEST_FAST_WARN_NE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_NE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_NE(...) ((void)0)
+#define DOCTEST_FAST_WARN_GT(...) ((void)0)
+#define DOCTEST_FAST_CHECK_GT(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GT(...) ((void)0)
+#define DOCTEST_FAST_WARN_LT(...) ((void)0)
+#define DOCTEST_FAST_CHECK_LT(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LT(...) ((void)0)
+#define DOCTEST_FAST_WARN_GE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_GE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GE(...) ((void)0)
+#define DOCTEST_FAST_WARN_LE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_LE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LE(...) ((void)0)
+
+#define DOCTEST_FAST_WARN_UNARY(...) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY(...) ((void)0)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(...) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(...) ((void)0)
+
+#else // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#define DOCTEST_WARN_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_NE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_NE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_NE(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_GT(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_GT(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_GT(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_LT(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_LT(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_LT(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_GE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_GE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_GE(lhs, rhs) ((void)0)
+#define DOCTEST_WARN_LE(lhs, rhs) ((void)0)
+#define DOCTEST_CHECK_LE(lhs, rhs) ((void)0)
+#define DOCTEST_REQUIRE_LE(lhs, rhs) ((void)0)
+
+#define DOCTEST_WARN_UNARY(val) ((void)0)
+#define DOCTEST_CHECK_UNARY(val) ((void)0)
+#define DOCTEST_REQUIRE_UNARY(val) ((void)0)
+#define DOCTEST_WARN_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_CHECK_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_REQUIRE_UNARY_FALSE(val) ((void)0)
+
+#define DOCTEST_FAST_WARN_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_EQ(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_NE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LT(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_GE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_WARN_LE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_CHECK_LE(lhs, rhs) ((void)0)
+#define DOCTEST_FAST_REQUIRE_LE(lhs, rhs) ((void)0)
+
+#define DOCTEST_FAST_WARN_UNARY(val) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY(val) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY(val) ((void)0)
+#define DOCTEST_FAST_WARN_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_FAST_CHECK_UNARY_FALSE(val) ((void)0)
+#define DOCTEST_FAST_REQUIRE_UNARY_FALSE(val) ((void)0)
+
+#endif // DOCTEST_CONFIG_WITH_VARIADIC_MACROS
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+ // BDD style macros
+ // clang-format off
+#define DOCTEST_SCENARIO(name) TEST_CASE(" Scenario: " name)
+#define DOCTEST_GIVEN(name) SUBCASE(" Given: " name)
+#define DOCTEST_WHEN(name) SUBCASE(" When: " name)
+#define DOCTEST_AND_WHEN(name) SUBCASE("And when: " name)
+#define DOCTEST_THEN(name) SUBCASE(" Then: " name)
+#define DOCTEST_AND_THEN(name) SUBCASE(" And: " name)
+ // clang-format on
+
+ // == SHORT VERSIONS OF THE MACROS
+#if !defined(DOCTEST_CONFIG_NO_SHORT_MACRO_NAMES)
+
+#define TEST_CASE DOCTEST_TEST_CASE
+#define TEST_CASE_FIXTURE DOCTEST_TEST_CASE_FIXTURE
+#define TYPE_TO_STRING DOCTEST_TYPE_TO_STRING
+#define TEST_CASE_TEMPLATE DOCTEST_TEST_CASE_TEMPLATE
+#define TEST_CASE_TEMPLATE_DEFINE DOCTEST_TEST_CASE_TEMPLATE_DEFINE
+#define TEST_CASE_TEMPLATE_INSTANTIATE DOCTEST_TEST_CASE_TEMPLATE_INSTANTIATE
+#define SUBCASE DOCTEST_SUBCASE
+#define TEST_SUITE DOCTEST_TEST_SUITE
+#define TEST_SUITE_BEGIN DOCTEST_TEST_SUITE_BEGIN
+#define TEST_SUITE_END DOCTEST_TEST_SUITE_END
+#define REGISTER_EXCEPTION_TRANSLATOR DOCTEST_REGISTER_EXCEPTION_TRANSLATOR
+#define INFO DOCTEST_INFO
+#define CAPTURE DOCTEST_CAPTURE
+#define ADD_MESSAGE_AT DOCTEST_ADD_MESSAGE_AT
+#define ADD_FAIL_CHECK_AT DOCTEST_ADD_FAIL_CHECK_AT
+#define ADD_FAIL_AT DOCTEST_ADD_FAIL_AT
+#define MESSAGE DOCTEST_MESSAGE
+#define FAIL_CHECK DOCTEST_FAIL_CHECK
+#define FAIL DOCTEST_FAIL
+#define TO_LVALUE DOCTEST_TO_LVALUE
+
+#define WARN DOCTEST_WARN
+#define WARN_FALSE DOCTEST_WARN_FALSE
+#define WARN_THROWS DOCTEST_WARN_THROWS
+#define WARN_THROWS_AS DOCTEST_WARN_THROWS_AS
+#define WARN_NOTHROW DOCTEST_WARN_NOTHROW
+#define CHECK DOCTEST_CHECK
+#define CHECK_FALSE DOCTEST_CHECK_FALSE
+#define CHECK_THROWS DOCTEST_CHECK_THROWS
+#define CHECK_THROWS_AS DOCTEST_CHECK_THROWS_AS
+#define CHECK_NOTHROW DOCTEST_CHECK_NOTHROW
+#define REQUIRE DOCTEST_REQUIRE
+#define REQUIRE_FALSE DOCTEST_REQUIRE_FALSE
+#define REQUIRE_THROWS DOCTEST_REQUIRE_THROWS
+#define REQUIRE_THROWS_AS DOCTEST_REQUIRE_THROWS_AS
+#define REQUIRE_NOTHROW DOCTEST_REQUIRE_NOTHROW
+
+#define WARN_MESSAGE DOCTEST_WARN_MESSAGE
+#define WARN_FALSE_MESSAGE DOCTEST_WARN_FALSE_MESSAGE
+#define WARN_THROWS_MESSAGE DOCTEST_WARN_THROWS_MESSAGE
+#define WARN_THROWS_AS_MESSAGE DOCTEST_WARN_THROWS_AS_MESSAGE
+#define WARN_NOTHROW_MESSAGE DOCTEST_WARN_NOTHROW_MESSAGE
+#define CHECK_MESSAGE DOCTEST_CHECK_MESSAGE
+#define CHECK_FALSE_MESSAGE DOCTEST_CHECK_FALSE_MESSAGE
+#define CHECK_THROWS_MESSAGE DOCTEST_CHECK_THROWS_MESSAGE
+#define CHECK_THROWS_AS_MESSAGE DOCTEST_CHECK_THROWS_AS_MESSAGE
+#define CHECK_NOTHROW_MESSAGE DOCTEST_CHECK_NOTHROW_MESSAGE
+#define REQUIRE_MESSAGE DOCTEST_REQUIRE_MESSAGE
+#define REQUIRE_FALSE_MESSAGE DOCTEST_REQUIRE_FALSE_MESSAGE
+#define REQUIRE_THROWS_MESSAGE DOCTEST_REQUIRE_THROWS_MESSAGE
+#define REQUIRE_THROWS_AS_MESSAGE DOCTEST_REQUIRE_THROWS_AS_MESSAGE
+#define REQUIRE_NOTHROW_MESSAGE DOCTEST_REQUIRE_NOTHROW_MESSAGE
+
+#define SCENARIO DOCTEST_SCENARIO
+#define GIVEN DOCTEST_GIVEN
+#define WHEN DOCTEST_WHEN
+#define AND_WHEN DOCTEST_AND_WHEN
+#define THEN DOCTEST_THEN
+#define AND_THEN DOCTEST_AND_THEN
+
+#define WARN_EQ DOCTEST_WARN_EQ
+#define CHECK_EQ DOCTEST_CHECK_EQ
+#define REQUIRE_EQ DOCTEST_REQUIRE_EQ
+#define WARN_NE DOCTEST_WARN_NE
+#define CHECK_NE DOCTEST_CHECK_NE
+#define REQUIRE_NE DOCTEST_REQUIRE_NE
+#define WARN_GT DOCTEST_WARN_GT
+#define CHECK_GT DOCTEST_CHECK_GT
+#define REQUIRE_GT DOCTEST_REQUIRE_GT
+#define WARN_LT DOCTEST_WARN_LT
+#define CHECK_LT DOCTEST_CHECK_LT
+#define REQUIRE_LT DOCTEST_REQUIRE_LT
+#define WARN_GE DOCTEST_WARN_GE
+#define CHECK_GE DOCTEST_CHECK_GE
+#define REQUIRE_GE DOCTEST_REQUIRE_GE
+#define WARN_LE DOCTEST_WARN_LE
+#define CHECK_LE DOCTEST_CHECK_LE
+#define REQUIRE_LE DOCTEST_REQUIRE_LE
+#define WARN_UNARY DOCTEST_WARN_UNARY
+#define CHECK_UNARY DOCTEST_CHECK_UNARY
+#define REQUIRE_UNARY DOCTEST_REQUIRE_UNARY
+#define WARN_UNARY_FALSE DOCTEST_WARN_UNARY_FALSE
+#define CHECK_UNARY_FALSE DOCTEST_CHECK_UNARY_FALSE
+#define REQUIRE_UNARY_FALSE DOCTEST_REQUIRE_UNARY_FALSE
+
+#define FAST_WARN_EQ DOCTEST_FAST_WARN_EQ
+#define FAST_CHECK_EQ DOCTEST_FAST_CHECK_EQ
+#define FAST_REQUIRE_EQ DOCTEST_FAST_REQUIRE_EQ
+#define FAST_WARN_NE DOCTEST_FAST_WARN_NE
+#define FAST_CHECK_NE DOCTEST_FAST_CHECK_NE
+#define FAST_REQUIRE_NE DOCTEST_FAST_REQUIRE_NE
+#define FAST_WARN_GT DOCTEST_FAST_WARN_GT
+#define FAST_CHECK_GT DOCTEST_FAST_CHECK_GT
+#define FAST_REQUIRE_GT DOCTEST_FAST_REQUIRE_GT
+#define FAST_WARN_LT DOCTEST_FAST_WARN_LT
+#define FAST_CHECK_LT DOCTEST_FAST_CHECK_LT
+#define FAST_REQUIRE_LT DOCTEST_FAST_REQUIRE_LT
+#define FAST_WARN_GE DOCTEST_FAST_WARN_GE
+#define FAST_CHECK_GE DOCTEST_FAST_CHECK_GE
+#define FAST_REQUIRE_GE DOCTEST_FAST_REQUIRE_GE
+#define FAST_WARN_LE DOCTEST_FAST_WARN_LE
+#define FAST_CHECK_LE DOCTEST_FAST_CHECK_LE
+#define FAST_REQUIRE_LE DOCTEST_FAST_REQUIRE_LE
+#define FAST_WARN_UNARY DOCTEST_FAST_WARN_UNARY
+#define FAST_CHECK_UNARY DOCTEST_FAST_CHECK_UNARY
+#define FAST_REQUIRE_UNARY DOCTEST_FAST_REQUIRE_UNARY
+#define FAST_WARN_UNARY_FALSE DOCTEST_FAST_WARN_UNARY_FALSE
+#define FAST_CHECK_UNARY_FALSE DOCTEST_FAST_CHECK_UNARY_FALSE
+#define FAST_REQUIRE_UNARY_FALSE DOCTEST_FAST_REQUIRE_UNARY_FALSE
+
+#endif // DOCTEST_CONFIG_NO_SHORT_MACRO_NAMES
+
+ // this is here to clear the 'current test suite' for the current translation unit - at the top
+DOCTEST_TEST_SUITE_END();
+
+// add stringification for primitive/fundamental types
+namespace doctest
+{
+ namespace detail
+ {
+ DOCTEST_TYPE_TO_STRING_IMPL(bool)
+ DOCTEST_TYPE_TO_STRING_IMPL(float)
+ DOCTEST_TYPE_TO_STRING_IMPL(double)
+ DOCTEST_TYPE_TO_STRING_IMPL(long double)
+ DOCTEST_TYPE_TO_STRING_IMPL(char)
+ DOCTEST_TYPE_TO_STRING_IMPL(signed char)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned char)
+ DOCTEST_TYPE_TO_STRING_IMPL(wchar_t)
+ DOCTEST_TYPE_TO_STRING_IMPL(short int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned short int)
+ DOCTEST_TYPE_TO_STRING_IMPL(int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned int)
+ DOCTEST_TYPE_TO_STRING_IMPL(long int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned long int)
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ DOCTEST_TYPE_TO_STRING_IMPL(long long int)
+ DOCTEST_TYPE_TO_STRING_IMPL(unsigned long long int)
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+ } // namespace detail
+} // namespace doctest
+
+#endif // DOCTEST_LIBRARY_INCLUDED
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
+
+#ifndef DOCTEST_SINGLE_HEADER
+#define DOCTEST_SINGLE_HEADER
+#endif // DOCTEST_SINGLE_HEADER
+
+#if defined(__clang__)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunknown-pragmas"
+#pragma clang diagnostic ignored "-Wpadded"
+#pragma clang diagnostic ignored "-Wglobal-constructors"
+#pragma clang diagnostic ignored "-Wexit-time-destructors"
+#pragma clang diagnostic ignored "-Wmissing-prototypes"
+#pragma clang diagnostic ignored "-Wsign-conversion"
+#pragma clang diagnostic ignored "-Wshorten-64-to-32"
+#pragma clang diagnostic ignored "-Wmissing-variable-declarations"
+#pragma clang diagnostic ignored "-Wswitch"
+#pragma clang diagnostic ignored "-Wswitch-enum"
+#pragma clang diagnostic ignored "-Wcovered-switch-default"
+#pragma clang diagnostic ignored "-Wmissing-noreturn"
+#pragma clang diagnostic ignored "-Wunused-local-typedef"
+#pragma clang diagnostic ignored "-Wdisabled-macro-expansion"
+#pragma clang diagnostic ignored "-Wmissing-braces"
+#pragma clang diagnostic ignored "-Wmissing-field-initializers"
+#pragma clang diagnostic ignored "-Wzero-as-null-pointer-constant"
+#pragma clang diagnostic ignored "-Wc++11-long-long"
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic push
+#endif // > gcc 4.6
+#pragma GCC diagnostic ignored "-Wunknown-pragmas"
+#pragma GCC diagnostic ignored "-Wconversion"
+#pragma GCC diagnostic ignored "-Weffc++"
+#pragma GCC diagnostic ignored "-Wsign-conversion"
+#pragma GCC diagnostic ignored "-Wstrict-overflow"
+#pragma GCC diagnostic ignored "-Wmissing-field-initializers"
+#pragma GCC diagnostic ignored "-Wmissing-braces"
+#pragma GCC diagnostic ignored "-Wmissing-declarations"
+#pragma GCC diagnostic ignored "-Winline"
+#pragma GCC diagnostic ignored "-Wswitch"
+#pragma GCC diagnostic ignored "-Wswitch-enum"
+#pragma GCC diagnostic ignored "-Wswitch-default"
+#pragma GCC diagnostic ignored "-Wunsafe-loop-optimizations"
+#pragma GCC diagnostic ignored "-Wlong-long"
+#pragma GCC diagnostic ignored "-Wold-style-cast"
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic ignored "-Wzero-as-null-pointer-constant"
+#endif // > gcc 4.6
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 7)
+#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
+#endif // > gcc 4.7
+#if __GNUC__ > 5 || (__GNUC__ == 5 && __GNUC_MINOR__ > 3)
+#pragma GCC diagnostic ignored "-Wuseless-cast"
+#endif // > gcc 5.3
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable : 4996) // The compiler encountered a deprecated declaration
+#pragma warning(disable : 4267) // 'var' : conversion from 'size_t' to 'type', possible loss of data
+#pragma warning(disable : 4706) // assignment within conditional expression
+#pragma warning(disable : 4512) // 'class' : assignment operator could not be generated
+#pragma warning(disable : 4127) // conditional expression is constant
+#pragma warning(disable : 4530) // C++ exception handler used, but unwind semantics are not enabled
+#pragma warning(disable : 4577) // 'noexcept' used with no exception handling mode specified
+#endif // _MSC_VER
+
+#if defined(DOCTEST_CONFIG_IMPLEMENT) || !defined(DOCTEST_SINGLE_HEADER)
+#ifndef DOCTEST_LIBRARY_IMPLEMENTATION
+#define DOCTEST_LIBRARY_IMPLEMENTATION
+
+#ifndef DOCTEST_SINGLE_HEADER
+#include "doctest_fwd.h"
+#endif // DOCTEST_SINGLE_HEADER
+
+#if defined(__clang__) && defined(DOCTEST_NO_CPP11_COMPAT)
+#pragma clang diagnostic ignored "-Wc++98-compat"
+#pragma clang diagnostic ignored "-Wc++98-compat-pedantic"
+#endif // __clang__ && DOCTEST_NO_CPP11_COMPAT
+
+ // snprintf() not in the C++98 standard
+#ifdef _MSC_VER
+#define DOCTEST_SNPRINTF _snprintf
+#else
+#define DOCTEST_SNPRINTF std::snprintf
+#endif
+
+#define DOCTEST_LOG_START() \
+ do { \
+ if(!contextState->hasLoggedCurrentTestStart) { \
+ doctest::detail::logTestStart(*contextState->currentTest); \
+ contextState->hasLoggedCurrentTestStart = true; \
+ } \
+ } while(false)
+
+ // required includes - will go only in one translation unit!
+#include <ctime>
+#include <cmath>
+ // borland (Embarcadero) compiler requires math.h and not cmath - https://github.com/onqtam/doctest/pull/37
+#ifdef __BORLANDC__
+#include <math.h>
+#endif // __BORLANDC__
+#include <new>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <limits>
+#include <utility>
+#include <sstream>
+#include <iomanip>
+#include <vector>
+#include <set>
+#include <exception>
+#include <stdexcept>
+#include <csignal>
+#include <cfloat>
+#ifndef _MSC_VER
+#include <stdint.h>
+#endif // _MSC_VER
+
+namespace doctest
+{
+ namespace detail
+ {
+ // lowers ascii letters
+ char tolower(const char c) { return (c >= 'A' && c <= 'Z') ? static_cast<char>(c + 32) : c; }
+
+ template <typename T>
+ T my_max(const T& lhs, const T& rhs) {
+ return lhs > rhs ? lhs : rhs;
+ }
+
+ // case insensitive strcmp
+ int stricmp(char const* a, char const* b) {
+ for (;; a++, b++) {
+ int d = tolower(*a) - tolower(*b);
+ if (d != 0 || !*a)
+ return d;
+ }
+ }
+
+ void my_memcpy(void* dest, const void* src, unsigned num) {
+ const char* csrc = static_cast<const char*>(src);
+ char* cdest = static_cast<char*>(dest);
+ for (unsigned i = 0; i < num; ++i)
+ cdest[i] = csrc[i];
+ }
+
+ // not using std::strlen() because of valgrind errors when optimizations are turned on
+ // 'Invalid read of size 4' when the test suite len (with '\0') is not a multiple of 4
+ // for details see http://stackoverflow.com/questions/35671155
+ unsigned my_strlen(const char* in) {
+ const char* temp = in;
+ while (temp && *temp)
+ ++temp;
+ return unsigned(temp - in);
+ }
+
+ template <typename T>
+ String fpToString(T value, int precision) {
+ std::ostringstream oss;
+ oss << std::setprecision(precision) << std::fixed << value;
+ std::string d = oss.str();
+ size_t i = d.find_last_not_of('0');
+ if (i != std::string::npos && i != d.size() - 1) {
+ if (d[i] == '.')
+ i++;
+ d = d.substr(0, i + 1);
+ }
+ return d.c_str();
+ }
+
+ struct Endianness
+ {
+ enum Arch
+ {
+ Big,
+ Little
+ };
+
+ static Arch which() {
+ union _
+ {
+ int asInt;
+ char asChar[sizeof(int)];
+ } u;
+
+ u.asInt = 1; // NOLINT
+ return (u.asChar[sizeof(int) - 1] == 1) ? Big : Little; // NOLINT
+ }
+ };
+
+ String rawMemoryToString(const void* object, unsigned size) {
+ // Reverse order for little endian architectures
+ int i = 0, end = static_cast<int>(size), inc = 1;
+ if (Endianness::which() == Endianness::Little) {
+ i = end - 1;
+ end = inc = -1;
+ }
+
+ unsigned char const* bytes = static_cast<unsigned char const*>(object);
+ std::ostringstream os;
+ os << "0x" << std::setfill('0') << std::hex;
+ for (; i != end; i += inc)
+ os << std::setw(2) << static_cast<unsigned>(bytes[i]);
+ return os.str().c_str();
+ }
+
+ std::ostream* createStream() { return new std::ostringstream(); }
+ String getStreamResult(std::ostream* in) {
+ return static_cast<std::ostringstream*>(in)->str().c_str(); // NOLINT
+ }
+ void freeStream(std::ostream* in) { delete in; }
+
+#ifndef DOCTEST_CONFIG_DISABLE
+
+ // this holds both parameters for the command line and runtime data for tests
+ struct ContextState : TestAccessibleContextState //!OCLINT too many fields
+ {
+ // == parameters from the command line
+
+ std::vector<std::vector<String> > filters;
+
+ String order_by; // how tests should be ordered
+ unsigned rand_seed; // the seed for rand ordering
+
+ unsigned first; // the first (matching) test to be executed
+ unsigned last; // the last (matching) test to be executed
+
+ int abort_after; // stop tests after this many failed assertions
+ int subcase_filter_levels; // apply the subcase filters for the first N levels
+ bool case_sensitive; // if filtering should be case sensitive
+ bool exit; // if the program should be exited after the tests are ran/whatever
+ bool duration; // print the time duration of each test case
+ bool no_exitcode; // if the framework should return 0 as the exitcode
+ bool no_run; // to not run the tests at all (can be done with an "*" exclude)
+ bool no_version; // to not print the version of the framework
+ bool no_colors; // if output to the console should be colorized
+ bool force_colors; // forces the use of colors even when a tty cannot be detected
+ bool no_breaks; // to not break into the debugger
+ bool no_skip; // don't skip test cases which are marked to be skipped
+ bool no_path_in_filenames; // if the path to files should be removed from the output
+ bool no_line_numbers; // if source code line numbers should be omitted from the output
+ bool no_skipped_summary; // don't print "skipped" in the summary !!! UNDOCUMENTED !!!
+
+ bool help; // to print the help
+ bool version; // to print the version
+ bool count; // if only the count of matching tests is to be retreived
+ bool list_test_cases; // to list all tests matching the filters
+ bool list_test_suites; // to list all suites matching the filters
+
+ // == data for the tests being ran
+
+ unsigned numTestsPassingFilters;
+ unsigned numTestSuitesPassingFilters;
+ unsigned numFailed;
+ const TestCase* currentTest;
+ bool hasLoggedCurrentTestStart;
+ int numAssertionsForCurrentTestcase;
+ int numAssertions;
+ int numFailedAssertionsForCurrentTestcase;
+ int numFailedAssertions;
+ bool hasCurrentTestFailed;
+
+ std::vector<IContextScope*> contexts; // for logging with INFO() and friends
+ std::vector<std::string> exceptionalContexts; // logging from INFO() due to an exception
+
+ // stuff for subcases
+ std::set<SubcaseSignature> subcasesPassed;
+ std::set<int> subcasesEnteredLevels;
+ std::vector<Subcase> subcasesStack;
+ int subcasesCurrentLevel;
+ bool subcasesHasSkipped;
+
+ void resetRunData() {
+ numTestsPassingFilters = 0;
+ numTestSuitesPassingFilters = 0;
+ numFailed = 0;
+ numAssertions = 0;
+ numFailedAssertions = 0;
+ numFailedAssertionsForCurrentTestcase = 0;
+ }
+
+ // cppcheck-suppress uninitMemberVar
+ ContextState()
+ : filters(8) // 8 different filters total
+ {
+ resetRunData();
+ }
+ };
+
+ ContextState* contextState = 0;
+#endif // DOCTEST_CONFIG_DISABLE
+ } // namespace detail
+
+ void String::copy(const String& other) {
+ if (other.isOnStack()) {
+ detail::my_memcpy(buf, other.buf, len);
+ }
+ else {
+ setOnHeap();
+ data.size = other.data.size;
+ data.capacity = data.size + 1;
+ data.ptr = new char[data.capacity];
+ detail::my_memcpy(data.ptr, other.data.ptr, data.size + 1);
+ }
+ }
+
+ String::String(const char* in) {
+ unsigned in_len = detail::my_strlen(in);
+ if (in_len <= last) {
+ detail::my_memcpy(buf, in, in_len + 1);
+ setLast(last - in_len);
+ }
+ else {
+ setOnHeap();
+ data.size = in_len;
+ data.capacity = data.size + 1;
+ data.ptr = new char[data.capacity];
+ detail::my_memcpy(data.ptr, in, in_len + 1);
+ }
+ }
+
+ String& String::operator+=(const String& other) {
+ unsigned my_old_size = size();
+ unsigned other_size = other.size();
+ unsigned total_size = my_old_size + other_size;
+ if (isOnStack()) {
+ if (total_size < len) {
+ // append to the current stack space
+ detail::my_memcpy(buf + my_old_size, other.c_str(), other_size + 1);
+ setLast(last - total_size);
+ }
+ else {
+ // alloc new chunk
+ char* temp = new char[total_size + 1];
+ // copy current data to new location before writing in the union
+ detail::my_memcpy(temp, buf, my_old_size); // skip the +1 ('\0') for speed
+ // update data in union
+ setOnHeap();
+ data.size = total_size;
+ data.capacity = data.size + 1;
+ data.ptr = temp;
+ // transfer the rest of the data
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ }
+ else {
+ if (data.capacity > total_size) {
+ // append to the current heap block
+ data.size = total_size;
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ else {
+ // resize
+ data.capacity *= 2;
+ if (data.capacity <= total_size)
+ data.capacity = total_size + 1;
+ // alloc new chunk
+ char* temp = new char[data.capacity];
+ // copy current data to new location before releasing it
+ detail::my_memcpy(temp, data.ptr, my_old_size); // skip the +1 ('\0') for speed
+ // release old chunk
+ delete[] data.ptr;
+ // update the rest of the union members
+ data.size = total_size;
+ data.ptr = temp;
+ // transfer the rest of the data
+ detail::my_memcpy(data.ptr + my_old_size, other.c_str(), other_size + 1);
+ }
+ }
+
+ return *this;
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+ String::String(String&& other) {
+ detail::my_memcpy(buf, other.buf, len);
+ other.buf[0] = '\0';
+ other.setLast();
+ }
+
+ String& String::operator=(String&& other) {
+ if (!isOnStack())
+ delete[] data.ptr;
+ detail::my_memcpy(buf, other.buf, len);
+ other.buf[0] = '\0';
+ other.setLast();
+ return *this;
+ }
+#endif // DOCTEST_CONFIG_WITH_RVALUE_REFERENCES
+
+ int String::compare(const char* other, bool no_case) const {
+ if (no_case)
+ return detail::stricmp(c_str(), other);
+ return std::strcmp(c_str(), other);
+ }
+
+ int String::compare(const String& other, bool no_case) const {
+ return compare(other.c_str(), no_case);
+ }
+
+ std::ostream& operator<<(std::ostream& stream, const String& in) {
+ stream << in.c_str();
+ return stream;
+ }
+
+ Approx::Approx(double value)
+ : m_epsilon(static_cast<double>(std::numeric_limits<float>::epsilon()) * 100)
+ , m_scale(1.0)
+ , m_value(value) {}
+
+ bool operator==(double lhs, Approx const& rhs) {
+ // Thanks to Richard Harris for his help refining this formula
+ return std::fabs(lhs - rhs.m_value) <
+ rhs.m_epsilon * (rhs.m_scale + detail::my_max(std::fabs(lhs), std::fabs(rhs.m_value)));
+ }
+
+ String Approx::toString() const { return String("Approx( ") + doctest::toString(m_value) + " )"; }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ String toString(char* in) { return toString(static_cast<const char*>(in)); }
+ String toString(const char* in) { return String("\"") + (in ? in : "{null string}") + "\""; }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ String toString(bool in) { return in ? "true" : "false"; }
+ String toString(float in) { return detail::fpToString(in, 5) + "f"; }
+ String toString(double in) { return detail::fpToString(in, 10); }
+ String toString(double long in) { return detail::fpToString(in, 15); }
+
+ String toString(char in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(char signed in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(char unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%ud", in);
+ return buf;
+ }
+
+ String toString(int short in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(int short unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%u", in);
+ return buf;
+ }
+
+ String toString(int in) {
+ char buf[64];
+ std::sprintf(buf, "%d", in);
+ return buf;
+ }
+
+ String toString(int unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%u", in);
+ return buf;
+ }
+
+ String toString(int long in) {
+ char buf[64];
+ std::sprintf(buf, "%ld", in);
+ return buf;
+ }
+
+ String toString(int long unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%lu", in);
+ return buf;
+ }
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ String toString(int long long in) {
+ char buf[64];
+ std::sprintf(buf, "%lld", in);
+ return buf;
+ }
+ String toString(int long long unsigned in) {
+ char buf[64];
+ std::sprintf(buf, "%llu", in);
+ return buf;
+ }
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+#ifdef DOCTEST_CONFIG_WITH_NULLPTR
+ String toString(std::nullptr_t) { return "nullptr"; }
+#endif // DOCTEST_CONFIG_WITH_NULLPTR
+
+} // namespace doctest
+
+#ifdef DOCTEST_CONFIG_DISABLE
+namespace doctest
+{
+ bool isRunningInTest() { return false; }
+ Context::Context(int, const char* const*) {}
+ Context::~Context() {}
+ void Context::applyCommandLine(int, const char* const*) {}
+ void Context::addFilter(const char*, const char*) {}
+ void Context::clearFilters() {}
+ void Context::setOption(const char*, int) {}
+ void Context::setOption(const char*, const char*) {}
+ bool Context::shouldExit() { return false; }
+ int Context::run() { return 0; }
+} // namespace doctest
+#else // DOCTEST_CONFIG_DISABLE
+
+#if !defined(DOCTEST_CONFIG_COLORS_NONE)
+#if !defined(DOCTEST_CONFIG_COLORS_WINDOWS) && !defined(DOCTEST_CONFIG_COLORS_ANSI)
+#ifdef DOCTEST_PLATFORM_WINDOWS
+#define DOCTEST_CONFIG_COLORS_WINDOWS
+#else // linux
+#define DOCTEST_CONFIG_COLORS_ANSI
+#endif // platform
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS && DOCTEST_CONFIG_COLORS_ANSI
+#endif // DOCTEST_CONFIG_COLORS_NONE
+
+#define DOCTEST_PRINTF_COLORED(buffer, color) \
+ do { \
+ doctest::detail::Color col(color); \
+ std::printf("%s", buffer); \
+ } while((void)0, 0)
+
+ // the buffer size used for snprintf() calls
+#if !defined(DOCTEST_SNPRINTF_BUFFER_LENGTH)
+#define DOCTEST_SNPRINTF_BUFFER_LENGTH 1024
+#endif // DOCTEST_SNPRINTF_BUFFER_LENGTH
+
+#if defined(_MSC_VER) || defined(__MINGW32__)
+#if defined(_MSC_VER) && _MSC_VER >= 1700
+#define DOCTEST_WINDOWS_SAL_IN_OPT _In_opt_
+#else // _MSC_VER
+#define DOCTEST_WINDOWS_SAL_IN_OPT
+#endif // _MSC_VER
+extern "C" __declspec(dllimport) void __stdcall OutputDebugStringA(
+ DOCTEST_WINDOWS_SAL_IN_OPT const char*);
+extern "C" __declspec(dllimport) int __stdcall IsDebuggerPresent();
+#endif // _MSC_VER || __MINGW32__
+
+#ifdef DOCTEST_CONFIG_COLORS_ANSI
+#include <unistd.h>
+#endif // DOCTEST_CONFIG_COLORS_ANSI
+
+#ifdef _WIN32
+
+// defines for a leaner windows.h
+#ifndef WIN32_MEAN_AND_LEAN
+#define WIN32_MEAN_AND_LEAN
+#endif // WIN32_MEAN_AND_LEAN
+#ifndef VC_EXTRA_LEAN
+#define VC_EXTRA_LEAN
+#endif // VC_EXTRA_LEAN
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif // NOMINMAX
+
+// not sure what AfxWin.h is for - here I do what Catch does
+#ifdef __AFXDLL
+#include <AfxWin.h>
+#else
+#include <windows.h>
+#endif
+#include <io.h>
+
+#else // _WIN32
+
+#include <sys/time.h>
+
+#endif // _WIN32
+
+namespace doctest_detail_test_suite_ns
+{
+ // holds the current test suite
+ doctest::detail::TestSuite& getCurrentTestSuite() {
+ static doctest::detail::TestSuite data;
+ return data;
+ }
+} // namespace doctest_detail_test_suite_ns
+
+namespace doctest
+{
+ namespace detail
+ {
+ TestCase::TestCase(funcType test, const char* file, unsigned line, const TestSuite& test_suite,
+ const char* type, int template_id)
+ : m_test(test)
+ , m_name(0)
+ , m_type(type)
+ , m_test_suite(test_suite.m_test_suite)
+ , m_description(test_suite.m_description)
+ , m_skip(test_suite.m_skip)
+ , m_may_fail(test_suite.m_may_fail)
+ , m_should_fail(test_suite.m_should_fail)
+ , m_expected_failures(test_suite.m_expected_failures)
+ , m_timeout(test_suite.m_timeout)
+ , m_file(file)
+ , m_line(line)
+ , m_template_id(template_id) {}
+
+ TestCase& TestCase::operator*(const char* in) {
+ m_name = in;
+ // make a new name with an appended type for templated test case
+ if (m_template_id != -1) {
+ m_full_name = String(m_name) + m_type;
+ // redirect the name to point to the newly constructed full name
+ m_name = m_full_name.c_str();
+ }
+ return *this;
+ }
+
+ TestCase& TestCase::operator=(const TestCase& other) {
+ m_test = other.m_test;
+ m_full_name = other.m_full_name;
+ m_name = other.m_name;
+ m_type = other.m_type;
+ m_test_suite = other.m_test_suite;
+ m_description = other.m_description;
+ m_skip = other.m_skip;
+ m_may_fail = other.m_may_fail;
+ m_should_fail = other.m_should_fail;
+ m_expected_failures = other.m_expected_failures;
+ m_timeout = other.m_timeout;
+ m_file = other.m_file;
+ m_line = other.m_line;
+ m_template_id = other.m_template_id;
+
+ if (m_template_id != -1)
+ m_name = m_full_name.c_str();
+ return *this;
+ }
+
+ bool TestCase::operator<(const TestCase& other) const {
+ if (m_line != other.m_line)
+ return m_line < other.m_line;
+ int file_cmp = std::strcmp(m_file, other.m_file);
+ if (file_cmp != 0)
+ return file_cmp < 0;
+ return m_template_id < other.m_template_id;
+ }
+
+ const char* getAssertString(assertType::Enum val) {
+ switch (val) { //!OCLINT missing default in switch statements
+ // clang-format off
+ case assertType::DT_WARN: return "WARN";
+ case assertType::DT_CHECK: return "CHECK";
+ case assertType::DT_REQUIRE: return "REQUIRE";
+
+ case assertType::DT_WARN_FALSE: return "WARN_FALSE";
+ case assertType::DT_CHECK_FALSE: return "CHECK_FALSE";
+ case assertType::DT_REQUIRE_FALSE: return "REQUIRE_FALSE";
+
+ case assertType::DT_WARN_THROWS: return "WARN_THROWS";
+ case assertType::DT_CHECK_THROWS: return "CHECK_THROWS";
+ case assertType::DT_REQUIRE_THROWS: return "REQUIRE_THROWS";
+
+ case assertType::DT_WARN_THROWS_AS: return "WARN_THROWS_AS";
+ case assertType::DT_CHECK_THROWS_AS: return "CHECK_THROWS_AS";
+ case assertType::DT_REQUIRE_THROWS_AS: return "REQUIRE_THROWS_AS";
+
+ case assertType::DT_WARN_NOTHROW: return "WARN_NOTHROW";
+ case assertType::DT_CHECK_NOTHROW: return "CHECK_NOTHROW";
+ case assertType::DT_REQUIRE_NOTHROW: return "REQUIRE_NOTHROW";
+
+ case assertType::DT_WARN_EQ: return "WARN_EQ";
+ case assertType::DT_CHECK_EQ: return "CHECK_EQ";
+ case assertType::DT_REQUIRE_EQ: return "REQUIRE_EQ";
+ case assertType::DT_WARN_NE: return "WARN_NE";
+ case assertType::DT_CHECK_NE: return "CHECK_NE";
+ case assertType::DT_REQUIRE_NE: return "REQUIRE_NE";
+ case assertType::DT_WARN_GT: return "WARN_GT";
+ case assertType::DT_CHECK_GT: return "CHECK_GT";
+ case assertType::DT_REQUIRE_GT: return "REQUIRE_GT";
+ case assertType::DT_WARN_LT: return "WARN_LT";
+ case assertType::DT_CHECK_LT: return "CHECK_LT";
+ case assertType::DT_REQUIRE_LT: return "REQUIRE_LT";
+ case assertType::DT_WARN_GE: return "WARN_GE";
+ case assertType::DT_CHECK_GE: return "CHECK_GE";
+ case assertType::DT_REQUIRE_GE: return "REQUIRE_GE";
+ case assertType::DT_WARN_LE: return "WARN_LE";
+ case assertType::DT_CHECK_LE: return "CHECK_LE";
+ case assertType::DT_REQUIRE_LE: return "REQUIRE_LE";
+
+ case assertType::DT_WARN_UNARY: return "WARN_UNARY";
+ case assertType::DT_CHECK_UNARY: return "CHECK_UNARY";
+ case assertType::DT_REQUIRE_UNARY: return "REQUIRE_UNARY";
+ case assertType::DT_WARN_UNARY_FALSE: return "WARN_UNARY_FALSE";
+ case assertType::DT_CHECK_UNARY_FALSE: return "CHECK_UNARY_FALSE";
+ case assertType::DT_REQUIRE_UNARY_FALSE: return "REQUIRE_UNARY_FALSE";
+
+ case assertType::DT_FAST_WARN_EQ: return "FAST_WARN_EQ";
+ case assertType::DT_FAST_CHECK_EQ: return "FAST_CHECK_EQ";
+ case assertType::DT_FAST_REQUIRE_EQ: return "FAST_REQUIRE_EQ";
+ case assertType::DT_FAST_WARN_NE: return "FAST_WARN_NE";
+ case assertType::DT_FAST_CHECK_NE: return "FAST_CHECK_NE";
+ case assertType::DT_FAST_REQUIRE_NE: return "FAST_REQUIRE_NE";
+ case assertType::DT_FAST_WARN_GT: return "FAST_WARN_GT";
+ case assertType::DT_FAST_CHECK_GT: return "FAST_CHECK_GT";
+ case assertType::DT_FAST_REQUIRE_GT: return "FAST_REQUIRE_GT";
+ case assertType::DT_FAST_WARN_LT: return "FAST_WARN_LT";
+ case assertType::DT_FAST_CHECK_LT: return "FAST_CHECK_LT";
+ case assertType::DT_FAST_REQUIRE_LT: return "FAST_REQUIRE_LT";
+ case assertType::DT_FAST_WARN_GE: return "FAST_WARN_GE";
+ case assertType::DT_FAST_CHECK_GE: return "FAST_CHECK_GE";
+ case assertType::DT_FAST_REQUIRE_GE: return "FAST_REQUIRE_GE";
+ case assertType::DT_FAST_WARN_LE: return "FAST_WARN_LE";
+ case assertType::DT_FAST_CHECK_LE: return "FAST_CHECK_LE";
+ case assertType::DT_FAST_REQUIRE_LE: return "FAST_REQUIRE_LE";
+
+ case assertType::DT_FAST_WARN_UNARY: return "FAST_WARN_UNARY";
+ case assertType::DT_FAST_CHECK_UNARY: return "FAST_CHECK_UNARY";
+ case assertType::DT_FAST_REQUIRE_UNARY: return "FAST_REQUIRE_UNARY";
+ case assertType::DT_FAST_WARN_UNARY_FALSE: return "FAST_WARN_UNARY_FALSE";
+ case assertType::DT_FAST_CHECK_UNARY_FALSE: return "FAST_CHECK_UNARY_FALSE";
+ case assertType::DT_FAST_REQUIRE_UNARY_FALSE: return "FAST_REQUIRE_UNARY_FALSE";
+ // clang-format on
+ }
+ return "";
+ }
+
+ bool checkIfShouldThrow(assertType::Enum assert_type) {
+ if (assert_type & assertType::is_require) //!OCLINT bitwise operator in conditional
+ return true;
+
+ if ((assert_type & assertType::is_check) //!OCLINT bitwise operator in conditional
+ && contextState->abort_after > 0 &&
+ contextState->numFailedAssertions >= contextState->abort_after)
+ return true;
+
+ return false;
+ }
+ void fastAssertThrowIfFlagSet(int flags) {
+ if (flags & assertAction::shouldthrow) //!OCLINT bitwise operator in conditional
+ throwException();
+ }
+ void throwException() {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ throw TestFailureException();
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+
+ // matching of a string against a wildcard mask (case sensitivity configurable) taken from
+ // http://www.emoticode.net/c/simple-wildcard-string-compare-globbing-function.html
+ int wildcmp(const char* str, const char* wild, bool caseSensitive) {
+ const char* cp = 0;
+ const char* mp = 0;
+
+ // rolled my own tolower() to not include more headers
+ while ((*str) && (*wild != '*')) {
+ if ((caseSensitive ? (*wild != *str) : (tolower(*wild) != tolower(*str))) &&
+ (*wild != '?')) {
+ return 0;
+ }
+ wild++;
+ str++;
+ }
+
+ while (*str) {
+ if (*wild == '*') {
+ if (!*++wild) {
+ return 1;
+ }
+ mp = wild;
+ cp = str + 1;
+ }
+ else if ((caseSensitive ? (*wild == *str) : (tolower(*wild) == tolower(*str))) ||
+ (*wild == '?')) {
+ wild++;
+ str++;
+ }
+ else {
+ wild = mp; //!OCLINT parameter reassignment
+ str = cp++; //!OCLINT parameter reassignment
+ }
+ }
+
+ while (*wild == '*') {
+ wild++;
+ }
+ return !*wild;
+ }
+
+ //// C string hash function (djb2) - taken from http://www.cse.yorku.ca/~oz/hash.html
+ //unsigned hashStr(unsigned const char* str) {
+ // unsigned long hash = 5381;
+ // char c;
+ // while((c = *str++))
+ // hash = ((hash << 5) + hash) + c; // hash * 33 + c
+ // return hash;
+ //}
+
+ // checks if the name matches any of the filters (and can be configured what to do when empty)
+ bool matchesAny(const char* name, const std::vector<String>& filters, int matchEmpty,
+ bool caseSensitive) {
+ if (filters.empty() && matchEmpty)
+ return true;
+ for (unsigned i = 0; i < filters.size(); ++i)
+ if (wildcmp(name, filters[i].c_str(), caseSensitive))
+ return true;
+ return false;
+ }
+
+#ifdef _WIN32
+
+ typedef unsigned long long UInt64;
+
+ UInt64 getCurrentTicks() {
+ static UInt64 hz = 0, hzo = 0;
+ if (!hz) {
+ QueryPerformanceFrequency(reinterpret_cast<LARGE_INTEGER*>(&hz));
+ QueryPerformanceCounter(reinterpret_cast<LARGE_INTEGER*>(&hzo));
+ }
+ UInt64 t;
+ QueryPerformanceCounter(reinterpret_cast<LARGE_INTEGER*>(&t));
+ return ((t - hzo) * 1000000) / hz;
+ }
+#else // _WIN32
+
+ typedef uint64_t UInt64;
+
+ UInt64 getCurrentTicks() {
+ timeval t;
+ gettimeofday(&t, 0);
+ return static_cast<UInt64>(t.tv_sec) * 1000000 + static_cast<UInt64>(t.tv_usec);
+ }
+#endif // _WIN32
+
+ class Timer
+ {
+ public:
+ Timer()
+ : m_ticks(0) {}
+ void start() { m_ticks = getCurrentTicks(); }
+ unsigned int getElapsedMicroseconds() const {
+ return static_cast<unsigned int>(getCurrentTicks() - m_ticks);
+ }
+ unsigned int getElapsedMilliseconds() const {
+ return static_cast<unsigned int>(getElapsedMicroseconds() / 1000);
+ }
+ double getElapsedSeconds() const { return getElapsedMicroseconds() / 1000000.0; }
+
+ private:
+ UInt64 m_ticks;
+ };
+
+ TestAccessibleContextState* getTestsContextState() { return contextState; }
+
+ bool SubcaseSignature::operator<(const SubcaseSignature& other) const {
+ if (m_line != other.m_line)
+ return m_line < other.m_line;
+ if (std::strcmp(m_file, other.m_file) != 0)
+ return std::strcmp(m_file, other.m_file) < 0;
+ return std::strcmp(m_name, other.m_name) < 0;
+ }
+
+ Subcase::Subcase(const char* name, const char* file, int line)
+ : m_signature(name, file, line)
+ , m_entered(false) {
+ ContextState* s = contextState;
+
+ // if we have already completed it
+ if (s->subcasesPassed.count(m_signature) != 0)
+ return;
+
+ // check subcase filters
+ if (s->subcasesCurrentLevel < s->subcase_filter_levels) {
+ if (!matchesAny(m_signature.m_name, s->filters[6], 1, s->case_sensitive))
+ return;
+ if (matchesAny(m_signature.m_name, s->filters[7], 0, s->case_sensitive))
+ return;
+ }
+
+ // if a Subcase on the same level has already been entered
+ if (s->subcasesEnteredLevels.count(s->subcasesCurrentLevel) != 0) {
+ s->subcasesHasSkipped = true;
+ return;
+ }
+
+ s->subcasesStack.push_back(*this);
+ if (s->hasLoggedCurrentTestStart)
+ logTestEnd();
+ s->hasLoggedCurrentTestStart = false;
+
+ s->subcasesEnteredLevels.insert(s->subcasesCurrentLevel++);
+ m_entered = true;
+ }
+
+ Subcase::Subcase(const Subcase& other)
+ : m_signature(other.m_signature.m_name, other.m_signature.m_file,
+ other.m_signature.m_line)
+ , m_entered(other.m_entered) {}
+
+ Subcase::~Subcase() {
+ if (m_entered) {
+ ContextState* s = contextState;
+
+ s->subcasesCurrentLevel--;
+ // only mark the subcase as passed if no subcases have been skipped
+ if (s->subcasesHasSkipped == false)
+ s->subcasesPassed.insert(m_signature);
+
+ if (!s->subcasesStack.empty())
+ s->subcasesStack.pop_back();
+ if (s->hasLoggedCurrentTestStart)
+ logTestEnd();
+ s->hasLoggedCurrentTestStart = false;
+ }
+ }
+
+ Result::~Result() {}
+
+ Result& Result::operator=(const Result& other) {
+ m_passed = other.m_passed;
+ m_decomposition = other.m_decomposition;
+
+ return *this;
+ }
+
+ // for sorting tests by file/line
+ int fileOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+#ifdef _MSC_VER
+ // this is needed because MSVC gives different case for drive letters
+ // for __FILE__ when evaluated in a header and a source file
+ int res = stricmp(lhs->m_file, rhs->m_file);
+#else // _MSC_VER
+ int res = std::strcmp(lhs->m_file, rhs->m_file);
+#endif // _MSC_VER
+ if (res != 0)
+ return res;
+ return static_cast<int>(lhs->m_line - rhs->m_line);
+ }
+
+ // for sorting tests by suite/file/line
+ int suiteOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+
+ int res = std::strcmp(lhs->m_test_suite, rhs->m_test_suite);
+ if (res != 0)
+ return res;
+ return fileOrderComparator(a, b);
+ }
+
+ // for sorting tests by name/suite/file/line
+ int nameOrderComparator(const void* a, const void* b) {
+ const TestCase* lhs = *static_cast<TestCase* const*>(a);
+ const TestCase* rhs = *static_cast<TestCase* const*>(b);
+
+ int res_name = std::strcmp(lhs->m_name, rhs->m_name);
+ if (res_name != 0)
+ return res_name;
+ return suiteOrderComparator(a, b);
+ }
+
+ // sets the current test suite
+ int setTestSuite(const TestSuite& ts) {
+ doctest_detail_test_suite_ns::getCurrentTestSuite() = ts;
+ return 0;
+ }
+
+ // all the registered tests
+ std::set<TestCase>& getRegisteredTests() {
+ static std::set<TestCase> data;
+ return data;
+ }
+
+ // used by the macros for registering tests
+ int regTest(const TestCase& tc) {
+ getRegisteredTests().insert(tc);
+ return 0;
+ }
+
+ struct Color
+ {
+ enum Code
+ {
+ None = 0,
+ White,
+ Red,
+ Green,
+ Blue,
+ Cyan,
+ Yellow,
+ Grey,
+
+ Bright = 0x10,
+
+ BrightRed = Bright | Red,
+ BrightGreen = Bright | Green,
+ LightGrey = Bright | Grey,
+ BrightWhite = Bright | White
+ };
+ explicit Color(Code code) { use(code); }
+ ~Color() { use(None); }
+
+ static void use(Code code);
+ static void init();
+ };
+
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ HANDLE g_stdoutHandle;
+ WORD g_originalForegroundAttributes;
+ WORD g_originalBackgroundAttributes;
+ bool g_attrsInitted = false;
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+
+ void Color::init() {
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ if (!g_attrsInitted) {
+ g_stdoutHandle = GetStdHandle(STD_OUTPUT_HANDLE);
+ g_attrsInitted = true;
+ CONSOLE_SCREEN_BUFFER_INFO csbiInfo;
+ GetConsoleScreenBufferInfo(g_stdoutHandle, &csbiInfo);
+ g_originalForegroundAttributes =
+ csbiInfo.wAttributes &
+ ~(BACKGROUND_GREEN | BACKGROUND_RED | BACKGROUND_BLUE | BACKGROUND_INTENSITY);
+ g_originalBackgroundAttributes =
+ csbiInfo.wAttributes &
+ ~(FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY);
+ }
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+ }
+
+ void Color::use(Code
+#ifndef DOCTEST_CONFIG_COLORS_NONE
+ code
+#endif // DOCTEST_CONFIG_COLORS_NONE
+ ) {
+ const ContextState* p = contextState;
+ if (p->no_colors)
+ return;
+#ifdef DOCTEST_CONFIG_COLORS_ANSI
+ if (isatty(STDOUT_FILENO) == false && p->force_colors == false)
+ return;
+
+ const char* col = "";
+ // clang-format off
+ switch (code) { //!OCLINT missing break in switch statement / unnecessary default statement in covered switch statement
+ case Color::Red: col = "[0;31m"; break;
+ case Color::Green: col = "[0;32m"; break;
+ case Color::Blue: col = "[0;34m"; break;
+ case Color::Cyan: col = "[0;36m"; break;
+ case Color::Yellow: col = "[0;33m"; break;
+ case Color::Grey: col = "[1;30m"; break;
+ case Color::LightGrey: col = "[0;37m"; break;
+ case Color::BrightRed: col = "[1;31m"; break;
+ case Color::BrightGreen: col = "[1;32m"; break;
+ case Color::BrightWhite: col = "[1;37m"; break;
+ case Color::Bright: // invalid
+ case Color::None:
+ case Color::White:
+ default: col = "[0m";
+ }
+ // clang-format on
+ std::printf("\033%s", col);
+#endif // DOCTEST_CONFIG_COLORS_ANSI
+
+#ifdef DOCTEST_CONFIG_COLORS_WINDOWS
+ if (isatty(fileno(stdout)) == false && p->force_colors == false)
+ return;
+
+#define DOCTEST_SET_ATTR(x) \
+ SetConsoleTextAttribute(g_stdoutHandle, x | g_originalBackgroundAttributes)
+
+ // clang-format off
+ switch (code) {
+ case Color::White: DOCTEST_SET_ATTR(FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE); break;
+ case Color::Red: DOCTEST_SET_ATTR(FOREGROUND_RED); break;
+ case Color::Green: DOCTEST_SET_ATTR(FOREGROUND_GREEN); break;
+ case Color::Blue: DOCTEST_SET_ATTR(FOREGROUND_BLUE); break;
+ case Color::Cyan: DOCTEST_SET_ATTR(FOREGROUND_BLUE | FOREGROUND_GREEN); break;
+ case Color::Yellow: DOCTEST_SET_ATTR(FOREGROUND_RED | FOREGROUND_GREEN); break;
+ case Color::Grey: DOCTEST_SET_ATTR(0); break;
+ case Color::LightGrey: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY); break;
+ case Color::BrightRed: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_RED); break;
+ case Color::BrightGreen: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_GREEN); break;
+ case Color::BrightWhite: DOCTEST_SET_ATTR(FOREGROUND_INTENSITY | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE); break;
+ case Color::None:
+ case Color::Bright: // invalid
+ default: DOCTEST_SET_ATTR(g_originalForegroundAttributes);
+ }
+ // clang-format on
+#undef DOCTEST_SET_ATTR
+#endif // DOCTEST_CONFIG_COLORS_WINDOWS
+ }
+
+ IExceptionTranslator::~IExceptionTranslator() {}
+
+ std::vector<const IExceptionTranslator*>& getExceptionTranslators() {
+ static std::vector<const IExceptionTranslator*> data;
+ return data;
+ }
+
+ void registerExceptionTranslatorImpl(const IExceptionTranslator* translateFunction) {
+ getExceptionTranslators().push_back(translateFunction);
+ }
+
+ String translateActiveException() {
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ String res;
+ std::vector<const IExceptionTranslator*>& translators = getExceptionTranslators();
+ for (size_t i = 0; i < translators.size(); ++i)
+ if (translators[i]->translate(res))
+ return res;
+ // clang-format off
+ try {
+ throw;
+ }
+ catch (std::exception& ex) {
+ return ex.what();
+ }
+ catch (std::string& msg) {
+ return msg.c_str();
+ }
+ catch (const char* msg) {
+ return msg;
+ }
+ catch (...) {
+ return "unknown exception";
+ }
+ // clang-format on
+#else // DOCTEST_CONFIG_NO_EXCEPTIONS
+ return "";
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+
+ void writeStringToStream(std::ostream* stream, const String& str) { *stream << str; }
+
+#ifdef DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ void toStream(std::ostream* stream, char* in) { *stream << in; }
+ void toStream(std::ostream* stream, const char* in) { *stream << in; }
+#endif // DOCTEST_CONFIG_TREAT_CHAR_STAR_AS_STRING
+ void toStream(std::ostream* stream, bool in) {
+ *stream << std::boolalpha << in << std::noboolalpha;
+ }
+ void toStream(std::ostream* stream, float in) { *stream << in; }
+ void toStream(std::ostream* stream, double in) { *stream << in; }
+ void toStream(std::ostream* stream, double long in) { *stream << in; }
+
+ void toStream(std::ostream* stream, char in) { *stream << in; }
+ void toStream(std::ostream* stream, char signed in) { *stream << in; }
+ void toStream(std::ostream* stream, char unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int short in) { *stream << in; }
+ void toStream(std::ostream* stream, int short unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int in) { *stream << in; }
+ void toStream(std::ostream* stream, int unsigned in) { *stream << in; }
+ void toStream(std::ostream* stream, int long in) { *stream << in; }
+ void toStream(std::ostream* stream, int long unsigned in) { *stream << in; }
+
+#ifdef DOCTEST_CONFIG_WITH_LONG_LONG
+ void toStream(std::ostream* stream, int long long in) { *stream << in; }
+ void toStream(std::ostream* stream, int long long unsigned in) { *stream << in; }
+#endif // DOCTEST_CONFIG_WITH_LONG_LONG
+
+ void addToContexts(IContextScope* ptr) { contextState->contexts.push_back(ptr); }
+ void popFromContexts() { contextState->contexts.pop_back(); }
+ void useContextIfExceptionOccurred(IContextScope* ptr) {
+ if (std::uncaught_exception()) {
+ std::ostringstream stream;
+ ptr->build(&stream);
+ contextState->exceptionalContexts.push_back(stream.str());
+ }
+ }
+
+ void printSummary();
+
+#if !defined(DOCTEST_CONFIG_POSIX_SIGNALS) && !defined(DOCTEST_CONFIG_WINDOWS_SEH)
+ void reportFatal(const std::string&) {}
+ struct FatalConditionHandler
+ {
+ void reset() {}
+ };
+#else // DOCTEST_CONFIG_POSIX_SIGNALS || DOCTEST_CONFIG_WINDOWS_SEH
+
+ void reportFatal(const std::string& message) {
+ DOCTEST_LOG_START();
+
+ contextState->numAssertions += contextState->numAssertionsForCurrentTestcase;
+ logTestException(message.c_str(), true);
+ logTestEnd();
+ contextState->numFailed++;
+
+ printSummary();
+ }
+
+#ifdef DOCTEST_PLATFORM_WINDOWS
+
+ struct SignalDefs
+ {
+ DWORD id;
+ const char* name;
+ };
+ // There is no 1-1 mapping between signals and windows exceptions.
+ // Windows can easily distinguish between SO and SigSegV,
+ // but SigInt, SigTerm, etc are handled differently.
+ SignalDefs signalDefs[] = {
+ { EXCEPTION_ILLEGAL_INSTRUCTION, "SIGILL - Illegal instruction signal" },
+ { EXCEPTION_STACK_OVERFLOW, "SIGSEGV - Stack overflow" },
+ { EXCEPTION_ACCESS_VIOLATION, "SIGSEGV - Segmentation violation signal" },
+ { EXCEPTION_INT_DIVIDE_BY_ZERO, "Divide by zero error" },
+ };
+
+ struct FatalConditionHandler
+ {
+ static LONG CALLBACK handleVectoredException(PEXCEPTION_POINTERS ExceptionInfo) {
+ for (size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ if (ExceptionInfo->ExceptionRecord->ExceptionCode == signalDefs[i].id) {
+ reportFatal(signalDefs[i].name);
+ }
+ }
+ // If its not an exception we care about, pass it along.
+ // This stops us from eating debugger breaks etc.
+ return EXCEPTION_CONTINUE_SEARCH;
+ }
+
+ FatalConditionHandler() {
+ isSet = true;
+ // 32k seems enough for doctest to handle stack overflow,
+ // but the value was found experimentally, so there is no strong guarantee
+ guaranteeSize = 32 * 1024;
+ exceptionHandlerHandle = 0;
+ // Register as first handler in current chain
+ exceptionHandlerHandle = AddVectoredExceptionHandler(1, handleVectoredException);
+ // Pass in guarantee size to be filled
+ SetThreadStackGuarantee(&guaranteeSize);
+ }
+
+ static void reset() {
+ if (isSet) {
+ // Unregister handler and restore the old guarantee
+ RemoveVectoredExceptionHandler(exceptionHandlerHandle);
+ SetThreadStackGuarantee(&guaranteeSize);
+ exceptionHandlerHandle = 0;
+ isSet = false;
+ }
+ }
+
+ ~FatalConditionHandler() { reset(); }
+
+ private:
+ static bool isSet;
+ static ULONG guaranteeSize;
+ static PVOID exceptionHandlerHandle;
+ };
+
+ bool FatalConditionHandler::isSet = false;
+ ULONG FatalConditionHandler::guaranteeSize = 0;
+ PVOID FatalConditionHandler::exceptionHandlerHandle = 0;
+
+#else // DOCTEST_PLATFORM_WINDOWS
+
+ struct SignalDefs
+ {
+ int id;
+ const char* name;
+ };
+ SignalDefs signalDefs[] = { { SIGINT, "SIGINT - Terminal interrupt signal" },
+ { SIGILL, "SIGILL - Illegal instruction signal" },
+ { SIGFPE, "SIGFPE - Floating point error signal" },
+ { SIGSEGV, "SIGSEGV - Segmentation violation signal" },
+ { SIGTERM, "SIGTERM - Termination request signal" },
+ { SIGABRT, "SIGABRT - Abort (abnormal termination) signal" } };
+
+ struct FatalConditionHandler
+ {
+ static bool isSet;
+ static struct sigaction oldSigActions[sizeof(signalDefs) / sizeof(SignalDefs)];
+ static stack_t oldSigStack;
+ static char altStackMem[SIGSTKSZ];
+
+ static void handleSignal(int sig) {
+ std::string name = "<unknown signal>";
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ SignalDefs& def = signalDefs[i];
+ if (sig == def.id) {
+ name = def.name;
+ break;
+ }
+ }
+ reset();
+ reportFatal(name);
+ raise(sig);
+ }
+
+ FatalConditionHandler() {
+ isSet = true;
+ stack_t sigStack;
+ sigStack.ss_sp = altStackMem;
+ sigStack.ss_size = SIGSTKSZ;
+ sigStack.ss_flags = 0;
+ sigaltstack(&sigStack, &oldSigStack);
+ struct sigaction sa = { 0 };
+
+ sa.sa_handler = handleSignal; // NOLINT
+ sa.sa_flags = SA_ONSTACK;
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ sigaction(signalDefs[i].id, &sa, &oldSigActions[i]);
+ }
+ }
+
+ ~FatalConditionHandler() { reset(); }
+ static void reset() {
+ if (isSet) {
+ // Set signals back to previous values -- hopefully nobody overwrote them in the meantime
+ for (std::size_t i = 0; i < sizeof(signalDefs) / sizeof(SignalDefs); ++i) {
+ sigaction(signalDefs[i].id, &oldSigActions[i], 0);
+ }
+ // Return the old stack
+ sigaltstack(&oldSigStack, 0);
+ isSet = false;
+ }
+ }
+ };
+
+ bool FatalConditionHandler::isSet = false;
+ struct sigaction FatalConditionHandler::oldSigActions[sizeof(signalDefs) / sizeof(SignalDefs)] =
+ {};
+ stack_t FatalConditionHandler::oldSigStack = {};
+ char FatalConditionHandler::altStackMem[SIGSTKSZ] = {};
+
+#endif // DOCTEST_PLATFORM_WINDOWS
+#endif // DOCTEST_CONFIG_POSIX_SIGNALS || DOCTEST_CONFIG_WINDOWS_SEH
+
+ // depending on the current options this will remove the path of filenames
+ const char* fileForOutput(const char* file) {
+ if (contextState->no_path_in_filenames) {
+ const char* back = std::strrchr(file, '\\');
+ const char* forward = std::strrchr(file, '/');
+ if (back || forward) {
+ if (back > forward)
+ forward = back;
+ return forward + 1;
+ }
+ }
+ return file;
+ }
+
+ // depending on the current options this will substitute the line numbers with 0
+ int lineForOutput(int line) {
+ if (contextState->no_line_numbers)
+ return 0;
+ return line;
+ }
+
+#ifdef DOCTEST_PLATFORM_MAC
+#include <sys/types.h>
+#include <unistd.h>
+#include <sys/sysctl.h>
+ // The following function is taken directly from the following technical note:
+ // http://developer.apple.com/library/mac/#qa/qa2004/qa1361.html
+ // Returns true if the current process is being debugged (either
+ // running under the debugger or has a debugger attached post facto).
+ bool isDebuggerActive() {
+ int mib[4];
+ kinfo_proc info;
+ size_t size;
+ // Initialize the flags so that, if sysctl fails for some bizarre
+ // reason, we get a predictable result.
+ info.kp_proc.p_flag = 0;
+ // Initialize mib, which tells sysctl the info we want, in this case
+ // we're looking for information about a specific process ID.
+ mib[0] = CTL_KERN;
+ mib[1] = KERN_PROC;
+ mib[2] = KERN_PROC_PID;
+ mib[3] = getpid();
+ // Call sysctl.
+ size = sizeof(info);
+ if (sysctl(mib, sizeof(mib) / sizeof(*mib), &info, &size, 0, 0) != 0) {
+ fprintf(stderr, "\n** Call to sysctl failed - unable to determine if debugger is "
+ "active **\n\n");
+ return false;
+ }
+ // We're being debugged if the P_TRACED flag is set.
+ return ((info.kp_proc.p_flag & P_TRACED) != 0);
+ }
+#elif defined(_MSC_VER) || defined(__MINGW32__)
+ bool isDebuggerActive() { return ::IsDebuggerPresent() != 0; }
+#else
+ bool isDebuggerActive() { return false; }
+#endif // Platform
+
+#ifdef DOCTEST_PLATFORM_WINDOWS
+ void myOutputDebugString(const String& text) { ::OutputDebugStringA(text.c_str()); }
+#else
+ // TODO: integration with XCode and other IDEs
+ void myOutputDebugString(const String&) {}
+#endif // Platform
+
+ const char* getSeparator() {
+ return "===============================================================================\n";
+ }
+
+ void printToDebugConsole(const String& text) {
+ if (isDebuggerActive())
+ myOutputDebugString(text.c_str());
+ }
+
+ void addFailedAssert(assertType::Enum assert_type) {
+ if ((assert_type & assertType::is_warn) == 0) { //!OCLINT bitwise operator in conditional
+ contextState->numFailedAssertions++;
+ contextState->numFailedAssertionsForCurrentTestcase++;
+ contextState->hasCurrentTestFailed = true;
+ }
+ }
+
+ void logTestStart(const TestCase& tc) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)\n", fileForOutput(tc.m_file),
+ lineForOutput(tc.m_line));
+
+ char ts1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(ts1, DOCTEST_COUNTOF(ts1), "TEST SUITE: ");
+ char ts2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(ts2, DOCTEST_COUNTOF(ts2), "%s\n", tc.m_test_suite);
+ char n1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(n1, DOCTEST_COUNTOF(n1), "TEST CASE: ");
+ char n2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(n2, DOCTEST_COUNTOF(n2), "%s\n", tc.m_name);
+ char d1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(d1, DOCTEST_COUNTOF(d1), "DESCRIPTION: ");
+ char d2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(d2, DOCTEST_COUNTOF(d2), "%s\n", tc.m_description);
+
+ // hack for BDD style of macros - to not print "TEST CASE:"
+ char scenario[] = " Scenario:";
+ if (std::string(tc.m_name).substr(0, DOCTEST_COUNTOF(scenario) - 1) == scenario)
+ n1[0] = '\0';
+
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+
+ String forDebugConsole;
+ if (tc.m_description) {
+ DOCTEST_PRINTF_COLORED(d1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(d2, Color::None);
+ forDebugConsole += d1;
+ forDebugConsole += d2;
+ }
+ if (tc.m_test_suite[0] != '\0') {
+ DOCTEST_PRINTF_COLORED(ts1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(ts2, Color::None);
+ forDebugConsole += ts1;
+ forDebugConsole += ts2;
+ }
+ DOCTEST_PRINTF_COLORED(n1, Color::Yellow);
+ DOCTEST_PRINTF_COLORED(n2, Color::None);
+
+ String subcaseStuff;
+ std::vector<Subcase>& subcasesStack = contextState->subcasesStack;
+ for (unsigned i = 0; i < subcasesStack.size(); ++i) {
+ if (subcasesStack[i].m_signature.m_name[0] != '\0') {
+ char subcase[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(subcase, DOCTEST_COUNTOF(loc), " %s\n",
+ subcasesStack[i].m_signature.m_name);
+ DOCTEST_PRINTF_COLORED(subcase, Color::None);
+ subcaseStuff += subcase;
+ }
+ }
+
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(getSeparator()) + loc + forDebugConsole.c_str() + n1 + n2 +
+ subcaseStuff.c_str() + "\n");
+ }
+
+ void logTestEnd() {}
+
+ void logTestException(const String& what, bool crash) {
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), "TEST CASE FAILED!\n");
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info1[0] = 0;
+ info2[0] = 0;
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1),
+ crash ? "crashed:\n" : "threw exception:\n");
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), " %s\n", what.c_str());
+
+ std::string contextStr;
+
+ if (!contextState->exceptionalContexts.empty()) {
+ contextStr += "with context:\n";
+ for (size_t i = contextState->exceptionalContexts.size(); i > 0; --i) {
+ contextStr += " ";
+ contextStr += contextState->exceptionalContexts[i - 1];
+ contextStr += "\n";
+ }
+ }
+
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::None);
+ DOCTEST_PRINTF_COLORED(info2, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(contextStr.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(msg) + info1 + info2 + contextStr.c_str() + "\n");
+ }
+
+ String logContext() {
+ std::ostringstream stream;
+ std::vector<IContextScope*>& contexts = contextState->contexts;
+ if (!contexts.empty())
+ stream << "with context:\n";
+ for (size_t i = 0; i < contexts.size(); ++i) {
+ stream << " ";
+ contexts[i]->build(&stream);
+ stream << "\n";
+ }
+ return stream.str().c_str();
+ }
+
+ const char* getFailString(assertType::Enum assert_type) {
+ if (assert_type & assertType::is_warn) //!OCLINT bitwise operator in conditional
+ return "WARNING";
+ if (assert_type & assertType::is_check) //!OCLINT bitwise operator in conditional
+ return "ERROR";
+ if (assert_type & assertType::is_require) //!OCLINT bitwise operator in conditional
+ return "FATAL ERROR";
+ return "";
+ }
+
+ void logAssert(bool passed, const char* decomposition, bool threw, const String& exception,
+ const char* expr, assertType::Enum assert_type, const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ passed ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+ if (threw) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+ else {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "with expansion:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s( %s )\n",
+ getAssertString(assert_type), decomposition);
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ passed ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ void logAssertThrows(bool threw, const char* expr, assertType::Enum assert_type,
+ const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+
+ if (!threw)
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "didn't throw at all\n");
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + context.c_str() + "\n");
+ }
+
+ void logAssertThrowsAs(bool threw, bool threw_as, const char* as, const String& exception,
+ const char* expr, assertType::Enum assert_type, const char* file,
+ int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw_as ? "PASSED" : getFailString(assert_type));
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s, %s )\n",
+ getAssertString(assert_type), expr, as);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+
+ if (!threw) { //!OCLINT inverted logic
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "didn't throw at all\n");
+ }
+ else if (!threw_as) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw a different exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw_as ? Color::BrightGreen : isWarn ? Color::Yellow : Color::Red);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ void logAssertNothrow(bool threw, const String& exception, const char* expr,
+ assertType::Enum assert_type, const char* file, int line) {
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(file),
+ lineForOutput(line));
+
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ threw ? getFailString(assert_type) : "PASSED");
+
+ char info1[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(info1, DOCTEST_COUNTOF(info1), " %s( %s )\n",
+ getAssertString(assert_type), expr);
+
+ char info2[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ char info3[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ info2[0] = 0;
+ info3[0] = 0;
+ if (threw) {
+ DOCTEST_SNPRINTF(info2, DOCTEST_COUNTOF(info2), "threw exception:\n");
+ DOCTEST_SNPRINTF(info3, DOCTEST_COUNTOF(info3), " %s\n", exception.c_str());
+ }
+
+ bool isWarn = assert_type & assertType::is_warn;
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg,
+ threw ? isWarn ? Color::Yellow : Color::Red : Color::BrightGreen);
+ DOCTEST_PRINTF_COLORED(info1, Color::Cyan);
+ DOCTEST_PRINTF_COLORED(info2, Color::None);
+ DOCTEST_PRINTF_COLORED(info3, Color::Cyan);
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + info1 + info2 + info3 + context.c_str() + "\n");
+ }
+
+ ResultBuilder::ResultBuilder(assertType::Enum assert_type, const char* file, int line,
+ const char* expr, const char* exception_type)
+ : m_assert_type(assert_type)
+ , m_file(file)
+ , m_line(line)
+ , m_expr(expr)
+ , m_exception_type(exception_type)
+ , m_threw(false)
+ , m_threw_as(false)
+ , m_failed(false) {
+#ifdef _MSC_VER
+ if (m_expr[0] == ' ') // this happens when variadic macros are disabled under MSVC
+ ++m_expr;
+#endif // _MSC_VER
+ }
+
+ ResultBuilder::~ResultBuilder() {}
+
+ void ResultBuilder::unexpectedExceptionOccurred() {
+ m_threw = true;
+
+ m_exception = translateActiveException();
+ }
+
+ bool ResultBuilder::log() {
+ if ((m_assert_type & assertType::is_warn) == 0) //!OCLINT bitwise operator in conditional
+ contextState->numAssertionsForCurrentTestcase++;
+
+ if (m_assert_type & assertType::is_throws) { //!OCLINT bitwise operator in conditional
+ m_failed = !m_threw;
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_throws_as) {
+ m_failed = !m_threw_as;
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_nothrow) {
+ m_failed = m_threw;
+ }
+ else {
+ m_failed = m_result;
+ }
+
+ if (m_failed || contextState->success) {
+ DOCTEST_LOG_START();
+
+ if (m_assert_type & assertType::is_throws) { //!OCLINT bitwise operator in conditional
+ logAssertThrows(m_threw, m_expr, m_assert_type, m_file, m_line);
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_throws_as) {
+ logAssertThrowsAs(m_threw, m_threw_as, m_exception_type, m_exception, m_expr,
+ m_assert_type, m_file, m_line);
+ }
+ else if (m_assert_type & //!OCLINT bitwise operator in conditional
+ assertType::is_nothrow) {
+ logAssertNothrow(m_threw, m_exception, m_expr, m_assert_type, m_file, m_line);
+ }
+ else {
+ logAssert(m_result.m_passed, m_result.m_decomposition.c_str(), m_threw, m_exception,
+ m_expr, m_assert_type, m_file, m_line);
+ }
+ }
+
+ if (m_failed)
+ addFailedAssert(m_assert_type);
+
+ return m_failed && isDebuggerActive() && !contextState->no_breaks; // break into debugger
+ }
+
+ void ResultBuilder::react() const {
+ if (m_failed && checkIfShouldThrow(m_assert_type))
+ throwException();
+ }
+
+ MessageBuilder::MessageBuilder(const char* file, int line,
+ doctest::detail::assertType::Enum severity)
+ : m_stream(createStream())
+ , m_file(file)
+ , m_line(line)
+ , m_severity(severity) {}
+
+ bool MessageBuilder::log() {
+ DOCTEST_LOG_START();
+
+ bool is_warn = m_severity & doctest::detail::assertType::is_warn;
+
+ // warn is just a message in this context so we dont treat it as an assert
+ if (!is_warn) {
+ contextState->numAssertionsForCurrentTestcase++;
+ addFailedAssert(m_severity);
+ }
+
+ char loc[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(loc, DOCTEST_COUNTOF(loc), "%s(%d)", fileForOutput(m_file),
+ lineForOutput(m_line));
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), " %s!\n",
+ is_warn ? "MESSAGE" : getFailString(m_severity));
+
+ DOCTEST_PRINTF_COLORED(loc, Color::LightGrey);
+ DOCTEST_PRINTF_COLORED(msg, is_warn ? Color::Yellow : Color::Red);
+
+ String info = getStreamResult(m_stream);
+ if (info.size()) {
+ DOCTEST_PRINTF_COLORED(" ", Color::None);
+ DOCTEST_PRINTF_COLORED(info.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+ }
+ String context = logContext();
+ DOCTEST_PRINTF_COLORED(context.c_str(), Color::None);
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ printToDebugConsole(String(loc) + msg + " " + info.c_str() + "\n" + context.c_str() +
+ "\n");
+
+ return isDebuggerActive() && !contextState->no_breaks && !is_warn; // break into debugger
+ }
+
+ void MessageBuilder::react() {
+ if (m_severity & assertType::is_require) //!OCLINT bitwise operator in conditional
+ throwException();
+ }
+
+ MessageBuilder::~MessageBuilder() { freeStream(m_stream); }
+
+ // the implementation of parseFlag()
+ bool parseFlagImpl(int argc, const char* const* argv, const char* pattern) {
+ for (int i = argc - 1; i >= 0; --i) {
+ const char* temp = std::strstr(argv[i], pattern);
+ if (temp && my_strlen(temp) == my_strlen(pattern)) {
+ // eliminate strings in which the chars before the option are not '-'
+ bool noBadCharsFound = true; //!OCLINT prefer early exits and continue
+ while (temp != argv[i]) {
+ if (*--temp != '-') {
+ noBadCharsFound = false;
+ break;
+ }
+ }
+ if (noBadCharsFound && argv[i][0] == '-')
+ return true;
+ }
+ }
+ return false;
+ }
+
+ // locates a flag on the command line
+ bool parseFlag(int argc, const char* const* argv, const char* pattern) {
+#ifndef DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ if (!parseFlagImpl(argc, argv, pattern))
+ return parseFlagImpl(argc, argv, pattern + 3); // 3 for "dt-"
+ return true;
+#else // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ return parseFlagImpl(argc, argv, pattern);
+#endif // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ }
+
+ // the implementation of parseOption()
+ bool parseOptionImpl(int argc, const char* const* argv, const char* pattern, String& res) {
+ for (int i = argc - 1; i >= 0; --i) {
+ const char* temp = std::strstr(argv[i], pattern);
+ if (temp) { //!OCLINT prefer early exits and continue
+ // eliminate matches in which the chars before the option are not '-'
+ bool noBadCharsFound = true;
+ const char* curr = argv[i];
+ while (curr != temp) {
+ if (*curr++ != '-') {
+ noBadCharsFound = false;
+ break;
+ }
+ }
+ if (noBadCharsFound && argv[i][0] == '-') {
+ temp += my_strlen(pattern);
+ unsigned len = my_strlen(temp);
+ if (len) {
+ res = temp;
+ return true;
+ }
+ }
+ }
+ }
+ return false;
+ }
+
+ // parses an option and returns the string after the '=' character
+ bool parseOption(int argc, const char* const* argv, const char* pattern, String& res,
+ const String& defaultVal = String()) {
+ res = defaultVal;
+#ifndef DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ if (!parseOptionImpl(argc, argv, pattern, res))
+ return parseOptionImpl(argc, argv, pattern + 3, res); // 3 for "dt-"
+ return true;
+#else // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ return parseOptionImpl(argc, argv, pattern, res);
+#endif // DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
+ }
+
+ // parses a comma separated list of words after a pattern in one of the arguments in argv
+ bool parseCommaSepArgs(int argc, const char* const* argv, const char* pattern,
+ std::vector<String>& res) {
+ String filtersString;
+ if (parseOption(argc, argv, pattern, filtersString)) {
+ // tokenize with "," as a separator
+ // cppcheck-suppress strtokCalled
+ char* pch = std::strtok(filtersString.c_str(), ","); // modifies the string
+ while (pch != 0) {
+ if (my_strlen(pch))
+ res.push_back(pch);
+ // uses the strtok() internal state to go to the next token
+ // cppcheck-suppress strtokCalled
+ pch = std::strtok(0, ",");
+ }
+ return true;
+ }
+ return false;
+ }
+
+ enum optionType
+ {
+ option_bool,
+ option_int
+ };
+
+ // parses an int/bool option from the command line
+ bool parseIntOption(int argc, const char* const* argv, const char* pattern, optionType type,
+ int& res) {
+ String parsedValue;
+ if (!parseOption(argc, argv, pattern, parsedValue))
+ return false;
+
+ if (type == 0) {
+ // boolean
+ const char positive[][5] = { "1", "true", "on", "yes" }; // 5 - strlen("true") + 1
+ const char negative[][6] = { "0", "false", "off", "no" }; // 6 - strlen("false") + 1
+
+ // if the value matches any of the positive/negative possibilities
+ for (unsigned i = 0; i < 4; i++) {
+ if (parsedValue.compare(positive[i], true) == 0) {
+ res = 1; //!OCLINT parameter reassignment
+ return true;
+ }
+ if (parsedValue.compare(negative[i], true) == 0) {
+ res = 0; //!OCLINT parameter reassignment
+ return true;
+ }
+ }
+ }
+ else {
+ // integer
+ int theInt = std::atoi(parsedValue.c_str()); // NOLINT
+ if (theInt != 0) {
+ res = theInt; //!OCLINT parameter reassignment
+ return true;
+ }
+ }
+ return false;
+ }
+
+ void printVersion() {
+ if (contextState->no_version == false) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("doctest version is \"%s\"\n", DOCTEST_VERSION_STR);
+ }
+ }
+
+ void printHelp() {
+ printVersion();
+ // clang-format off
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("boolean values: \"1/on/yes/true\" or \"0/off/no/false\"\n");
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("filter values: \"str1,str2,str3\" (comma separated strings)\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("filters use wildcards for matching strings\n");
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("something passes a filter if any of the strings in a filter matches\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("ALL FLAGS, OPTIONS AND FILTERS ALSO AVAILABLE WITH A \"dt-\" PREFIX!!!\n");
+ DOCTEST_PRINTF_COLORED("[doctest]\n", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("Query flags - the program quits after them. Available:\n\n");
+ std::printf(" -?, --help, -h prints this message\n");
+ std::printf(" -v, --version prints the version\n");
+ std::printf(" -c, --count prints the number of matching tests\n");
+ std::printf(" -ltc, --list-test-cases lists all matching tests by name\n");
+ std::printf(" -lts, --list-test-suites lists all matching test suites\n\n");
+ // ========================================================================================= << 79
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("The available <int>/<string> options/filters are:\n\n");
+ std::printf(" -tc, --test-case=<filters> filters tests by their name\n");
+ std::printf(" -tce, --test-case-exclude=<filters> filters OUT tests by their name\n");
+ std::printf(" -sf, --source-file=<filters> filters tests by their file\n");
+ std::printf(" -sfe, --source-file-exclude=<filters> filters OUT tests by their file\n");
+ std::printf(" -ts, --test-suite=<filters> filters tests by their test suite\n");
+ std::printf(" -tse, --test-suite-exclude=<filters> filters OUT tests by their test suite\n");
+ std::printf(" -sc, --subcase=<filters> filters subcases by their name\n");
+ std::printf(" -sce, --subcase-exclude=<filters> filters OUT subcases by their name\n");
+ std::printf(" -ob, --order-by=<string> how the tests should be ordered\n");
+ std::printf(" <string> - by [file/suite/name/rand]\n");
+ std::printf(" -rs, --rand-seed=<int> seed for random ordering\n");
+ std::printf(" -f, --first=<int> the first test passing the filters to\n");
+ std::printf(" execute - for range-based execution\n");
+ std::printf(" -l, --last=<int> the last test passing the filters to\n");
+ std::printf(" execute - for range-based execution\n");
+ std::printf(" -aa, --abort-after=<int> stop after <int> failed assertions\n");
+ std::printf(" -scfl,--subcase-filter-levels=<int> apply filters for the first <int> levels\n");
+ DOCTEST_PRINTF_COLORED("\n[doctest] ", Color::Cyan);
+ std::printf("Bool options - can be used like flags and true is assumed. Available:\n\n");
+ std::printf(" -s, --success=<bool> include successful assertions in output\n");
+ std::printf(" -cs, --case-sensitive=<bool> filters being treated as case sensitive\n");
+ std::printf(" -e, --exit=<bool> exits after the tests finish\n");
+ std::printf(" -d, --duration=<bool> prints the time duration of each test\n");
+ std::printf(" -nt, --no-throw=<bool> skips exceptions-related assert checks\n");
+ std::printf(" -ne, --no-exitcode=<bool> returns (or exits) always with success\n");
+ std::printf(" -nr, --no-run=<bool> skips all runtime doctest operations\n");
+ std::printf(" -nv, --no-version=<bool> omit the framework version in the output\n");
+ std::printf(" -nc, --no-colors=<bool> disables colors in output\n");
+ std::printf(" -fc, --force-colors=<bool> use colors even when not in a tty\n");
+ std::printf(" -nb, --no-breaks=<bool> disables breakpoints in debuggers\n");
+ std::printf(" -ns, --no-skip=<bool> don't skip test cases marked as skip\n");
+ std::printf(" -npf, --no-path-filenames=<bool> only filenames and no paths in output\n");
+ std::printf(" -nln, --no-line-numbers=<bool> 0 instead of real line numbers in output\n");
+ // ========================================================================================= << 79
+ // clang-format on
+
+ DOCTEST_PRINTF_COLORED("\n[doctest] ", Color::Cyan);
+ std::printf("for more information visit the project documentation\n\n");
+ }
+
+ void printSummary() {
+ const ContextState* p = contextState;
+
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ if (p->count || p->list_test_cases) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("unskipped test cases passing the current filters: %u\n",
+ p->numTestsPassingFilters);
+ }
+ else if (p->list_test_suites) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("unskipped test cases passing the current filters: %u\n",
+ p->numTestsPassingFilters);
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("test suites with unskipped test cases passing the current filters: %u\n",
+ p->numTestSuitesPassingFilters);
+ }
+ else {
+ bool anythingFailed = p->numFailed > 0 || p->numFailedAssertions > 0;
+
+ char buff[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "test cases: %6u",
+ p->numTestsPassingFilters);
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d passed",
+ p->numTestsPassingFilters - p->numFailed);
+ DOCTEST_PRINTF_COLORED(buff,
+ (p->numTestsPassingFilters == 0 || anythingFailed) ?
+ Color::None :
+ Color::Green);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6u failed", p->numFailed);
+ DOCTEST_PRINTF_COLORED(buff, p->numFailed > 0 ? Color::Red : Color::None);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ if (p->no_skipped_summary == false) {
+ int numSkipped = static_cast<unsigned>(getRegisteredTests().size()) -
+ p->numTestsPassingFilters;
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d skipped", numSkipped);
+ DOCTEST_PRINTF_COLORED(buff, numSkipped == 0 ? Color::None : Color::Yellow);
+ }
+ DOCTEST_PRINTF_COLORED("\n", Color::None);
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "assertions: %6d", p->numAssertions);
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d passed",
+ p->numAssertions - p->numFailedAssertions);
+ DOCTEST_PRINTF_COLORED(
+ buff, (p->numAssertions == 0 || anythingFailed) ? Color::None : Color::Green);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " | ");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), "%6d failed", p->numFailedAssertions);
+ DOCTEST_PRINTF_COLORED(buff, p->numFailedAssertions > 0 ? Color::Red : Color::None);
+
+ DOCTEST_SNPRINTF(buff, DOCTEST_COUNTOF(buff), " |\n");
+ DOCTEST_PRINTF_COLORED(buff, Color::None);
+
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ DOCTEST_PRINTF_COLORED("Status: ", Color::None);
+ const char* result = (p->numFailed > 0) ? "FAILURE!\n" : "SUCCESS!\n";
+ DOCTEST_PRINTF_COLORED(result, p->numFailed > 0 ? Color::Red : Color::Green);
+ }
+
+ // remove any coloring
+ DOCTEST_PRINTF_COLORED("", Color::None);
+ }
+ } // namespace detail
+
+ bool isRunningInTest() { return detail::contextState != 0; }
+
+ Context::Context(int argc, const char* const* argv)
+ : p(new detail::ContextState) {
+ parseArgs(argc, argv, true);
+ }
+
+ Context::~Context() { delete p; }
+
+ void Context::applyCommandLine(int argc, const char* const* argv) { parseArgs(argc, argv); }
+
+ // parses args
+ void Context::parseArgs(int argc, const char* const* argv, bool withDefaults) {
+ using namespace detail;
+
+ // clang-format off
+ parseCommaSepArgs(argc, argv, "dt-source-file=", p->filters[0]);
+ parseCommaSepArgs(argc, argv, "dt-sf=", p->filters[0]);
+ parseCommaSepArgs(argc, argv, "dt-source-file-exclude=", p->filters[1]);
+ parseCommaSepArgs(argc, argv, "dt-sfe=", p->filters[1]);
+ parseCommaSepArgs(argc, argv, "dt-test-suite=", p->filters[2]);
+ parseCommaSepArgs(argc, argv, "dt-ts=", p->filters[2]);
+ parseCommaSepArgs(argc, argv, "dt-test-suite-exclude=", p->filters[3]);
+ parseCommaSepArgs(argc, argv, "dt-tse=", p->filters[3]);
+ parseCommaSepArgs(argc, argv, "dt-test-case=", p->filters[4]);
+ parseCommaSepArgs(argc, argv, "dt-tc=", p->filters[4]);
+ parseCommaSepArgs(argc, argv, "dt-test-case-exclude=", p->filters[5]);
+ parseCommaSepArgs(argc, argv, "dt-tce=", p->filters[5]);
+ parseCommaSepArgs(argc, argv, "dt-subcase=", p->filters[6]);
+ parseCommaSepArgs(argc, argv, "dt-sc=", p->filters[6]);
+ parseCommaSepArgs(argc, argv, "dt-subcase-exclude=", p->filters[7]);
+ parseCommaSepArgs(argc, argv, "dt-sce=", p->filters[7]);
+ // clang-format on
+
+ int intRes = 0;
+ String strRes;
+
+#define DOCTEST_PARSE_AS_BOOL_OR_FLAG(name, sname, var, default) \
+ if(parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), option_bool, intRes) || \
+ parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), option_bool, intRes)) \
+ p->var = !!intRes; \
+ else if(parseFlag(argc, argv, #name) || parseFlag(argc, argv, #sname)) \
+ p->var = true; \
+ else if(withDefaults) \
+ p->var = default
+
+#define DOCTEST_PARSE_INT_OPTION(name, sname, var, default) \
+ if(parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), option_int, intRes) || \
+ parseIntOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), option_int, intRes)) \
+ p->var = intRes; \
+ else if(withDefaults) \
+ p->var = default
+
+#define DOCTEST_PARSE_STR_OPTION(name, sname, var, default) \
+ if(parseOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(name, =), strRes, default) || \
+ parseOption(argc, argv, DOCTEST_STR_CONCAT_TOSTR(sname, =), strRes, default) || \
+ withDefaults) \
+ p->var = strRes
+
+ // clang-format off
+ DOCTEST_PARSE_STR_OPTION(dt - order - by, dt - ob, order_by, "file");
+ DOCTEST_PARSE_INT_OPTION(dt - rand - seed, dt - rs, rand_seed, 0);
+
+ DOCTEST_PARSE_INT_OPTION(dt - first, dt - f, first, 1);
+ DOCTEST_PARSE_INT_OPTION(dt - last, dt - l, last, 0);
+
+ DOCTEST_PARSE_INT_OPTION(dt - abort - after, dt - aa, abort_after, 0);
+ DOCTEST_PARSE_INT_OPTION(dt - subcase - filter - levels, dt - scfl, subcase_filter_levels, 2000000000);
+
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - success, dt - s, success, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - case-sensitive, dt - cs, case_sensitive, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - exit, dt - e, exit, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - duration, dt - d, duration, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - throw, dt - nt, no_throw, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - exitcode, dt - ne, no_exitcode, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - run, dt - nr, no_run, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - version, dt - nv, no_version, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - colors, dt - nc, no_colors, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - force - colors, dt - fc, force_colors, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - breaks, dt - nb, no_breaks, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - skip, dt - ns, no_skip, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - path - filenames, dt - npf, no_path_in_filenames, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - line - numbers, dt - nln, no_line_numbers, false);
+ DOCTEST_PARSE_AS_BOOL_OR_FLAG(dt - no - skipped - summary, dt - nss, no_skipped_summary, false);
+ // clang-format on
+
+#undef DOCTEST_PARSE_STR_OPTION
+#undef DOCTEST_PARSE_INT_OPTION
+#undef DOCTEST_PARSE_AS_BOOL_OR_FLAG
+
+ if (withDefaults) {
+ p->help = false;
+ p->version = false;
+ p->count = false;
+ p->list_test_cases = false;
+ p->list_test_suites = false;
+ }
+ if (parseFlag(argc, argv, "dt-help") || parseFlag(argc, argv, "dt-h") ||
+ parseFlag(argc, argv, "dt-?")) {
+ p->help = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-version") || parseFlag(argc, argv, "dt-v")) {
+ p->version = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-count") || parseFlag(argc, argv, "dt-c")) {
+ p->count = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-list-test-cases") || parseFlag(argc, argv, "dt-ltc")) {
+ p->list_test_cases = true;
+ p->exit = true;
+ }
+ if (parseFlag(argc, argv, "dt-list-test-suites") || parseFlag(argc, argv, "dt-lts")) {
+ p->list_test_suites = true;
+ p->exit = true;
+ }
+ }
+
+ // allows the user to add procedurally to the filters from the command line
+ void Context::addFilter(const char* filter, const char* value) { setOption(filter, value); }
+
+ // allows the user to clear all filters from the command line
+ void Context::clearFilters() {
+ for (unsigned i = 0; i < p->filters.size(); ++i)
+ p->filters[i].clear();
+ }
+
+ // allows the user to override procedurally the int/bool options from the command line
+ void Context::setOption(const char* option, int value) {
+ setOption(option, toString(value).c_str());
+ }
+
+ // allows the user to override procedurally the string options from the command line
+ void Context::setOption(const char* option, const char* value) {
+ String argv = String("-") + option + "=" + value;
+ const char* lvalue = argv.c_str();
+ parseArgs(1, &lvalue);
+ }
+
+ // users should query this in their main() and exit the program if true
+ bool Context::shouldExit() { return p->exit; }
+
+ // the main function that does all the filtering and test running
+ int Context::run() {
+ using namespace detail;
+
+ Color::init();
+
+ contextState = p;
+ p->resetRunData();
+
+ // handle version, help and no_run
+ if (p->no_run || p->version || p->help) {
+ if (p->version)
+ printVersion();
+ if (p->help)
+ printHelp();
+
+ contextState = 0;
+
+ return EXIT_SUCCESS;
+ }
+
+ printVersion();
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("run with \"--help\" for options\n");
+
+ unsigned i = 0; // counter used for loops - here for VC6
+
+ std::set<TestCase>& registeredTests = getRegisteredTests();
+
+ std::vector<const TestCase*> testArray;
+ for (std::set<TestCase>::iterator it = registeredTests.begin(); it != registeredTests.end();
+ ++it)
+ testArray.push_back(&(*it));
+
+ // sort the collected records
+ if (!testArray.empty()) {
+ if (p->order_by.compare("file", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), fileOrderComparator);
+ }
+ else if (p->order_by.compare("suite", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), suiteOrderComparator);
+ }
+ else if (p->order_by.compare("name", true) == 0) {
+ std::qsort(&testArray[0], testArray.size(), sizeof(TestCase*), nameOrderComparator);
+ }
+ else if (p->order_by.compare("rand", true) == 0) {
+ std::srand(p->rand_seed);
+
+ // random_shuffle implementation
+ const TestCase** first = &testArray[0];
+ for (i = testArray.size() - 1; i > 0; --i) {
+ int idxToSwap = std::rand() % (i + 1); // NOLINT
+
+ const TestCase* temp = first[i];
+
+ first[i] = first[idxToSwap];
+ first[idxToSwap] = temp;
+ }
+ }
+ }
+
+ if (p->list_test_cases) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("listing all test case names\n");
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ }
+
+ std::set<String> testSuitesPassingFilters;
+ if (p->list_test_suites) {
+ DOCTEST_PRINTF_COLORED("[doctest] ", Color::Cyan);
+ std::printf("listing all test suites\n");
+ DOCTEST_PRINTF_COLORED(getSeparator(), Color::Yellow);
+ }
+
+ // invoke the registered functions if they match the filter criteria (or just count them)
+ for (i = 0; i < testArray.size(); i++) {
+ const TestCase& data = *testArray[i];
+
+ if (data.m_skip && !p->no_skip)
+ continue;
+
+ if (!matchesAny(data.m_file, p->filters[0], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_file, p->filters[1], 0, p->case_sensitive))
+ continue;
+ if (!matchesAny(data.m_test_suite, p->filters[2], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_test_suite, p->filters[3], 0, p->case_sensitive))
+ continue;
+ if (!matchesAny(data.m_name, p->filters[4], 1, p->case_sensitive))
+ continue;
+ if (matchesAny(data.m_name, p->filters[5], 0, p->case_sensitive))
+ continue;
+
+ p->numTestsPassingFilters++;
+
+ // do not execute the test if we are to only count the number of filter passing tests
+ if (p->count)
+ continue;
+
+ // print the name of the test and don't execute it
+ if (p->list_test_cases) {
+ std::printf("%s\n", data.m_name);
+ continue;
+ }
+
+ // print the name of the test suite if not done already and don't execute it
+ if (p->list_test_suites) {
+ if ((testSuitesPassingFilters.count(data.m_test_suite) == 0) &&
+ data.m_test_suite[0] != '\0') {
+ std::printf("%s\n", data.m_test_suite);
+ testSuitesPassingFilters.insert(data.m_test_suite);
+ p->numTestSuitesPassingFilters++;
+ }
+ continue;
+ }
+
+ // skip the test if it is not in the execution range
+ if ((p->last < p->numTestsPassingFilters && p->first <= p->last) ||
+ (p->first > p->numTestsPassingFilters))
+ continue;
+
+ // execute the test if it passes all the filtering
+ {
+ p->currentTest = &data;
+
+ bool failed = false;
+ p->hasLoggedCurrentTestStart = false;
+ p->numFailedAssertionsForCurrentTestcase = 0;
+ p->subcasesPassed.clear();
+ double duration = 0;
+ Timer timer;
+ timer.start();
+ do {
+ // if the start has been logged from a previous iteration of this loop
+ if (p->hasLoggedCurrentTestStart)
+ logTestEnd();
+ p->hasLoggedCurrentTestStart = false;
+
+ // if logging successful tests - force the start log
+ if (p->success)
+ DOCTEST_LOG_START();
+
+ // reset the assertion state
+ p->numAssertionsForCurrentTestcase = 0;
+ p->hasCurrentTestFailed = false;
+
+ // reset some of the fields for subcases (except for the set of fully passed ones)
+ p->subcasesHasSkipped = false;
+ p->subcasesCurrentLevel = 0;
+ p->subcasesEnteredLevels.clear();
+
+ // reset stuff for logging with INFO()
+ p->exceptionalContexts.clear();
+
+ // execute the test
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ try {
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+ FatalConditionHandler fatalConditionHandler; // Handle signals
+ data.m_test();
+ fatalConditionHandler.reset();
+ if (contextState->hasCurrentTestFailed)
+ failed = true;
+#ifndef DOCTEST_CONFIG_NO_EXCEPTIONS
+ }
+ catch (const TestFailureException&) { failed = true; }
+ catch (...) {
+ DOCTEST_LOG_START();
+ logTestException(translateActiveException());
+ failed = true;
+ }
+#endif // DOCTEST_CONFIG_NO_EXCEPTIONS
+
+ p->numAssertions += p->numAssertionsForCurrentTestcase;
+
+ // exit this loop if enough assertions have failed
+ if (p->abort_after > 0 && p->numFailedAssertions >= p->abort_after) {
+ p->subcasesHasSkipped = false;
+ DOCTEST_PRINTF_COLORED("Aborting - too many failed asserts!\n", Color::Red);
+ }
+
+ } while (p->subcasesHasSkipped == true);
+
+ duration = timer.getElapsedSeconds();
+
+ if (Approx(p->currentTest->m_timeout).epsilon(DBL_EPSILON) != 0 &&
+ Approx(duration).epsilon(DBL_EPSILON) > p->currentTest->m_timeout) {
+ failed = true;
+ DOCTEST_LOG_START();
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg),
+ "Test case exceeded time limit of %.6f!\n",
+ p->currentTest->m_timeout);
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ }
+
+ if (p->duration) {
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg), "%.6f s: %s\n", duration,
+ p->currentTest->m_name);
+ DOCTEST_PRINTF_COLORED(msg, Color::None);
+ }
+
+ if (data.m_should_fail) {
+ DOCTEST_LOG_START();
+ if (failed) {
+ failed = false;
+ DOCTEST_PRINTF_COLORED("Failed as expected so marking it as not failed\n",
+ Color::Yellow);
+ }
+ else {
+ failed = true;
+ DOCTEST_PRINTF_COLORED("Should have failed but didn't! Marking it as failed!\n",
+ Color::Red);
+ }
+ }
+ else if (failed && data.m_may_fail) {
+ DOCTEST_LOG_START();
+ failed = false;
+ DOCTEST_PRINTF_COLORED("Allowed to fail so marking it as not failed\n",
+ Color::Yellow);
+ }
+ else if (data.m_expected_failures > 0) {
+ DOCTEST_LOG_START();
+ char msg[DOCTEST_SNPRINTF_BUFFER_LENGTH];
+ if (p->numFailedAssertionsForCurrentTestcase == data.m_expected_failures) {
+ failed = false;
+ DOCTEST_SNPRINTF(
+ msg, DOCTEST_COUNTOF(msg),
+ "Failed exactly %d times as expected so marking it as not failed!\n",
+ data.m_expected_failures);
+ DOCTEST_PRINTF_COLORED(msg, Color::Yellow);
+ }
+ else {
+ failed = true;
+ DOCTEST_SNPRINTF(msg, DOCTEST_COUNTOF(msg),
+ "Didn't fail exactly %d times so marking it as failed!\n",
+ data.m_expected_failures);
+ DOCTEST_PRINTF_COLORED(msg, Color::Red);
+ }
+ }
+
+ if (p->hasLoggedCurrentTestStart)
+ logTestEnd();
+
+ if (failed) // if any subcase has failed - the whole test case has failed
+ p->numFailed++;
+
+ // stop executing tests if enough assertions have failed
+ if (p->abort_after > 0 && p->numFailedAssertions >= p->abort_after)
+ break;
+ }
+ }
+
+ printSummary();
+
+ contextState = 0;
+
+ if (p->numFailed && !p->no_exitcode)
+ return EXIT_FAILURE;
+ return EXIT_SUCCESS;
+ }
+} // namespace doctest
+
+#endif // DOCTEST_CONFIG_DISABLE
+
+#ifdef DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+int main(int argc, char** argv) { return doctest::Context(argc, argv).run(); }
+#endif // DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
+
+#endif // DOCTEST_LIBRARY_IMPLEMENTATION
+#endif // DOCTEST_CONFIG_IMPLEMENT
+
+#if defined(__clang__)
+#pragma clang diagnostic pop
+#endif // __clang__
+
+#if defined(__GNUC__) && !defined(__clang__)
+#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 6)
+#pragma GCC diagnostic pop
+#endif // > gcc 4.6
+#endif // __GNUC__
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif // _MSC_VER
\ No newline at end of file
diff --git a/SequenceComparison/draw.h b/SequenceComparison/draw.h
index d7afbf3d18f53114c7fcedab82a3c84ca0a2513a..08ed3778e349fc20c7d4a3e276f3b19f56b950ca 100644
--- a/SequenceComparison/draw.h
+++ b/SequenceComparison/draw.h
@@ -2,15 +2,19 @@
#define DRAW_H
#include "structs.h"
+#include "parameter.h"
+#include "help.h"
#if defined (_MSC_VER)
+#pragma component(browser, off, references)
#pragma warning(push, 0)
#elif (__INTEL_COMPILER)
#pragma diagnostic push
#pragma warning ( disable : 61 )
#elif (__GNUC__)
#pragma GCC diagnostic push
-#pragma warning ( disable : ALL_CODE_ANALYSIS_WARNINGS )
+#pragma GCC system_header
+//#pragma GCC diagnostic ignored "-Wno-multichar"
#endif
//#define cimg_use_png
@@ -19,6 +23,7 @@
#if defined (_MSC_VER)
#pragma warning(pop)
+#pragma component(browser, on, references)
#elif (__INTEL_COMPILER)
#pragma diagnostic pop
#elif (__GNUC__)
@@ -105,113 +110,73 @@ public:
all.save(generateName(info, params.drawOut).c_str());
}
- template <class T>
- static CImg<short> matrix(vtr2<node<T>> const &matrix, string const &dtwPath, parameter const ¶ms)
+ static CImg<short> matrix(vtr2<node> const &matrix, vtr<result_path> const &warpings, vtr2<range> const &ranges, parameter const ¶ms)
{
CImg<short> img((int)matrix[0].size() - 1, (int)matrix.size() - 1, 1, 3, 0);
+ int lenA = (int)matrix.size() - 1;
+ int lenB = (int)matrix[0].size() - 1;
double max = constant::MIN_double;
- for (size_t i = 1; i < matrix.size(); i++) // Iterating over rows
+ const int w = (int)(lenB * params.w);
+ double coef = lenB / static_cast<double>(lenA);
+
+ for (size_t i = 1; i < lenA + 1; i++) // Iterating over rows
{
- for (size_t j = 1; j < matrix[i].size(); j++)
+ size_t start = std::max(1, (int)(ceil((i - 1) * coef + 0.0000000001) - w));
+ size_t end = std::min(lenB + 1, (int)(ceil(i * coef) + 1) + w);
+ for (size_t j = start; j < end; j++)
{
if (matrix[i][j].value > max)
max = matrix[i][j].value;
}
}
- vtr<coords> pathCoords(dtwPath.size());
- int row = -1, col = -1;
- for (size_t i = 0; i < dtwPath.size(); i++)
- {
- float color[] = { 0, 255, 0 };
- if (i == 0) {
- color[0] = 255;
- color[1] = 0;
- }
-
- if (dtwPath[i] == 'M'){
- row++;
- col++;
- }
- else if (dtwPath[i] == 'L')
- col++;
- else if (dtwPath[i] == 'U')
- row++;
-
- pathCoords[i] = coords(row + 1, col + 1); //x,y(i,j)
- }
+ vtr2<coords> pathCoords(warpings.size());
+ for (int i = 0; i < warpings.size(); i++)
+ pathCoords[i] = warpings[i].convert_toCoords();
const float red[] = { 255, 0, 0 };
const float teal[] = { 255, 0, 0 };
const float green[] = { 0, 255, 0 };
-
+
int count = 0;
for (size_t i = 1; i < matrix.size(); i++) //row//y
{
for (size_t j = 1; j < matrix[i].size(); j++) //coll//x
{
- //T current = matrix[i][j].value;
-
auto colorRGB = draw::getColor(0, max, matrix[i][j].value);
const float color[] = { colorRGB.r, colorRGB.g, colorRGB.b };
- img.draw_point((int)j - 1, (int)i - 1, color);
-
+ img.draw_point((int)j - 1, (int)i - 1, color);
}
}
-
- for (auto &i : pathCoords)
- img.draw_point(i.col - 1, i.row - 1, green);
+ for (size_t i = 0; i < pathCoords.size(); i++)
+ for(size_t j = 0; j < ranges[i].size(); j++)
+ for (size_t k = ranges[i][j].start; k < ranges[i][j].end; k++)
+ img.draw_point(pathCoords[i][k].col - 1, pathCoords[i][k].row - 1, green);
+
for (size_t i = 1; i < matrix.size(); i++) //row//y
{
for (size_t j = 1; j < matrix[i].size(); j++) //coll//x
{
- T current = matrix[i][j].value;
+ double current = matrix[i][j].value;
if (params.drawMin && i + 1 < matrix.size() && j + 1 < matrix[i].size() &&
matrix[i - 1][j].value > current && matrix[i - 1][j + 1].value > current && matrix[i][j - 1].value > current &&
matrix[i][j + 1].value > current && matrix[i + 1][j - 1].value > current && matrix[i + 1][j].value > current) {
img.draw_point((int)j - 1, (int)i - 1, red);
+ j++;
}
}
}
- //int ii = -1, jj = -1;
- //for (size_t i = 0; i < dtwPath.size(); i++)
- //{
- // float color[] = { 0, 255, 0 };
- // if (i == 0){
- // color[0] = 255;
- // color[1] = 0;
- // }
- //
- // if (dtwPath[i] == 'M')
- // {
- // ii++;
- // jj++;
- // }
- // else if (dtwPath[i] == 'L')
- // jj++;
- // else if (dtwPath[i] == 'U')
- // ii++;
-
- // img.draw_point(jj, ii, color); //x, y
- //
- // //img.draw_point(jj+1, ii, color);
- // //img.draw_point(jj, ii+1, color);
- // //img.draw_point(jj+1, ii + 1, color);
- // //img.draw_circle(jj, ii, 2, color);
- //}
-
return img;
}
- template <class T>
- static CImg<short> matrix_min(vtr2<node<T>> const &matrix, parameter const ¶ms)
+ static CImg<short> matrix_min(vtr2<node> const &matrix, parameter const ¶ms)
{
CImg<short> img((int)matrix[0].size() - 1, (int)matrix.size() - 1, 1, 3, 0);
@@ -230,13 +195,13 @@ public:
{
for (size_t j = 1; j < matrix[i].size(); j++) //coll//x
{
- T current = matrix[i][j].value;
+ double current = matrix[i][j].value;
auto colorRGB = draw::getColor(0, max, matrix[i][j].value);
const float color[] = { colorRGB.r, colorRGB.g, colorRGB.b };
const float red[] = { 255, 0, 0 };
- if (params. i + 1 < matrix.size() && j + 1 < matrix[i].size() &&
+ if (params.drawMin && i + 1 < matrix.size() && j + 1 < matrix[i].size() &&
matrix[i - 1][j].value > current && matrix[i - 1][j + 1].value > current && matrix[i][j - 1].value > current &&
matrix[i][j + 1].value > current && matrix[i + 1][j - 1].value > current && matrix[i + 1][j].value > current){
diff --git a/SequenceComparison/dtw.cpp b/SequenceComparison/dtw.cpp
index b97bcdd392c5cdb3b9cc2e0594550e5717dff2ca..b8a200292b5520aa345870cfc8ba6792725a8d15 100644
--- a/SequenceComparison/dtw.cpp
+++ b/SequenceComparison/dtw.cpp
@@ -19,6 +19,7 @@ input_method - input for the dtw method
input_info - info about input data
parameter - parameter for dtw method
*/
+
vtr<double> dtw::main(input_method const &input, input_info const &info, parameter const ¶ms)
{
vtr<double> result;
@@ -26,7 +27,7 @@ vtr<double> dtw::main(input_method const &input, input_info const &info, paramet
if (params.segmented)
result = main_segment(input, info, params);
else
- result = main_pair(input, info, params);
+ return main_pair(input, info, params);
return result;
}
@@ -40,11 +41,12 @@ parameter - parameter for dtw method
*/
vtr<double> dtw::main_pair(input_method const &input, input_info const &info, parameter const ¶ms)
{
- if ((input.A.size() * input.B.size()) / 131'072 > params.ram) //131072 to convert bytes to MB
+ if ((int)((input.A.size() * input.B.size()) / 131072) > params.ram) //131072 to convert bytes to MB
{
cout << "size A: " << input.A.size() << ", size B: " << input.B.size() << endl;
//throw runtime_error("DTW aborted. Input too large: " + to_string(input.A.size() * input.B.size()) + "B");
cout << "DTW aborted. Input too large: " << (input.A.size() * input.B.size() * 8) / 1024 / 1024 << "MB" << endl;
+ cout << "For overriding RAM limit use -ram [GBs] switch." << endl;
exit(0);
}
@@ -53,15 +55,13 @@ vtr<double> dtw::main_pair(input_method const &input, input_info const &info, pa
if (params.drawOut.size() > 0)
draw::plot_pair(result, input, info, params);
- if (params.isRatioReversed())
+ if (params.isRatioReversed())
{
for (size_t i = 0; i < result.score.size(); i++)
result.score[params.scoreType - 1] = 1 - result.score[params.scoreType - 1];
-
- return result.score;
}
- else
- return result.score;
+
+ return result.score;
}
/*
@@ -132,8 +132,6 @@ parameter - parameter for dtw method
*/
result_dtw dtw::configure(input_method const &input, input_info const &info, parameter const ¶ms)
{
- //distanceMatrix<double> dm(A, B, params);
-
DISTANCE d;
d.classic = calcul::distance_dtw_euklid;
@@ -150,42 +148,20 @@ result_dtw dtw::configure(input_method const &input, input_info const &info, par
result_path back;
result_dtw result;
-
- /*if(params.matrixDataType == "double")
- {*/
- if (params.isMemoization())
- {
- //auto begin = chrono::steady_clock::now();
- back = matrix_memoized(input.A, input.B, params);
- /*cout << print::printElapsed("v2: ", chrono::duration_cast<chrono::microseconds>(chrono::steady_clock::now() - begin).count()) << ", ";
-
- begin = chrono::steady_clock::now();
- back = dtw::matrix<double>(A, B, params);
- cout << print::printElapsed("v1: ", chrono::duration_cast<chrono::microseconds>(chrono::steady_clock::now() - begin).count()) << endl;
-
- if (back2.path != back.path)
- {
- cout << "diff: " << back2.pathSize - (int)back.path.size() << ", " << back.scoreRaw << " v2: " << back2.scoreRaw << endl;
- cout << back2.path << endl;
- cout << back.path << endl;
- }
- if (back2.scoreRaw != back.scoreRaw)
- cout << "diff: " << back2.pathSize - (int)back.path.size() << ", " << back.scoreRaw << " v2: " << back2.scoreRaw << " ~~!!!~~" << endl;*/
- }
- else if(params.block > 0)
- back = dtw::matrix_tiled(input.A, input.B, params);
- else if(params.isSimd())
- back = dtw::matrix_simd(input.A, input.B, params);
+ if (params.isMemoization())
+ back = matrix_memoized(input.A, input.B, params);
+ else if(params.block > 0)
+ back = dtw::matrix_tiled(input.A, input.B, params);
+ else if(params.isSimd())
+ back = dtw::matrix_simd(input.A, input.B, params);
+ else
+ {
+ if (params.localAlignment)
+ result = dtw::alignment_local(input, info, d, params);
else
- result = dtw::alignment(input, info, d, params);
- //}
- /*else if(params.matrixDataType == "int")
- result = dtw::alignment<int>(input, info, d, params);
- else if (params.matrixDataType == "float")
- result = dtw::alignment<float>(input, info, d, params)*/;
-
- //auto noacc = createMatrix_noAccumulation(A, B, params);
+ result = dtw::alignment(input, info, d, params);
+ }
return result;
}
@@ -200,51 +176,95 @@ parameter - parameter for dtw method
*/
result_dtw dtw::alignment(input_method const &input, input_info const &info, DISTANCE distance, parameter const ¶ms)
{
- vtr2<node<double>> m;
- if (params.experiment)
- {
- m = dtw::matrix_noaccumulation(input, distance, params);
- auto minims = dtw::get_minimums(m, params);
- for (auto &i : minims)
- m[i.row][i.col] = 0;
- dtw::accumulate_mod(m, minims, params);
- }
- else
- m = dtw::matrix(input, distance, params);
-
+ auto m = dtw::matrix(input, distance, params);
auto end = get_relaxedEnds(m, params);
- auto warping = get_warping(m, end, params);
- warping.scoreRaw = m[end.row][end.col].value;
- warping.wpEnd = end;
-
+ //auto warping = get_warping(m, end, params);
+
+ vtr<result_path> warping(1);
+ warping[0] = get_warping(m, end, params);
+ warping[0].scoreRaw = m[end.row][end.col].value;
+ warping[0].end = end;
+
+ vtr2<range> ranges(1);
+ ranges[0].push_back(range(0, (int)warping[0].path.size()));
+
result_dtw result;
if (params.drawOut.size() > 0) {
- result.matrix_acc = draw::matrix(m, warping.path, params);
- result.matrix_noacc = draw::matrix(dtw::matrix_noaccumulation(input, distance, params), warping.path, params);
+ result.matrix_acc = draw::matrix(m, warping, ranges, params);
+ result.matrix_noacc = draw::matrix(dtw::matrix_noaccumulation(input, distance, params), warping, ranges, params);
//draw::visualisation<T>(m, dtw::matrix_noaccumulation<T>(input, distance, params), input, warping.path, params.drawOut);
//m, m2, s1, s2, wp, filep
}
if (params.isDebugInfo())
{
- cout << endl << print::distanceMatrix(m);
+ //cout << endl << print::distanceMatrix(m);
+ cout << endl << warping[0].path;
//cout << endl << print::printPathShape(back.path, end, (int)A.size() + 1, (int)B.size() + 1);
//print::write(print::printHtmlDistanceMatrix<T>(m), "c:\\code\\data\\sc\\dm.html", false);
}
vtr<double> resultScore;
- resultScore.push_back(warping.scoreRaw);
- resultScore.push_back(calcul::score_dtw_s2(warping.scoreRaw, warping.pathSize)); // back.path.size());
- resultScore.push_back(calcul::score_dtw_s3(warping.wpEnd.row - warping.wpStart.row, warping.wpEnd.col - warping.wpStart.col, warping.pathSize));
- resultScore.push_back(calcul::score_dtw_s4(warping.scoreRaw, calcul::score_dtw_max(input.A, input.B, warping.wpStart, warping.wpEnd)));
- resultScore.push_back(calcul::score_dtw_s5(warping.scoreRaw,
- calcul::score_dtw_max(input.A, input.B, warping.wpStart, warping.wpEnd),
- calcul::lenRatio(warping.wpEnd.row - warping.wpStart.row, warping.wpEnd.col - warping.wpStart.row)));
+ resultScore.push_back(warping[0].scoreRaw);
+ resultScore.push_back(calcul::score_dtw_s2(warping[0].scoreRaw, warping[0].path.size())); // back.path.size());
+ resultScore.push_back(calcul::score_dtw_s3(warping[0].end.row - warping[0].start.row, warping[0].end.col - warping[0].start.col, warping[0].path.size()));
+ resultScore.push_back(calcul::score_dtw_s4(warping[0].scoreRaw, calcul::score_dtw_max(input.A, input.B, warping[0].start, warping[0].end)));
+ resultScore.push_back(calcul::score_dtw_s5(warping[0].scoreRaw,
+ calcul::score_dtw_max(input.A, input.B, warping[0].start, warping[0].end),
+ calcul::lenRatio(warping[0].end.row - warping[0].start.row, warping[0].end.col - warping[0].start.row)));
result.score = resultScore;
- result.path = warping.path;
+ result.path = warping[0].path;
+
+ return result;
+}
+
+result_dtw dtw::alignment_local(input_method const &input, input_info const &info, DISTANCE distance, parameter const ¶ms)
+{
+ auto m = dtw::matrix_noaccumulation(input, distance, params);
+ auto minims = dtw::get_minimums(m, params);
+
+ for (auto &i : minims)
+ m[i.row][i.col] = 0;
+
+ dtw::accumulate_mod(m, minims, params);
+
+ auto warpings = get_warpings(m, minims, params);
+ auto ranges = filterPaths(m, warpings, params);
+
+ result_dtw result;
+
+ if (params.drawOut.size() > 0) {
+ result.matrix_acc = draw::matrix(m, warpings, ranges, params);
+ result.matrix_noacc = draw::matrix(dtw::matrix_noaccumulation(input, distance, params), warpings, ranges, params);
+ //draw::visualisation<T>(m, dtw::matrix_noaccumulation<T>(input, distance, params), input, warping.path, params.drawOut);
+ }
+
+ if (params.isDebugInfo()) {
+ cout << endl << print::distanceMatrix(m);
+ //cout << endl << warpings[0].path;
+ //cout << endl << print::printPathShape(back.path, end, (int)A.size() + 1, (int)B.size() + 1);
+ //print::write(print::printHtmlDistanceMatrix<T>(m), "c:\\code\\data\\sc\\dm.html", false);
+ }
+
+ vtr<double> resultScore(5);
+
+ for (auto &i : warpings) {
+ resultScore[0] += i.scoreRaw;
+ resultScore[1] += calcul::score_dtw_s2(i.scoreRaw, i.path.size()); // back.path.size());
+ resultScore[2] += calcul::score_dtw_s3(i.end.row - i.start.row, i.end.col - i.start.col, i.path.size());
+ resultScore[3] += calcul::score_dtw_s4(i.scoreRaw, calcul::score_dtw_max(input.A, input.B, i.start, i.end));
+ resultScore[4] += calcul::score_dtw_s5(i.scoreRaw, calcul::score_dtw_max(input.A, input.B, i.start, i.end),
+ calcul::lenRatio(i.end.row - i.start.row, i.end.col - i.start.row));
+ }
+
+ for (auto &i : resultScore)
+ i /= warpings.size();
+ result.score = resultScore;
+ //result.path = warping.path;
+
return result;
}
@@ -255,19 +275,19 @@ input_method - input for the dtw method
DISTANCE - pointer to function used for distance calculations
parameter - parameter for dtw method
*/
-vtr2<node<double>> dtw::matrix(input_method const &input, DISTANCE distance, parameter const ¶ms)
+vtr2<node> dtw::matrix(input_method const &input, DISTANCE distance, parameter const ¶ms)
{
int lenA = (int)input.A.size();
int lenB = (int)input.B.size();
- vtr2<node<double>> m(lenA + 1);
+ vtr2<node> m(lenA + 1);
for (int i = 0; i < lenA + 1; i++)
- m[i] = vtr<node<double>>(lenB + 1);
+ m[i] = vtr<node>(lenB + 1);
- for (int i = 0; i < min(lenA, params.relax.start + 1); i++) //include 0,0 = 0 !!
+ for (int i = 0; i < min(lenA, params.relax + 1); i++) //include 0,0 = 0 !!
m[i][0].value = 0;
- for (int i = 0; i < min(lenB, params.relax.end + 1); i++)
+ for (int i = 0; i < min(lenB, params.relax + 1); i++)
m[0][i].value = 0;
if (params.isSubsequence() && calcul::lenRatio(lenA, lenB) < params.subsequence)
@@ -311,19 +331,19 @@ vtr2<node<double>> dtw::matrix(input_method const &input, DISTANCE distance, par
sumary:
parameters:
*/
-vtr2<node<double>> dtw::matrix_noaccumulation(input_method const &input, DISTANCE distance, parameter const ¶ms)
+vtr2<node> dtw::matrix_noaccumulation(input_method const &input, DISTANCE distance, parameter const ¶ms)
{
int lenA = (int)input.A.size();
int lenB = (int)input.B.size();
- vtr2<node<double>> m(lenA + 1);
+ vtr2<node> m(lenA + 1);
for (int i = 0; i < lenA + 1; i++)
- m[i] = vtr<node<double>>(lenB + 1);
+ m[i] = vtr<node>(lenB + 1);
- for (int i = 0; i < min(lenA, params.relax.start + 1); i++)
+ for (int i = 0; i < min(lenA, params.relax + 1); i++)
m[i][0].value = 0;
- for (int i = 0; i < min(lenB, params.relax.end + 1); i++)
+ for (int i = 0; i < min(lenB, params.relax + 1); i++)
m[0][i].value = 0;
if (params.isSubsequence() && calcul::lenRatio(lenA, lenB) < params.subsequence)
@@ -356,7 +376,7 @@ vtr2<node<double>> dtw::matrix_noaccumulation(input_method const &input, DISTANC
return m;
}
-void dtw::accumulate(vtr2<node<double>> &m, parameter const ¶ms)
+void dtw::accumulate(vtr2<node> &m, parameter const ¶ms)
{
int lenA = (int)m.size();
int lenB = (int)m[0].size();
@@ -373,7 +393,7 @@ void dtw::accumulate(vtr2<node<double>> &m, parameter const ¶ms)
}
}
-void dtw::accumulate_mod(vtr2<node<double>> &m, vtr<coords> const &minims, parameter const ¶ms)
+void dtw::accumulate_mod(vtr2<node> &m, vtr<coords> const &minims, parameter const ¶ms)
{
int lenA = (int)m.size();
int lenB = (int)m[0].size();
@@ -394,7 +414,7 @@ void dtw::accumulate_mod(vtr2<node<double>> &m, vtr<coords> const &minims, param
}
}
-vtr<coords> dtw::get_minimums(vtr2<node<double>> const &m, parameter const ¶ms)
+vtr<coords> dtw::get_minimums(vtr2<node> const &m, parameter const ¶ms)
{
vtr<coords> minims;
@@ -410,16 +430,35 @@ vtr<coords> dtw::get_minimums(vtr2<node<double>> const &m, parameter const ¶
{
double current = m[i][j].value;
- if (i + 1 < m.size() && j + 1 < m[i].size() &&
+ if (i + 1 < static_cast<int>(m.size()) && j + 1 < static_cast<int>(m[i].size()) &&
m[i - 1][j].value > current && m[i - 1][j + 1].value > current && m[i][j - 1].value > current &&
m[i][j + 1].value > current && m[i + 1][j - 1].value > current && m[i + 1][j].value > current)
{
minims.push_back(coords(i, j));
+ j++;
}
}
}
- return minims;
+ vtr<coords> filtered;
+ for (size_t i = 0; i < minims.size(); i++)
+ {
+ for (size_t j = i + 1; j < minims.size(); j++)
+ {
+ if (minims[j].row - minims[i].row < 2) // if dist in rows is larger than 1 ...cant find neigh
+ {
+ if (minims[j].col - minims[i].col == 1)
+ break;
+ else
+ continue;
+ }
+
+ filtered.push_back(minims[i]);
+ break;
+ }
+ }
+
+ return filtered;
}
/*
@@ -430,12 +469,14 @@ i
j
params
*/
-result_path dtw::get_warping(vtr2<node<double>> const &m, coords coord, parameter const ¶ms)
+result_path dtw::get_warping(vtr2<node> const &m, coords coord, parameter const ¶ms)
{
result_path wp;
double sizeA = coord.row;
double sizeB = coord.col;
+ wp.pathCoords.push_back(coords(coord.row, coord.col));
+
while (coord.row > 0 && coord.col > 0)
{
double u = m[coord.row - 1][coord.col].value;
@@ -447,6 +488,7 @@ result_path dtw::get_warping(vtr2<node<double>> const &m, coords coord, paramete
wp.path = "M" + wp.path;
coord.row--;
coord.col--;
+ wp.pathCoords.push_back(coords(coord.row, coord.col));
}
else
{
@@ -454,12 +496,15 @@ result_path dtw::get_warping(vtr2<node<double>> const &m, coords coord, paramete
{
wp.path = "L" + wp.path;
coord.col--;
-
+ wp.pathCoords.push_back(coords(coord.row, coord.col));
}
else if (u < l)
{
wp.path = "U" + wp.path;
coord.row--;
+
+
+
}
else
{
@@ -478,64 +523,110 @@ result_path dtw::get_warping(vtr2<node<double>> const &m, coords coord, paramete
}
if (!params.isSubsequence() || (params.isSubsequence() && m.size() < m[0].size()))
- while (coord.row > params.relax.start)
+ while (coord.row > params.relax)
{
wp.path = "U" + wp.path;
coord.row--;
-
}
if (!params.isSubsequence() || (params.isSubsequence() && m[0].size() < m.size()))
- while (coord.col > params.relax.end)
+ while (coord.col > params.relax)
{
wp.path = "L" + wp.path;
coord.col--;
}
- wp.wpStart.row = coord.row;
- wp.wpStart.col = coord.col;
- wp.pathSize = (int)wp.path.size();
+ wp.start.row = coord.row;
+ wp.start.col = coord.col;
return wp;
}
-vtr<result_path> dtw::get_warpings(vtr2<node<double>> const &m, vtr<coords> const &minims, parameter const ¶ms)
+vtr<result_path> dtw::get_warpings(vtr2<node> const &m, vtr<coords> const &minims, parameter const ¶ms)
{
vtr<result_path> outPaths;
- for (auto &i : minims)
+ for (auto i : minims) {//no ref!
outPaths.push_back(get_warping(m, i, params));
-
+ outPaths.back().end = i;
+ outPaths.back().scoreRaw = m[i.row][i.col].value;
+ }
+
return outPaths;
}
-vtr2<float> dtw::filterPaths(vtr2<node<double>> const &m, vtr<result_path> const &wpaths)
+vtr2<range> dtw::filterPaths(vtr2<node> const &m, vtr<result_path> const &wpaths, parameter const ¶ms)
{
- vtr2<float> Bt;
- vtr2<float> Ba;
- help::vtr_init(Bt, wpaths.size() - 1, wpaths.size() - 1, (float)0);
- help::vtr_init(Ba, wpaths.size() - 1, wpaths.size() - 1, (float)0);
-
+ vtr2<range> ranges(wpaths.size());
+ map<coords, bool> within2;
+
vtr2<coords> wCoord(wpaths.size());
-
for (size_t i = 0; i < wpaths.size(); i++)
- wCoord[i] = help::convert_coords(wpaths[i]);
+ wCoord[i] = wpaths[i].convert_toCoords();
- for (size_t i = 0; i < wpaths.size(); i++)
+ for (int k = 0; k < (int)wpaths.size(); k++)
+ for (int i = 0; i < (int)wpaths[k].path.size(); i++)
+ {
+ double cTotal = 0;
+ double max = constant::MIN_double;
+ range rangeTmp = range(-1, 0);
+ bool insert = true;
+ bool accept = false;
+ for (int j = i; j < (int)wpaths[k].path.size(); j++)
+ {
+ double current = m[wCoord[k][j].row][wCoord[k][j].col].value - cTotal;
+ cTotal += current;
+
+ if (max < current)
+ max = current;
+
+ if (max <= params.treshold_e /*&& cTotal <= params.treshold_t*/ && cTotal / (j - i + 1) <= params.treshold_a && (j - i + 1) >= params.treshold_l)
+ {
+ accept = true;
+
+ if (!insert)
+ if (i - rangeTmp.end < 2)
+ rangeTmp.end = j;
+
+ if (insert) {
+ rangeTmp = range(i, j);
+ insert = false;
+ }
+ }
+ }
+
+ if (accept) //filtr for excluding subsequences // true subsequences
+ {
+ for (auto &i : ranges[k])
+ if (i.start <= rangeTmp.start && rangeTmp.end <= i.end)
+ accept = false;
+ else if (rangeTmp.start - i.end < 2) {
+ i.end = rangeTmp.end;
+ accept = false;
+ break;
+ }
+ }
+
+ if (accept)
+ ranges[k].push_back(rangeTmp);
+ }
+
+ /*for (int i = 0; i < (int)ranges.size(); i++)
{
- double cTotal = 0;
- for (size_t j = i; j < wpaths[i].path.size(); j++)
+ for (int j = 0; j < (int)ranges[i].size(); j++)
{
- cTotal += m[i][j].value;
+ if()
}
- }
+ }*/
+
+ return ranges;
}
/*
sumary:
parameters:
*/
-coords dtw::get_relaxedEnds(vtr2<node<double>> const &m, parameter const ¶ms)
+coords dtw::get_relaxedEnds(vtr2<node> const &m, parameter const ¶ms)
{
double min = constant::MAX_double;
coords coordMin;
@@ -543,8 +634,8 @@ coords dtw::get_relaxedEnds(vtr2<node<double>> const &m, parameter const ¶ms
int lenA = (int)m.size() - 1;
int lenB = (int)m[0].size() - 1;
- int startA = (lenA - params.relax.start) < 0 ? 0 : lenA - params.relax.start;
- int startB = (lenB - params.relax.end) < 0 ? 0 : lenB - params.relax.end;
+ int startA = (lenA - params.relax) < 0 ? 0 : lenA - params.relax;
+ int startB = (lenB - params.relax) < 0 ? 0 : lenB - params.relax;
if (params.isSubsequence())
{
@@ -583,14 +674,14 @@ parameters:
*/
result_path dtw::matrix_tiled(vtr2<double> const &A, vtr2<double> const &B, parameter const ¶ms)
{
- vtr2<node<double>> m(A.size() + 1);
+ vtr2<node> m(A.size() + 1);
for (size_t i = 0; i < A.size() + 1; i++)
- m[i] = vtr<node<double>>(B.size() + 1);
+ m[i] = vtr<node>(B.size() + 1);
- for (int i = 0; i < min((int)A.size(), params.relax.start + 1); i++) //include 0,0 = 0 !!
+ for (int i = 0; i < min((int)A.size(), params.relax + 1); i++) //include 0,0 = 0 !!
m[i][0].value = 0;
- for (int i = 0; i < min((int)B.size(), params.relax.end + 1); i++)
+ for (int i = 0; i < min((int)B.size(), params.relax + 1); i++)
m[0][i].value = 0;
if (params.isSubsequence() && calcul::lenRatio(A.size(), B.size()) < params.subsequence) {
@@ -639,11 +730,11 @@ result_path dtw::matrix_tiled(vtr2<double> const &A, vtr2<double> const &B, para
auto end = get_relaxedEnds(m, params);
auto back = get_warping(m, end, params);
back.scoreRaw = m[end.row][end.col].value;
- back.wpEnd = end;
+ back.end = end;
if (params.isDebugInfo())
{
- cout << endl << print::distanceMatrix<double>(m);
+ cout << endl << print::distanceMatrix(m);
//cout << endl << print::printPathShape(back.path, end, (int)A.size() + 1, (int)B.size() + 1);
//print::write(print::printHtmlDistanceMatrix<T>(m), "c:\\code\\data\\sc\\dm.html", false);
}
@@ -732,12 +823,11 @@ result_path dtw::matrix_memoized(vtr2<double> const &A, vtr2<double> const &B, p
result_path back;
//back.path = m1[m2.size() - 1].path;
- back.pathSize = m1[m2.size() - 1].pathSize;
back.scoreRaw = m1[m2.size() - 1].value;
- back.wpStart.col = 0;
- back.wpStart.row = 0;
- back.wpEnd.col = (int)B.size();
- back.wpEnd.row = (int)A.size();
+ back.start.col = 0;
+ back.start.row = 0;
+ back.end.col = (int)B.size();
+ back.end.row = (int)A.size();
return back;
}
@@ -767,7 +857,7 @@ result_path dtw::matrix_diagonal(vtr2<double> const &A, vtr2<double> const &B, p
//__asm__(
//
//)
- size_t iEnd = shorter;
+ //size_t iEnd = shorter;
for (size_t i = 0; i < A.size(); i++)
{
size_t a = i;
@@ -884,10 +974,9 @@ result_path dtw::matrix_diagonal(vtr2<double> const &A, vtr2<double> const &B, p
result_path back;
//back.path = m2[0].path;
- back.pathSize = m2[0].pathSize;
back.scoreRaw = m2[0].value;
- back.wpStart = { 0, 0 };
- back.wpEnd = { (int)A.size(), (int)B.size() };
+ back.start = { 0, 0 };
+ back.end = { (int)A.size(), (int)B.size() };
return back;
}
@@ -1034,12 +1123,11 @@ result_path dtw::matrix_simd(vtr2<double> const &A, vtr2<double> const &B, param
result_path back;
//back.path = m2[0].path;
- back.pathSize = m2[0].pathSize;
back.scoreRaw = m2[0].value;
- back.wpStart.col = 0;
- back.wpStart.row = 0;
- back.wpEnd.col = (int)B.size();
- back.wpEnd.row = (int)A.size();
+ back.start.col = 0;
+ back.start.row = 0;
+ back.end.col = (int)B.size();
+ back.end.row = (int)A.size();
return back;
}
\ No newline at end of file
diff --git a/SequenceComparison/dtw.h b/SequenceComparison/dtw.h
index 98031c819bff3e957a1651b30ea7006cb43adac7..7523c6ad7df43412a74d5061a1c4b91d0f40c109 100644
--- a/SequenceComparison/dtw.h
+++ b/SequenceComparison/dtw.h
@@ -16,24 +16,25 @@ public:
static result_dtw configure(input_method const &input, input_info const &info, parameter const ¶ms);
static result_dtw alignment(input_method const &input, input_info const &info, DISTANCE distance, parameter const ¶ms);
+ static result_dtw alignment_local(input_method const &input, input_info const &info, DISTANCE distance, parameter const ¶ms);
- static vtr2<node<double>> matrix(input_method const &input, DISTANCE d, parameter const ¶ms);
+ static vtr2<node> matrix(input_method const &input, DISTANCE d, parameter const ¶ms);
- static vtr2<node<double>> matrix_noaccumulation(input_method const &input, DISTANCE distance, parameter const ¶ms);
+ static vtr2<node> matrix_noaccumulation(input_method const &input, DISTANCE distance, parameter const ¶ms);
- static vtr<coords> get_minimums(vtr2<node<double>> const &m, parameter const ¶ms);
+ static vtr<coords> get_minimums(vtr2<node> const &m, parameter const ¶ms);
- static void accumulate(vtr2<node<double>> &m, parameter const ¶ms);
+ static void accumulate(vtr2<node> &m, parameter const ¶ms);
- static void accumulate_mod(vtr2<node<double>> &m, vtr<coords> const &minims, parameter const ¶ms);
+ static void accumulate_mod(vtr2<node> &m, vtr<coords> const &minims, parameter const ¶ms);
- static result_path get_warping(vtr2<node<double>> const &m, coords coord, parameter const ¶ms);
+ static result_path get_warping(vtr2<node> const &m, coords coord, parameter const ¶ms);
- static vtr<result_path> get_warpings(vtr2<node<double>> const &m, vtr<coords> const &minims, parameter const ¶ms);
+ static vtr<result_path> get_warpings(vtr2<node> const &m, vtr<coords> const &minims, parameter const ¶ms);
- static vtr2<float> filterPaths(vtr2<node<double>> const &m, vtr<result_path> const &wpaths);
+ static vtr2<range> filterPaths(vtr2<node> const &m, vtr<result_path> const &wpaths, parameter const ¶ms);
- static coords get_relaxedEnds(vtr2<node<double>> const &m, parameter const ¶ms);
+ static coords get_relaxedEnds(vtr2<node> const &m, parameter const ¶ms);
//experimental functions
static result_path matrix_tiled(vtr2<double> const &A, vtr2<double> const &B, parameter const ¶ms);
diff --git a/SequenceComparison/entrypoint.h b/SequenceComparison/entrypoint.h
index 8f2f252bcca514975bfc02c3084731a53650998b..6ef9ef8a8bb241ed00a7c2a158b590e01e99f036 100644
--- a/SequenceComparison/entrypoint.h
+++ b/SequenceComparison/entrypoint.h
@@ -3,8 +3,9 @@
#include "structs.h"
#include "mains.h"
-#include "operation.h"
+#include "operation.h"
#include "help.h"
+#include "parameter.h"
#if defined(_MSC_VER)
// Microsoft
@@ -48,8 +49,9 @@ EXPORT void lib_entrypoint_cmd(char* argv)
{
std::string strargv(argv);
vtr<std::string> args = help::split(strargv, " ");
-
- mains::mainLogic(args);
+ auto params = parameter::setParameters(args);
+
+ mains::main_logic(params);
}
EXPORT double lib_entrypoint_pair1d(double* ts1, double* ts2, int len1, int len2, char* argv)
@@ -62,7 +64,7 @@ EXPORT double lib_entrypoint_pair1d(double* ts1, double* ts2, int len1, int len2
input[0] = help::convert_arrd(ts1, len1);
input[1] = help::convert_arrd(ts2, len2);
- auto r = mains::mainLogic_extern(input, args);
+ auto r = mains::extern_logic(input, args);
return r.scoreMethod[0];
}
@@ -84,7 +86,7 @@ EXPORT double lib_entrypoint_pairmd(double* ts1, double* ts2, int len1, int len2
std::cout << std::endl;
}*/
- auto r = mains::mainLogic_extern(input, args);
+ auto r = mains::extern_logic(input, args);
//std::cout << r.scoreMethod << std::endl;
@@ -121,8 +123,7 @@ EXPORT void lib_entrypoint_setmd(double*** input, int len, int dims, char* argv)
//vtrInput[i] = help::convert_arr2d(input[i], size);
}
- mains::mainLogic_extern(vtrInput, args);
+ mains::extern_logic(vtrInput, args);
}
-
#endif //ENTRYPOINT_H
\ No newline at end of file
diff --git a/SequenceComparison/help.cpp b/SequenceComparison/help.cpp
index c2d9e097717fbe7c8e578ab8b25f743b7d3d2041..ccbf1e2ba8a8e671b57787f9a479b49af9ab361a 100644
--- a/SequenceComparison/help.cpp
+++ b/SequenceComparison/help.cpp
@@ -1,7 +1,6 @@
#include "stdafx.h"
#include "help.h"
-#include "dataParser.h"
#include <bitset>
#include <random>
#include <experimental/filesystem>
@@ -143,11 +142,11 @@ int help::random_int(int min, int max)
return dis(gen);
}
-vtr2<double> help::random_timeSeries(int size, int dims, int min, int max)
+vtr2<double> help::random_sequence(int len, int dims, int min, int max)
{
- vtr2<double> ts(size);
+ vtr2<double> ts(len);
- for (int i = 0; i < size; i++)
+ for (int i = 0; i < len; i++)
{
vtr<double> point(dims);
for (int j = 0; j < dims; j++)
@@ -228,7 +227,7 @@ template double help::vtr_findMax<double>(vtr2<double> const &input);
template <typename T>
T help::vtr_findMax(vtr3<T> const &input)
{
- double max = constant::min_double;
+ double max = constant::MIN_double;
for (auto &i : input) {
auto tmp = vtr_findMax(i);
@@ -254,9 +253,6 @@ T help::vtr_findMin(vtr2<T> const &input)
}
template double help::vtr_findMin<double>(vtr2<double> const &input);
-//void help::interpolate2(vtr3<double> &input)
-//void help::interpolate(vtr3<double> &input)
-
void help::normalizeMany(vtr3<double> &input)
{
for (size_t i = 0; i < input.size(); i++) //dims
@@ -395,29 +391,370 @@ vtr2<double> help::convert_arr3d(double* const &input, size_t len, size_t dims)
return out;
}
-vtr<coords> help::convert_coords(result_path const &warping)
+//vtr<coords> help::convert_toCoords(result_path const &warping)
+//{
+// vtr<coords> pathCoords(warping.path.size());
+//
+// int row = -1, col = -1;
+// for (size_t i = 0; i < warping.path.size(); i++)
+// {
+// if (warping.path[i] == 'M') {
+// row++;
+// col++;
+// }
+// else if (warping.path[i] == 'L')
+// col++;
+// else if (warping.path[i] == 'U')
+// row++;
+//
+// pathCoords[i] = coords(row + 1, col + 1); //x,y(i,j)
+// }
+//
+// return pathCoords;
+//}
+
+void help::sortFollow(vtr<double> &lead, vtr<int> &follow, bool reversed)
+{
+ for (size_t i = 0; i < lead.size() - 1; i++)
+ {
+ for (int j = 0; j < (int)follow.size() - 1; j++)
+ {
+
+ if (reversed ? lead[j + 1] > lead[j] : lead[j + 1] < lead[j])
+ {
+ double tmp = lead[j];
+ lead[j] = lead[j + 1];
+ lead[j + 1] = tmp;
+
+ int fTmp = follow[j];
+ follow[j] = follow[j + 1];
+ follow[j + 1] = fTmp;
+ }
+ }
+ }
+}
+
+template <typename T>
+vtr2<T> help::vtr_degrade(vtr3<T> const &input)
+{
+ size_t sum = 0;
+
+ for (auto &i : input)
+ sum += i.size();
+
+
+ vtr2<double> v;
+ v.reserve(sum);
+ for (auto &i : input)
+ v.insert(v.end(), i.begin(), i.end());
+
+ return v;
+}
+
+template <typename T>
+void help::interpolate(vtr3<T> &input)
+{
+ int maxLen = -1;
+
+ for (auto &&s : input)
+ {
+ if ((int)s.size() > maxLen)
+ maxLen = (int)s.size();
+ }
+
+ for (size_t i = 0; i < input.size(); i++)
+ {
+ if (input[i].size() == 1)
+ {
+ vtr2<T> row(maxLen);
+ fill(row.begin(), row.end(), input[i][0]);
+ input[i] = row;
+ }
+
+ int diff = maxLen - (int)input[i].size();
+ while (diff > 0)
+ {
+ vtr2<T> row;
+
+ int c = 0;
+ for (size_t j = 0; j < input[i].size() && diff > 0; j++)
+ {
+ vtr<T> point;
+
+ if (j % 2 == 1)
+ {
+ for (size_t k = 0; k < input[i][j].size(); k++)
+ {
+ double tmp = (input[i][c - 1][k] + input[i][c][k]) / 2.0;
+ point.push_back(tmp);
+ }
+
+ row.push_back(point);
+ diff--;
+ }
+ else
+ {
+ row.push_back(input[i][c]);
+ c++;
+ }
+
+ }
+ row.insert(row.end(), input[i].begin() + c, input[i].end());
+ input[i] = row;
+ }
+ }
+}
+template void help::interpolate<double>(vtr3<double> &input);
+
+template <typename T>
+void help::interpolate2(vtr3<double> &input)
+{
+ int maxLen = -1;
+
+ for (auto &&s : input)
+ {
+ if ((int)s.size() > maxLen)
+ maxLen = (int)s.size();
+ }
+
+ for (auto &&i : input)
+ {
+ int diff = maxLen - (int)i.size();
+
+ while (diff > 0)
+ {
+ int c = 0;
+ vtr2<T> row;
+ for (size_t k = 0; k < i.size() - 1 && diff > 0; k++)
+ {
+ vtr<T> el;
+
+ if (k % 2 == 1)
+ {
+ for (size_t j = 0; j <i[k].size(); j++)
+ {
+ T tmp = (i[c - 1][j] + i[c][j]) / 2.0;
+ el.push_back(tmp);
+ }
+
+ row.push_back(el);
+ diff--;
+ }
+ else
+ {
+ row.push_back(i[c]);
+ c++;
+ }
+
+ }
+ row.insert(row.end(), i.begin() + c, i.end());
+ i = row;
+ }
+ }
+}
+
+template <typename T>
+void help::paa(vtr3<T> &input, size_t ratio)
+{
+ vtr3<T> output(input.size());
+
+ for (size_t i = 0; i < input.size(); i++)
+ {
+ vtr2<T> s;
+ for (size_t j = 0; j < input[i].size(); j += ratio)// sequence
+ {
+ vtr<T> dim(input[i][j].size());
+
+ const size_t end = j + ratio >= input[i].size() ? input[i].size() : j + ratio;
+ for (size_t k = 0; k < input[i][j].size(); k++) //all dims
+ {
+ double sum = 0;
+ int merged = 0;
+ for (size_t l = j; l < end; l++) //sum individual groups of dims
+ {
+ sum += input[i][l][k];
+ merged++;
+ }
+ dim[k] = (T)(sum / merged);
+ }
+ s.push_back(dim);
+ }
+ output[i] = s;
+ }
+
+ input = output;
+}
+template void help::paa<double>(vtr3<double> &input, size_t ratio);
+template void help::paa<int>(vtr3<int> &input, size_t ratio);
+
+void help::sax(vtr3<double> &input, size_t numClasses)
{
- vtr<coords> pathCoords(warping.path.size());
- int row = -1, col = -1;
- for (size_t i = 0; i < warping.path.size(); i++)
+ double max = constant::MIN_double;
+ double min = constant::MAX_double;
+ for (auto &&i : input)
+ {
+ double tmpMax = help::vtr_findMax(i);
+ if (tmpMax > max)
+ max = tmpMax;
+
+ double tmpMin = help::vtr_findMin(i);
+ if (tmpMin < min)
+ min = tmpMin;
+ }
+
+ double step = (max - min) / static_cast<double>(numClasses);
+
+ for (auto &&i : input)
{
- float color[] = { 0, 255, 0 };
- if (i == 0) {
- color[0] = 255;
- color[1] = 0;
+ for (auto &&j : i)
+ {
+ for (auto &&k : j)
+ {
+ int c = 1;
+ double stepCount = min;
+ while (stepCount < max + step)
+ {
+ if (k <= min + c * step)
+ {
+ k = min + (c - 1) * step + step / 2;
+ break;
+ }
+ stepCount += step;
+ c++;
+ }
+ }
}
+ }
+}
- if (warping.path[i] == 'M') {
- row++;
- col++;
+//Returns shortened input sequence by skiping some of their elements.
+template <typename T>
+void help::reduce(vtr3<T> &input, size_t skip)
+{
+ for (auto &&i : input)
+ {
+ vtr2<T> row;
+ for (size_t j = skip - 1; j < i.size(); j += skip)
+ {
+ row.push_back(i[j]);
}
- else if (warping.path[i] == 'L')
- col++;
- else if (warping.path[i] == 'U')
- row++;
+ i = row;
+ }
+}
+template void help::reduce<double>(vtr3<double> &input, size_t skip);
+template void help::reduce<int>(vtr3<int> &input, size_t skip);
- pathCoords[i] = coords(row + 1, col + 1); //x,y(i,j)
+template <typename T>
+void help::prolong(vtr3<T> &input, size_t times)
+{
+ for (size_t i = 0; i < input.size(); i++) //every sequence
+ {
+ size_t dims = (int)input[0][0].size();
+
+ for (size_t j = 0; j < times; j++) //times to prolong
+ {
+ size_t alloc = 2 * input[i].size() - 1;
+
+ int counter = 0;
+ vtr2<T> row(alloc);
+ for (size_t k = 0; k < 2 * input[i].size() - 1; k++)
+ {
+ vtr<T> point(dims);
+ for (size_t l = 0; l < dims; l++)
+ {
+ if (k % 2 == 1)
+ point[l] = (input[i][counter - 1][l] + input[i][counter][l]) / 2;
+ else
+ {
+ point[l] = input[i][counter][l];
+ }
+ }
+ if (k % 2 != 1)
+ counter++;
+
+ row[k] = point;
+ }
+ input[i] = row;
+ }
+ }
+}
+template void help::prolong<double>(vtr3<double> &input, size_t times);
+template void help::prolong<int>(vtr3<int> &input, size_t times);
+
+//Returns smoothed sekvence by moving window average.
+void help::smooth(vtr3<double> &input, size_t width)
+{
+ vtr3<double> output(input.size());
+
+ for (size_t i = 0; i < input.size(); i++)
+ {
+ const int dims = (int)input[0][0].size();
+
+ vtr2<double> s;
+ for (size_t j = 0; j < width - 1; j++)
+ {
+ s.push_back(input[i][j]);
+ }
+
+ for (size_t j = 0; j < input[i].size() - width + 1; j++)// sequence
+ {
+ vtr<double> sums(dims);
+ for (size_t k = 0; k < width; k++) //all dims
+ {
+ for (int l = 0; l < dims; l++)
+ {
+ sums[l] += static_cast<double>(input[i][j + k][l] / width);
+ }
+ }
+ s.push_back(sums);
+ }
+ output[i] = s;
+ }
+
+ input = output;
+}
+
+template<typename T>
+vtr3<T> help::alterStructure(vtr3<T> const &matrix)
+{
+ vtr3<T> m = help::vtr_init<T>(matrix[0][0].size(), matrix.size(), matrix[0].size());
+ for (size_t i = 0; i < matrix.size(); i++)
+ {
+ for (size_t j = 0; j < matrix[0].size(); j++)
+ {
+ for (size_t k = 0; k < matrix[0][0].size(); k++)
+ {
+ m[k][i][j] = matrix[i][j][k];
+ }
+ }
}
- return pathCoords;
-}
\ No newline at end of file
+ return m;
+}
+template vtr3<double> help::alterStructure(vtr3<double> const &matrix);
+template vtr3<int> help::alterStructure(vtr3<int> const &matrix);
+
+//Returns sorted 2D vector by columns.
+//template<class T, class T2>
+//static void Sort2dVectorByColumns(vtr2<T> &matrix, vtr2<T2> &order, bool reversed)
+//{
+// for (size_t i = 0; i < matrix.size(); i++) //col //sorting for every column
+// {
+// for (size_t k = 0; k < matrix.size(); k++)
+// {
+// for (size_t j = 1; j < matrix.size() - 1; j++) //row
+// {
+// if(reversed ? matrix[j][i] < matrix[j + 1][i] : matrix[j][i] > matrix[j + 1][i])
+// {
+// T tmp = matrix[j][i];
+// matrix[j][i] = matrix[j + 1][i];
+// matrix[j + 1][i] = tmp;
+
+// T2 tmpI = order[j][i];
+// order[j][i] = order[j + 1][i];
+// order[j + 1][i] = tmpI;
+// }
+// }
+// }
+// }
+//}
\ No newline at end of file
diff --git a/SequenceComparison/help.h b/SequenceComparison/help.h
index e7aa6c683c1836af8b78e934ad7495670a27099a..46449288d5e9098169d2b24a4259fca08d15c7af 100644
--- a/SequenceComparison/help.h
+++ b/SequenceComparison/help.h
@@ -1,14 +1,11 @@
#ifndef HELP_H
#define HELP_H
-#include "structs.h"
+#include "templates.h"
class help
{
public:
-
- static vtr<coords> convert_coords(result_path const &warping);
-
static bool isFolder(std::string path);
static bool isFile(std::string path);
static bool pathExists(std::string path);
@@ -22,10 +19,7 @@ public:
static void trimRight(std::string &s, std::string const &delimiters);
static void trim(std::string &s, std::string const &delimiters);
- //split functions
static vtr<std::string> split(std::string const &s, char const *delimiters);
- //static vtr<std::string> split1(std::string const &s, std::string const &delimiters);
- //static vtr<std::string> split2(std::string const &s, std::string const &delimiters);
//Returns sequence separated in theirs dimensions.
static vtr3<double> separateSequence(vtr3<double> const &input, int size);
@@ -33,9 +27,10 @@ public:
//Returns sequence one sequence with 1 dimension.
static vtr3<double> separateSequenceOne(vtr2<double> const &input);
- static double random_real(int min, int max);
static int random_int(int min, int max);
- static vtr2<double> random_timeSeries(int size, int dims, int min, int max);
+ static double random_real(int min, int max);
+
+ static vtr2<double> random_sequence(int len, int dims, int min, int max);
/*NOT USED
static vtr2<double> convertToDouble(vtr2<std::string> const &strInput);
@@ -73,334 +68,42 @@ public:
template <typename T>
static T vtr_findMax(vtr2<T> const &input);
- template <typename T>
- static T vtr_findMax(vtr3<T> const &input);
+ template <typename T> static T vtr_findMax(vtr3<T> const &input);
template <typename T>
static T vtr_findMin(vtr2<T> const &input);
template <typename T>
- static vtr2<T> vtr_degrade(vtr3<T> const &input)
- {
- size_t sum = 0;
-
- for (auto &i : input)
- sum += i.size();
-
-
- vtr2<double> v;
- v.reserve(sum);
- for (auto &i : input)
- v.insert(v.end(), i.begin(), i.end());
+ static vtr2<T> vtr_degrade(vtr3<T> const &input);
- return v;
- }
-
- //Returns sorted 2D vector by columns.
- template<class T, class T2>
- static void Sort2dVectorByColumns(vtr2<T> &matrix, vtr2<T2> &order, bool reversed)
- {
- for (size_t i = 0; i < matrix.size(); i++) //col //sorting for every column
- {
- for (size_t k = 0; k < matrix.size(); k++)
- {
- for (size_t j = 1; j < matrix.size() - 1; j++) //row
- {
- if(reversed ? matrix[j][i] < matrix[j + 1][i] : matrix[j][i] > matrix[j + 1][i])
- {
- T tmp = matrix[j][i];
- matrix[j][i] = matrix[j + 1][i];
- matrix[j + 1][i] = tmp;
-
- T2 tmpI = order[j][i];
- order[j][i] = order[j + 1][i];
- order[j + 1][i] = tmpI;
- }
- }
- }
- }
- }
-
- static void sortFollow(vtr<double> &lead, vtr<int> &follow, bool reversed)
- {
- for (size_t i = 0; i < lead.size() - 1; i++)
- {
- for (int j = 0; j < (int)follow.size() - 1; j++)
- {
+ static void sortFollow(vtr<double> &lead, vtr<int> &follow, bool reversed);
- if ( reversed ? lead[j + 1] > lead[j] : lead[j + 1] < lead[j])
- {
- double tmp = lead[j];
- lead[j] = lead[j + 1];
- lead[j + 1] = tmp;
+ template <typename T>
+ static vtr3<T> alterStructure(vtr3<T> const &matrix);
- int fTmp = follow[j];
- follow[j] = follow[j + 1];
- follow[j + 1] = fTmp;
- }
- }
- }
- }
+ //static vtr<coords> convert_toCoords(result_path const &warping);
//Returns input sequence interpolated to same length.
template <typename T>
- static void interpolate(vtr3<T> &input)
- {
- int maxLen = -1;
-
- for (auto &&s : input)
- {
- if ((int)s.size() > maxLen)
- maxLen = (int)s.size();
- }
-
- for (size_t i = 0; i < input.size(); i++)
- {
- if (input[i].size() == 1)
- {
- vtr2<T> row(maxLen);
- fill(row.begin(), row.end(), input[i][0]);
- input[i] = row;
- }
-
- int diff = maxLen - (int)input[i].size();
- while (diff > 0)
- {
- vtr2<T> row;
-
- int c = 0;
- for (size_t j = 0; j < input[i].size() && diff > 0; j++)
- {
- vtr<T> point;
-
- if (j % 2 == 1)
- {
- for (size_t k = 0; k < input[i][j].size(); k++)
- {
- double tmp = (input[i][c - 1][k] + input[i][c][k]) / 2.0;
- point.push_back(tmp);
- }
-
- row.push_back(point);
- diff--;
- }
- else
- {
- row.push_back(input[i][c]);
- c++;
- }
-
- }
- row.insert(row.end(), input[i].begin() + c, input[i].end());
- input[i] = row;
- }
- }
- }
+ static void interpolate(vtr3<T> &input);
template <typename T>
- static void interpolate2(vtr3<double> &input)
- {
- int maxLen = -1;
-
- for (auto &&s : input)
- {
- if ((int)s.size() > maxLen)
- maxLen = (int)s.size();
- }
-
- for (auto &&i : input)
- {
- int diff = maxLen - (int)i.size();
-
- while (diff > 0)
- {
- int c = 0;
- vtr2<T> row;
- for (size_t k = 0; k < i.size() - 1 && diff > 0; k++)
- {
- vtr<T> el;
-
- if (k % 2 == 1)
- {
- for (size_t j = 0; j <i[k].size(); j++)
- {
- T tmp = (i[c - 1][j] + i[c][j]) / 2.0;
- el.push_back(tmp);
- }
-
- row.push_back(el);
- diff--;
- }
- else
- {
- row.push_back(i[c]);
- c++;
- }
-
- }
- row.insert(row.end(), i.begin() + c, i.end());
- i = row;
- }
- }
- }
+ static void interpolate2(vtr3<double> &input);
template <typename T>
- static void paa(vtr3<T> &input, size_t ratio)
- {
- vtr3<T> output(input.size());
-
- for (size_t i = 0; i < input.size(); i++)
- {
- vtr2<T> s;
- for (size_t j = 0; j < input[i].size(); j += ratio)// sequence
- {
- vtr<T> dim(input[i][j].size());
-
- const size_t end = j + ratio >= input[i].size() ? input[i].size() : j + ratio;
- for (size_t k = 0; k < input[i][j].size(); k++) //all dims
- {
- double sum = 0;
- int merged = 0;
- for (size_t l = j; l < end; l++) //sum individual groups of dims
- {
- sum += input[i][l][k];
- merged++;
- }
- dim[k] = (T)(sum / merged);
- }
- s.push_back(dim);
- }
- output[i] = s;
- }
-
- input = output;
- }
+ static void paa(vtr3<T> &input, size_t ratio);
- static void sax(vtr3<double> &input, size_t numClasses)
- {
- double max = constant::MIN_double;
- double min = constant::MAX_double;
- for (auto &&i : input)
- {
- double tmpMax = vtr_findMax(i);
- if (tmpMax > max)
- max = tmpMax;
-
- double tmpMin = vtr_findMin(i);
- if (tmpMin < min)
- min = tmpMin;
- }
-
- double step = (max - min) / numClasses;
-
- for (auto &&i : input)
- {
- for (auto &&j : i)
- {
- for (auto &&k : j)
- {
- int c = 1;
- double stepCount = min;
- while (stepCount < max + step)
- {
- if (k <= min + c * step)
- {
- k = min + (c - 1) * step + step / 2;
- break;
- }
- stepCount += step;
- c++;
- }
- }
- }
- }
- }
+ static void sax(vtr3<double> &input, size_t numClasses);
//Returns shortened input sequence by skiping some of their elements.
template <typename T>
- static void reduce(vtr3<T> &input, size_t skip)
- {
- for (auto &&i : input)
- {
- vtr2<T> row;
- for (size_t j = skip - 1; j < i.size(); j += skip)
- {
- row.push_back(i[j]);
- }
- i = row;
- }
- }
-
+ static void reduce(vtr3<T> &input, size_t skip);
+
template <typename T>
- static void prolong(vtr3<T> &input, size_t times)
- {
- for (size_t i = 0; i < input.size(); i++) //every sequence
- {
- size_t dims = (int)input[0][0].size();
-
- for (size_t j = 0; j < times; j++) //times to prolong
- {
- size_t alloc = 2 * input[i].size() - 1;
-
- int counter = 0;
- vtr2<T> row(alloc);
- for (size_t k = 0; k < 2 * input[i].size() - 1; k++)
- {
- vtr<T> point(dims);
- for (size_t l = 0; l < dims; l++)
- {
- if (k % 2 == 1)
- point[l] = (input[i][counter - 1][l] + input[i][counter][l]) / 2;
- else
- {
- point[l] = input[i][counter][l];
- }
- }
- if (k % 2 != 1)
- counter++;
-
- row[k] = point;
- }
- input[i] = row;
- }
- }
- }
-
- //Returns smoothed sekvence by moving window average.
- static void smooth(vtr3<double> &input, size_t width)
- {
- vtr3<double> output(input.size());
-
- for (size_t i = 0; i < input.size(); i++)
- {
- const int dims = (int)input[0][0].size();
-
- vtr2<double> s;
- for (size_t j = 0; j < width - 1; j++)
- {
- s.push_back(input[i][j]);
- }
-
- for (size_t j = 0; j < input[i].size() - width + 1; j++)// sequence
- {
- vtr<double> sums(dims);
- for (size_t k = 0; k < width; k++) //all dims
- {
- for (int l = 0; l < dims; l++)
- {
- sums[l] += input[i][j + k][l] / width;
- }
- }
- s.push_back(sums);
- }
- output[i] = s;
- }
-
- input = output;
- }
-
+ static void prolong(vtr3<T> &input, size_t times);
-
+ //Returns smoothed sekvence by moving window average.
+ static void smooth(vtr3<double> &input, size_t width);
};
#endif //HELP_H
\ No newline at end of file
diff --git a/SequenceComparison/lcss.cpp b/SequenceComparison/lcss.cpp
index 8124b95f52167290e54582cbbf934b0b7f7db7fe..7d08729d88a0890ac74505a35dd5c1dcefff720c 100644
--- a/SequenceComparison/lcss.cpp
+++ b/SequenceComparison/lcss.cpp
@@ -1,5 +1,6 @@
#include "stdafx.h"
+#include "draw.h"
#include "lcss.h"
#include "calcul.h"
#include "print.h"
@@ -10,100 +11,146 @@ using namespace std;
vtr<double> lcss::main(input_method const &input, input_info const &info, parameter const ¶ms)
{
- auto result = alignment(input.A, input.B, params);
+ if ((int)((input.A.size() * input.B.size()) / 131072) > params.ram) //131072 to convert bytes to MB
+ {
+ cout << "size A: " << input.A.size() << ", size B: " << input.B.size() << endl;
+ //throw runtime_error("DTW aborted. Input too large: " + to_string(input.A.size() * input.B.size()) + "B");
+ cout << "DTW aborted. Input too large: " << (input.A.size() * input.B.size() * 8) / 1024 / 1024 << "MB" << endl;
+ cout << "For overriding RAM limit use -ram [GBs] switch." << endl;
+ exit(0);
+ }
+
+ auto result = alignment(input, params);
+
+ if (params.drawOut.size() > 0)
+ draw::plot_pair(result, input, info, params);
if (params.isRatioReversed())
{
- for (size_t i = 0; i < result.size(); i++)
- result[params.scoreType - 1] = 1 - result[params.scoreType - 1];
-
- return result;
+ for (size_t i = 0; i < result.score.size(); i++)
+ result.score[params.scoreType - 1] = 1 - result.score[params.scoreType - 1];
}
- else
- return result;
+
+ return result.score;
}
-double lcss::main2(input_method const &input, parameter const ¶ms)
+//double lcss::main2(input_method const &input, parameter const ¶ms)
+//{
+// auto result = alignment(input, params);
+//
+// if (params.isRatioReversed()) // -reversed switch
+// return 1 - result[params.scoreType - 1];
+// else
+// return result[params.scoreType - 1];
+//}
+
+result_dtw lcss::alignment(input_method const &input, parameter const ¶ms)
{
- auto result = alignment(input.A, input.B, params);
+ DISTANCE_LCSS distance = calcul::distance_lcss;
- if (params.isRatioReversed()) // -reversed switch
- return 1 - result[params.scoreType - 1];
- else
- return result[params.scoreType - 1];
-}
+ auto m = lcss::matrix(input, distance, params);
+
+ if (params.isDebugInfo())
+ cout << endl << print::distanceMatrix(m);
-vtr<double> lcss::alignment(vtr2<double> const &A, vtr2<double> const &B, parameter const ¶ms)
-{
- DISTANCE_LCSS d = calcul::distance_lcss;
-
- result_path backtrack;
- if (params.matrixDataType == "double")
- backtrack = lcss::matrix<double> (A, B, d, params);
- else if (params.matrixDataType == "int")
- backtrack = lcss::matrix<int>(A, B, d, params);
- else if (params.matrixDataType == "float")
- backtrack = lcss::matrix<float>(A, B, d, params);
+ vtr<result_path> warping(1);
+ warping[0] = get_warping(m, input);
+ warping[0].scoreRaw = m[input.A.size()][input.B.size()].value;
+
+ vtr2<range> ranges(1);
+ ranges[0].push_back(range(0, (int)warping[0].path.size()));
- vtr<double> result;
- result.push_back(backtrack.scoreRaw);
- result.push_back(backtrack.scoreRaw / backtrack.path.size());
- result.push_back(calcul::score_lcss_s1(backtrack.scoreRaw, backtrack.path.size()));
- result.push_back(calcul::score_lcss_s1(backtrack.scoreRaw, min(A.size(), B.size())));
+ result_dtw result;
+
+ if (params.drawOut.size() > 0) {
+ result.matrix_acc = draw::matrix(m, warping, ranges, params);
+ result.matrix_noacc = draw::matrix(lcss::matrix_noaccumulation(input, distance, params), warping, ranges, params);
+ }
+
+ result.score.push_back(warping[0].scoreRaw);
+ result.score.push_back(warping[0].scoreRaw / warping[0].path.size());
+ result.score.push_back(calcul::score_lcss_s1(warping[0].scoreRaw, warping[0].path.size()));
+ result.score.push_back(calcul::score_lcss_s1(warping[0].scoreRaw, min(input.A.size(), input.B.size())));
return result;
}
-template<class T>
-result_path lcss::matrix(vtr2<double> const &A, vtr2<double> const &B, DISTANCE_LCSS distance, parameter const ¶ms)
+vtr2<node> lcss::matrix(input_method const &input, DISTANCE_LCSS distance, parameter const ¶ms)
{
- vtr2<node<T>> m(A.size() + 1);
- for (size_t i = 0; i < A.size() + 1; i++)
- m[i] = vector<node<T>>(B.size() + 1, node<T>(0));
+ vtr2<node> m(input.A.size() + 1);
+ for (size_t i = 0; i < input.A.size() + 1; i++)
+ m[i] = vector<node>(input.B.size() + 1, node(0));
double left = 0;
double up = 0;
- for (size_t i = 1; i < A.size() + 1; i++) //radky - y
+ for (size_t i = 1; i < input.A.size() + 1; i++) //radky - y
{
- for (size_t j = 1; j < B.size() + 1; j++) //sloupce - x
+ for (size_t j = 1; j < input.B.size() + 1; j++) //sloupce - x
{
left = m[i][j - 1].value;
up = m[i - 1][j].value;
bool epsed = true;
- int shorterDim = (int)min(A[i - 1].size(), B[j - 1].size());
+ int shorterDim = (int)min(input.A[i - 1].size(), input.B[j - 1].size());
for (int u = 0; u < shorterDim; u++)
{
- if (distance(A[i - 1], B[j - 1], u) > params.epsilon)
+ if (distance(input.A[i - 1], input.B[j - 1], u) > params.epsilon)
epsed = false;
}
if (epsed && std::abs((int)(i - j)) <= params.delta) //if i-1,j-1 <= l,u ... diag
m[i][j].value = m[i - 1][j - 1].value + 1;
else if (left >= up)
- m[i][j].value = static_cast<T>(left); //(UP) jedno kterej
+ m[i][j].value = left; //(UP) jedno kterej
else
- m[i][j].value = static_cast<T>(up); //(UP < LEFT)
+ m[i][j].value = up; //(UP < LEFT)
}
}
- return backtrack(m, A, B);
+ return m;
+}
+
+vtr2<node> lcss::matrix_noaccumulation(input_method const &input, DISTANCE_LCSS distance, parameter const ¶ms)
+{
+ vtr2<node> m(input.A.size() + 1);
+ for (size_t i = 0; i < input.A.size() + 1; i++)
+ m[i] = vector<node>(input.B.size() + 1, node(0));
+
+ for (size_t i = 1; i < input.A.size() + 1; i++) //radky - y
+ {
+ for (size_t j = 1; j < input.B.size() + 1; j++) //sloupce - x
+ {
+ bool epsed = true;
+ int shorterDim = (int)min(input.A[i - 1].size(), input.B[j - 1].size());
+ for (int u = 0; u < shorterDim; u++)
+ {
+ if (distance(input.A[i - 1], input.B[j - 1], u) > params.epsilon)
+ epsed = false;
+ }
+
+ if (epsed && std::abs((int)(i - j)) <= params.delta)
+ m[i][j].value = 0;
+ else
+ m[i][j].value = 1;
+ }
+ }
+
+ return m;
}
-template<class T>
-result_path lcss::backtrack(vector<vector<node<T>>> const &m, vtr2<double> const &A, vtr2<double> const &B)
+result_path lcss::get_warping(vtr2<node> const &m, input_method const &input)
{
- int i = (int)A.size();
- int j = (int)B.size();
+ int i = (int)input.A.size();
+ int j = (int)input.B.size();
string path = "";
while (i > 0 && j > 0)
{
if (m[i - 1][j - 1].value < m[i][j].value)
{
- if (to_string(A[i - 1][0]) == "-" || to_string(B[j - 1][0]) == "-")
+ if (to_string(input.A[i - 1][0]) == "-" || to_string(input.B[j - 1][0]) == "-")
path = "M" + path;
- else if (A[i - 1][0] == B[j - 1][0])
+ else if (input.A[i - 1][0] == input.B[j - 1][0])
path = "M" + path;
else
path = "S" + path;
@@ -140,8 +187,7 @@ result_path lcss::backtrack(vector<vector<node<T>>> const &m, vtr2<double> const
result_path wp;
wp.path = path;
- wp.scoreRaw = m[A.size()][B.size()].value;
- //wp.normScore = 1 - calcul::getPairRatio_lcss((int)(A.size() + B.size()), (int)wp.rawScore);
+ wp.scoreRaw = m[input.A.size()][input.B.size()].value;
return wp;
}
\ No newline at end of file
diff --git a/SequenceComparison/lcss.h b/SequenceComparison/lcss.h
index 281c95f285a730969584dd6f34db20967e3bfd34..6cdde4f9f57a543af0e047c7d3e76beca294a178 100644
--- a/SequenceComparison/lcss.h
+++ b/SequenceComparison/lcss.h
@@ -14,15 +14,14 @@ public:
//Returns result of lcss function.
//lcss function should always be called by this method.
static vtr<double> main(input_method const &input, input_info const &info, parameter const ¶ms);
- static double main2(input_method const &input, parameter const ¶ms);
//Returns alignment similarity.
- static vtr<double> alignment(vtr2<double> const &, vtr2<double> const &, parameter const ¶ms);
+ static result_dtw alignment(input_method const &input, parameter const ¶ms);
//Returns 'distance matrix' for 2 input sequence.
- template<class T>
- static result_path matrix(vtr2<double> const &A, vtr2<double> const &B, DISTANCE_LCSS d, parameter const ¶ms);
+ static vtr2<node> matrix(input_method const &input, DISTANCE_LCSS d, parameter const ¶ms);
+ static vtr2<node> matrix_noaccumulation(input_method const &input, DISTANCE_LCSS d, parameter const ¶ms);
+
//Returns 'warping path' generated form distance matrix.
- template<class T>
- static result_path backtrack(vtr2<node<T>> const &m, vtr2<double> const &A, vtr2<double> const &B);
+ static result_path get_warping(vtr2<node> const &m, input_method const &input);
//Log
//static std::string Log(result const &, parameter const &);
};
diff --git a/SequenceComparison/mains.cpp b/SequenceComparison/mains.cpp
index bc33c345373e57f9f451f5c082f3d85b62a2a70a..b7ffa710f2407b678c3d1d5e877a3c7a1c1faf10 100644
--- a/SequenceComparison/mains.cpp
+++ b/SequenceComparison/mains.cpp
@@ -1,9 +1,10 @@
#include "stdafx.h"
#include "mains.h"
+#include <random>
#include "entrypoint.h"
#include "parameter.h"
-#include "dataParser.h"
+#include "parser.h"
#include "print.h"
#include "operation.h"
#include "dtw.h"
@@ -12,78 +13,76 @@
#include "help.h"
#include "calcul.h"
#include "draw.h"
-#include <random>
using namespace std;
-void mains::entry_main(vtr<string> const &args)
+void mains::main_entry(vtr<string> const &args)
{
+ //script support
vector<string> scripts;
for (size_t i = 0; i < args.size() - 1; i++)
{
if (args[i] == "-script")
{
- scripts = dataParser::readFileByLine(args[i + 1]);
+ scripts = parser::readFileByLine(args[i + 1]);
break;
}
}
+
+ result_operation result;
+ auto params = parameter::setParameters(args);
if (scripts.size() > 0)
{
- //size_t start = args.size() >= 3 ? stoi(args[2]) - 1 : 0;
- //size_t end = args.size() == 4 ? stoi(args[3]) : scripts.size();
- for (size_t i = 0; i < scripts.size(); i++)
+ for (size_t i = 0; i < scripts.size(); i++) //secondary switches applyed to all script lines ...for more robust behaviour
{
- auto argsSub = help::split(scripts[i], " \t");
- parameter::parameterPriority(argsSub, args);
- mainLogic(argsSub);
+ auto argsAll = help::split(scripts[i], " \t");
+ parameter::applyParameter(argsAll, args);
+ params = parameter::setParameters(argsAll);
+ result = main_logic(params);
}
}
else
- mainLogic(args);
+ result = main_logic(params);
}
-void mains::mainLogic(vtr<string> const &args)
-{
- auto params = parameter::setParameters(args);
-
+result_operation mains::main_logic(parameter const ¶ms)
+{
//INPUT DATA PARSING
input_data data;
result_time times;
auto begin = chrono::steady_clock::now();
try {
- data.files.input = dataParser::getAllFileNames(params.inPath); //file path of all input files
- data.files.query = dataParser::getAllFileNames(params.inQuery); //file path of all input files
- data.files.keyInput = dataParser::getAllFileNames(params.inKeyInput); //file path of all input files
- data.files.keyQuery = dataParser::getAllFileNames(params.inKeyQuery); //file path of all input files
+ data.files.input = parser::getAllFileNames(params.inPath); //file path of all input files
+ data.files.query = parser::getAllFileNames(params.inQuery); //file path of all input files
+ data.files.keyInput = parser::getAllFileNames(params.inKeyInput); //file path of all input files
+ data.files.keyQuery = parser::getAllFileNames(params.inKeyQuery); //file path of all input files
data.files.sort();
- data.input = dataParser::readData<double>(data.files.input); //parsing
+ data.input = parser::readData<double>(data.files.input); //parsing
if (data.input.size() < 1)
throw runtime_error("problem occured when loading input data");
if (params.distance == 4)
- data.keyInput = dataParser::readData<int>(data.files.keyInput);
+ data.keyInput = parser::readData<int>(data.files.keyInput);
if (params.isQuery())
{
- data.query = dataParser::readData<double>(data.files.query); //parsing
+ data.query = parser::readData<double>(data.files.query); //parsing
if (data.query.size() < 1)
throw runtime_error("problem occured when loading query data");
if (params.distance == 4)
- data.keyInput = dataParser::readData<int>(data.files.keyQuery);
+ data.keyInput = parser::readData<int>(data.files.keyQuery);
}
times.parsing = chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now() - begin).count();
- if (params.isTime())
- cout << print::elapsedTime("parsing", times.parsing) << endl;
-
+
if (params.isClusters()) //parsing clusters file
{
- auto clusterTmp = dataParser::parseClusters(data.files.query, params.inClusterPath);
- data.clusters = dataParser::parseClusters(data.files.input, params.inClusterPath);
+ auto clusterTmp = parser::parseClusters(data.files.query, params.inClusterPath);
+ data.clusters = parser::parseClusters(data.files.input, params.inClusterPath);
int clusterSize = (int)data.clusters.ids.size();
for (size_t i = 0; i < clusterTmp.ids.size(); i++)
@@ -132,10 +131,12 @@ void mains::mainLogic(vtr<string> const &args)
//PRINT REUSULT
- mains::printResultLogic(data, result, times, params);
+ mains::printResult(data, result, times, params);
+
+ return result;
}
-result_operation mains::mainLogic_extern(vtr3<double> const &input, vtr<string> const &args)
+result_operation mains::extern_logic(vtr3<double> const &input, vtr<string> const &args)
{
//cout << print::printVector(args);
auto params = parameter::setParameters(args);
@@ -229,8 +230,16 @@ void mains::preprocesing(input_data &data, parameter const& params)
}
}
-void mains::printResultLogic(input_data const &data, result_operation const &result, result_time ×, parameter const ¶ms)
+void mains::printResult(input_data const &data, result_operation &result, result_time ×, parameter const ¶ms)
{
+ if (!result.scoreMethod.empty())
+ cout << print::vector(result.scoreMethod);
+
+ if(!result.matrixSimilarity.empty())
+ result.matrixSimilarity = help::alterStructure(result.matrixSimilarity);
+ //if (!result.matrixCluster.empty())
+ // result.matrixCluster = help::alterStructure(result.matrixCluster);
+
if (params.isPrintOutput()) {
if (params.isOmp())
cout << print::matrix(result.matrixSimilarity[params.scoreType - 1], params);
@@ -239,20 +248,20 @@ void mains::printResultLogic(input_data const &data, result_operation const &res
}
if (params.operation > 2)
- cout << print::scores_clustering(result);
+ cout << print::scores_clustering(result, params.precision);
//WRITE LOG FILES
auto begin = chrono::steady_clock::now();
if (params.isWriteOutput()) {
print::write(print::matrix(result.matrixSimilarity[params.scoreType - 1], params), params.outputPath + ".matrix", false);
- print::write(print::scores_clustering(result), params.outputPath + ".score", false);
+ print::write(print::scores_clustering(result, params.precision), params.outputPath + ".score", false);
}
if (params.isHtml())
{
print::write(
/*print::printParameterString(args) + "</br>" +*/
- print::scores_clustering(result) +
+ print::scores_clustering(result, params.precision) +
print::htmlClusters(data.input, result.matrixCluster[0], data.clusters), params.outputPath + ".html", true);
}
diff --git a/SequenceComparison/mains.h b/SequenceComparison/mains.h
index e864b854dd0cc014588b8515803702fd62d3f9ce..6e71a550afd58e0b873dbd2e70f2f5ac981a3766 100644
--- a/SequenceComparison/mains.h
+++ b/SequenceComparison/mains.h
@@ -7,15 +7,15 @@
class mains
{
public:
- static void entry_main(vtr<std::string> const &args);
+ static void main_entry(vtr<std::string> const &args);
- static result_operation mainLogic_extern(vtr3<double> const &input, vtr<std::string> const &args);
+ static result_operation main_logic(parameter const ¶ms);
- static void mainLogic(vtr<std::string> const &args);
+ static result_operation extern_logic(vtr3<double> const &input, vtr<std::string> const &args);
static void preprocesing(input_data &data, parameter const ¶ms);
- static void printResultLogic(input_data const &data, result_operation const &result, result_time ×, parameter const ¶ms);
+ static void printResult(input_data const &data, result_operation &result, result_time ×, parameter const ¶ms);
};
diff --git a/SequenceComparison/makefile b/SequenceComparison/makefile
index ad861dbb080b66299a58ca11d197706c570b6867..4976511998da5a97164044959e082a4acaf82a56 100644
--- a/SequenceComparison/makefile
+++ b/SequenceComparison/makefile
@@ -1,56 +1,67 @@
CC = g++
CF = -std=c++14 -pedantic -Wall
+
# -qoverride-limits
-my: main.cpp templates.h structs.h mains.cpp mains.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h entrypoint.h tree.h
- g++ $(CF) -O3 -fopenmp main.cpp mains.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -lX11 -o mymsa
+my: main.cpp templates.h structs.h mains.cpp mains.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h entrypoint.h tree.h
+ g++ $(CF) -O3 -fopenmp main.cpp mains.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -lX11 -o mymsa
#
-myg: main.cpp templates.h headerStruct.h mains.cpp mains.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h entrypoint.h
- g++ $(CF) -O3 -fopenmp main.cpp mains.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -lX11 -o mymsa
+myg: main.cpp templates.h headerStruct.h mains.cpp mains.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h entrypoint.h
+ g++ $(CF) -O3 -fopenmp main.cpp mains.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -lX11 -o mymsa
-F=-O3 -fPIC -shared -std=c++14 -fopenmp
-LF=-lstdc++fs
+CCic=-O3 -fPIC -shared -std=c++14 -fopenmp
+CFic=-lstdc++fs
-myso: templates.h headerStruct.h mains.cpp mains.h entrypoint.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h
- icpc $(F) -O3 -fopenmp mains.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp pdtw.cpp print.cpp operation.cpp -lstdc++fs -o libscso.so
+myso: templates.h headerStruct.h mains.cpp mains.h entrypoint.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h
+ icpc $(CCic) -O3 -fopenmp mains.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp pdtw.cpp print.cpp operation.cpp -lstdc++fs -o libscso.so
-mysog: templates.h headerStruct.h mains.cpp mains.h entrypoint.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h
- g++ $(F) -O3 -fopenmp mains.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp pdtw.cpp print.cpp operation.cpp -lstdc++fs -o libscso.so
+mysog: templates.h structs.h mains.cpp mains.h entrypoint.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h draw.h
+ g++ $(CCic) -O3 -fopenmp mains.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp pdtw.cpp print.cpp operation.cpp -lstdc++fs -o libscso.so
-##myD: main.cpp templates.h headerStruct.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h
-# $(CC) $(CF) -g -fopenmp main.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -o mymsad
+##myD: main.cpp templates.h structs.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h
+# $(CC) $(CF) -g -fopenmp main.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -o mymsad
#
-#mygd: main.cpp templates.h headerStruct.h parameter.cpp parameter.h calcul.cpp calcul.h dataParser.cpp dataParser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h
-# g++ $(CF) -g -fopenmp main.cpp parameter.cpp calcul.cpp dataParser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -o mymsa
+#mygd: main.cpp templates.h structs.h parameter.cpp parameter.h calcul.cpp calcul.h parser.cpp parser.h dtw.cpp dtw.h lcss.cpp lcss.h help.cpp help.h operation.cpp operation.h pdtw.cpp pdtw.h print.cpp print.h
+# g++ $(CF) -g -fopenmp main.cpp parameter.cpp calcul.cpp parser.cpp dtw.cpp lcss.cpp help.cpp operation.cpp pdtw.cpp print.cpp -lstdc++fs -o mymsa
#
-#main.o: main.cpp dtw.h lcss.h operation.h help.h dataParser.h templates.h
-# $(CC) $(CF) -c main.cpp -o main.o
-#
-dtw.o: dtw.cpp dtw.h headerStruct.h calcul.h help.h print.h templates.h
- $(CC) $(CF) -c dtw.cpp -o dtw.o
-pdtw.o: pdtw.cpp pdtw.h headerStruct.h calcul.h help.h print.h templates.h
- $(CC) $(CF) -c pdtw.cpp -o pdtw.o
+CCs = g++
+CFs = -std=c++14 -pedantic -Wall -O3
+
+all: main.cpp mains.h parameter.h
+ $(CCs) $(CFs) main.cpp mains.o
+
+mains.o: mains.h entrypoint.h parser.h print.h operation.h dtw.h lcss.h pdtw.h help.h help.cpp parameter.cpp parser.cpp print.cpp operation.cpp dtw.cpp lcss.cpp pdtw.cpp help.cpp
+ $(CCs) $(CFs) -c mains.cpp -o mains.o
+
+parameter.o: parameter.cpp parameter.h
+ $(CCs) $(CFs) -c parameter.cpp -o parameter.o
-lcss.o: lcss.cpp lcss.h headerStruct.h calcul.h help.h print.h templates.h
- $(CC) $(CF) -c lcss.cpp -o lcss.o
+dtw.o: dtw.cpp dtw.h structs.h calcul.h help.h print.h templates.h
+ $(CCs) $(CFs) -c dtw.cpp -o dtw.o
-dataParser.o: dataParser.cpp dataParser.h help.h
- $(CC) $(CF) -c dataParser.cpp -lstdc++fs -o dataParser.o
+pdtw.o: pdtw.cpp pdtw.h structs.h calcul.h help.h print.h templates.h
+ $(CCs) $(CFs) -c pdtw.cpp -o pdtw.o
+
+lcss.o: lcss.cpp lcss.h structs.h calcul.h help.h print.h templates.h
+ $(CCs) $(CFs) -c lcss.cpp -o lcss.o
+
+parser.o: parser.cpp parser.h help.h
+ $(CCs) $(CFs) -c parser.cpp -lstdc++fs -o parser.o
operation.o: templates.h operation.cpp operation.h dtw.h lcss.h
- $(CC) $(CF) -fopenmp -c operation.cpp -o operation.o
+ $(CCs) $(CFs) -fopenmp -c operation.cpp -o operation.o
print.o: print.cpp print.h
- $(CC) $(CF) -c print.cpp -o print.o
+ $(CCs) $(CFs) -c print.cpp -o print.o
help.o: help.cpp help.h
- $(CC) $(CF) -c help.cpp -o help.o
+ $(CCs) $(CFs) -c help.cpp -o help.o
calcul.o: calcul.cpp calcul.h
- $(CC) $(CF) -c calcul.cpp -lstdc++fs -o calcul.o
-
-parameter.o: parameter.cpp parameter.h
- $(CC) $(CF) -c parameter.cpp -o parameter.o
+ $(CCs) $(CFs) -c calcul.cpp -lstdc++fs -o calcul.o
+
+matrix.o: matrix.cpp matrix.h
+ $(CCs) $(CFs) -c matrix.cpp -o matrix.o
# -fopenmp needs to be used for openmp lib
# -lstdc++fs is static library needs to be used for experimental/filesystem include
diff --git a/SequenceComparison/matrix.cpp b/SequenceComparison/matrix.cpp
index f1846d7b28f40a14d531824716c088c946819e9d..2e8aec689104b776ba009fc3b9eec68e837ac382 100644
--- a/SequenceComparison/matrix.cpp
+++ b/SequenceComparison/matrix.cpp
@@ -11,47 +11,40 @@ using namespace std;
#undef min
#undef max
-template <class T>
-matrix<T>::matrix()
+matrix::matrix()
{}
-template <class T>
-matrix<T>::matrix(input_method const &p_input, input_info const &p_info, parameter const &p_params) : input(p_input), info(p_info), p(p_params)
-{}
-
-template <class T>
-matrix<T>::~matrix()
+matrix::matrix(input_method const &p_input, input_info const &p_info, parameter const &p_params) : input(p_input), info(p_info), params(p_params)
{}
/*
sumary:
parameters:
*/
-template <class T>
-void matrix<T>::build()
+void matrix::build()
{
int lenA = (int)input.A.size();
int lenB = (int)input.B.size();
- m(lenA + 1);
+ m = vtr2<double>(lenA + 1);
for (int i = 0; i < lenA + 1; i++)
- m[i] = vtr<node<T>>(lenB + 1);
+ m[i] = vtr<double>(lenB + 1);
- for (int i = 0; i < min(lenA, params.relax.start + 1); i++)
- m[i][0].value = 0;
+ for (int i = 0; i < std::min(lenA, params.relax + 1); i++)
+ m[i][0] = 0;
- for (int i = 0; i < min(lenB, params.relax.end + 1); i++)
- m[0][i].value = 0;
+ for (int i = 0; i < std::min(lenB, params.relax + 1); i++)
+ m[0][i] = 0;
if (params.isSubsequence() && calcul::lenRatio(lenA, lenB) < params.subsequence)
{
if (lenA < lenB)
for (int i = 0; i < lenB + 1; i++)
- m[0][i].value = 0;
+ m[0][i] = 0;
if (lenB < lenA)
for (int i = 0; i < lenA + 1; i++)
- m[i][0].value = 0;
+ m[i][0] = 0;
}
const int w = (int)(lenB * params.w);
@@ -62,17 +55,16 @@ void matrix<T>::build()
for (size_t j = start; j < end; j++) //col = x
{
if (params.distance == 3)
- m[i][j].value = static_cast<T>(distance.csi_chroma(input.A[i - 1], input.B[j - 1], 0.07));
+ m[i][j] = d.csi_chroma(input.A[i - 1], input.B[j - 1], 0.07);
else if (params.distance == 4)
- m[i][j].value = static_cast<T>(distance.csi_chord(input.A[i - 1], input.B[j - 1], input.A2[i - 1], input.B2[j - 1]));
+ m[i][j] = d.csi_chord(input.A[i - 1], input.B[j - 1], input.A2[i - 1], input.B2[j - 1]);
else
- m[i][j].value = static_cast<T>(distance.classic(input.A[i - 1], input.B[j - 1]));
+ m[i][j] = d.classic(input.A[i - 1], input.B[j - 1]);
}
}
}
-template<class T>
-void matrix<T>::build_accumulate()
+void matrix::build_accumulate()
{
int lenA = (int)m.size();
int lenB = (int)m[0].size();
@@ -84,13 +76,12 @@ void matrix<T>::build_accumulate()
const size_t end = min(lenB, (int)(ceil(i * lenB / (double)lenA)) + w);
for (size_t j = start; j < end; j++) //col = x
{
- m[i][j].value += std::min({ m[i - 1][j - 1].value, m[i - 1][j].value, m[i][j - 1].value });
+ m[i][j] += std::min({ m[i - 1][j - 1], m[i - 1][j], m[i][j - 1] });
}
}
}
-template<class T>
-vtr<coords> matrix<T>::get_minimums()
+vtr<coords> matrix::get_minimums()
{
vtr<coords> minims;
@@ -104,11 +95,11 @@ vtr<coords> matrix<T>::get_minimums()
const int end = min(lenB, (int)(ceil(i * lenB / (double)lenA)) + w);
for (int j = start; j < end; j++) //col = x
{
- T current = m[i][j].value;
+ double current = m[i][j];
if (i + 1 < m.size() && j + 1 < m[i].size() &&
- m[i - 1][j].value > current && m[i - 1][j + 1].value > current && m[i][j - 1].value > current &&
- m[i][j + 1].value > current && m[i + 1][j - 1].value > current && m[i + 1][j].value > current)
+ m[i - 1][j] > current && m[i - 1][j + 1] > current && m[i][j - 1] > current &&
+ m[i][j + 1] > current && m[i + 1][j - 1] > current && m[i + 1][j] > current)
{
minims.push_back(coords(i, j));
}
@@ -126,80 +117,79 @@ i
j
params
*/
-template<class T>
-result_path matrix<T>::get_warping(coords const &coord)
+result_path matrix::get_warping(coords &coord)
{
result_path wp;
- double sizeA = i;
- double sizeB = j;
+ double sizeA = coord.row;
+ double sizeB = coord.col;
- while (i > 0 && j > 0)
+ while (coord.row > 0 && coord.col > 0)
{
- double u = m[i - 1][j].value;
- double l = m[i][j - 1].value;
- double d = m[i - 1][j - 1].value;
+ double u = m[coord.row - 1][coord.col];
+ double l = m[coord.row][coord.col - 1];
+ double d = m[coord.row - 1][coord.col - 1];
+
if (min({ d, u, l }) == d)
{
wp.path = "M" + wp.path;
- i--;
- j--;
+ coord.row--;
+ coord.col--;
}
else
{
if (l < u)
{
wp.path = "L" + wp.path;
- j--;
+ coord.col--;
}
else if (u < l)
{
wp.path = "U" + wp.path;
- i--;
+ coord.row--;
}
else
{
- if (sizeA / i > sizeB / j)
+ if (sizeA / coord.row > sizeB / coord.col)
{
wp.path = "L" + wp.path;
- j--;
+ coord.col--;
}
else
{
wp.path = "U" + wp.path;
- i--;
+ coord.row--;
}
}
}
}
if (!params.isSubsequence() || (params.isSubsequence() && m.size() < m[0].size()))
- while (i > params.relax.start)
+ while (coord.row > params.relax)
{
wp.path = "U" + wp.path;
- i--;
+ coord.row--;
}
if (!params.isSubsequence() || (params.isSubsequence() && m[0].size() < m.size()))
- while (j > params.relax.end)
+ while (coord.col > params.relax)
{
wp.path = "L" + wp.path;
- j--;
+ coord.col--;
}
- wp.wpStart.row = (int)i;
- wp.wpStart.col = (int)j;
- wp.pathSize = (int)wp.path.size();
+ wp.start.row = (int)coord.row;
+ wp.start.col = (int)coord.col;
+ //wp.pathSize = (int)wp.path.size();
return wp;
}
-template <class T>
-vtr<result_path> matrix<T>::get_warpings(vtr<result_path> const &paths)
+vtr<result_path> matrix::get_warpings(vtr<result_path> const &paths)
{
vtr<result_path> outPaths;
- for (auto &i : paths)
- outPaths.push_back(get_warping(m, i.wpStart.row, i.wpStart.col, params))
+ for (auto i : paths)
+ outPaths.push_back(get_warping(i.start));
return paths;
}
@@ -208,17 +198,16 @@ vtr<result_path> matrix<T>::get_warpings(vtr<result_path> const &paths)
sumary:
parameters:
*/
-template <class T>
-coords matrix<T>::get_relaxedEnds()
+coords matrix::get_relaxedEnds()
{
- double min = MAX_double;
+ double min = constant::MAX_double;
coords coordMin;
int lenA = (int)m.size() - 1;
int lenB = (int)m[0].size() - 1;
- int startA = (lenA - params.relax.start) < 0 ? 0 : lenA - params.relax.start;
- int startB = (lenB - params.relax.end) < 0 ? 0 : lenB - params.relax.end;
+ int startA = (lenA - params.relax) < 0 ? 0 : lenA - params.relax;
+ int startB = (lenB - params.relax) < 0 ? 0 : lenB - params.relax;
if (params.isSubsequence())
{
@@ -230,9 +219,9 @@ coords matrix<T>::get_relaxedEnds()
for (size_t i = startA; i < m.size(); i++)
{
- if (m[i][lenB].value <= min)
+ if (m[i][lenB] <= min)
{
- min = m[i][lenB].value;
+ min = m[i][lenB];
coordMin.row = (int)i;
coordMin.col = lenB;
}
@@ -240,9 +229,9 @@ coords matrix<T>::get_relaxedEnds()
for (size_t i = startB; i < m[0].size(); i++)
{
- if (m[lenA][i].value <= min)
+ if (m[lenA][i] <= min)
{
- min = m[lenA][i].value;
+ min = m[lenA][i];
coordMin.row = lenA;
coordMin.col = (int)i;
}
diff --git a/SequenceComparison/matrix.h b/SequenceComparison/matrix.h
index 2cc3df9fa2f12af1d2bfb21412421318d7e77bc7..66a1a85305e060bc840ffd747939959cd40f2007 100644
--- a/SequenceComparison/matrix.h
+++ b/SequenceComparison/matrix.h
@@ -4,24 +4,22 @@
#include "structs.h"
#include "parameter.h"
-template <class T>
class matrix
{
public:
- vtr2<T> m;
+ vtr2<double> m;
input_method input;
input_info info;
parameter params;
DISTANCE d;
- matrix<T>();;
- matrix<T>(input_method const &p_input, input_info const &p_info, parameter const &p_params);
- ~matrix();
+ matrix();
+ matrix(input_method const &p_input, input_info const &p_info, parameter const &p_params);
void build();
void build_accumulate();
vtr<coords> get_minimums();
- result_path get_warping(coords const &coord);
+ result_path get_warping(coords &coord);
vtr<result_path> get_warpings(vtr<result_path> const &paths);
coords get_relaxedEnds();
};
diff --git a/SequenceComparison/operation.cpp b/SequenceComparison/operation.cpp
index e7fad3c116f9b7e8da0483ee9040d65fc6a718ce..321ba184ec89a042e5d174d70be9eb1b5f5b8817 100644
--- a/SequenceComparison/operation.cpp
+++ b/SequenceComparison/operation.cpp
@@ -26,34 +26,15 @@ result_operation operation::main(input_data_single const &data, parameter const
switch (params.operation)
{
case eOperation::op_dtw: //op 0
- result = dtw(data, params, f1);
+ result = params.shift ? dtw_shift(data, params, f1) : dtw(data, params, f1);
break;
case eOperation::op_similarityMatrix_one: //op 1
- result = params.isOmp() ? similarityMatrix_omp(data, params, f1) : similarityMatrix(data, params, f1);
+ result = params.shift ? similarityMatrix_shift_omp(data, params, f1) : similarityMatrix_omp(data, params, f1);
break;
case eOperation::op_oneInput: //op 3
result = clustering(data, params, f1);
break;
- case eOperation::op_oneInput_shift: // 5
- result = clustering_shift(data, params, f1);
- break;
-
- //case eOperation::queryOne:
- // result = query_omp(data.query, data.input, data.clusters, params, f1);
- // break;*/
-//experimental operations mostly NOT USED
- //case eOperation::op_dimSimilarityMatrix:
- // result = params.isOmp() ? similarityMatrix_dimensions_omp(data.input, params, f1) : similarityMatrix_dimensions(data.input, params, f1);
- // break;
- //case eOperation::op_bestDimSimMatrix:
- // result = params.isOmp() ? similarityMatrix_dimensions_omp(data.input, params, f1) : bestSimilarityMatrix_dimensions(data.input, params, f1);
- // break;
-
- //case eOperation::op_pdtw:
- // pdtw::main(data.input, params);
- // break;
default:
- //throw runtime_error("error: Operation not found");
cout << ("error: Operation not found");
exit(0);
break;
@@ -75,19 +56,12 @@ result_operation operation::main(input_data const &data, parameter const ¶ms
switch (params.operation)
{
case eOperation::op_similarityMatrix_two: //op 2
- result = params.isOmp() ? similarityMatrix_omp(data, params, f1) : similarityMatrix(data, params, f1);
+ result = params.shift ? similarityMatrix_shift_omp(data, params, f1) : similarityMatrix_omp(data, params, f1);
break;
case eOperation::op_twoInput: //op 4
result = clustering(data, params, f1);
break;
- case eOperation::op_twoInput_shift:
- result = clustering_shift(data, params, f1);
- break;
- /*case eOperation::op_queryOne:
- result = query_omp(data, params, f1);
- break;*/
default:
- //throw runtime_error("error: Operation not found");
cout << ("error: Operation not found");
exit(0);
break;
@@ -104,66 +78,57 @@ result_operation operation::dtw(input_data_single const &data, parameter const &
else
input = input_method(data.input[0], data.input[1]);
- input_info info;
- info.idxA = 0;
- info.idxB = 1;
-
- //for (auto i : data.input) {
+ input_info info(0, 1);
+ //for (auto i : data.input)
+ //{
// for (auto j : i)
// for (auto k : j)
// std::cout << k << ",";
-
+ //
// std::cout << std::endl;
//}
result_operation result;
result.scoreMethod = f(input, info, params);
- cout << print::vectorT(result.scoreMethod) << endl;
-
return result;
}
result_operation operation::similarityMatrix(input_data_single const &data, parameter const ¶ms, METHOD f)
{
- vtr3<double> matrix = help::vtr_init<double>(5, data.input.size(), data.input.size());
+ vtr3<double> matrix = help::vtr_initPartial<double>(data.input.size(), data.input.size());
cout << setprecision(params.precision);
for (size_t i = 0; i < data.input.size(); i++)
{
cout << setw(3) << i + 1 << " ";
- for (size_t j = 0; j < data.input.size(); j++)
+ for (size_t j = 0; j <= i /*data.input.size()*/; j++)
{
- vtr<double> tmp;
- if (i >= j)
- {
- input_method input;
- if (params.isSecondaryInput())
- input = input_method(data.input[i], data.input[j], data.key[i], data.key[j]);
- else
- input = input_method(data.input[i], data.input[j]);
-
- input_info info;
- info.idxA = i;
- info.idxB = j;
- info.nameA = data.files.get_inputName(i);
- info.nameB = data.files.get_inputName(j);
+ /*if (i >= j)
+ {*/
+ input_method input;
+ if (params.isSecondaryInput())
+ input = input_method(data.input[i], data.input[j], data.key[i], data.key[j]);
+ else
+ input = input_method(data.input[i], data.input[j]);
+
+ input_info info(i, j);
+ info.nameA = data.files.get_inputName(i);
+ info.nameB = data.files.get_inputName(j);
- tmp = f(input, info, params);
+ vtr<double> tmp = f(input, info, params);
- if (params.scoreType < 2)
- cout << setw(params.precision + 5) << fixed << tmp[params.scoreType] << " ";
- else
- cout << setw(params.precision + 3) << fixed << tmp[params.scoreType] << " ";
+ if (params.scoreType < 2)
+ cout << setw(params.precision + 5) << fixed << tmp[params.scoreType] << " ";
+ else
+ cout << setw(params.precision + 3) << fixed << tmp[params.scoreType] << " ";
- for (int k = 0; k < 5; k++) {
- matrix[k][i][j] = tmp[k];
- matrix[k][j][i] = tmp[k];
- }
- }
+ matrix[i][j] = tmp;
+ matrix[j][i] = tmp;
+ /*}
else
- break;
+ break;*/
}
cout << endl;
}
@@ -176,7 +141,8 @@ result_operation operation::similarityMatrix(input_data_single const &data, para
result_operation operation::similarityMatrix_omp(input_data_single const &data, parameter const ¶ms, METHOD f)
{
- vtr3<double> matrix = help::vtr_init<double>(5, data.input.size(), data.input.size());
+ result_operation result;
+ result.matrixSimilarity = help::vtr_initPartial<double>(data.input.size(), data.input.size());
//cout << thread::hardware_concurrency() << endl;
//cout << omp_get_num_procs() << endl;
@@ -185,7 +151,7 @@ result_operation operation::similarityMatrix_omp(input_data_single const &data,
int size = (int)(data.input.size() * (data.input.size() + 1) / 2);
omp_set_num_threads(params.omp);
- #pragma omp parallel for schedule(static, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
+ #pragma omp parallel for schedule(dynamic, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
for (int g = 1; g < size + 1; g++)
{
int i = (int)ceil(sqrt(2 * g + 0.25) - 0.5);
@@ -199,27 +165,18 @@ result_operation operation::similarityMatrix_omp(input_data_single const &data,
else
input = input_method(data.input[i], data.input[j]);
- input_info info;
- info.idxA = i;
- info.idxB = j;
+ input_info info(i, j);
- auto tmp = f(input, info, params);
-
- for (int k = 0; k < 5; k++) {
- matrix[k][i][j] = tmp[k];
- matrix[k][j][i] = tmp[k];
- }
+ result.matrixSimilarity[i][j] = f(input, info, params);
+ result.matrixSimilarity[j][i] = result.matrixSimilarity[i][j];
}
- result_operation result;
- result.matrixSimilarity = matrix;
-
return result;
}
result_operation operation::similarityMatrix(input_data const &data, parameter const ¶ms, METHOD f)
{
- vtr3<double> matrix = help::vtr_init<double>(5, data.input.size(), data.input.size());
+ vtr3<double> matrix = help::vtr_initPartial<double>(data.input.size(), data.input.size());
for (size_t i = 1; i < data.input.size() + 1; i++)
cout << " " << setw(3 + params.precision) << i;
@@ -270,13 +227,11 @@ result_operation operation::similarityMatrix(input_data const &data, parameter c
else
input = input_method(data.query[i], data.input[j]);
- input_info info;
- info.idxA = i;
- info.idxB = j;
+ input_info info(i, j);
auto tmp = f(input, info, params)/*[params.scoreType]*/;
- for (int k = 0; k < 5; k++)
- matrix[k][i][j] = tmp[k];
+
+ matrix[i][j] = tmp;
if (params.scoreType < 2)
cout << setw(params.precision + 5) << fixed << tmp[params.scoreType] << " ";
@@ -294,32 +249,26 @@ result_operation operation::similarityMatrix(input_data const &data, parameter c
result_operation operation::similarityMatrix_omp(input_data const &data, parameter const ¶ms, METHOD f)
{
- vtr3<double> matrix = help::vtr_init<double>(5, data.input.size(), data.input.size());
+ vtr3<double> matrix = help::vtr_initPartial<double>(data.input.size(), data.input.size());
int size = (int)(data.query.size() * data.input.size());
omp_set_num_threads(params.omp);
-#pragma omp parallel for schedule(static, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
+ #pragma omp parallel for schedule(dynamic, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
for (int g = 0; g < size; g++)
{
int i = g / (int)data.input.size();
int j = g % (int)data.input.size();
- /*input_method input(data.query[i], data.input[j], data.keyQuery[i], data.keyInput[j]);
- if (params.isSecondaryInput())*/
-
input_method input;
if (params.isSecondaryInput())
input = input_method(data.query[i], data.input[j], data.keyQuery[i], data.keyInput[j]);
else
input = input_method(data.query[i], data.input[j]);
- input_info info;
- info.idxA = i;
- info.idxB = j;
+ input_info info(i,j);
auto tmp = f(input, info, params);
- for (int k = 0; k < 5; k++)
- matrix[k][i][j] = tmp[k];
+ matrix[i][j] = tmp;
}
result_operation result;
@@ -332,59 +281,46 @@ result_operation operation::clustering(input_data_single const &data, parameter
{
result_operation result;
- if (params.isOmp())
- result = similarityMatrix_omp(data, params, f);
+ if (params.shift)
+ result = similarityMatrix_shift_omp(data, params, f);
else
- result = similarityMatrix(data, params, f);
+ result = similarityMatrix_omp(data, params, f);
- vtr3<int> idxs = help::vtr_init<int>(5, data.input.size(), data.input.size());
+ int depth = (int)result.matrixSimilarity[0][0].size();
+ result.init_clusterMatrix(depth);
- for (size_t i = 0; i < 5; i++)
- {
- for (int j = 0; j < (int)data.input.size(); j++)
- {
- for (int k = 0; k < (int)data.input.size(); k++)
- {
- idxs[i][j][k] = k + 1;
- }
- }
- }
-
- result.matrixCluster = idxs;
-
auto resultCopy = result;
- int size = (int)data.input.size() - 1;
- for (size_t i = 0; i < 5; i++)
+ int size = (int)data.input.size() - 1;
+ for (size_t i = 0; i < data.input.size(); i++)
{
- for (int j = 0; j < (int)data.input.size(); j++) //row //diagonal moved to left...
+ for (int k = 0; k < depth; k++) //row //diagonal moved to left...
{
- auto tmpSim = resultCopy.matrixSimilarity[i][j][j];
- resultCopy.matrixSimilarity[i][j][j] = resultCopy.matrixSimilarity[i][j][size];
- resultCopy.matrixSimilarity[i][j][size] = tmpSim;
-
- auto tmpClust = resultCopy.matrixCluster[i][j][j];
- resultCopy.matrixCluster[i][j][j] = resultCopy.matrixCluster[i][j][size];
- resultCopy.matrixCluster[i][j][size] = tmpClust;
-
- resultCopy.matrixSimilarity[i][j].pop_back();
- resultCopy.matrixCluster[i][j].pop_back();
+ resultCopy.matrixSimilarity[i][i][k] = resultCopy.matrixSimilarity[i][size][k];
+ resultCopy.matrixCluster[i][i][k] = resultCopy.matrixCluster[i][size][k];
}
+ resultCopy.matrixSimilarity[i].pop_back();
+ resultCopy.matrixCluster[i].pop_back();
}
+ auto alteredSM = help::alterStructure(resultCopy.matrixSimilarity);
+ resultCopy.matrixCluster = help::alterStructure(resultCopy.matrixCluster);
+
+ result.allocate(depth);
for (int i = 0; i < (int)data.input.size(); i++)
- {
- for (size_t j = 0; j < 5; j++)
+ {
+ for (int k = 0; k < depth; k++)
{
- help::sortFollow(resultCopy.matrixSimilarity[j][i], resultCopy.matrixCluster[j][i], params.scoreReversed);
- result.scoreAveragePrecisions[j].push_back(calcul::score_averagePrecision(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scoreAverageRanks[j].push_back(calcul::score_averageRank(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scorePrecisions[j].push_back(calcul::score_precision(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scoreRecalls[j].push_back(calcul::score_recall(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
+ help::sortFollow(alteredSM[k][i], resultCopy.matrixCluster[k][i], params.scoreReversed);
+ result.scoreAveragePrecisions[k].push_back(calcul::score_averagePrecision(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scoreAverageRanks[k].push_back(calcul::score_averageRank(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scorePrecisions[k].push_back(calcul::score_precision(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scoreRecalls[k].push_back(calcul::score_recall(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
}
}
- result.calculMeanScore();
+
result.matrixCluster = resultCopy.matrixCluster;
+ result.calculMeanScore();
return result;
}
@@ -395,52 +331,56 @@ result_operation operation::clustering_shift(input_data_single const &data, para
result = similarityMatrix_shift_omp(data, params, f);
- vtr3<int> idxs = help::vtr_init<int>(5, data.input.size(), data.input.size());
- for (size_t i = 0; i < 5; i++)
- {
- for (int j = 0; j < (int)data.input.size(); j++)
- {
- for (int k = 0; k < (int)data.input.size(); k++)
- {
- idxs[i][j][k] = k + 1;
- }
- }
- }
- result.matrixCluster = idxs;
+ int depth = (int)result.matrixSimilarity[0][0].size();
+ result.init_clusterMatrix(depth);
auto resultCopy = result;
- int size = (int)data.input.size() - 1;
- for (size_t i = 0; i < 5; i++)
+ int size = (int)data.input.size() - 1;
+ for (size_t i = 0; i < data.input.size(); i++)
{
- for (int j = 0; j < (int)data.input.size(); j++) //row //diagonal moved to left...
+ for (int k = 0; k < depth; k++) //row //diagonal moved to left...
{
- double tmpSim = resultCopy.matrixSimilarity[i][j][j];
- resultCopy.matrixSimilarity[i][j][j] = resultCopy.matrixSimilarity[i][j][size];
- resultCopy.matrixSimilarity[i][j][size] = tmpSim;
-
- int tmpClust = resultCopy.matrixCluster[i][j][j];
- resultCopy.matrixCluster[i][j][j] = resultCopy.matrixCluster[i][j][size];
- resultCopy.matrixCluster[i][j][size] = tmpClust;
-
- resultCopy.matrixSimilarity[i][j].pop_back();
- resultCopy.matrixCluster[i][j].pop_back();
+ resultCopy.matrixSimilarity[i][i][k] = resultCopy.matrixSimilarity[i][size][k];
+ resultCopy.matrixCluster[i][i][k] = resultCopy.matrixCluster[i][size][k];
}
+ resultCopy.matrixSimilarity[i].pop_back();
+ resultCopy.matrixCluster[i].pop_back();
}
+ //for (size_t i = 0; i < 5; i++)
+ //{
+ // for (int j = 0; j < (int)data.input.size(); j++) //row //diagonal moved to the end of row...
+ // {
+ // double tmpSim = resultCopy.matrixSimilarity[i][j][j];
+ // resultCopy.matrixSimilarity[i][j][j] = resultCopy.matrixSimilarity[i][j][size];
+ // resultCopy.matrixSimilarity[i][j][size] = tmpSim;
+ //
+ // int tmpClust = resultCopy.matrixCluster[i][j][j];
+ // resultCopy.matrixCluster[i][j][j] = resultCopy.matrixCluster[i][j][size];
+ // resultCopy.matrixCluster[i][j][size] = tmpClust;
+ //
+ // resultCopy.matrixSimilarity[i][j].pop_back();
+ // resultCopy.matrixCluster[i][j].pop_back();
+ // }
+ //}
+
+ auto alteredSM = help::alterStructure(resultCopy.matrixSimilarity);
+ resultCopy.matrixCluster = help::alterStructure(resultCopy.matrixCluster);
+ result.allocate(depth);
for (int i = 0; i < (int)data.input.size(); i++)
{
- for (size_t j = 0; j < 5; j++)
+ for (int k = 0; k < depth; k++)
{
- help::sortFollow(resultCopy.matrixSimilarity[j][i], resultCopy.matrixCluster[j][i], params.scoreReversed);
- result.scoreAveragePrecisions[j].push_back(calcul::score_averagePrecision(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scoreAverageRanks[j].push_back(calcul::score_averageRank(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scorePrecisions[j].push_back(calcul::score_precision(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
- result.scoreRecalls[j].push_back(calcul::score_recall(i + 1, resultCopy.matrixCluster[j][i], data.clusters));
+ help::sortFollow(alteredSM[k][i], resultCopy.matrixCluster[k][i], params.scoreReversed);
+ result.scoreAveragePrecisions[k].push_back(calcul::score_averagePrecision(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scoreAverageRanks[k].push_back(calcul::score_averageRank(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scorePrecisions[k].push_back(calcul::score_precision(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
+ result.scoreRecalls[k].push_back(calcul::score_recall(i + 1, resultCopy.matrixCluster[k][i], data.clusters));
}
}
- result.calculMeanScore();
result.matrixCluster = resultCopy.matrixCluster;
+ result.calculMeanScore();
return result;
}
@@ -449,33 +389,27 @@ result_operation operation::clustering(input_data const &data, parameter const &
{
result_operation result;
- if(params.isOmp())
- result = similarityMatrix_omp(data, params, f);
+ if(params.shift)
+ result = similarityMatrix_shift_omp(data, params, f);
else
result = similarityMatrix(data, params, f);
- vtr3<int> idxs = help::vtr_init<int>(5, data.input.size(), data.input.size());
- for (size_t i = 0; i < 5; i++)
- {
- for (int j = 0; j < (int)data.input.size(); j++)
- {
- for (int k = 0; k < (int)data.input.size(); k++)
- {
- idxs[i][j][k] = k + 1;
- }
- }
- }
- result.matrixCluster = idxs;
+ int depth = (int)result.matrixSimilarity[0][0].size();
+ result.init_clusterMatrix(depth);
+
+ auto alteredSM = help::alterStructure(result.matrixSimilarity);
+ result.matrixCluster = help::alterStructure(result.matrixCluster);
+ result.allocate(depth);
for (int i = 0; i < (int)data.query.size(); i++)
{
- for (size_t j = 0; j < 5; j++)
+ for (int k = 0; k < depth; k++)
{
- help::sortFollow(result.matrixSimilarity[j][i], idxs[j][i], params.scoreReversed); //sorts first and second is foolowing sorting of first
- result.scoreAveragePrecisions[j].push_back(calcul::score_averagePrecision(i + (int)data.input.size() + 1, idxs[j][i], data.clusters));
- result.scoreAverageRanks[j].push_back(calcul::score_averageRank(i + (int)data.input.size() + 1, idxs[j][i], data.clusters));
- result.scorePrecisions[j].push_back(calcul::score_precision(i + (int)data.input.size() + 1, idxs[j][i], data.clusters));
- result.scoreRecalls[j].push_back(calcul::score_recall(i + (int)data.input.size() + 1, idxs[j][i], data.clusters));
+ help::sortFollow(alteredSM[k][i], result.matrixCluster[k][i], params.scoreReversed); //sorts first and second is foolowing sorting of first
+ result.scoreAveragePrecisions[k].push_back(calcul::score_averagePrecision(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scoreAverageRanks[k].push_back(calcul::score_averageRank(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scorePrecisions[k].push_back(calcul::score_precision(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scoreRecalls[k].push_back(calcul::score_recall(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
}
}
@@ -484,160 +418,112 @@ result_operation operation::clustering(input_data const &data, parameter const &
return result;
}
-
-//vtr<double> operation::similarity_shifts_omp(vtr3<double> const &input, parameter const ¶ms, METHOD f)
-//{
-// const int dims = (int)input[0][0].size();
-//
-// vtr<double> result_shifts(dims);
-// /*for (int i = 0; i < dims; i++)
-// {
-// vector<double> simRow(dims);
-// matrix[i] = simRow;
-// }*/
-//
-// omp_set_num_threads(params.omp);
-//#pragma omp parallel for schedule(static, 1)/* num_threads(params.threads)*/
-// for (int g = 0; g < dims; g++)
-// {
-// /*int i = g / dims;
-// int j = g % dims;*/
-//
-// vtr2<double> inputBRotated(input[1]);
-//
-// for (size_t i = 0; i < inputBRotated[1].size(); i++)
-// {
-// rotate(inputBRotated[i].begin(), inputBRotated[i].begin() + g, inputBRotated[i].end());
-// }
-//
-// auto tmp = f(input[0], inputBRotated, params);
-// result_shifts[g] = tmp;
-// }
-//
-// //result_operation result;
-// //result.matrixSimilarity = matrix;
-//
-// return result_shifts;
-//}
-
-double operation::dtw_shifted(input_data_single const &data, parameter const ¶ms, METHOD f)
+result_operation operation::clustering_shift(input_data const &data, parameter const ¶ms, METHOD f)
{
- const int dims = (int)data.input[0][0].size();
- vtr<double> simShifted(dims);
-
- omp_set_num_threads(params.omp);
-#pragma omp parallel for schedule(static, 1)/* num_threads(params.threads)*/
- for (int g = 0; g < dims; g++)
- {
- vtr2<double> inputBRotated(data.input[1]);
-
- for (size_t i = 0; i < inputBRotated.size(); i++)
- {
- rotate(inputBRotated[i].begin(), inputBRotated[i].begin() + g, inputBRotated[i].end());
- }
+ result_operation result;
+ result = similarityMatrix_shift_omp(data, params, f);
- input_method input(data.input[0], inputBRotated);
+ int depth = (int)result.matrixSimilarity[0][0].size();
+ result.init_clusterMatrix(depth);
- input_info info;
- info.idxA = 0;
- info.idxB = 0;
+ auto alteredSM = help::alterStructure(result.matrixSimilarity);
+ result.matrixCluster = help::alterStructure(result.matrixCluster);
- auto tmp = f(input, info, params);
- simShifted[g] = tmp[params.scoreType];
- }
-
- double best = -1;
- if (!params.scoreReversed)
- best = constant::MAX_double;
-
- for (size_t i = 0; i < simShifted.size(); i++)
+ result.allocate(depth);
+ for (int k = 0; k < depth; k++)
{
- if (params.scoreReversed ? best < simShifted[i] : best > simShifted[i]) {
- best = simShifted[i];
+ for (int i = 0; i < (int)data.query.size(); i++)
+ {
+ help::sortFollow(alteredSM[k][i], result.matrixCluster[k][i], params.scoreReversed); //sorts first and second is foolowing soting of first
+ result.scoreAveragePrecisions[k].push_back(calcul::score_averagePrecision(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scoreAverageRanks[k].push_back(calcul::score_averageRank(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scorePrecisions[k].push_back(calcul::score_precision(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
+ result.scoreRecalls[k].push_back(calcul::score_recall(i + (int)data.input.size() + 1, result.matrixCluster[k][i], data.clusters));
}
}
+ result.calculMeanScore();
- return best;
+ return result;
}
result_operation operation::similarityMatrix_shift_omp(input_data_single const &data, parameter const ¶ms, METHOD f)
{
result_operation result;
- vtr3<double> matrix = help::vtr_initPartial<double>(1, data.input.size());
+ result.matrixSimilarity = help::vtr_initPartial<double>(data.input.size(), data.input.size());
- vtr3<double> subInput(2);
+ input_data_single subInput;
+ subInput.input = vtr3<double>(2);
for (size_t i = 0; i < data.input.size(); i++)
{
- subInput[0] = data.input[i];
- vector<double> simRow(data.input.size());
- for (size_t j = 0; j < data.input.size(); j++)
+ subInput.input[0] = data.input[i];
+ for (size_t j = 0; j <= i; j++)
{
- subInput[1] = data.input[j];
- simRow[j] = dtw_shifted(data, params, f);
+ subInput.input[1] = data.input[j];
+ result.matrixSimilarity[i][j] = dtw_shift(subInput, params, f).scoreMethod;
+ result.matrixSimilarity[j][i] = result.matrixSimilarity[i][j];
}
- matrix[0][i] = simRow;
}
- result.matrixSimilarity = matrix;
-
return result;
}
-
-result_operation operation::similarityMatrix_shift_omp(input_data const &data, parameter const ¶ms, METHOD f)
+result_operation operation::dtw_shift(input_data_single const &data, parameter const ¶ms, METHOD f)
{
- result_operation result;
+ const int dims = (int)data.input[0][0].size();
+ vtr2<double> resultShifted(dims);
- vtr3<double> matrix = help::vtr_initPartial<double>(1, data.input.size());
+ input_method input(data.input[0], data.input[1]);
- vtr3<double> subInput(2);
- for (size_t i = 0; i < data.query.size(); i++)
+ omp_set_num_threads(params.omp);
+ #pragma omp parallel for schedule(dynamic, 1)/* num_threads(params.threads)*/
+ for (int g = 0; g < dims; g++)
{
- subInput[0] = data.query[i];
- vector<double> simRow(data.input.size());
- for (size_t j = 0; j < data.input.size(); j++)
- {
- subInput[1] = data.input[j];
- simRow[j] = dtw_shifted(data.convert_inputDataSingle(), params, f);
- }
- matrix[0][i] = simRow;
+ vtr2<double> inputBRotated(data.input[1]);
+
+ for (size_t i = 0; i < inputBRotated.size(); i++)
+ rotate(inputBRotated[i].begin(), inputBRotated[i].begin() + g, inputBRotated[i].end());
+
+ input.B = inputBRotated;
+ input_info info(0, 1);
+
+ resultShifted[g] = f(input, info, params);
}
- result.matrixSimilarity = matrix;
+ vtr<double> best(resultShifted[0].size(), (!params.scoreReversed) ? constant::MAX_double : 0);
+
+ for (size_t i = 0; i < resultShifted.size(); i++)
+ {
+ if (params.scoreReversed ? best[params.scoreType - 1] < resultShifted[i][params.scoreType - 1] : best[params.scoreType - 1] > resultShifted[i][params.scoreType - 1])
+ best = resultShifted[i];
+ }
+
+ result_operation result;
+ result.scoreMethod = best;
return result;
}
-result_operation operation::clustering_shift(input_data const &data, parameter const ¶ms, METHOD f)
+result_operation operation::similarityMatrix_shift_omp(input_data const &data, parameter const ¶ms, METHOD f)
{
result_operation result;
- result = similarityMatrix_shift_omp(data, params, f);
- vtr3<int> idxs = help::vtr_init<int>(data.input.size(), data.input.size(), 5);
- for (size_t i = 0; i < 5; i++)
- {
- for (int j = 0; j < (int)data.input.size(); j++)
- {
- for (int k = 0; k < (int)data.input.size(); k++)
- {
- idxs[i][j][k] = k + 1;
- }
- }
- }
+ vtr3<double> matrix = help::vtr_initPartial<double>(data.input.size(), data.query.size());
- for (int i = 0; i < 5; i++)
+ input_data_single subInput;
+ subInput.input = vtr3<double>(2);
+ for (size_t i = 0; i < data.query.size(); i++)
{
- for (int j = 0; j < (int)data.query.size(); j++)
+ subInput.input[0] = data.query[i];
+ vtr2<double> simRow(data.input.size());
+ for (size_t j = 0; j < data.input.size(); j++)
{
- help::sortFollow(result.matrixSimilarity[i][j], idxs[i][j], params.scoreReversed); //sorts first and second is foolowing soting of first
- result.scoreAveragePrecisions[i].push_back(calcul::score_averagePrecision(i + (int)data.input.size() + 1, idxs[i][j], data.clusters));
- result.scoreAverageRanks[i].push_back(calcul::score_averageRank(i + (int)data.input.size() + 1, idxs[i][j], data.clusters));
- result.scorePrecisions[i].push_back(calcul::score_precision(i + (int)data.input.size() + 1, idxs[i][j], data.clusters));
- result.scoreRecalls[i].push_back(calcul::score_recall(i + (int)data.input.size() + 1, idxs[i][j], data.clusters));
+ subInput.input[1] = data.input[j];
+ simRow[j] = dtw_shift(subInput, params, f).scoreMethod;
}
+ matrix[i] = simRow;
}
- result.calculMeanScore();
- result.matrixCluster = idxs;
+
+ result.matrixSimilarity = matrix;
return result;
}
@@ -646,12 +532,12 @@ result_operation operation::query_omp(input_data const &data, parameter const &p
{
vtr<double> best(data.query.size());
vtr<int> bestIDs(data.query.size());
-
- fill(best.begin(), best.end(), constant::MAX_double);
+
+ fill(best.begin(), best.end(), (double)constant::MAX_double);
int size = (int)(data.query.size() * data.input.size());
omp_set_num_threads(params.omp);
-#pragma omp parallel for schedule(static, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
+#pragma omp parallel for schedule(dynamic, 1) /*num_threads(params.threads)*//* proc_bind(spread)*/
for (int g = 0; g < size; g++)
{
int i = g / (int)data.query.size();
@@ -659,9 +545,7 @@ result_operation operation::query_omp(input_data const &data, parameter const &p
input_method input(data.query[i], data.input[j], data.keyQuery[i], data.keyInput[j]);
- input_info info;
- info.idxA = i;
- info.idxB = j;
+ input_info info(i,j);
if (params.lowerBound)
{
@@ -673,7 +557,7 @@ result_operation operation::query_omp(input_data const &data, parameter const &p
if (distance < best[i])
{
-#pragma omp critical
+ #pragma omp critical
{
best[i] = distance;
bestIDs[i] = j + (int)data.query.size();
@@ -686,7 +570,7 @@ result_operation operation::query_omp(input_data const &data, parameter const &p
double distance = f(input, info, params)[params.scoreType];
if (distance < best[i])
{
-#pragma omp critical
+ #pragma omp critical
{
best[i] = distance;
bestIDs[i] = j + (int)data.query.size();
@@ -946,3 +830,39 @@ result_operation operation::query_omp(input_data const &data, parameter const &p
//
// return result;
//}
+
+
+//vtr<double> operation::similarity_shifts_omp(vtr3<double> const &input, parameter const ¶ms, METHOD f)
+//{
+// const int dims = (int)input[0][0].size();
+//
+// vtr<double> result_shifts(dims);
+// /*for (int i = 0; i < dims; i++)
+// {
+// vector<double> simRow(dims);
+// matrix[i] = simRow;
+// }*/
+//
+// omp_set_num_threads(params.omp);
+//#pragma omp parallel for schedule(static, 1)/* num_threads(params.threads)*/
+// for (int g = 0; g < dims; g++)
+// {
+// /*int i = g / dims;
+// int j = g % dims;*/
+//
+// vtr2<double> inputBRotated(input[1]);
+//
+// for (size_t i = 0; i < inputBRotated[1].size(); i++)
+// {
+// rotate(inputBRotated[i].begin(), inputBRotated[i].begin() + g, inputBRotated[i].end());
+// }
+//
+// auto tmp = f(input[0], inputBRotated, params);
+// result_shifts[g] = tmp;
+// }
+//
+// //result_operation result;
+// //result.matrixSimilarity = matrix;
+//
+// return result_shifts;
+//}
\ No newline at end of file
diff --git a/SequenceComparison/operation.h b/SequenceComparison/operation.h
index 04e6df4c919a05d681c9325a52afa100cced4e11..f9d2c6b0635d81a157518591af481bb12c791613 100644
--- a/SequenceComparison/operation.h
+++ b/SequenceComparison/operation.h
@@ -36,7 +36,7 @@ public:
static result_operation similarityMatrix_shift_omp(input_data const &data, parameter const ¶ms, METHOD f);
//static vtr<double> similarity_shifts_omp(vtr3<double> const &input, parameter const ¶ms, FUNC f);
- static double dtw_shifted(input_data_single const &data, parameter const ¶ms, METHOD f);
+ static result_operation dtw_shift(input_data_single const &data, parameter const ¶ms, METHOD f);
static result_operation query_omp(input_data const &data, parameter const ¶ms, METHOD f);
diff --git a/SequenceComparison/parameter.cpp b/SequenceComparison/parameter.cpp
index 20bc60ab87d5a519c84a7259c94035d8fe232086..5307c3636298459cfa344cd08699fa6b5f64a3bf 100644
--- a/SequenceComparison/parameter.cpp
+++ b/SequenceComparison/parameter.cpp
@@ -144,13 +144,13 @@ void parameter::checkParameters(parameter const ¶ms, map<string, string> con
throw runtime_error("Invalid reduction setting");
}
- if (mapSetting.count("-type") > 0)
+ /*if (mapSetting.count("-type") > 0)
{
if (params.matrixDataType != "int" && params.matrixDataType != "float" && params.matrixDataType != "double")
{
throw runtime_error("Invalid data type for distance matrix");
}
- }
+ }*/
/*if (mapSetting.count("-gdf") > 0 && !fs::is_directory(help::stripFileNameFromPath(params.gdf)))
{
@@ -169,21 +169,21 @@ void parameter::checkParameters(parameter const ¶ms, map<string, string> con
if (params.distance == 4)
{
- if(mapSetting.count("-si") == 0 || !fs::exists(params.inKeyInput[0]))
+ if(mapSetting.count("-in2") == 0 || !fs::exists(params.inKeyInput[0]))
throw runtime_error("Invalid secondary input path.");
if(mapSetting.count("-query"))
- if (mapSetting.count("-sq") == 0 || !fs::exists(params.inKeyQuery[0]))
+ if (mapSetting.count("-query2") == 0 || !fs::exists(params.inKeyQuery[0]))
throw runtime_error("Invalid secondary query path.");
}
}
void parameter::checkUnknownParameters(vtr<string> const &args)
{
- vtr<string> switches = {"-m", "-in", "-out", "-gdf", "-reverse", "-type", "-pout", "-html", "-w", "-e", "-d",
- "-i", "-n", "-n01", "-omp", "-p", /*"-print",*/ "-smooth", "-c", "-time", "-paa", "-r", "-s",
+ vtr<string> switches = {"-m", "-in", "-out", "-gdf", "-reverse", "-pout", "-html", "-w", "-e", "-d",
+ "-i", "-n", "-n01", "-omp", "-p", /*"-print",*/ "-smooth", "-gt", "-time", "-paa", "-r", "-s", "-shift",
"-relax", "-sub", "-debug", "-op", "-query", "-recall", "-mem", "-block", "-simd", "-dist",
- "-lb", "-draw", "-pr", "-tresh", "-sax", "-si", "-sq", "-se", "-ram", "-exp", "-dmin"};
+ "-lb", "-draw", "-pr", "-tcsi", "-tt", "-ta", "-te", "-tl", "-sax", "-in2", "-query2", "-segment", "-local", "-ram", "-exp", "-dmin"};
for (size_t i = 0; i < args.size(); i++)
{
@@ -214,8 +214,8 @@ parameter parameter::useParameters(map<string, string> &mapSetting)
{
params.inPath = mapSetting.count("-in") > 0 ? help::split(mapSetting.at("-in"), ";") : params.inPath;
params.inQuery = mapSetting.count("-query") > 0 ? help::split(mapSetting.at("-query"), ";") : params.inQuery;
- params.inKeyInput = mapSetting.count("-si") > 0 ? help::split(mapSetting.at("-si"), ";") : params.inKeyInput;
- params.inKeyQuery = mapSetting.count("-sq") > 0 ? help::split(mapSetting.at("-sq"), ";") : params.inKeyQuery;
+ params.inKeyInput = mapSetting.count("-in2") > 0 ? help::split(mapSetting.at("-in2"), ";") : params.inKeyInput;
+ params.inKeyQuery = mapSetting.count("-query2") > 0 ? help::split(mapSetting.at("-query2"), ";") : params.inKeyQuery;
params.outputPath = mapSetting.count("-out") > 0 ? mapSetting.at("-out") : params.outputPath;
params.drawOut = mapSetting.count("-draw") > 0 ? mapSetting.at("-draw") : params.drawOut;
params.method = mapSetting.count("-m") > 0 ? mapSetting.at("-m") : params.method;
@@ -231,8 +231,8 @@ parameter parameter::useParameters(map<string, string> &mapSetting)
params.paa = mapSetting.count("-paa") > 0 ? stoi(mapSetting.at("-paa")) : params.paa;
params.sax = mapSetting.count("-sax") > 0 ? stoi(mapSetting.at("-sax")) : params.sax;
params.prolong = mapSetting.count("-pr") > 0 ? stoi(mapSetting.at("-pr")) : params.prolong;
- params.matrixDataType = mapSetting.count("-type") > 0 ? mapSetting.at("-type") : params.matrixDataType;
- params.inClusterPath = mapSetting.count("-c") > 0 ? mapSetting.at("-c") : "";
+ //params.matrixDataType = mapSetting.count("-type") > 0 ? mapSetting.at("-type") : params.matrixDataType;
+ params.inClusterPath = mapSetting.count("-gt") > 0 ? mapSetting.at("-gt") : "";
params.smooth = mapSetting.count("-smooth") > 0 ? stoi(mapSetting.at("-smooth")): 0;
params.subsequence = mapSetting.count("-sub") > 0 ? stod(mapSetting.at("-sub")) : params.subsequence;
//params.print = mapSetting.count("-print") > 0 ? mapSetting.at("-print") : params.print;
@@ -250,14 +250,20 @@ parameter parameter::useParameters(map<string, string> &mapSetting)
params.simd = mapSetting.count("-simd") > 0 ? true : false;
params.gdf = mapSetting.count("-gdf") > 0 ? true : false;
params.lowerBound = mapSetting.count("-lb") > 0 ? true : false;
- params.segmented = mapSetting.count("-se") > 0 ? stoi(mapSetting.at("-se")) : 0;
- params.treshold = mapSetting.count("-tresh") > 0 ? stod(mapSetting.at("-tresh")) : params.treshold;
+ params.segmented = mapSetting.count("-segment") > 0 ? stoi(mapSetting.at("-segment")) : 0;
+ params.treshold_csi = mapSetting.count("-tcsi") > 0 ? stod(mapSetting.at("-tcsi")) : params.treshold_csi;
+ params.treshold_t = mapSetting.count("-tt") > 0 ? stod(mapSetting.at("-tt")) : params.treshold_t;
+ params.treshold_a = mapSetting.count("-ta") > 0 ? stod(mapSetting.at("-ta")) : params.treshold_a;
+ params.treshold_e = mapSetting.count("-te") > 0 ? stod(mapSetting.at("-te")) : params.treshold_e;
+ params.treshold_l = mapSetting.count("-tl") > 0 ? stod(mapSetting.at("-tl")) : params.treshold_l;
params.ram = mapSetting.count("-ram") > 0 ? stoi(mapSetting.at("-ram")) : params.ram;
params.experiment = mapSetting.count("-exp") > 0 ? true : false;
params.drawMin = mapSetting.count("-dmin") > 0 ? true : false;
-
-
- if(mapSetting.count("-relax") > 0){
+ params.relax = mapSetting.count("-relax") > 0 ? stoi(mapSetting.at("-relax")) : 0;
+ params.localAlignment = mapSetting.count("-local") > 0 ? true : false;
+ params.shift = mapSetting.count("-shift") > 0 ? true : false;
+
+ /*if(mapSetting.count("-relax") > 0){
auto relaxVtr = help::split(mapSetting.at("-relax"), ";");
params.relax.start = stoi(relaxVtr[0]);
@@ -265,7 +271,7 @@ parameter parameter::useParameters(map<string, string> &mapSetting)
params.relax.end = stoi(relaxVtr[1]);
else
params.relax.end = stoi(relaxVtr[0]);
- }
+ }*/
}
return params;
@@ -411,7 +417,7 @@ bool parameter::isSecondaryInput() const
return false;
}
-void parameter::parameterPriority(vtr<string> &args, vtr<string> const &argsPriority)
+void parameter::applyParameter(vtr<string> &args, vtr<string> const &argsPriority)
{
for (size_t i = 2; i < argsPriority.size(); i++)
{
@@ -446,46 +452,50 @@ void parameter::parameterPriority(vtr<string> &args, vtr<string> const &argsPrio
void parameter::printHelp()
{
- cout << "I/O options" << endl;
- cout << "-in [input folder path, input file path] - should be possible to combine" << endl;
+ cout << "INPUT" << endl;
+ cout << "-in [input folder/file path[;input folder/file path[;ect.]]] - should be possible to combine" << endl;
+ cout << "-query [input folder/file path[;input folder/file path[;ect.]]] - should be possible to combine" << endl;
+ cout << "-in2 - secondary input path (alpha)" << endl;
+ cout << "-query2 - secondary query path (alpha)" << endl;
+ cout << "-gt [input file path] - ground truth input file path" << endl;
+ cout << "OUTPUT" << endl;
cout << "-out [output file path] - file name without ext (extern call not supported)" << endl;
- cout << "-gdf [gdf output file path] - file name without ext (extern call not supported)" << endl;
- cout << "-html [html output file path] - file name without ext (extern call nor supported)" << endl;
- cout << "-m [dtw, lcss(in work)] - Choose method." << endl;
- cout << "-w [size] - Set size of warping window (dtw)." << endl;
+ cout << "-draw [output file/folder path] - file or folder path for distance matrix graphic visualisation (folder - names are generated for all matrices, file - name is reused/overwriten) (extern call not supported)" << endl;
+ cout << "-gdf [output file path] - file name without ext (extern call not supported)" << endl;
+ cout << "-html [html output file path] - file name without ext (extern call not supported)" << endl;
+ cout << "RESULT options" << endl;
+ cout << "-m [dtw, lcss(in work)] - Choose method (default: dtw)." << endl;
+ cout << "-w [size] - Set size of warping window (dtw, default: 100)." << endl;
cout << "-e [size] - Set parameter epsilon (lcss)." << endl;
cout << "-d [size] - Set parameter delta (lcss)." << endl;
- cout << "RESULT options" << endl;
- cout << "-s [score type] - different score calculation (default: -s 1)" << endl;
- cout << "-s 1 = sqrt(path cost) - last cell in distance matrix" << endl;
- cout << "-s 2 = sqrt(path cost) / |path|" << endl;
- cout << "-s 3 = (|A|+|B|) / (|newA|+|newB|)" << endl;
- cout << "-s 4 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B))" << endl;
- cout << "-se 5 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
- cout << "-s 5 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
- cout << "-s 5 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
- cout << "-s 5 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
- cout << "-s 5 = sqrt(dtw(A,B)) / sqrt(dtvMax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
-
- cout << "-reverse - reverse result = 1 - results (" << endl;
- cout << "-p [precision] - Set floting point precision <0,10> for print." << endl;
+ cout << "-s [score type] - partially OBSOLETE (default: 1, use when you need out matrix file in specific -s)" << endl;
+ cout << "\t-s 1 = sqrt(path cost) - last cell in distance matrix" << endl;
+ cout << "\t-s 2 = sqrt(path cost) / |path|" << endl;
+ cout << "\t-s 3 = (|A|+|B|) / (|newA|+|newB|)" << endl;
+ cout << "\t-s 4 = sqrt(dtw(A,B)) / sqrt(dtwmax(A,B))" << endl;
+ cout << "\t-s 5 = sqrt(dtw(A,B)) / sqrt(dtwmax(A,B)) * (min(|A|,|B|) / max(|A|,|B|)" << endl;
+ cout << "-p [precision] - Set floting point precision <0,10> for print. (default: 3)" << endl;
+ cout << "-reverse - reverse result = 1 - result" << endl;
cout << "-op [op] - choose operation you want" << endl;
- cout << "-op 0 - pair method for 2 time series." << endl;
- cout << "-op 1 - similarity matrix between N sequence. (one input)" << endl;
- cout << "-op 2 - similarity matrix between N sequence. (query and input)" << endl;
- cout << "-op 3 - input clustering." << endl;
- cout << "-op 4 - query and input clustering." << endl;
- cout << "-op 5 - input shift clustering." << endl;
- cout << "-op 6 - query and input shift clustering." << endl;
+ cout << "\t-op 0 - pair method for 2 time series. (if folder as input it takes first 2 time series as input)" << endl;
+ cout << "\t-op 1 - similarity matrix between N sequence. (one input)" << endl;
+ cout << "\t-op 2 - similarity matrix between N sequence. (query and input)" << endl;
+ cout << "\t-op 3 - input clustering." << endl;
+ cout << "\t-op 4 - query and input clustering." << endl;
+ cout << "-shift - shifts dimensions of time series (alfa)." << endl;
cout << "PREPROCESING options" << endl;
cout << "-n [max value] - Sequence are normalized to <0,1> interval before analysation." << endl;
cout << "-i - Sequence are interpolated to the same length before analysation." << endl;
cout << "-r [skip] - skip = 2 will take every 2." << endl;
- cout << "-paa [size - number of neighbour elements to average] - Piecewise Aggregate Approximation." << endl;
+ cout << "-paa [size] - Piecewise Aggregate Approximation." << endl;
cout << "-smooth [size] - sequences are smoothed by moving window." << endl;
- cout << "-sax [levels] - sequences are preprocessed into number of classes" << endl;
- cout << "-pr [times] - insert mean of two neighbours data points in ts. times - number of repeats." << endl;
+ cout << "-sax [levels] - sequences are preprocessed into number of classes" << endl;
+ cout << "-pr [times] - length of sequence is multiplied (times=1;len=2*,times=2;len=4,times=3;len=8,ect.)." << endl;
cout << "OPTIMIZATION options" << endl;
cout << "-omp [threads] - Use parallel version of operaions." << endl;
- cout << "-type [type] - Data type which is used for distance matrix (int, float, double, byte). CAN CRASH if type is too small." << endl;
+ //cout << "-type [type] - Data type which is used for distance matrix (int, float, double, byte). CAN CRASH if type is too small." << endl;
+ cout << "-script [file path [additional swithes]] - path to script file, posible to use additional params which are applied to all script lines (overwrites same line params)." << endl;
+ cout << "IMPORTANT" << endl;
+ cout << "-help - print help (overides everything)" << endl;
+ cout << "note: order of switches is irelevant. (write them as they pop in your mind)" << endl;
}
\ No newline at end of file
diff --git a/SequenceComparison/parameter.h b/SequenceComparison/parameter.h
index e409ca46ca325336dade72e0a865005c8c5ec718..3f1c82d4cd99b1df2ccf3cea43e87551f1bd4693 100644
--- a/SequenceComparison/parameter.h
+++ b/SequenceComparison/parameter.h
@@ -2,19 +2,16 @@
#define PARAMETER_H
#include <chrono>
-#include <string>
-#include <vector>
#include <map>
#include "templates.h"
class parameter
{
public:
- // I/O
- std::vector<std::string> inPath; //input paths
- std::vector<std::string> inQuery; //query input paths
- std::vector<std::string> inKeyInput; //
- std::vector<std::string> inKeyQuery; //
+ vtr<std::string> inPath; //input paths
+ vtr<std::string> inQuery; //query input paths
+ vtr<std::string> inKeyInput; //
+ vtr<std::string> inKeyQuery; //
std::string inClusterPath; //path of cluster info file
std::string outputPath; //outpath path for log
std::string drawOut; //if true draw cost matrix and accumulated const matrix
@@ -31,7 +28,9 @@ public:
bool scoreReversed; //flag if score should be reversed from 0,1 to 1,0
bool lowerBound; //use lb_keogh for query operation (1,2)
bool drawMin; //draw minimals parts of matrix
+ bool localAlignment; //use local alignment (kocyan)
bool experiment; //run experimental code (development)
+ bool shift; //shift dimensions
std::string method; //method
@@ -50,7 +49,11 @@ public:
double delta; //time dilation - lcss
double epsilon; //size difference - lcss
double subsequence; //use subsequence alignment
- double treshold; //trehshold for csi distance
+ double treshold_csi; //trehshold for csi distance
+ double treshold_t; //total
+ double treshold_a; //average
+ double treshold_e; //max
+ double treshold_l; //len
//data preprocessing options
int reduce; //reduction of input data by omiting elements from sequence -r [2 - takes every second, 3 - every third elm removed]
@@ -60,27 +63,26 @@ public:
int prolong; //prolong sequence
int smooth; //smooth sequence by moving window averages
int recall; //frist top x
+ int relax;
+ //struct relax {
+ // int start;
+ // int end;
- struct relax {
- int start;
- int end;
+ // relax() : start(0), end(0) {};
- relax() : start(0), end(0) {};
-
- } relax; //size of relaxation (relaxation of endpoints)
+ //} relax; //size of relaxation (relaxation of endpoints)
//paralelisation options
int omp; //set number of threads for omp
int mpi; //setnubmber of nodes ?? for mpi NOT NOT IMPLEMENTED
parameter() :
- //inClusterPath(""), outputPath(""),
znormalize(), interpolate(), printOutput(), timeMeasure(), debugInfo(), gdf(), html(), memoization(), simd(),
- scoreReversed(), lowerBound(), drawMin(), experiment(),
+ scoreReversed(), lowerBound(), drawMin(), experiment(), shift(),
method("dtw"), operation(0), distance (1), scoreType(1), precision(3), block(0), segmented(0), ram(5000), matrixDataType("double"),
- w(1), delta(10), epsilon(0), subsequence(0), treshold(0.07),
+ w(1), delta(100000), epsilon(1), subsequence(0), treshold_csi(0.07), treshold_t(10), treshold_a(10), treshold_e(10),
reduce(0), normalize(-1), paa(1), sax(0), prolong(0), smooth(0), recall(10),
- relax(),
+ relax(0),
omp(1), mpi(1)
{};
@@ -93,7 +95,7 @@ public:
static std::string mapMultiParameter(vtr<std::string> const &args, int idx);
static void checkParameters(parameter const ¶ms, std::map<std::string, std::string> const &mapSetting);
static void checkUnknownParameters(vtr<std::string> const &args);
- static void parameterPriority(vtr<std::string> &args, vtr<std::string> const &argsPriority);
+ static void applyParameter(vtr<std::string> &args, vtr<std::string> const &argsPriority);
static void printHelp();
bool isClusters() const;
diff --git a/SequenceComparison/dataParser.cpp b/SequenceComparison/parser.cpp
similarity index 95%
rename from SequenceComparison/dataParser.cpp
rename to SequenceComparison/parser.cpp
index ac24a8f2e53019e0fbc064601987f61ec2b504a4..5a8338de61c44d4600f67f8489324ceff133a912 100644
--- a/SequenceComparison/dataParser.cpp
+++ b/SequenceComparison/parser.cpp
@@ -1,6 +1,6 @@
#include "stdafx.h"
-#include "dataParser.h"
+#include "parser.h"
#include <experimental/filesystem>
#include <fstream>
#include <omp.h>
@@ -9,7 +9,7 @@
using namespace std;
namespace fs = std::experimental::filesystem;
-vector<string> dataParser::getAllFileNames(vtr<string> const &paths)
+vector<string> parser::getAllFileNames(vtr<string> const &paths)
{
vector<string> files;
@@ -37,7 +37,7 @@ vector<string> dataParser::getAllFileNames(vtr<string> const &paths)
return files;
}
-vector<string> dataParser::getFolderFileNames(string const &folder)
+vector<string> parser::getFolderFileNames(string const &folder)
{
vector<string> files;
@@ -59,7 +59,7 @@ vector<string> dataParser::getFolderFileNames(string const &folder)
return files;
}
-vector<string> dataParser::readFileByLine(string const &path)
+vector<string> parser::readFileByLine(string const &path)
{
vector<string> input;
ifstream file(path);
@@ -96,7 +96,7 @@ vector<string> dataParser::readFileByLine(string const &path)
return input;
}
-vtr2<int> dataParser::parseIntByLine(vtr<string> const &input)
+vtr2<int> parser::parseIntByLine(vtr<string> const &input)
{
vtr2<int> parsed(input.size());
@@ -112,7 +112,7 @@ vtr2<int> dataParser::parseIntByLine(vtr<string> const &input)
return parsed;
}
-input_clusters dataParser::parseClusters(vtr<string> const &fileNames, string path, string delims)
+input_clusters parser::parseClusters(vtr<string> const &fileNames, string path, string delims)
{
input_clusters clusters;
map<string, int> nameToCluster;
@@ -136,7 +136,7 @@ input_clusters dataParser::parseClusters(vtr<string> const &fileNames, string pa
clusters.ids[(int)i + 1].name = file;
}
- auto lines = dataParser::readFileByLine(path);
+ auto lines = parser::readFileByLine(path);
if (fileNames.size() > 0)
{
for (size_t i = 0; i < lines.size(); i++)
diff --git a/SequenceComparison/dataParser.h b/SequenceComparison/parser.h
similarity index 95%
rename from SequenceComparison/dataParser.h
rename to SequenceComparison/parser.h
index 8e226880b763fde3ebb3951d122a786bf4473e50..7d04e789fcb9706cce85b3ba2acaf61696b080b0 100644
--- a/SequenceComparison/dataParser.h
+++ b/SequenceComparison/parser.h
@@ -1,13 +1,11 @@
-#ifndef DATAPARSER_H
-#define DATAPARSER_H
+#ifndef PARSER_H
+#define PARSER_H
#include "structs.h"
-#include <codecvt>
-#include <locale>
#include <fstream>
-#include <omp.h>
+#include "help.h"
-class dataParser
+class parser
{
public:
static vtr<std::string> getAllFileNames(vtr<std::string> const &paths);
@@ -117,4 +115,4 @@ public:
//static vtr2<double> parseRawDouble(std::string const &input);
};
-#endif //DATAPARSER_H
+#endif //PARSER_H
diff --git a/SequenceComparison/print.cpp b/SequenceComparison/print.cpp
index 3ea16e87fea013328575e9485b79085314c388d0..14e14685d6d88732ed9e1e96d8bbe8bb43053d28 100644
--- a/SequenceComparison/print.cpp
+++ b/SequenceComparison/print.cpp
@@ -12,7 +12,6 @@ using namespace std;
string print::elapsedTime(string const &flag, long long elapsed)
{
stringstream ss;
- //ss << flag + ": " << chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now() - point).count() << "ms";
ss << flag + ": " << elapsed << "ms";
return ss.str();
@@ -116,6 +115,33 @@ void print::write(vtr<string> const &output, string const &path)
f.close();
}
+string print::htmlDistanceMatrix(vtr2<node> const &m)
+{
+ std::stringstream ss;
+ ss << std::setprecision(0);
+
+ ss << "<style>table{border-collapse:collapse; font-family:times, serif, verdana;font-size:7pt;margin:0;padding:0;text-align:center;}";
+ ss << "td{margin:0;padding:0;overflow:hidden;border-right:1px solid black;;witdth:40px}</style>" << std::endl;
+
+ ss << "<table>" << std::endl;
+ for (size_t i = 1; i < m.size(); i++)
+ {
+ ss << "<tr>" << std::endl;
+ for (size_t j = 1; j < m[0].size(); j++)
+ {
+ ss << "<td style=\"";
+
+ ss << "background:rgb(255,255,255);";
+
+ ss << "\">" << std::fixed << m[i][j].value << "</td>";
+ }
+ ss << "</tr>" << std::endl;
+ }
+ ss << "</table>" << std::endl;
+
+ return ss.str();
+}
+
string print::gdf(vtr<string> const &files, vtr3<double> const &input, vtr2<double> const &sim, input_clusters const &clusters)
{
stringstream ss;
@@ -162,7 +188,8 @@ string print::gdf(vtr<string> const &files, vtr3<double> const &input, vtr2<doub
return ss.str();
}
-string print::matrix(vtr2<double> const &simM, parameter const ¶ms)
+template <typename T>
+string print::matrix(vtr2<T> const &simM, parameter const ¶ms)
{
std::stringstream stream;
@@ -183,22 +210,8 @@ string print::matrix(vtr2<double> const &simM, parameter const ¶ms)
return stream.str();
}
-
-string print::matrix(vtr2<int> const &simM, parameter const ¶ms)
-{
- std::stringstream stream;
-
- for (size_t i = 0; i < simM.size(); i++)
- {
- for (size_t j = 0; j < simM[i].size(); j++)
- {
- stream << setw(5) << simM[i][j];
- }
- stream << endl;
- }
-
- return stream.str();
-}
+template string print::matrix(vtr2<int> const &simM, parameter const ¶ms);
+template string print::matrix(vtr2<double> const &simM, parameter const ¶ms);
string print::tree(vtr<closest> const &tree)
{
@@ -253,18 +266,6 @@ string print::pathShape(string const &path, coords p, size_t lenA, size_t lenB)
return ss.str();
}
-void print::results(vtr2<double> const &matrix, vtr2<int> const &order, parameter const ¶ms)
-{/*
- if (params::isMeasure())
- {
- PrintMatrix(matrix, params);
- PrintMatrix(order, params);
- }
-
- if (params::isMeasure())
- cout << params.startStamp*/
-}
-
string print::htmlClusters(vtr3<double> const &input, vtr2<int> const &order, input_clusters const &clusters)
{
stringstream ss;
@@ -323,14 +324,7 @@ string print::colorString(size_t id)
"671190", "6B3A64", "F5E1FF", "FFA0F2", "CCAA35", "374527", "8BB400", "797868",
"C6005A", "3B000A", "C86240", "29607C", "402334", "7D5A44", "CCB87C", "B88183",
"AA5199", "B5D6C3", "A38469", "9F94F0", "A74571", "B894A6", "71BB8C", "00B433",
- "789EC9", "6D80BA", "953F00", "5EFF03", "E4FFFC", "1BE177", "BCB1E5", "76912F",
- "003109", "0060CD", "D20096", "895563", "29201D", "5B3213", "A76F42", "89412E",
- "1A3A2A", "494B5A", "A88C85", "F4ABAA", "A3F3AB", "00C6C8", "EA8B66", "958A9F",
- "BDC9D2", "9FA064", "BE4700", "658188", "83A485", "453C23", "47675D", "3A3F00",
- "061203", "DFFB71", "868E7E", "98D058", "6C8F7D", "D7BFC2", "3C3E6E", "D83D66",
- "2F5D9B", "6C5E46", "D25B88", "5B656C", "00B57F", "545C46", "866097", "365D25",
- "252F99", "00CCFF", "674E60", "FC009C", "92896B", "1E2324", "DEC9B2", "9D4948",
- "85ABB4", "342142", "D09685", "A4ACAC", "00FFFF", "AE9C86", "742A33", "0E72C5"
+ "789EC9", "6D80BA", "953F00", "5EFF03", "E4FFFC", "1BE177", "BCB1E5", "76912F"
};
//if (id == 1)
@@ -380,12 +374,12 @@ string print::parameterString(vtr<string> const ¶meters)
return ss.str();
}
-string print::scores_clustering(result_operation const &result)
+string print::scores_clustering(result_operation const &result, int precision)
{
stringstream ss;
- ss << setprecision(3);
- for (size_t i = 0; i < 5; i++)
+ ss.precision(precision);
+ for (size_t i = 0; i < result.matrixCluster.size(); i++)
{
ss << i << setw(11) << " recall:" << setw(7) << result.scoreMeanRecall[i] << " | ";
for(auto s : result.scoreRecalls[i])
@@ -471,5 +465,48 @@ string print::vector(vtr<string> const &vtr)
ss << x << endl;
}
+ return ss.str();
+}
+
+string print::distanceMatrix(vtr2<node> const &m)
+{
+ std::stringstream ss;
+ ss << std::setprecision(0);
+ for (size_t i = 1; i < m.size(); i++)
+ {
+ for (size_t j = 1; j < m[i].size(); j++)
+ {
+ ss << std::setw(4) << std::fixed << m[i][j].value;
+ }
+ ss << std::endl;
+ }
+ ss << std::endl;
+
+ return ss.str();
+}
+
+template<typename T>
+string print::vector(vtr<T> const &vector)
+{
+ std::stringstream ss;
+ for (auto v : vector)
+ ss << v << ", ";
+
+ ss << std::endl;
+
+ return ss.str();
+}
+template string print::vector(vtr<double> const &vector);
+
+template<typename T>
+string print::vector(vtr2<T> const &vector)
+{
+ std::stringstream ss;
+ for (auto v : vector)
+ for (auto d : v)
+ ss << d << ", ";
+
+ ss << std::endl;
+
return ss.str();
}
\ No newline at end of file
diff --git a/SequenceComparison/print.h b/SequenceComparison/print.h
index b884294046684b7a83fa922301367ce03fac8376..5f6cf5c281f16b163a743a75b62622e8f61769fa 100644
--- a/SequenceComparison/print.h
+++ b/SequenceComparison/print.h
@@ -16,70 +16,25 @@ public:
static std::string tseries(vtr2<double> const &input);
static std::string inputStats(vtr3<double> const &input, size_t howMany);
//Returns formated similarity matrix for print.
- static std::string matrix(vtr2<double> const &simMatrix, parameter const ¶ms);
- //Returns formated matrix for print.
- static std::string matrix(vtr2<int> const &simM, parameter const ¶ms);
+ template <typename T>
+ static std::string matrix(vtr2<T> const &simMatrix, parameter const ¶ms);
//Returns formated tree for pdtw method.
static std::string tree(vtr<closest> const &tree);
- template <class T>
- static std::string distanceMatrix(vtr2<node<T>> const &m)
- {
- std::stringstream ss;
- ss << std::setprecision(0);
- for (size_t i = 1; i < m.size(); i++)
- {
- for (size_t j = 1; j < m[i].size(); j++)
- {
- ss << std::setw(4) << std::fixed << m[i][j].value;
- }
- ss << std::endl;
- }
- ss << std::endl;
-
- return ss.str();
- }
+ static std::string distanceMatrix(vtr2<node> const &m);
static std::string pathShape(std::string const & path, coords p, size_t lenA, size_t lenB);
- //Prints results
- static void results(vtr2<double> const &matrix, vtr2<int> const &order, parameter const ¶ms);
-
static std::string htmlClusters(vtr3<double> const &input, vtr2<int> const &order, input_clusters const &clusters);
- template<class T>
- static std::string htmlDistanceMatrix(vtr2<node<T>> const &m)
- {
- std::stringstream ss;
- ss << std::setprecision(0);
-
- ss << "<style>table{border-collapse:collapse; font-family:times, serif, verdana;font-size:7pt;margin:0;padding:0;text-align:center;}";
- ss << "td{margin:0;padding:0;overflow:hidden;border-right:1px solid black;;witdth:40px}</style>" << std::endl;
-
- ss << "<table>" << std::endl;
- for (size_t i = 1; i < m.size(); i++)
- {
- ss << "<tr>" << std::endl;
- for (size_t j = 1; j < m[0].size(); j++)
- {
- ss << "<td style=\"";
-
- ss << "background:rgb(255,255,255);";
-
- ss << "\">" << std::fixed << m[i][j].value << "</td>";
- }
- ss << "</tr>" << std::endl;
- }
- ss << "</table>" << std::endl;
-
- return ss.str();
- }
+ static std::string htmlDistanceMatrix(vtr2<node> const &m);
static std::string parameterString(vtr<std::string> const & parameters);
- static std::string scores_clustering(result_operation const &result);
+ static std::string scores_clustering(result_operation const &result, int precision);
static std::string mapRatios(vtr<double> const &ratios);
+
//Writes data to a gdf file.
static std::string gdf(vtr<std::string> const &files, vtr3<double> const &input, vtr2<double> const &sim, input_clusters const &clusters);
@@ -94,30 +49,12 @@ public:
//Writes data to a file.
static void write(vtr<std::string> const &output, std::string const &path);
- template<class T = double>
- static std::string vectorT(vtr<T> const &vector)
- {
- std::stringstream ss;
- for (auto v : vector)
- ss << v << ", ";
-
- ss << std::endl;
-
- return ss.str();
- }
+ template<typename T = double>
+ static std::string vector(vtr<T> const &vector);
- template<class T = double>
- static std::string vectorT(vtr2<T> const &vector)
- {
- std::stringstream ss;
- for (auto v : vector)
- for (auto d : v)
- ss << d << ", ";
-
- ss << std::endl;
-
- return ss.str();
- }
+ template<typename T = double>
+ static std::string vector(vtr2<T> const &vector);
+
};
#endif //PRINT_H
\ No newline at end of file
diff --git a/SequenceComparison/structs.h b/SequenceComparison/structs.h
index 481759532a565b7333962488b541433c71827d59..9c6dc64c2b39e9a3dac8395837bbea0561980d13 100644
--- a/SequenceComparison/structs.h
+++ b/SequenceComparison/structs.h
@@ -3,15 +3,20 @@
#include <map>
#include "templates.h"
+#include "help.h"
#if defined (_MSC_VER)
+#pragma component(browser, off, references)
#pragma warning(push, 0)
+#pragma warning ( disable : 4504 )
#elif (__INTEL_COMPILER)
#pragma diagnostic push
#pragma warning ( disable : 61 )
#elif (__GNUC__)
-#pragma GCC diagnostic push
-#pragma warning ( disable : ALL_CODE_ANALYSIS_WARNINGS )
+//#pragma warning(push, 0)
+#pragma GCC system_header
+//#pragma GCC diagnostic ignored "-Wno-multichar"
+//#pragma warning ( disable : ALL_CODE_ANALYSIS_WARNINGS )
#endif
//#define cimg_use_png
@@ -20,10 +25,12 @@
#if defined (_MSC_VER)
#pragma warning(pop)
+#pragma component(browser, on, references)
#elif (__INTEL_COMPILER)
#pragma diagnostic pop
#elif (__GNUC__)
-#pragma GCC diagnostic pop
+//#pragma GCC diagnostic pop
+#pragma warning pop
#endif
const vtr2<bool> scaleChord{
@@ -88,9 +95,9 @@ enum eOperation {
op_similarityMatrix_two,
op_oneInput,
op_twoInput,
- op_segmented,
- op_oneInput_shift,
- op_twoInput_shift,
+ //op_segmented,
+ //op_oneInput_shift,
+ //op_twoInput_shift,
op_queryOne,
op_queryMulti,
op_dimSimilarityMatrix,
@@ -105,13 +112,12 @@ enum eMethod {
};
enum ePrint { similarityMatrixd = 1, timeElapsed, inputtt, pathShape};
-template<class T>
class node{
public:
- T value; //values in distance matrix are saved in float currently...will change if needed
+ double value; //values in distance matrix are saved in float currently...will change if needed
- node() : value(std::numeric_limits<T>::max()) {};
- node(T value) : value(value) {};
+ node() : value(std::numeric_limits<double>::max()) {};
+ node(double value) : value(value) {};
~node() {};
};
@@ -126,20 +132,68 @@ struct node2 {
~node2() {};
};
-struct tseries {
- vtr2<double> series;
+struct tserie {
+ vtr2<double> serie;
+
+ tserie(vtr<double> sequence)
+ {
+ serie.resize(sequence.size());
+ //serie = vtr2<double>(sequence.size());
+
+ for (int i = 0; i < sequence.size(); i++)
+ serie[i].push_back(sequence[i]);
+ }
+
+ tserie(vtr2<double> const &sequence)
+ {
+ serie = sequence;
+ }
+
+ tserie(std::string const &sequence)
+ {
+ auto splits = help::split(sequence, ",");
+ serie.resize(splits.size());
+ //serie = vtr2<double>(splits.size());
+
+ for (int i = 0; i < splits.size(); i++)
+ serie[i].push_back(stod(splits[i]));
+ }
size_t size() const
{
- return series.size();
+ return serie.size();
+ }
+
+ size_t dims() const
+ {
+ return serie[0].size();
}
- size_t dims()
+ const vtr<double>& operator[](size_t i) const
{
- return series[0].size();
+ return serie[i];
}
+
+ vtr<double>& operator[](size_t i)
+ {
+ return serie[i];
+ }
+
+ bool operator==(tserie const &ts) const
+ {
+ if (serie == ts.serie)
+ return true;
+
+ return false;
+ }
+
+ bool operator!=(tserie const &ts) const
+ {
+ if (serie != ts.serie)
+ return true;
- vtr<double> operator[](size_t i) const { return series[i]; }
+ return false;
+ }
};
struct result_time
@@ -188,18 +242,46 @@ struct couple2 {
struct result_path
{
std::string path; //path
- int pathSize = 0;
+ vtr<coords> pathCoords;
+ vtr<double> values;
+
double scoreRaw = 0;
//double pathSum = 0;
- coords wpStart;
- coords wpEnd;
+ coords start;
+ coords end;
+
+ vtr<coords> convert_toCoords() const
+ {
+ vtr<coords> pathCoords(path.size());
+
+ int row = -1, col = -1;
+ for (size_t i = 0; i < path.size(); i++)
+ {
+ if (path[i] == 'M' || path[i] == 'S') {
+ row++;
+ col++;
+ }
+ else if (path[i] == 'L')
+ col++;
+ else if (path[i] == 'U')
+ row++;
+
+ pathCoords[i] = coords(row + 1, col + 1); //x,y(i,j)
+ }
+
+ return pathCoords;
+ }
+
};
struct range {
int start = 0;
int end = 0;
+ range() {}
+ range(int s, int e) : start(s), end(e) {}
+
size_t size()
{
return end - start + 1;
@@ -344,10 +426,16 @@ struct input_method {
};
struct input_info {
- std::string nameA;
- std::string nameB;
size_t idxA;
size_t idxB;
+ std::string nameA;
+ std::string nameB;
+
+ input_info() {};
+ input_info(size_t idxA_p, size_t idxB_p) {
+ idxA = idxA_p;
+ idxB = idxB_p;
+ };
};
//struct input_me2thod {
@@ -417,20 +505,35 @@ struct result_method {
vtr<short> img;
};
+struct matrix_cluster
+{
+ vtr3<int> matrix;
+
+ matrix_cluster(int cols, int rows)
+ {
+ /*for (int j = 0; j < ; j++)
+ {
+ for (int k = 0; k < (int)data.input.size(); k++)
+ {
+ idxs[i][j][k] = k + 1;
+ }
+ }*/
+ }
+};
+
struct result_operation
{
vtr3<double> matrixSimilarity;
vtr3<int> matrixCluster;
- vtr2<double> scoreAveragePrecisions = vtr2<double>(5);
- vtr2<double> scoreAverageRanks = vtr2<double>(5);
- vtr2<double> scorePrecisions = vtr2<double>(5);
- vtr2<double> scoreRecalls = vtr2<double>(5);
- //vtr<double> scoresMethod(5);
- vtr<double> scoreMap = vtr<double>(5);
- vtr<double> scoreMeanAverageRank = vtr<double>(5);
- vtr<double> scoreMeanPrecision = vtr<double>(5);
- vtr<double> scoreMeanRecall = vtr<double>(5);
- vtr<double> scoreMethod = vtr<double>(5);
+ vtr2<double> scoreAveragePrecisions;
+ vtr2<double> scoreAverageRanks;
+ vtr2<double> scorePrecisions;
+ vtr2<double> scoreRecalls;
+ vtr<double> scoreMap;
+ vtr<double> scoreMeanAverageRank;
+ vtr<double> scoreMeanPrecision;
+ vtr<double> scoreMeanRecall;
+ vtr<double> scoreMethod;
//void calculScores(input_data data, bool scoreReversed)
//{
@@ -445,9 +548,25 @@ struct result_operation
// }
//}
+ void init_clusterMatrix(size_t depth)
+ {
+ matrixCluster = help::vtr_init<int>(matrixSimilarity.size(), matrixSimilarity[0].size(), matrixSimilarity[0][0].size());
+
+ for (size_t i = 0; i < matrixSimilarity.size(); i++)
+ {
+ for (int j = 0; j < matrixSimilarity[0].size(); j++)
+ {
+ for (int k = 0; k < matrixSimilarity[0][0].size(); k++)
+ {
+ matrixCluster[i][j][k] = j + 1;
+ }
+ }
+ }
+ }
+
void calculMeanScore()
{
- for (size_t i = 0; i < 5; i++)
+ for (size_t i = 0; i < scoreMap.size(); i++)
{
scoreMap[i] = accumulate(scoreAveragePrecisions[i].begin(), scoreAveragePrecisions[i].end(), 0.0) / scoreAveragePrecisions[i].size();
scoreMeanAverageRank[i] = accumulate(scoreAverageRanks[i].begin(), scoreAverageRanks[i].end(), 0.0) / scoreAverageRanks[i].size();
@@ -455,6 +574,19 @@ struct result_operation
scoreMeanRecall[i] = accumulate(scoreRecalls[i].begin(), scoreRecalls[i].end(), 0.0) / scoreRecalls[i].size();
}
}
+
+ void allocate(size_t size)
+ {
+ scoreAveragePrecisions = vtr2<double>(size);
+ scoreAverageRanks = vtr2<double>(size);
+ scorePrecisions = vtr2<double>(size);
+ scoreRecalls = vtr2<double>(size);
+ scoreMap = vtr<double>(size);
+ scoreMeanAverageRank = vtr<double>(size);
+ scoreMeanPrecision = vtr<double>(size);
+ scoreMeanRecall = vtr<double>(size);
+ //scoreMethod = vtr<double>(size);
+ }
};
struct result_operationbb
@@ -494,21 +626,4 @@ struct result_operationbb
}
};
-struct ngramnode {
- vtr<double> _node;
- vtr<ngramnode> childs;
-
- ngramnode() {};
- ngramnode(vtr<double> node)
- {
- _node = node;
- }
-
- void add(vtr<double> &node)
- {
- ngramnode child(node);
- childs.push_back(child);
- }
-};
-
#endif //STRUCTS_H
diff --git a/SequenceComparison/templates.h b/SequenceComparison/templates.h
index 2c3e98f0e2d24e02304b69a7958e4c41e759ab2b..0e7267f4c1c285e8addaef0307e54ff2bae1189a 100644
--- a/SequenceComparison/templates.h
+++ b/SequenceComparison/templates.h
@@ -17,11 +17,11 @@
struct constant {
static constexpr int MAX_int = std::numeric_limits<int>::max();
- static constexpr int MIN_int = std::numeric_limits<int>::min();
+ static constexpr int MIN_int = std::numeric_limits<int>::lowest();
static constexpr double MAX_double = std::numeric_limits<double>::max();
- static constexpr double MIN_double = std::numeric_limits<double>::min();
+ static constexpr double MIN_double = std::numeric_limits<double>::lowest();
static constexpr float MAX_float = std::numeric_limits<float>::max();
- static constexpr float MIN_float = std::numeric_limits<float>::min();
+ static constexpr float MIN_float = std::numeric_limits<float>::lowest();
/*template <class T>
static constexpr T MAX_T = std::numeric_limits<T>::max();
diff --git a/unit/unit.vcxproj b/unit/unit.vcxproj
new file mode 100644
index 0000000000000000000000000000000000000000..6e610d732c6f81e7bf36faf999e94de8066a72b2
--- /dev/null
+++ b/unit/unit.vcxproj
@@ -0,0 +1,127 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+ <ItemGroup Label="ProjectConfigurations">
+ <ProjectConfiguration Include="Debug|Win32">
+ <Configuration>Debug</Configuration>
+ <Platform>Win32</Platform>
+ </ProjectConfiguration>
+ <ProjectConfiguration Include="Release|Win32">
+ <Configuration>Release</Configuration>
+ <Platform>Win32</Platform>
+ </ProjectConfiguration>
+ <ProjectConfiguration Include="Debug|x64">
+ <Configuration>Debug</Configuration>
+ <Platform>x64</Platform>
+ </ProjectConfiguration>
+ <ProjectConfiguration Include="Release|x64">
+ <Configuration>Release</Configuration>
+ <Platform>x64</Platform>
+ </ProjectConfiguration>
+ </ItemGroup>
+ <PropertyGroup Label="Globals">
+ <VCProjectVersion>15.0</VCProjectVersion>
+ <ProjectGuid>{751DD303-54B9-468C-816F-646EA93E6E93}</ProjectGuid>
+ <RootNamespace>unit</RootNamespace>
+ <WindowsTargetPlatformVersion>10.0.15063.0</WindowsTargetPlatformVersion>
+ </PropertyGroup>
+ <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+ <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+ <ConfigurationType>Application</ConfigurationType>
+ <UseDebugLibraries>true</UseDebugLibraries>
+ <PlatformToolset>v141</PlatformToolset>
+ <CharacterSet>MultiByte</CharacterSet>
+ </PropertyGroup>
+ <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+ <ConfigurationType>Application</ConfigurationType>
+ <UseDebugLibraries>false</UseDebugLibraries>
+ <PlatformToolset>v141</PlatformToolset>
+ <WholeProgramOptimization>true</WholeProgramOptimization>
+ <CharacterSet>MultiByte</CharacterSet>
+ </PropertyGroup>
+ <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+ <ConfigurationType>Application</ConfigurationType>
+ <UseDebugLibraries>true</UseDebugLibraries>
+ <PlatformToolset>v141</PlatformToolset>
+ <CharacterSet>MultiByte</CharacterSet>
+ </PropertyGroup>
+ <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+ <ConfigurationType>Application</ConfigurationType>
+ <UseDebugLibraries>false</UseDebugLibraries>
+ <PlatformToolset>v141</PlatformToolset>
+ <WholeProgramOptimization>true</WholeProgramOptimization>
+ <CharacterSet>MultiByte</CharacterSet>
+ </PropertyGroup>
+ <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+ <ImportGroup Label="ExtensionSettings">
+ </ImportGroup>
+ <ImportGroup Label="Shared">
+ <Import Project="..\SequenceComparison\SequenceComparison.vcxitems" Label="Shared" />
+ </ImportGroup>
+ <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+ <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+ </ImportGroup>
+ <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+ <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+ </ImportGroup>
+ <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+ <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+ </ImportGroup>
+ <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+ <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+ </ImportGroup>
+ <PropertyGroup Label="UserMacros" />
+ <PropertyGroup />
+ <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+ <ClCompile>
+ <WarningLevel>Level3</WarningLevel>
+ <Optimization>MaxSpeed</Optimization>
+ <FunctionLevelLinking>true</FunctionLevelLinking>
+ <IntrinsicFunctions>true</IntrinsicFunctions>
+ <SDLCheck>true</SDLCheck>
+ </ClCompile>
+ <Link>
+ <EnableCOMDATFolding>true</EnableCOMDATFolding>
+ <OptimizeReferences>true</OptimizeReferences>
+ </Link>
+ </ItemDefinitionGroup>
+ <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+ <ClCompile>
+ <WarningLevel>Level3</WarningLevel>
+ <Optimization>Disabled</Optimization>
+ <SDLCheck>true</SDLCheck>
+ </ClCompile>
+ </ItemDefinitionGroup>
+ <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+ <ClCompile>
+ <WarningLevel>Level3</WarningLevel>
+ <Optimization>Disabled</Optimization>
+ <SDLCheck>true</SDLCheck>
+ <LanguageStandard>stdcpp17</LanguageStandard>
+ </ClCompile>
+ </ItemDefinitionGroup>
+ <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+ <ClCompile>
+ <WarningLevel>Level3</WarningLevel>
+ <Optimization>MaxSpeed</Optimization>
+ <FunctionLevelLinking>true</FunctionLevelLinking>
+ <IntrinsicFunctions>true</IntrinsicFunctions>
+ <SDLCheck>true</SDLCheck>
+ </ClCompile>
+ <Link>
+ <EnableCOMDATFolding>true</EnableCOMDATFolding>
+ <OptimizeReferences>true</OptimizeReferences>
+ </Link>
+ </ItemDefinitionGroup>
+ <ItemGroup>
+ <ClCompile Include="unitmain.cpp" />
+ <ClCompile Include="ut_dtw.cpp" />
+ <ClCompile Include="ut_help.cpp" />
+ <ClCompile Include="ut_op.cpp" />
+ </ItemGroup>
+ <ItemGroup>
+ <ClInclude Include="ut_help.h" />
+ </ItemGroup>
+ <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+ <ImportGroup Label="ExtensionTargets">
+ </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/unit/unit.vcxproj.filters b/unit/unit.vcxproj.filters
new file mode 100644
index 0000000000000000000000000000000000000000..2f27c25b8e4a5c25dcbd62b6a082743433da35ac
--- /dev/null
+++ b/unit/unit.vcxproj.filters
@@ -0,0 +1,36 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+ <ItemGroup>
+ <Filter Include="Source Files">
+ <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+ <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+ </Filter>
+ <Filter Include="Header Files">
+ <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+ <Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
+ </Filter>
+ <Filter Include="Resource Files">
+ <UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
+ <Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
+ </Filter>
+ </ItemGroup>
+ <ItemGroup>
+ <ClCompile Include="ut_dtw.cpp">
+ <Filter>Source Files</Filter>
+ </ClCompile>
+ <ClCompile Include="unitmain.cpp">
+ <Filter>Source Files</Filter>
+ </ClCompile>
+ <ClCompile Include="ut_op.cpp">
+ <Filter>Source Files</Filter>
+ </ClCompile>
+ <ClCompile Include="ut_help.cpp">
+ <Filter>Source Files</Filter>
+ </ClCompile>
+ </ItemGroup>
+ <ItemGroup>
+ <ClInclude Include="ut_help.h">
+ <Filter>Header Files</Filter>
+ </ClInclude>
+ </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/unit/unitmain.cpp b/unit/unitmain.cpp
new file mode 100644
index 0000000000000000000000000000000000000000..b87a1386187294acaa9d761bfaf9f2aa54d1e4f9
--- /dev/null
+++ b/unit/unitmain.cpp
@@ -0,0 +1,32 @@
+#//define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN //when not using custom main
+#define DOCTEST_CONFIG_IMPLEMENT
+#include "doctest.h"
+
+using namespace std;
+
+int main(int argc, char** argv) {
+ doctest::Context context;
+
+ context.addFilter("test-case-exclude", "*SIMD*"); //filter // exclude test cases with "SIMD" in their name
+ //context.setOption("abort-after", 5); // stop test execution after 5 failed assertions
+ //context.setOption("order-by", "name"); // sort the test cases by their name
+
+ context.applyCommandLine(argc, argv);
+
+ context.setOption("no-breaks", true); // don't break in the debugger when assertions fail
+ context.setOption("exit", false);
+ context.setOption("duration", true);
+
+
+ int result = context.run(); // run
+
+ if (context.shouldExit()) // important - query flags (and --exit) rely on the user doing this
+ return result; // propagate the result of the tests
+
+ //int client_stuff_return_code = 0;
+ // your program - if the testing framework is integrated in your production code
+
+ return result; // +client_stuff_return_code; // the result from doctest is propagated here as well
+}
+
+
diff --git a/unit/ut_dtw.cpp b/unit/ut_dtw.cpp
new file mode 100644
index 0000000000000000000000000000000000000000..6653c7b0c52c51598486d98f1bb7d89cd2fdc355
--- /dev/null
+++ b/unit/ut_dtw.cpp
@@ -0,0 +1,417 @@
+#include "doctest.h"
+
+#include "structs.h"
+#include "parameter.h"
+#include "help.h"
+#include "dtw.h"
+#include "calcul.h"
+
+TEST_CASE("score types zero equality")
+{
+ const int N = 111;
+ auto A = help::random_sequence(N, 2, 0, 17);
+ auto B(A);
+
+ parameter params;
+ params.scoreType = 1;
+
+ input_method input(A, B);
+ input_info info;
+
+ auto result = dtw::main(input, info, params);
+
+ CHECK(0.0 == result[0]);
+ CHECK(0.0 == result[1]);
+ CHECK(0.0 == result[2]);
+ CHECK(0.0 == result[3]);
+ CHECK(0.0 == result[4]);
+}
+
+TEST_CASE("DTW: length score difference 1")
+{
+ const int N = 111;
+ auto A = help::random_sequence(N, 2, 0, 17);
+ auto B = help::random_sequence(N, 2, 0, 333);
+
+ vtr<double> end;
+ end.push_back(1);
+ end.push_back(0.11);
+ B.push_back(end);
+
+ parameter params;
+ params.scoreType = 1;
+
+ input_method input(A, B);
+ input_info info;
+
+ auto result = dtw::main(input, info, params);
+ CHECK(0.0 != result[0]);
+ CHECK(0.0 != result[1]);
+ CHECK(0.0 != result[2]);
+ CHECK(0.0 != result[3]);
+ CHECK(0.0 != result[4]);
+}
+
+TEST_CASE("DTW: length score difference 2")
+{
+ const int N = 111;
+ vtr2<double> A;
+ vtr2<double> B;
+
+ for (size_t i = 0; i < N; i++)
+ {
+ vtr<double> point(2);
+ point[0] = 1;
+ point[1] = 1;
+ A.push_back(point);
+ B.push_back(point);
+ }
+ vtr<double> end;
+ end.push_back(1);
+ end.push_back(1);
+ B.push_back(end);
+
+ parameter params;
+ params.scoreType = 1;
+
+
+ input_method input(A, B);
+ input_info info;
+ //equal even when diff len (when same data)
+ auto result = dtw::main(input, info, params);
+ CHECK(0.0 == result[0]);
+ CHECK(0.0 == result[1]);
+ CHECK(0.0 != result[2]);
+ CHECK(0.0 != result[3]);
+ CHECK(0.0 != result[4]);
+}
+
+TEST_CASE("DTW: warping equality")
+{
+ vtr2<double> A;
+ vtr2<double> B;
+
+ for (size_t i = 0; i < 9; i++)
+ {
+ vtr<double> point(1);
+ A.push_back(point);
+ }
+
+ A[0][0] = 7;
+ A[1][0] = 9;
+ A[2][0] = 5;
+ A[3][0] = 5;
+ A[4][0] = 3;
+ A[5][0] = 3;
+ A[6][0] = 6;
+ A[7][0] = 9;
+ A[8][0] = 4;
+
+ for (size_t i = 0; i < 11; i++)
+ {
+ vtr<double> point(1);
+ B.push_back(point);
+ }
+
+ B[0][0] = 4;
+ B[1][0] = 1;
+ B[2][0] = 0;
+ B[3][0] = 0;
+ B[4][0] = 8;
+ B[5][0] = 3;
+ B[6][0] = 8;
+ B[7][0] = 9;
+ B[8][0] = 7;
+ B[9][0] = 5;
+ B[10][0] = 4;
+
+ parameter params;
+ DISTANCE f_distance;
+ f_distance.classic = calcul::distance_dtw_euklid;
+
+ input_method input(A, B);
+ input_info info;
+
+ auto wp = dtw::alignment(input, info, f_distance, params);
+
+ CHECK("MUUUMLMMLMLLML" == wp.path);
+}
+
+/*TEST_METHOD(dtw_matrix_noAccumulation)
+{
+const int N = 111;
+vtr2<double> A;
+vtr2<double> B;
+
+for (size_t i = 0; i < N; i++)
+{
+vtr<double> point(2);
+point[0] = help::random_real(2, 17);
+point[1] = help::random_real(1, 333);
+A.push_back(point);
+vtr<double> point2(2);
+point2[0] = help::random_real(21, 54);
+point2[1] = help::random_real(1, 333);
+B.push_back(point2);
+}
+
+parameter params;
+auto m = dtw::createMatrix_noAccumulation<double>(A, B, params);
+
+bool check = true;
+
+for (size_t i = 1; i < A.size() + 1; i++)
+{
+for (size_t j = 1; j < B.size() + 1; j++)
+{
+if (m[i][j].value == 0.0) {
+check = false;
+break;
+}
+}
+}
+
+Assert::AreEqual(true, check);
+}*/
+
+TEST_CASE("OP: dtw normal & parallel equality")
+{
+ const int N = 111;
+ vtr2<double> A;
+ vtr2<double> B;
+
+ for (size_t i = 0; i < N; i++)
+ {
+ vtr<double> point(2);
+ point[0] = help::random_real(0, 7);
+ point[1] = help::random_real(5, 17);
+ A.push_back(point);
+ point[0] = help::random_real(0, 7);
+ point[1] = help::random_real(5, 17);
+ B.push_back(point);
+ }
+
+ parameter paramsA, paramsB;
+
+ paramsB.omp = 4;
+
+ input_method input(A, B);
+ input_info info;
+
+ auto rA = dtw::main(input, info, paramsA);
+ auto rB = dtw::main(input, info, paramsB);
+ CHECK(rA[0] == rB[0]);
+ CHECK(rA[1] == rB[1]);
+ CHECK(rA[2] == rB[2]);
+ CHECK(rA[3] == rB[3]);
+ CHECK(rA[4] == rB[4]);
+}
+
+//TEST_CASE("dtw_matrix_variations_equality")
+//{
+// const int N = 113;
+// vtr2<double> A;
+// vtr2<double> B;
+//
+// for (size_t i = 0; i < N; i++)
+// {
+// vtr<double> point(2);
+// point[0] = help::random_real(0, 7);
+// point[1] = help::random_real(5, 17);
+// A.push_back(point);
+// point[0] = help::random_real(0, 7);
+// point[1] = help::random_real(5, 17);
+// B.push_back(point);
+// }
+//
+// parameter paramsA, paramsB;
+//
+// paramsA.omp = 4;
+// paramsA.scoreType = 3;
+//
+// input_method input(A, B);
+// input_info info;
+//
+// auto r = dtw::main(input, info, paramsA);
+//
+// paramsA.memoization = true;
+// auto rMem = dtw::main(input, info, paramsA);
+//
+// paramsA.memoization = false;
+// paramsA.simd = true;
+// auto rSimd = dtw::main(input, info, paramsA);
+//
+// //paramsA.simd = false;
+// //paramsA.tilted = true;
+// //rSimd = dtw::main(A, B, paramsA);
+//
+// CHECK(r[0] == rMem[0]); /* && rSimd == rTilted*/
+// CHECK(r[1] == rMem[1]); /* && rSimd == rTilted*/
+// CHECK(r[2] == rMem[2]); /* && rSimd == rTilted*/
+// CHECK(r[3] == rMem[3]); /* && rSimd == rTilted*/
+// CHECK(r[4] == rMem[4]); /* && rSimd == rTilted*/
+//
+// CHECK(rMem[0] == rSimd[0]);
+// CHECK(rMem[1] == rSimd[1]);
+// CHECK(rMem[2] == rSimd[2]);
+// CHECK(rMem[3] == rSimd[3]);
+// CHECK(rMem[4] == rSimd[4]);
+//}
+
+TEST_CASE("DTW: matrix variations, distance equality (SIMD)")
+{
+ const int N = 7;
+ vtr<double> A(N);
+ vtr<double> B(N);
+
+ for (size_t i = 0; i < N; i++)
+ {
+ vtr<double> point(2);
+ A[i] = help::random_real(0, 7);
+ B[i] = help::random_real(0, 7);
+ }
+
+ double r1 = calcul::distance_dtw_euklid(A, B);
+ double r2 = calcul::distance_dtw_simd(A, B, N / 4, N % 4);
+
+ //double err = ;
+
+ CHECK(std::abs(r1 - r2) < 0.0000000000001);
+}
+
+TEST_CASE("DTW: no accumulation, diagonal zero check")
+{
+ const int N = 111;
+ vtr2<double> A;
+ vtr2<double> B;
+
+ for (size_t i = 0; i < N; i++)
+ {
+ vtr<double> point(2);
+ point[0] = help::random_real(0, 17);
+ point[1] = help::random_real(0, 333);
+ A.push_back(point);
+ B.push_back(point);
+ }
+
+ vtr2<node> m;
+ auto l_diagonalCheck = [&m]() -> bool {
+ for (size_t i = 0; i < m.size(); i++)
+ {
+ if (m[i][i].value != 0)
+ return false;
+ }
+
+ return true;
+ };
+
+ input_method input(A, B);
+ input_info info;
+ parameter p;
+ DISTANCE d;
+ d.classic = calcul::distance_dtw_euklid;
+
+ p.scoreType = 1;
+ m = dtw::matrix_noaccumulation(input, d, p);
+ bool check = l_diagonalCheck();
+ CHECK(check);
+
+ p.scoreType = 2;
+ m = dtw::matrix_noaccumulation(input, d, p);
+ check = l_diagonalCheck();
+ CHECK(check);
+
+ p.scoreType = 3;
+ m = dtw::matrix_noaccumulation(input, d, p);
+ check = l_diagonalCheck();
+ CHECK(check);
+
+ p.scoreType = 4;
+ m = dtw::matrix_noaccumulation(input, d, p);
+ check = l_diagonalCheck();
+ CHECK(check);
+
+ p.scoreType = 5;
+ m = dtw::matrix_noaccumulation(input, d, p);
+ check = l_diagonalCheck();
+ CHECK(check);
+}
+
+TEST_CASE("DTW: accumulated & no accumulation equality")
+{
+ const int N = 111;
+ vtr2<double> A;
+ vtr2<double> B;
+
+ for (size_t i = 0; i < N; i++)
+ {
+ vtr<double> point(2);
+ point[0] = help::random_real(0, 7);
+ point[1] = help::random_real(5, 17);
+ A.push_back(point);
+ point[0] = help::random_real(0, 7);
+ point[1] = help::random_real(5, 17);
+ B.push_back(point);
+ }
+
+ input_method input(A, B);
+ input_info info;
+ parameter p;
+
+ p.operation = 0;
+ auto r1 = dtw::main(input, info, p);
+
+ p.localAlignment = true;
+ auto r2 = dtw::main(input, info, p);
+
+ if (r1 == r2)
+ CHECK(true);
+}
+
+TEST_CASE("precision")
+{
+ vtr<double> values = { 3,2,5,6,3,2,2,1,2,7,2,6,3,2,4,2,4 };
+
+ double precision = 0;
+ int c = 0;
+ for (size_t i = 0; i < values.size(); i++)
+ {
+ if (values[i] == 2)
+ precision += ++c / (double)(i + 1);
+ }
+
+ precision = precision / c;
+
+ CHECK(0.43242372706658416 == precision);
+}
+
+TEST_CASE("lower bound: keogh")
+{
+ auto A = help::random_sequence(111, 1, 0, 9);
+ auto B = help::random_sequence(111, 1, 0, 9);
+ parameter p;
+ p.w = 4;
+
+ double result = calcul::lb_keogh(A, B, p);
+
+ CHECK(result > 0);
+}
+
+TEST_CASE("lower bound: keogh zero check")
+{
+ auto A = help::random_sequence(111, 1, 0, 9);
+ auto B = help::random_sequence(111, 1, 0, 9);
+
+ for (size_t i = 0; i < A.size(); i++)
+ {
+ A[i][0] = 7;
+ B[i][0] = 7;
+ }
+
+ parameter p;
+ p.w = 5;
+
+ double result = calcul::lb_keogh(A, B, p);
+
+ CHECK(result == 0);
+}
\ No newline at end of file
diff --git a/unit/ut_help.cpp b/unit/ut_help.cpp
new file mode 100644
index 0000000000000000000000000000000000000000..b976515018e2af3377cf47c82b42e165fe70fd17
--- /dev/null
+++ b/unit/ut_help.cpp
@@ -0,0 +1,50 @@
+#include "ut_help.h"
+
+using namespace std;
+
+bool ut_help::vtr_equal(vtr<double> const &vtrA, vtr<double> const &vtrB, double epsilon)
+{
+ if (vtrA.size() != vtrB.size())
+ {
+ cout << "1d: " << vtrA.size() << ", " << vtrB.size() << ", ";
+ return false;
+ }
+
+ for (size_t i = 0; i < vtrA.size(); i++)
+ if (fabs(vtrA[i] - vtrB[i]) > epsilon) {
+ cout << i << ": " << vtrA[i] << ", " << vtrB[i] << endl;
+ return false;
+ }
+
+ return true;
+}
+
+bool ut_help::vtr_equal(vtr2<double> const &vtrA, vtr2<double> const &vtrB, double epsilon)
+{
+ if (vtrA.size() != vtrB.size())
+ {
+ cout << "2d: " << vtrA.size() << ", " << vtrB.size() << ", ";
+ return false;
+ }
+
+ for (size_t i = 0; i < vtrA.size(); i++)
+ if (vtr_equal(vtrA[i], vtrB[i], epsilon) == false)
+ return false;
+
+ return true;
+}
+
+bool ut_help::vtr_equal(vtr3<double> const &vtrA, vtr3<double> const &vtrB, double epsilon)
+{
+ if (vtrA.size() != vtrB.size())
+ {
+ cout << "3d: " << vtrA.size() << ", " << vtrB.size() << ", ";
+ return false;
+ }
+
+ for (size_t i = 0; i < vtrA.size(); i++)
+ if (vtr_equal(vtrA[i], vtrB[i], epsilon) == false)
+ return false;
+
+ return true;
+}
diff --git a/unit/ut_help.h b/unit/ut_help.h
new file mode 100644
index 0000000000000000000000000000000000000000..b1bec2f772d96705d0adab436ffb8b72d88d9225
--- /dev/null
+++ b/unit/ut_help.h
@@ -0,0 +1,14 @@
+#ifndef UTHELP_H
+#define UTHELP_H
+
+#include "templates.h"
+
+class ut_help
+{
+public:
+ static bool vtr_equal(vtr<double> const &vtrA, vtr<double> const &vtrB, double epsilon);
+ static bool vtr_equal(vtr2<double> const &vtrA, vtr2<double> const &vtrB, double epsilon);
+ static bool vtr_equal(vtr3<double> const &vtrA, vtr3<double> const &vtrB, double epsilon);
+};
+
+#endif //UTHELP_H
diff --git a/unit/ut_op.cpp b/unit/ut_op.cpp
new file mode 100644
index 0000000000000000000000000000000000000000..c3c712a97759257d667ac3bd2e692ff4a8196b7d
--- /dev/null
+++ b/unit/ut_op.cpp
@@ -0,0 +1,192 @@
+#include "doctest.h"
+
+#include "structs.h"
+#include "parameter.h"
+#include "help.h"
+#include "dtw.h"
+#include "calcul.h"
+#include "mains.h"
+#include "ut_help.h"
+
+TEST_CASE("operation succesfull run")
+{
+ //const int N = 50;
+ //auto A = help::random_sequence(N, 2, 0, 10);
+ //auto B = help::random_sequence(N, 2, 0, 10);
+
+ //input_method input(A, B);
+ input_info info;
+
+ parameter params;
+ params.inPath = vtr<string>(1);
+ params.method = "dtw";
+
+ string pathW = "c:\\code\\data\\sc\\chord";
+ string pathL = "/mnt/c/code/data/sc/chord";
+ string pathcW = "c:\\code\\data\\sc\\c31.txt";
+ string pathcL = "/mnt/c/code/data/sc/c31.txt";
+
+ if (help::pathExists(pathW))
+ params.inPath[0] = pathW;
+ else
+ params.inPath[0] = pathL;
+
+ params.operation = 0;
+ auto result = mains::main_logic(params);
+ CHECK(!result.scoreMethod.empty());
+
+ params.operation = 1;
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+
+ params.operation = 2;
+ params.inQuery = vtr<string>(1);
+ params.inQuery[0] = params.inPath[0];
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+
+ params.operation = 3;
+ params.inClusterPath = help::pathExists(pathcW) ? pathcW : pathcL;
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+
+ params.operation = 4;
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+
+ params.operation = 3;
+ params.shift = true;
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+
+ params.operation = 4;
+ result = mains::main_logic(params);
+ CHECK(!result.matrixSimilarity.empty());
+}
+
+TEST_CASE("equality - shift/noshift")
+{
+ //const int N = 50;
+ //auto A = help::random_sequence(N, 2, 0, 10);
+ //auto B = help::random_sequence(N, 2, 0, 10);
+
+ //input_method input(A, B);
+
+ double EPS = 0;
+ bool check = false;
+ input_info info;
+
+ parameter params;
+ params.inPath = vtr<string>(1);
+ params.method = "dtw";
+
+ string pathW = "c:\\code\\data\\sc\\chord";
+ string pathL = "/mnt/c/code/data/sc/chord";
+ string pathcW = "c:\\code\\data\\sc\\c31.txt";
+ string pathcL = "/mnt/c/code/data/sc/c31.txt";
+
+ if (help::pathExists(pathW))
+ params.inPath[0] = pathW;
+ else
+ params.inPath[0] = pathL;
+
+ params.operation = 0;
+ auto result = mains::main_logic(params);
+
+ params.operation = 0;
+ params.shift = true;
+ auto resultS = mains::main_logic(params);
+
+
+ check = ut_help::vtr_equal(result.scoreMethod, resultS.scoreMethod, EPS);
+ CHECK(check);
+
+ params.operation = 1;
+ params.shift = false;
+ result = mains::main_logic(params);
+
+ params.operation = 1;
+ params.shift = true;
+ resultS = mains::main_logic(params);
+
+ check = ut_help::vtr_equal(result.matrixSimilarity, resultS.matrixSimilarity, EPS);
+ CHECK(check);
+
+ params.inQuery = vtr<string>(1);
+ params.inQuery[0] = params.inPath[0];
+
+ params.operation = 2;
+ params.shift = false;
+ result = mains::main_logic(params);
+
+ params.operation = 2;
+ params.shift = true;
+ resultS = mains::main_logic(params);
+
+ check = ut_help::vtr_equal(result.matrixSimilarity, resultS.matrixSimilarity, EPS) ? true : false;
+ CHECK(true);
+
+ params.inClusterPath = help::pathExists(pathcW) ? pathcW : pathcL;
+
+ params.operation = 3;
+ params.shift = false;
+ result = mains::main_logic(params);
+
+ params.operation = 3;
+ params.shift = true;
+ resultS = mains::main_logic(params);
+
+ check = ut_help::vtr_equal(result.matrixSimilarity, resultS.matrixSimilarity, EPS);
+ CHECK(check);
+ check = (result.matrixCluster == resultS.matrixCluster) ? true : false;
+ CHECK(check);
+
+ check = ut_help::vtr_equal(result.scoreAveragePrecisions, resultS.scoreAveragePrecisions, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreAverageRanks, resultS.scoreAverageRanks, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scorePrecisions, resultS.scorePrecisions, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreRecalls, resultS.scoreRecalls, EPS);
+ CHECK(check);
+
+ check = ut_help::vtr_equal(result.scoreMap, resultS.scoreMap, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanAverageRank, resultS.scoreMeanAverageRank, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanPrecision, resultS.scoreMeanPrecision, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanRecall, resultS.scoreMeanRecall, EPS);
+ CHECK(check);
+
+ params.operation = 4;
+ params.shift = false;
+ result = mains::main_logic(params);
+
+ params.operation = 4;
+ params.shift = true;
+ resultS = mains::main_logic(params);
+
+ check = ut_help::vtr_equal(result.matrixSimilarity, resultS.matrixSimilarity, EPS);
+ CHECK(check);
+ check = (result.matrixCluster == resultS.matrixCluster) ? true : false;
+ CHECK(check);
+
+ check = ut_help::vtr_equal(result.scoreAveragePrecisions, resultS.scoreAveragePrecisions, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreAverageRanks, resultS.scoreAverageRanks, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scorePrecisions, resultS.scorePrecisions, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreRecalls, resultS.scoreRecalls, EPS);
+ CHECK(check);
+
+ check = ut_help::vtr_equal(result.scoreMap, resultS.scoreMap, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanAverageRank, resultS.scoreMeanAverageRank, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanPrecision, resultS.scoreMeanPrecision, EPS);
+ CHECK(check);
+ check = ut_help::vtr_equal(result.scoreMeanRecall, resultS.scoreMeanRecall, EPS);
+ CHECK(check);
+}
\ No newline at end of file