13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_X_TREE_AUXILIARY_INFORMATION_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_X_TREE_AUXILIARY_INFORMATION_HPP
23template<
typename TreeType>
29 normalNodeMaxNumChildren(0),
39 normalNodeMaxNumChildren(node->Parent() ?
41 node->MaxNumChildren()),
42 splitHistory(node->Bound().Dim())
81 splitHistory(
std::move(other.splitHistory))
83 other.normalNodeMaxNumChildren = 0;
176 for (
int i = 0; i < dim; ++i)
196 other.lastDimension = 0;
199 template<
typename Archive>
203 ar & BOOST_SERIALIZATION_NVP(
history);
209 size_t normalNodeMaxNumChildren;
226 template<
typename Archive>
229 ar & BOOST_SERIALIZATION_NVP(normalNodeMaxNumChildren);
230 ar & BOOST_SERIALIZATION_NVP(splitHistory);
Linear algebra utility functions, generally performed on matrices or vectors.
The X tree requires that the tree records it's "split history".
SplitHistoryStruct(const SplitHistoryStruct &other)
std::vector< bool > history
SplitHistoryStruct(int dim)
SplitHistoryStruct & operator=(const SplitHistoryStruct &other)
SplitHistoryStruct(SplitHistoryStruct &&other)
void serialize(Archive &ar, const unsigned int)