2014-05-03 23:27:38 +01:00
|
|
|
/*
|
|
|
|
* This file is part of the Micro Python project, http://micropython.org/
|
|
|
|
*
|
|
|
|
* The MIT License (MIT)
|
|
|
|
*
|
|
|
|
* Copyright (c) 2013, 2014 Damien P. George
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2014-03-26 19:27:58 +00:00
|
|
|
#include <stdlib.h>
|
2013-12-21 18:17:45 +00:00
|
|
|
|
2014-05-02 15:47:01 +01:00
|
|
|
#include "mpconfig.h"
|
2013-12-21 18:17:45 +00:00
|
|
|
#include "nlr.h"
|
|
|
|
#include "misc.h"
|
2014-01-21 21:40:13 +00:00
|
|
|
#include "qstr.h"
|
2013-12-21 18:17:45 +00:00
|
|
|
#include "obj.h"
|
2014-08-12 19:41:18 +01:00
|
|
|
#include "runtime0.h"
|
2014-04-17 18:18:55 +01:00
|
|
|
#include "runtime.h"
|
2013-12-21 18:17:45 +00:00
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
/* range iterator */
|
|
|
|
|
|
|
|
typedef struct _mp_obj_range_it_t {
|
|
|
|
mp_obj_base_t base;
|
|
|
|
// TODO make these values generic objects or something
|
2014-07-03 13:25:24 +01:00
|
|
|
mp_int_t cur;
|
|
|
|
mp_int_t stop;
|
|
|
|
mp_int_t step;
|
2013-12-21 18:17:45 +00:00
|
|
|
} mp_obj_range_it_t;
|
|
|
|
|
2014-02-12 16:15:40 +00:00
|
|
|
STATIC mp_obj_t range_it_iternext(mp_obj_t o_in) {
|
2013-12-21 18:17:45 +00:00
|
|
|
mp_obj_range_it_t *o = o_in;
|
|
|
|
if ((o->step > 0 && o->cur < o->stop) || (o->step < 0 && o->cur > o->stop)) {
|
|
|
|
mp_obj_t o_out = MP_OBJ_NEW_SMALL_INT(o->cur);
|
|
|
|
o->cur += o->step;
|
|
|
|
return o_out;
|
|
|
|
} else {
|
2014-04-17 23:19:36 +01:00
|
|
|
return MP_OBJ_STOP_ITERATION;
|
2013-12-21 18:17:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-02-12 16:15:40 +00:00
|
|
|
STATIC const mp_obj_type_t range_it_type = {
|
2014-02-15 16:10:44 +00:00
|
|
|
{ &mp_type_type },
|
2014-02-15 11:34:50 +00:00
|
|
|
.name = MP_QSTR_iterator,
|
2014-03-30 20:00:12 +01:00
|
|
|
.getiter = mp_identity,
|
2014-01-07 15:58:30 +00:00
|
|
|
.iternext = range_it_iternext,
|
2013-12-21 18:17:45 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
mp_obj_t mp_obj_new_range_iterator(int cur, int stop, int step) {
|
|
|
|
mp_obj_range_it_t *o = m_new_obj(mp_obj_range_it_t);
|
|
|
|
o->base.type = &range_it_type;
|
|
|
|
o->cur = cur;
|
|
|
|
o->stop = stop;
|
|
|
|
o->step = step;
|
|
|
|
return o;
|
|
|
|
}
|
2014-04-17 18:18:55 +01:00
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
/* range */
|
|
|
|
|
|
|
|
typedef struct _mp_obj_range_t {
|
|
|
|
mp_obj_base_t base;
|
|
|
|
// TODO make these values generic objects or something
|
2014-07-03 13:25:24 +01:00
|
|
|
mp_int_t start;
|
|
|
|
mp_int_t stop;
|
|
|
|
mp_int_t step;
|
2014-04-17 18:18:55 +01:00
|
|
|
} mp_obj_range_t;
|
|
|
|
|
2014-08-12 19:41:18 +01:00
|
|
|
STATIC void range_print(void (*print)(void *env, const char *fmt, ...), void *env, mp_obj_t self_in, mp_print_kind_t kind) {
|
|
|
|
mp_obj_range_t *self = self_in;
|
|
|
|
print(env, "range(%d, %d", self->start, self->stop);
|
|
|
|
if (self->step == 1) {
|
|
|
|
print(env, ")");
|
|
|
|
} else {
|
|
|
|
print(env, ", %d)", self->step);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-17 18:18:55 +01:00
|
|
|
STATIC mp_obj_t range_make_new(mp_obj_t type_in, uint n_args, uint n_kw, const mp_obj_t *args) {
|
2014-04-20 00:13:22 +01:00
|
|
|
mp_arg_check_num(n_args, n_kw, 1, 3, false);
|
2014-04-17 18:18:55 +01:00
|
|
|
|
|
|
|
mp_obj_range_t *o = m_new_obj(mp_obj_range_t);
|
|
|
|
o->base.type = &mp_type_range;
|
|
|
|
o->start = 0;
|
|
|
|
o->step = 1;
|
|
|
|
|
|
|
|
if (n_args == 1) {
|
|
|
|
o->stop = mp_obj_get_int(args[0]);
|
|
|
|
} else {
|
|
|
|
o->start = mp_obj_get_int(args[0]);
|
|
|
|
o->stop = mp_obj_get_int(args[1]);
|
|
|
|
if (n_args == 3) {
|
2014-08-12 19:41:18 +01:00
|
|
|
// TODO check step is non-zero
|
2014-04-17 18:18:55 +01:00
|
|
|
o->step = mp_obj_get_int(args[2]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return o;
|
|
|
|
}
|
|
|
|
|
2014-08-12 19:41:18 +01:00
|
|
|
STATIC mp_int_t range_len(mp_obj_range_t *self) {
|
|
|
|
// When computing length, need to take into account step!=1 and step<0.
|
|
|
|
mp_int_t len = self->stop - self->start + self->step;
|
|
|
|
if (self->step > 0) {
|
|
|
|
len -= 1;
|
|
|
|
} else {
|
|
|
|
len += 1;
|
|
|
|
}
|
|
|
|
len = len / self->step;
|
|
|
|
if (len < 0) {
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATIC mp_obj_t range_unary_op(int op, mp_obj_t self_in) {
|
|
|
|
mp_obj_range_t *self = self_in;
|
|
|
|
mp_int_t len = range_len(self);
|
|
|
|
switch (op) {
|
|
|
|
case MP_UNARY_OP_BOOL: return MP_BOOL(len > 0);
|
|
|
|
case MP_UNARY_OP_LEN: return MP_OBJ_NEW_SMALL_INT(len);
|
|
|
|
default: return MP_OBJ_NULL; // op not supported
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
STATIC mp_obj_t range_subscr(mp_obj_t self_in, mp_obj_t index, mp_obj_t value) {
|
|
|
|
if (value == MP_OBJ_SENTINEL) {
|
|
|
|
// load
|
|
|
|
mp_obj_range_t *self = self_in;
|
|
|
|
mp_int_t len = range_len(self);
|
|
|
|
#if MICROPY_PY_BUILTINS_SLICE
|
|
|
|
if (MP_OBJ_IS_TYPE(index, &mp_type_slice)) {
|
|
|
|
mp_bound_slice_t slice;
|
|
|
|
mp_seq_get_fast_slice_indexes(len, index, &slice);
|
|
|
|
mp_obj_range_t *o = m_new_obj(mp_obj_range_t);
|
|
|
|
o->base.type = &mp_type_range;
|
|
|
|
o->start = slice.start;
|
|
|
|
o->stop = slice.stop;
|
|
|
|
o->step = slice.step;
|
|
|
|
return o;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
uint index_val = mp_get_index(self->base.type, len, index, false);
|
|
|
|
return MP_OBJ_NEW_SMALL_INT(self->start + index_val * self->step);
|
|
|
|
} else {
|
|
|
|
return MP_OBJ_NULL; // op not supported
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-17 18:18:55 +01:00
|
|
|
STATIC mp_obj_t range_getiter(mp_obj_t o_in) {
|
|
|
|
mp_obj_range_t *o = o_in;
|
|
|
|
return mp_obj_new_range_iterator(o->start, o->stop, o->step);
|
|
|
|
}
|
|
|
|
|
|
|
|
const mp_obj_type_t mp_type_range = {
|
|
|
|
{ &mp_type_type },
|
|
|
|
.name = MP_QSTR_range,
|
2014-08-12 19:41:18 +01:00
|
|
|
.print = range_print,
|
2014-04-17 18:18:55 +01:00
|
|
|
.make_new = range_make_new,
|
2014-08-12 19:41:18 +01:00
|
|
|
.unary_op = range_unary_op,
|
|
|
|
.subscr = range_subscr,
|
2014-04-17 18:18:55 +01:00
|
|
|
.getiter = range_getiter,
|
|
|
|
};
|