Mercurial > hg > orthanc-stl

comparison Sources/Toolbox.cpp @ 32:976da5476810

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
reorganization
author Sebastien Jodogne <s.jodogne@gmail.com>
date Thu, 04 Apr 2024 18:35:54 +0200
parents
children
comparison
equal deleted inserted replaced
31:ab231760799d 32:976da5476810
1 /**
2 * SPDX-FileCopyrightText: 2023-2024 Sebastien Jodogne, UCLouvain, Belgium
3 * SPDX-License-Identifier: GPL-3.0-or-later
4 */
5
6 /**
7 * STL plugin for Orthanc
8 * Copyright (C) 2023-2024 Sebastien Jodogne, UCLouvain, Belgium
9 *
10 * This program is free software: you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License as
12 * published by the Free Software Foundation, either version 3 of the
13 * License, or (at your option) any later version.
14 *
15 * This program is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public License
21 * along with this program. If not, see <http://www.gnu.org/licenses/>.
22 **/
23
24
25 #include "Toolbox.h"
26
27 #include <algorithm>
28 #include <cmath>
29
30
31 namespace Toolbox
32 {
33 bool IsNear(double a,
34 double b)
35 {
36 return std::abs(a - b) < 10.0 * std::numeric_limits<double>::epsilon();
37 }
38
39
40 bool MyParseDouble(double& value,
41 const std::string& s)
42 {
43 #if 1
44 char* end = NULL;
45 value = strtod(s.c_str(), &end);
46 return (end == s.c_str() + s.size());
47 #else
48 return Orthanc::SerializationToolbox::ParseDouble(value, s);
49 #endif
50 }
51
52
53 namespace
54 {
55 struct IsNearPredicate
56 {
57 bool operator() (const double& a,
58 const double& b)
59 {
60 return Toolbox::IsNear(a, b);
61 }
62 };
63 }
64
65
66 void RemoveDuplicateValues(std::vector<double>& v)
67 {
68 IsNearPredicate predicate;
69 std::vector<double>::iterator last = std::unique(v.begin(), v.end(), predicate);
70 v.erase(last, v.end());
71 }
72 }