mirror of
https://github.com/triqs/dft_tools
synced 2025-01-13 22:36:03 +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
80 lines
2.8 KiB
C++
80 lines
2.8 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_DISCRETE_DOMAIN_H
|
|
#define TRIQS_GF_DISCRETE_DOMAIN_H
|
|
#include "../tools.hpp"
|
|
#include <map>
|
|
namespace triqs { namespace gfs {
|
|
|
|
/// The domain
|
|
class discrete_domain {
|
|
size_t Nmax;
|
|
std::vector<std::string> _names;// name of the points (e.g. for block)
|
|
std::map<std::string,int> _inv_names;
|
|
void init_inv() {
|
|
for (size_t i =0; i<Nmax; ++i) { _inv_names[_names[i]]=i;}
|
|
}
|
|
public:
|
|
typedef long point_t;
|
|
size_t size() const { return Nmax;};
|
|
discrete_domain (size_t Nmax_=1) : Nmax(Nmax_) {
|
|
for (size_t i =0; i<Nmax; ++i) { std::stringstream fs; fs<<i; _names.push_back(fs.str());}
|
|
init_inv();
|
|
}
|
|
|
|
discrete_domain (std::vector<std::string> && Names) : Nmax(Names.size()), _names(Names) {init_inv(); }
|
|
discrete_domain (std::vector<std::string> const & Names) : Nmax(Names.size()), _names(Names) { init_inv();}
|
|
discrete_domain (std::initializer_list<std::string> const & Names) : Nmax(Names.size()), _names(Names) { init_inv();}
|
|
|
|
std::vector<std::string> const & names() const { return _names;}
|
|
int index_from_name(std::string const & s) const { return _inv_names.at(s);}
|
|
|
|
bool operator == (discrete_domain const & D) const { return (Nmax == D.Nmax);}
|
|
|
|
/// Write into HDF5
|
|
friend void h5_write (h5::group fg, std::string subgroup_name, discrete_domain const & d) {
|
|
h5::group gr = fg.create_group(subgroup_name);
|
|
h5_write(gr,"n_max",d.Nmax);
|
|
}
|
|
|
|
/// Read from HDF5
|
|
friend void h5_read (h5::group fg, std::string subgroup_name, discrete_domain & d){
|
|
h5::group gr = fg.open_group(subgroup_name);
|
|
long n;
|
|
h5_read(gr,"n_max",n);
|
|
d = discrete_domain(n);
|
|
}
|
|
|
|
// BOOST Serialization
|
|
friend class boost::serialization::access;
|
|
template<class Archive>
|
|
void serialize(Archive & ar, const unsigned int version) {
|
|
ar & boost::serialization::make_nvp("n_max",Nmax);
|
|
ar & boost::serialization::make_nvp("names",_names);
|
|
}
|
|
|
|
};
|
|
|
|
}}
|
|
#endif
|
|
|