Mercurial > hg > orthanc-stone
annotate Framework/Loaders/BasicFetchingItemsSorter.cpp @ 1270:2d8ab34c8c91
upgrade to year 2020
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Fri, 31 Jan 2020 17:34:29 +0100 |
parents | 51976977d2d3 |
children | 30deba7bc8e2 |
rev | line source |
---|---|
708 | 1 /** |
2 * Stone of Orthanc | |
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
4 * Department, University Hospital of Liege, Belgium | |
1270
2d8ab34c8c91
upgrade to year 2020
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
708
diff
changeset
|
5 * Copyright (C) 2017-2020 Osimis S.A., Belgium |
708 | 6 * |
7 * This program is free software: you can redistribute it and/or | |
8 * modify it under the terms of the GNU Affero General Public License | |
9 * as published by the Free Software Foundation, either version 3 of | |
10 * the License, or (at your option) any later version. | |
11 * | |
12 * This program is distributed in the hope that it will be useful, but | |
13 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 * Affero General Public License for more details. | |
16 * | |
17 * You should have received a copy of the GNU Affero General Public License | |
18 * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
19 **/ | |
20 | |
21 | |
22 #include "BasicFetchingItemsSorter.h" | |
23 | |
24 #include <Core/OrthancException.h> | |
25 | |
26 namespace OrthancStone | |
27 { | |
28 BasicFetchingItemsSorter::BasicFetchingItemsSorter(unsigned int itemsCount) : | |
29 itemsCount_(itemsCount) | |
30 { | |
31 if (itemsCount == 0) | |
32 { | |
33 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
34 } | |
35 } | |
36 | |
37 | |
38 void BasicFetchingItemsSorter::Sort(std::vector<unsigned int>& target, | |
39 unsigned int current) | |
40 { | |
41 if (current >= itemsCount_) | |
42 { | |
43 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
44 } | |
45 | |
46 target.clear(); | |
47 target.reserve(itemsCount_); | |
48 target.push_back(current); | |
49 | |
50 const unsigned int countBelow = current; | |
51 const unsigned int countAbove = (itemsCount_ - 1) - current; | |
52 const unsigned int n = std::min(countBelow, countAbove); | |
53 | |
54 for (unsigned int i = 1; i <= n; i++) | |
55 { | |
56 assert(current + i < itemsCount_ && | |
57 current >= i); | |
58 target.push_back(current + i); | |
59 target.push_back(current - i); | |
60 } | |
61 | |
62 for (unsigned int i = current - n; i > 0; i--) | |
63 { | |
64 target.push_back(i - 1); | |
65 } | |
66 | |
67 for (unsigned int i = current + n + 1; i < itemsCount_; i++) | |
68 { | |
69 target.push_back(i); | |
70 } | |
71 | |
72 assert(target.size() == itemsCount_); | |
73 } | |
74 } |