|
sl@0
|
1 |
//
|
|
sl@0
|
2 |
// Copyright (c) 2000-2002
|
|
sl@0
|
3 |
// Joerg Walter, Mathias Koch
|
|
sl@0
|
4 |
//
|
|
sl@0
|
5 |
// Permission to use, copy, modify, distribute and sell this software
|
|
sl@0
|
6 |
// and its documentation for any purpose is hereby granted without fee,
|
|
sl@0
|
7 |
// provided that the above copyright notice appear in all copies and
|
|
sl@0
|
8 |
// that both that copyright notice and this permission notice appear
|
|
sl@0
|
9 |
// in supporting documentation. The authors make no representations
|
|
sl@0
|
10 |
// about the suitability of this software for any purpose.
|
|
sl@0
|
11 |
// It is provided "as is" without express or implied warranty.
|
|
sl@0
|
12 |
//
|
|
sl@0
|
13 |
// The authors gratefully acknowledge the support of
|
|
sl@0
|
14 |
// GeNeSys mbH & Co. KG in producing this work.
|
|
sl@0
|
15 |
//
|
|
sl@0
|
16 |
|
|
sl@0
|
17 |
#ifndef _BOOST_UBLAS_IO_
|
|
sl@0
|
18 |
#define _BOOST_UBLAS_IO_
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
// Only forward definition required to define stream operations
|
|
sl@0
|
21 |
#include <iosfwd>
|
|
sl@0
|
22 |
#include <boost/numeric/ublas/matrix_expression.hpp>
|
|
sl@0
|
23 |
|
|
sl@0
|
24 |
|
|
sl@0
|
25 |
namespace boost { namespace numeric { namespace ublas {
|
|
sl@0
|
26 |
|
|
sl@0
|
27 |
template<class E, class T, class VE>
|
|
sl@0
|
28 |
// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
|
|
sl@0
|
29 |
std::basic_ostream<E, T> &operator << (std::basic_ostream<E, T> &os,
|
|
sl@0
|
30 |
const vector_expression<VE> &v) {
|
|
sl@0
|
31 |
typedef typename VE::size_type size_type;
|
|
sl@0
|
32 |
size_type size = v ().size ();
|
|
sl@0
|
33 |
std::basic_ostringstream<E, T, std::allocator<E> > s;
|
|
sl@0
|
34 |
s.flags (os.flags ());
|
|
sl@0
|
35 |
s.imbue (os.getloc ());
|
|
sl@0
|
36 |
s.precision (os.precision ());
|
|
sl@0
|
37 |
s << '[' << size << "](";
|
|
sl@0
|
38 |
if (size > 0)
|
|
sl@0
|
39 |
s << v () (0);
|
|
sl@0
|
40 |
for (size_type i = 1; i < size; ++ i)
|
|
sl@0
|
41 |
s << ',' << v () (i);
|
|
sl@0
|
42 |
s << ')';
|
|
sl@0
|
43 |
return os << s.str ().c_str ();
|
|
sl@0
|
44 |
}
|
|
sl@0
|
45 |
|
|
sl@0
|
46 |
template<class E, class T, class VT, class VA>
|
|
sl@0
|
47 |
// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
|
|
sl@0
|
48 |
std::basic_istream<E, T> &operator >> (std::basic_istream<E, T> &is,
|
|
sl@0
|
49 |
vector<VT, VA> &v) {
|
|
sl@0
|
50 |
typedef typename vector<VT, VA>::size_type size_type;
|
|
sl@0
|
51 |
E ch;
|
|
sl@0
|
52 |
size_type size;
|
|
sl@0
|
53 |
if (is >> ch && ch != '[') {
|
|
sl@0
|
54 |
is.putback (ch);
|
|
sl@0
|
55 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
56 |
} else if (is >> size >> ch && ch != ']') {
|
|
sl@0
|
57 |
is.putback (ch);
|
|
sl@0
|
58 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
59 |
} else if (! is.fail ()) {
|
|
sl@0
|
60 |
vector<VT, VA> s (size);
|
|
sl@0
|
61 |
if (is >> ch && ch != '(') {
|
|
sl@0
|
62 |
is.putback (ch);
|
|
sl@0
|
63 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
64 |
} else if (! is.fail ()) {
|
|
sl@0
|
65 |
for (size_type i = 0; i < size; i ++) {
|
|
sl@0
|
66 |
if (is >> s (i) >> ch && ch != ',') {
|
|
sl@0
|
67 |
is.putback (ch);
|
|
sl@0
|
68 |
if (i < size - 1)
|
|
sl@0
|
69 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
70 |
break;
|
|
sl@0
|
71 |
}
|
|
sl@0
|
72 |
}
|
|
sl@0
|
73 |
if (is >> ch && ch != ')') {
|
|
sl@0
|
74 |
is.putback (ch);
|
|
sl@0
|
75 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
76 |
}
|
|
sl@0
|
77 |
}
|
|
sl@0
|
78 |
if (! is.fail ())
|
|
sl@0
|
79 |
v.swap (s);
|
|
sl@0
|
80 |
}
|
|
sl@0
|
81 |
return is;
|
|
sl@0
|
82 |
}
|
|
sl@0
|
83 |
|
|
sl@0
|
84 |
template<class E, class T, class ME>
|
|
sl@0
|
85 |
// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
|
|
sl@0
|
86 |
std::basic_ostream<E, T> &operator << (std::basic_ostream<E, T> &os,
|
|
sl@0
|
87 |
const matrix_expression<ME> &m) {
|
|
sl@0
|
88 |
typedef typename ME::size_type size_type;
|
|
sl@0
|
89 |
size_type size1 = m ().size1 ();
|
|
sl@0
|
90 |
size_type size2 = m ().size2 ();
|
|
sl@0
|
91 |
std::basic_ostringstream<E, T, std::allocator<E> > s;
|
|
sl@0
|
92 |
s.flags (os.flags ());
|
|
sl@0
|
93 |
s.imbue (os.getloc ());
|
|
sl@0
|
94 |
s.precision (os.precision ());
|
|
sl@0
|
95 |
s << '[' << size1 << ',' << size2 << "](";
|
|
sl@0
|
96 |
if (size1 > 0) {
|
|
sl@0
|
97 |
s << '(' ;
|
|
sl@0
|
98 |
if (size2 > 0)
|
|
sl@0
|
99 |
s << m () (0, 0);
|
|
sl@0
|
100 |
for (size_type j = 1; j < size2; ++ j)
|
|
sl@0
|
101 |
s << ',' << m () (0, j);
|
|
sl@0
|
102 |
s << ')';
|
|
sl@0
|
103 |
}
|
|
sl@0
|
104 |
for (size_type i = 1; i < size1; ++ i) {
|
|
sl@0
|
105 |
s << ",(" ;
|
|
sl@0
|
106 |
if (size2 > 0)
|
|
sl@0
|
107 |
s << m () (i, 0);
|
|
sl@0
|
108 |
for (size_type j = 1; j < size2; ++ j)
|
|
sl@0
|
109 |
s << ',' << m () (i, j);
|
|
sl@0
|
110 |
s << ')';
|
|
sl@0
|
111 |
}
|
|
sl@0
|
112 |
s << ')';
|
|
sl@0
|
113 |
return os << s.str ().c_str ();
|
|
sl@0
|
114 |
}
|
|
sl@0
|
115 |
|
|
sl@0
|
116 |
template<class E, class T, class MT, class MF, class MA>
|
|
sl@0
|
117 |
// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
|
|
sl@0
|
118 |
std::basic_istream<E, T> &operator >> (std::basic_istream<E, T> &is,
|
|
sl@0
|
119 |
matrix<MT, MF, MA> &m) {
|
|
sl@0
|
120 |
typedef typename matrix<MT, MF, MA>::size_type size_type;
|
|
sl@0
|
121 |
E ch;
|
|
sl@0
|
122 |
size_type size1, size2;
|
|
sl@0
|
123 |
if (is >> ch && ch != '[') {
|
|
sl@0
|
124 |
is.putback (ch);
|
|
sl@0
|
125 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
126 |
} else if (is >> size1 >> ch && ch != ',') {
|
|
sl@0
|
127 |
is.putback (ch);
|
|
sl@0
|
128 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
129 |
} else if (is >> size2 >> ch && ch != ']') {
|
|
sl@0
|
130 |
is.putback (ch);
|
|
sl@0
|
131 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
132 |
} else if (! is.fail ()) {
|
|
sl@0
|
133 |
matrix<MT, MF, MA> s (size1, size2);
|
|
sl@0
|
134 |
if (is >> ch && ch != '(') {
|
|
sl@0
|
135 |
is.putback (ch);
|
|
sl@0
|
136 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
137 |
} else if (! is.fail ()) {
|
|
sl@0
|
138 |
for (size_type i = 0; i < size1; i ++) {
|
|
sl@0
|
139 |
if (is >> ch && ch != '(') {
|
|
sl@0
|
140 |
is.putback (ch);
|
|
sl@0
|
141 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
142 |
break;
|
|
sl@0
|
143 |
}
|
|
sl@0
|
144 |
for (size_type j = 0; j < size2; j ++) {
|
|
sl@0
|
145 |
if (is >> s (i, j) >> ch && ch != ',') {
|
|
sl@0
|
146 |
is.putback (ch);
|
|
sl@0
|
147 |
if (j < size2 - 1) {
|
|
sl@0
|
148 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
149 |
break;
|
|
sl@0
|
150 |
}
|
|
sl@0
|
151 |
}
|
|
sl@0
|
152 |
}
|
|
sl@0
|
153 |
if (is >> ch && ch != ')') {
|
|
sl@0
|
154 |
is.putback (ch);
|
|
sl@0
|
155 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
156 |
break;
|
|
sl@0
|
157 |
}
|
|
sl@0
|
158 |
if (is >> ch && ch != ',') {
|
|
sl@0
|
159 |
is.putback (ch);
|
|
sl@0
|
160 |
if (i < size1 - 1) {
|
|
sl@0
|
161 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
162 |
break;
|
|
sl@0
|
163 |
}
|
|
sl@0
|
164 |
}
|
|
sl@0
|
165 |
}
|
|
sl@0
|
166 |
if (is >> ch && ch != ')') {
|
|
sl@0
|
167 |
is.putback (ch);
|
|
sl@0
|
168 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
169 |
}
|
|
sl@0
|
170 |
}
|
|
sl@0
|
171 |
if (! is.fail ())
|
|
sl@0
|
172 |
m.swap (s);
|
|
sl@0
|
173 |
}
|
|
sl@0
|
174 |
return is;
|
|
sl@0
|
175 |
}
|
|
sl@0
|
176 |
|
|
sl@0
|
177 |
// Special input operator for symmetrix_matrix
|
|
sl@0
|
178 |
template<class E, class T, class MT, class MF1, class MF2, class MA>
|
|
sl@0
|
179 |
// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
|
|
sl@0
|
180 |
std::basic_istream<E, T> &operator >> (std::basic_istream<E, T> &is,
|
|
sl@0
|
181 |
symmetric_matrix<MT, MF1, MF2, MA> &m) {
|
|
sl@0
|
182 |
typedef typename symmetric_matrix<MT, MF1, MF2, MA>::size_type size_type;
|
|
sl@0
|
183 |
E ch;
|
|
sl@0
|
184 |
size_type size1, size2;
|
|
sl@0
|
185 |
MT value;
|
|
sl@0
|
186 |
if (is >> ch && ch != '[') {
|
|
sl@0
|
187 |
is.putback (ch);
|
|
sl@0
|
188 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
189 |
} else if (is >> size1 >> ch && ch != ',') {
|
|
sl@0
|
190 |
is.putback (ch);
|
|
sl@0
|
191 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
192 |
} else if (is >> size2 >> ch && (size2 != size1 || ch != ']')) { // symmetric matrix must be square
|
|
sl@0
|
193 |
is.putback (ch);
|
|
sl@0
|
194 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
195 |
} else if (! is.fail ()) {
|
|
sl@0
|
196 |
symmetric_matrix<MT, MF1, MF2, MA> s (size1, size2);
|
|
sl@0
|
197 |
if (is >> ch && ch != '(') {
|
|
sl@0
|
198 |
is.putback (ch);
|
|
sl@0
|
199 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
200 |
} else if (! is.fail ()) {
|
|
sl@0
|
201 |
for (size_type i = 0; i < size1; i ++) {
|
|
sl@0
|
202 |
if (is >> ch && ch != '(') {
|
|
sl@0
|
203 |
is.putback (ch);
|
|
sl@0
|
204 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
205 |
break;
|
|
sl@0
|
206 |
}
|
|
sl@0
|
207 |
for (size_type j = 0; j < size2; j ++) {
|
|
sl@0
|
208 |
if (is >> value >> ch && ch != ',') {
|
|
sl@0
|
209 |
is.putback (ch);
|
|
sl@0
|
210 |
if (j < size2 - 1) {
|
|
sl@0
|
211 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
212 |
break;
|
|
sl@0
|
213 |
}
|
|
sl@0
|
214 |
}
|
|
sl@0
|
215 |
if (i <= j) {
|
|
sl@0
|
216 |
// this is the first time we read this element - set the value
|
|
sl@0
|
217 |
s(i,j) = value;
|
|
sl@0
|
218 |
}
|
|
sl@0
|
219 |
else if ( s(i,j) != value ) {
|
|
sl@0
|
220 |
// matrix is not symmetric
|
|
sl@0
|
221 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
222 |
break;
|
|
sl@0
|
223 |
}
|
|
sl@0
|
224 |
}
|
|
sl@0
|
225 |
if (is >> ch && ch != ')') {
|
|
sl@0
|
226 |
is.putback (ch);
|
|
sl@0
|
227 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
228 |
break;
|
|
sl@0
|
229 |
}
|
|
sl@0
|
230 |
if (is >> ch && ch != ',') {
|
|
sl@0
|
231 |
is.putback (ch);
|
|
sl@0
|
232 |
if (i < size1 - 1) {
|
|
sl@0
|
233 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
234 |
break;
|
|
sl@0
|
235 |
}
|
|
sl@0
|
236 |
}
|
|
sl@0
|
237 |
}
|
|
sl@0
|
238 |
if (is >> ch && ch != ')') {
|
|
sl@0
|
239 |
is.putback (ch);
|
|
sl@0
|
240 |
is.setstate (std::ios_base::failbit);
|
|
sl@0
|
241 |
}
|
|
sl@0
|
242 |
}
|
|
sl@0
|
243 |
if (! is.fail ())
|
|
sl@0
|
244 |
m.swap (s);
|
|
sl@0
|
245 |
}
|
|
sl@0
|
246 |
return is;
|
|
sl@0
|
247 |
}
|
|
sl@0
|
248 |
|
|
sl@0
|
249 |
|
|
sl@0
|
250 |
}}}
|
|
sl@0
|
251 |
|
|
sl@0
|
252 |
#endif
|