Set intersection for block check (idaholab#22563)

dschwen · Feb 22, 2023 · 6d909cb · 6d909cb
1 parent d7e150d
commit 6d909cb
Show file tree

Hide file tree

Showing 3 changed files with 31 additions and 31 deletions.
diff --git a/framework/include/utils/MooseUtils.h b/framework/include/utils/MooseUtils.h
@@ -1165,6 +1165,34 @@ get(const std::shared_ptr<T> & s)
   return s.get();
 }
 
+/**
+ * This method detects whether two sets intersect without building a result set.
+ * It exits as soon as any intersection is detected.
+ */
+template <class InputIterator>
+bool
+setsIntersect(InputIterator first1, InputIterator last1, InputIterator first2, InputIterator last2)
+{
+  while (first1 != last1 && first2 != last2)
+  {
+    if (*first1 == *first2)
+      return true;
+
+    if (*first1 < *first2)
+      ++first1;
+    else if (*first1 > *first2)
+      ++first2;
+  }
+  return false;
+}
+
+template <class T>
+bool
+setsIntersect(const T & s1, const T & s2)
+{
+  return setsIntersect(s1.begin(), s1.end(), s2.begin(), s2.end());
+}
+
 } // MooseUtils namespace
 
 /**

diff --git a/modules/phase_field/include/postprocessors/FeatureFloodCount.h b/modules/phase_field/include/postprocessors/FeatureFloodCount.h
@@ -541,29 +541,6 @@ class FeatureFloodCount : public GeneralPostprocessor,
    */
   void updateRegionOffsets();
 
-  /**
-   * This method detects whether two sets intersect without building a result set.
-   * It exits as soon as any intersection is detected.
-   */
-  template <class InputIterator>
-  static bool setsIntersect(InputIterator first1,
-                            InputIterator last1,
-                            InputIterator first2,
-                            InputIterator last2)
-  {
-    while (first1 != last1 && first2 != last2)
-    {
-      if (*first1 == *first2)
-        return true;
-
-      if (*first1 < *first2)
-        ++first1;
-      else if (*first1 > *first2)
-        ++first2;
-    }
-    return false;
-  }
-
   /*************************************************
    *************** Data Structures *****************
    ************************************************/

diff --git a/modules/phase_field/src/postprocessors/FeatureFloodCount.C b/modules/phase_field/src/postprocessors/FeatureFloodCount.C
@@ -1964,24 +1964,19 @@ FeatureFloodCount::FeatureData::boundingBoxesIntersect(const FeatureData & rhs)
 bool
 FeatureFloodCount::FeatureData::halosIntersect(const FeatureData & rhs) const
 {
-  return setsIntersect(
-      _halo_ids.begin(), _halo_ids.end(), rhs._halo_ids.begin(), rhs._halo_ids.end());
+  return MooseUtils::setsIntersect(_halo_ids, rhs._halo_ids);
 }
 
 bool
 FeatureFloodCount::FeatureData::periodicBoundariesIntersect(const FeatureData & rhs) const
 {
-  return setsIntersect(_periodic_nodes.begin(),
-                       _periodic_nodes.end(),
-                       rhs._periodic_nodes.begin(),
-                       rhs._periodic_nodes.end());
+  return MooseUtils::setsIntersect(_periodic_nodes, rhs._periodic_nodes);
 }
 
 bool
 FeatureFloodCount::FeatureData::ghostedIntersect(const FeatureData & rhs) const
 {
-  return setsIntersect(
-      _ghosted_ids.begin(), _ghosted_ids.end(), rhs._ghosted_ids.begin(), rhs._ghosted_ids.end());
+  return MooseUtils::setsIntersect(_ghosted_ids, rhs._ghosted_ids);
 }
 
 bool