array2d.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409
  1. #include "pocketpy/modules/array2d.hpp"
  2. #include "pocketpy/interpreter/bindings.hpp"
  3. namespace pkpy {
  4. struct Array2d {
  5. PK_ALWAYS_PASS_BY_POINTER(Array2d)
  6. PyVar* data;
  7. int n_cols;
  8. int n_rows;
  9. int numel;
  10. Array2d() {
  11. data = nullptr;
  12. n_cols = 0;
  13. n_rows = 0;
  14. numel = 0;
  15. }
  16. void init(int n_cols, int n_rows) {
  17. this->n_cols = n_cols;
  18. this->n_rows = n_rows;
  19. this->numel = n_cols * n_rows;
  20. this->data = new PyVar[numel];
  21. }
  22. bool is_valid(int col, int row) const { return 0 <= col && col < n_cols && 0 <= row && row < n_rows; }
  23. void check_valid(VM* vm, int col, int row) const {
  24. if(is_valid(col, row)) return;
  25. vm->IndexError(_S('(', col, ", ", row, ')', " is not a valid index for array2d(", n_cols, ", ", n_rows, ')'));
  26. }
  27. PyVar _get(int col, int row) { return data[row * n_cols + col]; }
  28. void _set(int col, int row, PyVar value) { data[row * n_cols + col] = value; }
  29. static void _register(VM* vm, PyObject* mod, PyObject* type) {
  30. vm->bind(type, "__new__(cls, *args, **kwargs)", [](VM* vm, ArgsView args) {
  31. Type cls = PK_OBJ_GET(Type, args[0]);
  32. return vm->new_object<Array2d>(cls);
  33. });
  34. vm->bind(type, "__init__(self, n_cols: int, n_rows: int, default=None)", [](VM* vm, ArgsView args) {
  35. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  36. int n_cols = CAST(int, args[1]);
  37. int n_rows = CAST(int, args[2]);
  38. if(n_cols <= 0 || n_rows <= 0) { vm->ValueError("n_cols and n_rows must be positive integers"); }
  39. self.init(n_cols, n_rows);
  40. if(vm->py_callable(args[3])) {
  41. for(int i = 0; i < self.numel; i++)
  42. self.data[i] = vm->call(args[3]);
  43. } else {
  44. for(int i = 0; i < self.numel; i++)
  45. self.data[i] = args[3];
  46. }
  47. return vm->None;
  48. });
  49. PY_READONLY_FIELD(Array2d, "n_cols", n_cols);
  50. PY_READONLY_FIELD(Array2d, "n_rows", n_rows);
  51. PY_READONLY_FIELD(Array2d, "width", n_cols);
  52. PY_READONLY_FIELD(Array2d, "height", n_rows);
  53. PY_READONLY_FIELD(Array2d, "numel", numel);
  54. // _get
  55. vm->bind_func(type, "_get", 3, [](VM* vm, ArgsView args) {
  56. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  57. int col = CAST(int, args[1]);
  58. int row = CAST(int, args[2]);
  59. self.check_valid(vm, col, row);
  60. return self._get(col, row);
  61. });
  62. // _set
  63. vm->bind_func(type, "_set", 4, [](VM* vm, ArgsView args) {
  64. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  65. int col = CAST(int, args[1]);
  66. int row = CAST(int, args[2]);
  67. self.check_valid(vm, col, row);
  68. self._set(col, row, args[3]);
  69. return vm->None;
  70. });
  71. vm->bind_func(type, "is_valid", 3, [](VM* vm, ArgsView args) {
  72. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  73. int col = CAST(int, args[1]);
  74. int row = CAST(int, args[2]);
  75. return VAR(self.is_valid(col, row));
  76. });
  77. vm->bind(type, "get(self, col: int, row: int, default=None)", [](VM* vm, ArgsView args) {
  78. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  79. int col = CAST(int, args[1]);
  80. int row = CAST(int, args[2]);
  81. if(!self.is_valid(col, row)) return args[3];
  82. return self._get(col, row);
  83. });
  84. #define HANDLE_SLICE() \
  85. int start_col, stop_col, step_col; \
  86. int start_row, stop_row, step_row; \
  87. vm->parse_int_slice(PK_OBJ_GET(Slice, xy[0]), self.n_cols, start_col, stop_col, step_col); \
  88. vm->parse_int_slice(PK_OBJ_GET(Slice, xy[1]), self.n_rows, start_row, stop_row, step_row); \
  89. if(step_col != 1 || step_row != 1) vm->ValueError("slice step must be 1"); \
  90. int slice_width = stop_col - start_col; \
  91. int slice_height = stop_row - start_row; \
  92. if(slice_width <= 0 || slice_height <= 0) vm->ValueError("slice width and height must be positive");
  93. vm->bind__getitem__(type->as<Type>(), [](VM* vm, PyVar _0, PyVar _1) {
  94. Array2d& self = PK_OBJ_GET(Array2d, _0);
  95. const Tuple& xy = CAST(Tuple&, _1);
  96. if(is_int(xy[0]) && is_int(xy[1])) {
  97. i64 col = xy[0].as<i64>();
  98. i64 row = xy[1].as<i64>();
  99. self.check_valid(vm, col, row);
  100. return self._get(col, row);
  101. }
  102. if(is_type(xy[0], VM::tp_slice) && is_type(xy[1], VM::tp_slice)) {
  103. HANDLE_SLICE();
  104. PyVar new_array_obj = vm->new_user_object<Array2d>();
  105. Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
  106. new_array.init(stop_col - start_col, stop_row - start_row);
  107. for(int j = start_row; j < stop_row; j++) {
  108. for(int i = start_col; i < stop_col; i++) {
  109. new_array._set(i - start_col, j - start_row, self._get(i, j));
  110. }
  111. }
  112. return new_array_obj;
  113. }
  114. vm->TypeError("expected `tuple[int, int]` or `tuple[slice, slice]` as index");
  115. });
  116. vm->bind__setitem__(type->as<Type>(), [](VM* vm, PyVar _0, PyVar _1, PyVar _2) {
  117. Array2d& self = PK_OBJ_GET(Array2d, _0);
  118. const Tuple& xy = CAST(Tuple&, _1);
  119. if(is_int(xy[0]) && is_int(xy[1])) {
  120. i64 col = xy[0].as<i64>();
  121. i64 row = xy[1].as<i64>();
  122. self.check_valid(vm, col, row);
  123. self._set(col, row, _2);
  124. return;
  125. }
  126. if(is_type(xy[0], VM::tp_slice) && is_type(xy[1], VM::tp_slice)) {
  127. HANDLE_SLICE();
  128. bool is_basic_type = false;
  129. switch(vm->_tp(_2).index) {
  130. case VM::tp_int.index: is_basic_type = true; break;
  131. case VM::tp_float.index: is_basic_type = true; break;
  132. case VM::tp_str.index: is_basic_type = true; break;
  133. case VM::tp_bool.index: is_basic_type = true; break;
  134. default: is_basic_type = is_none(_2);
  135. }
  136. if(is_basic_type) {
  137. for(int j = 0; j < slice_height; j++)
  138. for(int i = 0; i < slice_width; i++)
  139. self._set(i + start_col, j + start_row, _2);
  140. return;
  141. }
  142. if(!vm->is_user_type<Array2d>(_2)) {
  143. vm->TypeError(_S("expected int/float/str/bool/None or an array2d instance"));
  144. }
  145. Array2d& other = PK_OBJ_GET(Array2d, _2);
  146. if(slice_width != other.n_cols || slice_height != other.n_rows) {
  147. vm->ValueError("array2d size does not match the slice size");
  148. }
  149. for(int j = 0; j < slice_height; j++)
  150. for(int i = 0; i < slice_width; i++)
  151. self._set(i + start_col, j + start_row, other._get(i, j));
  152. return;
  153. }
  154. vm->TypeError("expected `tuple[int, int]` or `tuple[slice, slice]` as index");
  155. });
  156. #undef HANDLE_SLICE
  157. vm->bind_func(type, "tolist", 1, [](VM* vm, ArgsView args) {
  158. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  159. List t(self.n_rows);
  160. for(int j = 0; j < self.n_rows; j++) {
  161. List row(self.n_cols);
  162. for(int i = 0; i < self.n_cols; i++)
  163. row[i] = self._get(i, j);
  164. t[j] = VAR(std::move(row));
  165. }
  166. return VAR(std::move(t));
  167. });
  168. vm->bind__len__(type->as<Type>(), [](VM* vm, PyVar _0) {
  169. Array2d& self = PK_OBJ_GET(Array2d, _0);
  170. return (i64)self.numel;
  171. });
  172. vm->bind__repr__(type->as<Type>(), [](VM* vm, PyVar _0) -> Str {
  173. Array2d& self = PK_OBJ_GET(Array2d, _0);
  174. return _S("array2d(", self.n_cols, ", ", self.n_rows, ')');
  175. });
  176. vm->bind_func(type, "map", 2, [](VM* vm, ArgsView args) {
  177. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  178. PyVar f = args[1];
  179. PyVar new_array_obj = vm->new_user_object<Array2d>();
  180. Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
  181. new_array.init(self.n_cols, self.n_rows);
  182. for(int i = 0; i < new_array.numel; i++) {
  183. new_array.data[i] = vm->call(f, self.data[i]);
  184. }
  185. return new_array_obj;
  186. });
  187. vm->bind_func(type, "copy", 1, [](VM* vm, ArgsView args) {
  188. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  189. PyVar new_array_obj = vm->new_user_object<Array2d>();
  190. Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
  191. new_array.init(self.n_cols, self.n_rows);
  192. for(int i = 0; i < new_array.numel; i++) {
  193. new_array.data[i] = self.data[i];
  194. }
  195. return new_array_obj;
  196. });
  197. vm->bind_func(type, "fill_", 2, [](VM* vm, ArgsView args) {
  198. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  199. for(int i = 0; i < self.numel; i++) {
  200. self.data[i] = args[1];
  201. }
  202. return vm->None;
  203. });
  204. vm->bind_func(type, "apply_", 2, [](VM* vm, ArgsView args) {
  205. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  206. PyVar f = args[1];
  207. for(int i = 0; i < self.numel; i++) {
  208. self.data[i] = vm->call(f, self.data[i]);
  209. }
  210. return vm->None;
  211. });
  212. vm->bind_func(type, "copy_", 2, [](VM* vm, ArgsView args) {
  213. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  214. if(is_type(args[1], VM::tp_list)) {
  215. const List& list = PK_OBJ_GET(List, args[1]);
  216. if(list.size() != self.numel) {
  217. vm->ValueError("list size must be equal to the number of elements in the array2d");
  218. }
  219. for(int i = 0; i < self.numel; i++) {
  220. self.data[i] = list[i];
  221. }
  222. return vm->None;
  223. }
  224. Array2d& other = CAST(Array2d&, args[1]);
  225. // if self and other have different sizes, re-initialize self
  226. if(self.n_cols != other.n_cols || self.n_rows != other.n_rows) {
  227. delete self.data;
  228. self.init(other.n_cols, other.n_rows);
  229. }
  230. for(int i = 0; i < self.numel; i++) {
  231. self.data[i] = other.data[i];
  232. }
  233. return vm->None;
  234. });
  235. vm->bind__eq__(type->as<Type>(), [](VM* vm, PyVar _0, PyVar _1) {
  236. Array2d& self = PK_OBJ_GET(Array2d, _0);
  237. if(!vm->is_user_type<Array2d>(_1)) return vm->NotImplemented;
  238. Array2d& other = PK_OBJ_GET(Array2d, _1);
  239. if(self.n_cols != other.n_cols || self.n_rows != other.n_rows) return vm->False;
  240. for(int i = 0; i < self.numel; i++) {
  241. if(vm->py_ne(self.data[i], other.data[i])) return vm->False;
  242. }
  243. return vm->True;
  244. });
  245. vm->bind(type, "count_neighbors(self, value, neighborhood='Moore') -> array2d[int]", [](VM* vm, ArgsView args) {
  246. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  247. PyVar new_array_obj = vm->new_user_object<Array2d>();
  248. Array2d& new_array = PK_OBJ_GET(Array2d, new_array_obj);
  249. new_array.init(self.n_cols, self.n_rows);
  250. PyVar value = args[1];
  251. const Str& neighborhood = CAST(Str&, args[2]);
  252. if(neighborhood == "Moore") {
  253. for(int j = 0; j < new_array.n_rows; j++) {
  254. for(int i = 0; i < new_array.n_cols; i++) {
  255. int count = 0;
  256. count += self.is_valid(i - 1, j - 1) && vm->py_eq(self._get(i - 1, j - 1), value);
  257. count += self.is_valid(i, j - 1) && vm->py_eq(self._get(i, j - 1), value);
  258. count += self.is_valid(i + 1, j - 1) && vm->py_eq(self._get(i + 1, j - 1), value);
  259. count += self.is_valid(i - 1, j) && vm->py_eq(self._get(i - 1, j), value);
  260. count += self.is_valid(i + 1, j) && vm->py_eq(self._get(i + 1, j), value);
  261. count += self.is_valid(i - 1, j + 1) && vm->py_eq(self._get(i - 1, j + 1), value);
  262. count += self.is_valid(i, j + 1) && vm->py_eq(self._get(i, j + 1), value);
  263. count += self.is_valid(i + 1, j + 1) && vm->py_eq(self._get(i + 1, j + 1), value);
  264. new_array._set(i, j, VAR(count));
  265. }
  266. }
  267. } else if(neighborhood == "von Neumann") {
  268. for(int j = 0; j < new_array.n_rows; j++) {
  269. for(int i = 0; i < new_array.n_cols; i++) {
  270. int count = 0;
  271. count += self.is_valid(i, j - 1) && vm->py_eq(self._get(i, j - 1), value);
  272. count += self.is_valid(i - 1, j) && vm->py_eq(self._get(i - 1, j), value);
  273. count += self.is_valid(i + 1, j) && vm->py_eq(self._get(i + 1, j), value);
  274. count += self.is_valid(i, j + 1) && vm->py_eq(self._get(i, j + 1), value);
  275. new_array._set(i, j, VAR(count));
  276. }
  277. }
  278. } else {
  279. vm->ValueError("neighborhood must be 'Moore' or 'von Neumann'");
  280. }
  281. return new_array_obj;
  282. });
  283. vm->bind_func(type, "count", 2, [](VM* vm, ArgsView args) {
  284. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  285. PyVar value = args[1];
  286. int count = 0;
  287. for(int i = 0; i < self.numel; i++)
  288. count += vm->py_eq(self.data[i], value);
  289. return VAR(count);
  290. });
  291. vm->bind_func(type, "find_bounding_rect", 2, [](VM* vm, ArgsView args) {
  292. Array2d& self = PK_OBJ_GET(Array2d, args[0]);
  293. PyVar value = args[1];
  294. int left = self.n_cols;
  295. int top = self.n_rows;
  296. int right = 0;
  297. int bottom = 0;
  298. for(int j = 0; j < self.n_rows; j++) {
  299. for(int i = 0; i < self.n_cols; i++) {
  300. if(vm->py_eq(self._get(i, j), value)) {
  301. left = (std::min)(left, i);
  302. top = (std::min)(top, j);
  303. right = (std::max)(right, i);
  304. bottom = (std::max)(bottom, j);
  305. }
  306. }
  307. }
  308. int width = right - left + 1;
  309. int height = bottom - top + 1;
  310. if(width <= 0 || height <= 0) return vm->None;
  311. Tuple t(4);
  312. t[0] = VAR(left);
  313. t[1] = VAR(top);
  314. t[2] = VAR(width);
  315. t[3] = VAR(height);
  316. return VAR(std::move(t));
  317. });
  318. }
  319. void _gc_mark(VM* vm) const {
  320. for(int i = 0; i < numel; i++)
  321. vm->obj_gc_mark(data[i]);
  322. }
  323. ~Array2d() { delete[] data; }
  324. };
  325. struct Array2dIter {
  326. PK_ALWAYS_PASS_BY_POINTER(Array2dIter)
  327. PyVar ref;
  328. Array2d* a;
  329. int i;
  330. Array2dIter(PyVar ref, Array2d* a) : ref(ref), a(a), i(0) {}
  331. void _gc_mark(VM* vm) const { vm->obj_gc_mark(ref); }
  332. static void _register(VM* vm, PyObject* mod, PyObject* type) {
  333. vm->bind__iter__(type->as<Type>(), [](VM* vm, PyVar _0) {
  334. return _0;
  335. });
  336. vm->bind__next__(type->as<Type>(), [](VM* vm, PyVar _0) -> unsigned {
  337. Array2dIter& self = PK_OBJ_GET(Array2dIter, _0);
  338. if(self.i == self.a->numel) return 0;
  339. std::div_t res = std::div(self.i, self.a->n_cols);
  340. vm->s_data.emplace(VM::tp_int, res.rem);
  341. vm->s_data.emplace(VM::tp_int, res.quot);
  342. vm->s_data.push(self.a->data[self.i++]);
  343. return 3;
  344. });
  345. }
  346. };
  347. void add_module_array2d(VM* vm) {
  348. PyObject* mod = vm->new_module("array2d");
  349. vm->register_user_class<Array2d>(mod, "array2d", VM::tp_object, true);
  350. vm->register_user_class<Array2dIter>(mod, "_array2d_iter");
  351. Type array2d_iter_t = vm->_tp_user<Array2d>();
  352. vm->bind__iter__(array2d_iter_t, [](VM* vm, PyVar _0) {
  353. return vm->new_user_object<Array2dIter>(_0, &_0.obj_get<Array2d>());
  354. });
  355. vm->_all_types[array2d_iter_t].op__iter__ = [](VM* vm, PyVar _0) {
  356. vm->new_stack_object<Array2dIter>(vm->_tp_user<Array2dIter>(), _0, &_0.obj_get<Array2d>());
  357. };
  358. }
  359. } // namespace pkpy