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

1 files changed, 11 insertions, 11 deletions

diff --git a/contrib/libs/llvm12/include/llvm/ADT/BitVector.h b/contrib/libs/llvm12/include/llvm/ADT/BitVector.h
index c1806c6d23..69a00a99b6 100644
--- a/contrib/libs/llvm12/include/llvm/ADT/BitVector.h
+++ b/contrib/libs/llvm12/include/llvm/ADT/BitVector.h
@@ -210,10 +210,10 @@ public:
     return !any();
   }
 
-  /// find_first_in - Returns the index of the first set / unset bit,
-  /// depending on \p Set, in the range [Begin, End).
-  /// Returns -1 if all bits in the range are unset / set.
-  int find_first_in(unsigned Begin, unsigned End, bool Set = true) const {
+  /// find_first_in - Returns the index of the first set / unset bit, 
+  /// depending on \p Set, in the range [Begin, End). 
+  /// Returns -1 if all bits in the range are unset / set. 
+  int find_first_in(unsigned Begin, unsigned End, bool Set = true) const { 
     assert(Begin <= End && End <= Size);
     if (Begin == End)
       return -1;
@@ -222,14 +222,14 @@ public:
     unsigned LastWord = (End - 1) / BITWORD_SIZE;
 
     // Check subsequent words.
-    // The code below is based on search for the first _set_ bit. If
-    // we're searching for the first _unset_, we just take the
-    // complement of each word before we use it and apply
-    // the same method.
+    // The code below is based on search for the first _set_ bit. If 
+    // we're searching for the first _unset_, we just take the 
+    // complement of each word before we use it and apply 
+    // the same method. 
     for (unsigned i = FirstWord; i <= LastWord; ++i) {
       BitWord Copy = Bits[i];
-      if (!Set)
-        Copy = ~Copy;
+      if (!Set) 
+        Copy = ~Copy; 
 
       if (i == FirstWord) {
         unsigned FirstBit = Begin % BITWORD_SIZE;
@@ -280,7 +280,7 @@ public:
   /// find_first_unset_in - Returns the index of the first unset bit in the
   /// range [Begin, End).  Returns -1 if all bits in the range are set.
   int find_first_unset_in(unsigned Begin, unsigned End) const {
-    return find_first_in(Begin, End, /* Set = */ false);
+    return find_first_in(Begin, End, /* Set = */ false); 
   }
 
   /// find_last_unset_in - Returns the index of the last unset bit in the