mirror of
https://github.com/triqs/dft_tools
synced 2024-11-01 03:33:50 +01:00
98 lines
5.0 KiB
C++
98 lines
5.0 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_DATA_PROXIES_H
|
|
#define TRIQS_GF_DATA_PROXIES_H
|
|
#include <triqs/utility/first_include.hpp>
|
|
#include <utility>
|
|
#include <triqs/arrays.hpp>
|
|
#include <triqs/arrays/matrix_view_proxy.hpp>
|
|
|
|
namespace triqs { namespace gf {
|
|
|
|
template<typename T, int R> struct data_proxy_array;
|
|
|
|
//---------------------------- 3d array ----------------------------------
|
|
|
|
template<typename T> struct data_proxy_array<T,3> {
|
|
/// The storage
|
|
typedef arrays::array<T,3> storage_t;
|
|
typedef typename storage_t::view_type storage_view_t;
|
|
|
|
/// The data access
|
|
arrays::matrix_view_proxy<storage_t,0> operator()(storage_t & data, size_t i) const { return arrays::matrix_view_proxy<storage_t,0>(data,i); }
|
|
arrays::const_matrix_view_proxy<storage_t,0> operator()(storage_t const & data, size_t i) const { return arrays::const_matrix_view_proxy<storage_t,0>(data,i); }
|
|
arrays::matrix_view_proxy<storage_view_t,0> operator()(storage_view_t & data, size_t i) const { return arrays::matrix_view_proxy<storage_view_t,0>(data,i); }
|
|
arrays::const_matrix_view_proxy<storage_view_t,0> operator()(storage_view_t const & data, size_t i) const { return arrays::const_matrix_view_proxy<storage_view_t,0>(data,i); }
|
|
|
|
template<typename S, typename RHS> static void assign_no_resize (S & data, RHS && rhs) { data() = rhs;}
|
|
template<typename S, typename RHS> static void assign_to_scalar (S & data, RHS && rhs) { data() = rhs;}
|
|
template<typename RHS> static void assign_with_resize (storage_t & data, RHS && rhs) { data = rhs;}
|
|
template<typename RHS> static void rebind (storage_view_t & data, RHS && rhs) { data.rebind(rhs.data()); }
|
|
};
|
|
|
|
//---------------------------- 1d array ----------------------------------
|
|
|
|
template<typename T> struct data_proxy_array<T,1>{
|
|
/// The storage
|
|
typedef arrays::array<T,1> storage_t;
|
|
typedef typename storage_t::view_type storage_view_t;
|
|
|
|
/// The data access
|
|
auto operator()(storage_t & data,size_t i) const -> decltype(data(i)) { return data(i);}
|
|
auto operator()(storage_t const & data,size_t i) const -> decltype(data(i)) { return data(i);}
|
|
auto operator()(storage_view_t & data,size_t i) const -> decltype(data(i)) { return data(i);}
|
|
auto operator()(storage_view_t const & data,size_t i) const -> decltype(data(i)) { return data(i);}
|
|
|
|
template<typename S, typename RHS> static void assign_no_resize (S & data, RHS && rhs) { data() = rhs;}
|
|
template<typename S, typename RHS> static void assign_to_scalar (S & data, RHS && rhs) { data() = rhs;}
|
|
template<typename RHS> static void assign_with_resize (storage_t & data, RHS && rhs) { data = rhs;}
|
|
template<typename RHS> static void rebind (storage_view_t & data, RHS && rhs) { data.rebind(rhs.data()); }
|
|
};
|
|
|
|
//---------------------------- vector ----------------------------------
|
|
|
|
template<typename T> struct data_proxy_vector {
|
|
typedef typename T::view_type Tv;
|
|
|
|
/// The storage
|
|
typedef std::vector<T> storage_t;
|
|
typedef std::vector<Tv> storage_view_t;
|
|
|
|
/// The data access
|
|
T & operator()(storage_t & data, size_t i) { return data[i];}
|
|
T const & operator()(storage_t const & data, size_t i) const { return data[i];}
|
|
Tv & operator()(storage_view_t & data, size_t i) { return data[i];}
|
|
Tv const & operator()(storage_view_t const & data, size_t i) const { return data[i];}
|
|
|
|
template<typename S, typename RHS> static void assign_no_resize (S & data, RHS && rhs) {
|
|
//auto r = make_vector(rhs);
|
|
if (data.size() !=rhs.size()) TRIQS_RUNTIME_ERROR << "Size mismatch in gf assignment";
|
|
for (size_t i =0; i<data.size(); ++i) data[i] = rhs[i];
|
|
}
|
|
template<typename S, typename RHS> static void assign_with_resize (S & data, RHS && rhs) {data = utility::factory<storage_t>(rhs);}
|
|
template<typename S, typename RHS> static void assign_to_scalar (S & data, RHS && rhs) {for (size_t i =0; i<data.size(); ++i) data[i] = rhs;}
|
|
template<typename RHS> static void rebind (storage_view_t & data, RHS && rhs) { data.clear(); for (auto & x : rhs.data()) data.push_back(x);}
|
|
};
|
|
|
|
}}
|
|
#endif
|
|
|