Mercurial > hg > orthanc-stone
annotate OrthancStone/Sources/Loaders/IFetchingStrategy.h @ 1574:fb5e620430ae
fix
| author | Sebastien Jodogne <s.jodogne@gmail.com> |
|---|---|
| date | Mon, 21 Sep 2020 18:29:53 +0200 |
| parents | 244ad1e4e76a |
| children | 4fb8fdf03314 |
| 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 #pragma once | |
| 23 | |
| 24 #include <boost/noncopyable.hpp> | |
| 25 | |
| 26 namespace OrthancStone | |
| 27 { | |
| 28 class IFetchingStrategy : public boost::noncopyable | |
| 29 { | |
| 30 public: | |
| 31 virtual ~IFetchingStrategy() | |
| 32 { | |
| 33 } | |
| 34 | |
| 35 virtual unsigned int GetItemsCount() const = 0; | |
| 36 | |
| 37 virtual unsigned int GetMaxQuality() const = 0; | |
| 38 | |
| 39 virtual bool GetNext(unsigned int& item, | |
| 40 unsigned int& quality) = 0; | |
| 41 | |
| 42 virtual void SetCurrent(unsigned int item) = 0; | |
| 43 | |
| 44 // Ask the strategy to re-schedule the item with the lowest | |
| 45 // priority in the fetching order. This allows to know which item | |
| 46 // should be dropped from a cache. | |
| 47 virtual void RecycleFurthest(unsigned int& item) = 0; | |
| 48 }; | |
| 49 }; |