summaryrefslogtreecommitdiff
path: root/src/utilities
diff options
context:
space:
mode:
authorAdrian Kummerlaender2019-06-24 15:49:04 +0200
committerAdrian Kummerlaender2019-06-24 15:55:59 +0200
commit1477bbe177da4d3ad07877d4b672aac4828d0a13 (patch)
treefa001f2be8cd2606ef469f177cb71860db72ef5e /src/utilities
parentd316b74c25ea98d0145a9adad4ff9953f07581e4 (diff)
downloadgrid_refinement_openlb-master.tar
grid_refinement_openlb-master.tar.gz
grid_refinement_openlb-master.tar.bz2
grid_refinement_openlb-master.tar.lz
grid_refinement_openlb-master.tar.xz
grid_refinement_openlb-master.tar.zst
grid_refinement_openlb-master.zip
Fix rebase conflictsHEADmaster
Diffstat (limited to 'src/utilities')
-rw-r--r--src/utilities/vectorHelpers.h11
1 files changed, 0 insertions, 11 deletions
diff --git a/src/utilities/vectorHelpers.h b/src/utilities/vectorHelpers.h
index e4fc958..17453dd 100644
--- a/src/utilities/vectorHelpers.h
+++ b/src/utilities/vectorHelpers.h
@@ -188,17 +188,6 @@ Vector<T,Size> ceil(const Vector<T,Size>& a)
return out;
}
-/// applies ceil to each component of a vector
-template <typename T, unsigned Size>
-Vector<T,Size> ceil(const Vector<T,Size>& a)
-{
- Vector<T,Size> out;
- for (unsigned int iDim=0; iDim < Size; ++iDim) {
- out[iDim] = std::ceil(a[iDim]);
- }
- return out;
-}
-
/*
/// algorithm by Möller–Trumbore (TODO add ref), implemented by Lucas Cruz and Mathias J. Krause
/// returns true if there is an intersection of a triangle given by (point0, point1, point1) and a ray given by its origin and direction and computes the distance