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
|
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2003 RiskMap srl
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it
under the terms of the QuantLib license. You should have received a
copy of the license along with this program; if not, please email
<quantlib-dev@lists.sf.net>. The license is also available online at
<https://www.quantlib.org/license.shtml>.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
/*! \file lazyobject.hpp
\brief framework for calculation on demand and result caching
*/
#ifndef quantlib_lazy_object_h
#define quantlib_lazy_object_h
#include <ql/patterns/observable.hpp>
#include <ql/shared_ptr.hpp>
namespace QuantLib {
//! Framework for calculation on demand and result caching.
/*! \ingroup patterns */
class LazyObject : public virtual Observable,
public virtual Observer {
public:
LazyObject();
~LazyObject() override = default;
//! \name Observer interface
//@{
void update() override;
//@}
/*! Returns true if the instrument is calculated */
bool isCalculated() const;
/*! \name Calculations
These methods do not modify the structure of the object
and are therefore declared as <tt>const</tt>. Data members
which will be calculated on demand need to be declared as
mutable.
*/
//@{
/*! This method force the recalculation of any results which
would otherwise be cached. It is not declared as
<tt>const</tt> since it needs to call the
non-<tt>const</tt> <i><b>notifyObservers</b></i> method.
\note Explicit invocation of this method is <b>not</b>
necessary if the object registered itself as
observer with the structures on which such results
depend. It is strongly advised to follow this
policy when possible.
*/
void recalculate();
/*! This method constrains the object to return the presently
cached results on successive invocations, even if
arguments upon which they depend should change.
*/
void freeze();
/*! This method reverts the effect of the <i><b>freeze</b></i>
method, thus re-enabling recalculations.
*/
void unfreeze();
protected:
/*! This method performs all needed calculations by calling
the <i><b>performCalculations</b></i> method.
\warning Objects cache the results of the previous
calculation. Such results will be returned upon
later invocations of
<i><b>calculate</b></i>. When the results depend
on arguments which could change between
invocations, the lazy object must register itself
as observer of such objects for the calculations
to be performed again when they change.
\warning Should this method be redefined in derived
classes, LazyObject::calculate() should be called
in the overriding method.
*/
virtual void calculate() const;
/*! This method must implement any calculations which must be
(re)done in order to calculate the desired results.
*/
virtual void performCalculations() const = 0;
//@}
public:
//! \name Notification settings
//@{
/*! This method causes the object to forward the first notification received,
and discard the others until recalculated; the rationale is that observers
were already notified, and don't need further notifications until they
recalculate, at which point this object would be recalculated too.
After recalculation, this object would again forward the first notification
received.
Although not always correct, this behavior is a lot faster
and thus is the current default. The default can be
changed at compile time, or at at run time by calling
`LazyObject::Defaults::instance().alwaysForwardNotifications()`;
the run-time change won't affect lazy objects already created.
*/
void forwardFirstNotificationOnly();
/*! This method causes the object to forward all notifications received.
Although safer, this behavior is a lot slower and thus
usually not the default. The default can be changed at
compile time, or at run-time by calling
`LazyObject::Defaults::instance().alwaysForwardNotifications()`;
the run-time change won't affect lazy objects already
created.
*/
void alwaysForwardNotifications();
//@}
protected:
mutable bool calculated_ = false, frozen_ = false, alwaysForward_;
private:
bool updating_ = false;
class UpdateChecker { // NOLINT(cppcoreguidelines-special-member-functions)
LazyObject* subject_;
public:
explicit UpdateChecker(LazyObject* subject) : subject_(subject) {
subject_->updating_ = true;
}
~UpdateChecker() {
subject_->updating_ = false;
}
};
public:
class Defaults;
};
//! Per-session settings for the LazyObject class
class LazyObject::Defaults : public Singleton<LazyObject::Defaults> {
friend class Singleton<LazyObject::Defaults>;
private:
Defaults() = default;
public:
/*! by default, lazy objects created after calling this method
will only forward the first notification after successful
recalculation; see
LazyObject::forwardFirstNotificationOnly for details.
*/
void forwardFirstNotificationOnly() {
forwardsAllNotifications_ = false;
}
/*! by default, lazy objects created after calling this method
will always forward notifications; see
LazyObject::alwaysForwardNotifications for details.
*/
void alwaysForwardNotifications() {
forwardsAllNotifications_ = true;
}
//! returns the current default
bool forwardsAllNotifications() const {
return forwardsAllNotifications_;
}
private:
#ifdef QL_FASTER_LAZY_OBJECTS
bool forwardsAllNotifications_ = false;
#else
bool forwardsAllNotifications_ = true;
#endif
};
// inline definitions
inline LazyObject::LazyObject()
: alwaysForward_(LazyObject::Defaults::instance().forwardsAllNotifications()) {}
inline void LazyObject::update() {
if (updating_) {
#ifdef QL_THROW_IN_CYCLES
QL_FAIL("recursive notification loop detected; you probably created an object cycle");
#else
return;
#endif
}
// This sets updating to true (so the above check breaks the
// infinite loop if we enter this method recursively) and will
// set it back to false when we exit this scope, either
// successfully or because of an exception.
UpdateChecker checker(this);
// forwards notifications only the first time
if (calculated_ || alwaysForward_) {
// set to false early
// 1) to prevent infinite recursion
// 2) otherways non-lazy observers would be served obsolete
// data because of calculated_ being still true
calculated_ = false;
// observers don't expect notifications from frozen objects
if (!frozen_)
notifyObservers();
// exiting notifyObservers() calculated_ could be
// already true because of non-lazy observers
}
}
inline void LazyObject::recalculate() {
bool wasFrozen = frozen_;
calculated_ = frozen_ = false;
try {
calculate();
} catch (...) {
frozen_ = wasFrozen;
notifyObservers();
throw;
}
frozen_ = wasFrozen;
notifyObservers();
}
inline void LazyObject::freeze() {
frozen_ = true;
}
inline void LazyObject::unfreeze() {
// send notifications, just in case we lost any,
// but only once, i.e. if it was frozen
if (frozen_) {
frozen_ = false;
notifyObservers();
}
}
inline void LazyObject::forwardFirstNotificationOnly() {
alwaysForward_ = false;
}
inline void LazyObject::alwaysForwardNotifications() {
alwaysForward_ = true;
}
inline void LazyObject::calculate() const {
if (!calculated_ && !frozen_) {
calculated_ = true; // prevent infinite recursion in
// case of bootstrapping
try {
performCalculations();
} catch (...) {
calculated_ = false;
throw;
}
}
}
inline bool LazyObject::isCalculated() const {
return calculated_;
}
}
#endif
|