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
|
/*
* Copyright © 2017 Keith Packard <keithp@keithp.com>
*
* 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 2 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.
*/
#include "ao_scheme.h"
#ifdef AO_SCHEME_FEATURE_VECTOR
static void vector_mark(void *addr)
{
struct ao_scheme_vector *vector = addr;
unsigned int i;
for (i = 0; i < vector->length; i++) {
ao_poly v = vector->vals[i];
ao_scheme_poly_mark(v, 1);
}
}
static int vector_len_size(uint16_t length)
{
return sizeof (struct ao_scheme_vector) + length * sizeof (ao_poly);
}
static int vector_size(void *addr)
{
struct ao_scheme_vector *vector = addr;
return vector_len_size(vector->length);
}
static void vector_move(void *addr)
{
struct ao_scheme_vector *vector = addr;
unsigned int i;
for (i = 0; i < vector->length; i++)
(void) ao_scheme_poly_move(&vector->vals[i], 1);
}
const struct ao_scheme_type ao_scheme_vector_type = {
.mark = vector_mark,
.size = vector_size,
.move = vector_move,
.name = "vector",
};
struct ao_scheme_vector *
ao_scheme_vector_alloc(uint16_t length, ao_poly fill)
{
struct ao_scheme_vector *vector;
unsigned int i;
vector = ao_scheme_alloc(vector_len_size(length));
if (!vector)
return NULL;
vector->type = AO_SCHEME_VECTOR;
vector->length = length;
for (i = 0; i < length; i++)
vector->vals[i] = fill;
return vector;
}
void
ao_scheme_vector_write(ao_poly v)
{
struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
unsigned int i;
printf("#(");
for (i = 0; i < vector->length; i++) {
if (i != 0)
printf(" ");
if (vector->vals[i] == v)
printf ("...");
else
ao_scheme_poly_write(vector->vals[i]);
}
printf(")");
}
void
ao_scheme_vector_display(ao_poly v)
{
struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
unsigned int i;
for (i = 0; i < vector->length; i++) {
if (vector->vals[i] == v)
printf("...");
else
ao_scheme_poly_display(vector->vals[i]);
}
}
static int32_t
ao_scheme_vector_offset(struct ao_scheme_vector *vector, ao_poly i)
{
int32_t offset = ao_scheme_poly_integer(i);
if (offset == AO_SCHEME_NOT_INTEGER)
ao_scheme_error(AO_SCHEME_INVALID, "vector index %v not integer", i);
if (offset < 0 || vector->length <= offset) {
ao_scheme_error(AO_SCHEME_INVALID, "vector index %v out of range (max %d)",
i, vector->length);
offset = AO_SCHEME_NOT_INTEGER;
}
return offset;
}
ao_poly
ao_scheme_vector_get(ao_poly v, ao_poly i)
{
struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
int32_t offset = ao_scheme_vector_offset(vector, i);
if (offset == AO_SCHEME_NOT_INTEGER)
return AO_SCHEME_NIL;
return vector->vals[offset];
}
ao_poly
ao_scheme_vector_set(ao_poly v, ao_poly i, ao_poly p)
{
struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
int32_t offset = ao_scheme_vector_offset(vector, i);
if (offset == AO_SCHEME_NOT_INTEGER)
return AO_SCHEME_NIL;
return vector->vals[offset] = p;
}
struct ao_scheme_vector *
ao_scheme_list_to_vector(struct ao_scheme_cons *cons)
{
uint16_t length;
uint16_t i;
struct ao_scheme_vector *vector;
length = (uint16_t) ao_scheme_cons_length (cons);
if (ao_scheme_exception)
return NULL;
ao_scheme_cons_stash(0, cons);
vector = ao_scheme_vector_alloc(length, AO_SCHEME_NIL);
cons = ao_scheme_cons_fetch(0);
if (!vector)
return NULL;
i = 0;
while (cons) {
vector->vals[i++] = cons->car;
cons = ao_scheme_cons_cdr(cons);
}
return vector;
}
struct ao_scheme_cons *
ao_scheme_vector_to_list(struct ao_scheme_vector *vector)
{
unsigned int i;
uint16_t length = vector->length;
struct ao_scheme_cons *cons = NULL;
for (i = length; i-- > 0;) {
ao_scheme_poly_stash(2, ao_scheme_vector_poly(vector));
cons = ao_scheme_cons_cons(vector->vals[i], ao_scheme_cons_poly(cons));
vector = ao_scheme_poly_vector(ao_scheme_poly_fetch(2));
if (!cons)
return NULL;
}
return cons;
}
#endif /* AO_SCHEME_FEATURE_VECTOR */
|
