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, 5 insertions, 11 deletions

diff --git a/py/objslice.c b/py/objslice.c
index da69b92af2..148d875010 100644
--- a/py/objslice.c
+++ b/py/objslice.c
@@ -21,15 +21,9 @@ void ellipsis_print(void (*print)(void *env, const char *fmt, ...), void *env, m
 }
 
 const mp_obj_type_t ellipsis_type = {
-    { &mp_const_type },
-    "ellipsis",
-    ellipsis_print, // print
-    NULL, // make_new
-    NULL, // call_n
-    NULL, // unary_op
-    NULL, // binary_op
-    NULL, // getiter
-    NULL, // iternext
+    .base = { &mp_const_type },
+    .name = "ellipsis",
+    .print = ellipsis_print,
     .methods = {{NULL, NULL},},
 };
 
@@ -55,8 +49,8 @@ void slice_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_o
 }
 
 const mp_obj_type_t slice_type = {
-    { &mp_const_type },
-    "slice",
+    .base = { &mp_const_type },
+    .name = "slice",
     .print = slice_print,
     .methods = { { NULL, NULL }, },
 };