UT::PartitionForSubtrees< BOX, ITEM_INDEX_REP > Struct Template Reference

#include <UT_RTreeImpl.h>

Public Member Functions
template<typename IS_LESS_THAN >
constexpr void	operator() (UT_BoxedItemT< BOX, ITEM_INDEX_REP > *const begin, UT_BoxedItemT< BOX, ITEM_INDEX_REP > *const end, IS_LESS_THAN &&is_less_than, const ITEM_INDEX_REP m, const int num_subtrees) const noexcept

Detailed Description

template<typename BOX, typename ITEM_INDEX_REP>
struct UT::PartitionForSubtrees< BOX, ITEM_INDEX_REP >

Partition the range of boxed items [begin, end) according to the given comparison function such that all items in the range [0, m-1] are less than or equal to all items in [m, 2m-1], which are less than or equal to all items in [2m, 3m-1], etc, where m is the subtree size.

Definition at line 282 of file UT_RTreeImpl.h.

Member Function Documentation

template<typename BOX , typename ITEM_INDEX_REP >

template<typename IS_LESS_THAN >

constexpr void UT::PartitionForSubtrees< BOX, ITEM_INDEX_REP >::operator() ( UT_BoxedItemT< BOX, ITEM_INDEX_REP > *const  begin, UT_BoxedItemT< BOX, ITEM_INDEX_REP > *const  end, IS_LESS_THAN &&  is_less_than, const ITEM_INDEX_REP  m, const int  num_subtrees  ) const

inlinenoexcept

Definition at line 285 of file UT_RTreeImpl.h.

---

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

• UT/UT_RTreeImpl.h