mirror of
https://github.com/Z3Prover/z3
synced 2025-04-26 02:25:32 +00:00
42 lines
1.2 KiB
C++
42 lines
1.2 KiB
C++
/*
|
|
Copyright (c) 2017 Microsoft Corporation
|
|
Author: Lev Nachmanson
|
|
*/
|
|
#pragma once
|
|
#include "util/lp/iterator_on_indexed_vector.h"
|
|
namespace lean {
|
|
template <typename T>
|
|
struct iterator_on_pivot_row:linear_combination_iterator<T> {
|
|
bool m_basis_returned = false;
|
|
const indexed_vector<T> & m_v;
|
|
unsigned m_basis_j;
|
|
iterator_on_indexed_vector<T> m_it;
|
|
unsigned size() const { return m_it.size(); }
|
|
iterator_on_pivot_row(const indexed_vector<T> & v, unsigned basis_j) : m_v(v), m_basis_j(basis_j), m_it(v) {}
|
|
bool next(T & a, unsigned & i) {
|
|
if (m_basis_returned == false) {
|
|
m_basis_returned = true;
|
|
a = one_of_type<T>();
|
|
i = m_basis_j;
|
|
return true;
|
|
}
|
|
return m_it.next(a, i);
|
|
}
|
|
bool next(unsigned & i) {
|
|
if (m_basis_returned == false) {
|
|
m_basis_returned = true;
|
|
i = m_basis_j;
|
|
return true;
|
|
}
|
|
return m_it.next(i);
|
|
}
|
|
void reset() {
|
|
m_basis_returned = false;
|
|
m_it.reset();
|
|
}
|
|
linear_combination_iterator<T> * clone() {
|
|
iterator_on_pivot_row * r = new iterator_on_pivot_row(m_v, m_basis_j);
|
|
return r;
|
|
}
|
|
};
|
|
}
|