1 /* Copyright (C) 1995,1996 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
17 * As a special exception, the Free Software Foundation gives permission
18 * for additional uses of the text contained in its release of GUILE.
20 * The exception is that, if you link the GUILE library with other files
21 * to produce an executable, this does not by itself cause the
22 * resulting executable to be covered by the GNU General Public License.
23 * Your use of that executable is in no way restricted on account of
24 * linking the GUILE library code into it.
26 * This exception does not however invalidate any other reasons why
27 * the executable file might be covered by the GNU General Public License.
29 * This exception applies only to the code released by the
30 * Free Software Foundation under the name GUILE. If you copy
31 * code from other Free Software Foundation releases into a copy of
32 * GUILE, as the General Public License permits, the exception does
33 * not apply to the code that you add in this way. To avoid misleading
34 * anyone as to the status of such modified files, you must delete
35 * this exception notice from them.
37 * If you write modifications of your own for GUILE, it is your choice
38 * whether to permit this exception to apply to your modifications.
39 * If you do not wish that, delete this exception notice.
51 SCM_PROC(s_vector_p
, "vector?", 1, 0, 0, scm_vector_p
);
57 if SCM_IMP(x
) return SCM_BOOL_F
;
58 return SCM_VECTORP(x
) ? SCM_BOOL_T
: SCM_BOOL_F
;
61 SCM_PROC(s_vector_length
, "vector-length", 1, 0, 0, scm_vector_length
);
67 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_length
);
68 return SCM_MAKINUM(SCM_LENGTH(v
));
71 SCM_PROC(s_list_to_vector
, "list->vector", 1, 0, 0, scm_vector
);
72 SCM_PROC(s_vector
, "vector", 0, 0, 1, scm_vector
);
80 long i
= scm_ilength(l
);
81 SCM_ASSERT(i
>= 0, l
, SCM_ARG1
, s_vector
);
82 res
= scm_make_vector(SCM_MAKINUM(i
), SCM_UNSPECIFIED
, SCM_UNDEFINED
);
83 data
= SCM_VELTS(res
);
84 for(;i
&& SCM_NIMP(l
);--i
, l
= SCM_CDR(l
))
89 SCM_PROC(s_vector_ref
, "vector-ref", 2, 0, 0, scm_vector_ref
);
96 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_ref
);
97 SCM_ASSERT(SCM_INUMP(k
), k
, SCM_ARG2
, s_vector_ref
);
98 SCM_ASSERT((SCM_INUM(k
) < SCM_LENGTH(v
)) && (SCM_INUM(k
) >= 0), k
, SCM_OUTOFRANGE
, s_vector_ref
);
99 return SCM_VELTS(v
)[((long) SCM_INUM(k
))];
103 SCM_PROC(s_vector_set_x
, "vector-set!", 3, 0, 0, scm_vector_set_x
);
106 scm_vector_set_x(v
, k
, obj
)
111 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_set_x
);
112 SCM_ASSERT(SCM_INUMP(k
), k
, SCM_ARG2
, s_vector_set_x
);
113 SCM_ASSERT((SCM_INUM(k
) < SCM_LENGTH(v
)) && (SCM_INUM(k
) >= 0), k
, SCM_OUTOFRANGE
, s_vector_set_x
);
114 SCM_VELTS(v
)[((long) SCM_INUM(k
))] = obj
;
119 SCM_PROC(s_make_vector
, "make-vector", 1, 2, 0, scm_make_vector
);
122 scm_make_vector(k
, fill
, multip
)
133 SCM_ASSERT(SCM_INUMP(k
) && (0 <= SCM_INUM (k
)), k
, SCM_ARG1
, s_make_vector
);
134 if (SCM_UNBNDP(fill
))
135 fill
= SCM_UNSPECIFIED
;
136 multi
= !(SCM_UNBNDP(multip
) || SCM_FALSEP(multip
));
140 SCM_SETCHARS(v
, scm_must_malloc(i
?(long)(i
*sizeof(SCM
)):1L, s_vector
));
141 SCM_SETLENGTH(v
, i
, scm_tc7_vector
);
142 velts
= SCM_VELTS(v
);
146 while ((fill
!= SCM_EOL
) && (j
< i
))
148 (velts
)[j
++] = SCM_CAR (fill
);
149 fill
= SCM_CDR (fill
);
152 while(--i
>= j
) (velts
)[i
] = fill
;
158 SCM_PROC(s_vector_to_list
, "vector->list", 1, 0, 0, scm_vector_to_list
);
161 scm_vector_to_list(v
)
167 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_to_list
);
169 for(i
= SCM_LENGTH(v
)-1;i
>= 0;i
--) res
= scm_cons(data
[i
], res
);
174 SCM_PROC(s_vector_fill_x
, "vector-fill!", 2, 0, 0, scm_vector_fill_x
);
177 scm_vector_fill_x(v
, fill_x
)
183 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_fill_x
);
185 for(i
= SCM_LENGTH(v
)-1;i
>= 0;i
--) data
[i
] = fill_x
;
186 return SCM_UNSPECIFIED
;
192 scm_vector_equal_p(x
, y
)
197 for(i
= SCM_LENGTH(x
)-1;i
>= 0;i
--)
198 if (SCM_FALSEP(scm_equal_p(SCM_VELTS(x
)[i
], SCM_VELTS(y
)[i
])))
204 SCM_PROC (s_vector_move_left_x
, "vector-move-left!", 5, 0, 0, scm_vector_move_left_x
);
207 scm_vector_move_left_x (vec1
, start1
, end1
, vec2
, start2
)
218 SCM_ASSERT (SCM_NIMP (vec1
) && SCM_VECTORP (vec1
), vec1
, SCM_ARG1
, s_vector_move_left_x
);
219 SCM_ASSERT (SCM_INUMP (start1
), start1
, SCM_ARG2
, s_vector_move_left_x
);
220 SCM_ASSERT (SCM_INUMP (end1
), end1
, SCM_ARG3
, s_vector_move_left_x
);
221 SCM_ASSERT (SCM_NIMP (vec2
) && SCM_VECTORP (vec2
), vec2
, SCM_ARG4
, s_vector_move_left_x
);
222 SCM_ASSERT (SCM_INUMP (start2
), start2
, SCM_ARG5
, s_vector_move_left_x
);
223 i
= SCM_INUM (start1
);
224 j
= SCM_INUM (start2
);
226 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
227 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
228 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
229 SCM_ASSERT (e
-i
+j
<= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
230 while (i
<e
) SCM_VELTS (vec2
)[j
++] = SCM_VELTS (vec1
)[i
++];
231 return SCM_UNSPECIFIED
;
234 SCM_PROC (s_vector_move_right_x
, "vector-move-right!", 5, 0, 0, scm_vector_move_right_x
);
237 scm_vector_move_right_x (vec1
, start1
, end1
, vec2
, start2
)
248 SCM_ASSERT (SCM_NIMP (vec1
) && SCM_VECTORP (vec1
), vec1
, SCM_ARG1
, s_vector_move_right_x
);
249 SCM_ASSERT (SCM_INUMP (start1
), start1
, SCM_ARG2
, s_vector_move_right_x
);
250 SCM_ASSERT (SCM_INUMP (end1
), end1
, SCM_ARG3
, s_vector_move_right_x
);
251 SCM_ASSERT (SCM_NIMP (vec2
) && SCM_VECTORP (vec2
), vec2
, SCM_ARG4
, s_vector_move_right_x
);
252 SCM_ASSERT (SCM_INUMP (start2
), start2
, SCM_ARG5
, s_vector_move_right_x
);
253 i
= SCM_INUM (start1
);
254 j
= SCM_INUM (start2
);
256 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
257 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
258 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
259 SCM_ASSERT ((j
= e
-i
+j
) <= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
260 while (i
<e
) SCM_VELTS (vec2
)[--j
] = SCM_VELTS (vec1
)[--e
];
261 return SCM_UNSPECIFIED
;