LCPQ/dft_tools
3
0
Fork 0
mirror of https://github.com/triqs/dft_tools synced 2024-10-31 19:23:45 +01:00
Code Issues Releases Wiki Activity

gfs. Rm code introduced only for Krylov QMC

Browse Source 
- This function was redondant : qmc code cleaned.
- using make_clone in gfs namespace for ADL usage.
This commit is contained in:
Olivier Parcollet 2013-12-23 23:19:03 +01:00
parent a97a4d09b6
commit 5f7e0989a3
2 changed files with 1 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
triqs/gfs/gf.hpp
View File

@ -32,6 +32,7 @@
namespace triqs { namespace gfs {
using utility::factory;
using arrays::make_shape;
using triqs::make_clone;
// the gf mesh
template <typename Variable, typename Opt = void> struct gf_mesh;

20
triqs/gfs/meshes/linear.hpp
View File

@ -21,10 +21,6 @@
#ifndef TRIQS_GF_MESH_LINEAR_H
#define TRIQS_GF_MESH_LINEAR_H
#include "./mesh_tools.hpp"
// ADDED for Krylov : to be clean and removed if necessary
#include <algorithm>
#include <boost/math/special_functions/round.hpp>
namespace triqs {
namespace gfs {
@ -101,22 +97,6 @@ namespace gfs {
/// Accessing a point of the mesh
mesh_point_t operator[](index_t i) const { return mesh_point_t(*this, i); }
// ADDED for krylov : to be CLEANED AND CHANGED
// Find the index of the mesh point which is nearest to x
index_t nearest_index(domain_pt_t x) const {
double x_real = real_or_imag(x, std::is_base_of<std::complex<double>, domain_pt_t>());
using boost::math::round;
using std::min;
using std::max;
switch (meshk) {
case half_bins:
case full_bins:
return min(max(round((x_real - xmin) / del), .0), static_cast<double>(L - 1));
case without_last:
return min(max(round((x_real - xmin) / del), .0), static_cast<double>(L - 2));
}
}
private:
static double real_or_imag(domain_pt_t x, std::false_type) { return x; }
static double real_or_imag(domain_pt_t x, std::true_type) { return imag(x); }