Commit | Line | Data |
---|---|---|
6922d92f | 1 | /* Copyright (C) 1995,1996,1998,1999,2000,2001, 2006, 2008, 2009, 2010, |
9b5da400 | 2 | * 2011, 2012, 2014 Free Software Foundation, Inc. |
6922d92f | 3 | * |
73be1d9e | 4 | * This library is free software; you can redistribute it and/or |
53befeb7 NJ |
5 | * modify it under the terms of the GNU Lesser General Public License |
6 | * as published by the Free Software Foundation; either version 3 of | |
7 | * the License, or (at your option) any later version. | |
0f2d19dd | 8 | * |
53befeb7 NJ |
9 | * This library is distributed in the hope that it will be useful, but |
10 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
73be1d9e MV |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
12 | * Lesser General Public License for more details. | |
0f2d19dd | 13 | * |
73be1d9e MV |
14 | * You should have received a copy of the GNU Lesser General Public |
15 | * License along with this library; if not, write to the Free Software | |
53befeb7 NJ |
16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
17 | * 02110-1301 USA | |
73be1d9e | 18 | */ |
1bbd0b84 | 19 | |
1bbd0b84 | 20 | |
0f2d19dd | 21 | \f |
dbb605f5 LC |
22 | #ifdef HAVE_CONFIG_H |
23 | # include <config.h> | |
24 | #endif | |
0f2d19dd | 25 | |
a0599745 MD |
26 | #include "libguile/_scm.h" |
27 | #include "libguile/eq.h" | |
28 | #include "libguile/root.h" | |
29 | #include "libguile/strings.h" | |
30 | ||
31 | #include "libguile/validate.h" | |
32 | #include "libguile/vectors.h" | |
5c39373f | 33 | #include "libguile/arrays.h" /* Hit me with the ugly stick */ |
f332e957 | 34 | #include "libguile/generalized-vectors.h" |
88797580 MV |
35 | #include "libguile/strings.h" |
36 | #include "libguile/srfi-13.h" | |
1d0df896 | 37 | #include "libguile/dynwind.h" |
88797580 | 38 | |
1c44468d | 39 | #include "libguile/bdw-gc.h" |
3a2de079 LC |
40 | |
41 | ||
0f2d19dd JB |
42 | \f |
43 | ||
6e708ef2 MV |
44 | #define VECTOR_MAX_LENGTH (SCM_T_BITS_MAX >> 8) |
45 | ||
6e708ef2 MV |
46 | int |
47 | scm_is_vector (SCM obj) | |
48 | { | |
49 | if (SCM_I_IS_VECTOR (obj)) | |
50 | return 1; | |
04b87de5 | 51 | if (SCM_I_ARRAYP (obj) && SCM_I_ARRAY_NDIM (obj) == 1) |
6e708ef2 | 52 | { |
04b87de5 | 53 | SCM v = SCM_I_ARRAY_V (obj); |
6e708ef2 MV |
54 | return SCM_I_IS_VECTOR (v); |
55 | } | |
56 | return 0; | |
57 | } | |
58 | ||
59 | int | |
60 | scm_is_simple_vector (SCM obj) | |
1d0df896 | 61 | { |
6e708ef2 | 62 | return SCM_I_IS_VECTOR (obj); |
1d0df896 MV |
63 | } |
64 | ||
354116f7 MV |
65 | const SCM * |
66 | scm_vector_elements (SCM vec, scm_t_array_handle *h, | |
67 | size_t *lenp, ssize_t *incp) | |
68 | { | |
3a2de079 | 69 | if (SCM_I_WVECTP (vec)) |
a141db86 | 70 | scm_wrong_type_arg_msg (NULL, 0, vec, "non-weak vector"); |
3a2de079 | 71 | |
354116f7 MV |
72 | scm_generalized_vector_get_handle (vec, h); |
73 | if (lenp) | |
74 | { | |
75 | scm_t_array_dim *dim = scm_array_handle_dims (h); | |
76 | *lenp = dim->ubnd - dim->lbnd + 1; | |
77 | *incp = dim->inc; | |
78 | } | |
79 | return scm_array_handle_elements (h); | |
80 | } | |
81 | ||
82 | SCM * | |
83 | scm_vector_writable_elements (SCM vec, scm_t_array_handle *h, | |
84 | size_t *lenp, ssize_t *incp) | |
85 | { | |
3a2de079 | 86 | if (SCM_I_WVECTP (vec)) |
a141db86 | 87 | scm_wrong_type_arg_msg (NULL, 0, vec, "non-weak vector"); |
3a2de079 | 88 | |
354116f7 MV |
89 | scm_generalized_vector_get_handle (vec, h); |
90 | if (lenp) | |
91 | { | |
92 | scm_t_array_dim *dim = scm_array_handle_dims (h); | |
93 | *lenp = dim->ubnd - dim->lbnd + 1; | |
94 | *incp = dim->inc; | |
95 | } | |
96 | return scm_array_handle_writable_elements (h); | |
97 | } | |
98 | ||
a1ec6916 | 99 | SCM_DEFINE (scm_vector_p, "vector?", 1, 0, 0, |
5ffe9968 | 100 | (SCM obj), |
1e6808ea MG |
101 | "Return @code{#t} if @var{obj} is a vector, otherwise return\n" |
102 | "@code{#f}.") | |
1bbd0b84 | 103 | #define FUNC_NAME s_scm_vector_p |
0f2d19dd | 104 | { |
de5c0f58 | 105 | return scm_from_bool (scm_is_vector (obj)); |
0f2d19dd | 106 | } |
1bbd0b84 | 107 | #undef FUNC_NAME |
0f2d19dd | 108 | |
e0a00fe7 AW |
109 | SCM_DEFINE (scm_vector_length, "vector-length", 1, 0, 0, |
110 | (SCM v), | |
111 | "Returns the number of elements in @var{vector} as an exact integer.") | |
112 | #define FUNC_NAME s_scm_vector_length | |
0f2d19dd | 113 | { |
9db57a19 | 114 | if (SCM_I_IS_NONWEAK_VECTOR (v)) |
6e708ef2 | 115 | return scm_from_size_t (SCM_I_VECTOR_LENGTH (v)); |
04b87de5 | 116 | else if (SCM_I_ARRAYP (v) && SCM_I_ARRAY_NDIM (v) == 1) |
de5c0f58 | 117 | { |
04b87de5 | 118 | scm_t_array_dim *dim = SCM_I_ARRAY_DIMS (v); |
de5c0f58 MV |
119 | return scm_from_size_t (dim->ubnd - dim->lbnd + 1); |
120 | } | |
121 | else | |
5cfeff11 AW |
122 | { |
123 | scm_wrong_type_arg_msg ("vector-length", 1, v, "vector"); | |
124 | return SCM_UNDEFINED; /* not reached */ | |
125 | } | |
0f2d19dd | 126 | } |
e0a00fe7 | 127 | #undef FUNC_NAME |
0f2d19dd | 128 | |
88797580 MV |
129 | size_t |
130 | scm_c_vector_length (SCM v) | |
131 | { | |
9b5da400 | 132 | if (SCM_I_IS_NONWEAK_VECTOR (v)) |
6e708ef2 | 133 | return SCM_I_VECTOR_LENGTH (v); |
88797580 | 134 | else |
de5c0f58 | 135 | return scm_to_size_t (scm_vector_length (v)); |
88797580 MV |
136 | } |
137 | ||
f172c0b7 | 138 | SCM_REGISTER_PROC (s_list_to_vector, "list->vector", 1, 0, 0, scm_vector); |
5ffe9968 | 139 | /* |
942e5b91 MG |
140 | "Return a newly created vector initialized to the elements of" |
141 | "the list @var{list}.\n\n" | |
142 | "@lisp\n" | |
143 | "(vector->list '#(dah dah didah)) @result{} (dah dah didah)\n" | |
144 | "(list->vector '(dididit dah)) @result{} #(dididit dah)\n" | |
145 | "@end lisp") | |
5ffe9968 | 146 | */ |
a1ec6916 | 147 | SCM_DEFINE (scm_vector, "vector", 0, 0, 1, |
f172c0b7 | 148 | (SCM l), |
8f85c0c6 NJ |
149 | "@deffnx {Scheme Procedure} list->vector l\n" |
150 | "Return a newly allocated vector composed of the\n" | |
1e6808ea MG |
151 | "given arguments. Analogous to @code{list}.\n" |
152 | "\n" | |
942e5b91 | 153 | "@lisp\n" |
1e6808ea | 154 | "(vector 'a 'b 'c) @result{} #(a b c)\n" |
942e5b91 | 155 | "@end lisp") |
1bbd0b84 | 156 | #define FUNC_NAME s_scm_vector |
0f2d19dd JB |
157 | { |
158 | SCM res; | |
22a52da1 | 159 | SCM *data; |
1d0df896 | 160 | long i, len; |
6e708ef2 | 161 | scm_t_array_handle handle; |
22a52da1 | 162 | |
1d0df896 | 163 | SCM_VALIDATE_LIST_COPYLEN (1, l, len); |
34d19ef6 | 164 | |
6e708ef2 MV |
165 | res = scm_c_make_vector (len, SCM_UNSPECIFIED); |
166 | data = scm_vector_writable_elements (res, &handle, NULL, NULL); | |
1d0df896 | 167 | i = 0; |
c8857a4d | 168 | while (scm_is_pair (l) && i < len) |
22a52da1 | 169 | { |
1d0df896 | 170 | data[i] = SCM_CAR (l); |
22a52da1 | 171 | l = SCM_CDR (l); |
6e708ef2 | 172 | i += 1; |
22a52da1 DH |
173 | } |
174 | ||
c8857a4d MV |
175 | scm_array_handle_release (&handle); |
176 | ||
0f2d19dd JB |
177 | return res; |
178 | } | |
1bbd0b84 | 179 | #undef FUNC_NAME |
0f2d19dd | 180 | |
e0a00fe7 AW |
181 | SCM_DEFINE (scm_vector_ref, "vector-ref", 2, 0, 0, |
182 | (SCM vector, SCM k), | |
183 | "@var{k} must be a valid index of @var{vector}.\n" | |
184 | "@samp{Vector-ref} returns the contents of element @var{k} of\n" | |
185 | "@var{vector}.\n\n" | |
186 | "@lisp\n" | |
187 | "(vector-ref '#(1 1 2 3 5 8 13 21) 5) @result{} 8\n" | |
188 | "(vector-ref '#(1 1 2 3 5 8 13 21)\n" | |
189 | " (let ((i (round (* 2 (acos -1)))))\n" | |
190 | " (if (inexact? i)\n" | |
191 | " (inexact->exact i)\n" | |
192 | " i))) @result{} 13\n" | |
193 | "@end lisp") | |
194 | #define FUNC_NAME s_scm_vector_ref | |
0f2d19dd | 195 | { |
e0a00fe7 | 196 | return scm_c_vector_ref (vector, scm_to_size_t (k)); |
0f2d19dd | 197 | } |
685c0d71 | 198 | #undef FUNC_NAME |
0f2d19dd | 199 | |
88797580 MV |
200 | SCM |
201 | scm_c_vector_ref (SCM v, size_t k) | |
202 | { | |
a141db86 | 203 | if (SCM_I_IS_NONWEAK_VECTOR (v)) |
de5c0f58 | 204 | { |
6e708ef2 | 205 | if (k >= SCM_I_VECTOR_LENGTH (v)) |
3a2de079 | 206 | scm_out_of_range (NULL, scm_from_size_t (k)); |
a141db86 | 207 | return SCM_SIMPLE_VECTOR_REF (v, k); |
de5c0f58 | 208 | } |
04b87de5 | 209 | else if (SCM_I_ARRAYP (v) && SCM_I_ARRAY_NDIM (v) == 1) |
88797580 | 210 | { |
04b87de5 MV |
211 | scm_t_array_dim *dim = SCM_I_ARRAY_DIMS (v); |
212 | SCM vv = SCM_I_ARRAY_V (v); | |
a141db86 AW |
213 | |
214 | k = SCM_I_ARRAY_BASE (v) + k*dim->inc; | |
215 | if (k >= dim->ubnd - dim->lbnd + 1) | |
216 | scm_out_of_range (NULL, scm_from_size_t (k)); | |
217 | ||
218 | if (SCM_I_IS_NONWEAK_VECTOR (vv)) | |
219 | return SCM_SIMPLE_VECTOR_REF (vv, k); | |
a141db86 AW |
220 | else |
221 | scm_wrong_type_arg_msg (NULL, 0, v, "non-uniform vector"); | |
88797580 | 222 | } |
de5c0f58 | 223 | else |
5cfeff11 AW |
224 | { |
225 | scm_wrong_type_arg_msg ("vector-ref", 1, v, "vector"); | |
226 | return SCM_UNDEFINED; /* not reached */ | |
227 | } | |
88797580 MV |
228 | } |
229 | ||
e0a00fe7 AW |
230 | SCM_DEFINE (scm_vector_set_x, "vector-set!", 3, 0, 0, |
231 | (SCM vector, SCM k, SCM obj), | |
232 | "@var{k} must be a valid index of @var{vector}.\n" | |
233 | "@code{Vector-set!} stores @var{obj} in element @var{k} of @var{vector}.\n" | |
234 | "The value returned by @samp{vector-set!} is unspecified.\n" | |
235 | "@lisp\n" | |
236 | "(let ((vec (vector 0 '(2 2 2 2) \"Anna\")))\n" | |
237 | " (vector-set! vec 1 '(\"Sue\" \"Sue\"))\n" | |
238 | " vec) @result{} #(0 (\"Sue\" \"Sue\") \"Anna\")\n" | |
239 | "(vector-set! '#(0 1 2) 1 \"doe\") @result{} @emph{error} ; constant vector\n" | |
240 | "@end lisp") | |
241 | #define FUNC_NAME s_scm_vector_set_x | |
0f2d19dd | 242 | { |
e0a00fe7 | 243 | scm_c_vector_set_x (vector, scm_to_size_t (k), obj); |
60c497a3 | 244 | return SCM_UNSPECIFIED; |
0f2d19dd | 245 | } |
685c0d71 | 246 | #undef FUNC_NAME |
0f2d19dd | 247 | |
de5c0f58 | 248 | void |
88797580 MV |
249 | scm_c_vector_set_x (SCM v, size_t k, SCM obj) |
250 | { | |
a141db86 | 251 | if (SCM_I_IS_NONWEAK_VECTOR (v)) |
88797580 | 252 | { |
6e708ef2 | 253 | if (k >= SCM_I_VECTOR_LENGTH (v)) |
a141db86 AW |
254 | scm_out_of_range (NULL, scm_from_size_t (k)); |
255 | SCM_SIMPLE_VECTOR_SET (v, k, obj); | |
de5c0f58 | 256 | } |
04b87de5 | 257 | else if (SCM_I_ARRAYP (v) && SCM_I_ARRAY_NDIM (v) == 1) |
de5c0f58 | 258 | { |
04b87de5 MV |
259 | scm_t_array_dim *dim = SCM_I_ARRAY_DIMS (v); |
260 | SCM vv = SCM_I_ARRAY_V (v); | |
a141db86 AW |
261 | |
262 | k = SCM_I_ARRAY_BASE (v) + k*dim->inc; | |
263 | if (k >= dim->ubnd - dim->lbnd + 1) | |
264 | scm_out_of_range (NULL, scm_from_size_t (k)); | |
265 | ||
266 | if (SCM_I_IS_NONWEAK_VECTOR (vv)) | |
267 | SCM_SIMPLE_VECTOR_SET (vv, k, obj); | |
6e708ef2 MV |
268 | else |
269 | scm_wrong_type_arg_msg (NULL, 0, v, "non-uniform vector"); | |
88797580 MV |
270 | } |
271 | else | |
e0a00fe7 | 272 | scm_wrong_type_arg_msg ("vector-set!", 1, v, "vector"); |
88797580 | 273 | } |
0f2d19dd | 274 | |
a1ec6916 | 275 | SCM_DEFINE (scm_make_vector, "make-vector", 1, 1, 0, |
1bbd0b84 | 276 | (SCM k, SCM fill), |
1e6808ea | 277 | "Return a newly allocated vector of @var{k} elements. If a\n" |
8f85c0c6 NJ |
278 | "second argument is given, then each position is initialized to\n" |
279 | "@var{fill}. Otherwise the initial contents of each position is\n" | |
1e6808ea | 280 | "unspecified.") |
1bbd0b84 | 281 | #define FUNC_NAME s_scm_make_vector |
0f2d19dd | 282 | { |
6e708ef2 | 283 | size_t l = scm_to_unsigned_integer (k, 0, VECTOR_MAX_LENGTH); |
e11e83f3 | 284 | |
1b9be268 | 285 | if (SCM_UNBNDP (fill)) |
d60cebe2 | 286 | fill = SCM_UNSPECIFIED; |
e11e83f3 MV |
287 | |
288 | return scm_c_make_vector (l, fill); | |
00ffa0e7 KN |
289 | } |
290 | #undef FUNC_NAME | |
291 | ||
e382fdbe | 292 | |
00ffa0e7 | 293 | SCM |
88797580 | 294 | scm_c_make_vector (size_t k, SCM fill) |
00ffa0e7 KN |
295 | #define FUNC_NAME s_scm_make_vector |
296 | { | |
a141db86 AW |
297 | SCM vector; |
298 | unsigned long int j; | |
ed7e0765 | 299 | |
a141db86 | 300 | SCM_ASSERT_RANGE (1, scm_from_size_t (k), k <= VECTOR_MAX_LENGTH); |
1b9be268 | 301 | |
a141db86 | 302 | vector = scm_words ((k << 8) | scm_tc7_vector, k + 1); |
1b9be268 | 303 | |
a141db86 AW |
304 | for (j = 0; j < k; ++j) |
305 | SCM_SIMPLE_VECTOR_SET (vector, j, fill); | |
1b9be268 | 306 | |
a141db86 | 307 | return vector; |
0f2d19dd | 308 | } |
1bbd0b84 | 309 | #undef FUNC_NAME |
0f2d19dd | 310 | |
6e708ef2 MV |
311 | SCM_DEFINE (scm_vector_copy, "vector-copy", 1, 0, 0, |
312 | (SCM vec), | |
313 | "Return a copy of @var{vec}.") | |
314 | #define FUNC_NAME s_scm_vector_copy | |
315 | { | |
316 | scm_t_array_handle handle; | |
317 | size_t i, len; | |
318 | ssize_t inc; | |
319 | const SCM *src; | |
ed7e0765 | 320 | SCM result, *dst; |
6e708ef2 MV |
321 | |
322 | src = scm_vector_elements (vec, &handle, &len, &inc); | |
ed7e0765 LC |
323 | |
324 | result = scm_c_make_vector (len, SCM_UNDEFINED); | |
325 | dst = SCM_I_VECTOR_WELTS (result); | |
6e708ef2 MV |
326 | for (i = 0; i < len; i++, src += inc) |
327 | dst[i] = *src; | |
ed7e0765 | 328 | |
c8857a4d | 329 | scm_array_handle_release (&handle); |
6e708ef2 | 330 | |
ed7e0765 | 331 | return result; |
6e708ef2 MV |
332 | } |
333 | #undef FUNC_NAME | |
334 | ||
d525e4f9 | 335 | \f |
3b3b36dd | 336 | SCM_DEFINE (scm_vector_to_list, "vector->list", 1, 0, 0, |
1e6808ea | 337 | (SCM v), |
8f85c0c6 | 338 | "Return a newly allocated list composed of the elements of @var{v}.\n" |
1e6808ea | 339 | "\n" |
942e5b91 MG |
340 | "@lisp\n" |
341 | "(vector->list '#(dah dah didah)) @result{} (dah dah didah)\n" | |
342 | "(list->vector '(dididit dah)) @result{} #(dididit dah)\n" | |
343 | "@end lisp") | |
1bbd0b84 | 344 | #define FUNC_NAME s_scm_vector_to_list |
0f2d19dd | 345 | { |
6e708ef2 MV |
346 | SCM res = SCM_EOL; |
347 | const SCM *data; | |
348 | scm_t_array_handle handle; | |
22be72d3 | 349 | size_t i, count, len; |
6e708ef2 MV |
350 | ssize_t inc; |
351 | ||
352 | data = scm_vector_elements (v, &handle, &len, &inc); | |
22be72d3 LC |
353 | for (i = (len - 1) * inc, count = 0; |
354 | count < len; | |
355 | i -= inc, count++) | |
356 | res = scm_cons (data[i], res); | |
357 | ||
c8857a4d | 358 | scm_array_handle_release (&handle); |
6e708ef2 | 359 | return res; |
0f2d19dd | 360 | } |
1bbd0b84 | 361 | #undef FUNC_NAME |
0f2d19dd JB |
362 | |
363 | ||
a1ec6916 | 364 | SCM_DEFINE (scm_vector_fill_x, "vector-fill!", 2, 0, 0, |
1e6808ea | 365 | (SCM v, SCM fill), |
8f85c0c6 | 366 | "Store @var{fill} in every position of @var{vector}. The value\n" |
1e6808ea | 367 | "returned by @code{vector-fill!} is unspecified.") |
1bbd0b84 | 368 | #define FUNC_NAME s_scm_vector_fill_x |
0f2d19dd | 369 | { |
6e708ef2 MV |
370 | scm_t_array_handle handle; |
371 | SCM *data; | |
372 | size_t i, len; | |
373 | ssize_t inc; | |
374 | ||
375 | data = scm_vector_writable_elements (v, &handle, &len, &inc); | |
376 | for (i = 0; i < len; i += inc) | |
377 | data[i] = fill; | |
c8857a4d | 378 | scm_array_handle_release (&handle); |
6e708ef2 | 379 | return SCM_UNSPECIFIED; |
0f2d19dd | 380 | } |
1bbd0b84 | 381 | #undef FUNC_NAME |
0f2d19dd JB |
382 | |
383 | ||
0f2d19dd | 384 | SCM |
354116f7 | 385 | scm_i_vector_equal_p (SCM x, SCM y) |
0f2d19dd | 386 | { |
c014a02e | 387 | long i; |
6e708ef2 MV |
388 | for (i = SCM_I_VECTOR_LENGTH (x) - 1; i >= 0; i--) |
389 | if (scm_is_false (scm_equal_p (SCM_I_VECTOR_ELTS (x)[i], | |
390 | SCM_I_VECTOR_ELTS (y)[i]))) | |
0f2d19dd JB |
391 | return SCM_BOOL_F; |
392 | return SCM_BOOL_T; | |
393 | } | |
394 | ||
395 | ||
a1ec6916 | 396 | SCM_DEFINE (scm_vector_move_left_x, "vector-move-left!", 5, 0, 0, |
1bbd0b84 | 397 | (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2), |
694a9bb3 NJ |
398 | "Copy elements from @var{vec1}, positions @var{start1} to @var{end1},\n" |
399 | "to @var{vec2} starting at position @var{start2}. @var{start1} and\n" | |
400 | "@var{start2} are inclusive indices; @var{end1} is exclusive.\n\n" | |
401 | "@code{vector-move-left!} copies elements in leftmost order.\n" | |
402 | "Therefore, in the case where @var{vec1} and @var{vec2} refer to the\n" | |
403 | "same vector, @code{vector-move-left!} is usually appropriate when\n" | |
404 | "@var{start1} is greater than @var{start2}.") | |
1bbd0b84 | 405 | #define FUNC_NAME s_scm_vector_move_left_x |
0f2d19dd | 406 | { |
6e708ef2 MV |
407 | scm_t_array_handle handle1, handle2; |
408 | const SCM *elts1; | |
409 | SCM *elts2; | |
de5c0f58 | 410 | size_t len1, len2; |
6e708ef2 | 411 | ssize_t inc1, inc2; |
a55c2b68 | 412 | size_t i, j, e; |
6e708ef2 MV |
413 | |
414 | elts1 = scm_vector_elements (vec1, &handle1, &len1, &inc1); | |
415 | elts2 = scm_vector_writable_elements (vec2, &handle2, &len2, &inc2); | |
34d19ef6 | 416 | |
de5c0f58 MV |
417 | i = scm_to_unsigned_integer (start1, 0, len1); |
418 | e = scm_to_unsigned_integer (end1, i, len1); | |
ca659673 | 419 | SCM_ASSERT_RANGE (SCM_ARG3, end1, (e-i) <= len2); |
551b96d2 AW |
420 | j = scm_to_unsigned_integer (start2, 0, len2); |
421 | SCM_ASSERT_RANGE (SCM_ARG5, start2, j <= len2 - (e - i)); | |
de5c0f58 | 422 | |
6e708ef2 MV |
423 | i *= inc1; |
424 | e *= inc1; | |
425 | j *= inc2; | |
426 | for (; i < e; i += inc1, j += inc2) | |
427 | elts2[j] = elts1[i]; | |
428 | ||
c8857a4d MV |
429 | scm_array_handle_release (&handle2); |
430 | scm_array_handle_release (&handle1); | |
431 | ||
0f2d19dd JB |
432 | return SCM_UNSPECIFIED; |
433 | } | |
1bbd0b84 | 434 | #undef FUNC_NAME |
0f2d19dd | 435 | |
a1ec6916 | 436 | SCM_DEFINE (scm_vector_move_right_x, "vector-move-right!", 5, 0, 0, |
1bbd0b84 | 437 | (SCM vec1, SCM start1, SCM end1, SCM vec2, SCM start2), |
694a9bb3 NJ |
438 | "Copy elements from @var{vec1}, positions @var{start1} to @var{end1},\n" |
439 | "to @var{vec2} starting at position @var{start2}. @var{start1} and\n" | |
440 | "@var{start2} are inclusive indices; @var{end1} is exclusive.\n\n" | |
441 | "@code{vector-move-right!} copies elements in rightmost order.\n" | |
442 | "Therefore, in the case where @var{vec1} and @var{vec2} refer to the\n" | |
443 | "same vector, @code{vector-move-right!} is usually appropriate when\n" | |
444 | "@var{start1} is less than @var{start2}.") | |
1bbd0b84 | 445 | #define FUNC_NAME s_scm_vector_move_right_x |
0f2d19dd | 446 | { |
6e708ef2 MV |
447 | scm_t_array_handle handle1, handle2; |
448 | const SCM *elts1; | |
449 | SCM *elts2; | |
de5c0f58 | 450 | size_t len1, len2; |
6e708ef2 | 451 | ssize_t inc1, inc2; |
a55c2b68 | 452 | size_t i, j, e; |
6e708ef2 MV |
453 | |
454 | elts1 = scm_vector_elements (vec1, &handle1, &len1, &inc1); | |
455 | elts2 = scm_vector_writable_elements (vec2, &handle2, &len2, &inc2); | |
0f2d19dd | 456 | |
de5c0f58 MV |
457 | i = scm_to_unsigned_integer (start1, 0, len1); |
458 | e = scm_to_unsigned_integer (end1, i, len1); | |
ca659673 | 459 | SCM_ASSERT_RANGE (SCM_ARG3, end1, (e-i) <= len2); |
551b96d2 AW |
460 | j = scm_to_unsigned_integer (start2, 0, len2); |
461 | SCM_ASSERT_RANGE (SCM_ARG5, start2, j <= len2 - (e - i)); | |
462 | ||
463 | j += (e - i); | |
de5c0f58 | 464 | |
6e708ef2 MV |
465 | i *= inc1; |
466 | e *= inc1; | |
467 | j *= inc2; | |
468 | while (i < e) | |
de5c0f58 | 469 | { |
6e708ef2 MV |
470 | e -= inc1; |
471 | j -= inc2; | |
472 | elts2[j] = elts1[e]; | |
de5c0f58 | 473 | } |
6e708ef2 | 474 | |
c8857a4d MV |
475 | scm_array_handle_release (&handle2); |
476 | scm_array_handle_release (&handle1); | |
477 | ||
0f2d19dd JB |
478 | return SCM_UNSPECIFIED; |
479 | } | |
1bbd0b84 | 480 | #undef FUNC_NAME |
0f2d19dd | 481 | |
438974d0 | 482 | \f |
2a610be5 AW |
483 | static SCM |
484 | vector_handle_ref (scm_t_array_handle *h, size_t idx) | |
88797580 | 485 | { |
2a610be5 AW |
486 | if (idx > h->dims[0].ubnd) |
487 | scm_out_of_range ("vector-handle-ref", scm_from_size_t (idx)); | |
488 | return ((SCM*)h->elements)[idx]; | |
88797580 MV |
489 | } |
490 | ||
2a610be5 AW |
491 | static void |
492 | vector_handle_set (scm_t_array_handle *h, size_t idx, SCM val) | |
88797580 | 493 | { |
2a610be5 AW |
494 | if (idx > h->dims[0].ubnd) |
495 | scm_out_of_range ("vector-handle-set!", scm_from_size_t (idx)); | |
496 | ((SCM*)h->writable_elements)[idx] = val; | |
88797580 | 497 | } |
88797580 | 498 | |
2a610be5 AW |
499 | static void |
500 | vector_get_handle (SCM v, scm_t_array_handle *h) | |
88797580 | 501 | { |
2a610be5 AW |
502 | h->array = v; |
503 | h->ndims = 1; | |
504 | h->dims = &h->dim0; | |
505 | h->dim0.lbnd = 0; | |
506 | h->dim0.ubnd = SCM_I_VECTOR_LENGTH (v) - 1; | |
507 | h->dim0.inc = 1; | |
508 | h->element_type = SCM_ARRAY_ELEMENT_TYPE_SCM; | |
509 | h->elements = h->writable_elements = SCM_I_VECTOR_WELTS (v); | |
88797580 MV |
510 | } |
511 | ||
c5f17102 AW |
512 | /* the & ~2 allows catching scm_tc7_wvect as well. needs changing if you change |
513 | tags.h. */ | |
2a610be5 AW |
514 | SCM_ARRAY_IMPLEMENTATION (scm_tc7_vector, 0x7f & ~2, |
515 | vector_handle_ref, vector_handle_set, | |
f65e0168 | 516 | vector_get_handle) |
f65e0168 | 517 | SCM_VECTOR_IMPLEMENTATION (SCM_ARRAY_ELEMENT_TYPE_SCM, scm_make_vector) |
88797580 | 518 | |
1cc91f1b | 519 | |
0f2d19dd JB |
520 | void |
521 | scm_init_vectors () | |
0f2d19dd | 522 | { |
a0599745 | 523 | #include "libguile/vectors.x" |
0f2d19dd JB |
524 | } |
525 | ||
89e00824 ML |
526 | |
527 | /* | |
528 | Local Variables: | |
529 | c-file-style: "gnu" | |
530 | End: | |
531 | */ |