-
Notifications
You must be signed in to change notification settings - Fork 32
Expand file tree
/
Copy pathcatch_amalgamated.cpp
More file actions
12637 lines (11140 loc) · 335 KB
/
Copy pathcatch_amalgamated.cpp
File metadata and controls
12637 lines (11140 loc) · 335 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright Catch2 Authors
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// https://www.boost.org/LICENSE_1_0.txt)
// SPDX-License-Identifier: BSL-1.0
// Catch v3.1.1
// Generated: 2022-10-17 18:47:22.400176
// ----------------------------------------------------------
// This file is an amalgamation of multiple different files.
// You probably shouldn't edit it directly.
// ----------------------------------------------------------
#include "catch_amalgamated.hpp"
#ifndef CATCH_WINDOWS_H_PROXY_HPP_INCLUDED
#define CATCH_WINDOWS_H_PROXY_HPP_INCLUDED
#if defined( CATCH_PLATFORM_WINDOWS )
// We might end up with the define made globally through the compiler,
// and we don't want to trigger warnings for this
#if !defined( NOMINMAX )
#define NOMINMAX
#endif
#if !defined( WIN32_LEAN_AND_MEAN )
#define WIN32_LEAN_AND_MEAN
#endif
#include <windows.h>
#endif // defined(CATCH_PLATFORM_WINDOWS)
#endif // CATCH_WINDOWS_H_PROXY_HPP_INCLUDED
namespace Catch
{
namespace Benchmark
{
namespace Detail
{
ChronometerConcept::~ChronometerConcept( ) = default;
} // namespace Detail
} // namespace Benchmark
} // namespace Catch
namespace Catch
{
namespace Benchmark
{
namespace Detail
{
BenchmarkFunction::callable::~callable( ) = default;
} // namespace Detail
} // namespace Benchmark
} // namespace Catch
#include <exception>
namespace Catch
{
namespace Benchmark
{
namespace Detail
{
struct optimized_away_error : std::exception
{
const char* what( ) const noexcept override;
};
const char*
optimized_away_error::what( ) const noexcept
{
return "could not measure benchmark, maybe it was optimized away";
}
void
throw_optimized_away_error( )
{
Catch::throw_exception( optimized_away_error{ } );
}
} // namespace Detail
} // namespace Benchmark
} // namespace Catch
// Adapted from donated nonius code.
#include <cassert>
#include <cstddef>
#include <iterator>
#include <random>
#if defined( CATCH_CONFIG_USE_ASYNC )
#include <future>
#endif
namespace
{
using Catch::Benchmark::Detail::sample;
template < typename URng, typename Estimator >
sample
resample( URng& rng,
unsigned int resamples,
std::vector< double >::iterator first,
std::vector< double >::iterator last,
Estimator& estimator )
{
auto n = static_cast< size_t >( last - first );
std::uniform_int_distribution< decltype( n ) > dist( 0, n - 1 );
sample out;
out.reserve( resamples );
std::generate_n( std::back_inserter( out ), resamples, [ n, first, &estimator, &dist, &rng ] {
std::vector< double > resampled;
resampled.reserve( n );
std::generate_n( std::back_inserter( resampled ), n, [ first, &dist, &rng ] {
return first[ static_cast< std::ptrdiff_t >( dist( rng ) ) ];
} );
return estimator( resampled.begin( ), resampled.end( ) );
} );
std::sort( out.begin( ), out.end( ) );
return out;
}
double
erf_inv( double x )
{
// Code accompanying the article "Approximating the erfinv function" in GPU Computing Gems,
// Volume 2
double w, p;
w = -log( ( 1.0 - x ) * ( 1.0 + x ) );
if ( w < 6.250000 )
{
w = w - 3.125000;
p = -3.6444120640178196996e-21;
p = -1.685059138182016589e-19 + p * w;
p = 1.2858480715256400167e-18 + p * w;
p = 1.115787767802518096e-17 + p * w;
p = -1.333171662854620906e-16 + p * w;
p = 2.0972767875968561637e-17 + p * w;
p = 6.6376381343583238325e-15 + p * w;
p = -4.0545662729752068639e-14 + p * w;
p = -8.1519341976054721522e-14 + p * w;
p = 2.6335093153082322977e-12 + p * w;
p = -1.2975133253453532498e-11 + p * w;
p = -5.4154120542946279317e-11 + p * w;
p = 1.051212273321532285e-09 + p * w;
p = -4.1126339803469836976e-09 + p * w;
p = -2.9070369957882005086e-08 + p * w;
p = 4.2347877827932403518e-07 + p * w;
p = -1.3654692000834678645e-06 + p * w;
p = -1.3882523362786468719e-05 + p * w;
p = 0.0001867342080340571352 + p * w;
p = -0.00074070253416626697512 + p * w;
p = -0.0060336708714301490533 + p * w;
p = 0.24015818242558961693 + p * w;
p = 1.6536545626831027356 + p * w;
}
else if ( w < 16.000000 )
{
w = sqrt( w ) - 3.250000;
p = 2.2137376921775787049e-09;
p = 9.0756561938885390979e-08 + p * w;
p = -2.7517406297064545428e-07 + p * w;
p = 1.8239629214389227755e-08 + p * w;
p = 1.5027403968909827627e-06 + p * w;
p = -4.013867526981545969e-06 + p * w;
p = 2.9234449089955446044e-06 + p * w;
p = 1.2475304481671778723e-05 + p * w;
p = -4.7318229009055733981e-05 + p * w;
p = 6.8284851459573175448e-05 + p * w;
p = 2.4031110387097893999e-05 + p * w;
p = -0.0003550375203628474796 + p * w;
p = 0.00095328937973738049703 + p * w;
p = -0.0016882755560235047313 + p * w;
p = 0.0024914420961078508066 + p * w;
p = -0.0037512085075692412107 + p * w;
p = 0.005370914553590063617 + p * w;
p = 1.0052589676941592334 + p * w;
p = 3.0838856104922207635 + p * w;
}
else
{
w = sqrt( w ) - 5.000000;
p = -2.7109920616438573243e-11;
p = -2.5556418169965252055e-10 + p * w;
p = 1.5076572693500548083e-09 + p * w;
p = -3.7894654401267369937e-09 + p * w;
p = 7.6157012080783393804e-09 + p * w;
p = -1.4960026627149240478e-08 + p * w;
p = 2.9147953450901080826e-08 + p * w;
p = -6.7711997758452339498e-08 + p * w;
p = 2.2900482228026654717e-07 + p * w;
p = -9.9298272942317002539e-07 + p * w;
p = 4.5260625972231537039e-06 + p * w;
p = -1.9681778105531670567e-05 + p * w;
p = 7.5995277030017761139e-05 + p * w;
p = -0.00021503011930044477347 + p * w;
p = -0.00013871931833623122026 + p * w;
p = 1.0103004648645343977 + p * w;
p = 4.8499064014085844221 + p * w;
}
return p * x;
}
double
standard_deviation( std::vector< double >::iterator first, std::vector< double >::iterator last )
{
auto m = Catch::Benchmark::Detail::mean( first, last );
double variance = std::accumulate( first, last, 0.,
[ m ]( double a, double b ) {
double diff = b - m;
return a + diff * diff;
} )
/ ( last - first );
return std::sqrt( variance );
}
} // namespace
namespace Catch
{
namespace Benchmark
{
namespace Detail
{
#if defined( __GNUC__ ) || defined( __clang__ )
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wfloat-equal"
#endif
bool
directCompare( double lhs, double rhs )
{
return lhs == rhs;
}
#if defined( __GNUC__ ) || defined( __clang__ )
#pragma GCC diagnostic pop
#endif
double
weighted_average_quantile( int k,
int q,
std::vector< double >::iterator first,
std::vector< double >::iterator last )
{
auto count = last - first;
double idx = ( count - 1 ) * k / static_cast< double >( q );
int j = static_cast< int >( idx );
double g = idx - j;
std::nth_element( first, first + j, last );
auto xj = first[ j ];
if ( directCompare( g, 0 ) )
{
return xj;
}
auto xj1 = *std::min_element( first + ( j + 1 ), last );
return xj + g * ( xj1 - xj );
}
double
erfc_inv( double x )
{
return erf_inv( 1.0 - x );
}
double
normal_quantile( double p )
{
static const double ROOT_TWO = std::sqrt( 2.0 );
double result = 0.0;
assert( p >= 0 && p <= 1 );
if ( p < 0 || p > 1 )
{
return result;
}
result = -erfc_inv( 2.0 * p );
// result *= normal distribution standard deviation (1.0) * sqrt(2)
result *= /*sd * */ ROOT_TWO;
// result += normal disttribution mean (0)
return result;
}
double
outlier_variance( Estimate< double > mean, Estimate< double > stddev, int n )
{
double sb = stddev.point;
double mn = mean.point / n;
double mg_min = mn / 2.;
double sg = ( std::min )( mg_min / 4., sb / std::sqrt( n ) );
double sg2 = sg * sg;
double sb2 = sb * sb;
auto c_max = [ n, mn, sb2, sg2 ]( double x ) -> double {
double k = mn - x;
double d = k * k;
double nd = n * d;
double k0 = -n * nd;
double k1 = sb2 - n * sg2 + nd;
double det = k1 * k1 - 4 * sg2 * k0;
return static_cast< int >( -2. * k0 / ( k1 + std::sqrt( det ) ) );
};
auto var_out = [ n, sb2, sg2 ]( double c ) {
double nc = n - c;
return ( nc / n ) * ( sb2 - nc * sg2 );
};
return ( std::min )( var_out( 1 ), var_out( ( std::min )( c_max( 0. ), c_max( mg_min ) ) ) )
/ sb2;
}
bootstrap_analysis
analyse_samples( double confidence_level,
unsigned int n_resamples,
std::vector< double >::iterator first,
std::vector< double >::iterator last )
{
CATCH_INTERNAL_START_WARNINGS_SUPPRESSION
CATCH_INTERNAL_SUPPRESS_GLOBALS_WARNINGS
static std::random_device entropy;
CATCH_INTERNAL_STOP_WARNINGS_SUPPRESSION
auto n = static_cast< int >( last - first ); // seriously, one can't use integral types without
// hell in C++
auto mean = &Detail::mean< std::vector< double >::iterator >;
auto stddev = &standard_deviation;
#if defined( CATCH_CONFIG_USE_ASYNC )
auto Estimate =
[ = ]( double ( *f )( std::vector< double >::iterator, std::vector< double >::iterator ) ) {
auto seed = entropy( );
return std::async( std::launch::async, [ = ] {
std::mt19937 rng( seed );
auto resampled = resample( rng, n_resamples, first, last, f );
return bootstrap( confidence_level, first, last, resampled, f );
} );
};
auto mean_future = Estimate( mean );
auto stddev_future = Estimate( stddev );
auto mean_estimate = mean_future.get( );
auto stddev_estimate = stddev_future.get( );
#else
auto Estimate =
[ = ]( double ( *f )( std::vector< double >::iterator, std::vector< double >::iterator ) ) {
auto seed = entropy( );
std::mt19937 rng( seed );
auto resampled = resample( rng, n_resamples, first, last, f );
return bootstrap( confidence_level, first, last, resampled, f );
};
auto mean_estimate = Estimate( mean );
auto stddev_estimate = Estimate( stddev );
#endif // CATCH_USE_ASYNC
double outlier_variance = Detail::outlier_variance( mean_estimate, stddev_estimate, n );
return { mean_estimate, stddev_estimate, outlier_variance };
}
} // namespace Detail
} // namespace Benchmark
} // namespace Catch
#include <cmath>
#include <limits>
namespace
{
// Performs equivalent check of std::fabs(lhs - rhs) <= margin
// But without the subtraction to allow for INFINITY in comparison
bool
marginComparison( double lhs, double rhs, double margin )
{
return ( lhs + margin >= rhs ) && ( rhs + margin >= lhs );
}
} // namespace
namespace Catch
{
Approx::Approx( double value )
: m_epsilon( std::numeric_limits< float >::epsilon( ) * 100. )
, m_margin( 0.0 )
, m_scale( 0.0 )
, m_value( value )
{
}
Approx
Approx::custom( )
{
return Approx( 0 );
}
Approx
Approx::operator-( ) const
{
auto temp( *this );
temp.m_value = -temp.m_value;
return temp;
}
std::string
Approx::toString( ) const
{
ReusableStringStream rss;
rss << "Approx( " << ::Catch::Detail::stringify( m_value ) << " )";
return rss.str( );
}
bool
Approx::equalityComparisonImpl( const double other ) const
{
// First try with fixed margin, then compute margin based on epsilon, scale and Approx's value
// Thanks to Richard Harris for his help refining the scaled margin value
return marginComparison( m_value, other, m_margin )
|| marginComparison(
m_value, other,
m_epsilon * ( m_scale + std::fabs( std::isinf( m_value ) ? 0 : m_value ) ) );
}
void
Approx::setMargin( double newMargin )
{
CATCH_ENFORCE( newMargin >= 0,
"Invalid Approx::margin: " << newMargin << '.'
<< " Approx::Margin has to be non-negative." );
m_margin = newMargin;
}
void
Approx::setEpsilon( double newEpsilon )
{
CATCH_ENFORCE( newEpsilon >= 0 && newEpsilon <= 1.0,
"Invalid Approx::epsilon: " << newEpsilon << '.'
<< " Approx::epsilon has to be in [0, 1]" );
m_epsilon = newEpsilon;
}
namespace literals
{
Approx operator"" _a( long double val )
{
return Approx( val );
}
Approx operator"" _a( unsigned long long val )
{
return Approx( val );
}
} // end namespace literals
std::string
StringMaker< Catch::Approx >::convert( Catch::Approx const& value )
{
return value.toString( );
}
} // end namespace Catch
namespace Catch
{
AssertionResultData::AssertionResultData( ResultWas::OfType _resultType,
LazyExpression const& _lazyExpression )
: lazyExpression( _lazyExpression )
, resultType( _resultType )
{
}
std::string
AssertionResultData::reconstructExpression( ) const
{
if ( reconstructedExpression.empty( ) )
{
if ( lazyExpression )
{
ReusableStringStream rss;
rss << lazyExpression;
reconstructedExpression = rss.str( );
}
}
return reconstructedExpression;
}
AssertionResult::AssertionResult( AssertionInfo const& info, AssertionResultData const& data )
: m_info( info )
, m_resultData( data )
{
}
// Result was a success
bool
AssertionResult::succeeded( ) const
{
return Catch::isOk( m_resultData.resultType );
}
// Result was a success, or failure is suppressed
bool
AssertionResult::isOk( ) const
{
return Catch::isOk( m_resultData.resultType )
|| shouldSuppressFailure( m_info.resultDisposition );
}
ResultWas::OfType
AssertionResult::getResultType( ) const
{
return m_resultData.resultType;
}
bool
AssertionResult::hasExpression( ) const
{
return !m_info.capturedExpression.empty( );
}
bool
AssertionResult::hasMessage( ) const
{
return !m_resultData.message.empty( );
}
std::string
AssertionResult::getExpression( ) const
{
// Possibly overallocating by 3 characters should be basically free
std::string expr;
expr.reserve( m_info.capturedExpression.size( ) + 3 );
if ( isFalseTest( m_info.resultDisposition ) )
{
expr += "!(";
}
expr += m_info.capturedExpression;
if ( isFalseTest( m_info.resultDisposition ) )
{
expr += ')';
}
return expr;
}
std::string
AssertionResult::getExpressionInMacro( ) const
{
std::string expr;
if ( m_info.macroName.empty( ) )
expr = static_cast< std::string >( m_info.capturedExpression );
else
{
expr.reserve( m_info.macroName.size( ) + m_info.capturedExpression.size( ) + 4 );
expr += m_info.macroName;
expr += "( ";
expr += m_info.capturedExpression;
expr += " )";
}
return expr;
}
bool
AssertionResult::hasExpandedExpression( ) const
{
return hasExpression( ) && getExpandedExpression( ) != getExpression( );
}
std::string
AssertionResult::getExpandedExpression( ) const
{
std::string expr = m_resultData.reconstructExpression( );
return expr.empty( ) ? getExpression( ) : expr;
}
StringRef
AssertionResult::getMessage( ) const
{
return m_resultData.message;
}
SourceLineInfo
AssertionResult::getSourceInfo( ) const
{
return m_info.lineInfo;
}
StringRef
AssertionResult::getTestMacroName( ) const
{
return m_info.macroName;
}
} // end namespace Catch
namespace
{
bool
provideBazelReporterOutput( )
{
#if defined( CATCH_CONFIG_BAZEL_SUPPORT )
return true;
#elif defined( CATCH_PLATFORM_WINDOWS_UWP )
// UWP does not support environment variables
return false;
#else
#if defined( _MSC_VER )
// On Windows getenv throws a warning as there is no input validation,
// since the switch is hardcoded, this should not be an issue.
#pragma warning( push )
#pragma warning( disable : 4996 )
#endif
return std::getenv( "BAZEL_TEST" ) != nullptr;
#if defined( _MSC_VER )
#pragma warning( pop )
#endif
#endif
}
} // namespace
namespace Catch
{
bool
operator==( ProcessedReporterSpec const& lhs, ProcessedReporterSpec const& rhs )
{
return lhs.name == rhs.name && lhs.outputFilename == rhs.outputFilename
&& lhs.colourMode == rhs.colourMode && lhs.customOptions == rhs.customOptions;
}
Config::Config( ConfigData const& data )
: m_data( data )
{
// We need to trim filter specs to avoid trouble with superfluous
// whitespace (esp. important for bdd macros, as those are manually
// aligned with whitespace).
for ( auto& elem : m_data.testsOrTags )
{
elem = trim( elem );
}
for ( auto& elem : m_data.sectionsToRun )
{
elem = trim( elem );
}
TestSpecParser parser( ITagAliasRegistry::get( ) );
if ( !m_data.testsOrTags.empty( ) )
{
m_hasTestFilters = true;
for ( auto const& testOrTags : m_data.testsOrTags )
{
parser.parse( testOrTags );
}
}
m_testSpec = parser.testSpec( );
// Insert the default reporter if user hasn't asked for a specfic one
if ( m_data.reporterSpecifications.empty( ) )
{
m_data.reporterSpecifications.push_back( {
#if defined( CATCH_CONFIG_DEFAULT_REPORTER )
CATCH_CONFIG_DEFAULT_REPORTER,
#else
"console",
#endif
{ }, { },
{
}
} );
}
#if !defined( CATCH_PLATFORM_WINDOWS_UWP )
if ( provideBazelReporterOutput( ) )
{
// Register a JUnit reporter for Bazel. Bazel sets an environment
// variable with the path to XML output. If this file is written to
// during test, Bazel will not generate a default XML output.
// This allows the XML output file to contain higher level of detail
// than what is possible otherwise.
#if defined( _MSC_VER )
// On Windows getenv throws a warning as there is no input validation,
// since the key is hardcoded, this should not be an issue.
#pragma warning( push )
#pragma warning( disable : 4996 )
#endif
const auto bazelOutputFilePtr = std::getenv( "XML_OUTPUT_FILE" );
#if defined( _MSC_VER )
#pragma warning( pop )
#endif
if ( bazelOutputFilePtr != nullptr )
{
m_data.reporterSpecifications.push_back(
{ "junit", std::string( bazelOutputFilePtr ), { }, {} } );
}
}
#endif
// We now fixup the reporter specs to handle default output spec,
// default colour spec, etc
bool defaultOutputUsed = false;
for ( auto const& reporterSpec : m_data.reporterSpecifications )
{
// We do the default-output check separately, while always
// using the default output below to make the code simpler
// and avoid superfluous copies.
if ( reporterSpec.outputFile( ).none( ) )
{
CATCH_ENFORCE( !defaultOutputUsed,
"Internal error: cannot use default output for "
"multiple reporters" );
defaultOutputUsed = true;
}
m_processedReporterSpecs.push_back( ProcessedReporterSpec{
reporterSpec.name( ),
reporterSpec.outputFile( ) ? *reporterSpec.outputFile( ) : data.defaultOutputFilename,
reporterSpec.colourMode( ).valueOr( data.defaultColourMode ),
reporterSpec.customOptions( ) } );
}
}
Config::~Config( ) = default;
bool
Config::listTests( ) const
{
return m_data.listTests;
}
bool
Config::listTags( ) const
{
return m_data.listTags;
}
bool
Config::listReporters( ) const
{
return m_data.listReporters;
}
bool
Config::listListeners( ) const
{
return m_data.listListeners;
}
std::vector< std::string > const&
Config::getTestsOrTags( ) const
{
return m_data.testsOrTags;
}
std::vector< std::string > const&
Config::getSectionsToRun( ) const
{
return m_data.sectionsToRun;
}
std::vector< ReporterSpec > const&
Config::getReporterSpecs( ) const
{
return m_data.reporterSpecifications;
}
std::vector< ProcessedReporterSpec > const&
Config::getProcessedReporterSpecs( ) const
{
return m_processedReporterSpecs;
}
TestSpec const&
Config::testSpec( ) const
{
return m_testSpec;
}
bool
Config::hasTestFilters( ) const
{
return m_hasTestFilters;
}
bool
Config::showHelp( ) const
{
return m_data.showHelp;
}
// IConfig interface
bool
Config::allowThrows( ) const
{
return !m_data.noThrow;
}
StringRef
Config::name( ) const
{
return m_data.name.empty( ) ? m_data.processName : m_data.name;
}
bool
Config::includeSuccessfulResults( ) const
{
return m_data.showSuccessfulTests;
}
bool
Config::warnAboutMissingAssertions( ) const
{
return !!( m_data.warnings & WarnAbout::NoAssertions );
}
bool
Config::warnAboutUnmatchedTestSpecs( ) const
{
return !!( m_data.warnings & WarnAbout::UnmatchedTestSpec );
}
bool
Config::zeroTestsCountAsSuccess( ) const
{
return m_data.allowZeroTests;
}
ShowDurations
Config::showDurations( ) const
{
return m_data.showDurations;
}
double
Config::minDuration( ) const
{
return m_data.minDuration;
}
TestRunOrder
Config::runOrder( ) const
{
return m_data.runOrder;
}
uint32_t
Config::rngSeed( ) const
{
return m_data.rngSeed;
}
unsigned int
Config::shardCount( ) const
{
return m_data.shardCount;
}
unsigned int
Config::shardIndex( ) const
{
return m_data.shardIndex;
}
ColourMode
Config::defaultColourMode( ) const
{
return m_data.defaultColourMode;
}
bool
Config::shouldDebugBreak( ) const
{
return m_data.shouldDebugBreak;
}
int
Config::abortAfter( ) const
{
return m_data.abortAfter;
}
bool
Config::showInvisibles( ) const
{
return m_data.showInvisibles;
}
Verbosity
Config::verbosity( ) const
{
return m_data.verbosity;
}
bool
Config::skipBenchmarks( ) const
{
return m_data.skipBenchmarks;
}
bool
Config::benchmarkNoAnalysis( ) const
{
return m_data.benchmarkNoAnalysis;
}
unsigned int
Config::benchmarkSamples( ) const
{
return m_data.benchmarkSamples;
}
double
Config::benchmarkConfidenceInterval( ) const
{
return m_data.benchmarkConfidenceInterval;
}
unsigned int
Config::benchmarkResamples( ) const
{
return m_data.benchmarkResamples;
}
std::chrono::milliseconds
Config::benchmarkWarmupTime( ) const
{
return std::chrono::milliseconds( m_data.benchmarkWarmupTime );
}
} // end namespace Catch
namespace Catch
{
std::uint32_t
getSeed( )
{
return getCurrentContext( ).getConfig( )->rngSeed( );
}
} // namespace Catch
#include <cassert>
#include <stack>
namespace Catch
{
////////////////////////////////////////////////////////////////////////////
ScopedMessage::ScopedMessage( MessageBuilder const& builder )
: m_info( builder.m_info )
{
m_info.message = builder.m_stream.str( );
getResultCapture( ).pushScopedMessage( m_info );
}
ScopedMessage::ScopedMessage( ScopedMessage&& old ) noexcept
: m_info( CATCH_MOVE( old.m_info ) )
{
old.m_moved = true;
}
ScopedMessage::~ScopedMessage( )
{
if ( !uncaught_exceptions( ) && !m_moved )
{
getResultCapture( ).popScopedMessage( m_info );
}
}
Capturer::Capturer( StringRef macroName,
SourceLineInfo const& lineInfo,
ResultWas::OfType resultType,
StringRef names )
{
auto trimmed = [ & ]( size_t start, size_t end ) {
while ( names[ start ] == ',' || isspace( static_cast< unsigned char >( names[ start ] ) ) )
{
++start;
}
while ( names[ end ] == ',' || isspace( static_cast< unsigned char >( names[ end ] ) ) )
{
--end;
}
return names.substr( start, end - start + 1 );
};
auto skipq = [ & ]( size_t start, char quote ) {
for ( auto i = start + 1; i < names.size( ); ++i )
{
if ( names[ i ] == quote )
return i;
if ( names[ i ] == '\\' )
++i;
}
CATCH_INTERNAL_ERROR( "CAPTURE parsing encountered unmatched quote" );
};
size_t start = 0;
std::stack< char > openings;
for ( size_t pos = 0; pos < names.size( ); ++pos )
{
char c = names[ pos ];
switch ( c )
{
case '[':
case '{':
case '(':
// It is basically impossible to disambiguate between
// comparison and start of template args in this context
// case '<':
openings.push( c );
break;
case ']':
case '}':
case ')':