objset.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
  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 mp_obj_t set_it_iternext(mp_obj_t self_in);
  43. STATIC bool is_set_or_frozenset(mp_obj_t o) {
  44. return MP_OBJ_IS_TYPE(o, &mp_type_set)
  45. #if MICROPY_PY_BUILTINS_FROZENSET
  46. || MP_OBJ_IS_TYPE(o, &mp_type_frozenset)
  47. #endif
  48. ;
  49. }
  50. // This macro is shorthand for mp_check_self to verify the argument is a set.
  51. #define check_set(o) mp_check_self(MP_OBJ_IS_TYPE(o, &mp_type_set))
  52. // This macro is shorthand for mp_check_self to verify the argument is a
  53. // set or frozenset for methods that operate on both of these types.
  54. #define check_set_or_frozenset(o) mp_check_self(is_set_or_frozenset(o))
  55. STATIC void set_print(const mp_print_t *print, mp_obj_t self_in, mp_print_kind_t kind) {
  56. (void)kind;
  57. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  58. #if MICROPY_PY_BUILTINS_FROZENSET
  59. bool is_frozen = MP_OBJ_IS_TYPE(self_in, &mp_type_frozenset);
  60. #endif
  61. if (self->set.used == 0) {
  62. #if MICROPY_PY_BUILTINS_FROZENSET
  63. if (is_frozen) {
  64. mp_print_str(print, "frozen");
  65. }
  66. #endif
  67. mp_print_str(print, "set()");
  68. return;
  69. }
  70. bool first = true;
  71. #if MICROPY_PY_BUILTINS_FROZENSET
  72. if (is_frozen) {
  73. mp_print_str(print, "frozenset(");
  74. }
  75. #endif
  76. mp_print_str(print, "{");
  77. for (size_t i = 0; i < self->set.alloc; i++) {
  78. if (MP_SET_SLOT_IS_FILLED(&self->set, i)) {
  79. if (!first) {
  80. mp_print_str(print, ", ");
  81. }
  82. first = false;
  83. mp_obj_print_helper(print, self->set.table[i], PRINT_REPR);
  84. }
  85. }
  86. mp_print_str(print, "}");
  87. #if MICROPY_PY_BUILTINS_FROZENSET
  88. if (is_frozen) {
  89. mp_print_str(print, ")");
  90. }
  91. #endif
  92. }
  93. 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) {
  94. mp_arg_check_num(n_args, n_kw, 0, 1, false);
  95. switch (n_args) {
  96. case 0: {
  97. // create a new, empty set
  98. mp_obj_set_t *set = MP_OBJ_TO_PTR(mp_obj_new_set(0, NULL));
  99. // set actual set/frozenset type
  100. set->base.type = type;
  101. return MP_OBJ_FROM_PTR(set);
  102. }
  103. case 1:
  104. default: { // can only be 0 or 1 arg
  105. // 1 argument, an iterable from which we make a new set
  106. mp_obj_t set = mp_obj_new_set(0, NULL);
  107. mp_obj_t iterable = mp_getiter(args[0], NULL);
  108. mp_obj_t item;
  109. while ((item = mp_iternext(iterable)) != MP_OBJ_STOP_ITERATION) {
  110. mp_obj_set_store(set, item);
  111. }
  112. // Set actual set/frozenset type
  113. ((mp_obj_set_t*)MP_OBJ_TO_PTR(set))->base.type = type;
  114. return set;
  115. }
  116. }
  117. }
  118. STATIC mp_obj_t set_it_iternext(mp_obj_t self_in) {
  119. mp_obj_set_it_t *self = MP_OBJ_TO_PTR(self_in);
  120. size_t max = self->set->set.alloc;
  121. mp_set_t *set = &self->set->set;
  122. for (size_t i = self->cur; i < max; i++) {
  123. if (MP_SET_SLOT_IS_FILLED(set, i)) {
  124. self->cur = i + 1;
  125. return set->table[i];
  126. }
  127. }
  128. return MP_OBJ_STOP_ITERATION;
  129. }
  130. STATIC mp_obj_t set_getiter(mp_obj_t set_in, mp_obj_iter_buf_t *iter_buf) {
  131. assert(sizeof(mp_obj_set_it_t) <= sizeof(mp_obj_iter_buf_t));
  132. mp_obj_set_it_t *o = (mp_obj_set_it_t*)iter_buf;
  133. o->base.type = &mp_type_polymorph_iter;
  134. o->iternext = set_it_iternext;
  135. o->set = (mp_obj_set_t *)MP_OBJ_TO_PTR(set_in);
  136. o->cur = 0;
  137. return MP_OBJ_FROM_PTR(o);
  138. }
  139. /******************************************************************************/
  140. /* set methods */
  141. STATIC mp_obj_t set_add(mp_obj_t self_in, mp_obj_t item) {
  142. check_set(self_in);
  143. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  144. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  145. return mp_const_none;
  146. }
  147. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_add_obj, set_add);
  148. STATIC mp_obj_t set_clear(mp_obj_t self_in) {
  149. check_set(self_in);
  150. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  151. mp_set_clear(&self->set);
  152. return mp_const_none;
  153. }
  154. STATIC MP_DEFINE_CONST_FUN_OBJ_1(set_clear_obj, set_clear);
  155. STATIC mp_obj_t set_copy(mp_obj_t self_in) {
  156. check_set_or_frozenset(self_in);
  157. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  158. mp_obj_set_t *other = m_new_obj(mp_obj_set_t);
  159. other->base.type = self->base.type;
  160. mp_set_init(&other->set, self->set.alloc);
  161. other->set.used = self->set.used;
  162. memcpy(other->set.table, self->set.table, self->set.alloc * sizeof(mp_obj_t));
  163. return MP_OBJ_FROM_PTR(other);
  164. }
  165. STATIC MP_DEFINE_CONST_FUN_OBJ_1(set_copy_obj, set_copy);
  166. STATIC mp_obj_t set_discard(mp_obj_t self_in, mp_obj_t item) {
  167. check_set(self_in);
  168. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  169. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  170. return mp_const_none;
  171. }
  172. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_discard_obj, set_discard);
  173. STATIC mp_obj_t set_diff_int(size_t n_args, const mp_obj_t *args, bool update) {
  174. mp_obj_t self;
  175. if (update) {
  176. check_set(args[0]);
  177. self = args[0];
  178. } else {
  179. self = set_copy(args[0]);
  180. }
  181. for (size_t i = 1; i < n_args; i++) {
  182. mp_obj_t other = args[i];
  183. if (self == other) {
  184. set_clear(self);
  185. } else {
  186. mp_set_t *self_set = &((mp_obj_set_t*)MP_OBJ_TO_PTR(self))->set;
  187. mp_obj_t iter = mp_getiter(other, NULL);
  188. mp_obj_t next;
  189. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  190. mp_set_lookup(self_set, next, MP_MAP_LOOKUP_REMOVE_IF_FOUND);
  191. }
  192. }
  193. }
  194. return self;
  195. }
  196. STATIC mp_obj_t set_diff(size_t n_args, const mp_obj_t *args) {
  197. return set_diff_int(n_args, args, false);
  198. }
  199. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR(set_diff_obj, 1, set_diff);
  200. STATIC mp_obj_t set_diff_update(size_t n_args, const mp_obj_t *args) {
  201. set_diff_int(n_args, args, true);
  202. return mp_const_none;
  203. }
  204. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR(set_diff_update_obj, 1, set_diff_update);
  205. STATIC mp_obj_t set_intersect_int(mp_obj_t self_in, mp_obj_t other, bool update) {
  206. if (update) {
  207. check_set(self_in);
  208. } else {
  209. check_set_or_frozenset(self_in);
  210. }
  211. if (self_in == other) {
  212. return update ? mp_const_none : set_copy(self_in);
  213. }
  214. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  215. mp_obj_set_t *out = MP_OBJ_TO_PTR(mp_obj_new_set(0, NULL));
  216. mp_obj_t iter = mp_getiter(other, NULL);
  217. mp_obj_t next;
  218. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  219. if (mp_set_lookup(&self->set, next, MP_MAP_LOOKUP)) {
  220. set_add(MP_OBJ_FROM_PTR(out), next);
  221. }
  222. }
  223. if (update) {
  224. m_del(mp_obj_t, self->set.table, self->set.alloc);
  225. self->set.alloc = out->set.alloc;
  226. self->set.used = out->set.used;
  227. self->set.table = out->set.table;
  228. }
  229. return update ? mp_const_none : MP_OBJ_FROM_PTR(out);
  230. }
  231. STATIC mp_obj_t set_intersect(mp_obj_t self_in, mp_obj_t other) {
  232. return set_intersect_int(self_in, other, false);
  233. }
  234. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_intersect_obj, set_intersect);
  235. STATIC mp_obj_t set_intersect_update(mp_obj_t self_in, mp_obj_t other) {
  236. return set_intersect_int(self_in, other, true);
  237. }
  238. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_intersect_update_obj, set_intersect_update);
  239. STATIC mp_obj_t set_isdisjoint(mp_obj_t self_in, mp_obj_t other) {
  240. check_set_or_frozenset(self_in);
  241. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  242. mp_obj_iter_buf_t iter_buf;
  243. mp_obj_t iter = mp_getiter(other, &iter_buf);
  244. mp_obj_t next;
  245. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  246. if (mp_set_lookup(&self->set, next, MP_MAP_LOOKUP)) {
  247. return mp_const_false;
  248. }
  249. }
  250. return mp_const_true;
  251. }
  252. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_isdisjoint_obj, set_isdisjoint);
  253. STATIC mp_obj_t set_issubset_internal(mp_obj_t self_in, mp_obj_t other_in, bool proper) {
  254. mp_obj_set_t *self;
  255. bool cleanup_self = false;
  256. if (is_set_or_frozenset(self_in)) {
  257. self = MP_OBJ_TO_PTR(self_in);
  258. } else {
  259. self = MP_OBJ_TO_PTR(set_make_new(&mp_type_set, 1, 0, &self_in));
  260. cleanup_self = true;
  261. }
  262. mp_obj_set_t *other;
  263. bool cleanup_other = false;
  264. if (is_set_or_frozenset(other_in)) {
  265. other = MP_OBJ_TO_PTR(other_in);
  266. } else {
  267. other = MP_OBJ_TO_PTR(set_make_new(&mp_type_set, 1, 0, &other_in));
  268. cleanup_other = true;
  269. }
  270. mp_obj_t out = mp_const_true;
  271. if (proper && self->set.used == other->set.used) {
  272. out = mp_const_false;
  273. } else {
  274. mp_obj_iter_buf_t iter_buf;
  275. mp_obj_t iter = set_getiter(MP_OBJ_FROM_PTR(self), &iter_buf);
  276. mp_obj_t next;
  277. while ((next = set_it_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  278. if (!mp_set_lookup(&other->set, next, MP_MAP_LOOKUP)) {
  279. out = mp_const_false;
  280. break;
  281. }
  282. }
  283. }
  284. // TODO: Should free objects altogether
  285. if (cleanup_self) {
  286. set_clear(MP_OBJ_FROM_PTR(self));
  287. }
  288. if (cleanup_other) {
  289. set_clear(MP_OBJ_FROM_PTR(other));
  290. }
  291. return out;
  292. }
  293. STATIC mp_obj_t set_issubset(mp_obj_t self_in, mp_obj_t other_in) {
  294. return set_issubset_internal(self_in, other_in, false);
  295. }
  296. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_issubset_obj, set_issubset);
  297. STATIC mp_obj_t set_issubset_proper(mp_obj_t self_in, mp_obj_t other_in) {
  298. return set_issubset_internal(self_in, other_in, true);
  299. }
  300. STATIC mp_obj_t set_issuperset(mp_obj_t self_in, mp_obj_t other_in) {
  301. return set_issubset_internal(other_in, self_in, false);
  302. }
  303. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_issuperset_obj, set_issuperset);
  304. STATIC mp_obj_t set_issuperset_proper(mp_obj_t self_in, mp_obj_t other_in) {
  305. return set_issubset_internal(other_in, self_in, true);
  306. }
  307. STATIC mp_obj_t set_equal(mp_obj_t self_in, mp_obj_t other_in) {
  308. check_set_or_frozenset(self_in);
  309. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  310. if (!is_set_or_frozenset(other_in)) {
  311. return mp_const_false;
  312. }
  313. mp_obj_set_t *other = MP_OBJ_TO_PTR(other_in);
  314. if (self->set.used != other->set.used) {
  315. return mp_const_false;
  316. }
  317. return set_issubset(self_in, other_in);
  318. }
  319. STATIC mp_obj_t set_pop(mp_obj_t self_in) {
  320. check_set(self_in);
  321. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  322. mp_obj_t obj = mp_set_remove_first(&self->set);
  323. if (obj == MP_OBJ_NULL) {
  324. mp_raise_msg(&mp_type_KeyError, "pop from an empty set");
  325. }
  326. return obj;
  327. }
  328. STATIC MP_DEFINE_CONST_FUN_OBJ_1(set_pop_obj, set_pop);
  329. STATIC mp_obj_t set_remove(mp_obj_t self_in, mp_obj_t item) {
  330. check_set(self_in);
  331. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  332. if (mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_REMOVE_IF_FOUND) == MP_OBJ_NULL) {
  333. nlr_raise(mp_obj_new_exception_arg1(&mp_type_KeyError, item));
  334. }
  335. return mp_const_none;
  336. }
  337. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_remove_obj, set_remove);
  338. STATIC mp_obj_t set_symmetric_difference_update(mp_obj_t self_in, mp_obj_t other_in) {
  339. check_set_or_frozenset(self_in); // can be frozenset due to call from set_symmetric_difference
  340. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  341. mp_obj_t iter = mp_getiter(other_in, NULL);
  342. mp_obj_t next;
  343. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  344. mp_set_lookup(&self->set, next, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND_OR_REMOVE_IF_FOUND);
  345. }
  346. return mp_const_none;
  347. }
  348. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_symmetric_difference_update_obj, set_symmetric_difference_update);
  349. STATIC mp_obj_t set_symmetric_difference(mp_obj_t self_in, mp_obj_t other_in) {
  350. mp_obj_t self_out = set_copy(self_in);
  351. set_symmetric_difference_update(self_out, other_in);
  352. return self_out;
  353. }
  354. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_symmetric_difference_obj, set_symmetric_difference);
  355. STATIC void set_update_int(mp_obj_set_t *self, mp_obj_t other_in) {
  356. mp_obj_t iter = mp_getiter(other_in, NULL);
  357. mp_obj_t next;
  358. while ((next = mp_iternext(iter)) != MP_OBJ_STOP_ITERATION) {
  359. mp_set_lookup(&self->set, next, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  360. }
  361. }
  362. STATIC mp_obj_t set_update(size_t n_args, const mp_obj_t *args) {
  363. check_set(args[0]);
  364. for (size_t i = 1; i < n_args; i++) {
  365. set_update_int(MP_OBJ_TO_PTR(args[0]), args[i]);
  366. }
  367. return mp_const_none;
  368. }
  369. STATIC MP_DEFINE_CONST_FUN_OBJ_VAR(set_update_obj, 1, set_update);
  370. STATIC mp_obj_t set_union(mp_obj_t self_in, mp_obj_t other_in) {
  371. check_set_or_frozenset(self_in);
  372. mp_obj_t self = set_copy(self_in);
  373. set_update_int(MP_OBJ_TO_PTR(self), other_in);
  374. return self;
  375. }
  376. STATIC MP_DEFINE_CONST_FUN_OBJ_2(set_union_obj, set_union);
  377. STATIC mp_obj_t set_unary_op(mp_unary_op_t op, mp_obj_t self_in) {
  378. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  379. switch (op) {
  380. case MP_UNARY_OP_BOOL: return mp_obj_new_bool(self->set.used != 0);
  381. case MP_UNARY_OP_LEN: return MP_OBJ_NEW_SMALL_INT(self->set.used);
  382. #if MICROPY_PY_BUILTINS_FROZENSET
  383. case MP_UNARY_OP_HASH:
  384. if (MP_OBJ_IS_TYPE(self_in, &mp_type_frozenset)) {
  385. // start hash with unique value
  386. mp_int_t hash = (mp_int_t)(uintptr_t)&mp_type_frozenset;
  387. size_t max = self->set.alloc;
  388. mp_set_t *set = &self->set;
  389. for (size_t i = 0; i < max; i++) {
  390. if (MP_SET_SLOT_IS_FILLED(set, i)) {
  391. hash += MP_OBJ_SMALL_INT_VALUE(mp_unary_op(MP_UNARY_OP_HASH, set->table[i]));
  392. }
  393. }
  394. return MP_OBJ_NEW_SMALL_INT(hash);
  395. }
  396. #endif
  397. default: 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_IN && !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_IN: {
  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. const mp_obj_type_t mp_type_set = {
  486. { &mp_type_type },
  487. .name = MP_QSTR_set,
  488. .print = set_print,
  489. .make_new = set_make_new,
  490. .unary_op = set_unary_op,
  491. .binary_op = set_binary_op,
  492. .getiter = set_getiter,
  493. .locals_dict = (mp_obj_dict_t*)&set_locals_dict,
  494. };
  495. #if MICROPY_PY_BUILTINS_FROZENSET
  496. STATIC const mp_rom_map_elem_t frozenset_locals_dict_table[] = {
  497. { MP_ROM_QSTR(MP_QSTR_copy), MP_ROM_PTR(&set_copy_obj) },
  498. { MP_ROM_QSTR(MP_QSTR_difference), MP_ROM_PTR(&set_diff_obj) },
  499. { MP_ROM_QSTR(MP_QSTR_intersection), MP_ROM_PTR(&set_intersect_obj) },
  500. { MP_ROM_QSTR(MP_QSTR_isdisjoint), MP_ROM_PTR(&set_isdisjoint_obj) },
  501. { MP_ROM_QSTR(MP_QSTR_issubset), MP_ROM_PTR(&set_issubset_obj) },
  502. { MP_ROM_QSTR(MP_QSTR_issuperset), MP_ROM_PTR(&set_issuperset_obj) },
  503. { MP_ROM_QSTR(MP_QSTR_symmetric_difference), MP_ROM_PTR(&set_symmetric_difference_obj) },
  504. { MP_ROM_QSTR(MP_QSTR_union), MP_ROM_PTR(&set_union_obj) },
  505. { MP_ROM_QSTR(MP_QSTR___contains__), MP_ROM_PTR(&mp_op_contains_obj) },
  506. };
  507. STATIC MP_DEFINE_CONST_DICT(frozenset_locals_dict, frozenset_locals_dict_table);
  508. const mp_obj_type_t mp_type_frozenset = {
  509. { &mp_type_type },
  510. .name = MP_QSTR_frozenset,
  511. .print = set_print,
  512. .make_new = set_make_new,
  513. .unary_op = set_unary_op,
  514. .binary_op = set_binary_op,
  515. .getiter = set_getiter,
  516. .locals_dict = (mp_obj_dict_t*)&frozenset_locals_dict,
  517. };
  518. #endif
  519. mp_obj_t mp_obj_new_set(size_t n_args, mp_obj_t *items) {
  520. mp_obj_set_t *o = m_new_obj(mp_obj_set_t);
  521. o->base.type = &mp_type_set;
  522. mp_set_init(&o->set, n_args);
  523. for (size_t i = 0; i < n_args; i++) {
  524. mp_set_lookup(&o->set, items[i], MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  525. }
  526. return MP_OBJ_FROM_PTR(o);
  527. }
  528. void mp_obj_set_store(mp_obj_t self_in, mp_obj_t item) {
  529. mp_check_self(MP_OBJ_IS_TYPE(self_in, &mp_type_set));
  530. mp_obj_set_t *self = MP_OBJ_TO_PTR(self_in);
  531. mp_set_lookup(&self->set, item, MP_MAP_LOOKUP_ADD_IF_NOT_FOUND);
  532. }
  533. #endif // MICROPY_PY_BUILTINS_SET