-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathMtx.cpp
More file actions
83 lines (63 loc) · 2.47 KB
/
Mtx.cpp
File metadata and controls
83 lines (63 loc) · 2.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/***************************************************************************
* *
* Copyright (c) 2017 *
* FastFieldSolvers S.R.L. http://www.fastfieldsolvers.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Lesser General Public License (LGPL) *
* as published by the Free Software Foundation; either version 2 of *
* the License, or (at your option) any later version. *
* for detail see the LICENCE text file. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU Library General Public License for more details. *
* *
* You should have received a copy of the GNU Library General Public *
* License along with this program; if not, write to the Free Software *
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 *
* USA *
* *
***************************************************************************/
// mtx.cpp
// basic numerical matrix class
//
#include "stdafx.h"
#include "Mtx.h"
using namespace std;
//
// constructors
//
std::ostream& operator<<(std::ostream &s, const CLin_Matrix &A)
{
CLin_subscript M;
CLin_subscript N;
M = A.num_rows();
N = A.num_cols();
s << M << " " << N << endl;
for (CLin_subscript i=0; i<M; i++)
{
for (CLin_subscript j=0; j<N; j++)
{
s << A[i][j] << " ";
}
s << endl;
}
return s;
}
std::istream& operator>>(std::istream &s, CLin_Matrix &A)
{
CLin_subscript M, N;
s >> M >> N;
if ( !(M == A.num_rows() && N == A.num_cols() ))
{
A.newsize(M,N);
}
for (CLin_subscript i=0; i<M; i++)
for (CLin_subscript j=0; j<N; j++)
{
s >> A[i][j];
}
return s;
}