// Copyright (C) 2013 Garth N. Wells
//
// This file is part of DOLFIN.
//
// DOLFIN 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.
//
// DOLFIN 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 DOLFIN. If not, see .
//
// Unit tests for MeshFunction
#include
#include
using namespace dolfin;
TEST_CASE("MeshFunctions")
{
SECTION("Test create from domains")
{
// Create mesh
std::shared_ptr mesh(new UnitSquareMesh(3, 3));
dolfin_assert(mesh);
const std::size_t D = mesh->topology().dim();
// Test setting all values
for (std::size_t d = 0; d <= D; ++d)
{
// Create MeshDomains object
MeshDomains mesh_domains;
mesh_domains.init(D);
mesh->init(d);
// Build mesh domain
std::map& domain = mesh_domains.markers(d);
for (std::size_t i = 0; i < mesh->num_entities(d); ++i)
domain.insert(std::make_pair(i, i));
// Create MeshFunction and test values
MeshFunction mf(mesh, d, mesh_domains);
for (std::size_t i = 0; i < mf.size(); ++i)
CHECK(mf[i] == i);
}
// Test setting some values only
for (std::size_t d = 0; d <= D; ++d)
{
// Create MeshDomains object
MeshDomains mesh_domains;
mesh_domains.init(D);
mesh->init(d);
// Build mesh domain
std::map& domain = mesh_domains.markers(d);
const std::size_t num_entities = mesh->num_entities(d);
for (std::size_t i = num_entities/2; i < num_entities; ++i)
domain.insert(std::make_pair(i, i));
// Create MeshFunction and test values
MeshFunction mf(mesh, d, mesh_domains);
for (std::size_t i = 0; i < num_entities/2; ++i)
CHECK(mf[i] == std::numeric_limits::max());
for (std::size_t i = num_entities/2; i < mf.size(); ++i)
CHECK(mf[i] == i);
}
}
}