Mercurial > hg > orthanc-stone
annotate OrthancStone/Sources/Loaders/BasicFetchingItemsSorter.cpp @ 1802:757987cb5a68
recycling of layers in MacroSceneLayer
| author | Sebastien Jodogne <s.jodogne@gmail.com> |
|---|---|
| date | Thu, 20 May 2021 13:58:26 +0200 |
| parents | 9ac2a65d4172 |
| children | 3889ae96d2e9 |
| 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 | |
|
1739
9ac2a65d4172
upgrade to year 2021
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1628
diff
changeset
|
5 * Copyright (C) 2017-2021 Osimis S.A., Belgium |
| 708 | 6 * |
| 7 * 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
|
8 * modify it under the terms of the GNU Lesser General Public License |
| 708 | 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 | |
|
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
|
14 * 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
|
15 * Lesser General Public License for more details. |
|
1596
4fb8fdf03314
removed annoying whitespace
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1512
diff
changeset
|
16 * |
|
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
|
17 * 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
|
18 * 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
|
19 * <http://www.gnu.org/licenses/>. |
| 708 | 20 **/ |
| 21 | |
| 22 | |
| 23 #include "BasicFetchingItemsSorter.h" | |
| 24 | |
|
1455
30deba7bc8e2
simplifying include_directories
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1270
diff
changeset
|
25 #include <OrthancException.h> |
| 708 | 26 |
| 1628 | 27 #include <algorithm> |
| 1624 | 28 #include <cassert> |
| 29 | |
| 708 | 30 namespace OrthancStone |
| 31 { | |
| 32 BasicFetchingItemsSorter::BasicFetchingItemsSorter(unsigned int itemsCount) : | |
| 33 itemsCount_(itemsCount) | |
| 34 { | |
| 35 if (itemsCount == 0) | |
| 36 { | |
| 37 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
| 38 } | |
| 39 } | |
| 40 | |
| 41 | |
| 42 void BasicFetchingItemsSorter::Sort(std::vector<unsigned int>& target, | |
| 43 unsigned int current) | |
| 44 { | |
| 45 if (current >= itemsCount_) | |
| 46 { | |
| 47 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
| 48 } | |
| 49 | |
| 50 target.clear(); | |
| 51 target.reserve(itemsCount_); | |
| 52 target.push_back(current); | |
| 53 | |
| 54 const unsigned int countBelow = current; | |
| 55 const unsigned int countAbove = (itemsCount_ - 1) - current; | |
| 56 const unsigned int n = std::min(countBelow, countAbove); | |
| 57 | |
| 58 for (unsigned int i = 1; i <= n; i++) | |
| 59 { | |
| 60 assert(current + i < itemsCount_ && | |
| 61 current >= i); | |
| 62 target.push_back(current + i); | |
| 63 target.push_back(current - i); | |
| 64 } | |
| 65 | |
| 66 for (unsigned int i = current - n; i > 0; i--) | |
| 67 { | |
| 68 target.push_back(i - 1); | |
| 69 } | |
| 70 | |
| 71 for (unsigned int i = current + n + 1; i < itemsCount_; i++) | |
| 72 { | |
| 73 target.push_back(i); | |
| 74 } | |
| 75 | |
| 76 assert(target.size() == itemsCount_); | |
| 77 } | |
| 78 } |