Mercurial > hg > orthanc-stone
annotate Framework/Loaders/BasicFetchingStrategy.cpp @ 872:733c6db3e5a3 am-dev
limiting the size of the cache
| author | Alain Mazy <alain@mazy.be> |
|---|---|
| date | Mon, 01 Jul 2019 13:36:51 +0200 |
| parents | f8d582fc5731 |
| children | 2d8ab34c8c91 |
| 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 | |
| 5 * Copyright (C) 2017-2019 Osimis S.A., Belgium | |
| 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 "BasicFetchingStrategy.h" | |
| 23 | |
| 24 #include <Core/OrthancException.h> | |
| 25 | |
| 26 namespace OrthancStone | |
| 27 { | |
| 28 void BasicFetchingStrategy::Schedule(unsigned int item, | |
| 29 unsigned int quality) | |
| 30 { | |
| 31 assert(item < GetItemsCount() && | |
| 32 quality <= maxQuality_); | |
| 33 | |
| 34 if (nextQuality_[item] <= quality) | |
| 35 { | |
| 36 content_.push_back(ContentItem(item, quality)); | |
| 37 } | |
| 38 } | |
| 39 | |
| 40 | |
| 41 BasicFetchingStrategy::BasicFetchingStrategy(IFetchingItemsSorter* sorter, // Takes ownership | |
| 42 unsigned int maxQuality) : | |
| 43 sorter_(sorter), | |
| 44 maxQuality_(maxQuality), | |
| 45 position_(0), | |
| 46 blockSize_(2) | |
| 47 { | |
| 48 if (sorter == NULL) | |
| 49 { | |
| 50 throw Orthanc::OrthancException(Orthanc::ErrorCode_NullPointer); | |
| 51 } | |
| 52 | |
|
709
7457b4ee1f29
VolumeSeriesOrthancLoader uses a prefetching strategy
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
708
diff
changeset
|
53 nextQuality_.resize(sorter_->GetItemsCount(), 0); // Does not change along calls to "SetCurrent()" |
| 708 | 54 |
|
709
7457b4ee1f29
VolumeSeriesOrthancLoader uses a prefetching strategy
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
708
diff
changeset
|
55 SetCurrent(0); |
| 708 | 56 } |
| 57 | |
| 58 | |
| 59 void BasicFetchingStrategy::SetBlockSize(unsigned int size) | |
| 60 { | |
| 61 if (size <= 0) | |
| 62 { | |
| 63 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
| 64 } | |
| 65 | |
| 66 blockSize_ = size; | |
| 67 } | |
| 68 | |
| 69 | |
| 70 bool BasicFetchingStrategy::GetNext(unsigned int& item, | |
| 71 unsigned int& quality) | |
| 72 { | |
| 73 if (position_ >= content_.size()) | |
| 74 { | |
| 75 return false; | |
| 76 } | |
| 77 else | |
| 78 { | |
| 79 item = content_[position_].GetItem(); | |
| 80 quality = content_[position_].GetQuality(); | |
| 81 | |
| 82 assert(nextQuality_[item] <= quality); | |
| 83 nextQuality_[item] = quality + 1; | |
| 84 | |
| 85 position_ ++; | |
| 86 return true; | |
| 87 } | |
| 88 } | |
| 89 | |
| 90 | |
| 91 void BasicFetchingStrategy::SetCurrent(unsigned int item) | |
| 92 { | |
| 93 // TODO - This function is O(N) complexity where "N" is the | |
| 94 // number of items times the max quality. Could use a LRU index. | |
| 95 | |
| 96 position_ = 0; | |
| 97 | |
| 98 std::vector<unsigned int> v; | |
| 99 sorter_->Sort(v, item); | |
| 100 | |
| 101 assert(v.size() == GetItemsCount()); | |
| 102 | |
| 103 if (v.size() == 0) | |
| 104 { | |
| 105 return; | |
| 106 } | |
| 107 | |
| 108 content_.clear(); | |
| 109 content_.reserve(v.size() * maxQuality_); | |
| 110 | |
| 111 Schedule(v.front(), maxQuality_); | |
| 112 | |
| 113 for (unsigned int q = 0; q <= maxQuality_; q++) | |
| 114 { | |
| 115 unsigned int start = 1 + q * blockSize_; | |
| 116 unsigned int end = start + blockSize_; | |
| 117 | |
| 118 if (q == maxQuality_ || | |
| 119 end > v.size()) | |
| 120 { | |
| 725 | 121 end = static_cast<int>(v.size()); |
| 708 | 122 } |
| 123 | |
| 124 unsigned int a = 0; | |
| 125 if (maxQuality_ >= q + 1) | |
| 126 { | |
| 127 a = maxQuality_ - q - 1; | |
| 128 } | |
| 129 | |
| 130 for (unsigned int j = a; j <= maxQuality_; j++) | |
| 131 { | |
| 132 for (unsigned int i = start; i < end; i++) | |
| 133 { | |
| 134 Schedule(v[i], j); | |
| 135 } | |
| 136 } | |
| 137 } | |
| 138 } | |
| 139 | |
| 140 | |
| 141 void BasicFetchingStrategy::RecycleFurthest(unsigned int& item) | |
| 142 { | |
| 143 throw Orthanc::OrthancException(Orthanc::ErrorCode_NotImplemented); | |
| 144 } | |
| 145 } |