1 /* Copyright (C) 1995, 1996, 1998 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, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * 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
);
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, 1, 0, scm_make_vector
);
122 scm_make_vector (k
, fill
)
131 SCM_ASSERT(SCM_INUMP(k
) && (0 <= SCM_INUM (k
)), k
, SCM_ARG1
, s_make_vector
);
132 if (SCM_UNBNDP(fill
))
133 fill
= SCM_UNSPECIFIED
;
137 SCM_SETCHARS(v
, scm_must_malloc(i
?(long)(i
*sizeof(SCM
)):1L, s_vector
));
138 SCM_SETLENGTH(v
, i
, scm_tc7_vector
);
139 velts
= SCM_VELTS(v
);
141 while(--i
>= j
) (velts
)[i
] = fill
;
147 SCM_PROC(s_vector_to_list
, "vector->list", 1, 0, 0, scm_vector_to_list
);
150 scm_vector_to_list(v
)
156 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_to_list
);
158 for(i
= SCM_LENGTH(v
)-1;i
>= 0;i
--) res
= scm_cons(data
[i
], res
);
163 SCM_PROC (s_vector_fill_x
, "vector-fill!", 2, 0, 0, scm_vector_fill_x
);
166 scm_vector_fill_x (v
, fill_x
)
172 SCM_ASSERT(SCM_NIMP(v
) && SCM_VECTORP(v
), v
, SCM_ARG1
, s_vector_fill_x
);
174 for(i
= SCM_LENGTH(v
) - 1; i
>= 0; i
--)
176 return SCM_UNSPECIFIED
;
182 scm_vector_equal_p(x
, y
)
187 for(i
= SCM_LENGTH(x
)-1;i
>= 0;i
--)
188 if (SCM_FALSEP(scm_equal_p(SCM_VELTS(x
)[i
], SCM_VELTS(y
)[i
])))
194 SCM_PROC (s_vector_move_left_x
, "vector-move-left!", 5, 0, 0, scm_vector_move_left_x
);
197 scm_vector_move_left_x (vec1
, start1
, end1
, vec2
, start2
)
208 SCM_ASSERT (SCM_NIMP (vec1
) && SCM_VECTORP (vec1
), vec1
, SCM_ARG1
, s_vector_move_left_x
);
209 SCM_ASSERT (SCM_INUMP (start1
), start1
, SCM_ARG2
, s_vector_move_left_x
);
210 SCM_ASSERT (SCM_INUMP (end1
), end1
, SCM_ARG3
, s_vector_move_left_x
);
211 SCM_ASSERT (SCM_NIMP (vec2
) && SCM_VECTORP (vec2
), vec2
, SCM_ARG4
, s_vector_move_left_x
);
212 SCM_ASSERT (SCM_INUMP (start2
), start2
, SCM_ARG5
, s_vector_move_left_x
);
213 i
= SCM_INUM (start1
);
214 j
= SCM_INUM (start2
);
216 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
217 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
218 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
219 SCM_ASSERT (e
-i
+j
<= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, s_vector_move_left_x
);
220 while (i
<e
) SCM_VELTS (vec2
)[j
++] = SCM_VELTS (vec1
)[i
++];
221 return SCM_UNSPECIFIED
;
224 SCM_PROC (s_vector_move_right_x
, "vector-move-right!", 5, 0, 0, scm_vector_move_right_x
);
227 scm_vector_move_right_x (vec1
, start1
, end1
, vec2
, start2
)
238 SCM_ASSERT (SCM_NIMP (vec1
) && SCM_VECTORP (vec1
), vec1
, SCM_ARG1
, s_vector_move_right_x
);
239 SCM_ASSERT (SCM_INUMP (start1
), start1
, SCM_ARG2
, s_vector_move_right_x
);
240 SCM_ASSERT (SCM_INUMP (end1
), end1
, SCM_ARG3
, s_vector_move_right_x
);
241 SCM_ASSERT (SCM_NIMP (vec2
) && SCM_VECTORP (vec2
), vec2
, SCM_ARG4
, s_vector_move_right_x
);
242 SCM_ASSERT (SCM_INUMP (start2
), start2
, SCM_ARG5
, s_vector_move_right_x
);
243 i
= SCM_INUM (start1
);
244 j
= SCM_INUM (start2
);
246 SCM_ASSERT (i
<= SCM_LENGTH (vec1
) && i
>= 0, start1
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
247 SCM_ASSERT (j
<= SCM_LENGTH (vec2
) && j
>= 0, start2
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
248 SCM_ASSERT (e
<= SCM_LENGTH (vec1
) && e
>= 0, end1
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
249 SCM_ASSERT ((j
= e
-i
+j
) <= SCM_LENGTH (vec2
), start2
, SCM_OUTOFRANGE
, s_vector_move_right_x
);
250 while (i
<e
) SCM_VELTS (vec2
)[--j
] = SCM_VELTS (vec1
)[--e
];
251 return SCM_UNSPECIFIED
;