[mlpack-git] master: Fix spacing. (1dad2b6)
gitdub at mlpack.org
gitdub at mlpack.org
Mon May 30 18:39:27 EDT 2016
Repository : https://github.com/mlpack/mlpack
On branch : master
Link : https://github.com/mlpack/mlpack/compare/2fe9e82b63507ef60440c22c93d85d058023535c...1dad2b662d595097d77f4f0608e22aaa5546bd67
>---------------------------------------------------------------
commit 1dad2b662d595097d77f4f0608e22aaa5546bd67
Author: Ryan Curtin <ryan at ratml.org>
Date: Mon May 30 18:39:13 2016 -0400
Fix spacing.
>---------------------------------------------------------------
1dad2b662d595097d77f4f0608e22aaa5546bd67
src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp | 10 +++++-----
src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp | 8 ++++----
src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp | 4 ++--
src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp | 10 +++++-----
4 files changed, 16 insertions(+), 16 deletions(-)
diff --git a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp
index 49adbe8..44dbf95 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split_impl.hpp
@@ -60,7 +60,7 @@ void RStarTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& r
tree->Children()[(tree->NumChildren())++] = copy;
assert(tree->NumChildren() == 1);
- copy->Split().SplitLeafNode(copy,relevels);
+ copy->Split().SplitLeafNode(copy, relevels);
return;
}
@@ -77,7 +77,7 @@ void RStarTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& r
size_t p = tree->MaxLeafSize() * 0.3; // The paper says this works the best.
if (p == 0)
{
- tree->Split().SplitLeafNode(tree,relevels);
+ tree->Split().SplitLeafNode(tree, relevels);
return;
}
@@ -270,7 +270,7 @@ void RStarTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& r
// just in case, we use an assert.
assert(par->NumChildren() <= par->MaxNumChildren() + 1);
if (par->NumChildren() == par->MaxNumChildren() + 1)
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
assert(treeOne->Parent()->NumChildren() <= treeOne->MaxNumChildren());
assert(treeOne->Parent()->NumChildren() >= treeOne->MinNumChildren());
@@ -306,7 +306,7 @@ bool RStarTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>
tree->NullifyData();
tree->Children()[(tree->NumChildren())++] = copy;
- copy->Split().SplitNonLeafNode(copy,relevels);
+ copy->Split().SplitNonLeafNode(copy, relevels);
return true;
}
@@ -662,7 +662,7 @@ bool RStarTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>
assert(par->NumChildren() <= par->MaxNumChildren() + 1);
if (par->NumChildren() == par->MaxNumChildren() + 1)
{
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
}
// We have to update the children of each of these new nodes so that they
diff --git a/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp b/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
index 442e49f..69bf041 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
@@ -53,7 +53,7 @@ void RTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& relev
tree->NullifyData();
// Because this was a leaf node, numChildren must be 0.
tree->Children()[(tree->NumChildren())++] = copy;
- copy->Split().SplitLeafNode(copy,relevels);
+ copy->Split().SplitLeafNode(copy, relevels);
return;
}
@@ -84,7 +84,7 @@ void RTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& relev
// just in case, we use an assert.
assert(par->NumChildren() <= par->MaxNumChildren() + 1);
if (par->NumChildren() == par->MaxNumChildren() + 1)
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
assert(treeOne->Parent()->NumChildren() <= treeOne->MaxNumChildren());
assert(treeOne->Parent()->NumChildren() >= treeOne->MinNumChildren());
@@ -116,7 +116,7 @@ bool RTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>& re
tree->NumChildren() = 0;
tree->NullifyData();
tree->Children()[(tree->NumChildren())++] = copy;
- copy->Split().SplitNonLeafNode(copy,relevels);
+ copy->Split().SplitNonLeafNode(copy, relevels);
return true;
}
@@ -149,7 +149,7 @@ bool RTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>& re
assert(par->NumChildren() <= par->MaxNumChildren() + 1);
if (par->NumChildren() == par->MaxNumChildren() + 1)
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
// We have to update the children of each of these new nodes so that they
// record the correct parent.
diff --git a/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp b/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
index 8184f89..d993a45 100644
--- a/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/rectangle_tree_impl.hpp
@@ -667,7 +667,7 @@ void RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType>::
// If we are full, then we need to split (or at least try). The SplitType
// takes care of this and of moving up the tree if necessary.
- split.SplitLeafNode(this,relevels);
+ split.SplitLeafNode(this, relevels);
}
else
{
@@ -677,7 +677,7 @@ void RectangleTree<MetricType, StatisticType, MatType, SplitType, DescentType>::
// If we are full, then we need to split (or at least try). The SplitType
// takes care of this and of moving up the tree if necessary.
- split.SplitNonLeafNode(this,relevels);
+ split.SplitNonLeafNode(this, relevels);
}
}
diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp
index a619b72..0b43454 100644
--- a/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/x_tree_split_impl.hpp
@@ -66,7 +66,7 @@ void XTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& relev
// Because this was a leaf node, numChildren must be 0.
tree->Children()[(tree->NumChildren())++] = copy;
assert(tree->NumChildren() == 1);
- copy->Split().SplitLeafNode(copy,relevels);
+ copy->Split().SplitLeafNode(copy, relevels);
return;
}
@@ -84,7 +84,7 @@ void XTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& relev
size_t p = tree->MaxLeafSize() * 0.3;
if (p == 0)
{
- tree->Split().SplitLeafNode(tree,relevels);
+ tree->Split().SplitLeafNode(tree, relevels);
return;
}
@@ -297,7 +297,7 @@ void XTreeSplit<TreeType>::SplitLeafNode(TreeType *tree,std::vector<bool>& relev
// in case, we use an assert.
assert(par->NumChildren() <= par->MaxNumChildren() + 1);
if (par->NumChildren() == par->MaxNumChildren() + 1)
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
assert(treeOne->Parent()->NumChildren() <=
treeOne->Parent()->MaxNumChildren());
@@ -336,7 +336,7 @@ bool XTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>& re
tree->NumChildren() = 0;
tree->NullifyData();
tree->Children()[(tree->NumChildren())++] = copy;
- copy->Split().SplitNonLeafNode(copy,relevels);
+ copy->Split().SplitNonLeafNode(copy, relevels);
return true;
}
@@ -830,7 +830,7 @@ bool XTreeSplit<TreeType>::SplitNonLeafNode(TreeType *tree,std::vector<bool>& re
if (par->NumChildren() == par->MaxNumChildren() + 1)
{
- par->Split().SplitNonLeafNode(par,relevels);
+ par->Split().SplitNonLeafNode(par, relevels);
}
// We have to update the children of each of these new nodes so that they
More information about the mlpack-git
mailing list