QuantLib: a free/open-source library for quantitative finance
fully annotated source code - version 1.34
Loading...
Searching...
No Matches
utilities.hpp
Go to the documentation of this file.
1/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2
3/*
4 Copyright (C) 2007 Ferdinando Ametrano
5 Copyright (C) 2006 Mark Joshi
6
7 This file is part of QuantLib, a free-software/open-source library
8 for financial quantitative analysts and developers - http://quantlib.org/
9
10 QuantLib is free software: you can redistribute it and/or modify it
11 under the terms of the QuantLib license. You should have received a
12 copy of the license along with this program; if not, please email
13 <quantlib-dev@lists.sf.net>. The license is also available online at
14 <http://quantlib.org/license.shtml>.
15
16 This program is distributed in the hope that it will be useful, but WITHOUT
17 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
18 FOR A PARTICULAR PURPOSE. See the license for more details.
19*/
20
21
22#ifndef quantlib_market_model_utilities_hpp
23#define quantlib_market_model_utilities_hpp
24
25#include <ql/types.hpp>
26#include <vector>
27#include <valarray>
28
29namespace QuantLib {
30
31 void mergeTimes(const std::vector<std::vector<Time> >& times,
32 std::vector<Time>& mergedTimes,
33 std::vector<std::valarray<bool> >& isPresent);
34
35 /*! Look for elements of a set in a subset.
36 Returns a vector of booleans such that:
37 element set[i] present/not present in subset.
38
39 \pre both vectors must be strictly increasing.
40 */
41 std::valarray<bool> isInSubset(const std::vector<Time>& set,
42 const std::vector<Time>& subset);
43
44 //! check for strictly increasing times, first time greater than zero
45 void checkIncreasingTimes(const std::vector<Time>& times);
46 void checkIncreasingTimesAndCalculateTaus(const std::vector<Time>& times,
47 std::vector<Time>& taus);
48}
49
50#endif
Definition: any.hpp:35
std::valarray< bool > isInSubset(const std::vector< Time > &set, const std::vector< Time > &subset)
Definition: utilities.cpp:56
void mergeTimes(const std::vector< std::vector< Time > > &times, std::vector< Time > &mergedTimes, std::vector< std::valarray< bool > > &isPresent)
Definition: utilities.cpp:29
void checkIncreasingTimesAndCalculateTaus(const std::vector< Time > &times, std::vector< Time > &taus)
Definition: utilities.cpp:106
void checkIncreasingTimes(const std::vector< Time > &times)
check for strictly increasing times, first time greater than zero
Definition: utilities.cpp:92
Custom types.