array2d.cpp 15 KB

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