reduc_ret_t< split_int > Struct Template Reference

Return type of reduction algorithms. More...

#include <shamtree/include/shamtree/kernels/reduction_alg.hpp>

Collaboration diagram for reduc_ret_t< split_int >:

Public Attributes
sham::DeviceBuffer< split_int >	buf_reduc_index_map
u32	morton_leaf_count

Detailed Description

template<class split_int>
struct reduc_ret_t< split_int >

Return type of reduction algorithms.

A reduction algorithm return a struct of two elements:

• buf_reduc_index_map: a device buffer containing the reduction index map
• morton_leaf_count: the number of leaf nodes in the reduced tree

Template Parameters

split_int

the type of integer used to represent the split table

Definition at line 96 of file reduction_alg.hpp.

Member Data Documentation

buf_reduc_index_map

template<class split_int >

sham::DeviceBuffer<split_int> reduc_ret_t< split_int >::buf_reduc_index_map

Definition at line 97 of file reduction_alg.hpp.

morton_leaf_count

template<class split_int >

u32 reduc_ret_t< split_int >::morton_leaf_count

Definition at line 98 of file reduction_alg.hpp.

---

The documentation for this struct was generated from the following file:

• shamtree/include/shamtree/kernels/reduction_alg.hpp