objtuple.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299
  1. /*
  2. * This file is part of the MicroPython project, http://micropython.org/
  3. *
  4. * The MIT License (MIT)
  5. *
  6. * Copyright (c) 2013, 2014 Damien P. George
  7. * Copyright (c) 2014-2017 Paul Sokolovsky
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. */
  27. #include <string.h>
  28. #include <assert.h>
  29. #include "py/objtuple.h"
  30. #include "py/runtime.h"
  31. // type check is done on getiter method to allow tuple, namedtuple, attrtuple
  32. #define mp_obj_is_tuple_compatible(o) (MP_OBJ_TYPE_GET_SLOT_OR_NULL(mp_obj_get_type(o), iter) == mp_obj_tuple_getiter)
  33. /******************************************************************************/
  34. /* tuple */
  35. void mp_obj_tuple_print(const mp_print_t *print, mp_obj_t o_in, mp_print_kind_t kind) {
  36. mp_obj_tuple_t *o = MP_OBJ_TO_PTR(o_in);
  37. const char *item_separator = ", ";
  38. if (MICROPY_PY_JSON && kind == PRINT_JSON) {
  39. mp_print_str(print, "[");
  40. #if MICROPY_PY_JSON_SEPARATORS
  41. item_separator = MP_PRINT_GET_EXT(print)->item_separator;
  42. #endif
  43. } else {
  44. mp_print_str(print, "(");
  45. kind = PRINT_REPR;
  46. }
  47. for (size_t i = 0; i < o->len; i++) {
  48. if (i > 0) {
  49. mp_print_str(print, item_separator);
  50. }
  51. mp_obj_print_helper(print, o->items[i], kind);
  52. }
  53. if (MICROPY_PY_JSON && kind == PRINT_JSON) {
  54. mp_print_str(print, "]");
  55. } else {
  56. if (o->len == 1) {
  57. mp_print_str(print, ",");
  58. }
  59. mp_print_str(print, ")");
  60. }
  61. }
  62. static mp_obj_t mp_obj_tuple_make_new(const mp_obj_type_t *type_in, size_t n_args, size_t n_kw, const mp_obj_t *args) {
  63. (void)type_in;
  64. mp_arg_check_num(n_args, n_kw, 0, 1, false);
  65. switch (n_args) {
  66. case 0:
  67. // return a empty tuple
  68. return mp_const_empty_tuple;
  69. case 1:
  70. default: {
  71. // 1 argument, an iterable from which we make a new tuple
  72. if (mp_obj_is_type(args[0], &mp_type_tuple)) {
  73. return args[0];
  74. }
  75. // TODO optimise for cases where we know the length of the iterator
  76. size_t alloc = 4;
  77. size_t len = 0;
  78. mp_obj_t *items = m_new(mp_obj_t, alloc);
  79. mp_obj_t iterable = mp_getiter(args[0], NULL);
  80. mp_obj_t item;
  81. while ((item = mp_iternext(iterable)) != MP_OBJ_STOP_ITERATION) {
  82. if (len >= alloc) {
  83. items = m_renew(mp_obj_t, items, alloc, alloc * 2);
  84. alloc *= 2;
  85. }
  86. items[len++] = item;
  87. }
  88. mp_obj_t tuple = mp_obj_new_tuple(len, items);
  89. m_del(mp_obj_t, items, alloc);
  90. return tuple;
  91. }
  92. }
  93. }
  94. // Don't pass MP_BINARY_OP_NOT_EQUAL here
  95. static mp_obj_t tuple_cmp_helper(mp_uint_t op, mp_obj_t self_in, mp_obj_t another_in) {
  96. mp_check_self(mp_obj_is_tuple_compatible(self_in));
  97. const mp_obj_type_t *another_type = mp_obj_get_type(another_in);
  98. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  99. if (MP_OBJ_TYPE_GET_SLOT_OR_NULL(another_type, iter) != mp_obj_tuple_getiter) {
  100. // Slow path for user subclasses
  101. another_in = mp_obj_cast_to_native_base(another_in, MP_OBJ_FROM_PTR(&mp_type_tuple));
  102. if (another_in == MP_OBJ_NULL) {
  103. return MP_OBJ_NULL;
  104. }
  105. }
  106. mp_obj_tuple_t *another = MP_OBJ_TO_PTR(another_in);
  107. return mp_obj_new_bool(mp_seq_cmp_objs(op, self->items, self->len, another->items, another->len));
  108. }
  109. mp_obj_t mp_obj_tuple_unary_op(mp_unary_op_t op, mp_obj_t self_in) {
  110. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  111. switch (op) {
  112. case MP_UNARY_OP_BOOL:
  113. return mp_obj_new_bool(self->len != 0);
  114. case MP_UNARY_OP_HASH: {
  115. // start hash with pointer to empty tuple, to make it fairly unique
  116. mp_int_t hash = (mp_int_t)mp_const_empty_tuple;
  117. for (size_t i = 0; i < self->len; i++) {
  118. hash += MP_OBJ_SMALL_INT_VALUE(mp_unary_op(MP_UNARY_OP_HASH, self->items[i]));
  119. }
  120. return MP_OBJ_NEW_SMALL_INT(hash);
  121. }
  122. case MP_UNARY_OP_LEN:
  123. return MP_OBJ_NEW_SMALL_INT(self->len);
  124. default:
  125. return MP_OBJ_NULL; // op not supported
  126. }
  127. }
  128. mp_obj_t mp_obj_tuple_binary_op(mp_binary_op_t op, mp_obj_t lhs, mp_obj_t rhs) {
  129. mp_obj_tuple_t *o = MP_OBJ_TO_PTR(lhs);
  130. switch (op) {
  131. case MP_BINARY_OP_ADD:
  132. case MP_BINARY_OP_INPLACE_ADD: {
  133. if (!mp_obj_is_subclass_fast(MP_OBJ_FROM_PTR(mp_obj_get_type(rhs)), MP_OBJ_FROM_PTR(&mp_type_tuple))) {
  134. return MP_OBJ_NULL; // op not supported
  135. }
  136. mp_obj_tuple_t *p = MP_OBJ_TO_PTR(rhs);
  137. mp_obj_tuple_t *s = MP_OBJ_TO_PTR(mp_obj_new_tuple(o->len + p->len, NULL));
  138. mp_seq_cat(s->items, o->items, o->len, p->items, p->len, mp_obj_t);
  139. return MP_OBJ_FROM_PTR(s);
  140. }
  141. case MP_BINARY_OP_MULTIPLY:
  142. case MP_BINARY_OP_INPLACE_MULTIPLY: {
  143. mp_int_t n;
  144. if (!mp_obj_get_int_maybe(rhs, &n)) {
  145. return MP_OBJ_NULL; // op not supported
  146. }
  147. if (n <= 0) {
  148. return mp_const_empty_tuple;
  149. }
  150. mp_obj_tuple_t *s = MP_OBJ_TO_PTR(mp_obj_new_tuple(o->len * n, NULL));
  151. mp_seq_multiply(o->items, sizeof(*o->items), o->len, n, s->items);
  152. return MP_OBJ_FROM_PTR(s);
  153. }
  154. case MP_BINARY_OP_EQUAL:
  155. case MP_BINARY_OP_LESS:
  156. case MP_BINARY_OP_LESS_EQUAL:
  157. case MP_BINARY_OP_MORE:
  158. case MP_BINARY_OP_MORE_EQUAL:
  159. return tuple_cmp_helper(op, lhs, rhs);
  160. default:
  161. return MP_OBJ_NULL; // op not supported
  162. }
  163. }
  164. mp_obj_t mp_obj_tuple_subscr(mp_obj_t self_in, mp_obj_t index, mp_obj_t value) {
  165. if (value == MP_OBJ_SENTINEL) {
  166. // load
  167. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  168. #if MICROPY_PY_BUILTINS_SLICE
  169. if (mp_obj_is_type(index, &mp_type_slice)) {
  170. mp_bound_slice_t slice;
  171. if (!mp_seq_get_fast_slice_indexes(self->len, index, &slice)) {
  172. mp_raise_NotImplementedError(MP_ERROR_TEXT("only slices with step=1 (aka None) are supported"));
  173. }
  174. mp_obj_tuple_t *res = MP_OBJ_TO_PTR(mp_obj_new_tuple(slice.stop - slice.start, NULL));
  175. mp_seq_copy(res->items, self->items + slice.start, res->len, mp_obj_t);
  176. return MP_OBJ_FROM_PTR(res);
  177. }
  178. #endif
  179. size_t index_value = mp_get_index(self->base.type, self->len, index, false);
  180. return self->items[index_value];
  181. } else {
  182. return MP_OBJ_NULL; // op not supported
  183. }
  184. }
  185. static mp_obj_t tuple_count(mp_obj_t self_in, mp_obj_t value) {
  186. mp_check_self(mp_obj_is_type(self_in, &mp_type_tuple));
  187. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  188. return mp_seq_count_obj(self->items, self->len, value);
  189. }
  190. static MP_DEFINE_CONST_FUN_OBJ_2(tuple_count_obj, tuple_count);
  191. static mp_obj_t tuple_index(size_t n_args, const mp_obj_t *args) {
  192. mp_check_self(mp_obj_is_type(args[0], &mp_type_tuple));
  193. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(args[0]);
  194. return mp_seq_index_obj(self->items, self->len, n_args, args);
  195. }
  196. static MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(tuple_index_obj, 2, 4, tuple_index);
  197. static const mp_rom_map_elem_t tuple_locals_dict_table[] = {
  198. { MP_ROM_QSTR(MP_QSTR_count), MP_ROM_PTR(&tuple_count_obj) },
  199. { MP_ROM_QSTR(MP_QSTR_index), MP_ROM_PTR(&tuple_index_obj) },
  200. };
  201. static MP_DEFINE_CONST_DICT(tuple_locals_dict, tuple_locals_dict_table);
  202. MP_DEFINE_CONST_OBJ_TYPE(
  203. mp_type_tuple,
  204. MP_QSTR_tuple,
  205. MP_TYPE_FLAG_ITER_IS_GETITER,
  206. make_new, mp_obj_tuple_make_new,
  207. print, mp_obj_tuple_print,
  208. unary_op, mp_obj_tuple_unary_op,
  209. binary_op, mp_obj_tuple_binary_op,
  210. subscr, mp_obj_tuple_subscr,
  211. iter, mp_obj_tuple_getiter,
  212. locals_dict, &tuple_locals_dict
  213. );
  214. // the zero-length tuple
  215. const mp_obj_tuple_t mp_const_empty_tuple_obj = {{&mp_type_tuple}, 0};
  216. mp_obj_t mp_obj_new_tuple(size_t n, const mp_obj_t *items) {
  217. if (n == 0) {
  218. return mp_const_empty_tuple;
  219. }
  220. mp_obj_tuple_t *o = mp_obj_malloc_var(mp_obj_tuple_t, items, mp_obj_t, n, &mp_type_tuple);
  221. o->len = n;
  222. if (items) {
  223. for (size_t i = 0; i < n; i++) {
  224. o->items[i] = items[i];
  225. }
  226. }
  227. return MP_OBJ_FROM_PTR(o);
  228. }
  229. void mp_obj_tuple_get(mp_obj_t self_in, size_t *len, mp_obj_t **items) {
  230. assert(mp_obj_is_tuple_compatible(self_in));
  231. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  232. *len = self->len;
  233. *items = &self->items[0];
  234. }
  235. void mp_obj_tuple_del(mp_obj_t self_in) {
  236. assert(mp_obj_is_type(self_in, &mp_type_tuple));
  237. mp_obj_tuple_t *self = MP_OBJ_TO_PTR(self_in);
  238. m_del_var(mp_obj_tuple_t, items, mp_obj_t, self->len, self);
  239. }
  240. /******************************************************************************/
  241. /* tuple iterator */
  242. typedef struct _mp_obj_tuple_it_t {
  243. mp_obj_base_t base;
  244. mp_fun_1_t iternext;
  245. mp_obj_tuple_t *tuple;
  246. size_t cur;
  247. } mp_obj_tuple_it_t;
  248. static mp_obj_t tuple_it_iternext(mp_obj_t self_in) {
  249. mp_obj_tuple_it_t *self = MP_OBJ_TO_PTR(self_in);
  250. if (self->cur < self->tuple->len) {
  251. mp_obj_t o_out = self->tuple->items[self->cur];
  252. self->cur += 1;
  253. return o_out;
  254. } else {
  255. return MP_OBJ_STOP_ITERATION;
  256. }
  257. }
  258. mp_obj_t mp_obj_tuple_getiter(mp_obj_t o_in, mp_obj_iter_buf_t *iter_buf) {
  259. assert(sizeof(mp_obj_tuple_it_t) <= sizeof(mp_obj_iter_buf_t));
  260. mp_obj_tuple_it_t *o = (mp_obj_tuple_it_t *)iter_buf;
  261. o->base.type = &mp_type_polymorph_iter;
  262. o->iternext = tuple_it_iternext;
  263. o->tuple = MP_OBJ_TO_PTR(o_in);
  264. o->cur = 0;
  265. return MP_OBJ_FROM_PTR(o);
  266. }