summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
191a743)
This will make measures more meaningful.
// Sightly modified by Leandro Lucarella <llucax@gmail.com>
// (some readability improvements and output removed)
// Sightly modified by Leandro Lucarella <llucax@gmail.com>
// (some readability improvements and output removed)
-const IT = 100; // original: 300
-const N1 = 200; // original: 20_000
-const N2 = 400; // original: 40_000
+const IT = 300;
+const N1 = 20_000;
+const N2 = 40_000;
import tango.math.random.Random;
import tango.math.random.Random;
-const IT = 5_000; // original: 50_000
void main() {
// The real memory use, ~55 KiB (original: ~20 MiB)
void main() {
// The real memory use, ~55 KiB (original: ~20 MiB)
}
void main(char[][] args) {
}
void main(char[][] args) {
- const minDepth = 4;
- int n = 6; // 13;
+ const minDepth = 5;
+ int n = 15;
int maxDepth = (minDepth + 2) > n ? minDepth + 2 : n;
int check = makeTree(0, maxDepth + 1).check;
int maxDepth = (minDepth + 2) > n ? minDepth + 2 : n;
int check = makeTree(0, maxDepth + 1).check;