This implements a better (more python-conformant) list.sort.

It's not really about that, though; it's about me figuring out a sane
way forward for keyword-argument functions (and function
metadata). But it's useful as is, and shouldn't break any existing
code, so here you have it; I'm going to park it in my mind for a bit
while sorting out the rest of the dict branch.

1 files changed, 4 insertions, 9 deletions

diff --git a/py/objset.c b/py/objset.c
index dd9a4d1e1d..159036a45e 100644
--- a/py/objset.c
+++ b/py/objset.c
@@ -55,15 +55,10 @@ static mp_obj_t set_make_new(mp_obj_t type_in, int n_args, const mp_obj_t *args)
 }
 
 const mp_obj_type_t set_type = {
-    { &mp_const_type },
-    "set",
-    set_print, // print
-    set_make_new, // make_new
-    NULL, // call_n
-    NULL, // unary_op
-    NULL, // binary_op
-    NULL, // getiter
-    NULL, // iternext
+    .base = { &mp_const_type },
+    .name = "set",
+    .print = set_print,
+    .make_new = set_make_new,
     .methods = { { NULL, NULL }, },
 };