| Name |
Last commit
|
Last Update |
|---|---|---|
| .. | ||
| algorithm | ||
| base | ||
| cleanup | ||
| container | ||
| copts | ||
| debugging | ||
| flags | ||
| functional | ||
| hash | ||
| memory | ||
| meta | ||
| numeric | ||
| profiling | ||
| random | ||
| status | ||
| strings | ||
| synchronization | ||
| time | ||
| types | ||
| utility | ||
| BUILD.bazel | ||
| CMakeLists.txt | ||
| abseil.podspec.gen.py |
-- 505dc83f11dbc14d6e493d83ed6451966629fe71 by Evan Brown <ezb@google.com>: In debug mode, make b-tree adapt comparators to do checking to diagnose invalid non-strict-weak-ordering comparators. Reference: https://en.cppreference.com/w/cpp/named_req/Compare - Add an opt-out mechanism for tests that rely on counting the number of comparisons. - Use the unadapted comparator (original_key_compare) in making the use_linear_search decision so is_same still works. PiperOrigin-RevId: 423889350 GitOrigin-RevId: 505dc83f11dbc14d6e493d83ed6451966629fe71 Change-Id: I65b0ba489c69c8dcfb107684db84f3f7f4d72daa
| Name |
Last commit
|
Last Update |
|---|---|---|
| .. | ||
| algorithm | Loading commit data... | |
| base | Loading commit data... | |
| cleanup | Loading commit data... | |
| container | Loading commit data... | |
| copts | Loading commit data... | |
| debugging | Loading commit data... | |
| flags | Loading commit data... | |
| functional | Loading commit data... | |
| hash | Loading commit data... | |
| memory | Loading commit data... | |
| meta | Loading commit data... | |
| numeric | Loading commit data... | |
| profiling | Loading commit data... | |
| random | Loading commit data... | |
| status | Loading commit data... | |
| strings | Loading commit data... | |
| synchronization | Loading commit data... | |
| time | Loading commit data... | |
| types | Loading commit data... | |
| utility | Loading commit data... | |
| BUILD.bazel | Loading commit data... | |
| CMakeLists.txt | Loading commit data... | |
| abseil.podspec.gen.py | Loading commit data... |