blob: d8c36021b56cf129a56708bf03e5789272b72dbb [file] [log] [blame]
Paul Sokolovsky9ed54352014-02-02 03:42:07 +02001#include <string.h>
Damiend99b0522013-12-21 18:17:45 +00002#include <assert.h>
3
4#include "nlr.h"
5#include "misc.h"
6#include "mpconfig.h"
Damien George55baff42014-01-21 21:40:13 +00007#include "qstr.h"
Damiend99b0522013-12-21 18:17:45 +00008#include "obj.h"
Damien George9b196cd2014-03-26 21:47:19 +00009#include "map.h"
Damiend99b0522013-12-21 18:17:45 +000010#include "runtime0.h"
Damien George71c51812014-01-04 20:21:15 +000011#include "runtime.h"
Paul Sokolovsky8eec8bc2014-01-12 23:23:10 +020012#include "objtuple.h"
Damiend99b0522013-12-21 18:17:45 +000013
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +020014STATIC mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur);
Damiend99b0522013-12-21 18:17:45 +000015
16/******************************************************************************/
17/* tuple */
18
Paul Sokolovsky76d982e2014-01-13 19:19:16 +020019void tuple_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t o_in, mp_print_kind_t kind) {
Damiend99b0522013-12-21 18:17:45 +000020 mp_obj_tuple_t *o = o_in;
21 print(env, "(");
22 for (int i = 0; i < o->len; i++) {
23 if (i > 0) {
24 print(env, ", ");
25 }
Paul Sokolovsky76d982e2014-01-13 19:19:16 +020026 mp_obj_print_helper(print, env, o->items[i], PRINT_REPR);
Damiend99b0522013-12-21 18:17:45 +000027 }
28 if (o->len == 1) {
29 print(env, ",");
30 }
31 print(env, ")");
32}
33
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +020034STATIC mp_obj_t tuple_make_new(mp_obj_t type_in, uint n_args, uint n_kw, const mp_obj_t *args) {
Damien George20006db2014-01-18 14:10:48 +000035 // TODO check n_kw == 0
36
Damien George71c51812014-01-04 20:21:15 +000037 switch (n_args) {
38 case 0:
39 // return a empty tuple
40 return mp_const_empty_tuple;
41
42 case 1:
43 {
44 // 1 argument, an iterable from which we make a new tuple
Damien George07ddab52014-03-29 13:15:08 +000045 if (MP_OBJ_IS_TYPE(args[0], &mp_type_tuple)) {
Damien George71c51812014-01-04 20:21:15 +000046 return args[0];
47 }
48
49 // TODO optimise for cases where we know the length of the iterator
50
51 uint alloc = 4;
52 uint len = 0;
53 mp_obj_t *items = m_new(mp_obj_t, alloc);
54
55 mp_obj_t iterable = rt_getiter(args[0]);
56 mp_obj_t item;
Damien George66eaf842014-03-26 19:27:58 +000057 while ((item = rt_iternext(iterable)) != MP_OBJ_NULL) {
Damien George71c51812014-01-04 20:21:15 +000058 if (len >= alloc) {
59 items = m_renew(mp_obj_t, items, alloc, alloc * 2);
60 alloc *= 2;
61 }
62 items[len++] = item;
63 }
64
65 mp_obj_t tuple = mp_obj_new_tuple(len, items);
66 m_free(items, alloc);
67
68 return tuple;
69 }
70
71 default:
Damien Georgec5966122014-02-15 16:10:44 +000072 nlr_jump(mp_obj_new_exception_msg_varg(&mp_type_TypeError, "tuple takes at most 1 argument, %d given", n_args));
Damien George71c51812014-01-04 20:21:15 +000073 }
74}
75
Paul Sokolovskye827e982014-02-08 22:55:00 +020076// Don't pass RT_BINARY_OP_NOT_EQUAL here
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +020077STATIC bool tuple_cmp_helper(int op, mp_obj_t self_in, mp_obj_t another_in) {
Damien George07ddab52014-03-29 13:15:08 +000078 assert(MP_OBJ_IS_TYPE(self_in, &mp_type_tuple));
79 if (!MP_OBJ_IS_TYPE(another_in, &mp_type_tuple)) {
Paul Sokolovskye827e982014-02-08 22:55:00 +020080 return false;
81 }
82 mp_obj_tuple_t *self = self_in;
83 mp_obj_tuple_t *another = another_in;
84
85 return mp_seq_cmp_objs(op, self->items, self->len, another->items, another->len);
86}
87
Paul Sokolovskye74f52b2014-02-27 22:49:47 +020088mp_obj_t tuple_unary_op(int op, mp_obj_t self_in) {
Damien George4e8dc8c2014-01-27 23:15:32 +000089 mp_obj_tuple_t *self = self_in;
90 switch (op) {
Paul Sokolovskyc1d9bbc2014-01-30 04:37:19 +020091 case RT_UNARY_OP_BOOL: return MP_BOOL(self->len != 0);
92 case RT_UNARY_OP_LEN: return MP_OBJ_NEW_SMALL_INT(self->len);
Damien George4e8dc8c2014-01-27 23:15:32 +000093 default: return MP_OBJ_NULL; // op not supported for None
94 }
95}
96
Paul Sokolovskye74f52b2014-02-27 22:49:47 +020097mp_obj_t tuple_binary_op(int op, mp_obj_t lhs, mp_obj_t rhs) {
Damiend99b0522013-12-21 18:17:45 +000098 mp_obj_tuple_t *o = lhs;
99 switch (op) {
100 case RT_BINARY_OP_SUBSCR:
101 {
Paul Sokolovsky9ed54352014-02-02 03:42:07 +0200102#if MICROPY_ENABLE_SLICE
Damien George3e1a5c12014-03-29 13:43:38 +0000103 if (MP_OBJ_IS_TYPE(rhs, &mp_type_slice)) {
Paul Sokolovsky9ed54352014-02-02 03:42:07 +0200104 machine_uint_t start, stop;
Paul Sokolovskyea2509d2014-02-02 08:57:05 +0200105 if (!m_seq_get_fast_slice_indexes(o->len, rhs, &start, &stop)) {
106 assert(0);
107 }
Paul Sokolovsky9ed54352014-02-02 03:42:07 +0200108 mp_obj_tuple_t *res = mp_obj_new_tuple(stop - start, NULL);
109 m_seq_copy(res->items, o->items + start, res->len, mp_obj_t);
110 return res;
111 }
112#endif
xbe9e1e8cd2014-03-12 22:57:16 -0700113 uint index = mp_get_index(o->base.type, o->len, rhs, false);
Damiend99b0522013-12-21 18:17:45 +0000114 return o->items[index];
115 }
Paul Sokolovskyee4aaf72014-02-08 23:17:51 +0200116 case RT_BINARY_OP_ADD:
117 {
Damien George07ddab52014-03-29 13:15:08 +0000118 if (!mp_obj_is_subclass_fast(mp_obj_get_type(rhs), (mp_obj_t)&mp_type_tuple)) {
Paul Sokolovskyee4aaf72014-02-08 23:17:51 +0200119 return NULL;
120 }
121 mp_obj_tuple_t *p = rhs;
122 mp_obj_tuple_t *s = mp_obj_new_tuple(o->len + p->len, NULL);
123 m_seq_cat(s->items, o->items, o->len, p->items, p->len, mp_obj_t);
124 return s;
125 }
Paul Sokolovskyf7c24102014-02-08 23:19:48 +0200126 case RT_BINARY_OP_MULTIPLY:
127 {
128 if (!MP_OBJ_IS_SMALL_INT(rhs)) {
129 return NULL;
130 }
131 int n = MP_OBJ_SMALL_INT_VALUE(rhs);
132 mp_obj_tuple_t *s = mp_obj_new_tuple(o->len * n, NULL);
133 mp_seq_multiply(o->items, sizeof(*o->items), o->len, n, s->items);
134 return s;
135 }
Paul Sokolovskye827e982014-02-08 22:55:00 +0200136 case RT_BINARY_OP_EQUAL:
137 case RT_BINARY_OP_LESS:
138 case RT_BINARY_OP_LESS_EQUAL:
139 case RT_BINARY_OP_MORE:
140 case RT_BINARY_OP_MORE_EQUAL:
141 return MP_BOOL(tuple_cmp_helper(op, lhs, rhs));
142 case RT_BINARY_OP_NOT_EQUAL:
143 return MP_BOOL(!tuple_cmp_helper(RT_BINARY_OP_EQUAL, lhs, rhs));
144
Damiend99b0522013-12-21 18:17:45 +0000145 default:
146 // op not supported
147 return NULL;
148 }
149}
150
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200151STATIC mp_obj_t tuple_getiter(mp_obj_t o_in) {
Damiend99b0522013-12-21 18:17:45 +0000152 return mp_obj_new_tuple_iterator(o_in, 0);
153}
154
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200155STATIC mp_obj_t tuple_count(mp_obj_t self_in, mp_obj_t value) {
Damien George07ddab52014-03-29 13:15:08 +0000156 assert(MP_OBJ_IS_TYPE(self_in, &mp_type_tuple));
Paul Sokolovskyac0134d2014-02-10 07:10:55 +0200157 mp_obj_tuple_t *self = self_in;
158 return mp_seq_count_obj(self->items, self->len, value);
159}
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200160STATIC MP_DEFINE_CONST_FUN_OBJ_2(tuple_count_obj, tuple_count);
Paul Sokolovskyac0134d2014-02-10 07:10:55 +0200161
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200162STATIC mp_obj_t tuple_index(uint n_args, const mp_obj_t *args) {
Damien George07ddab52014-03-29 13:15:08 +0000163 assert(MP_OBJ_IS_TYPE(args[0], &mp_type_tuple));
Paul Sokolovsky624eff62014-02-10 06:42:20 +0200164 mp_obj_tuple_t *self = args[0];
165 return mp_seq_index_obj(self->items, self->len, n_args, args);
166}
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200167STATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(tuple_index_obj, 2, 4, tuple_index);
Paul Sokolovsky624eff62014-02-10 06:42:20 +0200168
Damien George9b196cd2014-03-26 21:47:19 +0000169STATIC const mp_map_elem_t tuple_locals_dict_table[] = {
170 { MP_OBJ_NEW_QSTR(MP_QSTR_count), (mp_obj_t)&tuple_count_obj },
171 { MP_OBJ_NEW_QSTR(MP_QSTR_index), (mp_obj_t)&tuple_index_obj },
Paul Sokolovsky624eff62014-02-10 06:42:20 +0200172};
173
Damien George9b196cd2014-03-26 21:47:19 +0000174STATIC MP_DEFINE_CONST_DICT(tuple_locals_dict, tuple_locals_dict_table);
175
Damien George07ddab52014-03-29 13:15:08 +0000176const mp_obj_type_t mp_type_tuple = {
Damien Georgec5966122014-02-15 16:10:44 +0000177 { &mp_type_type },
Damien Georgea71c83a2014-02-15 11:34:50 +0000178 .name = MP_QSTR_tuple,
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200179 .print = tuple_print,
180 .make_new = tuple_make_new,
Damien George4e8dc8c2014-01-27 23:15:32 +0000181 .unary_op = tuple_unary_op,
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200182 .binary_op = tuple_binary_op,
183 .getiter = tuple_getiter,
Damien George9b196cd2014-03-26 21:47:19 +0000184 .locals_dict = (mp_obj_t)&tuple_locals_dict,
Damiend99b0522013-12-21 18:17:45 +0000185};
186
Damien George71c51812014-01-04 20:21:15 +0000187// the zero-length tuple
Damien George07ddab52014-03-29 13:15:08 +0000188const mp_obj_tuple_t mp_const_empty_tuple_obj = {{&mp_type_tuple}, 0};
Damien George71c51812014-01-04 20:21:15 +0000189
John R. Lentonc06763a2014-01-07 17:29:16 +0000190mp_obj_t mp_obj_new_tuple(uint n, const mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000191 if (n == 0) {
192 return mp_const_empty_tuple;
193 }
Damiend99b0522013-12-21 18:17:45 +0000194 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
Damien George07ddab52014-03-29 13:15:08 +0000195 o->base.type = &mp_type_tuple;
Damiend99b0522013-12-21 18:17:45 +0000196 o->len = n;
John R. Lenton07205ec2014-01-13 02:31:00 +0000197 if (items) {
198 for (int i = 0; i < n; i++) {
199 o->items[i] = items[i];
200 }
Damiend99b0522013-12-21 18:17:45 +0000201 }
202 return o;
203}
204
Damien George71c51812014-01-04 20:21:15 +0000205void mp_obj_tuple_get(mp_obj_t self_in, uint *len, mp_obj_t **items) {
Damien George07ddab52014-03-29 13:15:08 +0000206 assert(MP_OBJ_IS_TYPE(self_in, &mp_type_tuple));
Damien George71c51812014-01-04 20:21:15 +0000207 mp_obj_tuple_t *self = self_in;
John R. Lenton07205ec2014-01-13 02:31:00 +0000208 if (len) {
209 *len = self->len;
210 }
211 if (items) {
212 *items = &self->items[0];
213 }
214}
215
216void mp_obj_tuple_del(mp_obj_t self_in) {
Damien George07ddab52014-03-29 13:15:08 +0000217 assert(MP_OBJ_IS_TYPE(self_in, &mp_type_tuple));
John R. Lenton07205ec2014-01-13 02:31:00 +0000218 mp_obj_tuple_t *self = self_in;
219 m_del_var(mp_obj_tuple_t, mp_obj_t, self->len, self);
Damien George71c51812014-01-04 20:21:15 +0000220}
221
Damien George7f8be592014-03-20 19:20:59 +0000222machine_int_t mp_obj_tuple_hash(mp_obj_t self_in) {
Damien George07ddab52014-03-29 13:15:08 +0000223 assert(MP_OBJ_IS_TYPE(self_in, &mp_type_tuple));
Damien George7f8be592014-03-20 19:20:59 +0000224 mp_obj_tuple_t *self = self_in;
225 // start hash with pointer to empty tuple, to make it fairly unique
226 machine_int_t hash = (machine_int_t)mp_const_empty_tuple;
227 for (uint i = 0; i < self->len; i++) {
228 hash += mp_obj_hash(self->items[i]);
229 }
230 return hash;
231}
232
Damiend99b0522013-12-21 18:17:45 +0000233/******************************************************************************/
234/* tuple iterator */
235
236typedef struct _mp_obj_tuple_it_t {
237 mp_obj_base_t base;
238 mp_obj_tuple_t *tuple;
239 machine_uint_t cur;
240} mp_obj_tuple_it_t;
241
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200242STATIC mp_obj_t tuple_it_iternext(mp_obj_t self_in) {
Damiend99b0522013-12-21 18:17:45 +0000243 mp_obj_tuple_it_t *self = self_in;
244 if (self->cur < self->tuple->len) {
245 mp_obj_t o_out = self->tuple->items[self->cur];
246 self->cur += 1;
247 return o_out;
248 } else {
Damien George66eaf842014-03-26 19:27:58 +0000249 return MP_OBJ_NULL;
Damiend99b0522013-12-21 18:17:45 +0000250 }
251}
252
Damien George3e1a5c12014-03-29 13:43:38 +0000253STATIC const mp_obj_type_t mp_type_tuple_it = {
Damien Georgec5966122014-02-15 16:10:44 +0000254 { &mp_type_type },
Damien Georgea71c83a2014-02-15 11:34:50 +0000255 .name = MP_QSTR_iterator,
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200256 .iternext = tuple_it_iternext,
Damiend99b0522013-12-21 18:17:45 +0000257};
258
Paul Sokolovskyd5df6cd2014-02-12 18:15:40 +0200259STATIC mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur) {
Damiend99b0522013-12-21 18:17:45 +0000260 mp_obj_tuple_it_t *o = m_new_obj(mp_obj_tuple_it_t);
Damien George3e1a5c12014-03-29 13:43:38 +0000261 o->base.type = &mp_type_tuple_it;
Damiend99b0522013-12-21 18:17:45 +0000262 o->tuple = tuple;
263 o->cur = cur;
264 return o;
265}