mirror of
https://github.com/Z3Prover/z3
synced 2025-04-29 20:05:51 +00:00
Partial cleanup of util/lp/*
This commit is contained in:
parent
00651f8f21
commit
d61b722b68
109 changed files with 3503 additions and 2023 deletions
|
@ -1,7 +1,22 @@
|
|||
/*
|
||||
Copyright (c) 2017 Microsoft Corporation
|
||||
Author: Lev Nachmanson
|
||||
*/
|
||||
/*++
|
||||
Copyright (c) 2017 Microsoft Corporation
|
||||
|
||||
Module Name:
|
||||
|
||||
<name>
|
||||
|
||||
Abstract:
|
||||
|
||||
<abstract>
|
||||
|
||||
Author:
|
||||
|
||||
Lev Nachmanson (levnach)
|
||||
|
||||
Revision History:
|
||||
|
||||
|
||||
--*/
|
||||
#pragma once
|
||||
#include "util/vector.h"
|
||||
#include "util/lp/linear_combination_iterator.h"
|
||||
|
@ -16,7 +31,7 @@
|
|||
// In the same loop trying to pin variables by pushing the partial sum up, denoting the variable related to it by _l
|
||||
|
||||
// here in addition we assume that all coefficient in the row are positive
|
||||
namespace lean {
|
||||
namespace lp {
|
||||
|
||||
class test_bound_analyzer {
|
||||
linear_combination_iterator<mpq> & m_it;
|
||||
|
@ -74,7 +89,7 @@ public :
|
|||
void analyze_i_for_upper(unsigned i) {
|
||||
mpq l;
|
||||
bool strict = false;
|
||||
lean_assert(is_zero(l));
|
||||
SASSERT(is_zero(l));
|
||||
for (unsigned k = 0; k < m_index.size(); k++) {
|
||||
if (k == i)
|
||||
continue;
|
||||
|
@ -165,7 +180,7 @@ public :
|
|||
|
||||
void analyze_i_for_lower(unsigned i) {
|
||||
mpq l;
|
||||
lean_assert(is_zero(l));
|
||||
SASSERT(is_zero(l));
|
||||
bool strict = false;
|
||||
for (unsigned k = 0; k < m_index.size(); k++) {
|
||||
if (k == i)
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue