From 4c3c2ae4286cd36c555051d0246b33e9a96480dc Mon Sep 17 00:00:00 2001 From: Robert LeBlanc Date: Wed, 9 Mar 2016 18:57:25 +0000 Subject: [PATCH] common: WeightedPriorityQueue Boost 1.60.0 requires some more comparisions for advanced lookp and insertion functions. Signed-off-by: Robert LeBlanc --- src/common/WeightedPriorityQueue.h | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/src/common/WeightedPriorityQueue.h b/src/common/WeightedPriorityQueue.h index 54cb4b0595b6..82b1fa005d50 100644 --- a/src/common/WeightedPriorityQueue.h +++ b/src/common/WeightedPriorityQueue.h @@ -69,6 +69,12 @@ class WeightedPriorityQueue : public OpQueue 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 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(); } -- 2.47.3