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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
|
/* spgetset.c
*
* Copyright (C) 2012 Patrick Alken
*
* 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.
*/
#include <config.h>
#include <stdlib.h>
#include <math.h>
#include <gsl/gsl_math.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_spmatrix.h>
#include "avl.c"
static void *tree_find(const gsl_spmatrix *m, const size_t i, const size_t j);
double
gsl_spmatrix_get(const gsl_spmatrix *m, const size_t i, const size_t j)
{
if (i >= m->size1)
{
GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0.0);
}
else if (j >= m->size2)
{
GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0.0);
}
else
{
if (GSL_SPMATRIX_ISTRIPLET(m))
{
/* traverse binary tree to search for (i,j) element */
void *ptr = tree_find(m, i, j);
double x = ptr ? *(double *) ptr : 0.0;
return x;
}
else if (GSL_SPMATRIX_ISCCS(m))
{
const size_t *mi = m->i;
const size_t *mp = m->p;
size_t p;
/* loop over column j and search for row index i */
for (p = mp[j]; p < mp[j + 1]; ++p)
{
if (mi[p] == i)
return m->data[p];
}
}
else if (GSL_SPMATRIX_ISCRS(m))
{
const size_t *mj = m->i;
const size_t *mp = m->p;
size_t p;
/* loop over row i and search for column index j */
for (p = mp[i]; p < mp[i + 1]; ++p)
{
if (mj[p] == j)
return m->data[p];
}
}
else
{
GSL_ERROR_VAL("unknown sparse matrix type", GSL_EINVAL, 0.0);
}
/* element not found; return 0 */
return 0.0;
}
} /* gsl_spmatrix_get() */
/*
gsl_spmatrix_set()
Add an element to a matrix in triplet form
Inputs: m - spmatrix
i - row index
j - column index
x - matrix value
*/
int
gsl_spmatrix_set(gsl_spmatrix *m, const size_t i, const size_t j,
const double x)
{
if (!GSL_SPMATRIX_ISTRIPLET(m))
{
GSL_ERROR("matrix not in triplet representation", GSL_EINVAL);
}
else if (x == 0.0)
{
/* traverse binary tree to search for (i,j) element */
void *ptr = tree_find(m, i, j);
/*
* just set the data element to 0; it would be easy to
* delete the node from the tree with avl_delete(), but
* we'd also have to delete it from the data arrays which
* is less simple
*/
if (ptr != NULL)
*(double *) ptr = 0.0;
return GSL_SUCCESS;
}
else
{
int s = GSL_SUCCESS;
void *ptr;
/* check if matrix needs to be realloced */
if (m->nz >= m->nzmax)
{
s = gsl_spmatrix_realloc(2 * m->nzmax, m);
if (s)
return s;
}
/* store the triplet (i, j, x) */
m->i[m->nz] = i;
m->p[m->nz] = j;
m->data[m->nz] = x;
ptr = avl_insert(m->tree_data->tree, &m->data[m->nz]);
if (ptr != NULL)
{
/* found duplicate entry (i,j), replace with new x */
*((double *) ptr) = x;
}
else
{
/* no duplicate (i,j) found, update indices as needed */
/* increase matrix dimensions if needed */
m->size1 = GSL_MAX(m->size1, i + 1);
m->size2 = GSL_MAX(m->size2, j + 1);
++(m->nz);
}
return s;
}
} /* gsl_spmatrix_set() */
double *
gsl_spmatrix_ptr(gsl_spmatrix *m, const size_t i, const size_t j)
{
if (i >= m->size1)
{
GSL_ERROR_NULL("first index out of range", GSL_EINVAL);
}
else if (j >= m->size2)
{
GSL_ERROR_NULL("second index out of range", GSL_EINVAL);
}
else
{
if (GSL_SPMATRIX_ISTRIPLET(m))
{
/* traverse binary tree to search for (i,j) element */
void *ptr = tree_find(m, i, j);
return (double *) ptr;
}
else if (GSL_SPMATRIX_ISCCS(m))
{
const size_t *mi = m->i;
const size_t *mp = m->p;
size_t p;
/* loop over column j and search for row index i */
for (p = mp[j]; p < mp[j + 1]; ++p)
{
if (mi[p] == i)
return &(m->data[p]);
}
}
else if (GSL_SPMATRIX_ISCRS(m))
{
const size_t *mj = m->i;
const size_t *mp = m->p;
size_t p;
/* loop over row i and search for column index j */
for (p = mp[i]; p < mp[i + 1]; ++p)
{
if (mj[p] == j)
return &(m->data[p]);
}
}
else
{
GSL_ERROR_NULL("unknown sparse matrix type", GSL_EINVAL);
}
/* element not found; return 0 */
return NULL;
}
} /* gsl_spmatrix_ptr() */
/*
tree_find()
Find node in tree corresponding to matrix entry (i,j). Adapted
from avl_find()
Inputs: m - spmatrix
i - row index
j - column index
Return: pointer to tree node data if found, NULL if not found
*/
static void *
tree_find(const gsl_spmatrix *m, const size_t i, const size_t j)
{
const struct avl_table *tree = (struct avl_table *) m->tree_data->tree;
const struct avl_node *p;
for (p = tree->avl_root; p != NULL; )
{
size_t n = (double *) p->avl_data - m->data;
size_t pi = m->i[n];
size_t pj = m->p[n];
int cmp = gsl_spmatrix_compare_idx(i, j, pi, pj);
if (cmp < 0)
p = p->avl_link[0];
else if (cmp > 0)
p = p->avl_link[1];
else /* |cmp == 0| */
return p->avl_data;
}
return NULL;
} /* tree_find() */
|
