[mlpack-git] [mlpack/mlpack] R+ and R++ trees implementation (#699)

Ryan Curtin notifications at github.com
Wed Jun 29 16:37:47 EDT 2016


> + * tree, starting at a leaf node and moving upwards if necessary.
> + */
> +#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_PLUS_TREE_SPLIT_HPP
> +#define MLPACK_CORE_TREE_RECTANGLE_TREE_R_PLUS_TREE_SPLIT_HPP
> +
> +#include <mlpack/core.hpp>
> +
> +namespace mlpack {
> +namespace tree /** Trees and tree-building procedures. */ {
> +
> +/**
> + * The RPlusTreeSplit class performs the split process of a node on overflow.
> + *
> + * @tparam SplitPolicyType The class that helps to determine the subtree into
> + *    which we should insert a child node.
> + * @tparam SweepType The class that sweeps a node along an axis.

Can you document more what the SweepType class needs to do?  I understand the classes you have written now that I have read it, but the documentation here doesn't give very much insight to someone who is just skimming the code.

---
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69022655
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160629/5d6a3d69/attachment.html>


More information about the mlpack-git mailing list