common: WeightedPriorityQueue Boost 1.60.0 requires some more

comparisions for advanced lookp and insertion functions.

Signed-off-by: Robert LeBlanc <robert.leblanc@endurance.com>

diff --git a/src/common/WeightedPriorityQueue.h b/src/common/WeightedPriorityQueue.h
index 54cb4b0595b6aaef7e7a53367d6c43174736ff0b..82b1fa005d50b73ff73a05b3dfcf1534fbb42cd2 100644 (file)
--- a/src/common/WeightedPriorityQueue.h
+++ b/src/common/WeightedPriorityQueue.h
@@ -69,6 +69,12 @@ class WeightedPriorityQueue :  public OpQueue <T, K>
         Klass(K& k) :
           key(k)
           {}
+      friend bool operator< (const Klass &a, const Klass &b)
+        { return a.key < b.key; }
+      friend bool operator> (const Klass &a, const Klass &b)
+        { return a.key > b.key; }
+      friend bool operator== (const Klass &a, const Klass &b)
+        { return a.key == b.key; }
       void insert(unsigned cost, T& item, bool front) {
         if (front) {
           lp.push_front(*new ListPair(cost, item));
@@ -144,6 +150,12 @@ class WeightedPriorityQueue :  public OpQueue <T, K>
          key(p),
          next(klasses.begin())
          {}
+      friend bool operator< (const SubQueue &a, const SubQueue &b)
+        { return a.key < b.key; }
+      friend bool operator> (const SubQueue &a, const SubQueue &b)
+        { return a.key > b.key; }
+      friend bool operator== (const SubQueue &a, const SubQueue &b)
+        { return a.key == b.key; }
       bool empty() const {
         return klasses.empty();
       }