[llvm] e930644 - [ADT] clang-format PackedVector.h (NFC)

Kazu Hirata via llvm-commits llvm-commits at lists.llvm.org
Sun Sep 28 11:07:38 PDT 2025


Author: Kazu Hirata
Date: 2025-09-28T11:07:30-07:00
New Revision: e930644394735c9349bab73a8c33f0d215cd35f4

URL: https://github.com/llvm/llvm-project/commit/e930644394735c9349bab73a8c33f0d215cd35f4
DIFF: https://github.com/llvm/llvm-project/commit/e930644394735c9349bab73a8c33f0d215cd35f4.diff

LOG: [ADT] clang-format PackedVector.h (NFC)

I'm planning to modify this file.

Added: 
    

Modified: 
    llvm/include/llvm/ADT/PackedVector.h

Removed: 
    


################################################################################
diff  --git a/llvm/include/llvm/ADT/PackedVector.h b/llvm/include/llvm/ADT/PackedVector.h
index 4e31d3f098d44..77fcbf24b2861 100644
--- a/llvm/include/llvm/ADT/PackedVector.h
+++ b/llvm/include/llvm/ADT/PackedVector.h
@@ -47,7 +47,7 @@ class PackedVectorBase<T, BitNum, BitVectorTy, true> {
 protected:
   static T getValue(const BitVectorTy &Bits, unsigned Idx) {
     T val = T();
-    for (unsigned i = 0; i != BitNum-1; ++i)
+    for (unsigned i = 0; i != BitNum - 1; ++i)
       val = T(val | ((Bits[(Idx * BitNum) + i] ? 1UL : 0UL) << i));
     if (Bits[(Idx * BitNum) + BitNum - 1])
       val = ~val;
@@ -61,8 +61,8 @@ class PackedVectorBase<T, BitNum, BitVectorTy, true> {
     } else {
       Bits.reset((Idx * BitNum) + BitNum - 1);
     }
-    assert((val >> (BitNum-1)) == 0 && "value is too big");
-    for (unsigned i = 0; i != BitNum-1; ++i)
+    assert((val >> (BitNum - 1)) == 0 && "value is too big");
+    for (unsigned i = 0; i != BitNum - 1; ++i)
       Bits[(Idx * BitNum) + i] = val & (T(1) << i);
   }
 };
@@ -75,8 +75,9 @@ class PackedVectorBase<T, BitNum, BitVectorTy, true> {
 /// will create a vector accepting values -2, -1, 0, 1. Any other value will hit
 /// an assertion.
 template <typename T, unsigned BitNum, typename BitVectorTy = BitVector>
-class PackedVector : public PackedVectorBase<T, BitNum, BitVectorTy,
-                                            std::numeric_limits<T>::is_signed> {
+class PackedVector
+    : public PackedVectorBase<T, BitNum, BitVectorTy,
+                              std::numeric_limits<T>::is_signed> {
   BitVectorTy Bits;
   // Keep track of the number of elements on our own.
   // We always maintain Bits.size() == NumElements * BitNum.
@@ -99,9 +100,7 @@ class PackedVector : public PackedVectorBase<T, BitNum, BitVectorTy,
       return *this;
     }
 
-    operator T() const {
-      return Vec.getValue(Vec.Bits, Idx);
-    }
+    operator T() const { return Vec.getValue(Vec.Bits, Idx); }
   };
 
   PackedVector() = default;
@@ -130,25 +129,17 @@ class PackedVector : public PackedVectorBase<T, BitNum, BitVectorTy,
   }
 
   void push_back(T val) {
-    resize(size()+1);
-    (*this)[size()-1] = val;
+    resize(size() + 1);
+    (*this)[size() - 1] = val;
   }
 
-  reference operator[](unsigned Idx) {
-    return reference(*this, Idx);
-  }
+  reference operator[](unsigned Idx) { return reference(*this, Idx); }
 
-  T operator[](unsigned Idx) const {
-    return base::getValue(Bits, Idx);
-  }
+  T operator[](unsigned Idx) const { return base::getValue(Bits, Idx); }
 
-  bool operator==(const PackedVector &RHS) const {
-    return Bits == RHS.Bits;
-  }
+  bool operator==(const PackedVector &RHS) const { return Bits == RHS.Bits; }
 
-  bool operator!=(const PackedVector &RHS) const {
-    return Bits != RHS.Bits;
-  }
+  bool operator!=(const PackedVector &RHS) const { return Bits != RHS.Bits; }
 
   PackedVector &operator|=(const PackedVector &RHS) {
     Bits |= RHS.Bits;


        


More information about the llvm-commits mailing list