From 9ec2a08c8ca0999da60e3a261dd0a86efad29abc Mon Sep 17 00:00:00 2001 From: Ashish Bhanu Daulatabad Date: Sat, 20 Mar 2021 23:04:58 +0530 Subject: [PATCH] Type changes --- machine_learning/a_star_search.cpp | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/machine_learning/a_star_search.cpp b/machine_learning/a_star_search.cpp index 8edebe926..349906026 100644 --- a/machine_learning/a_star_search.cpp +++ b/machine_learning/a_star_search.cpp @@ -404,12 +404,12 @@ static void test() { [](const machine_learning::aystar_search::EightPuzzle<> &first, const machine_learning::aystar_search::EightPuzzle<> &second) { uint32_t ret = 0; - for (uint32_t i = 0; i < first.get_size(); ++i) { - for (uint32_t j = 0; j < first.get_size(); ++j) { - uint32_t find = first.get(i, j); + for (int i = 0; i < first.get_size(); ++i) { + for (int j = 0; j < first.get_size(); ++j) { + int find = first.get(i, j); int m = -1, n = -1; - for (uint32_t k = 0; k < second.get_size(); ++k) { - for (uint32_t l = 0; l < second.get_size(); ++l) { + for (int k = 0; k < second.get_size(); ++k) { + for (int l = 0; l < second.get_size(); ++l) { if (find == second.get(k, l)) { std::tie(m, n) = std::make_pair(k, l); break; @@ -510,12 +510,12 @@ static void test() { [](const machine_learning::aystar_search::EightPuzzle<4> &first, const machine_learning::aystar_search::EightPuzzle<4> &second) { uint32_t ret = 0; - for (uint32_t i = 0; i < first.get_size(); ++i) { - for (uint32_t j = 0; j < first.get_size(); ++j) { + for (int i = 0; i < first.get_size(); ++i) { + for (int j = 0; j < first.get_size(); ++j) { int find = first.get(i, j); int m = -1, n = -1; - for (uint32_t k = 0; k < second.get_size(); ++k) { - for (uint32_t l = 0; l < second.get_size(); ++l) { + for (int k = 0; k < second.get_size(); ++k) { + for (int l = 0; l < second.get_size(); ++l) { if (find == second.get(k, l)) { std::tie(m, n) = std::make_pair(k, l); break;