no_auxiliary_information.hpp

Go to the documentation of this file.

#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_NO_AUXILIARY_INFORMATION_HPP
#define MLPACK_CORE_TREE_RECTANGLE_TREE_NO_AUXILIARY_INFORMATION_HPP

namespace mlpack {
namespace tree {

template<typename TreeType>
class NoAuxiliaryInformation
{
 public:
  NoAuxiliaryInformation() { }
  NoAuxiliaryInformation(const TreeType* /* node */) { }
  NoAuxiliaryInformation(const NoAuxiliaryInformation& /* other */,
                         TreeType* /* tree */,
                         bool /* deepCopy */ = true) { }
  NoAuxiliaryInformation(NoAuxiliaryInformation&& /* other */) { }

  NoAuxiliaryInformation& operator=(const NoAuxiliaryInformation& /* other */)
  {
    return *this;
  }

  bool HandlePointInsertion(TreeType* /* node */, const size_t /* point */)
  {
    return false;
  }

  bool HandleNodeInsertion(TreeType* /* node */,
                           TreeType* /* nodeToInsert */,
                           bool /* insertionLevel */)
  {
    return false;
  }

  bool HandlePointDeletion(TreeType* /* node */, const size_t /* localIndex */)
  {
    return false;
  }

  bool HandleNodeRemoval(TreeType* /* node */, const size_t /* nodeIndex */)
  {
    return false;
  }

  bool UpdateAuxiliaryInfo(TreeType* /* node */)
  {
    return false;
  }

  void SplitAuxiliaryInfo(TreeType* /* treeOne */,
                          TreeType* /* treeTwo */,
                          size_t /* axis */,
                          typename TreeType::ElemType /* cut */)
  { }


  void NullifyData()
  { }

  template<typename Archive>
  void serialize(Archive &, const uint32_t /* version */) { }
};

} // namespace tree
} // namespace mlpack

#endif  //  MLPACK_CORE_TREE_RECTANGLE_TREE_NO_AUXILIARY_INFORMATION_HPP