/usr/include/OpenMS/DATASTRUCTURES/DPosition.h is in libopenms-dev 1.11.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universitaet Berlin 2002-2013.
//
// This software is released under a three-clause BSD license:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of any author or any participating institution
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
// For a full list of authors, refer to the file AUTHORS.
// --------------------------------------------------------------------------
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL ANY OF THE AUTHORS OR THE CONTRIBUTING
// INSTITUTIONS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// --------------------------------------------------------------------------
// $Maintainer: Stephan Aiche$
// $Authors: Marc Sturm, Stephan Aiche $
// --------------------------------------------------------------------------
#ifndef OPENMS_DATASTRUCTURES_DPOSITION_H
#define OPENMS_DATASTRUCTURES_DPOSITION_H
#include <OpenMS/config.h>
#include <OpenMS/CONCEPT/Macros.h>
#include <algorithm>
#include <limits>
namespace OpenMS
{
/**
@brief Representation of a coordinate in D-dimensional space.
@ingroup Datastructures
*/
template <UInt D, typename TCoordinateType = DoubleReal>
class DPosition
{
public:
/// Coordinate type
typedef TCoordinateType CoordinateType;
/// Mutable iterator
typedef CoordinateType * Iterator;
/// Non-mutable iterator
typedef const CoordinateType * ConstIterator;
/// Dimensions
enum
{
DIMENSION = D
};
/**
@name STL compatibility type definitions
*/
//@{
typedef CoordinateType value_type;
typedef CoordinateType & reference;
typedef CoordinateType * pointer;
typedef CoordinateType * iterator;
typedef const CoordinateType * const_iterator;
//@}
/**
@name Constructors and Destructor
*/
//@{
/**
@brief Default constructor.
Creates a position with all coordinates zero.
*/
DPosition()
{
clear();
}
/// Destructor (not-virtual as this will save a lot of space!)
~DPosition()
{
}
/// Constructor that fills all dimensions with the value @p x
DPosition(CoordinateType x)
{
std::fill(&(coordinate_[0]), &(coordinate_[D]), x);
}
/// Copy constructor
DPosition(const DPosition & pos)
{
std::copy(&(pos.coordinate_[0]), &(pos.coordinate_[D]),
&(coordinate_[0]));
}
/// Constructor only for DPosition<2> that takes two Coordinates.
DPosition(CoordinateType x, CoordinateType y)
{
OPENMS_PRECONDITION(D == 2, "DPosition<D, TCoordinateType>:DPosition(x,y): index overflow!");
coordinate_[0] = x;
coordinate_[1] = y;
}
/// Assignment operator
DPosition & operator=(const DPosition & source)
{
if (&source == this) return *this;
std::copy(&(source.coordinate_[0]), &(source.coordinate_[D]),
&(coordinate_[0]));
return *this;
}
//@}
/**@name Accessors */
//@{
///Const accessor for the dimensions
CoordinateType operator[](Size index) const
{
OPENMS_PRECONDITION(index < D, "DPosition<D,TCoordinateType>:operator [] (Position): index overflow!");
return coordinate_[index];
}
///Accessor for the dimensions
CoordinateType & operator[](Size index)
{
OPENMS_PRECONDITION(index < D, "DPosition<D,TCoordinateType>:operator [] (Position): index overflow!");
return coordinate_[index];
}
///Name accessor for the first dimension. Only for DPosition<2>, for visualization.
CoordinateType getX() const
{
OPENMS_PRECONDITION(D == 2, "DPosition<D,TCoordinateType>:getX(): index overflow!");
return coordinate_[0];
}
///Name accessor for the second dimension. Only for DPosition<2>, for visualization.
CoordinateType getY() const
{
OPENMS_PRECONDITION(D == 2, "DPosition<D,TCoordinateType>:getY(): index overflow!");
return coordinate_[1];
}
///Name mutator for the first dimension. Only for DPosition<2>, for visualization.
void setX(CoordinateType c)
{
OPENMS_PRECONDITION(D == 2, "DPosition<D,TCoordinateType>:setX(): index overflow!");
coordinate_[0] = c;
}
///Name mutator for the second dimension. Only for DPosition<2>, for visualization.
void setY(CoordinateType c)
{
OPENMS_PRECONDITION(D == 2, "DPosition<D,TCoordinateType>:setY(): index overflow!");
coordinate_[1] = c;
}
/// Equality operator
bool operator==(const DPosition & point) const
{
for (Size i = 0; i < D; i++)
{
if (coordinate_[i] != point.coordinate_[i]) return false;
}
return true;
}
/// Equality operator
bool operator!=(const DPosition & point) const
{
return !(operator==(point));
}
/**
@brief Lexicographical less than operator.
Lexicographical comparison from dimension 0 to dimension D-1 is done.
*/
bool operator<(const DPosition & point) const
{
for (Size i = 0; i < D; i++)
{
if (coordinate_[i] < point.coordinate_[i]) return true;
if (coordinate_[i] > point.coordinate_[i]) return false;
}
return false;
}
/// Lexicographical greater less or equal operator.
bool operator<=(const DPosition & point) const
{
for (Size i = 0; i < D; i++)
{
if (coordinate_[i] < point.coordinate_[i]) return true;
if (coordinate_[i] > point.coordinate_[i]) return false;
}
return true;
}
/// Spatially (geometrically) less or equal operator. All coordinates must be "<=".
bool spatiallyLessEqual(const DPosition & point) const
{
for (Size i = 0; i < D; i++)
{
if (coordinate_[i] > point.coordinate_[i]) return false;
}
return true;
}
/// Spatially (geometrically) greater or equal operator. All coordinates must be ">=".
bool spatiallyGreaterEqual(const DPosition & point) const
{
for (Size i = 0; i < D; i++)
{
if (coordinate_[i] < point.coordinate_[i]) return false;
}
return true;
}
/// Lexicographical greater than operator.
bool operator>(const DPosition & point) const
{
return !(operator<=(point));
}
/// Lexicographical greater or equal operator.
bool operator>=(const DPosition & point) const
{
return !operator<(point);
}
/// Addition (a bit inefficient)
DPosition operator+(const DPosition & point) const
{
DPosition result(*this);
for (Size i = 0; i < D; ++i)
{
result.coordinate_[i] += point.coordinate_[i];
}
return result;
}
/// Addition
DPosition & operator+=(const DPosition & point)
{
for (Size i = 0; i < D; ++i)
{
coordinate_[i] += point.coordinate_[i];
}
return *this;
}
/// Subtraction (a bit inefficient)
DPosition operator-(const DPosition & point) const
{
DPosition result(*this);
for (Size i = 0; i < D; ++i)
{
result.coordinate_[i] -= point.coordinate_[i];
}
return result;
}
/// Subtraction
DPosition & operator-=(const DPosition & point)
{
for (Size i = 0; i < D; ++i)
{
coordinate_[i] -= point.coordinate_[i];
}
return *this;
}
/// Negation (a bit inefficient)
DPosition operator - () const
{
DPosition<D, CoordinateType> result(*this);
for (Size i = 0; i < D; ++i)
{
result.coordinate_[i] = -result.coordinate_[i];
}
return result;
}
/// Inner product
CoordinateType operator*(const DPosition & point) const
{
CoordinateType prod(0);
for (Size i = 0; i < D; ++i)
{
prod += (point.coordinate_[i] * coordinate_[i]);
}
return prod;
}
/// Scalar multiplication
DPosition & operator*=(CoordinateType scalar)
{
for (Size i = 0; i < D; ++i)
{
coordinate_[i] *= scalar;
}
return *this;
}
/// Scalar division
DPosition & operator/=(CoordinateType scalar)
{
for (Size i = 0; i < D; ++i)
{
coordinate_[i] /= scalar;
}
return *this;
}
/// Returns the number of dimensions
static Size size()
{
return D;
}
/// Set all dimensions to zero
void clear()
{
for (Size i = 0; i < D; ++i)
{
coordinate_[i] = (CoordinateType) 0;
}
}
//@}
/** @name Static values */
//@{
/// all zero
inline static const DPosition zero()
{
return DPosition(0);
}
/// smallest positive
inline static const DPosition minPositive()
{
return DPosition((std::numeric_limits<typename DPosition::CoordinateType>::min)());
}
/// smallest negative
inline static const DPosition minNegative()
{
return DPosition(-(std::numeric_limits<typename DPosition::CoordinateType>::max)());
}
/// largest positive
inline static const DPosition maxPositive()
{
return DPosition((std::numeric_limits<typename DPosition::CoordinateType>::max)());
}
//@}
/** @name Iteration */
//@{
/// Non-mutable begin iterator
ConstIterator begin() const
{
return &(coordinate_[0]);
}
/// Non-mutable end iterator
ConstIterator end() const
{
return &(coordinate_[0]) + D;
}
/// Mutable begin iterator
Iterator begin()
{
return &(coordinate_[0]);
}
/// Mutable end iterator
Iterator end()
{
return &(coordinate_[0]) + D;
}
//@}
protected:
CoordinateType coordinate_[D];
}; // DPosition
/// Scalar multiplication (a bit inefficient)
template <UInt D, typename TCoordinateType>
DPosition<D, TCoordinateType> operator*(DPosition<D, TCoordinateType> position, typename DPosition<D, TCoordinateType>::CoordinateType scalar)
{
for (Size i = 0; i < D; ++i)
{
position[i] *= scalar;
}
return position;
}
/// Scalar multiplication (a bit inefficient)
template <UInt D, typename TCoordinateType>
DPosition<D, TCoordinateType> operator*(typename DPosition<D, TCoordinateType>::CoordinateType scalar, DPosition<D, TCoordinateType> position)
{
for (Size i = 0; i < D; ++i)
{
position[i] *= scalar;
}
return position;
}
/// Scalar multiplication (a bit inefficient)
template <UInt D, typename TCoordinateType>
DPosition<D, TCoordinateType> operator/(DPosition<D, TCoordinateType> position, typename DPosition<D, TCoordinateType>::CoordinateType scalar)
{
for (Size i = 0; i < D; ++i)
{
position[i] /= scalar;
}
return position;
}
/// Print the contents to a stream.
template <UInt D, typename TCoordinateType>
std::ostream & operator<<(std::ostream & os, const DPosition<D, TCoordinateType> & pos)
{
os << precisionWrapper(pos[0]);
for (UInt i = 1; i < D; ++i)
{
os << ' ' << precisionWrapper(pos[i]);
}
return os;
}
} // namespace OpenMS
#endif // OPENMS_DATASTRUCTURES_DPOSITION_H
|