Restoring authorship annotation for <thegeorg@yandex-team.ru>. Commit 2 of 2.

1 files changed, 62 insertions, 62 deletions

diff --git a/contrib/restricted/abseil-cpp/absl/container/btree_map.h b/contrib/restricted/abseil-cpp/absl/container/btree_map.h
index 8fc0a768d7..f0a8d4a6a4 100644
--- a/contrib/restricted/abseil-cpp/absl/container/btree_map.h
+++ b/contrib/restricted/abseil-cpp/absl/container/btree_map.h
@@ -366,8 +366,8 @@ class btree_map
   // Determines whether an element comparing equal to the given `key` exists
   // within the `btree_map`, returning `true` if so or `false` otherwise.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::contains;
 
   // btree_map::count()
@@ -378,8 +378,8 @@ class btree_map
   // the `btree_map`. Note that this function will return either `1` or `0`
   // since duplicate elements are not allowed within a `btree_map`.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::count;
 
   // btree_map::equal_range()
@@ -395,34 +395,34 @@ class btree_map
   //
   // Finds an element with the passed `key` within the `btree_map`.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::find;
 
-  // btree_map::lower_bound() 
-  // 
-  // template <typename K> iterator lower_bound(const K& key): 
-  // template <typename K> const_iterator lower_bound(const K& key) const: 
-  // 
-  // Finds the first element with a key that is not less than `key` within the 
-  // `btree_map`. 
-  // 
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
-  using Base::lower_bound; 
- 
-  // btree_map::upper_bound() 
-  // 
-  // template <typename K> iterator upper_bound(const K& key): 
-  // template <typename K> const_iterator upper_bound(const K& key) const: 
-  // 
-  // Finds the first element with a key that is greater than `key` within the 
-  // `btree_map`. 
-  // 
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
-  using Base::upper_bound; 
- 
+  // btree_map::lower_bound()
+  //
+  // template <typename K> iterator lower_bound(const K& key):
+  // template <typename K> const_iterator lower_bound(const K& key) const:
+  //
+  // Finds the first element with a key that is not less than `key` within the
+  // `btree_map`.
+  //
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
+  using Base::lower_bound;
+
+  // btree_map::upper_bound()
+  //
+  // template <typename K> iterator upper_bound(const K& key):
+  // template <typename K> const_iterator upper_bound(const K& key) const:
+  //
+  // Finds the first element with a key that is greater than `key` within the
+  // `btree_map`.
+  //
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
+  using Base::upper_bound;
+
   // btree_map::operator[]()
   //
   // Returns a reference to the value mapped to the passed key within the
@@ -693,8 +693,8 @@ class btree_multimap
 
   // btree_multimap::merge()
   //
-  // Extracts all elements from a given `source` btree_multimap into this 
-  // `btree_multimap`. 
+  // Extracts all elements from a given `source` btree_multimap into this
+  // `btree_multimap`.
   using Base::merge;
 
   // btree_multimap::swap(btree_multimap& other)
@@ -714,8 +714,8 @@ class btree_multimap
   // Determines whether an element comparing equal to the given `key` exists
   // within the `btree_multimap`, returning `true` if so or `false` otherwise.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::contains;
 
   // btree_multimap::count()
@@ -725,8 +725,8 @@ class btree_multimap
   // Returns the number of elements comparing equal to the given `key` within
   // the `btree_multimap`.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::count;
 
   // btree_multimap::equal_range()
@@ -743,34 +743,34 @@ class btree_multimap
   //
   // Finds an element with the passed `key` within the `btree_multimap`.
   //
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
   using Base::find;
 
-  // btree_multimap::lower_bound() 
-  // 
-  // template <typename K> iterator lower_bound(const K& key): 
-  // template <typename K> const_iterator lower_bound(const K& key) const: 
-  // 
-  // Finds the first element with a key that is not less than `key` within the 
-  // `btree_multimap`. 
-  // 
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
-  using Base::lower_bound; 
- 
-  // btree_multimap::upper_bound() 
-  // 
-  // template <typename K> iterator upper_bound(const K& key): 
-  // template <typename K> const_iterator upper_bound(const K& key) const: 
-  // 
-  // Finds the first element with a key that is greater than `key` within the 
-  // `btree_multimap`. 
-  // 
-  // Supports heterogeneous lookup, provided that the map has a compatible 
-  // heterogeneous comparator. 
-  using Base::upper_bound; 
- 
+  // btree_multimap::lower_bound()
+  //
+  // template <typename K> iterator lower_bound(const K& key):
+  // template <typename K> const_iterator lower_bound(const K& key) const:
+  //
+  // Finds the first element with a key that is not less than `key` within the
+  // `btree_multimap`.
+  //
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
+  using Base::lower_bound;
+
+  // btree_multimap::upper_bound()
+  //
+  // template <typename K> iterator upper_bound(const K& key):
+  // template <typename K> const_iterator upper_bound(const K& key) const:
+  //
+  // Finds the first element with a key that is greater than `key` within the
+  // `btree_multimap`.
+  //
+  // Supports heterogeneous lookup, provided that the map has a compatible
+  // heterogeneous comparator.
+  using Base::upper_bound;
+
   // btree_multimap::get_allocator()
   //
   // Returns the allocator function associated with this `btree_multimap`.