Mercurial > hg > orthanc-wsi
annotate Framework/Enumerations.h @ 247:ad51ab8e1b2f
stop forcing C++11 in CMake
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Tue, 07 Dec 2021 12:41:52 +0100 |
parents | 49f647ed1b4c |
children | 20a730889ae2 |
rev | line source |
---|---|
0 | 1 /** |
2 * Orthanc - A Lightweight, RESTful DICOM Store | |
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
4 * Department, University Hospital of Liege, Belgium | |
214
1e864138f0da
upgrade to year 2021
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
192
diff
changeset
|
5 * Copyright (C) 2017-2021 Osimis S.A., Belgium |
242
49f647ed1b4c
added copyright UCLouvain
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
217
diff
changeset
|
6 * Copyright (C) 2021-2021 Sebastien Jodogne, ICTEAM UCLouvain, Belgium |
0 | 7 * |
8 * This program is free software: you can redistribute it and/or | |
9 * modify it under the terms of the GNU Affero General Public License | |
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 | |
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 * Affero General Public License for more details. | |
17 * | |
18 * You should have received a copy of the GNU Affero General Public License | |
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
20 **/ | |
21 | |
22 | |
23 #pragma once | |
24 | |
192 | 25 #include <Enumerations.h> |
0 | 26 |
27 #include <stdint.h> | |
28 #include <string> | |
29 | |
30 namespace OrthancWSI | |
31 { | |
217
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
32 // WARNING - Don't change the enum values below, as this would break |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
33 // serialization of "DicomPyramidInstance" |
0 | 34 enum ImageCompression |
35 { | |
217
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
36 ImageCompression_Unknown = 1, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
37 ImageCompression_None = 2, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
38 ImageCompression_Dicom = 3, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
39 ImageCompression_Png = 4, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
40 ImageCompression_Jpeg = 5, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
41 ImageCompression_Jpeg2000 = 6, |
20bc074ec19a
Viewer can display DICOM pyramids whose tile sizes vary across levels
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
214
diff
changeset
|
42 ImageCompression_Tiff = 7 |
0 | 43 }; |
44 | |
45 enum OpticalPath | |
46 { | |
47 OpticalPath_None, | |
48 OpticalPath_Brightfield | |
49 }; | |
50 | |
51 const char* EnumerationToString(ImageCompression compression); | |
52 | |
53 ImageCompression DetectFormatFromFile(const std::string& path); | |
54 | |
55 ImageCompression DetectFormatFromMemory(const void* buffer, | |
56 size_t size); | |
57 | |
58 inline unsigned int CeilingDivision(unsigned int a, | |
59 unsigned int b) | |
60 { | |
61 if (a % b == 0) | |
62 { | |
63 return a / b; | |
64 } | |
65 else | |
66 { | |
67 return a / b + 1; | |
68 } | |
69 } | |
70 } |