blob: d55259d1a66e1130f45ac644679157c0b14c274c [file] [log] [blame]
Damiend99b0522013-12-21 18:17:45 +00001#include <stdlib.h>
2#include <stdint.h>
Damiend99b0522013-12-21 18:17:45 +00003#include <assert.h>
4
5#include "nlr.h"
6#include "misc.h"
7#include "mpconfig.h"
Damien George71c51812014-01-04 20:21:15 +00008#include "mpqstr.h"
Damiend99b0522013-12-21 18:17:45 +00009#include "obj.h"
10#include "runtime0.h"
Damien George71c51812014-01-04 20:21:15 +000011#include "runtime.h"
Damiend99b0522013-12-21 18:17:45 +000012
13typedef struct _mp_obj_tuple_t {
14 mp_obj_base_t base;
15 machine_uint_t len;
16 mp_obj_t items[];
17} mp_obj_tuple_t;
18
19static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur);
20
21/******************************************************************************/
22/* tuple */
23
Damien George71c51812014-01-04 20:21:15 +000024static void tuple_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t o_in) {
Damiend99b0522013-12-21 18:17:45 +000025 mp_obj_tuple_t *o = o_in;
26 print(env, "(");
27 for (int i = 0; i < o->len; i++) {
28 if (i > 0) {
29 print(env, ", ");
30 }
31 mp_obj_print_helper(print, env, o->items[i]);
32 }
33 if (o->len == 1) {
34 print(env, ",");
35 }
36 print(env, ")");
37}
38
Damien George71c51812014-01-04 20:21:15 +000039// args are in reverse order in the array
40static mp_obj_t tuple_make_new(mp_obj_t type_in, int n_args, const mp_obj_t *args) {
41 switch (n_args) {
42 case 0:
43 // return a empty tuple
44 return mp_const_empty_tuple;
45
46 case 1:
47 {
48 // 1 argument, an iterable from which we make a new tuple
49 if (MP_OBJ_IS_TYPE(args[0], &tuple_type)) {
50 return args[0];
51 }
52
53 // TODO optimise for cases where we know the length of the iterator
54
55 uint alloc = 4;
56 uint len = 0;
57 mp_obj_t *items = m_new(mp_obj_t, alloc);
58
59 mp_obj_t iterable = rt_getiter(args[0]);
60 mp_obj_t item;
61 while ((item = rt_iternext(iterable)) != mp_const_stop_iteration) {
62 if (len >= alloc) {
63 items = m_renew(mp_obj_t, items, alloc, alloc * 2);
64 alloc *= 2;
65 }
66 items[len++] = item;
67 }
68
69 mp_obj_t tuple = mp_obj_new_tuple(len, items);
70 m_free(items, alloc);
71
72 return tuple;
73 }
74
75 default:
76 nlr_jump(mp_obj_new_exception_msg_1_arg(MP_QSTR_TypeError, "tuple takes at most 1 argument, %d given", (void*)(machine_int_t)n_args));
77 }
78}
79
80static mp_obj_t tuple_binary_op(int op, mp_obj_t lhs, mp_obj_t rhs) {
Damiend99b0522013-12-21 18:17:45 +000081 mp_obj_tuple_t *o = lhs;
82 switch (op) {
83 case RT_BINARY_OP_SUBSCR:
84 {
85 // tuple load
86 uint index = mp_get_index(o->base.type, o->len, rhs);
87 return o->items[index];
88 }
89 default:
90 // op not supported
91 return NULL;
92 }
93}
94
Damien George71c51812014-01-04 20:21:15 +000095static mp_obj_t tuple_getiter(mp_obj_t o_in) {
Damiend99b0522013-12-21 18:17:45 +000096 return mp_obj_new_tuple_iterator(o_in, 0);
97}
98
Damiend99b0522013-12-21 18:17:45 +000099const mp_obj_type_t tuple_type = {
100 { &mp_const_type },
101 "tuple",
102 tuple_print, // print
Damien George71c51812014-01-04 20:21:15 +0000103 tuple_make_new, // make_new
Damiend99b0522013-12-21 18:17:45 +0000104 NULL, // call_n
105 NULL, // unary_op
106 tuple_binary_op, // binary_op
107 tuple_getiter, // getiter
108 NULL, // iternext
109 {{NULL, NULL},}, // method list
110};
111
Damien George71c51812014-01-04 20:21:15 +0000112// the zero-length tuple
113static const mp_obj_tuple_t empty_tuple_obj = {{&tuple_type}, 0};
114const mp_obj_t mp_const_empty_tuple = (mp_obj_t)&empty_tuple_obj;
115
Damiend99b0522013-12-21 18:17:45 +0000116mp_obj_t mp_obj_new_tuple(uint n, mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000117 if (n == 0) {
118 return mp_const_empty_tuple;
119 }
Damiend99b0522013-12-21 18:17:45 +0000120 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
121 o->base.type = &tuple_type;
122 o->len = n;
123 for (int i = 0; i < n; i++) {
124 o->items[i] = items[i];
125 }
126 return o;
127}
128
129mp_obj_t mp_obj_new_tuple_reverse(uint n, mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000130 if (n == 0) {
131 return mp_const_empty_tuple;
132 }
Damiend99b0522013-12-21 18:17:45 +0000133 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
134 o->base.type = &tuple_type;
135 o->len = n;
136 for (int i = 0; i < n; i++) {
137 o->items[i] = items[n - i - 1];
138 }
139 return o;
140}
141
Damien George71c51812014-01-04 20:21:15 +0000142void mp_obj_tuple_get(mp_obj_t self_in, uint *len, mp_obj_t **items) {
143 mp_obj_tuple_t *self = self_in;
144 *len = self->len;
145 *items = &self->items[0];
146}
147
Damiend99b0522013-12-21 18:17:45 +0000148/******************************************************************************/
149/* tuple iterator */
150
151typedef struct _mp_obj_tuple_it_t {
152 mp_obj_base_t base;
153 mp_obj_tuple_t *tuple;
154 machine_uint_t cur;
155} mp_obj_tuple_it_t;
156
Damien George71c51812014-01-04 20:21:15 +0000157static mp_obj_t tuple_it_iternext(mp_obj_t self_in) {
Damiend99b0522013-12-21 18:17:45 +0000158 mp_obj_tuple_it_t *self = self_in;
159 if (self->cur < self->tuple->len) {
160 mp_obj_t o_out = self->tuple->items[self->cur];
161 self->cur += 1;
162 return o_out;
163 } else {
164 return mp_const_stop_iteration;
165 }
166}
167
168static const mp_obj_type_t tuple_it_type = {
169 { &mp_const_type },
170 "tuple_iterator",
171 NULL, // print
Damien George71c51812014-01-04 20:21:15 +0000172 NULL, // make_new
Damiend99b0522013-12-21 18:17:45 +0000173 NULL, // call_n
174 NULL, // unary_op
175 NULL, // binary_op
176 NULL, // getiter
177 tuple_it_iternext,
178 {{NULL, NULL},}, // method list
179};
180
181static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur) {
182 mp_obj_tuple_it_t *o = m_new_obj(mp_obj_tuple_it_t);
183 o->base.type = &tuple_it_type;
184 o->tuple = tuple;
185 o->cur = cur;
186 return o;
187}