rearrange comments to make more sense
[bigint-presentation-code.git] / src / bigint_presentation_code / compiler_ir.py
index 724841caa06af352abea69e839225084b420d216..7dd5aac199afa41474834fba54fdfb49c002cfec 100644 (file)
@@ -912,6 +912,8 @@ class LocSet(OFSet[Loc], Interned):
         if isinstance(other, LocSet):
             return max(self.max_conflicts_with(i) for i in other)
         else:
+            # now we do the equivalent of:
+            # return sum(other.conflicts(i) for i in self)
             reg_len = self.reg_len
             if reg_len is None:
                 return 0
@@ -919,8 +921,6 @@ class LocSet(OFSet[Loc], Interned):
             if starts is None:
                 return 0
             # now we do the equivalent of:
-            # return sum(other.conflicts(i) for i in self)
-            # which is the equivalent of:
             # return sum(other.start < start + reg_len
             #            and start < other.start + other.reg_len
             #            for start in starts)