Merge branch 'master' of github.com:dpgeorge/micropython
This commit is contained in:
commit
8b1b59c28e
@ -5,7 +5,7 @@
|
|||||||
* is not known until the end of pass 1.
|
* is not known until the end of pass 1.
|
||||||
* As a consequence, we don't know the maximum stack size until the end of pass 2.
|
* As a consequence, we don't know the maximum stack size until the end of pass 2.
|
||||||
* This is problematic for some emitters (x64) since they need to know the maximum
|
* This is problematic for some emitters (x64) since they need to know the maximum
|
||||||
* stack size to compile the entry to the function, and this effects code size.
|
* stack size to compile the entry to the function, and this affects code size.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
typedef enum {
|
typedef enum {
|
||||||
|
16
py/objlist.c
16
py/objlist.c
@ -235,6 +235,20 @@ static mp_obj_t list_remove(mp_obj_t self_in, mp_obj_t value) {
|
|||||||
return mp_const_none;
|
return mp_const_none;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static mp_obj_t list_reverse(mp_obj_t self_in) {
|
||||||
|
assert(MP_OBJ_IS_TYPE(self_in, &list_type));
|
||||||
|
mp_obj_list_t *self = self_in;
|
||||||
|
|
||||||
|
int len = self->len;
|
||||||
|
for (int i = 0; i < len/2; i++) {
|
||||||
|
mp_obj_t *a = self->items[i];
|
||||||
|
self->items[i] = self->items[len-i-1];
|
||||||
|
self->items[len-i-1] = a;
|
||||||
|
}
|
||||||
|
|
||||||
|
return mp_const_none;
|
||||||
|
}
|
||||||
|
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_2(list_append_obj, mp_obj_list_append);
|
static MP_DEFINE_CONST_FUN_OBJ_2(list_append_obj, mp_obj_list_append);
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_1(list_clear_obj, list_clear);
|
static MP_DEFINE_CONST_FUN_OBJ_1(list_clear_obj, list_clear);
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_1(list_copy_obj, list_copy);
|
static MP_DEFINE_CONST_FUN_OBJ_1(list_copy_obj, list_copy);
|
||||||
@ -243,6 +257,7 @@ static MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(list_index_obj, 2, 4, list_index);
|
|||||||
static MP_DEFINE_CONST_FUN_OBJ_3(list_insert_obj, list_insert);
|
static MP_DEFINE_CONST_FUN_OBJ_3(list_insert_obj, list_insert);
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(list_pop_obj, 1, 2, list_pop);
|
static MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(list_pop_obj, 1, 2, list_pop);
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_2(list_remove_obj, list_remove);
|
static MP_DEFINE_CONST_FUN_OBJ_2(list_remove_obj, list_remove);
|
||||||
|
static MP_DEFINE_CONST_FUN_OBJ_1(list_reverse_obj, list_reverse);
|
||||||
static MP_DEFINE_CONST_FUN_OBJ_2(list_sort_obj, list_sort);
|
static MP_DEFINE_CONST_FUN_OBJ_2(list_sort_obj, list_sort);
|
||||||
|
|
||||||
const mp_obj_type_t list_type = {
|
const mp_obj_type_t list_type = {
|
||||||
@ -262,6 +277,7 @@ const mp_obj_type_t list_type = {
|
|||||||
{ "insert", &list_insert_obj },
|
{ "insert", &list_insert_obj },
|
||||||
{ "pop", &list_pop_obj },
|
{ "pop", &list_pop_obj },
|
||||||
{ "remove", &list_remove_obj },
|
{ "remove", &list_remove_obj },
|
||||||
|
{ "reverse", &list_reverse_obj },
|
||||||
{ "sort", &list_sort_obj },
|
{ "sort", &list_sort_obj },
|
||||||
{ NULL, NULL }, // end-of-list sentinel
|
{ NULL, NULL }, // end-of-list sentinel
|
||||||
},
|
},
|
||||||
|
2
py/vm.c
2
py/vm.c
@ -106,7 +106,7 @@ bool mp_execute_byte_code_2(const byte **ip_in_out, mp_obj_t *fastn, mp_obj_t **
|
|||||||
case MP_BC_LOAD_CONST_SMALL_INT:
|
case MP_BC_LOAD_CONST_SMALL_INT:
|
||||||
unum = (ip[0] | (ip[1] << 8) | (ip[2] << 16)) - 0x800000;
|
unum = (ip[0] | (ip[1] << 8) | (ip[2] << 16)) - 0x800000;
|
||||||
ip += 3;
|
ip += 3;
|
||||||
PUSH((mp_obj_t)(unum << 1 | 1));
|
PUSH(MP_OBJ_NEW_SMALL_INT(unum));
|
||||||
break;
|
break;
|
||||||
|
|
||||||
case MP_BC_LOAD_CONST_DEC:
|
case MP_BC_LOAD_CONST_DEC:
|
||||||
|
5
tests/basics/tests/list_reverse.py
Normal file
5
tests/basics/tests/list_reverse.py
Normal file
@ -0,0 +1,5 @@
|
|||||||
|
a = []
|
||||||
|
for i in range(100):
|
||||||
|
a.append(i)
|
||||||
|
a.reverse()
|
||||||
|
print(a)
|
Loading…
x
Reference in New Issue
Block a user