interval_set: contains() returns true if a specified interval is entirely contained...

Signed-off-by: Alex Ainscow <aainscow@uk.ibm.com>

diff --git a/src/include/interval_set.h b/src/include/interval_set.h
index dfb2a306ca21340797c1c1b1944f9f7b684813e3..2e2e47e0d345963552cc081ac420feb779b45629 100644 (file)
--- a/src/include/interval_set.h
+++ b/src/include/interval_set.h
@@ -440,6 +440,11 @@ class interval_set {
     if (p->first+p->second < start+len) return false;
     return true;
   }
+  bool contains(interval_set const &other) const {
+    interval_set tmp;
+    tmp.intersection_of(*this, other);
+    return tmp == other;
+  }
   bool intersects(T start, T len) const {
     interval_set a;
     a.insert(start, len);