DeforaNetworks/deepstate
3
0
Fork 0
Code Releases Activity

Merge branch 'master' of https://github.com/trailofbits/deepstate

Browse Source
This commit is contained in:
alex
2017-12-12 12:24:44 -08:00
parent 5b35c46fba e9bd6dc177
commit acd4e025b6
4 changed files with 47 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
examples/OneOf.cpp
View File

@@ -30,35 +30,33 @@ TEST(OneOfExample, ProduceSixtyOrHigher) {
// Add this back in and uncomment out choices parts below, add
// & choices, N to captures, and it becomes quite difficult.
int N = 0;
while (N < LENGTH) {
N++;
for (int N = 0;N < LENGTH; N++) {
OneOf(
[&x] {
x += 1;
printf("-1\n");
//choices[N] = '+';
},
[&x] {
x -= 1;
printf("+1\n");
//choices[N] = '-';
},
[&x] {
x *= 2;
printf("*2\n");
//choices[N] = '2';
},
[&x] {
x += 10;
printf("+=10\n");
//choices[N] = 'x';
},
[&x] {
x = 0;
printf("=0\n");
//choices[N] = '0';
});
[&x] {
x += 1;
printf("+=1\n");
//choices[N] = '+';
},
[&x] {
x -= 1;
printf("-=1\n");
//choices[N] = '-';
},
[&x] {
x *= 2;
printf("*2\n");
//choices[N] = '2';
},
[&x] {
x += 10;
printf("+=10\n");
//choices[N] = 'x';
},
[&x] {
x = 0;
printf("=0\n");
//choices[N] = '0';
});
//choices[N+1] = 0;
ASSERT_LE(x, 60)