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

1 files changed, 60 insertions, 60 deletions

diff --git a/contrib/restricted/abseil-cpp/absl/container/btree_set.h b/contrib/restricted/abseil-cpp/absl/container/btree_set.h
index 8973900693..b516a4c71c 100644
--- a/contrib/restricted/abseil-cpp/absl/container/btree_set.h
+++ b/contrib/restricted/abseil-cpp/absl/container/btree_set.h
@@ -300,8 +300,8 @@ class btree_set
   // Determines whether an element comparing equal to the given `key` exists
   // within the `btree_set`, returning `true` if so or `false` otherwise.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::contains;
 
   // btree_set::count()
@@ -312,8 +312,8 @@ class btree_set
   // the `btree_set`. Note that this function will return either `1` or `0`
   // since duplicate elements are not allowed within a `btree_set`.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::count;
 
   // btree_set::equal_range()
@@ -330,32 +330,32 @@ class btree_set
   //
   // Finds an element with the passed `key` within the `btree_set`.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::find;
 
-  // btree_set::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 that is not less than `key` within the `btree_set`.
-  //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
-  using Base::lower_bound;
-
-  // btree_set::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 that is greater than `key` within the `btree_set`.
-  //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
-  using Base::upper_bound;
-
+  // btree_set::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 that is not less than `key` within the `btree_set`. 
+  // 
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
+  using Base::lower_bound; 
+ 
+  // btree_set::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 that is greater than `key` within the `btree_set`. 
+  // 
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
+  using Base::upper_bound; 
+ 
   // btree_set::get_allocator()
   //
   // Returns the allocator function associated with this `btree_set`.
@@ -604,8 +604,8 @@ class btree_multiset
 
   // btree_multiset::merge()
   //
-  // Extracts all elements from a given `source` btree_multiset into this
-  // `btree_multiset`.
+  // Extracts all elements from a given `source` btree_multiset into this 
+  // `btree_multiset`. 
   using Base::merge;
 
   // btree_multiset::swap(btree_multiset& other)
@@ -625,8 +625,8 @@ class btree_multiset
   // Determines whether an element comparing equal to the given `key` exists
   // within the `btree_multiset`, returning `true` if so or `false` otherwise.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::contains;
 
   // btree_multiset::count()
@@ -636,8 +636,8 @@ class btree_multiset
   // Returns the number of elements comparing equal to the given `key` within
   // the `btree_multiset`.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::count;
 
   // btree_multiset::equal_range()
@@ -654,34 +654,34 @@ class btree_multiset
   //
   // Finds an element with the passed `key` within the `btree_multiset`.
   //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
   using Base::find;
 
-  // btree_multiset::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 that is not less than `key` within the
-  // `btree_multiset`.
-  //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
-  using Base::lower_bound;
-
-  // btree_multiset::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 that is greater than `key` within the
-  // `btree_multiset`.
-  //
-  // Supports heterogeneous lookup, provided that the set has a compatible
-  // heterogeneous comparator.
-  using Base::upper_bound;
-
+  // btree_multiset::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 that is not less than `key` within the 
+  // `btree_multiset`. 
+  // 
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
+  using Base::lower_bound; 
+ 
+  // btree_multiset::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 that is greater than `key` within the 
+  // `btree_multiset`. 
+  // 
+  // Supports heterogeneous lookup, provided that the set has a compatible 
+  // heterogeneous comparator. 
+  using Base::upper_bound; 
+ 
   // btree_multiset::get_allocator()
   //
   // Returns the allocator function associated with this `btree_multiset`.