multiproductmultistep.cpp

Go to the documentation of this file.

/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
 
/*
 Copyright (C) 2006 Ferdinando Ametrano
 
 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.
*/
 
#include <ql/errors.hpp>
#include <ql/models/marketmodels/products/multiproductmultistep.hpp>
#include <utility>
 
namespace QuantLib {
 
    MultiProductMultiStep::MultiProductMultiStep(std::vector<Time> rateTimes)
    : rateTimes_(std::move(rateTimes)) {
        QL_REQUIRE(rateTimes_.size()>1,
                   "Rate times must contain at least two values");
        Size n = rateTimes_.size()-1;
        std::vector<Time> evolutionTimes(n);
        std::vector<std::pair<Size,Size> > relevanceRates(n);
        for (Size i=0; i<n; ++i) {
            evolutionTimes[i] = rateTimes_[i];
            relevanceRates[i] = std::make_pair(i, i+1);
        }
 
        evolution_ = EvolutionDescription(rateTimes_, evolutionTimes,
                                          relevanceRates);
    }
 
    const EvolutionDescription& MultiProductMultiStep::evolution() const {
        return evolution_;
    }
 
    std::vector<Size> MultiProductMultiStep::suggestedNumeraires() const
    {
        Size n = rateTimes_.size()-1;
        std::vector<Size> numeraires(n);
        // MoneyMarketPlus(1)
        for (Size i=0; i<n; ++i)
            numeraires[i]=i+1;
        return numeraires;
    }
 
}