adam/Alepha
1
0
Fork 0
forked from Alepha/Alepha
Code Pull Requests Activity

Fix a test with a probability of failure.

Browse Source
This commit is contained in:
ADAM David Alan Martin
2023-10-13 00:27:33 -04:00
parent f954057126
commit 76940b2cb2
1 changed files with 17 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
Proof/Attestation.test/test.cc
View File

@ -9,6 +9,8 @@
#include <random>
#include <iostream>
namespace
{
struct Tester;
@ -154,9 +156,22 @@ main()
Sorted::Witness< const std::vector< int > & > sortedVector= Sorter::sort( v );
assert( std::is_sorted( begin( testify( sortedVector ) ), end( testify( sortedVector ) ) ) );
std::shuffle( begin( v ), end( v ), std::random_device() );
assert( !std::is_sorted( begin( testify( sortedVector ) ), end( testify( sortedVector ) ) ) );
// Since this is probability driven, and there's only 5 members, there's some chance that it
// might actually be sorted! Bogosort is a thing, after all.
//
// So instead, I just shuffle until it _isn't_ sorted. Should only repeat once, almost
// all the time.
while( std::is_sorted( begin( testify( sortedVector ) ), end( testify( sortedVector ) ) ) )
{
std::shuffle( begin( v ), end( v ), std::random_device() );
}
if( std::is_sorted( begin( testify( sortedVector ) ), end( testify( sortedVector ) ) ) )
{
std::cerr << "They were sorted! They shouldn't be!!" << std::endl;
assert( !std::is_sorted( begin( testify( sortedVector ) ), end( testify( sortedVector ) ) ) );
}
std::mutex mtx;