1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
/**
* Another tree building benchmark. Thanks again to Bearophile.
*
* Copyright: Copyright David Simcha 2011 - 2011.
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Authors: David Simcha
*/
/* Copyright David Simcha 2011 - 2011.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*/
import std.stdio, std.container, std.range;
void main() {
enum int range = 100;
enum int n = 1_000_000;
auto t = redBlackTree!int();
for (int i = 0; i < n; i++) {
if (i > range)
t.removeFront();
t.insert(i);
}
}
|
