| 1 |
// Copyright (C) 2013 Anders Logg |
| 2 |
// |
| 3 |
// This file is part of DOLFIN. |
| 4 |
// |
| 5 |
// DOLFIN is free software: you can redistribute it and/or modify |
| 6 |
// it under the terms of the GNU Lesser General Public License as published by |
| 7 |
// the Free Software Foundation, either version 3 of the License, or |
| 8 |
// (at your option) any later version. |
| 9 |
// |
| 10 |
// DOLFIN is distributed in the hope that it will be useful, |
| 11 |
// but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 |
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 13 |
// GNU Lesser General Public License for more details. |
| 14 |
// |
| 15 |
// You should have received a copy of the GNU Lesser General Public License |
| 16 |
// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>. |
| 17 |
// |
| 18 |
// This benchmark measures the performance of building a BoundingBoxTree (and |
| 19 |
// one call to compute_entities, which is dominated by building). |
| 20 |
// |
| 21 |
// First added: 2013-04-18 |
| 22 |
// Last changed: 2013-06-25 |
| 23 |
|
| 24 |
#include <vector> |
| 25 |
#include <dolfin.h> |
| 26 |
|
| 27 |
using namespace dolfin; |
| 28 |
|
| 29 |
#define SIZE 128 |
| 30 |
|
| 31 |
int main(int argc, char* argv[]) |
| 32 |
{ |
| 33 |
info("Build bounding box tree on UnitCubeMesh(%d, %d, %d)", |
| 34 |
SIZE, SIZE, SIZE); |
| 35 |
|
| 36 |
// Create mesh |
| 37 |
UnitCubeMesh mesh(SIZE, SIZE, SIZE); |
| 38 |
|
| 39 |
// Create and build tree |
| 40 |
tic(); |
| 41 |
BoundingBoxTree tree; |
| 42 |
tree.build(mesh); |
| 43 |
info("BENCH %g", toc()); |
| 44 |
|
| 45 |
return 0; |
| 46 |
} |