- 31 Jan, 2022 2 commits
-
-
Tobias Knorr authored
-
- 27 Jan, 2022 1 commit
-
-
Joscha authored
-
- 26 Jan, 2022 5 commits
-
-
I-Al-Istannen authored
- 25 Jan, 2022 2 commits
-
-
Tobias Stickling authored
Multiply / divide by power of two can be optimized using shifts. This test case tests some edge cases of that optimization.
-
Tobias Stickling authored
-
- 24 Jan, 2022 1 commit
-
-
Tobias Stickling authored
-
- 23 Jan, 2022 2 commits
-
- 18 Jan, 2022 4 commits
- 17 Jan, 2022 3 commits
-
-
I-Al-Istannen authored
-
Paul Brinkmeier authored
-
- 16 Jan, 2022 1 commit
-
-
uyunx authored
-
- 13 Jan, 2022 2 commits
-
-
uxrog authored
-
- 11 Jan, 2022 1 commit
-
-
I-Al-Istannen authored
-
- 30 Dec, 2021 2 commits
-
-
uxrog authored
-
- 28 Dec, 2021 1 commit
-
-
I-Al-Istannen authored
-
- 16 Dec, 2021 2 commits
-
- 14 Dec, 2021 1 commit
-
-
Chrisliebär authored
This test is actually wrong * It can terminate (thous is not an infinte loop) * It will crash with properly optimized code due to a huge call stack This test assumes that the generated code is too slow to run into stack size problems before it runs into timeout problems
-
- 12 Dec, 2021 1 commit
-
-
I-Al-Istannen authored
Otherwise github sadly rejects the edit
-
- 06 Dec, 2021 5 commits
-
-
Paul Brinkmeier authored
-
Paul Brinkmeier authored
- 05 Dec, 2021 4 commits
-
-
uxrog authored
-
ucywg authored
-
Tobias Knorr authored
-
uxrog authored
-