/*******************************************************************************
*
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
*
* Copyright (C) 2012 by M. Ferrero, O. Parcollet
*
* TRIQS is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* TRIQS 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 GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* TRIQS. If not, see .
*
******************************************************************************/
#ifndef TRIQS_GF_IMTIME_REFREQ_TIMES_H
#define TRIQS_GF_IMTIME_REFREQ_TIMES_H
#include "./tools.hpp"
#include "./gf.hpp"
#include "./imtime.hpp"
#include "./refreq.hpp"
#include "./meshes/product.hpp"
namespace triqs { namespace gfs {
struct refreq_imtime {};
namespace gfs_implementation {
// the mesh
template struct mesh {
typedef typename mesh::type m1_t;
typedef typename mesh::type m2_t;
typedef mesh_product type;
static type make (double wmin, double wmax, size_t n_freq, double beta, statistic_enum S, size_t nt, mesh_kind mk=full_bins ) {
return {make_gf_mesh(wmin,wmax,n_freq), make_gf_mesh(beta,S,nt,mk)};
}
};
// singularity
//template struct singularity { typedef gf type;};
// h5 name
template struct h5_name { static std::string invoke(){ return "GfReFreqImTime";}};
/// --------------------------- data access ---------------------------------
template struct data_proxy : data_proxy_array,1> {};
/// --------------------------- evaluator ---------------------------------
template
struct evaluator {
static constexpr int arity = 2;
template
std::complex operator() (G const * g, double omega, double tau) const {
double beta = std::get<1>(g->mesh().components()).domain().beta;
int p = std::floor(tau/beta);
tau -= p*beta;
size_t n1,n2; double w1,w2; bool in;
std::tie(in, n1, w1) = windowing( std::get<0>(g->mesh().components()),omega);
if (!in) TRIQS_RUNTIME_ERROR <<" Evaluation out of bounds";
std::tie(in, n2, w2) = windowing( std::get<1>(g->mesh().components()),tau);
if (!in) TRIQS_RUNTIME_ERROR <<" Evaluation out of bounds";
auto gg = on_mesh(*g); //[g]( size_t n1, size_t n2) {return g->on_mesh(n1,n2);};
auto res = w1 *( w2*gg(n1,n2) + (1-w2)*gg(n1,n2+1)) + (1-w1) * ( w2*gg(n1+1,n2) + (1-w2)*gg(n1+1,n2+1));
return ((std::get<1>(g->mesh().components()).domain().statistic == Fermion) && (p%2==1) ? -res : res);
}
};
// ------------------------------- Factories --------------------------------------------------
template struct factories {
typedef gf gf_t;
template
static gf_t make_gf(MeshType && m) {
typename gf_t::data_non_view_t A(m.size());
A() =0;
return gf_t (m, std::move(A), nothing(), nothing() ) ;
}
static gf_t make_gf(double wmin, double wmax, size_t n_freq, double beta, statistic_enum S, size_t nt, mesh_kind mk=full_bins) {
auto m = make_gf_mesh(wmin, wmax, n_freq, beta,S, nt, mk);
typename gf_t::data_non_view_t A(m.size());
A() =0;
return gf_t (m, std::move(A), nothing(), nothing() ) ;
}
};
} // gfs_implementation
//slices
gf_view slice_mesh_imtime (gf_view g, size_t index) {
auto arr = reinterpret_linear_array(g.mesh(),g.data()); // view it as a 2d array
return { std::get<0>(g.mesh().components()), arr(arrays::range(),index), local::tail(1,1), nothing() };
}
}}
#endif