| 1 | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
|---|
| 2 | |
|---|
| 3 | /* |
|---|
| 4 | Copyright (C) 2008 Roland Lichters |
|---|
| 5 | |
|---|
| 6 | This file is part of QuantLib, a free-software/open-source library |
|---|
| 7 | for financial quantitative analysts and developers - http://quantlib.org/ |
|---|
| 8 | |
|---|
| 9 | QuantLib is free software: you can redistribute it and/or modify it |
|---|
| 10 | under the terms of the QuantLib license. You should have received a |
|---|
| 11 | copy of the license along with this program; if not, please email |
|---|
| 12 | <quantlib-dev@lists.sf.net>. The license is also available online at |
|---|
| 13 | <http://quantlib.org/license.shtml>. |
|---|
| 14 | |
|---|
| 15 | This program is distributed in the hope that it will be useful, but WITHOUT |
|---|
| 16 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
|---|
| 17 | FOR A PARTICULAR PURPOSE. See the license for more details. |
|---|
| 18 | */ |
|---|
| 19 | |
|---|
| 20 | /*! \file loss.hpp |
|---|
| 21 | \brief Pair of loss time and amount, sortable by loss time |
|---|
| 22 | */ |
|---|
| 23 | |
|---|
| 24 | #ifndef quantlib_loss_hpp |
|---|
| 25 | #define quantlib_loss_hpp |
|---|
| 26 | |
|---|
| 27 | #include <ql/types.hpp> |
|---|
| 28 | |
|---|
| 29 | namespace QuantLib { |
|---|
| 30 | |
|---|
| 31 | class Loss { |
|---|
| 32 | public: |
|---|
| 33 | Loss(Real t = 0.0, Real a = 0.0) : time(t), amount(a) {}; |
|---|
| 34 | Real time, amount; |
|---|
| 35 | }; |
|---|
| 36 | |
|---|
| 37 | inline bool operator<(const Loss& l1, const Loss& l2) { |
|---|
| 38 | return (l1.time < l2.time); |
|---|
| 39 | } |
|---|
| 40 | inline bool operator>(const Loss& l1, const Loss& l2) { |
|---|
| 41 | return (l1.time > l2.time); |
|---|
| 42 | } |
|---|
| 43 | inline bool operator==(const Loss& l1, const Loss& l2) { |
|---|
| 44 | return (l1.time == l2.time); |
|---|
| 45 | } |
|---|
| 46 | inline bool operator!=(const Loss& l1, const Loss& l2) { |
|---|
| 47 | return (l1.time != l2.time); |
|---|
| 48 | } |
|---|
| 49 | |
|---|
| 50 | } |
|---|
| 51 | |
|---|
| 52 | #endif |
|---|
| 53 | |
|---|
