-
-
Notifications
You must be signed in to change notification settings - Fork 82
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
13 changed files
with
539 additions
and
60 deletions.
There are no files selected for viewing
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,209 @@ | ||
| #ifndef INCLUDED_DUNGEON_TEMPLATE_LIBRARY_DUNGEON_MATRIX | ||
| #define INCLUDED_DUNGEON_TEMPLATE_LIBRARY_DUNGEON_MATRIX | ||
| //:::::----------::::::::::----------:::::// | ||
| // Dungeon Template Library // | ||
| // Made by Gaccho. // | ||
| // This code is licensed under CC0. // | ||
| // [email protected] // | ||
| //:::::----------::::::::::----------:::::// | ||
|
|
||
| #include <cstddef> | ||
|
|
||
| //Dungeon Template Library Namespace | ||
| namespace dtl { | ||
|
|
||
| //ダンジョン内の値を操作 | ||
| namespace matrix { | ||
|
|
||
| //配列数を取得 | ||
| template<typename Matrix_> | ||
| constexpr std::size_t getSize(const Matrix_& matrix_) noexcept { | ||
| return ((matrix_.size() == 0) ? 0 : (matrix_.size()*matrix_[0].size())); | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr std::size_t getSizeX(const Matrix_& matrix_) noexcept { | ||
| return ((matrix_.size() == 0) ? 0 : matrix_[0].size()); | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr std::size_t getSizeY(const Matrix_& matrix_) noexcept { | ||
| return matrix_.size(); | ||
| } | ||
|
|
||
| constexpr bool isEmpty(const std::size_t x_, const std::size_t y_) noexcept { | ||
| return (y_ == 0 || x_ == 0); | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr bool isEmpty(const Matrix_& matrix_) noexcept { | ||
| return (matrix_.size() == 0 || matrix_[0].size() == 0); | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr bool isLessThan(const Matrix_& matrix_, const std::size_t num_) noexcept { | ||
| return (matrix_.size() < num_ || matrix_[0].size() < num_); | ||
| } | ||
|
|
||
| //指定位置に値を代入する | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void setValue(Matrix_& matrix_, const std::size_t x_, const std::size_t y_, const Matrix_Int_ value_) noexcept { | ||
| matrix_[y_][x_] = value_; | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr void setValue(Matrix_& matrix_, const std::size_t x_, const std::size_t y_) noexcept { | ||
| matrix_[y_][x_] = 0; | ||
| } | ||
| //指定位置の値を取得する | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void getValue(const Matrix_& matrix_, const std::size_t x_, const std::size_t y_, Matrix_Int_& value_) noexcept { | ||
| value_ = matrix_[y_][x_]; | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr auto getValue(const Matrix_& matrix_, const std::size_t x_, const std::size_t y_) noexcept { | ||
| return matrix_[y_][x_]; | ||
| } | ||
|
|
||
| //サイズ変更(std::vector, std::deque等) | ||
| template<typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t x_, const std::size_t y_) noexcept { | ||
| matrix_.resize(y_); | ||
| for (std::size_t row{}; row < y_; ++row) | ||
| matrix_[row].resize(x_); | ||
| } | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t x_, const std::size_t y_, const Matrix_Int_ value_) noexcept { | ||
| matrix_.resize(y_); | ||
| for (std::size_t row{}; row < y_; ++row) { | ||
| matrix_[row].resize(x_); | ||
| for (std::size_t col{}; col < x_; ++col) | ||
| matrix_[row][col] = value_; | ||
| } | ||
| } | ||
|
|
||
| namespace layer { | ||
|
|
||
| template<typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t x_, const std::size_t y_, const std::size_t layer_) noexcept { | ||
| matrix_.resize(y_); | ||
| for (std::size_t row{}; row < y_; ++row) { | ||
| matrix_[row].resize(x_); | ||
| for (std::size_t col{}; col < x_; ++col) | ||
| matrix_[row][col].resize(layer_); | ||
| } | ||
| } | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t x_, const std::size_t y_, const std::size_t layer_, const Matrix_Int_ value_) noexcept { | ||
| matrix_.resize(y_); | ||
| for (std::size_t row{}; row < y_; ++row) { | ||
| matrix_[row].resize(x_); | ||
| for (std::size_t col{}; col < x_; ++col) { | ||
| matrix_[row][col].resize(layer_); | ||
| for (std::size_t layer{}; layer < layer_; ++layer) | ||
| matrix_[row][col][layer_] = value_; | ||
| } | ||
| } | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t layer_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col].resize(layer_); | ||
| } | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void resize(Matrix_& matrix_, const std::size_t layer_, const Matrix_Int_ value_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) { | ||
| matrix_[row][col].resize(layer_); | ||
| for (std::size_t layer{}; layer < layer_; ++layer) | ||
| matrix_[row][col][layer_] = value_; | ||
| } | ||
| } | ||
|
|
||
| } | ||
|
|
||
| //ダンジョン内の値を初期化する | ||
| template<typename Matrix_> | ||
| constexpr void init(Matrix_& matrix_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col] = 0; | ||
| } | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void init(Matrix_& matrix_, const Matrix_Int_ value_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col] = value_; | ||
| } | ||
| template<typename Matrix_> | ||
| constexpr void init(Matrix_& matrix_, const std::size_t x_, const std::size_t y_) noexcept { | ||
| for (std::size_t row{}; row < y_; ++row) | ||
| for (std::size_t col{}; col < x_; ++col) | ||
| matrix_[row][col] = 0; | ||
| } | ||
| template<typename Matrix_Int_, typename Matrix_> | ||
| constexpr void init(Matrix_& matrix_, const std::size_t x_, const std::size_t y_, const Matrix_Int_ value_) noexcept { | ||
| for (std::size_t row{}; row < y_; ++row) | ||
| for (std::size_t col{}; col < x_; ++col) | ||
| matrix_[row][col] = value_; | ||
| } | ||
|
|
||
| //上下反転 | ||
| template<typename Matrix_> | ||
| constexpr void flip(Matrix_& matrix_) noexcept { | ||
| for (std::size_t row{}, row2{ matrix_.size() - 1 };; ++row, --row2) { | ||
| if (row >= row2) break; | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) { | ||
| const auto&& tmp{ (matrix_[row][col] + 0) }; | ||
| matrix_[row][col] = matrix_[row2][col]; | ||
| matrix_[row2][col] = std::move(tmp); | ||
| } | ||
| } | ||
| } | ||
| //左右反転 | ||
| template<typename Matrix_> | ||
| constexpr void mirror(Matrix_& matrix_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}, col2{ matrix_[row].size() - 1 };; ++col, --col2) { | ||
| if (col >= col2) break; | ||
| const auto&& tmp{ (matrix_[row][col] + 0) }; | ||
| matrix_[row][col] = matrix_[row][col2]; | ||
| matrix_[row][col2] = std::move(tmp); | ||
| } | ||
| } | ||
|
|
||
| template<typename Matrix_> | ||
| constexpr void copy(Matrix_& matrix_, const Matrix_& matrix2_) noexcept { | ||
| matrix_ = matrix2_; | ||
| } | ||
| template<typename Matrix_, typename Matrix2_> | ||
| constexpr void copy(Matrix_& matrix_, const Matrix2_& matrix2_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col] = matrix2_[row][col]; | ||
| } | ||
|
|
||
| template<typename Matrix_, typename Matrix2_> | ||
| constexpr void convertSTL_intoDefault(Matrix_& matrix_, std::size_t& x_, std::size_t& y_, const Matrix2_& matrix2_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col] = matrix2_[row][col]; | ||
| ((y_ = matrix2_.size()) == 0) ? (x_ = 0) : (x_ = matrix2_[0].size()); | ||
| } | ||
| template<typename Matrix_, typename Matrix2_> | ||
| constexpr void convertSTL_intoArray(Matrix_& matrix_, std::size_t& x_, std::size_t& y_, const Matrix2_& matrix2_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row*x_ + col] = matrix2_[row][col]; | ||
| ((y_ = matrix2_.size()) == 0) ? (x_ = 0) : (x_ = matrix2_[0].size()); | ||
| } | ||
| template<typename Matrix_, typename Matrix2_> | ||
| constexpr void convertSTL_intoLayer(Matrix_& matrix_, std::size_t& layer_, const Matrix2_& matrix2_) noexcept { | ||
| for (std::size_t row{}; row < matrix_.size(); ++row) | ||
| for (std::size_t col{}; col < matrix_[row].size(); ++col) | ||
| matrix_[row][col][layer_] = matrix2_[row][col]; | ||
| } | ||
|
|
||
|
|
||
|
|
||
| } | ||
|
|
||
| } | ||
|
|
||
| #endif //Included Dungeon Template Library |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.