objset.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596
  1. /*
  2. * This file is part of the MicroPython project, http://micropython.org/
  3. *
  4. * The MIT License (MIT)
  5. *
  6. * Copyright (c) 2013-2017 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 <stdbool.h>
  27. #include <string.h>
  28. #include <assert.h>
  29. #include "py/runtime.h"
  30. #include "py/builtin.h"
  31. #if MICROPY_PY_BUILTINS_SET
  32. typedef struct _mp_obj_set_t {
  33. mp_obj_base_t base;
  34. mp_set_t set;
  35. } mp_obj_set_t;
  36. typedef struct _mp_obj_set_it_t {
  37. mp_obj_base_t base;
  38. mp_fun_1_t iternext;
  39. mp_obj_set_t *set;
  40. size_t cur;
  41. } mp_obj_set_it_t;
  42. static bool is_set_or_frozenset(mp_obj_t o) {
  43. return mp_obj_is_type(o, &mp_type_set)
  44. #if MICROPY_PY_BUILTINS_FROZENSET
  45. || mp_obj_is_type(o, &mp_type_frozenset)
  46. #endif
  47. ;
  48. }
  49. // This macro is shorthand for mp_check_self to verify the argument is a set.
  50. #define check_set(o) mp_check_self(mp_obj_is_type(o, &mp_type_set))
  51. // This macro is shorthand for mp_check_self to verify the argument is a
  52. // set or frozenset for methods that operate on both of these types.
  53. #define check_set_or_frozenset(o) mp_check_self(is_set_or_frozenset(o))
  54. static void set_print(const mp_print_t *print, mp_obj_t self_in, mp_print_kind_t kind) {
  55. (void)kind;
  56. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  57. #if MICROPY_PY_BUILTINS_FROZENSET
  58. bool is_frozen = mp_obj_is_type(self_in, &mp_type_frozenset);
  59. #endif
  60. if (self->set.used == 0) {
  61. #if MICROPY_PY_BUILTINS_FROZENSET
  62. if (is_frozen) {
  63. mp_print_str(print, "frozen");
  64. }
  65. #endif
  66. mp_print_str(print, "set()");
  67. return;
  68. }
  69. bool first = true;
  70. #if MICROPY_PY_BUILTINS_FROZENSET
  71. if (is_frozen) {
  72. mp_print_str(print, "frozenset(");
  73. }
  74. #endif
  75. mp_print_str(print, "{");
  76. for (size_t i = 0; i < self->set.alloc; i++) {
  77. if (mp_set_slot_is_filled(&self->set, i)) {
  78. if (!first) {
  79. mp_print_str(print, ", ");
  80. }
  81. first = false;
  82. mp_obj_print_helper(print, self->set.table[i], PRINT_REPR);
  83. }
  84. }
  85. mp_print_str(print, "}");
  86. #if MICROPY_PY_BUILTINS_FROZENSET
  87. if (is_frozen) {
  88. mp_print_str(print, ")");
  89. }
  90. #endif
  91. }
  92. static mp_obj_t set_make_new(const mp_obj_type_t *type, size_t n_args, size_t n_kw, const mp_obj_t *args) {
  93. mp_arg_check_num(n_args, n_kw, 0, 1, false);
  94. switch (n_args) {
  95. case 0: {
  96. // create a new, empty set
  97. mp_obj_set_t *set = MP_OBJ_TO_PTR(mp_obj_new_set(0, NULL));
  98. // set actual set/frozenset type
  99. set->base.type = type;
  100. return MP_OBJ_FROM_PTR(set);
  101. }
  102. case 1:
  103. default: { // can only be 0 or 1 arg
  104. // 1 argument, an iterable from which we make a new set
  105. mp_obj_t set = mp_obj_new_set(0, NULL);
  106. mp_obj_t iterable = mp_getiter(args[0], NULL);
  107. mp_obj_t item;
  108. while ((item = mp_iternext(iterable)) != MP_OBJ_STOP_ITERATION) {
  109. mp_obj_set_store(set, item);
  110. }
  111. // Set actual set/frozenset type
  112. ((mp_obj_set_t *)MP_OBJ_TO_PTR(set))->base.type = type;
  113. return set;
  114. }
  115. }
  116. }
  117. static mp_obj_t set_it_iternext(mp_obj_t self_in) {
  118. mp_obj_set_it_t *self = MP_OBJ_TO_PTR(self_in);
  119. size_t max = self->set->set.alloc;
  120. mp_set_t *set = &self->set->set;
  121. for (size_t i = self->cur; i < max; i++) {
  122. if (mp_set_slot_is_filled(set, i)) {
  123. self->cur = i + 1;
  124. return set->table[i];
  125. }
  126. }
  127. return MP_OBJ_STOP_ITERATION;
  128. }
  129. static mp_obj_t set_getiter(mp_obj_t set_in, mp_obj_iter_buf_t *iter_buf) {
  130. assert(sizeof(mp_obj_set_it_t) <= sizeof(mp_obj_iter_buf_t));
  131. mp_obj_set_it_t *o = (mp_obj_set_it_t *)iter_buf;
  132. o->base.type = &mp_type_polymorph_iter;
  133. o->iternext = set_it_iternext;
  134. o->set = (mp_obj_set_t *)MP_OBJ_TO_PTR(set_in);
  135. o->cur = 0;
  136. return MP_OBJ_FROM_PTR(o);
  137. }
  138. /******************************************************************************/
  139. /* set methods */
  140. static mp_obj_t set_add(mp_obj_t self_in, mp_obj_t item) {
  141. check_set(self_in);
  142. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  143. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  144. return mp_const_none;
  145. }
  146. static MP_DEFINE_CONST_FUN_OBJ_2(set_add_obj, set_add);
  147. static mp_obj_t set_clear(mp_obj_t self_in) {
  148. check_set(self_in);
  149. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  150. mp_set_clear(&self->set);
  151. return mp_const_none;
  152. }
  153. static MP_DEFINE_CONST_FUN_OBJ_1(set_clear_obj, set_clear);
  154. static mp_obj_t set_copy(mp_obj_t self_in) {
  155. check_set_or_frozenset(self_in);
  156. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  157. mp_obj_set_t *other = mp_obj_malloc(mp_obj_set_t, self->base.type);
  158. mp_set_init(&other->set, self->set.alloc);
  159. other->set.used = self->set.used;
  160. memcpy(other->set.table, self->set.table, self->set.alloc * sizeof(mp_obj_t));
  161. return MP_OBJ_FROM_PTR(other);
  162. }
  163. static MP_DEFINE_CONST_FUN_OBJ_1(set_copy_obj, set_copy);
  164. static mp_obj_t set_discard(mp_obj_t self_in, mp_obj_t item) {
  165. check_set(self_in);
  166. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  167. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  168. return mp_const_none;
  169. }
  170. static MP_DEFINE_CONST_FUN_OBJ_2(set_discard_obj, set_discard);
  171. static mp_obj_t set_diff_int(size_t n_args, const mp_obj_t *args, bool update) {
  172. mp_obj_t self;
  173. if (update) {
  174. check_set(args[0]);
  175. self = args[0];
  176. } else {
  177. self = set_copy(args[0]);
  178. }
  179. for (size_t i = 1; i < n_args; i++) {
  180. mp_obj_t other = args[i];
  181. if (self == other) {
  182. set_clear(self);
  183. } else {
  184. mp_set_t *self_set = &((mp_obj_set_t *)MP_OBJ_TO_PTR(self))->set;
  185. mp_obj_t iter = mp_getiter(other, NULL);
  186. mp_obj_t next;
  187. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  188. mp_set_lookup(self_set, next, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  189. }
  190. }
  191. }
  192. return self;
  193. }
  194. static mp_obj_t set_diff(size_t n_args, const mp_obj_t *args) {
  195. return set_diff_int(n_args, args, false);
  196. }
  197. static MP_DEFINE_CONST_FUN_OBJ_VAR(set_diff_obj, 1, set_diff);
  198. static mp_obj_t set_diff_update(size_t n_args, const mp_obj_t *args) {
  199. set_diff_int(n_args, args, true);
  200. return mp_const_none;
  201. }
  202. static MP_DEFINE_CONST_FUN_OBJ_VAR(set_diff_update_obj, 1, set_diff_update);
  203. static mp_obj_t set_intersect_int(mp_obj_t self_in, mp_obj_t other, bool update) {
  204. if (update) {
  205. check_set(self_in);
  206. } else {
  207. check_set_or_frozenset(self_in);
  208. }
  209. if (self_in == other) {
  210. return update ? mp_const_none : set_copy(self_in);
  211. }
  212. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  213. mp_obj_set_t *out = MP_OBJ_TO_PTR(mp_obj_new_set(0, NULL));
  214. mp_obj_t iter = mp_getiter(other, NULL);
  215. mp_obj_t next;
  216. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  217. if (mp_set_lookup(&self->set, next, MP_MAP_LOOKUP)) {
  218. set_add(MP_OBJ_FROM_PTR(out), next);
  219. }
  220. }
  221. if (update) {
  222. m_del(mp_obj_t, self->set.table, self->set.alloc);
  223. self->set.alloc = out->set.alloc;
  224. self->set.used = out->set.used;
  225. self->set.table = out->set.table;
  226. }
  227. return update ? mp_const_none : MP_OBJ_FROM_PTR(out);
  228. }
  229. static mp_obj_t set_intersect(mp_obj_t self_in, mp_obj_t other) {
  230. return set_intersect_int(self_in, other, false);
  231. }
  232. static MP_DEFINE_CONST_FUN_OBJ_2(set_intersect_obj, set_intersect);
  233. static mp_obj_t set_intersect_update(mp_obj_t self_in, mp_obj_t other) {
  234. return set_intersect_int(self_in, other, true);
  235. }
  236. static MP_DEFINE_CONST_FUN_OBJ_2(set_intersect_update_obj, set_intersect_update);
  237. static mp_obj_t set_isdisjoint(mp_obj_t self_in, mp_obj_t other) {
  238. check_set_or_frozenset(self_in);
  239. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  240. mp_obj_iter_buf_t iter_buf;
  241. mp_obj_t iter = mp_getiter(other, &iter_buf);
  242. mp_obj_t next;
  243. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  244. if (mp_set_lookup(&self->set, next, MP_MAP_LOOKUP)) {
  245. return mp_const_false;
  246. }
  247. }
  248. return mp_const_true;
  249. }
  250. static MP_DEFINE_CONST_FUN_OBJ_2(set_isdisjoint_obj, set_isdisjoint);
  251. static mp_obj_t set_issubset_internal(mp_obj_t self_in, mp_obj_t other_in, bool proper) {
  252. mp_obj_set_t *self;
  253. bool cleanup_self = false;
  254. if (is_set_or_frozenset(self_in)) {
  255. self = MP_OBJ_TO_PTR(self_in);
  256. } else {
  257. self = MP_OBJ_TO_PTR(set_make_new(&mp_type_set, 1, 0, &self_in));
  258. cleanup_self = true;
  259. }
  260. mp_obj_set_t *other;
  261. bool cleanup_other = false;
  262. if (is_set_or_frozenset(other_in)) {
  263. other = MP_OBJ_TO_PTR(other_in);
  264. } else {
  265. other = MP_OBJ_TO_PTR(set_make_new(&mp_type_set, 1, 0, &other_in));
  266. cleanup_other = true;
  267. }
  268. mp_obj_t out = mp_const_true;
  269. if (proper && self->set.used == other->set.used) {
  270. out = mp_const_false;
  271. } else {
  272. mp_obj_iter_buf_t iter_buf;
  273. mp_obj_t iter = set_getiter(MP_OBJ_FROM_PTR(self), &iter_buf);
  274. mp_obj_t next;
  275. while ((next = set_it_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  276. if (!mp_set_lookup(&other->set, next, MP_MAP_LOOKUP)) {
  277. out = mp_const_false;
  278. break;
  279. }
  280. }
  281. }
  282. // TODO: Should free objects altogether
  283. if (cleanup_self) {
  284. set_clear(MP_OBJ_FROM_PTR(self));
  285. }
  286. if (cleanup_other) {
  287. set_clear(MP_OBJ_FROM_PTR(other));
  288. }
  289. return out;
  290. }
  291. static mp_obj_t set_issubset(mp_obj_t self_in, mp_obj_t other_in) {
  292. return set_issubset_internal(self_in, other_in, false);
  293. }
  294. static MP_DEFINE_CONST_FUN_OBJ_2(set_issubset_obj, set_issubset);
  295. static mp_obj_t set_issubset_proper(mp_obj_t self_in, mp_obj_t other_in) {
  296. return set_issubset_internal(self_in, other_in, true);
  297. }
  298. static mp_obj_t set_issuperset(mp_obj_t self_in, mp_obj_t other_in) {
  299. return set_issubset_internal(other_in, self_in, false);
  300. }
  301. static MP_DEFINE_CONST_FUN_OBJ_2(set_issuperset_obj, set_issuperset);
  302. static mp_obj_t set_issuperset_proper(mp_obj_t self_in, mp_obj_t other_in) {
  303. return set_issubset_internal(other_in, self_in, true);
  304. }
  305. static mp_obj_t set_equal(mp_obj_t self_in, mp_obj_t other_in) {
  306. assert(is_set_or_frozenset(other_in));
  307. check_set_or_frozenset(self_in);
  308. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  309. mp_obj_set_t *other = MP_OBJ_TO_PTR(other_in);
  310. if (self->set.used != other->set.used) {
  311. return mp_const_false;
  312. }
  313. return set_issubset(self_in, other_in);
  314. }
  315. static mp_obj_t set_pop(mp_obj_t self_in) {
  316. check_set(self_in);
  317. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  318. mp_obj_t obj = mp_set_remove_first(&self->set);
  319. if (obj == MP_OBJ_NULL) {
  320. mp_raise_msg(&mp_type_KeyError, MP_ERROR_TEXT("pop from an empty set"));
  321. }
  322. return obj;
  323. }
  324. static MP_DEFINE_CONST_FUN_OBJ_1(set_pop_obj, set_pop);
  325. static mp_obj_t set_remove(mp_obj_t self_in, mp_obj_t item) {
  326. check_set(self_in);
  327. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  328. if (mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_REMOVE_IF_FOUND) == MP_OBJ_NULL) {
  329. mp_raise_type_arg(&mp_type_KeyError, item);
  330. }
  331. return mp_const_none;
  332. }
  333. static MP_DEFINE_CONST_FUN_OBJ_2(set_remove_obj, set_remove);
  334. static mp_obj_t set_symmetric_difference_update(mp_obj_t self_in, mp_obj_t other_in) {
  335. check_set_or_frozenset(self_in); // can be frozenset due to call from set_symmetric_difference
  336. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  337. mp_obj_t iter = mp_getiter(other_in, NULL);
  338. mp_obj_t next;
  339. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  340. mp_set_lookup(&self->set, next, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND_OR_REMOVE_IF_FOUND);
  341. }
  342. return mp_const_none;
  343. }
  344. static MP_DEFINE_CONST_FUN_OBJ_2(set_symmetric_difference_update_obj, set_symmetric_difference_update);
  345. static mp_obj_t set_symmetric_difference(mp_obj_t self_in, mp_obj_t other_in) {
  346. mp_obj_t self_out = set_copy(self_in);
  347. set_symmetric_difference_update(self_out, other_in);
  348. return self_out;
  349. }
  350. static MP_DEFINE_CONST_FUN_OBJ_2(set_symmetric_difference_obj, set_symmetric_difference);
  351. static void set_update_int(mp_obj_set_t *self, mp_obj_t other_in) {
  352. mp_obj_t iter = mp_getiter(other_in, NULL);
  353. mp_obj_t next;
  354. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  355. mp_set_lookup(&self->set, next, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  356. }
  357. }
  358. static mp_obj_t set_update(size_t n_args, const mp_obj_t *args) {
  359. check_set(args[0]);
  360. for (size_t i = 1; i < n_args; i++) {
  361. set_update_int(MP_OBJ_TO_PTR(args[0]), args[i]);
  362. }
  363. return mp_const_none;
  364. }
  365. static MP_DEFINE_CONST_FUN_OBJ_VAR(set_update_obj, 1, set_update);
  366. static mp_obj_t set_union(mp_obj_t self_in, mp_obj_t other_in) {
  367. check_set_or_frozenset(self_in);
  368. mp_obj_t self = set_copy(self_in);
  369. set_update_int(MP_OBJ_TO_PTR(self), other_in);
  370. return self;
  371. }
  372. static MP_DEFINE_CONST_FUN_OBJ_2(set_union_obj, set_union);
  373. static mp_obj_t set_unary_op(mp_unary_op_t op, mp_obj_t self_in) {
  374. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  375. switch (op) {
  376. case MP_UNARY_OP_BOOL:
  377. return mp_obj_new_bool(self->set.used != 0);
  378. case MP_UNARY_OP_LEN:
  379. return MP_OBJ_NEW_SMALL_INT(self->set.used);
  380. #if MICROPY_PY_BUILTINS_FROZENSET
  381. case MP_UNARY_OP_HASH:
  382. if (mp_obj_is_type(self_in, &mp_type_frozenset)) {
  383. // start hash with unique value
  384. mp_int_t hash = (mp_int_t)(uintptr_t)&mp_type_frozenset;
  385. size_t max = self->set.alloc;
  386. mp_set_t *set = &self->set;
  387. for (size_t i = 0; i < max; i++) {
  388. if (mp_set_slot_is_filled(set, i)) {
  389. hash += MP_OBJ_SMALL_INT_VALUE(mp_unary_op(MP_UNARY_OP_HASH, set->table[i]));
  390. }
  391. }
  392. return MP_OBJ_NEW_SMALL_INT(hash);
  393. }
  394. MP_FALLTHROUGH
  395. #endif
  396. default:
  397. return MP_OBJ_NULL; // op not supported
  398. }
  399. }
  400. static mp_obj_t set_binary_op(mp_binary_op_t op, mp_obj_t lhs, mp_obj_t rhs) {
  401. mp_obj_t args[] = {lhs, rhs};
  402. #if MICROPY_PY_BUILTINS_FROZENSET
  403. bool update = mp_obj_is_type(lhs, &mp_type_set);
  404. #else
  405. bool update = true;
  406. #endif
  407. if (op != MP_BINARY_OP_CONTAINS && !is_set_or_frozenset(rhs)) {
  408. // For all ops except containment the RHS must be a set/frozenset
  409. return MP_OBJ_NULL;
  410. }
  411. switch (op) {
  412. case MP_BINARY_OP_OR:
  413. return set_union(lhs, rhs);
  414. case MP_BINARY_OP_XOR:
  415. return set_symmetric_difference(lhs, rhs);
  416. case MP_BINARY_OP_AND:
  417. return set_intersect(lhs, rhs);
  418. case MP_BINARY_OP_SUBTRACT:
  419. return set_diff(2, args);
  420. case MP_BINARY_OP_INPLACE_OR:
  421. if (update) {
  422. set_update(2, args);
  423. return lhs;
  424. } else {
  425. return set_union(lhs, rhs);
  426. }
  427. case MP_BINARY_OP_INPLACE_XOR:
  428. if (update) {
  429. set_symmetric_difference_update(lhs, rhs);
  430. return lhs;
  431. } else {
  432. return set_symmetric_difference(lhs, rhs);
  433. }
  434. case MP_BINARY_OP_INPLACE_AND:
  435. rhs = set_intersect_int(lhs, rhs, update);
  436. if (update) {
  437. return lhs;
  438. } else {
  439. return rhs;
  440. }
  441. case MP_BINARY_OP_INPLACE_SUBTRACT:
  442. return set_diff_int(2, args, update);
  443. case MP_BINARY_OP_LESS:
  444. return set_issubset_proper(lhs, rhs);
  445. case MP_BINARY_OP_MORE:
  446. return set_issuperset_proper(lhs, rhs);
  447. case MP_BINARY_OP_EQUAL:
  448. return set_equal(lhs, rhs);
  449. case MP_BINARY_OP_LESS_EQUAL:
  450. return set_issubset(lhs, rhs);
  451. case MP_BINARY_OP_MORE_EQUAL:
  452. return set_issuperset(lhs, rhs);
  453. case MP_BINARY_OP_CONTAINS: {
  454. mp_obj_set_t *o = MP_OBJ_TO_PTR(lhs);
  455. mp_obj_t elem = mp_set_lookup(&o->set, rhs, MP_MAP_LOOKUP);
  456. return mp_obj_new_bool(elem != MP_OBJ_NULL);
  457. }
  458. default:
  459. return MP_OBJ_NULL; // op not supported
  460. }
  461. }
  462. /******************************************************************************/
  463. /* set constructors & public C API */
  464. static const mp_rom_map_elem_t set_locals_dict_table[] = {
  465. { MP_ROM_QSTR(MP_QSTR_add), MP_ROM_PTR(&set_add_obj) },
  466. { MP_ROM_QSTR(MP_QSTR_clear), MP_ROM_PTR(&set_clear_obj) },
  467. { MP_ROM_QSTR(MP_QSTR_copy), MP_ROM_PTR(&set_copy_obj) },
  468. { MP_ROM_QSTR(MP_QSTR_discard), MP_ROM_PTR(&set_discard_obj) },
  469. { MP_ROM_QSTR(MP_QSTR_difference), MP_ROM_PTR(&set_diff_obj) },
  470. { MP_ROM_QSTR(MP_QSTR_difference_update), MP_ROM_PTR(&set_diff_update_obj) },
  471. { MP_ROM_QSTR(MP_QSTR_intersection), MP_ROM_PTR(&set_intersect_obj) },
  472. { MP_ROM_QSTR(MP_QSTR_intersection_update), MP_ROM_PTR(&set_intersect_update_obj) },
  473. { MP_ROM_QSTR(MP_QSTR_isdisjoint), MP_ROM_PTR(&set_isdisjoint_obj) },
  474. { MP_ROM_QSTR(MP_QSTR_issubset), MP_ROM_PTR(&set_issubset_obj) },
  475. { MP_ROM_QSTR(MP_QSTR_issuperset), MP_ROM_PTR(&set_issuperset_obj) },
  476. { MP_ROM_QSTR(MP_QSTR_pop), MP_ROM_PTR(&set_pop_obj) },
  477. { MP_ROM_QSTR(MP_QSTR_remove), MP_ROM_PTR(&set_remove_obj) },
  478. { MP_ROM_QSTR(MP_QSTR_symmetric_difference), MP_ROM_PTR(&set_symmetric_difference_obj) },
  479. { MP_ROM_QSTR(MP_QSTR_symmetric_difference_update), MP_ROM_PTR(&set_symmetric_difference_update_obj) },
  480. { MP_ROM_QSTR(MP_QSTR_union), MP_ROM_PTR(&set_union_obj) },
  481. { MP_ROM_QSTR(MP_QSTR_update), MP_ROM_PTR(&set_update_obj) },
  482. { MP_ROM_QSTR(MP_QSTR___contains__), MP_ROM_PTR(&mp_op_contains_obj) },
  483. };
  484. static MP_DEFINE_CONST_DICT(set_locals_dict, set_locals_dict_table);
  485. MP_DEFINE_CONST_OBJ_TYPE(
  486. mp_type_set,
  487. MP_QSTR_set,
  488. MP_TYPE_FLAG_ITER_IS_GETITER,
  489. make_new, set_make_new,
  490. print, set_print,
  491. unary_op, set_unary_op,
  492. binary_op, set_binary_op,
  493. iter, set_getiter,
  494. locals_dict, &set_locals_dict
  495. );
  496. #if MICROPY_PY_BUILTINS_FROZENSET
  497. static const mp_rom_map_elem_t frozenset_locals_dict_table[] = {
  498. { MP_ROM_QSTR(MP_QSTR_copy), MP_ROM_PTR(&set_copy_obj) },
  499. { MP_ROM_QSTR(MP_QSTR_difference), MP_ROM_PTR(&set_diff_obj) },
  500. { MP_ROM_QSTR(MP_QSTR_intersection), MP_ROM_PTR(&set_intersect_obj) },
  501. { MP_ROM_QSTR(MP_QSTR_isdisjoint), MP_ROM_PTR(&set_isdisjoint_obj) },
  502. { MP_ROM_QSTR(MP_QSTR_issubset), MP_ROM_PTR(&set_issubset_obj) },
  503. { MP_ROM_QSTR(MP_QSTR_issuperset), MP_ROM_PTR(&set_issuperset_obj) },
  504. { MP_ROM_QSTR(MP_QSTR_symmetric_difference), MP_ROM_PTR(&set_symmetric_difference_obj) },
  505. { MP_ROM_QSTR(MP_QSTR_union), MP_ROM_PTR(&set_union_obj) },
  506. { MP_ROM_QSTR(MP_QSTR___contains__), MP_ROM_PTR(&mp_op_contains_obj) },
  507. };
  508. static MP_DEFINE_CONST_DICT(frozenset_locals_dict, frozenset_locals_dict_table);
  509. MP_DEFINE_CONST_OBJ_TYPE(
  510. mp_type_frozenset,
  511. MP_QSTR_frozenset,
  512. MP_TYPE_FLAG_EQ_CHECKS_OTHER_TYPE | MP_TYPE_FLAG_ITER_IS_GETITER,
  513. make_new, set_make_new,
  514. print, set_print,
  515. unary_op, set_unary_op,
  516. binary_op, set_binary_op,
  517. iter, set_getiter,
  518. locals_dict, &frozenset_locals_dict
  519. );
  520. #endif
  521. mp_obj_t mp_obj_new_set(size_t n_args, mp_obj_t *items) {
  522. mp_obj_set_t *o = mp_obj_malloc(mp_obj_set_t, &mp_type_set);
  523. mp_set_init(&o->set, n_args);
  524. for (size_t i = 0; i < n_args; i++) {
  525. mp_set_lookup(&o->set, items[i], MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  526. }
  527. return MP_OBJ_FROM_PTR(o);
  528. }
  529. void mp_obj_set_store(mp_obj_t self_in, mp_obj_t item) {
  530. mp_check_self(mp_obj_is_type(self_in, &mp_type_set));
  531. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  532. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  533. }
  534. #endif // MICROPY_PY_BUILTINS_SET