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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/* matrix/file_source.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or (at
* your option) any later version.
*
* 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
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
int
FUNCTION (gsl_matrix, fread) (FILE * stream, TYPE (gsl_matrix) * m)
{
int status = 0;
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda;
if (tda == size2) /* the rows are contiguous */
{
status = FUNCTION (gsl_block, raw_fread) (stream,
m->data,
size1 * size2, 1);
}
else
{
size_t i;
for (i = 0 ; i < size1 ; i++) /* read each row separately */
{
status = FUNCTION (gsl_block, raw_fread) (stream,
m->data + i * MULTIPLICITY * tda,
size2, 1);
if (status)
break;
}
}
return status;
}
int
FUNCTION (gsl_matrix, fwrite) (FILE * stream, const TYPE (gsl_matrix) * m)
{
int status = 0;
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda;
if (tda == size2) /* the rows are contiguous */
{
status = FUNCTION (gsl_block, raw_fwrite) (stream,
m->data,
size1 * size2, 1);
}
else
{
size_t i;
for (i = 0 ; i < size1 ; i++) /* write each row separately */
{
status = FUNCTION (gsl_block, raw_fwrite) (stream,
m->data + i * MULTIPLICITY * tda,
size2, 1);
if (status)
break;
}
}
return status;
}
#if !(USES_LONGDOUBLE && !HAVE_PRINTF_LONGDOUBLE)
int
FUNCTION (gsl_matrix, fprintf) (FILE * stream, const TYPE (gsl_matrix) * m,
const char *format)
{
int status = 0;
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda;
if (tda == size2) /* the rows are contiguous */
{
status = FUNCTION (gsl_block, raw_fprintf) (stream,
m->data,
size1 * size2, 1,
format);
}
else
{
size_t i;
for (i = 0 ; i < size1 ; i++) /* print each row separately */
{
status = FUNCTION (gsl_block, raw_fprintf) (stream,
m->data + i * MULTIPLICITY * tda,
size2, 1,
format);
if (status)
break;
}
}
return status;
}
int
FUNCTION (gsl_matrix, fscanf) (FILE * stream, TYPE (gsl_matrix) * m)
{
int status = 0;
const size_t size1 = m->size1;
const size_t size2 = m->size2;
const size_t tda = m->tda;
if (tda == size2) /* the rows are contiguous */
{
status = FUNCTION (gsl_block, raw_fscanf) (stream,
m->data,
size1 * size2, 1);
}
else
{
size_t i;
for (i = 0 ; i < size1 ; i++) /* scan each row separately */
{
status = FUNCTION (gsl_block, raw_fscanf) (stream,
m->data + i * MULTIPLICITY * tda,
size2, 1);
if (status)
break;
}
}
return status;
}
#endif
|
