104 lines
2.9 KiB
C++
104 lines
2.9 KiB
C++
/*
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Lev Nachmanson
|
|
*/
|
|
#ifdef LEAN_DEBUG
|
|
#include <cmath>
|
|
#include <vector>
|
|
#include <string>
|
|
#include "util/lp/matrix.h"
|
|
namespace lean {
|
|
template <typename T, typename X>
|
|
bool matrix<T, X>::is_equal(const matrix<T, X>& other) {
|
|
if (other.row_count() != row_count() || other.column_count() != column_count())
|
|
return false;
|
|
for (unsigned i = 0; i < row_count(); i++) {
|
|
for (unsigned j = 0; j < column_count(); j++) {
|
|
auto a = get_elem(i, j);
|
|
auto b = other.get_elem(i, j);
|
|
if (numeric_traits<T>::precise()) {
|
|
if (a != b) return false;
|
|
} else if (fabs(numeric_traits<T>::get_double(a - b)) > 0.000001) {
|
|
// cout << "returning false from operator== of matrix comparison" << endl;
|
|
// cout << "this matrix is " << endl;
|
|
// print_matrix(*this);
|
|
// cout << "other matrix is " << endl;
|
|
// print_matrix(other);
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
template <typename T, typename X>
|
|
void apply_to_vector(matrix<T, X> & m, T * w) {
|
|
// here m is a square matrix
|
|
unsigned dim = m.row_count();
|
|
|
|
T * wc = new T[dim];
|
|
|
|
for (unsigned i = 0; i < dim; i++) {
|
|
wc[i] = w[i];
|
|
}
|
|
|
|
for (unsigned i = 0; i < dim; i++) {
|
|
T t = numeric_traits<T>::zero();
|
|
for (unsigned j = 0; j < dim; j++) {
|
|
t += m(i, j) * wc[j];
|
|
}
|
|
w[i] = t;
|
|
}
|
|
delete [] wc;
|
|
}
|
|
|
|
|
|
|
|
unsigned get_width_of_column(unsigned j, std::vector<std::vector<std::string>> & A) {
|
|
unsigned r = 0;
|
|
for (unsigned i = 0; i < A.size(); i++) {
|
|
unsigned s = A[i][j].size();
|
|
if (r < s) {
|
|
r = s;
|
|
}
|
|
}
|
|
return r;
|
|
}
|
|
|
|
void print_matrix_with_widths(std::vector<std::vector<std::string>> & A, std::vector<unsigned> & ws, std::ostream & out) {
|
|
for (unsigned i = 0; i < A.size(); i++) {
|
|
for (unsigned j = 0; j < A[i].size(); j++) {
|
|
print_blanks(ws[j] - A[i][j].size(), out);
|
|
out << A[i][j] << " ";
|
|
}
|
|
out << std::endl;
|
|
}
|
|
}
|
|
|
|
void print_string_matrix(std::vector<std::vector<std::string>> & A, std::ostream & out) {
|
|
std::vector<unsigned> widths;
|
|
|
|
for (unsigned j = 0; j < A[0].size(); j++) {
|
|
widths.push_back(get_width_of_column(j, A));
|
|
}
|
|
|
|
print_matrix_with_widths(A, widths, out);
|
|
out << std::endl;
|
|
}
|
|
|
|
template <typename T, typename X>
|
|
void print_matrix(matrix<T, X> const & m, std::ostream & out) {
|
|
std::vector<std::vector<std::string>> A(m.row_count());
|
|
for (unsigned i = 0; i < m.row_count(); i++) {
|
|
for (unsigned j = 0; j < m.column_count(); j++) {
|
|
A[i].push_back(T_to_string(m.get_elem(i, j)));
|
|
}
|
|
}
|
|
|
|
print_string_matrix(A, out);
|
|
}
|
|
|
|
}
|
|
#endif
|