Mercurial > hg > orthanc-stone
annotate OrthancStone/Sources/Loaders/BasicFetchingItemsSorter.cpp @ 2034:4b24b7533346 deep-learning
cont
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Fri, 27 Jan 2023 15:43:24 +0100 |
parents | 7053b8a0aaec |
children | 07964689cb0b |
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 | |
1871
7053b8a0aaec
upgrade to year 2022
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1870
diff
changeset
|
5 * Copyright (C) 2017-2022 Osimis S.A., Belgium |
7053b8a0aaec
upgrade to year 2022
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1870
diff
changeset
|
6 * Copyright (C) 2021-2022 Sebastien Jodogne, ICTEAM UCLouvain, Belgium |
708 | 7 * |
8 * This program is free software: you can redistribute it and/or | |
1598
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
9 * modify it under the terms of the GNU Lesser General Public License |
708 | 10 * as published by the Free Software Foundation, either version 3 of |
11 * the License, or (at your option) any later version. | |
12 * | |
13 * This program is distributed in the hope that it will be useful, but | |
14 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
1598
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
16 * Lesser General Public License for more details. |
1596
4fb8fdf03314
removed annoying whitespace
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1512
diff
changeset
|
17 * |
1598
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
18 * You should have received a copy of the GNU Lesser General Public |
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
19 * License along with this program. If not, see |
8563ea5d8ae4
relicensing some files, cf. osimis bm26 and chu agreement on 2020-05-20
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1596
diff
changeset
|
20 * <http://www.gnu.org/licenses/>. |
708 | 21 **/ |
22 | |
23 | |
24 #include "BasicFetchingItemsSorter.h" | |
25 | |
1455
30deba7bc8e2
simplifying include_directories
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1270
diff
changeset
|
26 #include <OrthancException.h> |
708 | 27 |
1628 | 28 #include <algorithm> |
1624 | 29 #include <cassert> |
30 | |
708 | 31 namespace OrthancStone |
32 { | |
33 BasicFetchingItemsSorter::BasicFetchingItemsSorter(unsigned int itemsCount) : | |
34 itemsCount_(itemsCount) | |
35 { | |
36 if (itemsCount == 0) | |
37 { | |
38 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
39 } | |
40 } | |
41 | |
42 | |
43 void BasicFetchingItemsSorter::Sort(std::vector<unsigned int>& target, | |
44 unsigned int current) | |
45 { | |
46 if (current >= itemsCount_) | |
47 { | |
48 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
49 } | |
50 | |
51 target.clear(); | |
52 target.reserve(itemsCount_); | |
53 target.push_back(current); | |
54 | |
55 const unsigned int countBelow = current; | |
56 const unsigned int countAbove = (itemsCount_ - 1) - current; | |
57 const unsigned int n = std::min(countBelow, countAbove); | |
58 | |
59 for (unsigned int i = 1; i <= n; i++) | |
60 { | |
61 assert(current + i < itemsCount_ && | |
62 current >= i); | |
63 target.push_back(current + i); | |
64 target.push_back(current - i); | |
65 } | |
66 | |
67 for (unsigned int i = current - n; i > 0; i--) | |
68 { | |
69 target.push_back(i - 1); | |
70 } | |
71 | |
72 for (unsigned int i = current + n + 1; i < itemsCount_; i++) | |
73 { | |
74 target.push_back(i); | |
75 } | |
76 | |
77 assert(target.size() == itemsCount_); | |
78 } | |
79 } |