Mercurial > hg > orthanc-stone
annotate Framework/Toolbox/ParallelSlicesCursor.cpp @ 134:4cff7b1ed31d
upgrade to year 2018
| author | Sebastien Jodogne <s.jodogne@gmail.com> |
|---|---|
| date | Tue, 02 Jan 2018 09:51:36 +0100 |
| parents | 28956ed68280 |
| children | fccffbf99ba1 |
| rev | line source |
|---|---|
| 0 | 1 /** |
| 2 * Stone of Orthanc | |
| 3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
| 4 * Department, University Hospital of Liege, Belgium | |
|
134
4cff7b1ed31d
upgrade to year 2018
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
47
diff
changeset
|
5 * Copyright (C) 2017-2018 Osimis S.A., Belgium |
| 0 | 6 * |
| 7 * This program is free software: you can redistribute it and/or | |
| 47 | 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. | |
| 0 | 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 | |
| 47 | 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 | |
| 0 | 18 * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 19 **/ | |
| 20 | |
| 21 | |
| 22 #include "ParallelSlicesCursor.h" | |
| 23 | |
| 16 | 24 #include "../../Resources/Orthanc/Core/OrthancException.h" |
| 0 | 25 |
| 26 namespace OrthancStone | |
| 27 { | |
| 28 size_t ParallelSlicesCursor::GetDefaultSlice() | |
| 29 { | |
| 30 if (slices_.get() == NULL) | |
| 31 { | |
| 32 return 0; | |
| 33 } | |
| 34 else | |
| 35 { | |
| 36 return slices_->GetSliceCount() / 2; | |
| 37 } | |
| 38 } | |
| 39 | |
| 40 | |
| 41 size_t ParallelSlicesCursor::GetSliceCount() | |
| 42 { | |
| 43 boost::mutex::scoped_lock lock(mutex_); | |
| 44 | |
| 45 if (slices_.get() == NULL) | |
| 46 { | |
| 47 return 0; | |
| 48 } | |
| 49 else | |
| 50 { | |
| 51 return slices_->GetSliceCount(); | |
| 52 } | |
| 53 } | |
| 54 | |
| 55 | |
| 56 SliceGeometry ParallelSlicesCursor::GetSlice(size_t slice) | |
| 57 { | |
| 58 boost::mutex::scoped_lock lock(mutex_); | |
| 59 | |
| 60 if (slices_.get() == NULL) | |
| 61 { | |
| 62 return SliceGeometry(); | |
| 63 } | |
| 64 else | |
| 65 { | |
| 66 return slices_->GetSlice(slice); | |
| 67 } | |
| 68 } | |
| 69 | |
| 70 | |
| 71 void ParallelSlicesCursor::SetGeometry(const ParallelSlices& slices) | |
| 72 { | |
| 73 boost::mutex::scoped_lock lock(mutex_); | |
| 74 | |
| 75 slices_.reset(new ParallelSlices(slices)); | |
| 76 | |
| 77 currentSlice_ = GetDefaultSlice(); | |
| 78 } | |
| 79 | |
| 80 | |
| 81 SliceGeometry ParallelSlicesCursor::GetCurrentSlice() | |
| 82 { | |
| 83 boost::mutex::scoped_lock lock(mutex_); | |
| 84 | |
| 85 if (slices_.get() != NULL && | |
| 86 currentSlice_ < slices_->GetSliceCount()) | |
| 87 { | |
| 88 return slices_->GetSlice(currentSlice_); | |
| 89 } | |
| 90 else | |
| 91 { | |
| 92 return SliceGeometry(); // No slice is available, return the canonical geometry | |
| 93 } | |
| 94 } | |
| 95 | |
| 96 | |
| 97 bool ParallelSlicesCursor::SetDefaultSlice() | |
| 98 { | |
| 99 boost::mutex::scoped_lock lock(mutex_); | |
| 100 | |
| 101 size_t slice = GetDefaultSlice(); | |
| 102 | |
| 103 if (currentSlice_ != slice) | |
| 104 { | |
| 105 currentSlice_ = slice; | |
| 106 return true; | |
| 107 } | |
| 108 else | |
| 109 { | |
| 110 return false; | |
| 111 } | |
| 112 } | |
| 113 | |
| 114 | |
| 115 bool ParallelSlicesCursor::ApplyOffset(SliceOffsetMode mode, | |
| 116 int offset) | |
| 117 { | |
| 118 boost::mutex::scoped_lock lock(mutex_); | |
| 119 | |
| 120 if (slices_.get() == NULL) | |
| 121 { | |
| 122 return false; | |
| 123 } | |
| 124 | |
| 125 int count = slices_->GetSliceCount(); | |
| 126 if (count == 0) | |
| 127 { | |
| 128 return false; | |
| 129 } | |
| 130 | |
| 131 int slice; | |
| 132 if (static_cast<int>(currentSlice_) >= count) | |
| 133 { | |
| 134 slice = count - 1; | |
| 135 } | |
| 136 else | |
| 137 { | |
| 138 slice = currentSlice_; | |
| 139 } | |
| 140 | |
| 141 switch (mode) | |
| 142 { | |
| 143 case SliceOffsetMode_Absolute: | |
| 144 { | |
| 145 slice = offset; | |
| 146 break; | |
| 147 } | |
| 148 | |
| 149 case SliceOffsetMode_Relative: | |
| 150 { | |
| 151 slice += offset; | |
| 152 break; | |
| 153 } | |
| 154 | |
| 155 case SliceOffsetMode_Loop: | |
| 156 { | |
| 157 slice += offset; | |
| 158 while (slice < 0) | |
| 159 { | |
| 160 slice += count; | |
| 161 } | |
| 162 | |
| 163 while (slice >= count) | |
| 164 { | |
| 165 slice -= count; | |
| 166 } | |
| 167 | |
| 168 break; | |
| 169 } | |
| 170 | |
| 171 default: | |
| 172 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange); | |
| 173 } | |
| 174 | |
| 175 if (slice < 0) | |
| 176 { | |
| 177 slice = 0; | |
| 178 } | |
| 179 | |
| 180 if (slice >= count) | |
| 181 { | |
| 182 slice = count - 1; | |
| 183 } | |
| 184 | |
| 185 if (slice != static_cast<int>(currentSlice_)) | |
| 186 { | |
| 187 currentSlice_ = static_cast<int>(slice); | |
| 188 return true; | |
| 189 } | |
| 190 else | |
| 191 { | |
| 192 return false; | |
| 193 } | |
| 194 } | |
| 195 | |
| 196 | |
| 197 bool ParallelSlicesCursor::ApplyWheelEvent(MouseWheelDirection direction, | |
| 198 KeyboardModifiers modifiers) | |
| 199 { | |
| 200 int offset = (modifiers & KeyboardModifiers_Control ? 10 : 1); | |
| 201 | |
| 202 switch (direction) | |
| 203 { | |
| 204 case MouseWheelDirection_Down: | |
| 205 return ApplyOffset(SliceOffsetMode_Relative, -offset); | |
| 206 | |
| 207 case MouseWheelDirection_Up: | |
| 208 return ApplyOffset(SliceOffsetMode_Relative, offset); | |
| 209 | |
| 210 default: | |
| 211 return false; | |
| 212 } | |
| 213 } | |
| 214 | |
| 215 | |
| 216 bool ParallelSlicesCursor::LookupSliceContainingPoint(const Vector& p) | |
| 217 { | |
| 218 boost::mutex::scoped_lock lock(mutex_); | |
| 219 | |
| 220 size_t slice; | |
| 221 double distance; | |
| 222 | |
| 223 if (slices_.get() != NULL && | |
| 224 slices_->ComputeClosestSlice(slice, distance, p)) | |
| 225 { | |
| 226 if (currentSlice_ != slice) | |
| 227 { | |
| 228 currentSlice_ = slice; | |
| 229 return true; | |
| 230 } | |
| 231 } | |
| 232 | |
| 233 return false; | |
| 234 } | |
| 235 } |