diff options
| author | Mike Frysinger <vapier@chromium.org> | 2020-06-23 18:55:43 -0400 |
|---|---|---|
| committer | Mike Frysinger <vapier@chromium.org> | 2020-07-15 06:20:02 +0000 |
| commit | 09b056975dacd1f0f815ad820b6dc9913b0118a3 (patch) | |
| tree | 67ba67549b44e6d98b9ff2dfb3e0396e0a252b96 /src/processor/static_map-inl.h | |
| parent | Add support for dwarf5 line tables. (diff) | |
| download | breakpad-09b056975dacd1f0f815ad820b6dc9913b0118a3.tar.xz | |
fix pointer style to match the style guide
We do this in a lot of places, but we're inconsistent.
Normalize the code to the Google C++ style guide.
Change-Id: Ic2aceab661ce8f6b993dda21b1cdf5d2198dcbbf
Reviewed-on: https://chromium-review.googlesource.com/c/breakpad/breakpad/+/2262932
Reviewed-by: Sterling Augustine <saugustine@google.com>
Reviewed-by: Mark Mentovai <mark@chromium.org>
Diffstat (limited to 'src/processor/static_map-inl.h')
| -rw-r--r-- | src/processor/static_map-inl.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/processor/static_map-inl.h b/src/processor/static_map-inl.h index e6aac6ab..75a8a335 100644 --- a/src/processor/static_map-inl.h +++ b/src/processor/static_map-inl.h @@ -59,7 +59,7 @@ StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data) // find(), lower_bound() and upper_bound() implement binary search algorithm. template<typename Key, typename Value, typename Compare> StaticMapIterator<Key, Value, Compare> -StaticMap<Key, Value, Compare>::find(const Key &key) const { +StaticMap<Key, Value, Compare>::find(const Key& key) const { int begin = 0; int end = num_nodes_; int middle; @@ -80,7 +80,7 @@ StaticMap<Key, Value, Compare>::find(const Key &key) const { template<typename Key, typename Value, typename Compare> StaticMapIterator<Key, Value, Compare> -StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { +StaticMap<Key, Value, Compare>::lower_bound(const Key& key) const { int begin = 0; int end = num_nodes_; int middle; @@ -101,7 +101,7 @@ StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { template<typename Key, typename Value, typename Compare> StaticMapIterator<Key, Value, Compare> -StaticMap<Key, Value, Compare>::upper_bound(const Key &key) const { +StaticMap<Key, Value, Compare>::upper_bound(const Key& key) const { int begin = 0; int end = num_nodes_; int middle; |