mirror of
https://github.com/triqs/dft_tools
synced 2024-10-31 19:23:45 +01:00
39edb2f846
- Make more general constructors for the gf.
gf( mesh, target_shape_t)
- remove the old make_gf for the basic gf.
- 2 var non generic gf removed.
- clean evaluator
- add tensor_valued
- add a simple vertex test.
- clean specialisation
- Fix bug introduced in 1906dc3
- forgot to resize the gf in new version of operator =
- Fix make_singularity in gf.hpp
- clean resize in operator =
- update h5 read/write for block gf
- changed a bit the general trait to save *all* the gf.
- allows a more general specialization, then a correct for blocks
- NOT FINISHED : need to save the block indice for python.
How to reread ?
Currently it read the blocks names and reconstitute the mesh from it.
Is it sufficient ?
- clean block constructors
- block constructors simplest possible : an int for the number of blocks
- rest in free factories.
- fixed the generic constructor from GfType for the regular type :
only enable iif GfType is ImmutableGreenFunction
- multivar. fix linear index in C, and h5 format
- linear index now correctly flatten in C mode
(was in fortran mode), using a simple reverse of the tuple in the folding.
- fix the h5 read write of the multivar fonctions
in order to write an array on dimension # variables + dim_target
i.e. without flattening the indices of the meshes.
Easier for later data analysis, e.g. in Python.
- merge matrix/tensor_valued. improve factories
- matrix_valued now = tensor_valued<2>
(simplifies generic code for h5).
- factories_one_var -> factories : this is the generic case ...
only a few specialization, code is simpler.
- clef expression call with rvalue for *this
- generalize matrix_proxy to tensor and clean
- clean exception catch in tests
- exception catching catch in need in test
because the silly OS X does not print anything, just "exception occurred".
Very convenient for the developer...
- BUT, one MUST add return 1, or the make test will *pass* !!
- --> systematically replace the catch by a macro TRIQS_CATCH_AND_ABORT
which return a non zero error code.
- exception : curry_and_fourier which does not work at this stage
(mesh incompatible).
- gf: clean draft of gf 2 times
- comment the python interface for the moment.
- rm useless tests
106 lines
4.4 KiB
C++
106 lines
4.4 KiB
C++
/*******************************************************************************
|
|
*
|
|
* 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 <http://www.gnu.org/licenses/>.
|
|
*
|
|
******************************************************************************/
|
|
#ifndef TRIQS_GF_TOOLS_H
|
|
#define TRIQS_GF_TOOLS_H
|
|
#include <triqs/utility/first_include.hpp>
|
|
#include <utility>
|
|
#include <boost/iterator/iterator_facade.hpp>
|
|
#include <triqs/clef.hpp>
|
|
#include <triqs/arrays/array.hpp>
|
|
#include <triqs/arrays/matrix.hpp>
|
|
#include <triqs/arrays/h5/simple_read_write.hpp>
|
|
#include "triqs/utility/complex_ops.hpp"
|
|
#include <triqs/utility/view_tools.hpp>
|
|
#include <triqs/utility/expression_template_tools.hpp>
|
|
#include <triqs/h5.hpp>
|
|
|
|
namespace triqs { namespace gfs {
|
|
namespace tqa= triqs::arrays;
|
|
namespace mpl=boost::mpl;
|
|
|
|
namespace tag { struct composite{}; struct mesh_point{};}
|
|
|
|
struct scalar_valued {};
|
|
template<int R> struct tensor_valued {static_assert( R>0, "tensor_valued only for rank >0");};
|
|
struct matrix_valued{};
|
|
|
|
//------------------------------------------------------
|
|
|
|
typedef std::complex<double> dcomplex;
|
|
|
|
enum statistic_enum {Boson,Fermion};
|
|
|
|
struct freq_infty{}; // the point at infinity
|
|
|
|
inline std::vector<std::string> split(const std::string &s, char delim){
|
|
std::vector<std::string> elems;
|
|
std::stringstream ss(s);
|
|
std::string item;
|
|
while(std::getline(ss, item, delim)) { elems.push_back(item); }
|
|
return elems;
|
|
}
|
|
//------------------------------------------------------
|
|
|
|
template<typename ... T> struct closest_pt_wrap;
|
|
|
|
template<typename T> struct closest_pt_wrap<T> : tag::mesh_point { T value; template<typename U> explicit closest_pt_wrap(U&&x): value(std::forward<U>(x)){} };
|
|
|
|
template<typename T1, typename T2, typename ...Ts > struct closest_pt_wrap<T1,T2,Ts...> : tag::mesh_point {
|
|
std::tuple<T1,T2,Ts...> value_tuple;
|
|
template<typename ... U> explicit closest_pt_wrap(U&& ... x): value_tuple (std::forward<U>(x) ... ){}
|
|
};
|
|
|
|
template<typename ... T> closest_pt_wrap<T...> closest_mesh_pt(T && ... x) { return closest_pt_wrap<T...> (std::forward<T>(x)...);}
|
|
|
|
//------------------------------------------------------
|
|
|
|
struct nothing {
|
|
template<typename... Args> explicit nothing(Args&&...) {} // takes anything, do nothing..
|
|
nothing() {}
|
|
typedef nothing view_type;
|
|
typedef nothing regular_type;
|
|
void rebind (nothing){}
|
|
template< typename RHS> void operator=(RHS && ) {}
|
|
friend void h5_write (h5::group, std::string subgroup_name, nothing ) {}
|
|
friend void h5_read (h5::group, std::string subgroup_name, nothing ) {}
|
|
// BOOST Serialization
|
|
friend class boost::serialization::access;
|
|
template<class Archive>
|
|
void serialize(Archive & ar, const unsigned int version) {
|
|
}
|
|
friend nothing operator +( nothing, nothing) { return nothing();}
|
|
template<typename RHS> friend void assign_from_expression(nothing & ,RHS) {}
|
|
};
|
|
|
|
template<typename T> nothing operator+(nothing, T const &) { return nothing();}
|
|
template<typename T> nothing operator-(nothing, T const &) { return nothing();}
|
|
template<typename T> nothing operator*(nothing, T const &) { return nothing();}
|
|
template<typename T> nothing operator/(nothing, T const &) { return nothing();}
|
|
template<typename T> TYPE_DISABLE_IF(nothing, std::is_same<T,nothing>) operator+(T const &, nothing) { return nothing();}
|
|
template<typename T> TYPE_DISABLE_IF(nothing, std::is_same<T,nothing>) operator-(T const &, nothing) { return nothing();}
|
|
template<typename T> TYPE_DISABLE_IF(nothing, std::is_same<T,nothing>) operator*(T const &, nothing) { return nothing();}
|
|
template<typename T> TYPE_DISABLE_IF(nothing, std::is_same<T,nothing>) operator/(T const &, nothing) { return nothing();}
|
|
|
|
//------------------------------------------------------
|
|
|
|
}}
|
|
#endif
|