diff --git a/meshmode/mesh/__init__.py b/meshmode/mesh/__init__.py
index 32efe9b9e43da5f6d4d995119609f8d9db38403a..3673158ab23c81ea9c9e4fef64b470c5bfc8c244 100644
--- a/meshmode/mesh/__init__.py
+++ b/meshmode/mesh/__init__.py
@@ -391,7 +391,7 @@ class InterPartitionAdj():
 
     def __init__(self):
         self.adjacent = dict()
-    
+
     def add_connection(self, elem, face, neighbor_elem, neighbor_face):
         self.adjacent[(elem, face)] = (neighbor_elem, neighbor_face)
 
diff --git a/test/test_meshmode.py b/test/test_meshmode.py
index 44ca2d0802dd2257978d6c2e266f559fde6ec861..e94a3512711cef8e68d47a2b6921e6138ced2370 100644
--- a/test/test_meshmode.py
+++ b/test/test_meshmode.py
@@ -112,8 +112,8 @@ def test_partition_boxes_mesh():
                 elem = f_grp.elements[idx]
                 face = f_grp.element_faces[idx]
                 for n_part_nr in range(num_parts):
-                    if tag >= 0 and \
-                    tag & new_meshes[part_nr].boundary_tag_bit(n_part_nr) != 0:
+                    # Is tag >= 0 always true?
+                    if tag & new_meshes[part_nr].boundary_tag_bit(n_part_nr) != 0:
                         # Is this the best way to probe the tag?
                         # Can one tag have multiple partition neighbors?
                         (n_elem, n_face) = new_meshes[part_nr].\