objdict.c 24 KB

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