mirror of
https://github.com/triqs/dft_tools
synced 2024-11-01 11:43:47 +01:00
bdac3e159c
- little details : code cleaning, clang formatting, along with documentation writing for c++ gf. - separated the mesh in small class for better doc. - work on documentation : reorganize specialisation, ...
85 lines
3.5 KiB
C++
85 lines
3.5 KiB
C++
/*******************************************************************************
|
|
*
|
|
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
|
|
*
|
|
* Copyright (C) 2011 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 <http://www.gnu.org/licenses/>.
|
|
*
|
|
******************************************************************************/
|
|
#ifndef TRIQS_GF_LOCAL_FOURIER_MATSU_H
|
|
#define TRIQS_GF_LOCAL_FOURIER_MATSU_H
|
|
|
|
#include "fourier_base.hpp"
|
|
#include <triqs/gfs/imfreq.hpp>
|
|
#include <triqs/gfs/imtime.hpp>
|
|
|
|
namespace triqs {
|
|
namespace gfs {
|
|
|
|
template <typename Target, typename Opt, bool V, bool C>
|
|
gf_keeper<tags::fourier, imtime, Target, Opt> fourier(gf_impl<imtime, Target, Opt, V, C> const& g) {
|
|
return {g};
|
|
}
|
|
template <typename Target, typename Opt, bool V, bool C>
|
|
gf_keeper<tags::fourier, imfreq, Target, Opt> inverse_fourier(gf_impl<imfreq, Target, Opt, V, C> const& g) {
|
|
return {g};
|
|
}
|
|
|
|
// The fourier transform with the tail
|
|
void triqs_gf_view_assign_delegation(gf_view<imfreq, scalar_valued> g, gf_keeper<tags::fourier, imtime, scalar_valued> const& L);
|
|
void triqs_gf_view_assign_delegation(gf_view<imfreq, matrix_valued> g, gf_keeper<tags::fourier, imtime, matrix_valued> const& L);
|
|
void triqs_gf_view_assign_delegation(gf_view<imtime, scalar_valued> g, gf_keeper<tags::fourier, imfreq, scalar_valued> const& L);
|
|
void triqs_gf_view_assign_delegation(gf_view<imtime, matrix_valued> g, gf_keeper<tags::fourier, imfreq, matrix_valued> const& L);
|
|
|
|
// The version without tail : only possible in one direction
|
|
void triqs_gf_view_assign_delegation(gf_view<imfreq, scalar_valued, no_tail> g,
|
|
gf_keeper<tags::fourier, imtime, scalar_valued, no_tail> const& L);
|
|
void triqs_gf_view_assign_delegation(gf_view<imfreq, matrix_valued, no_tail> g,
|
|
gf_keeper<tags::fourier, imtime, matrix_valued, no_tail> const& L);
|
|
|
|
template <typename Opt> gf_mesh<imfreq, Opt> make_mesh_fourier_compatible(gf_mesh<imtime, Opt> const& m) {
|
|
int L = m.size() - (m.kind() == full_bins ? 1 : 0);
|
|
return {m.domain(), L};
|
|
}
|
|
|
|
template <typename Opt>
|
|
gf_mesh<imtime, Opt> make_mesh_fourier_compatible(gf_mesh<imfreq, Opt> const& m, mesh_kind mk = full_bins) {
|
|
int L = m.size() + (mk == full_bins ? 1 : 0);
|
|
return {m.domain(), L};
|
|
}
|
|
|
|
template <typename Target, typename Opt, bool V, bool C>
|
|
gf<imfreq, Target, Opt> make_gf_from_fourier(gf_impl<imtime, Target, Opt, V, C> const& gt) {
|
|
auto gw = gf<imfreq, Target, Opt>{make_mesh_fourier_compatible(gt.mesh()), get_target_shape(gt)};
|
|
gw() = fourier(gt);
|
|
return gw;
|
|
}
|
|
|
|
template <typename Target, typename Opt, bool V, bool C>
|
|
gf<imtime, Target, Opt> make_gf_from_inverse_fourier(gf_impl<imfreq, Target, Opt, V, C> const& gw, mesh_kind mk = full_bins) {
|
|
auto gt = gf<imtime, Target, Opt>{make_mesh_fourier_compatible(gw.mesh(), mk), get_target_shape(gw)};
|
|
gt() = inverse_fourier(gw);
|
|
return gt;
|
|
}
|
|
}
|
|
|
|
namespace clef {
|
|
TRIQS_CLEF_MAKE_FNT_LAZY(fourier);
|
|
TRIQS_CLEF_MAKE_FNT_LAZY(inverse_fourier);
|
|
}
|
|
}
|
|
#endif
|
|
|