/
trie_bench.ts
56 lines (49 loc) · 1.25 KB
/
trie_bench.ts
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
import Trie from "./trie.ts";
const ITEM_COUNT = 1e4;
// Define the number of nested levels
const k = 5;
// Create a function to generate keys
function generateKeys(i: number): number[] {
const keys = [];
for (let j = 0; j < k; j++) {
keys.push(i + j);
}
return keys;
}
// Benchmark the `set` method
Deno.bench("trie set", () => {
const trie = new Trie<number, number>();
for (let i = 0; i < ITEM_COUNT; i++) {
trie.set(generateKeys(i), i);
}
});
// Benchmark the `get` method
Deno.bench("trie get", () => {
const trie = new Trie<number, number>();
for (let i = 0; i < ITEM_COUNT; i++) {
trie.set(generateKeys(i), i);
}
for (let i = 0; i < ITEM_COUNT; i++) {
trie.get(generateKeys(i));
}
});
// Benchmark the `delete` method
Deno.bench("trie delete", () => {
const trie = new Trie<number, number>();
for (let i = 0; i < ITEM_COUNT; i++) {
trie.set(generateKeys(i), i);
}
for (let i = 0; i < ITEM_COUNT; i++) {
trie.delete(generateKeys(i));
}
});
// Benchmark the iteration
Deno.bench("trie iteration", () => {
const trie = new Trie<number, number>();
for (let i = 0; i < ITEM_COUNT; i++) {
trie.set(generateKeys(i), i);
}
for (const _ of trie) {
// Nothing happens here, just iterating
}
});