Definition at line 381 of file SparseGrid.hpp.
Public Types | |
typedef int | yes_i_am_grid |
it define that this data-structure is a grid | |
typedef grid_key_dx< dim > | base_key |
base_key for the grid | |
typedef T | value_type |
typedef grid_key_sparse_dx_iterator_sub< dim, chunking::size::value > | sub_grid_iterator_type |
sub-grid iterator type | |
typedef aggregate_bfv< chunk_def > | background_type |
Background type. | |
typedef layout_base< T > | memory_traits |
typedef chunking | chunking_type |
typedef grid_lin | linearizer_type |
Public Member Functions | |
sgrid_cpu () | |
Trivial constructor. | |
sgrid_cpu (const sgrid_cpu &g) THROW | |
create a sparse grid from another grid | |
sgrid_cpu (const sgrid_cpu &&g) THROW | |
create a sparse grid from another grid | |
sgrid_cpu (const size_t(&sz)[dim]) | |
Constructor for sparse grid. | |
template<unsigned int p> | |
void | setBackgroundValue (const typename boost::mpl::at< typename T::type, boost::mpl::int_< p > >::type &val) |
Set the background value for the property p. | |
sparse_grid_bck_value< typename std::remove_reference< decltype(chunks.get(0))>::type > | getBackgroundValue () |
Get the background value. | |
template<unsigned int ... prp, typename S2 , typename header_type , typename ite_type , typename context_type > | |
void | unpack_with_headers (ExtPreAlloc< S2 > &mem, ite_type &sub_it, header_type &headers, int ih, Unpack_stat &ps, context_type &context, rem_copy_opt opt=rem_copy_opt::NONE_OPT) |
auto | getBackgroundValueAggr () -> decltype(chunks.get(0)) |
Get the background value. | |
auto | insert_o (const grid_key_dx< dim > &v1, size_t &ele_id) -> decltype(chunks.get_o(0)) |
Insert a full element (with all properties) | |
template<unsigned int p, typename r_type = decltype(get_selector< typename boost::mpl::at<typename T::type,boost::mpl::int_<p>>::type >::template get<p>(chunks,0,0))> | |
r_type | insert (const grid_key_dx< dim > &v1) |
Get the reference of the selected element. | |
template<unsigned int p, typename r_type = decltype(get_selector< typename boost::mpl::at<typename T::type,boost::mpl::int_<p>>::type >::template get<p>(chunks,0,0))> | |
r_type | insert (const grid_key_sparse_lin_dx &v1) |
Get the reference of the selected element. | |
template<unsigned int p> | |
auto | get (const grid_key_dx< dim > &v1) const -> decltype(get_selector< typename boost::mpl::at< typename T::type, boost::mpl::int_< p > >::type >::template get_const< p >(chunks, 0, 0)) |
Get the reference of the selected element. | |
template<unsigned int p> | |
auto | get (const grid_key_dx< dim > &v1) -> decltype(get_selector< typename boost::mpl::at< typename T::type, boost::mpl::int_< p > >::type >::template get_const< p >(chunks, 0, 0)) |
Get the reference of the selected element. | |
bool | existPoint (const grid_key_dx< dim > &v1) const |
Check if the point exist. | |
template<unsigned int p> | |
auto | get (const grid_key_sparse_lin_dx &v1) -> decltype(chunks.template get< p >(0)[0]) |
Get the reference of the selected element. | |
auto | getBlock (const grid_key_sparse_lin_dx &v1) const -> decltype(chunks.get(0)) |
Get the reference of the selected block. | |
unsigned char | getFlag (const grid_key_dx< dim > &v1) const |
Get the point flag (in this case it always return 0) | |
grid_key_sparse_dx_iterator< dim, chunking::size::value > | getIterator (size_t opt=0) const |
Return a Domain iterator. | |
grid_key_sparse_dx_iterator_sub< dim, chunking::size::value > | getIterator (const grid_key_dx< dim > &start, const grid_key_dx< dim > &stop, size_t opt=0) const |
Return an iterator over a sub-grid. | |
template<unsigned int stencil_size = 0> | |
grid_key_sparse_dx_iterator_block_sub< dim, stencil_size, self, chunking > | getBlockIterator (const grid_key_dx< dim > &start, const grid_key_dx< dim > &stop) |
Return an iterator over a sub-grid. | |
const grid_lin & | getGrid () const |
Return the internal grid information. | |
void | remove (const grid_key_dx< dim > &v1) |
Remove the point. | |
void | remove_no_flush (const grid_key_dx< dim > &v1) |
Remove the point but do not flush the remove. | |
template<typename stencil_type > | |
void | expandAndTagBoundaries (grid_key_dx< dim > &start, grid_key_dx< dim > &stop) |
Expand and tag boundaries. | |
void | flush_remove () |
Remove the point. | |
void | resize (const size_t(&sz)[dim]) |
Resize the grid. | |
void | packReset () |
Reset the pack calculation. | |
template<int ... prp, typename context_type > | |
void | packCalculate (size_t &req, const context_type &context) |
Calculate the size of the information to pack. | |
template<int ... prp> | |
void | packRequest (size_t &req) const |
Insert an allocation request. | |
void | copyRemoveReset () |
Reset the queue to remove and copy section of grids. | |
template<int ... prp> | |
void | packRequest (grid_key_sparse_dx_iterator_sub< dim, chunking::size::value > &sub_it, size_t &req) const |
Insert an allocation request. | |
template<int ... prp> | |
void | pack (ExtPreAlloc< S > &mem, grid_key_sparse_dx_iterator_sub< dims, chunking::size::value > &sub_it, Pack_stat &sts) |
Pack the object into the memory given an iterator. | |
void | removeAddUnpackReset () |
In this case it does nothing. | |
void | resetFlush () |
It does nothing. | |
template<unsigned int ... prp, typename context_type > | |
void | removeAddUnpackFinalize (const context_type &ctx, int opt) |
In this case it does nothing. | |
template<unsigned int ... prp, typename context_type > | |
void | removeCopyToFinalize (const context_type &ctx, int opt) |
In this case it does nothing. | |
bool | isSkipLabellingPossible () |
This function check if keep geometry is possible for this grid. | |
template<int ... prp> | |
void | packFinalize (ExtPreAlloc< S > &mem, Pack_stat &sts, int opt, bool is_pack_remote) |
Pack finalize Finalize the pack of this object. In this case it does nothing. | |
template<int ... prp> | |
void | pack (ExtPreAlloc< S > &mem, Pack_stat &sts) const |
Pack the object into the memory given an iterator. | |
void | setMemory () |
It does materially nothing. | |
size_t | size () const |
size_t | size_all () const |
void | remove (Box< dim, long int > §ion_to_delete) |
Remove all the points in this region. | |
void | copy_to (const self &grid_src, const Box< dim, size_t > &box_src, const Box< dim, size_t > &box_dst) |
template<template< typename, typename > class op, unsigned int ... prp> | |
void | copy_to_op (const self &grid_src, const Box< dim, size_t > &box_src, const Box< dim, size_t > &box_dst) |
size_t | getChunk (grid_key_dx< dim > &v1, bool &exist) |
Give a grid point it return the chunk containing that point. In case the point does not exist it return the background chunk. | |
grid_key_dx< dim > | getChunkPos (size_t chunk_id) |
Get the position of a chunk. | |
template<unsigned int prop_src, unsigned int prop_dst, unsigned int stencil_size, unsigned int N, typename lambda_f , typename ... ArgsT> | |
void | conv (int(&stencil)[N][dim], grid_key_dx< 3 > start, grid_key_dx< 3 > stop, lambda_f func, ArgsT ... args) |
apply a convolution using the stencil N | |
template<unsigned int prop_src, unsigned int prop_dst, unsigned int stencil_size, typename lambda_f , typename ... ArgsT> | |
void | conv_cross (grid_key_dx< 3 > start, grid_key_dx< 3 > stop, lambda_f func, ArgsT ... args) |
apply a convolution from start to stop point using the function func and arguments args | |
template<unsigned int stencil_size, typename prop_type , typename lambda_f , typename ... ArgsT> | |
void | conv_cross_ids (grid_key_dx< 3 > start, grid_key_dx< 3 > stop, lambda_f func, ArgsT ... args) |
apply a convolution from start to stop point using the function func and arguments args | |
template<unsigned int prop_src1, unsigned int prop_src2, unsigned int prop_dst1, unsigned int prop_dst2, unsigned int stencil_size, unsigned int N, typename lambda_f , typename ... ArgsT> | |
void | conv2 (int(&stencil)[N][dim], grid_key_dx< 3 > start, grid_key_dx< 3 > stop, lambda_f func, ArgsT ... args) |
apply a convolution using the stencil N | |
template<unsigned int prop_src1, unsigned int prop_src2, unsigned int prop_dst1, unsigned int prop_dst2, unsigned int stencil_size, typename lambda_f , typename ... ArgsT> | |
void | conv_cross2 (grid_key_dx< 3 > start, grid_key_dx< 3 > stop, lambda_f func, ArgsT ... args) |
apply a convolution using the stencil N | |
template<unsigned int ... prp, typename S2 , typename context_type > | |
void | unpack (ExtPreAlloc< S2 > &mem, grid_key_sparse_dx_iterator_sub< dims, chunking::size::value > &sub_it, Unpack_stat &ps, context_type &context, rem_copy_opt opt) |
unpack the sub-grid object | |
template<unsigned int ... prp, typename S2 > | |
void | unpack (ExtPreAlloc< S2 > &mem, Unpack_stat &ps) |
unpack the sub-grid object | |
template<template< typename, typename > class op, typename S2 , unsigned int ... prp> | |
void | unpack_with_op (ExtPreAlloc< S2 > &mem, grid_key_sparse_dx_iterator_sub< dim, chunking::size::value > &sub2, Unpack_stat &ps) |
unpack the sub-grid object applying an operation | |
void | convert_key (grid_key_dx< dim > &key_out, const grid_key_sparse_lin_dx &key_in) const |
Here we convert the linearized sparse key into the grid_key_dx. | |
sgrid_cpu & | operator= (const sgrid_cpu &sg) |
copy an sparse grid | |
void | reorder () |
Reorder based on index. | |
sgrid_cpu & | operator= (sgrid_cpu &&sg) |
copy an sparse grid | |
size_t | size_inserted () |
Get the number of inserted points. | |
void | clear () |
delete all the points | |
void | internal_clear_cache () |
This is an internal function to clear the cache. | |
openfpm::vector< cheader< dim > > & | private_get_header_inf () |
return the header section of the blocks | |
openfpm::vector< mheader< chunking::size::value > > & | private_get_header_mask () |
return the header section of the blocks | |
openfpm::vector< int > & | private_get_nnlist () |
return the NN list for each block | |
openfpm::vector< aggregate_bfv< chunk_def >, S, layout_base > & | private_get_data () |
return the data of the blocks | |
const openfpm::vector< cheader< dim > > & | private_get_header_inf () const |
return the header section of the blocks | |
const openfpm::vector< mheader< chunking::size::value > > & | private_get_header_mask () const |
return the header section of the blocks | |
const openfpm::vector< aggregate_bfv< chunk_def > > & | private_get_data () const |
return the data of the blocks | |
void | consistency () |
This function check the consistency of the sparse grid. | |
Static Public Member Functions | |
template<typename pointers_type , typename headers_type , typename result_type , unsigned int ... prp> | |
static void | unpack_headers (pointers_type &pointers, headers_type &headers, result_type &result, int n_slot) |
Stub does not do anything. | |
static constexpr bool | isCompressed () |
This is a multiresolution sparse grid so is a compressed format. | |
static bool | is_unpack_header_supported () |
Indicate that unpacking the header is supported. | |
template<int ... prp> | |
static size_t | packMem (size_t n, size_t e) |
Calculate the memory size required to pack n elements. | |
template<typename stencil = no_stencil> | |
static grid_key_sparse_dx_iterator_sub< dim, chunking::size::value > | type_of_subiterator () |
This is a meta-function return which type of sub iterator a grid produce. | |
static grid_key_sparse_dx_iterator< dim, chunking::size::value > | type_of_iterator () |
This is a meta-function return which type of sub iterator a grid produce. | |
static bool | pack () |
static bool | packRequest () |
static bool | packMem () |
Static Public Attributes | |
static constexpr unsigned int | dims = dim |
expose the dimansionality as a static const | |
Private Types | |
typedef v_transform_two_v2< Ft_chunk, boost::mpl::int_< chunking::size::value >, typenameT::type >::type | chunk_def |
typedef sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking > | self |
background values | |
Private Member Functions | |
void | find_active_chunk_from_point (const grid_key_dx< dim > &v1, size_t &active_cnk, short int &sub_id) |
Given a key return the chunk than contain that key, in case that chunk does not exist return the key of the background chunk. | |
template<unsigned int n_ele> | |
void | remove_from_chunk (size_t sub_id, int &nele, unsigned char(&mask)[n_ele]) |
Remove. | |
void | reconstruct_map () |
reconstruct the map | |
void | remove_empty () |
Eliminate empty chunks. | |
void | add_on_cache (size_t lin_id, size_t active_cnk) const |
add on cache | |
void | clear_cache () |
reset the cache | |
void | set_g_shift_from_size (const size_t(&sz)[dim], grid_lin &g_sm_shift) |
set the grid shift from size | |
void | init () |
initialize | |
void | find_active_chunk (const grid_key_dx< dim > &kh, size_t &active_cnk, bool &exist) const |
Given a key return the chunk than contain that key, in case that chunk does not exist return the key of the background chunk. | |
void | pre_get (const grid_key_dx< dim > &v1, size_t &active_cnk, size_t &sub_id, bool &exist) const |
bool | pre_insert (const grid_key_dx< dim > &v1, size_t &active_cnk, size_t &sub_id) |
Before insert data you have to do this. | |
void | remove_point (const grid_key_dx< dim > &v1) |
Private Attributes | |
size_t | cache_pnt |
cache pointer | |
long int | cache [SGRID_CACHE] |
cache | |
long int | cached_id [SGRID_CACHE] |
cached id | |
tsl::hopscotch_map< size_t, size_t > | map |
Map to convert from grid coordinates to chunk. | |
openfpm::vector< cheader< dim >, S > | header_inf |
indicate which element in the chunk are really filled | |
openfpm::vector< mheader< chunking::size::value >, S > | header_mask |
openfpm::vector< aggregate_bfv< chunk_def >, S, layout_base > | chunks |
vector of chunks | |
grid_lin | g_sm |
grid size information | |
grid_lin | g_sm_shift |
grid size information with shift | |
grid_key_dx< dim > | pos_chunk [chunking::size::value] |
conversion position in the chunks | |
size_t | sz_cnk [dim] |
size of the chunk | |
openfpm::vector< size_t > | empty_v |
bool | findNN |
bool that indicate if the NNlist is filled | |
openfpm::vector< int > | NNlist |
for each chunk store the neighborhood chunks | |
typedef aggregate_bfv<chunk_def> sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::background_type |
Background type.
Definition at line 838 of file SparseGrid.hpp.
typedef grid_key_dx<dim> sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::base_key |
base_key for the grid
Definition at line 825 of file SparseGrid.hpp.
|
private |
Definition at line 401 of file SparseGrid.hpp.
typedef chunking sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::chunking_type |
Definition at line 842 of file SparseGrid.hpp.
typedef grid_lin sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::linearizer_type |
Definition at line 844 of file SparseGrid.hpp.
typedef layout_base<T> sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::memory_traits |
Definition at line 840 of file SparseGrid.hpp.
|
private |
background values
Definition at line 406 of file SparseGrid.hpp.
typedef grid_key_sparse_dx_iterator_sub<dim, chunking::size::value> sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::sub_grid_iterator_type |
sub-grid iterator type
Definition at line 835 of file SparseGrid.hpp.
typedef T sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::value_type |
value that the grid store The object type the grid is storing
Definition at line 832 of file SparseGrid.hpp.
typedef int sgrid_cpu< dim, T, S, grid_lin, layout, layout_base, chunking >::yes_i_am_grid |
it define that this data-structure is a grid
Definition at line 822 of file SparseGrid.hpp.
|
inline |
Trivial constructor.
Definition at line 850 of file SparseGrid.hpp.
|
inline |
create a sparse grid from another grid
g | the grid to copy |
Definition at line 861 of file SparseGrid.hpp.
|
inline |
create a sparse grid from another grid
g | the grid to copy |
Definition at line 871 of file SparseGrid.hpp.
|
inline |
Constructor for sparse grid.
sz | size in each direction of the sparse grid |
Definition at line 881 of file SparseGrid.hpp.
|
inlineprivate |
add on cache
lin_id | linearized id |
active_cnk | active chunk |
Definition at line 536 of file SparseGrid.hpp.
|
inline |
delete all the points
Definition at line 2506 of file SparseGrid.hpp.
|
inlineprivate |
reset the cache
Definition at line 549 of file SparseGrid.hpp.
|
inline |
This function check the consistency of the sparse grid.
Definition at line 2667 of file SparseGrid.hpp.
|
inline |
apply a convolution using the stencil N
Definition at line 2029 of file SparseGrid.hpp.
|
inline |
apply a convolution using the stencil N
Definition at line 2093 of file SparseGrid.hpp.
|
inline |
apply a convolution from start to stop point using the function func and arguments args
start | point |
stop | point |
func | lambda function |
args | arguments to pass |
Definition at line 2050 of file SparseGrid.hpp.
|
inline |
apply a convolution using the stencil N
Definition at line 2110 of file SparseGrid.hpp.
|
inline |
apply a convolution from start to stop point using the function func and arguments args
start | point |
stop | point |
func | lambda function |
args | arguments to pass |
Definition at line 2071 of file SparseGrid.hpp.
|
inline |
Here we convert the linearized sparse key into the grid_key_dx.
key_out | output key |
key_in | input key |
Definition at line 2342 of file SparseGrid.hpp.
|
inline |
Definition at line 1917 of file SparseGrid.hpp.
|
inline |
Definition at line 1967 of file SparseGrid.hpp.
|
inline |
Reset the queue to remove and copy section of grids.
Definition at line 1466 of file SparseGrid.hpp.
|
inline |
Check if the point exist.
v1 | grid_key that identify the element in the grid |
Definition at line 1089 of file SparseGrid.hpp.
|
inline |
Expand and tag boundaries.
stencil_type | type of boundaries |
start | starting point where we tag the boundaries |
stop | point where we tag the boundaries |
Definition at line 1225 of file SparseGrid.hpp.
|
inlineprivate |
Given a key return the chunk than contain that key, in case that chunk does not exist return the key of the background chunk.
v1 | point to search |
return | active_chunk |
return | index inside the chunk |
Definition at line 648 of file SparseGrid.hpp.
|
inlineprivate |
Given a key return the chunk than contain that key, in case that chunk does not exist return the key of the background chunk.
v1 | point to search |
return | active_chunk |
return | index inside the chunk |
Definition at line 439 of file SparseGrid.hpp.
|
inline |
|
inline |
Get the reference of the selected element.
v1 | grid_key that identify the element in the grid |
Definition at line 1061 of file SparseGrid.hpp.
|
inline |
Get the reference of the selected element.
v1 | grid_key that identify the element in the grid |
Definition at line 1025 of file SparseGrid.hpp.
|
inline |
Get the reference of the selected element.
v1 | grid_key that identify the element in the grid |
Definition at line 1117 of file SparseGrid.hpp.
|
inline |
|
inline |
|
inline |
Get the reference of the selected block.
v1 | grid_key that identify the element in the grid |
Definition at line 1129 of file SparseGrid.hpp.
|
inline |
Return an iterator over a sub-grid.
stencil | size |
start | point |
stop | point |
Definition at line 1179 of file SparseGrid.hpp.
|
inline |
Give a grid point it return the chunk containing that point. In case the point does not exist it return the background chunk.
v1 | key |
exist | return true if the chunk exist |
Definition at line 1997 of file SparseGrid.hpp.
|
inline |
Get the position of a chunk.
chunk_id |
Definition at line 2013 of file SparseGrid.hpp.
|
inline |
Get the point flag (in this case it always return 0)
v1 | grid_key that identify the element in the grid |
Definition at line 1141 of file SparseGrid.hpp.
|
inline |
Return the internal grid information.
Return the internal grid information
Definition at line 1191 of file SparseGrid.hpp.
|
inline |
Return an iterator over a sub-grid.
Definition at line 1163 of file SparseGrid.hpp.
|
inline |
Return a Domain iterator.
Definition at line 1152 of file SparseGrid.hpp.
|
inlineprivate |
initialize
Definition at line 584 of file SparseGrid.hpp.
|
inline |
Get the reference of the selected element.
v1 | grid_key that identify the element in the grid |
Definition at line 981 of file SparseGrid.hpp.
|
inline |
Get the reference of the selected element.
v1 | grid_key that identify the element in the grid |
Definition at line 999 of file SparseGrid.hpp.
|
inline |
Insert a full element (with all properties)
v1 | where you want to insert the element |
Definition at line 964 of file SparseGrid.hpp.
|
inline |
This is an internal function to clear the cache.
Definition at line 2521 of file SparseGrid.hpp.
|
inlinestatic |
Indicate that unpacking the header is supported.
Definition at line 1050 of file SparseGrid.hpp.
|
inlinestaticconstexpr |
This is a multiresolution sparse grid so is a compressed format.
Definition at line 954 of file SparseGrid.hpp.
|
inline |
This function check if keep geometry is possible for this grid.
Definition at line 1749 of file SparseGrid.hpp.
|
inline |
copy an sparse grid
tmp | sparse grdi to copy |
Map to convert from grid coordinates to chunk
Definition at line 2358 of file SparseGrid.hpp.
|
inline |
copy an sparse grid
tmp | sparse grdi to copy |
Map to convert from grid coordinates to chunk
Definition at line 2460 of file SparseGrid.hpp.
|
inlinestatic |
Definition at line 2578 of file SparseGrid.hpp.
|
inline |
Pack the object into the memory given an iterator.
prp | properties to pack |
mem | preallocated memory where to pack the objects |
sub_it | sub grid iterator ( or the elements in the grid to pack ) |
sts | pack statistic |
Definition at line 1580 of file SparseGrid.hpp.
|
inline |
Pack the object into the memory given an iterator.
prp | properties to pack |
mem | preallocated memory where to pack the objects |
sub_it | sub grid iterator ( or the elements in the grid to pack ) |
sts | pack statistic |
Definition at line 1776 of file SparseGrid.hpp.
|
inline |
Calculate the size of the information to pack.
\in this case it does nothing
req | output size |
context | gpu contect |
Definition at line 1400 of file SparseGrid.hpp.
|
inline |
Pack finalize Finalize the pack of this object. In this case it does nothing.
prp | properties to pack |
mem | preallocated memory where to pack the objects |
sts | pack statistic |
opt | options |
is_pack_remote | indicate this pack is remote |
Definition at line 1764 of file SparseGrid.hpp.
|
inlinestatic |
Definition at line 2588 of file SparseGrid.hpp.
|
inlinestatic |
Calculate the memory size required to pack n elements.
Calculate the total size required to store n-elements in a vector
n | number of elements |
e | unused |
Definition at line 1373 of file SparseGrid.hpp.
|
inlinestatic |
Definition at line 2583 of file SparseGrid.hpp.
|
inline |
Insert an allocation request.
prp | set of properties to pack |
sub | sub-grid to pack |
vector | of requests |
Definition at line 1480 of file SparseGrid.hpp.
|
inline |
Insert an allocation request.
prp | set of properties to pack |
sub | sub-grid iterator |
vector | of requests |
Definition at line 1413 of file SparseGrid.hpp.
|
inline |
Reset the pack calculation.
Definition at line 1388 of file SparseGrid.hpp.
|
inlineprivate |
Given a key v1 in coordinates it calculate the chunk position and the position in the chunk
v1 | coordinates |
chunk | position |
sub_id | element id |
Definition at line 693 of file SparseGrid.hpp.
|
inlineprivate |
Before insert data you have to do this.
v1 | grid key where you want to insert data |
active_cnk | output which chunk is competent for this data |
sub_id | element inside the chunk |
Definition at line 713 of file SparseGrid.hpp.
|
inline |
return the data of the blocks
Definition at line 2628 of file SparseGrid.hpp.
|
inline |
return the data of the blocks
Definition at line 2658 of file SparseGrid.hpp.
|
inline |
return the header section of the blocks
Definition at line 2598 of file SparseGrid.hpp.
|
inline |
return the header section of the blocks
Definition at line 2638 of file SparseGrid.hpp.
|
inline |
return the header section of the blocks
Definition at line 2608 of file SparseGrid.hpp.
|
inline |
return the header section of the blocks
Definition at line 2648 of file SparseGrid.hpp.
|
inline |
return the NN list for each block
Definition at line 2618 of file SparseGrid.hpp.
|
inlineprivate |
reconstruct the map
Definition at line 471 of file SparseGrid.hpp.
|
inline |
Remove all the points in this region.
box_src | box to kill the points |
Definition at line 1859 of file SparseGrid.hpp.
|
inline |
|
inlineprivate |
Eliminate empty chunks.
Definition at line 496 of file SparseGrid.hpp.
|
inlineprivate |
Remove.
Definition at line 457 of file SparseGrid.hpp.
|
inline |
Remove the point but do not flush the remove.
v1 | element to remove |
Definition at line 1212 of file SparseGrid.hpp.
|
inlineprivate |
Definition at line 791 of file SparseGrid.hpp.
|
inline |
In this case it does nothing.
ctx | context |
Definition at line 1729 of file SparseGrid.hpp.
|
inline |
In this case it does nothing.
Definition at line 1711 of file SparseGrid.hpp.
|
inline |
In this case it does nothing.
ctx | context |
Definition at line 1741 of file SparseGrid.hpp.
|
inline |
Reorder based on index.
Definition at line 2394 of file SparseGrid.hpp.
|
inline |
It does nothing.
Definition at line 1718 of file SparseGrid.hpp.
|
inline |
Resize the grid.
The old information is retained on the new grid if the new grid is bigger. When smaller the data are cropped
sz | reference to an array of dimension dim |
Definition at line 1248 of file SparseGrid.hpp.
|
inlineprivate |
set the grid shift from size
sz | size of the grid |
g_sm_shift | chunks grid size |
Definition at line 562 of file SparseGrid.hpp.
|
inline |
Set the background value for the property p.
Definition at line 899 of file SparseGrid.hpp.
|
inline |
It does materially nothing.
Definition at line 1819 of file SparseGrid.hpp.
|
inline |
\number of element inserted
Definition at line 1830 of file SparseGrid.hpp.
|
inline |
\number of element inserted
Definition at line 1849 of file SparseGrid.hpp.
|
inline |
Get the number of inserted points.
Definition at line 2497 of file SparseGrid.hpp.
|
inlinestatic |
This is a meta-function return which type of sub iterator a grid produce.
Definition at line 2331 of file SparseGrid.hpp.
|
inlinestatic |
This is a meta-function return which type of sub iterator a grid produce.
Definition at line 2320 of file SparseGrid.hpp.
|
inline |
unpack the sub-grid object
prp | properties to unpack |
mem | preallocated memory from where to unpack the object |
sub | sub-grid iterator |
obj | object where to unpack |
Definition at line 2132 of file SparseGrid.hpp.
|
inline |
unpack the sub-grid object
prp | properties to unpack |
mem | preallocated memory from where to unpack the object |
sub | sub-grid iterator |
obj | object where to unpack |
Definition at line 2202 of file SparseGrid.hpp.
|
inlinestatic |
Stub does not do anything.
Definition at line 926 of file SparseGrid.hpp.
|
inline |
Definition at line 930 of file SparseGrid.hpp.
|
inline |
unpack the sub-grid object applying an operation
op | operation |
prp | properties to unpack |
mem | preallocated memory from where to unpack the object |
sub | sub-grid iterator |
obj | object where to unpack |
Definition at line 2246 of file SparseGrid.hpp.
|
mutableprivate |
cache
Definition at line 387 of file SparseGrid.hpp.
|
mutableprivate |
cache pointer
Definition at line 384 of file SparseGrid.hpp.
|
mutableprivate |
cached id
Definition at line 390 of file SparseGrid.hpp.
|
private |
vector of chunks
Definition at line 409 of file SparseGrid.hpp.
|
staticconstexpr |
expose the dimansionality as a static const
Definition at line 828 of file SparseGrid.hpp.
|
private |
Definition at line 423 of file SparseGrid.hpp.
|
private |
bool that indicate if the NNlist is filled
Definition at line 426 of file SparseGrid.hpp.
|
private |
grid size information
Definition at line 412 of file SparseGrid.hpp.
|
private |
grid size information with shift
Definition at line 415 of file SparseGrid.hpp.
|
private |
indicate which element in the chunk are really filled
Definition at line 396 of file SparseGrid.hpp.
|
private |
Definition at line 398 of file SparseGrid.hpp.
|
private |
Map to convert from grid coordinates to chunk.
Definition at line 393 of file SparseGrid.hpp.
|
private |
for each chunk store the neighborhood chunks
Definition at line 429 of file SparseGrid.hpp.
|
private |
conversion position in the chunks
Definition at line 418 of file SparseGrid.hpp.
|
private |
size of the chunk
Definition at line 421 of file SparseGrid.hpp.