objdict.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602
  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. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  24. * THE SOFTWARE.
  25. */
  26. #include <string.h>
  27. #include <assert.h>
  28. #include "py/runtime.h"
  29. #include "py/builtin.h"
  30. #include "py/objtype.h"
  31. #define MP_OBJ_IS_DICT_TYPE(o) (MP_OBJ_IS_OBJ(o) && ((mp_obj_base_t*)MP_OBJ_TO_PTR(o))->type->make_new == dict_make_new)
  32. STATIC mp_obj_t dict_update(size_t n_args, const mp_obj_t *args, mp_map_t *kwargs);
  33. // This is a helper function to iterate through a dictionary. The state of
  34. // the iteration is held in *cur and should be initialised with zero for the
  35. // first call. Will return NULL when no more elements are available.
  36. STATIC mp_map_elem_t *dict_iter_next(mp_obj_dict_t *dict, size_t *cur) {
  37. size_t max = dict->map.alloc;
  38. mp_map_t *map = &dict->map;
  39. for (size_t i = *cur; i < max; i++) {
  40. if (MP_MAP_SLOT_IS_FILLED(map, i)) {
  41. *cur = i + 1;
  42. return &(map->table[i]);
  43. }
  44. }
  45. return NULL;
  46. }
  47. STATIC void dict_print(const mp_print_t *print, mp_obj_t self_in, mp_print_kind_t kind) {
  48. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  49. bool first = true;
  50. if (!(MICROPY_PY_UJSON && kind == PRINT_JSON)) {
  51. kind = PRINT_REPR;
  52. }
  53. if (MICROPY_PY_COLLECTIONS_ORDEREDDICT && self->base.type != &mp_type_dict) {
  54. mp_printf(print, "%q(", self->base.type->name);
  55. }
  56. mp_print_str(print, "{");
  57. size_t cur = 0;
  58. mp_map_elem_t *next = NULL;
  59. while ((next = dict_iter_next(self, &cur)) != NULL) {
  60. if (!first) {
  61. mp_print_str(print, ", ");
  62. }
  63. first = false;
  64. mp_obj_print_helper(print, next->key, kind);
  65. mp_print_str(print, ": ");
  66. mp_obj_print_helper(print, next->value, kind);
  67. }
  68. mp_print_str(print, "}");
  69. if (MICROPY_PY_COLLECTIONS_ORDEREDDICT && self->base.type != &mp_type_dict) {
  70. mp_print_str(print, ")");
  71. }
  72. }
  73. STATIC mp_obj_t dict_make_new(const mp_obj_type_t *type, size_t n_args, size_t n_kw, const mp_obj_t *args) {
  74. mp_obj_t dict_out = mp_obj_new_dict(0);
  75. mp_obj_dict_t *dict = MP_OBJ_TO_PTR(dict_out);
  76. dict->base.type = type;
  77. #if MICROPY_PY_COLLECTIONS_ORDEREDDICT
  78. if (type == &mp_type_ordereddict) {
  79. dict->map.is_ordered = 1;
  80. }
  81. #endif
  82. if (n_args > 0 || n_kw > 0) {
  83. mp_obj_t args2[2] = {dict_out, args[0]}; // args[0] is always valid, even if it's not a positional arg
  84. mp_map_t kwargs;
  85. mp_map_init_fixed_table(&kwargs, n_kw, args + n_args);
  86. dict_update(n_args + 1, args2, &kwargs); // dict_update will check that n_args + 1 == 1 or 2
  87. }
  88. return dict_out;
  89. }
  90. STATIC mp_obj_t dict_unary_op(mp_unary_op_t op, mp_obj_t self_in) {
  91. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  92. switch (op) {
  93. case MP_UNARY_OP_BOOL: return mp_obj_new_bool(self->map.used != 0);
  94. case MP_UNARY_OP_LEN: return MP_OBJ_NEW_SMALL_INT(self->map.used);
  95. #if MICROPY_PY_SYS_GETSIZEOF
  96. case MP_UNARY_OP_SIZEOF: {
  97. size_t sz = sizeof(*self) + sizeof(*self->map.table) * self->map.alloc;
  98. return MP_OBJ_NEW_SMALL_INT(sz);
  99. }
  100. #endif
  101. default: return MP_OBJ_NULL; // op not supported
  102. }
  103. }
  104. STATIC mp_obj_t dict_binary_op(mp_binary_op_t op, mp_obj_t lhs_in, mp_obj_t rhs_in) {
  105. mp_obj_dict_t *o = MP_OBJ_TO_PTR(lhs_in);
  106. switch (op) {
  107. case MP_BINARY_OP_CONTAINS: {
  108. mp_map_elem_t *elem = mp_map_lookup(&o->map, rhs_in, MP_MAP_LOOKUP);
  109. return mp_obj_new_bool(elem != NULL);
  110. }
  111. case MP_BINARY_OP_EQUAL: {
  112. #if MICROPY_PY_COLLECTIONS_ORDEREDDICT
  113. if (MP_UNLIKELY(MP_OBJ_IS_TYPE(lhs_in, &mp_type_ordereddict) && MP_OBJ_IS_TYPE(rhs_in, &mp_type_ordereddict))) {
  114. // Iterate through both dictionaries simultaneously and compare keys and values.
  115. mp_obj_dict_t *rhs = MP_OBJ_TO_PTR(rhs_in);
  116. size_t c1 = 0, c2 = 0;
  117. mp_map_elem_t *e1 = dict_iter_next(o, &c1), *e2 = dict_iter_next(rhs, &c2);
  118. for (; e1 != NULL && e2 != NULL; e1 = dict_iter_next(o, &c1), e2 = dict_iter_next(rhs, &c2)) {
  119. if (!mp_obj_equal(e1->key, e2->key) || !mp_obj_equal(e1->value, e2->value)) {
  120. return mp_const_false;
  121. }
  122. }
  123. return e1 == NULL && e2 == NULL ? mp_const_true : mp_const_false;
  124. } else
  125. #endif
  126. if (MP_OBJ_IS_TYPE(rhs_in, &mp_type_dict)) {
  127. mp_obj_dict_t *rhs = MP_OBJ_TO_PTR(rhs_in);
  128. if (o->map.used != rhs->map.used) {
  129. return mp_const_false;
  130. }
  131. size_t cur = 0;
  132. mp_map_elem_t *next = NULL;
  133. while ((next = dict_iter_next(o, &cur)) != NULL) {
  134. mp_map_elem_t *elem = mp_map_lookup(&rhs->map, next->key, MP_MAP_LOOKUP);
  135. if (elem == NULL || !mp_obj_equal(next->value, elem->value)) {
  136. return mp_const_false;
  137. }
  138. }
  139. return mp_const_true;
  140. } else {
  141. // dict is not equal to instance of any other type
  142. return mp_const_false;
  143. }
  144. }
  145. default:
  146. // op not supported
  147. return MP_OBJ_NULL;
  148. }
  149. }
  150. // TODO: Make sure this is inlined in dict_subscr() below.
  151. mp_obj_t mp_obj_dict_get(mp_obj_t self_in, mp_obj_t index) {
  152. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  153. mp_map_elem_t *elem = mp_map_lookup(&self->map, index, MP_MAP_LOOKUP);
  154. if (elem == NULL) {
  155. nlr_raise(mp_obj_new_exception_arg1(&mp_type_KeyError, index));
  156. } else {
  157. return elem->value;
  158. }
  159. }
  160. STATIC mp_obj_t dict_subscr(mp_obj_t self_in, mp_obj_t index, mp_obj_t value) {
  161. if (value == MP_OBJ_NULL) {
  162. // delete
  163. mp_obj_dict_delete(self_in, index);
  164. return mp_const_none;
  165. } else if (value == MP_OBJ_SENTINEL) {
  166. // load
  167. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  168. mp_map_elem_t *elem = mp_map_lookup(&self->map, index, MP_MAP_LOOKUP);
  169. if (elem == NULL) {
  170. nlr_raise(mp_obj_new_exception_arg1(&mp_type_KeyError, index));
  171. } else {
  172. return elem->value;
  173. }
  174. } else {
  175. // store
  176. mp_obj_dict_store(self_in, index, value);
  177. return mp_const_none;
  178. }
  179. }
  180. /******************************************************************************/
  181. /* dict methods */
  182. STATIC void mp_ensure_not_fixed(const mp_obj_dict_t *dict) {
  183. if (dict->map.is_fixed) {
  184. mp_raise_TypeError(NULL);
  185. }
  186. }
  187. STATIC mp_obj_t dict_clear(mp_obj_t self_in) {
  188. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  189. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  190. mp_ensure_not_fixed(self);
  191. mp_map_clear(&self->map);
  192. return mp_const_none;
  193. }
  194. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_clear_obj, dict_clear);
  195. STATIC mp_obj_t dict_copy(mp_obj_t self_in) {
  196. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  197. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  198. mp_obj_t other_out = mp_obj_new_dict(self->map.alloc);
  199. mp_obj_dict_t *other = MP_OBJ_TO_PTR(other_out);
  200. other->base.type = self->base.type;
  201. other->map.used = self->map.used;
  202. other->map.all_keys_are_qstrs = self->map.all_keys_are_qstrs;
  203. other->map.is_fixed = 0;
  204. other->map.is_ordered = self->map.is_ordered;
  205. memcpy(other->map.table, self->map.table, self->map.alloc * sizeof(mp_map_elem_t));
  206. return other_out;
  207. }
  208. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_copy_obj, dict_copy);
  209. // this is a classmethod
  210. STATIC mp_obj_t dict_fromkeys(size_t n_args, const mp_obj_t *args) {
  211. mp_obj_t iter = mp_getiter(args[1], NULL);
  212. mp_obj_t value = mp_const_none;
  213. mp_obj_t next = MP_OBJ_NULL;
  214. if (n_args > 2) {
  215. value = args[2];
  216. }
  217. // optimisation to allocate result based on len of argument
  218. mp_obj_t self_out;
  219. mp_obj_t len = mp_obj_len_maybe(args[1]);
  220. if (len == MP_OBJ_NULL) {
  221. /* object's type doesn't have a __len__ slot */
  222. self_out = mp_obj_new_dict(0);
  223. } else {
  224. self_out = mp_obj_new_dict(MP_OBJ_SMALL_INT_VALUE(len));
  225. }
  226. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_out);
  227. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  228. mp_map_lookup(&self->map, next, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND)->value = value;
  229. }
  230. return self_out;
  231. }
  232. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(dict_fromkeys_fun_obj, 2, 3, dict_fromkeys);
  233. STATIC MP_DEFINE_CONST_CLASSMETHOD_OBJ(dict_fromkeys_obj, MP_ROM_PTR(&dict_fromkeys_fun_obj));
  234. STATIC mp_obj_t dict_get_helper(size_t n_args, const mp_obj_t *args, mp_map_lookup_kind_t lookup_kind) {
  235. mp_check_self(MP_OBJ_IS_DICT_TYPE(args[0]));
  236. mp_obj_dict_t *self = MP_OBJ_TO_PTR(args[0]);
  237. if (lookup_kind != MP_MAP_LOOKUP) {
  238. mp_ensure_not_fixed(self);
  239. }
  240. mp_map_elem_t *elem = mp_map_lookup(&self->map, args[1], lookup_kind);
  241. mp_obj_t value;
  242. if (elem == NULL || elem->value == MP_OBJ_NULL) {
  243. if (n_args == 2) {
  244. if (lookup_kind == MP_MAP_LOOKUP_REMOVE_IF_FOUND) {
  245. nlr_raise(mp_obj_new_exception_arg1(&mp_type_KeyError, args[1]));
  246. } else {
  247. value = mp_const_none;
  248. }
  249. } else {
  250. value = args[2];
  251. }
  252. if (lookup_kind == MP_MAP_LOOKUP_ADD_IF_NOT_FOUND) {
  253. elem->value = value;
  254. }
  255. } else {
  256. value = elem->value;
  257. if (lookup_kind == MP_MAP_LOOKUP_REMOVE_IF_FOUND) {
  258. elem->value = MP_OBJ_NULL; // so that GC can collect the deleted value
  259. }
  260. }
  261. return value;
  262. }
  263. STATIC mp_obj_t dict_get(size_t n_args, const mp_obj_t *args) {
  264. return dict_get_helper(n_args, args, MP_MAP_LOOKUP);
  265. }
  266. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(dict_get_obj, 2, 3, dict_get);
  267. STATIC mp_obj_t dict_pop(size_t n_args, const mp_obj_t *args) {
  268. return dict_get_helper(n_args, args, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  269. }
  270. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(dict_pop_obj, 2, 3, dict_pop);
  271. STATIC mp_obj_t dict_setdefault(size_t n_args, const mp_obj_t *args) {
  272. return dict_get_helper(n_args, args, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  273. }
  274. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(dict_setdefault_obj, 2, 3, dict_setdefault);
  275. STATIC mp_obj_t dict_popitem(mp_obj_t self_in) {
  276. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  277. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  278. mp_ensure_not_fixed(self);
  279. size_t cur = 0;
  280. mp_map_elem_t *next = dict_iter_next(self, &cur);
  281. if (next == NULL) {
  282. mp_raise_msg(&mp_type_KeyError, "popitem(): dictionary is empty");
  283. }
  284. self->map.used--;
  285. mp_obj_t items[] = {next->key, next->value};
  286. next->key = MP_OBJ_SENTINEL; // must mark key as sentinel to indicate that it was deleted
  287. next->value = MP_OBJ_NULL;
  288. mp_obj_t tuple = mp_obj_new_tuple(2, items);
  289. return tuple;
  290. }
  291. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_popitem_obj, dict_popitem);
  292. STATIC mp_obj_t dict_update(size_t n_args, const mp_obj_t *args, mp_map_t *kwargs) {
  293. mp_check_self(MP_OBJ_IS_DICT_TYPE(args[0]));
  294. mp_obj_dict_t *self = MP_OBJ_TO_PTR(args[0]);
  295. mp_ensure_not_fixed(self);
  296. mp_arg_check_num(n_args, kwargs->used, 1, 2, true);
  297. if (n_args == 2) {
  298. // given a positional argument
  299. if (MP_OBJ_IS_DICT_TYPE(args[1])) {
  300. // update from other dictionary (make sure other is not self)
  301. if (args[1] != args[0]) {
  302. size_t cur = 0;
  303. mp_map_elem_t *elem = NULL;
  304. while ((elem = dict_iter_next((mp_obj_dict_t*)MP_OBJ_TO_PTR(args[1]), &cur)) != NULL) {
  305. mp_map_lookup(&self->map, elem->key, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND)->value = elem->value;
  306. }
  307. }
  308. } else {
  309. // update from a generic iterable of pairs
  310. mp_obj_t iter = mp_getiter(args[1], NULL);
  311. mp_obj_t next = MP_OBJ_NULL;
  312. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  313. mp_obj_t inneriter = mp_getiter(next, NULL);
  314. mp_obj_t key = mp_iternext(inneriter);
  315. mp_obj_t value = mp_iternext(inneriter);
  316. mp_obj_t stop = mp_iternext(inneriter);
  317. if (key == MP_OBJ_STOP_ITERATION
  318. || value == MP_OBJ_STOP_ITERATION
  319. || stop != MP_OBJ_STOP_ITERATION) {
  320. mp_raise_ValueError("dict update sequence has wrong length");
  321. } else {
  322. mp_map_lookup(&self->map, key, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND)->value = value;
  323. }
  324. }
  325. }
  326. }
  327. // update the dict with any keyword args
  328. for (size_t i = 0; i < kwargs->alloc; i++) {
  329. if (MP_MAP_SLOT_IS_FILLED(kwargs, i)) {
  330. mp_map_lookup(&self->map, kwargs->table[i].key, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND)->value = kwargs->table[i].value;
  331. }
  332. }
  333. return mp_const_none;
  334. }
  335. STATIC MP_DEFINE_CONST_FUN_OBJ_KW(dict_update_obj, 1, dict_update);
  336. /******************************************************************************/
  337. /* dict views */
  338. STATIC const mp_obj_type_t dict_view_type;
  339. STATIC const mp_obj_type_t dict_view_it_type;
  340. typedef enum _mp_dict_view_kind_t {
  341. MP_DICT_VIEW_ITEMS,
  342. MP_DICT_VIEW_KEYS,
  343. MP_DICT_VIEW_VALUES,
  344. } mp_dict_view_kind_t;
  345. STATIC const char *const mp_dict_view_names[] = {"dict_items", "dict_keys", "dict_values"};
  346. typedef struct _mp_obj_dict_view_it_t {
  347. mp_obj_base_t base;
  348. mp_dict_view_kind_t kind;
  349. mp_obj_t dict;
  350. size_t cur;
  351. } mp_obj_dict_view_it_t;
  352. typedef struct _mp_obj_dict_view_t {
  353. mp_obj_base_t base;
  354. mp_obj_t dict;
  355. mp_dict_view_kind_t kind;
  356. } mp_obj_dict_view_t;
  357. STATIC mp_obj_t dict_view_it_iternext(mp_obj_t self_in) {
  358. mp_check_self(MP_OBJ_IS_TYPE(self_in, &dict_view_it_type));
  359. mp_obj_dict_view_it_t *self = MP_OBJ_TO_PTR(self_in);
  360. mp_map_elem_t *next = dict_iter_next(MP_OBJ_TO_PTR(self->dict), &self->cur);
  361. if (next == NULL) {
  362. return MP_OBJ_STOP_ITERATION;
  363. } else {
  364. switch (self->kind) {
  365. case MP_DICT_VIEW_ITEMS:
  366. default: {
  367. mp_obj_t items[] = {next->key, next->value};
  368. return mp_obj_new_tuple(2, items);
  369. }
  370. case MP_DICT_VIEW_KEYS:
  371. return next->key;
  372. case MP_DICT_VIEW_VALUES:
  373. return next->value;
  374. }
  375. }
  376. }
  377. STATIC const mp_obj_type_t dict_view_it_type = {
  378. { &mp_type_type },
  379. .name = MP_QSTR_iterator,
  380. .getiter = mp_identity_getiter,
  381. .iternext = dict_view_it_iternext,
  382. };
  383. STATIC mp_obj_t dict_view_getiter(mp_obj_t view_in, mp_obj_iter_buf_t *iter_buf) {
  384. assert(sizeof(mp_obj_dict_view_it_t) <= sizeof(mp_obj_iter_buf_t));
  385. mp_check_self(MP_OBJ_IS_TYPE(view_in, &dict_view_type));
  386. mp_obj_dict_view_t *view = MP_OBJ_TO_PTR(view_in);
  387. mp_obj_dict_view_it_t *o = (mp_obj_dict_view_it_t*)iter_buf;
  388. o->base.type = &dict_view_it_type;
  389. o->kind = view->kind;
  390. o->dict = view->dict;
  391. o->cur = 0;
  392. return MP_OBJ_FROM_PTR(o);
  393. }
  394. STATIC void dict_view_print(const mp_print_t *print, mp_obj_t self_in, mp_print_kind_t kind) {
  395. (void)kind;
  396. mp_check_self(MP_OBJ_IS_TYPE(self_in, &dict_view_type));
  397. mp_obj_dict_view_t *self = MP_OBJ_TO_PTR(self_in);
  398. bool first = true;
  399. mp_print_str(print, mp_dict_view_names[self->kind]);
  400. mp_print_str(print, "([");
  401. mp_obj_iter_buf_t iter_buf;
  402. mp_obj_t self_iter = dict_view_getiter(self_in, &iter_buf);
  403. mp_obj_t next = MP_OBJ_NULL;
  404. while ((next = dict_view_it_iternext(self_iter)) != MP_OBJ_STOP_ITERATION) {
  405. if (!first) {
  406. mp_print_str(print, ", ");
  407. }
  408. first = false;
  409. mp_obj_print_helper(print, next, PRINT_REPR);
  410. }
  411. mp_print_str(print, "])");
  412. }
  413. STATIC mp_obj_t dict_view_binary_op(mp_binary_op_t op, mp_obj_t lhs_in, mp_obj_t rhs_in) {
  414. // only supported for the 'keys' kind until sets and dicts are refactored
  415. mp_obj_dict_view_t *o = MP_OBJ_TO_PTR(lhs_in);
  416. if (o->kind != MP_DICT_VIEW_KEYS) {
  417. return MP_OBJ_NULL; // op not supported
  418. }
  419. if (op != MP_BINARY_OP_CONTAINS) {
  420. return MP_OBJ_NULL; // op not supported
  421. }
  422. return dict_binary_op(op, o->dict, rhs_in);
  423. }
  424. STATIC const mp_obj_type_t dict_view_type = {
  425. { &mp_type_type },
  426. .name = MP_QSTR_dict_view,
  427. .print = dict_view_print,
  428. .binary_op = dict_view_binary_op,
  429. .getiter = dict_view_getiter,
  430. };
  431. STATIC mp_obj_t mp_obj_new_dict_view(mp_obj_t dict, mp_dict_view_kind_t kind) {
  432. mp_obj_dict_view_t *o = m_new_obj(mp_obj_dict_view_t);
  433. o->base.type = &dict_view_type;
  434. o->dict = dict;
  435. o->kind = kind;
  436. return MP_OBJ_FROM_PTR(o);
  437. }
  438. STATIC mp_obj_t dict_view(mp_obj_t self_in, mp_dict_view_kind_t kind) {
  439. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  440. return mp_obj_new_dict_view(self_in, kind);
  441. }
  442. STATIC mp_obj_t dict_items(mp_obj_t self_in) {
  443. return dict_view(self_in, MP_DICT_VIEW_ITEMS);
  444. }
  445. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_items_obj, dict_items);
  446. STATIC mp_obj_t dict_keys(mp_obj_t self_in) {
  447. return dict_view(self_in, MP_DICT_VIEW_KEYS);
  448. }
  449. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_keys_obj, dict_keys);
  450. STATIC mp_obj_t dict_values(mp_obj_t self_in) {
  451. return dict_view(self_in, MP_DICT_VIEW_VALUES);
  452. }
  453. STATIC MP_DEFINE_CONST_FUN_OBJ_1(dict_values_obj, dict_values);
  454. /******************************************************************************/
  455. /* dict iterator */
  456. STATIC mp_obj_t dict_getiter(mp_obj_t self_in, mp_obj_iter_buf_t *iter_buf) {
  457. assert(sizeof(mp_obj_dict_view_it_t) <= sizeof(mp_obj_iter_buf_t));
  458. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  459. mp_obj_dict_view_it_t *o = (mp_obj_dict_view_it_t*)iter_buf;
  460. o->base.type = &dict_view_it_type;
  461. o->kind = MP_DICT_VIEW_KEYS;
  462. o->dict = self_in;
  463. o->cur = 0;
  464. return MP_OBJ_FROM_PTR(o);
  465. }
  466. /******************************************************************************/
  467. /* dict constructors & public C API */
  468. STATIC const mp_rom_map_elem_t dict_locals_dict_table[] = {
  469. { MP_ROM_QSTR(MP_QSTR_clear), MP_ROM_PTR(&dict_clear_obj) },
  470. { MP_ROM_QSTR(MP_QSTR_copy), MP_ROM_PTR(&dict_copy_obj) },
  471. { MP_ROM_QSTR(MP_QSTR_fromkeys), MP_ROM_PTR(&dict_fromkeys_obj) },
  472. { MP_ROM_QSTR(MP_QSTR_get), MP_ROM_PTR(&dict_get_obj) },
  473. { MP_ROM_QSTR(MP_QSTR_items), MP_ROM_PTR(&dict_items_obj) },
  474. { MP_ROM_QSTR(MP_QSTR_keys), MP_ROM_PTR(&dict_keys_obj) },
  475. { MP_ROM_QSTR(MP_QSTR_pop), MP_ROM_PTR(&dict_pop_obj) },
  476. { MP_ROM_QSTR(MP_QSTR_popitem), MP_ROM_PTR(&dict_popitem_obj) },
  477. { MP_ROM_QSTR(MP_QSTR_setdefault), MP_ROM_PTR(&dict_setdefault_obj) },
  478. { MP_ROM_QSTR(MP_QSTR_update), MP_ROM_PTR(&dict_update_obj) },
  479. { MP_ROM_QSTR(MP_QSTR_values), MP_ROM_PTR(&dict_values_obj) },
  480. { MP_ROM_QSTR(MP_QSTR___getitem__), MP_ROM_PTR(&mp_op_getitem_obj) },
  481. { MP_ROM_QSTR(MP_QSTR___setitem__), MP_ROM_PTR(&mp_op_setitem_obj) },
  482. { MP_ROM_QSTR(MP_QSTR___delitem__), MP_ROM_PTR(&mp_op_delitem_obj) },
  483. };
  484. STATIC MP_DEFINE_CONST_DICT(dict_locals_dict, dict_locals_dict_table);
  485. const mp_obj_type_t mp_type_dict = {
  486. { &mp_type_type },
  487. .name = MP_QSTR_dict,
  488. .print = dict_print,
  489. .make_new = dict_make_new,
  490. .unary_op = dict_unary_op,
  491. .binary_op = dict_binary_op,
  492. .subscr = dict_subscr,
  493. .getiter = dict_getiter,
  494. .locals_dict = (mp_obj_dict_t*)&dict_locals_dict,
  495. };
  496. #if MICROPY_PY_COLLECTIONS_ORDEREDDICT
  497. const mp_obj_type_t mp_type_ordereddict = {
  498. { &mp_type_type },
  499. .name = MP_QSTR_OrderedDict,
  500. .print = dict_print,
  501. .make_new = dict_make_new,
  502. .unary_op = dict_unary_op,
  503. .binary_op = dict_binary_op,
  504. .subscr = dict_subscr,
  505. .getiter = dict_getiter,
  506. .parent = &mp_type_dict,
  507. .locals_dict = (mp_obj_dict_t*)&dict_locals_dict,
  508. };
  509. #endif
  510. void mp_obj_dict_init(mp_obj_dict_t *dict, size_t n_args) {
  511. dict->base.type = &mp_type_dict;
  512. mp_map_init(&dict->map, n_args);
  513. }
  514. mp_obj_t mp_obj_new_dict(size_t n_args) {
  515. mp_obj_dict_t *o = m_new_obj(mp_obj_dict_t);
  516. mp_obj_dict_init(o, n_args);
  517. return MP_OBJ_FROM_PTR(o);
  518. }
  519. size_t mp_obj_dict_len(mp_obj_t self_in) {
  520. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  521. return self->map.used;
  522. }
  523. mp_obj_t mp_obj_dict_store(mp_obj_t self_in, mp_obj_t key, mp_obj_t value) {
  524. mp_check_self(MP_OBJ_IS_DICT_TYPE(self_in));
  525. mp_obj_dict_t *self = MP_OBJ_TO_PTR(self_in);
  526. mp_ensure_not_fixed(self);
  527. mp_map_lookup(&self->map, key, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND)->value = value;
  528. return self_in;
  529. }
  530. mp_obj_t mp_obj_dict_delete(mp_obj_t self_in, mp_obj_t key) {
  531. mp_obj_t args[2] = {self_in, key};
  532. dict_get_helper(2, args, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  533. return self_in;
  534. }