/usr/include/ql/grid.hpp is in libquantlib0-dev 1.4-2+b1.
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 | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2001, 2002, 2003 Sadruddin Rejeb
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
<http://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 grid.hpp
\brief Grid constructors
*/
#ifndef quantlib_grid_hpp
#define quantlib_grid_hpp
#include <ql/math/array.hpp>
namespace QuantLib {
Disposable<Array> CenteredGrid(Real center, Real dx, Size steps);
Disposable<Array> BoundedGrid(Real xMin, Real xMax, Size steps);
Disposable<Array> BoundedLogGrid(Real xMin, Real xMax, Size steps);
// inline definitions
inline Disposable<Array> CenteredGrid(Real center, Real dx,
Size steps) {
Array result(steps+1);
for (Size i=0; i<steps+1; i++)
result[i] = center + (i - steps/2.0)*dx;
return result;
}
inline Disposable<Array> BoundedGrid(Real xMin, Real xMax,
Size steps) {
Array result(steps+1);
Real x=xMin, dx=(xMax-xMin)/steps;
for (Size i=0; i<steps+1; i++, x+=dx)
result[i] = x;
return result;
}
inline Disposable<Array> BoundedLogGrid(Real xMin, Real xMax,
Size steps) {
Array result(steps+1);
Real gridLogSpacing = (std::log(xMax) - std::log(xMin)) /
(steps);
Real edx = std::exp(gridLogSpacing);
result[0] = xMin;
for (Size j=1; j < steps+1; j++) {
result[j] = result[j-1]*edx;
}
return result;
}
}
#endif
|