mirror of
https://github.com/Relintai/pandemonium_engine.git
synced 2024-11-22 17:07:20 +01:00
179 lines
5.1 KiB
C++
179 lines
5.1 KiB
C++
#ifndef FAST_WFC_UTILS_ARRAY2D_HPP_
|
|
#define FAST_WFC_UTILS_ARRAY2D_HPP_
|
|
|
|
/*************************************************************************/
|
|
/* array_2d.h */
|
|
/*************************************************************************/
|
|
/* This file is part of: */
|
|
/* PANDEMONIUM ENGINE */
|
|
/* https://github.com/Relintai/pandemonium_engine */
|
|
/*************************************************************************/
|
|
/* Copyright (c) 2022-present Péter Magyar. */
|
|
/* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
|
|
/* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
|
|
/* */
|
|
/* 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. */
|
|
/*************************************************************************/
|
|
|
|
#include "core/containers/pool_vector.h"
|
|
#include "core/containers/vector.h"
|
|
#include "core/variant/variant.h"
|
|
|
|
template <typename T>
|
|
class Array2D {
|
|
public:
|
|
int height;
|
|
int width;
|
|
|
|
Vector<T> data;
|
|
|
|
Array2D() {
|
|
height = 0;
|
|
width = 0;
|
|
}
|
|
|
|
Array2D(int p_height, int p_width) {
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(width * height);
|
|
}
|
|
|
|
Array2D(int p_height, int p_width, T p_value) {
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(width * height);
|
|
data.fill(p_value);
|
|
}
|
|
|
|
Array2D(const PoolIntArray &p_data, int p_height, int p_width) {
|
|
int wh = p_width * p_height;
|
|
if (wh != p_data.size()) {
|
|
width = 0;
|
|
height = 0;
|
|
ERR_FAIL_MSG("wh != p_data.size()");
|
|
}
|
|
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(wh);
|
|
|
|
int *w = data.ptrw();
|
|
int s = data.size();
|
|
|
|
PoolIntArray::Read r = p_data.read();
|
|
|
|
for (int i = 0; i < s; ++i) {
|
|
w[i] = r[i];
|
|
}
|
|
}
|
|
|
|
void resize(int p_height, int p_width) {
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(width * height);
|
|
}
|
|
|
|
void resize_fill(int p_height, int p_width, T p_value) {
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(width * height);
|
|
data.fill(p_value);
|
|
}
|
|
|
|
void set_data(const PoolIntArray &p_data, int p_height, int p_width) {
|
|
int wh = p_width * p_height;
|
|
ERR_FAIL_COND(wh != p_data.size());
|
|
|
|
resize(p_height, p_width);
|
|
|
|
height = p_height;
|
|
width = p_width;
|
|
data.resize(wh);
|
|
|
|
int *w = data.ptrw();
|
|
int s = data.size();
|
|
|
|
PoolIntArray::Read r = p_data.read();
|
|
|
|
for (int i = 0; i < s; ++i) {
|
|
w[i] = r[i];
|
|
}
|
|
}
|
|
|
|
const T &get(int i, int j) const {
|
|
CRASH_BAD_INDEX(i, height);
|
|
CRASH_BAD_INDEX(j, width);
|
|
|
|
return data[j + i * width];
|
|
}
|
|
|
|
T &get(int i, int j) {
|
|
CRASH_BAD_INDEX(i, height);
|
|
CRASH_BAD_INDEX(j, width);
|
|
|
|
return data.write[j + i * width];
|
|
}
|
|
|
|
Array2D<T> reflected() const {
|
|
Array2D<T> result = Array2D<T>(height, width);
|
|
for (int y = 0; y < height; y++) {
|
|
for (int x = 0; x < width; x++) {
|
|
result.get(y, x) = get(y, width - 1 - x);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
Array2D<T> rotated() const {
|
|
Array2D<T> result = Array2D<T>(width, height);
|
|
for (int y = 0; y < width; y++) {
|
|
for (int x = 0; x < height; x++) {
|
|
result.get(y, x) = get(x, width - 1 - y);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
Array2D<T> get_sub_array(int y, int x, int sub_width, int sub_height) const {
|
|
Array2D<T> sub_array_2d = Array2D<T>(sub_height, sub_width);
|
|
for (int ki = 0; ki < sub_height; ki++) {
|
|
for (int kj = 0; kj < sub_width; kj++) {
|
|
sub_array_2d.get(ki, kj) = get((y + ki) % height, (x + kj) % width);
|
|
}
|
|
}
|
|
return sub_array_2d;
|
|
}
|
|
|
|
bool operator==(const Array2D<T> &a) const {
|
|
if (height != a.height || width != a.width) {
|
|
return false;
|
|
}
|
|
|
|
for (int i = 0; i < data.size(); i++) {
|
|
if (a.data[i] != data[i]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
};
|
|
|
|
#endif
|