blob: 9821dd2fbb8c3dd3ba248e1f059fb8f9a6aacbfa [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"
Paul Sokolovsky8eec8bc2014-01-12 23:23:10 +020012#include "objtuple.h"
Damiend99b0522013-12-21 18:17:45 +000013
14static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur);
15
16/******************************************************************************/
17/* tuple */
18
Paul Sokolovsky8eec8bc2014-01-12 23:23:10 +020019void tuple_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t o_in) {
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 }
26 mp_obj_print_helper(print, env, o->items[i]);
27 }
28 if (o->len == 1) {
29 print(env, ",");
30 }
31 print(env, ")");
32}
33
Damien George71c51812014-01-04 20:21:15 +000034// args are in reverse order in the array
35static mp_obj_t tuple_make_new(mp_obj_t type_in, int n_args, const mp_obj_t *args) {
36 switch (n_args) {
37 case 0:
38 // return a empty tuple
39 return mp_const_empty_tuple;
40
41 case 1:
42 {
43 // 1 argument, an iterable from which we make a new tuple
44 if (MP_OBJ_IS_TYPE(args[0], &tuple_type)) {
45 return args[0];
46 }
47
48 // TODO optimise for cases where we know the length of the iterator
49
50 uint alloc = 4;
51 uint len = 0;
52 mp_obj_t *items = m_new(mp_obj_t, alloc);
53
54 mp_obj_t iterable = rt_getiter(args[0]);
55 mp_obj_t item;
56 while ((item = rt_iternext(iterable)) != mp_const_stop_iteration) {
57 if (len >= alloc) {
58 items = m_renew(mp_obj_t, items, alloc, alloc * 2);
59 alloc *= 2;
60 }
61 items[len++] = item;
62 }
63
64 mp_obj_t tuple = mp_obj_new_tuple(len, items);
65 m_free(items, alloc);
66
67 return tuple;
68 }
69
70 default:
71 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));
72 }
73}
74
75static mp_obj_t tuple_binary_op(int op, mp_obj_t lhs, mp_obj_t rhs) {
Damiend99b0522013-12-21 18:17:45 +000076 mp_obj_tuple_t *o = lhs;
77 switch (op) {
78 case RT_BINARY_OP_SUBSCR:
79 {
80 // tuple load
81 uint index = mp_get_index(o->base.type, o->len, rhs);
82 return o->items[index];
83 }
84 default:
85 // op not supported
86 return NULL;
87 }
88}
89
Damien George71c51812014-01-04 20:21:15 +000090static mp_obj_t tuple_getiter(mp_obj_t o_in) {
Damiend99b0522013-12-21 18:17:45 +000091 return mp_obj_new_tuple_iterator(o_in, 0);
92}
93
Damiend99b0522013-12-21 18:17:45 +000094const mp_obj_type_t tuple_type = {
John R. Lenton3391e192014-01-07 18:06:34 +000095 { &mp_const_type },
96 "tuple",
Paul Sokolovsky860ffb02014-01-05 22:34:09 +020097 .print = tuple_print,
98 .make_new = tuple_make_new,
99 .binary_op = tuple_binary_op,
100 .getiter = tuple_getiter,
Damiend99b0522013-12-21 18:17:45 +0000101};
102
Damien George71c51812014-01-04 20:21:15 +0000103// the zero-length tuple
104static const mp_obj_tuple_t empty_tuple_obj = {{&tuple_type}, 0};
105const mp_obj_t mp_const_empty_tuple = (mp_obj_t)&empty_tuple_obj;
106
John R. Lentonc06763a2014-01-07 17:29:16 +0000107mp_obj_t mp_obj_new_tuple(uint n, const mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000108 if (n == 0) {
109 return mp_const_empty_tuple;
110 }
Damiend99b0522013-12-21 18:17:45 +0000111 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
112 o->base.type = &tuple_type;
113 o->len = n;
114 for (int i = 0; i < n; i++) {
115 o->items[i] = items[i];
116 }
117 return o;
118}
119
John R. Lentonc06763a2014-01-07 17:29:16 +0000120mp_obj_t mp_obj_new_tuple_reverse(uint n, const mp_obj_t *items) {
Damien George71c51812014-01-04 20:21:15 +0000121 if (n == 0) {
122 return mp_const_empty_tuple;
123 }
Damiend99b0522013-12-21 18:17:45 +0000124 mp_obj_tuple_t *o = m_new_obj_var(mp_obj_tuple_t, mp_obj_t, n);
125 o->base.type = &tuple_type;
126 o->len = n;
127 for (int i = 0; i < n; i++) {
128 o->items[i] = items[n - i - 1];
129 }
130 return o;
131}
132
Damien George71c51812014-01-04 20:21:15 +0000133void mp_obj_tuple_get(mp_obj_t self_in, uint *len, mp_obj_t **items) {
Damien George004cdce2014-01-09 21:43:51 +0000134 assert(MP_OBJ_IS_TYPE(self_in, &tuple_type));
Damien George71c51812014-01-04 20:21:15 +0000135 mp_obj_tuple_t *self = self_in;
136 *len = self->len;
137 *items = &self->items[0];
138}
139
Damiend99b0522013-12-21 18:17:45 +0000140/******************************************************************************/
141/* tuple iterator */
142
143typedef struct _mp_obj_tuple_it_t {
144 mp_obj_base_t base;
145 mp_obj_tuple_t *tuple;
146 machine_uint_t cur;
147} mp_obj_tuple_it_t;
148
Damien George71c51812014-01-04 20:21:15 +0000149static mp_obj_t tuple_it_iternext(mp_obj_t self_in) {
Damiend99b0522013-12-21 18:17:45 +0000150 mp_obj_tuple_it_t *self = self_in;
151 if (self->cur < self->tuple->len) {
152 mp_obj_t o_out = self->tuple->items[self->cur];
153 self->cur += 1;
154 return o_out;
155 } else {
156 return mp_const_stop_iteration;
157 }
158}
159
160static const mp_obj_type_t tuple_it_type = {
John R. Lenton3391e192014-01-07 18:06:34 +0000161 { &mp_const_type },
162 "tuple_iterator",
Paul Sokolovsky860ffb02014-01-05 22:34:09 +0200163 .iternext = tuple_it_iternext,
Damiend99b0522013-12-21 18:17:45 +0000164};
165
166static mp_obj_t mp_obj_new_tuple_iterator(mp_obj_tuple_t *tuple, int cur) {
167 mp_obj_tuple_it_t *o = m_new_obj(mp_obj_tuple_it_t);
168 o->base.type = &tuple_it_type;
169 o->tuple = tuple;
170 o->cur = cur;
171 return o;
172}