45 #ifndef CLIPPER_FFTMAP_SPARSE
46 #define CLIPPER_FFTMAP_SPARSE
71 ffttype*
map_uv(
const int& u,
const int& v );
73 std::complex<ffttype>*
map_kl(
const int& k,
const int& l );
103 void set_hkl(
const HKL& hkl,
const std::complex<ffttype>& f );
106 {
return map_kl( uvw.v(), uvw.w() )[ uvw.u() ]; }
109 {
map_uv( uvw.u(), uvw.v() ); }
112 {
return row_uv( uvw.u(), uvw.v() )[ uvw.w() ]; }
137 {
return map_uv( uvw.u(), uvw.v() )[ uvw.w() ]; }
141 const std::complex<ffttype>
get_hkl(
const HKL& hkl )
const;
144 {
map_kl( hkl.v(), hkl.w() ); }
147 {
return row_kl( hkl.v(), hkl.w() )[ hkl.u() ]; }
Grid coordinate.
Definition: coords.h:236
void set_hkl(const HKL &hkl, const std::complex< ffttype > &f)
set reciprocal space data by hkl
Definition: fftmap_sparse.cpp:143
ffttype * map_uv(const int &u, const int &v)
return/create row
Definition: fftmap_sparse.cpp:95
Grid grid_reci_
reciprocal space grid
Definition: fftmap_sparse.h:76
ftype64 ftype
ftype definition for floating point representation
Definition: clipper_precision.h:58
FFTmap_sparse_p1_xh()
Null constuctor.
Definition: fftmap_sparse.cpp:243
std::complex< ffttype > * map_kl(const int &k, const int &l)
return/create row
Definition: fftmap_sparse.cpp:107
static FFTtype default_type_
default optimisation options
Definition: fftmap_sparse.h:82
void fft_x_to_h(const ftype &scale)
Transform to real space.
Definition: fftmap_sparse.cpp:294
reflection 'Miller' index
Definition: coords.h:145
FFTmap_sparse_p1_xh: low level sparse P1 map used for calculating FFTs.
Definition: fftmap_sparse.h:124
Grid_sampling grid_real_
real space grid
Definition: fftmap_sparse.h:75
static FFTtype & default_type()
set/get default optimisation type
Definition: fftmap_sparse.h:68
generic grid
Definition: coords.h:479
void fft_h_to_x(const ftype &scale)
Transform to real space.
Definition: fftmap_sparse.cpp:157
Grid sampling of a unit cell.
Definition: coords.h:515
FFTmap_sparse_p1_hx()
Null constuctor.
Definition: fftmap_sparse.cpp:120
std::complex< ffttype > & cplx_data(const Coord_grid &uvw)
set reciprocal space data (internal use)
Definition: fftmap_sparse.h:105
Array2d< std::complex< ffttype > * > row_kl
section map
Definition: fftmap_sparse.h:79
Array2d< ffttype * > row_uv
section map
Definition: fftmap_sparse.h:80
const std::complex< ffttype > & cplx_data(const Coord_grid &hkl) const
get reciprocal space data (internal use)
Definition: fftmap_sparse.h:146
const ffttype & real_data(const Coord_grid &uvw) const
get real space data ( uvw must be in grid_real() )
Definition: fftmap_sparse.h:111
base type for sparse P1 fft maps
Definition: fftmap_sparse.h:56
void require_real_data(const Coord_grid &uvw)
express need for real space data
Definition: fftmap_sparse.h:108
~FFTmap_sparse_p1_base()
Destructor.
Definition: fftmap_sparse.cpp:84
FFTtype type_
optimisation options
Definition: fftmap_sparse.h:77
Simple 2-d array class.
Definition: clipper_types.h:364
ffttype & real_data(const Coord_grid &uvw)
set real space data ( uvw must be in grid_real() )
Definition: fftmap_sparse.h:136
const std::complex< ffttype > get_hkl(const HKL &hkl) const
get reciprocal space data by hkl
Definition: fftmap_sparse.cpp:267
void require_cplx_data(const Coord_grid &hkl)
express need for reciprocal space data (internal use)
Definition: fftmap_sparse.h:143
FFTmap_sparse_p1_hx: low level sparse P1 map used for calculating FFTs.
Definition: fftmap_sparse.h:91
void require_hkl(const HKL &hkl)
express need for reciprocal space data by hkl
Definition: fftmap_sparse.cpp:255
const Grid_sampling & grid_real() const
get real grid sampling
Definition: fftmap_sparse.h:63
void init(const Grid_sampling &grid_sam, const FFTtype type=Default)
initialiser: takes grid
Definition: fftmap_sparse.cpp:68
const Grid & grid_reci() const
get reciprocal grid
Definition: fftmap_sparse.h:65