mirror of
https://github.com/Z3Prover/z3
synced 2025-08-11 21:50:52 +00:00
f58b703ac5
* replace u_set by indexed_uint_set * replace u_set by indexed_uint_set * create insert-fresh and insert for indexed_uint_set to make use cases with non-fresh inserts easier Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * update nightly to pull arm Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * update nightly to pull arm Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * fixing the build of lp_tst * update nightly to pull arm Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> * replace u_set by indexed_uint_set * replace u_set by indexed_uint_set * fixing the build of lp_tst * remove unnecessery call to contains() before insert to indexed_uint_set * formatting, no check for contains() in indexed_uint_set, always init m_touched_rows to nullptr --------- Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com> Co-authored-by: Nikolaj Bjorner <nbjorner@microsoft.com>
43 lines
898 B
C++
43 lines
898 B
C++
/*++
|
|
Copyright (c) 2017 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
<name>
|
|
|
|
Abstract:
|
|
|
|
<abstract>
|
|
|
|
Author:
|
|
|
|
Lev Nachmanson (levnach)
|
|
|
|
Revision History:
|
|
|
|
|
|
--*/
|
|
|
|
#pragma once
|
|
#include <set>
|
|
#include "util/vector.h"
|
|
#include <unordered_map>
|
|
#include <string>
|
|
#include <algorithm>
|
|
#include "math/lp/lp_settings.h"
|
|
#include "util/uint_set.h"
|
|
// see http://research.microsoft.com/projects/z3/smt07.pdf
|
|
// The class searches for a feasible solution with as many different values of variables as it can find
|
|
namespace lp {
|
|
template <typename T> struct numeric_pair; // forward definition
|
|
class lar_solver; // forward definition
|
|
class random_updater {
|
|
indexed_uint_set m_var_set;
|
|
lar_solver & m_lar_solver;
|
|
unsigned m_range;
|
|
bool shift_var(unsigned j);
|
|
public:
|
|
random_updater(lar_solver & solver, const vector<unsigned> & column_list);
|
|
void update();
|
|
};
|
|
}
|