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, 4 deletions

diff --git a/py/objstr.c b/py/objstr.c
index db3e0beca..c679003eb 100644
--- a/py/objstr.c
+++ b/py/objstr.c
@@ -185,8 +185,8 @@ static MP_DEFINE_CONST_FUN_OBJ_2(str_join_obj, str_join);
 static MP_DEFINE_CONST_FUN_OBJ_VAR(str_format_obj, 1, str_format);
 
 const mp_obj_type_t str_type = {
-    { &mp_const_type },
-    "str",
+    .base = { &mp_const_type },
+    .name = "str",
     .print = str_print,
     .binary_op = str_binary_op,
     .getiter = str_getiter,
@@ -232,8 +232,8 @@ mp_obj_t str_it_iternext(mp_obj_t self_in) {
 }
 
 static const mp_obj_type_t str_it_type = {
-    { &mp_const_type },
-    "str_iterator",
+    .base = { &mp_const_type },
+    .name = "str_iterator",
     .iternext = str_it_iternext,
     .methods = { { NULL, NULL }, },
 };