| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383 |
- #include "pocketpy/array2d.h"
- namespace pkpy{
- struct Array2d{
- PK_ALWAYS_PASS_BY_POINTER(Array2d)
- PyObject** data;
- int n_cols;
- int n_rows;
- int numel;
- Array2d(){
- data = nullptr;
- n_cols = 0;
- n_rows = 0;
- numel = 0;
- }
- void init(int n_cols, int n_rows){
- this->n_cols = n_cols;
- this->n_rows = n_rows;
- this->numel = n_cols * n_rows;
- this->data = new PyObject*[numel];
- }
- bool is_valid(int col, int row) const{
- return 0 <= col && col < n_cols && 0 <= row && row < n_rows;
- }
- PyObject* _get(int col, int row){
- return data[row * n_cols + col];
- }
- void _set(int col, int row, PyObject* value){
- data[row * n_cols + col] = value;
- }
- static void _register(VM* vm, PyObject* mod, PyObject* type){
- vm->bind(type, "__new__(cls, *args, **kwargs)", [](VM* vm, ArgsView args){
- Type cls = PK_OBJ_GET(Type, args[0]);
- return vm->heap.gcnew<Array2d>(cls);
- });
- vm->bind(type, "__init__(self, n_cols: int, n_rows: int, default=None)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- int n_cols = CAST(int, args[1]);
- int n_rows = CAST(int, args[2]);
- if(n_cols <= 0 || n_rows <= 0){
- vm->ValueError("n_cols and n_rows must be positive integers");
- }
- self.init(n_cols, n_rows);
- if(vm->py_callable(args[3])){
- for(int i = 0; i < self.numel; i++) self.data[i] = vm->call(args[3]);
- }else{
- for(int i = 0; i < self.numel; i++) self.data[i] = args[3];
- }
- return vm->None;
- });
- PY_READONLY_FIELD(Array2d, "n_cols", n_cols);
- PY_READONLY_FIELD(Array2d, "n_rows", n_rows);
- PY_READONLY_FIELD(Array2d, "width", n_cols);
- PY_READONLY_FIELD(Array2d, "height", n_rows);
- PY_READONLY_FIELD(Array2d, "numel", numel);
- vm->bind(type, "is_valid(self, col: int, row: int)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- int col = CAST(int, args[1]);
- int row = CAST(int, args[2]);
- return VAR(self.is_valid(col, row));
- });
- vm->bind(type, "get(self, col: int, row: int, default=None)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- int col = CAST(int, args[1]);
- int row = CAST(int, args[2]);
- if(!self.is_valid(col, row)) return args[3];
- return self._get(col, row);
- });
- #define HANDLE_SLICE() \
- int start_col, stop_col, step_col; \
- int start_row, stop_row, step_row; \
- vm->parse_int_slice(PK_OBJ_GET(Slice, xy[0]), self.n_cols, start_col, stop_col, step_col); \
- vm->parse_int_slice(PK_OBJ_GET(Slice, xy[1]), self.n_rows, start_row, stop_row, step_row); \
- if(step_col != 1 || step_row != 1) vm->ValueError("slice step must be 1"); \
- int slice_width = stop_col - start_col; \
- int slice_height = stop_row - start_row; \
- if(slice_width <= 0 || slice_height <= 0) vm->ValueError("slice width and height must be positive");
- vm->bind__getitem__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0, PyObject* _1){
- Array2d& self = PK_OBJ_GET(Array2d, _0);
- const Tuple& xy = CAST(Tuple&, _1);
- i64 col, row;
- if(try_cast_int(xy[0], &col) && try_cast_int(xy[1], &row)){
- if(!self.is_valid(col, row)){
- vm->IndexError(_S('(', col, ", ", row, ')', " is not a valid index for array2d(", self.n_cols, ", ", self.n_rows, ')'));
- }
- return self._get(col, row);
- }
- if(is_type(xy[0], VM::tp_slice) && is_type(xy[1], VM::tp_slice)){
- HANDLE_SLICE();
- PyObject* new_array_obj = vm->new_user_object<Array2d>();
- Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
- new_array.init(stop_col - start_col, stop_row - start_row);
- for(int j = start_row; j < stop_row; j++){
- for(int i = start_col; i < stop_col; i++){
- new_array._set(i - start_col, j - start_row, self._get(i, j));
- }
- }
- return new_array_obj;
- }
- vm->TypeError("expected `tuple[int, int]` or `tuple[slice, slice]` as index");
- PK_UNREACHABLE();
- });
- vm->bind__setitem__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0, PyObject* _1, PyObject* _2){
- Array2d& self = PK_OBJ_GET(Array2d, _0);
- const Tuple& xy = CAST(Tuple&, _1);
- i64 col, row;
- if(try_cast_int(xy[0], &col) && try_cast_int(xy[1], &row)){
- if(!self.is_valid(col, row)){
- vm->IndexError(_S('(', col, ", ", row, ')', " is not a valid index for array2d(", self.n_cols, ", ", self.n_rows, ')'));
- }
- self._set(col, row, _2);
- return;
- }
- if(is_type(xy[0], VM::tp_slice) && is_type(xy[1], VM::tp_slice)){
- HANDLE_SLICE();
- bool is_basic_type = false;
- switch(vm->_tp(_2).index){
- case VM::tp_int.index: is_basic_type = true; break;
- case VM::tp_float.index: is_basic_type = true; break;
- case VM::tp_str.index: is_basic_type = true; break;
- case VM::tp_bool.index: is_basic_type = true; break;
- default: is_basic_type = _2 == vm->None;
- }
- if(is_basic_type){
- for(int j = 0; j < slice_height; j++)
- for(int i = 0; i < slice_width; i++)
- self._set(i + start_col, j + start_row, _2);
- return;
- }
- if(!vm->is_user_type<Array2d>(_2)){
- vm->TypeError(_S("expected int/float/str/bool/None or an array2d instance"));
- }
- Array2d& other = PK_OBJ_GET(Array2d, _2);
- if(slice_width != other.n_cols || slice_height != other.n_rows){
- vm->ValueError("array2d size does not match the slice size");
- }
- for(int j = 0; j < slice_height; j++)
- for(int i = 0; i < slice_width; i++)
- self._set(i + start_col, j + start_row, other._get(i, j));
- return;
- }
- vm->TypeError("expected `tuple[int, int]` or `tuple[slice, slice]` as index");
- });
- #undef HANDLE_SLICE
- vm->bind(type, "tolist(self)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- List t(self.n_rows);
- for(int j = 0; j < self.n_rows; j++){
- List row(self.n_cols);
- for(int i = 0; i < self.n_cols; i++) row[i] = self._get(i, j);
- t[j] = VAR(std::move(row));
- }
- return VAR(std::move(t));
- });
- vm->bind__len__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0){
- Array2d& self = PK_OBJ_GET(Array2d, _0);
- return (i64)self.numel;
- });
- vm->bind__repr__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0){
- Array2d& self = PK_OBJ_GET(Array2d, _0);
- return VAR(_S("array2d(", self.n_cols, ", ", self.n_rows, ')'));
- });
- vm->bind(type, "map(self, f)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* f = args[1];
- PyObject* new_array_obj = vm->new_user_object<Array2d>();
- Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
- new_array.init(self.n_cols, self.n_rows);
- for(int i = 0; i < new_array.numel; i++){
- new_array.data[i] = vm->call(f, self.data[i]);
- }
- return new_array_obj;
- });
- vm->bind(type, "copy(self)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* new_array_obj = vm->new_user_object<Array2d>();
- Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
- new_array.init(self.n_cols, self.n_rows);
- for(int i = 0; i < new_array.numel; i++){
- new_array.data[i] = self.data[i];
- }
- return new_array_obj;
- });
- vm->bind(type, "fill_(self, value)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- for(int i = 0; i < self.numel; i++){
- self.data[i] = args[1];
- }
- return vm->None;
- });
- vm->bind(type, "apply_(self, f)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* f = args[1];
- for(int i = 0; i < self.numel; i++){
- self.data[i] = vm->call(f, self.data[i]);
- }
- return vm->None;
- });
- vm->bind(type, "copy_(self, other)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- if(is_type(args[1], VM::tp_list)){
- const List& list = PK_OBJ_GET(List, args[1]);
- if(list.size() != self.numel){
- vm->ValueError("list size must be equal to the number of elements in the array2d");
- }
- for(int i = 0; i < self.numel; i++){
- self.data[i] = list[i];
- }
- return vm->None;
- }
- Array2d& other = CAST(Array2d&, args[1]);
- // if self and other have different sizes, re-initialize self
- if(self.n_cols != other.n_cols || self.n_rows != other.n_rows){
- delete self.data;
- self.init(other.n_cols, other.n_rows);
- }
- for(int i = 0; i < self.numel; i++){
- self.data[i] = other.data[i];
- }
- return vm->None;
- });
- vm->bind__eq__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0, PyObject* _1){
- Array2d& self = PK_OBJ_GET(Array2d, _0);
- if(!vm->is_user_type<Array2d>(_1)) return vm->NotImplemented;
- Array2d& other = PK_OBJ_GET(Array2d, _1);
- if(self.n_cols != other.n_cols || self.n_rows != other.n_rows) return vm->False;
- for(int i = 0; i < self.numel; i++){
- if(vm->py_ne(self.data[i], other.data[i])) return vm->False;
- }
- return vm->True;
- });
- vm->bind(type, "count_neighbors(self, value, neighborhood='Moore') -> array2d[int]", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* new_array_obj = vm->new_user_object<Array2d>();
- Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
- new_array.init(self.n_cols, self.n_rows);
- PyObject* value = args[1];
- const Str& neighborhood = CAST(Str&, args[2]);
- if(neighborhood == "Moore"){
- for(int j = 0; j < new_array.n_rows; j++){
- for(int i = 0; i < new_array.n_cols; i++){
- int count = 0;
- count += self.is_valid(i-1, j-1) && vm->py_eq(self._get(i-1, j-1), value);
- count += self.is_valid(i, j-1) && vm->py_eq(self._get(i, j-1), value);
- count += self.is_valid(i+1, j-1) && vm->py_eq(self._get(i+1, j-1), value);
- count += self.is_valid(i-1, j) && vm->py_eq(self._get(i-1, j), value);
- count += self.is_valid(i+1, j) && vm->py_eq(self._get(i+1, j), value);
- count += self.is_valid(i-1, j+1) && vm->py_eq(self._get(i-1, j+1), value);
- count += self.is_valid(i, j+1) && vm->py_eq(self._get(i, j+1), value);
- count += self.is_valid(i+1, j+1) && vm->py_eq(self._get(i+1, j+1), value);
- new_array._set(i, j, VAR(count));
- }
- }
- }else if(neighborhood == "von Neumann"){
- for(int j = 0; j < new_array.n_rows; j++){
- for(int i = 0; i < new_array.n_cols; i++){
- int count = 0;
- count += self.is_valid(i, j-1) && vm->py_eq(self._get(i, j-1), value);
- count += self.is_valid(i-1, j) && vm->py_eq(self._get(i-1, j), value);
- count += self.is_valid(i+1, j) && vm->py_eq(self._get(i+1, j), value);
- count += self.is_valid(i, j+1) && vm->py_eq(self._get(i, j+1), value);
- new_array._set(i, j, VAR(count));
- }
- }
- }else{
- vm->ValueError("neighborhood must be 'Moore' or 'von Neumann'");
- }
- return new_array_obj;
- });
- vm->bind(type, "count(self, value) -> int", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* value = args[1];
- int count = 0;
- for(int i = 0; i < self.numel; i++) count += vm->py_eq(self.data[i], value);
- return VAR(count);
- });
- vm->bind(type, "find_bounding_rect(self, value)", [](VM* vm, ArgsView args){
- Array2d& self = PK_OBJ_GET(Array2d, args[0]);
- PyObject* value = args[1];
- int left = self.n_cols;
- int top = self.n_rows;
- int right = 0;
- int bottom = 0;
- for(int j = 0; j < self.n_rows; j++){
- for(int i = 0; i < self.n_cols; i++){
- if(vm->py_eq(self._get(i, j), value)){
- left = std::min(left, i);
- top = std::min(top, j);
- right = std::max(right, i);
- bottom = std::max(bottom, j);
- }
- }
- }
- int width = right - left + 1;
- int height = bottom - top + 1;
- if(width <= 0 || height <= 0) return vm->None;
- return VAR(Tuple(VAR(left), VAR(top), VAR(width), VAR(height)));
- });
- }
- void _gc_mark() const{
- for(int i = 0; i < numel; i++) PK_OBJ_MARK(data[i]);
- }
- ~Array2d(){
- delete[] data;
- }
- };
- struct Array2dIter{
- PK_ALWAYS_PASS_BY_POINTER(Array2dIter)
- PyObject* ref;
- int i;
- Array2dIter(PyObject* ref) : ref(ref), i(0) {}
- void _gc_mark() const{ PK_OBJ_MARK(ref); }
- static void _register(VM* vm, PyObject* mod, PyObject* type){
- vm->_all_types[PK_OBJ_GET(Type, type)].subclass_enabled = false;
- vm->bind_notimplemented_constructor<Array2dIter>(type);
- vm->bind__iter__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0) { return _0; });
- vm->bind__next__(PK_OBJ_GET(Type, type), [](VM* vm, PyObject* _0) -> unsigned{
- Array2dIter& self = PK_OBJ_GET(Array2dIter, _0);
- Array2d& a = PK_OBJ_GET(Array2d, self.ref);
- if(self.i == a.numel) return 0;
- std::div_t res = std::div(self.i, a.n_cols);
- vm->s_data.push(VAR(res.rem));
- vm->s_data.push(VAR(res.quot));
- vm->s_data.push(a.data[self.i++]);
- return 3;
- });
- }
- };
- void add_module_array2d(VM* vm){
- PyObject* mod = vm->new_module("array2d");
- vm->register_user_class<Array2d>(mod, "array2d", true);
- vm->register_user_class<Array2dIter>(mod, "_array2d_iter");
- vm->bind__iter__(vm->_tp_user<Array2d>(), [](VM* vm, PyObject* _0){
- return vm->new_user_object<Array2dIter>(_0);
- });
- }
- } // namespace pkpy
|