objdict.c 23 KB

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