guilhem_lavaux/cosmotool
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove exception specification

Browse Source
This commit is contained in:
Guilhem Lavaux 2018-03-26 10:19:31 +02:00
parent 45912a8970
commit 43beca7053
2 changed files with 4 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/mykdtree.hpp
View File

@ -155,13 +155,11 @@ namespace CosmoTool {
uint32_t getIntersection(const coords& x, CoordType r, uint32_t getIntersection(const coords& x, CoordType r,
Cell **cells, Cell **cells,
uint32_t numCells) uint32_t numCells);
throw (NotEnoughCells);
uint32_t getIntersection(const coords& x, CoordType r, uint32_t getIntersection(const coords& x, CoordType r,
Cell **cells, Cell **cells,
CoordType *distances, CoordType *distances,
uint32_t numCells) uint32_t numCells);
throw (NotEnoughCells);
uint32_t countCells(const coords& x, CoordType r); uint32_t countCells(const coords& x, CoordType r);
Cell *getNearestNeighbour(const coords& x); Cell *getNearestNeighbour(const coords& x);
@ -192,8 +190,7 @@ namespace CosmoTool {
#endif #endif
#ifdef __KD_TREE_SAVE_ON_DISK #ifdef __KD_TREE_SAVE_ON_DISK
KDTree(std::istream& i, Cell *cells, NodeIntType Ncells) KDTree(std::istream& i, Cell *cells, NodeIntType Ncells);
throw (InvalidOnDiskKDTree);
void saveTree(std::ostream& o) const; void saveTree(std::ostream& o) const;
#endif #endif
@ -218,8 +215,7 @@ namespace CosmoTool {
template<bool justCount> template<bool justCount>
void recursiveIntersectionCells(RecursionInfoCells<N,ValType, CType>& info, void recursiveIntersectionCells(RecursionInfoCells<N,ValType, CType>& info,
Node *node, Node *node,
int level) int level);
throw (NotEnoughCells);
CoordType computeDistance(const Cell *cell, const coords& x) const; CoordType computeDistance(const Cell *cell, const coords& x) const;
void recursiveNearest(Node *node, void recursiveNearest(Node *node,

4
src/mykdtree.tcc
View File

@ -83,7 +83,6 @@ namespace CosmoTool {
uint32_t KDTree<N,ValType,CType,CellSplitter>::getIntersection(const coords& x, CoordType r, uint32_t KDTree<N,ValType,CType,CellSplitter>::getIntersection(const coords& x, CoordType r,
KDTree<N,ValType,CType,CellSplitter>::Cell **cells, KDTree<N,ValType,CType,CellSplitter>::Cell **cells,
uint32_t numCells) uint32_t numCells)
throw (NotEnoughCells)
{ {
RecursionInfoCells<N,ValType,CType> info; RecursionInfoCells<N,ValType,CType> info;
@ -117,7 +116,6 @@ namespace CosmoTool {
Cell **cells, Cell **cells,
CoordType *distances, CoordType *distances,
uint32_t numCells) uint32_t numCells)
throw (NotEnoughCells)
{ {
RecursionInfoCells<N,ValType> info; RecursionInfoCells<N,ValType> info;
@ -180,7 +178,6 @@ namespace CosmoTool {
void KDTree<N,ValType,CType,CellSplitter>::recursiveIntersectionCells(RecursionInfoCells<N,ValType,CType>& info, void KDTree<N,ValType,CType,CellSplitter>::recursiveIntersectionCells(RecursionInfoCells<N,ValType,CType>& info,
Node *node, Node *node,
int level) int level)
throw (NotEnoughCells)
{ {
int axis = level % N; int axis = level % N;
CoordType d2 = 0; CoordType d2 = 0;
@ -611,7 +608,6 @@ namespace CosmoTool {
template<int N, typename ValType, typename CType, typename CellSplitter> template<int N, typename ValType, typename CType, typename CellSplitter>
KDTree<N,ValType,CType,CellSplitter>::KDTree(std::istream& in, Cell *cells, NodeIntType Ncells) KDTree<N,ValType,CType,CellSplitter>::KDTree(std::istream& in, Cell *cells, NodeIntType Ncells)
throw (InvalidOnDiskKDTree)
{ {
KDTreeHeader h; KDTreeHeader h;