Homec4science
Diffusion tamaas (features/declarative) Browse

tamaas/tests/test_loop.cpp
326e0378133bfeatures/declarative

Last Change
Raw File

test_loop.cpp
View Options

/**
*
* @author Lucas Frérot <lucas.frerot@epfl.ch>
*
* @section LICENSE
*
* Copyright (©) 2017 EPFL (Ecole Polytechnique Fédérale de
* Lausanne) Laboratory (LSMS - Laboratoire de Simulation en Mécanique des
* Solides)
*
* Tamaas is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Tamaas is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Tamaas. If not, see <http://www.gnu.org/licenses/>.
*
*/
/* -------------------------------------------------------------------------- */
#include <array>
#include <algorithm>
#include <numeric>
#include <limits>
#include <criterion/criterion.h>
#include "grid.hh"
#include "loop.hh"
using namespace tamaas;
void tamaas_init() {
initialize();
}
void tamaas_teardown() {
finalize();
}
/* -------------------------------------------------------------------------- */
TestSuite(loops, .init = tamaas_init, .fini = tamaas_teardown);
// Testing loops on one grid
Test(loops, one_arg) {
Grid<Real, 1> grid({20}, 1);
Grid<Real, 1> solution({20}, 1);
auto add_one = [](Real & x) { return x + 1; };
std::iota(grid.begin(), grid.end(), 1);
// Makeing solution
std::transform(grid.begin(), grid.end(), solution.begin(), add_one);
auto add_one_inplace = [](Real & x) { x += 1; };
Loop::get().loop(add_one_inplace, grid);
cr_assert(std::mismatch(solution.begin(), solution.end(), grid.begin())
== std::make_pair(solution.end(), grid.end()),
"One argument loop failed");
}
// Testing loops on two grids
Test(loops, two_args) {
// Why no ints?
Grid<Int, 2> grid({20, 20}, 1);
Grid<Int, 2> primal({20, 20}, 1);
Grid<Int, 2> solution({20, 20}, 1);
primal(0, 0) = 1; primal(0, 1) = 1;
primal(1, 0) = 1; primal(1, 1) = 1;
std::transform(primal.begin(), primal.end(), solution.begin(),
[](Int & primal) {
return (primal > 0)? -1:1;
});
Loop::get().loop([](Int & primal, Int & val) {
val = (primal > 0)? -1:1;
}, primal, grid);
cr_assert(std::mismatch(solution.begin(), solution.end(), grid.begin())
== std::make_pair(solution.end(), grid.end()),
"Two argument loop failed");
}
/* -------------------------------------------------------------------------- */
TestSuite(reductions, .init = tamaas_init, .fini = tamaas_teardown);
// Testing one grid reductions
Test(reductions, one_arg) {
Grid<UInt, 1> grid({6}, 1);
std::iota(grid.begin(), grid.end(), 1);
// Sum reduction
UInt sol = std::accumulate(grid.begin(), grid.end(), 0, std::plus<UInt>());
UInt red = Loop::get().reduce<plus>([](UInt & x){return x;}, grid);
cr_assert(sol == red, "Addition reduction failed on one argument");
// Product reduction
sol = std::accumulate(grid.begin(), grid.end(), 1, std::multiplies<UInt>());
red = Loop::get().reduce<times>([](UInt & x){return x;}, grid);
cr_assert(sol == red, "Multiplication reduction failed on one argument");
// Min reduction
sol = *std::min_element(grid.begin(), grid.end());
red = Loop::get().reduce<min>([](UInt & x){return x;}, grid);
cr_assert(sol == red, "Min reduction failed on one argument");
// Max reduction
sol = *std::max_element(grid.begin(), grid.end());
red = Loop::get().reduce<max>([](UInt & x){return x;}, grid);
cr_assert(sol == red, "Max reduction failed on one argument");
}
Test(reductions, two_args) {
Grid<UInt, 1> grid({20}, 1);
Grid<UInt, 1> primal({20}, 1);
grid = 1;
primal(0) = 1;
primal(1) = 1;
// Reduce on values where primal > 0
UInt red = Loop::get().reduce<plus>([](UInt & p, UInt & val) {
return (p > 0)? val:0;
}, primal, grid);
cr_assert(red == 2, "Two args reduction failed");
}
c4science · Help