# testing Values TEST: X[i] = select{5 when 2 < 1, 6 when 2 > 1} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_15; if ((2 < 1)) { int _val_2 = 5; _val_15 = _val_2; } else if ((2 > 1)) { int _val_9 = 6; _val_15 = _val_9; } else { assert (0); } X[i] = _val_15; } } DONE TEST: X[i] = min{5 when 2 < 1, 6 when 2 > 1} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_15 = INT_MAX; if ((2 < 1)) { int _val_2 = 5; _val_15 = std::min (_val_15, _val_2); } if ((2 > 1)) { int _val_9 = 6; _val_15 = std::min (_val_15, _val_9); } X[i] = _val_15; } } DONE TEST: X[i] = max{5 when 2 < 1, 6 when 2 > 1} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_15 = INT_MIN; if ((2 < 1)) { int _val_2 = 5; _val_15 = std::max (_val_15, _val_2); } if ((2 > 1)) { int _val_9 = 6; _val_15 = std::max (_val_15, _val_9); } X[i] = _val_15; } } DONE TEST: X[i] = sum{5 when 2 < 1, 6 when 2 > 1} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_15 = 0; if ((2 < 1)) { int _val_2 = 5; _val_15 = _val_15 + _val_2; } if ((2 > 1)) { int _val_9 = 6; _val_15 = _val_15 + _val_9; } X[i] = _val_15; } } DONE TEST: X[i] = prod{5 when 2 < 1, 6 when 2 > 1} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_15 = 1; if ((2 < 1)) { int _val_2 = 5; _val_15 = _val_15 * _val_2; } if ((2 > 1)) { int _val_9 = 6; _val_15 = _val_15 * _val_9; } X[i] = _val_15; } } DONE # testing Range TEST: X[i] = min{5 where 0 <= k < i} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_9 = INT_MAX; for (int k = 0; k < i; ++k) { int _val_2 = 5; _val_9 = std::min (_val_9, _val_2); } X[i] = _val_9; } } DONE TEST: X[i] = max{5 where 0 <= k < i} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_9 = INT_MIN; for (int k = 0; k < i; ++k) { int _val_2 = 5; _val_9 = std::max (_val_9, _val_2); } X[i] = _val_9; } } DONE TEST: X[i] = sum{5 where 0 <= k < i} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_9 = 0; for (int k = 0; k < i; ++k) { int _val_2 = 5; _val_9 = _val_9 + _val_2; } X[i] = _val_9; } } DONE TEST: X[i] = prod{5 where 0 <= k < i} where 0 <= i < N RESULT: #include void fill_table (int X[], int N) { for (int i = 0; i < N; ++i) { int _val_9 = 1; for (int k = 0; k < i; ++k) { int _val_2 = 5; _val_9 = _val_9 * _val_2; } X[i] = _val_9; } } DONE