\section{Minimal\+Splits\+Number\+Sweep$<$ Split\+Policy $>$ Class Template Reference}
\label{classmlpack_1_1tree_1_1MinimalSplitsNumberSweep}\index{Minimal\+Splits\+Number\+Sweep$<$ Split\+Policy $>$@{Minimal\+Splits\+Number\+Sweep$<$ Split\+Policy $>$}}


The \doxyref{Minimal\+Splits\+Number\+Sweep}{p.}{classmlpack_1_1tree_1_1MinimalSplitsNumberSweep} class finds a partition along which we can split a node according to the number of required splits of the node.  


\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \textbf{ Sweep\+Cost}
\begin{DoxyCompactList}\small\item\em A struct that provides the type of the sweep cost. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Tree\+Type $>$ }\\static size\+\_\+t \textbf{ Sweep\+Leaf\+Node} (const size\+\_\+t axis, const Tree\+Type $\ast$node, typename Tree\+Type\+::\+Elem\+Type \&axis\+Cut)
\begin{DoxyCompactList}\small\item\em Find a suitable partition of a leaf node along the provided axis. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Tree\+Type $>$ }\\static size\+\_\+t \textbf{ Sweep\+Non\+Leaf\+Node} (const size\+\_\+t axis, const Tree\+Type $\ast$node, typename Tree\+Type\+::\+Elem\+Type \&axis\+Cut)
\begin{DoxyCompactList}\small\item\em Find a suitable partition of a non-\/leaf node along the provided axis. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename Split\+Policy$>$\newline
class mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep$<$ Split\+Policy $>$}

The \doxyref{Minimal\+Splits\+Number\+Sweep}{p.}{classmlpack_1_1tree_1_1MinimalSplitsNumberSweep} class finds a partition along which we can split a node according to the number of required splits of the node. 

The class finds a partition along a given axis. Moreover, the class evaluates the cost of each split. The cost is proportional to the number of required splits and the difference of sizes of resulting nodes. If the resulting nodes are overflowed the maximum cost is returned.


\begin{DoxyTemplParams}{Template Parameters}
{\em Split\+Policy} & The class that provides rules for inserting children of a node that is being split into two new subtrees. \\
\hline
\end{DoxyTemplParams}


Definition at line 31 of file minimal\+\_\+splits\+\_\+number\+\_\+sweep.\+hpp.



\subsection{Member Function Documentation}
\mbox{\label{classmlpack_1_1tree_1_1MinimalSplitsNumberSweep_ae3fce128377ed8d175f2456b7c884d23}} 
\index{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep@{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep}!Sweep\+Leaf\+Node@{Sweep\+Leaf\+Node}}
\index{Sweep\+Leaf\+Node@{Sweep\+Leaf\+Node}!mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep@{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep}}
\subsubsection{Sweep\+Leaf\+Node()}
{\footnotesize\ttfamily static size\+\_\+t Sweep\+Leaf\+Node (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{axis,  }\item[{const Tree\+Type $\ast$}]{node,  }\item[{typename Tree\+Type\+::\+Elem\+Type \&}]{axis\+Cut }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [static]}}



Find a suitable partition of a leaf node along the provided axis. 

The method returns the cost of the split.


\begin{DoxyParams}{Parameters}
{\em axis} & The axis along which we are finding a partition. \\
\hline
{\em node} & The node that is being split. \\
\hline
{\em axis\+Cut} & The coordinate at which the node may be split. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1MinimalSplitsNumberSweep_a2d4cf3d46a0b6596fa799a2c7aad2459}} 
\index{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep@{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep}!Sweep\+Non\+Leaf\+Node@{Sweep\+Non\+Leaf\+Node}}
\index{Sweep\+Non\+Leaf\+Node@{Sweep\+Non\+Leaf\+Node}!mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep@{mlpack\+::tree\+::\+Minimal\+Splits\+Number\+Sweep}}
\subsubsection{Sweep\+Non\+Leaf\+Node()}
{\footnotesize\ttfamily static size\+\_\+t Sweep\+Non\+Leaf\+Node (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{axis,  }\item[{const Tree\+Type $\ast$}]{node,  }\item[{typename Tree\+Type\+::\+Elem\+Type \&}]{axis\+Cut }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [static]}}



Find a suitable partition of a non-\/leaf node along the provided axis. 

The method returns the cost of the split.


\begin{DoxyParams}{Parameters}
{\em axis} & The axis along which we are finding a partition. \\
\hline
{\em node} & The node that is being split. \\
\hline
{\em axis\+Cut} & The coordinate at which the node may be split. \\
\hline
\end{DoxyParams}


The documentation for this class was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+1/src/mlpack/core/tree/rectangle\+\_\+tree/\textbf{ minimal\+\_\+splits\+\_\+number\+\_\+sweep.\+hpp}\end{DoxyCompactItemize}
