|
bool | has_index (int u, int v, int w) const |
|
void | check_index (int u, int v, int w) const |
|
size_t | index_n (int u, int v, int w) const |
|
size_t | index_checked (int u, int v, int w) const |
|
T | get_value (int u, int v, int w) const |
|
T | get_value_or_zero (int u, int v, int w) const |
|
void | set_value (int u, int v, int w, T x) |
|
Miller | to_hkl (const typename GridBase< T >::Point &point) const |
|
double | calculate_1_d2 (const typename GridBase< T >::Point &point) const |
|
double | calculate_d (const typename GridBase< T >::Point &point) const |
|
T | get_value_by_hkl (Miller hkl, double unblur=0, bool mott_bethe=false) const |
|
template<typename R = T> |
AsuData< R > | prepare_asu_data (double dmin=0, double unblur=0, bool with_000=false, bool with_sys_abs=false, bool mott_bethe=false) |
|
void | check_not_empty () const |
|
void | set_size_without_checking (int nu_, int nv_, int nw_) |
|
T | get_value_q (int u, int v, int w) const |
|
size_t | point_to_index (const Point &p) const |
|
Point | index_to_point (size_t idx) |
|
void | fill (T value) |
|
Tsum | sum () const |
|
iterator | begin () |
|
iterator | end () |
|
size_t | point_count () const |
|
Fractional | get_fractional (int u, int v, int w) const |
| u,v,w are not normalized here
|
|
Position | get_position (int u, int v, int w) const |
|
std::vector< GridOp > | get_scaled_ops_except_id () const |
|
size_t | index_q (int u, int v, int w) const |
| Quick(est) index function, but works only if 0 <= u < nu , etc.
|
|
size_t | index_n (int u, int v, int w) const |
| Faster than index_s(), but works only if -nu <= u < 2*nu , etc.
|
|
size_t | index_n_ref (int &u, int &v, int &w) const |
| The same as index_n(), but modifies arguments.
|
|
size_t | index_near_zero (int u, int v, int w) const |
| Faster than index_n(), but works only if -nu <= u < nu, etc.
|
|
template<
typename T>
struct gemmi::ReciprocalGrid< T >
Definition at line 23 of file recgrid.hpp.