#include <TreeTraits.h>
|
| TreeTraits () noexcept |
|
size_t | GetSplitItemIndex (size_t itemCount, size_t newItemIndex) const noexcept |
|
template<typename KeyArg1 , typename KeyArg2 > |
bool | IsLess (const KeyArg1 &key1, const KeyArg2 &key2) const |
|
template<typename KeyArg1 , typename KeyArg2 > |
bool | IsLess (KeyArg1 *key1, KeyArg2 *key2) const noexcept |
|
◆ IsValidKeyArg
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
template<typename KeyArg >
◆ Key
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
◆ Node
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
template<typename ItemTraits >
using momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::Node = typename TreeNode::template Node<ItemTraits> |
◆ TreeNode
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
◆ TreeTraits()
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
◆ GetSplitItemIndex()
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
size_t momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::GetSplitItemIndex |
( |
size_t |
itemCount, |
|
|
size_t |
newItemIndex |
|
) |
| const |
|
inlinenoexcept |
◆ IsLess() [1/2]
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
template<typename KeyArg1 , typename KeyArg2 >
bool momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::IsLess |
( |
const KeyArg1 & |
key1, |
|
|
const KeyArg2 & |
key2 |
|
) |
| const |
|
inline |
◆ IsLess() [2/2]
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
template<typename KeyArg1 , typename KeyArg2 >
bool momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::IsLess |
( |
KeyArg1 * |
key1, |
|
|
KeyArg2 * |
key2 |
|
) |
| const |
|
inlinenoexcept |
◆ multiKey
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
const bool momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::multiKey = tMultiKey |
|
static |
◆ useLinearSearch
template<typename TKey , bool tMultiKey = false, typename TTreeNode = TreeNodeDefault, bool tUseLinearSearch = IsFastComparable<TKey>::value>
const bool momo::TreeTraits< TKey, tMultiKey, TTreeNode, tUseLinearSearch >::useLinearSearch = tUseLinearSearch |
|
static |
The documentation for this class was generated from the following file: