CarpetLib: Implement bboxset::contains(vect)

2 files changed, 15 insertions, 1 deletions

diff --git a/Carpet/CarpetLib/src/bboxset.cc b/Carpet/CarpetLib/src/bboxset.cc
index abeb5c0ee..e94f17f43 100644
--- a/Carpet/CarpetLib/src/bboxset.cc
+++ b/Carpet/CarpetLib/src/bboxset.cc
@@ -283,9 +283,19 @@ typename bboxset<T,D>::size_type bboxset<T,D>::size () const
 
 
 
-
 // Queries
 
+// Containment
+// cost: O(n)
+template<typename T, int D>
+bool bboxset<T,D>::contains (const vect<T,D>& x) const
+{
+  for (const_iterator bi=begin(), be=end(); bi!=be; ++bi) {
+    if ((*bi).contains(x)) return true;
+  }
+  return false;
+}
+
 // Intersection
 // cost: O(n)
 template<typename T, int D>
diff --git a/Carpet/CarpetLib/src/bboxset.hh b/Carpet/CarpetLib/src/bboxset.hh
index 6b92bb1c4..a8e2ab0ad 100644
--- a/Carpet/CarpetLib/src/bboxset.hh
+++ b/Carpet/CarpetLib/src/bboxset.hh
@@ -122,6 +122,10 @@ public:
   size_type size () const CCTK_MEMBER_ATTRIBUTE_PURE; // cost: O(n)
   int setsize () const { return bs.size(); } // cost: O(1)
   
+  // Find out whether the bbox contains the point x
+  bool contains (const vect<T,D>& x)
+    const CCTK_MEMBER_ATTRIBUTE_PURE; // cost: O(n)
+  
   // Find out whether this bboxset intersects the bbox b
   bool intersects (const box& b) const CCTK_MEMBER_ATTRIBUTE_PURE; // cost: O(n)