C++ Trie树:cedar
性能分析
Software | Data Structure | Space [MiB] | Insert [ns/key] | Lookup [ns/key] |
---|---|---|---|---|
cedar | Double-array trie | 1173.02 | 631.06 | 50.40 |
cedar ORDERED=false | Double-array prefix trie | 671.66 | 786.02 | 49.99 |
libdatrie 0.2.8 | Double-array prefix trie | n/a | n/a | n/a |
libtrie 0.1.1 | Double-array two-trie | 2756.30 | 8116.16 | 185.85 |
dary | Double-array trie | 1119.04 | 1786.93 | 79.96 |
doar 0.0.13 | Compacted double-array trie | 2285.21 | 17687.60 | 83.41 |
critbit | Crit-bit (patricia) tree | 1457.02 | 1713.69 | 752.49 |
libdict | Splay tree | 1823.12 | 1541.48 | 229.34 |
libdict | Treap | 1823.13 | 1682.26 | 902.43 |
libdict | Skip list | 1852.86 | 1907.25 | 1265.79 |
Andersson tree library | AA tree | 1457.02 | 2100.03 | 337.14 |
C Containers library | Scapegoat tree | 1891.74 | 2380.65 | 254.34 |
tst_vanilla | ternary search tree | 3318.75 | 1109.25 | 129.12 |
Judy 1.0.5 | Judy trie SL | 897.59 | 580.67 | 142.64 |
hat-trie 0.1.0 | HAT-trie | 695.49 | 916.02 | 75.51 |
std::map | Red-black tree | 2506.27 | 1617.60 | 851.33 |
std::unordered_map | Hash table | 2471.60 | 615.30 | 170.41 |
array hash | Array Hash | 1725.56 | 17273.22 | 330.76 |
CMPH 2.0 | Hash table | 2741.03 | 2744.92 | 285.11 |
cpp-btree 1.0.1 | B-tree | 1744.96 | 1749.96 | 1080.04 |
sparsetable 2.0.2 | Sparse hash table | 1685.41 | 2635.32 | 157.63 |
sparsetable 2.0.2 (dense) | Hash table | 2335.04 | 502.66 | 123.3 |
相关文章