From 3687d69f2ba8f11b7a05389ee8c3f898874113ab Mon Sep 17 00:00:00 2001
From: Jakob Rath <git@jakobrath.eu>
Date: Wed, 6 Sep 2023 10:21:06 +0200
Subject: [PATCH] cp var_queue

---
 src/math/polysat/pvar_queue.h | 100 ++++++++++++++++++++++++++++++++++
 1 file changed, 100 insertions(+)
 create mode 100644 src/math/polysat/pvar_queue.h

diff --git a/src/math/polysat/pvar_queue.h b/src/math/polysat/pvar_queue.h
new file mode 100644
index 000000000..7245153ca
--- /dev/null
+++ b/src/math/polysat/pvar_queue.h
@@ -0,0 +1,100 @@
+/*++
+Copyright (c) 2011 Microsoft Corporation
+
+Module Name:
+
+    var_queue.h
+
+Abstract:
+
+    SAT variable priority queue.
+
+Author:
+
+    Leonardo de Moura (leonardo) 2011-05-21.
+
+Revision History:
+
+--*/
+#pragma once
+
+#include "util/heap.h"
+
+
+    
+class var_queue {
+    typedef unsigned var;
+
+    struct lt {
+        svector<unsigned> & m_activity;
+    lt(svector<unsigned> & act):m_activity(act) {}
+        bool operator()(var v1, var v2) const { return m_activity[v1] > m_activity[v2]; }
+    };
+    heap<lt>  m_queue;
+public:
+
+    
+    var_queue(svector<unsigned> & act):m_queue(128, lt(act)) {}
+    
+    void activity_increased_eh(var v) {
+        if (m_queue.contains(v))
+            m_queue.decreased(v);
+    }
+    
+    void activity_changed_eh(var v, bool up) {
+        if (m_queue.contains(v)) {
+            if (up) 
+                m_queue.decreased(v);
+            else 
+                m_queue.increased(v);
+        }
+    }
+    
+    void mk_var_eh(var v) {
+        m_queue.reserve(v+1);
+        unassign_var_eh(v);
+    }
+    
+    void del_var_eh(var v) {
+        if (m_queue.contains(v))
+            m_queue.erase(v);
+    }
+    
+    void unassign_var_eh(var v) {
+        if (!m_queue.contains(v))
+            m_queue.insert(v);
+    }
+    
+    void reset() {
+        m_queue.reset();
+    }
+    
+    bool empty() const { return m_queue.empty(); }
+    
+    var next_var() { SASSERT(!empty()); return m_queue.erase_min(); }
+    
+    var min_var() { SASSERT(!empty()); return m_queue.min_value(); }
+    
+    bool more_active(var v1, var v2) const { return m_queue.less_than(v1, v2); }
+
+    std::ostream& display(std::ostream& out) const {
+        bool first = true;
+        for (auto v : m_queue) {
+            if (first) {
+                first = false;
+            } else {
+                out << " ";
+            }
+            out << v;
+        }
+        return out;
+    }
+
+    using const_iterator = decltype(m_queue)::const_iterator;
+    const_iterator begin() const { return m_queue.begin(); }
+    const_iterator end() const { return m_queue.end(); }
+};
+
+inline std::ostream& operator<<(std::ostream& out, var_queue const& queue) {
+    return queue.display(out);
+}