btree_benchmark.cc
27.6 KB
-
Implement btree_iterator::operator-, which is faster than std::distance for btree iterators. · bbf2ed78Note: btree_iterator::operator- is still O(N) because in the worst case (end()-begin()), we will have at least one operation per node in the tree, and there are at least N/M nodes, where M (a constant) is the maximum number of values per node. PiperOrigin-RevId: 481716874 Change-Id: Ic0225b7509208ed96b75a2dc626d2aa4a24f4946
Evan Brown committed