[mlpack-git] master: spelling (7f75271)
gitdub at mlpack.org
gitdub at mlpack.org
Tue Oct 4 09:30:38 EDT 2016
Repository : https://github.com/mlpack/mlpack
On branch : master
Link : https://github.com/mlpack/mlpack/compare/a27725526b5b0168175b3dd50b92b7121fb49c91...9ef7339d40550a974b3939e9fcb966fac2c09065
>---------------------------------------------------------------
commit 7f75271cff7f4f64d78feac798b2a0c350b7d13b
Author: Barak A. Pearlmutter <barak+git at pearlmutter.net>
Date: Tue Jul 19 12:02:32 2016 +0200
spelling
Gbp-Pq: Name 0003-spelling.patch
>---------------------------------------------------------------
7f75271cff7f4f64d78feac798b2a0c350b7d13b
doc/policies/trees.hpp | 2 +-
doc/tutorials/range_search/range_search.txt | 2 +-
src/mlpack/core/tree/cosine_tree/cosine_tree.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp | 2 +-
src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp | 2 +-
src/mlpack/core/util/backtrace.cpp | 2 +-
src/mlpack/core/util/backtrace.hpp | 2 +-
src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp | 2 +-
14 files changed, 14 insertions(+), 14 deletions(-)
diff --git a/doc/policies/trees.hpp b/doc/policies/trees.hpp
index 89bed8c..c15ef39 100644
--- a/doc/policies/trees.hpp
+++ b/doc/policies/trees.hpp
@@ -748,7 +748,7 @@ The \c RangeDistance() function allows a way for both bounds to be calculated at
once. It is possible to implement this as a call to \c MinDistance() followed
by a call to \c MaxDistance(), but this may incur more metric \c Evaluate()
calls than necessary. Often calculating both bounds at once can be more
-efficent and can be done with fewer \c Evaluate() calls than calling both
+efficient and can be done with fewer \c Evaluate() calls than calling both
\c MinDistance() and \c MaxDistance().
@subsection treetype_rigorous_serialization Serialization
diff --git a/doc/tutorials/range_search/range_search.txt b/doc/tutorials/range_search/range_search.txt
index 277a844..645f623 100644
--- a/doc/tutorials/range_search/range_search.txt
+++ b/doc/tutorials/range_search/range_search.txt
@@ -47,7 +47,7 @@ A list of all the sections this tutorial contains.
@section cli_rstut The 'mlpack_range_search' command-line executable
-\b mlpack provides an exectuable, \c mlpack_range_search, which can be used to
+\b mlpack provides an executable, \c mlpack_range_search, which can be used to
perform range searches quickly and simply from the command-line. This program
will perform the range search and place the resulting neighbor index list into
one file and their corresponding distances into another file. These files are
diff --git a/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp b/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp
index a734a3d..16bcb6c 100644
--- a/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp
+++ b/src/mlpack/core/tree/cosine_tree/cosine_tree.hpp
@@ -137,7 +137,7 @@ class CosineTree
* a significant speedup when there are large number of columns to choose from
* and when a number of samples are to be drawn from the distribution.
*
- * @param cDistribution Cumulative LS distibution of columns in the node.
+ * @param cDistribution Cumulative LS distribution of columns in the node.
* @param value Randomly generated value in the range [0, 1].
* @param start Starting index of the distribution interval to search in.
* @param end Ending index of the distribution interval to search in.
diff --git a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp
index a2a12b0..4c96f53 100644
--- a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value.hpp
@@ -2,7 +2,7 @@
* @file discrete_hilbert_value.hpp
* @author Mikhail Lozhnikov
*
- * Defintion of the DiscreteHilbertValue class, a class that calculates
+ * Definition of the DiscreteHilbertValue class, a class that calculates
* the ordering of points using the Hilbert curve.
*/
#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DISCRETE_HILBERT_VALUE_HPP
diff --git a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
index 4b74617..d22d26a 100644
--- a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
@@ -2,7 +2,7 @@
* @file discrete_hilbert_value.hpp
* @author Mikhail Lozhnikov
*
- * Defintion of the DiscreteHilbertValue class, a class that calculates
+ * Definition of the DiscreteHilbertValue class, a class that calculates
* the ordering of points using the Hilbert curve.
*/
#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DISCRETE_HILBERT_VALUE_IMPL_HPP
diff --git a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp
index 90fd77e..bda835d 100644
--- a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_split.hpp
@@ -2,7 +2,7 @@
* @file hilbert_r_tree_split.hpp
* @author Mikhail Lozhnikov
*
- * Defintion of the HilbertRTreeSplit class, a class that splits the nodes of an R
+ * Definition of the HilbertRTreeSplit class, a class that splits the nodes of an R
* tree, starting at a leaf node and moving upwards if necessary.
*/
#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_SPLIT_HPP
diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp
index 3941d13..0b7ae4e 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_split_policy.hpp
@@ -2,7 +2,7 @@
* @file r_plus_plus_tree_split_policy.hpp
* @author Mikhail Lozhnikov
*
- * Defintion and implementation of the RPlusPlusTreeSplitPolicy class, a class
+ * Definition and implementation of the RPlusPlusTreeSplitPolicy class, a class
* that helps to determine the subtree into which we should insert an
* intermediate node.
*/
diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp
index 31787b9..1f082e0 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_plus_tree_split_policy.hpp
@@ -2,7 +2,7 @@
* @file r_plus_tree_split_policy.hpp
* @author Mikhail Lozhnikov
*
- * Defintion and implementation of the RPlusTreeSplitPolicy class, a class that
+ * Definition and implementation of the RPlusTreeSplitPolicy class, a class that
* helps to determine the subtree into which we should insert an intermediate
* node.
*/
diff --git a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp
index c3d48c4..d672632 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp
@@ -2,7 +2,7 @@
* @file r_tree_star_split.hpp
* @author Andrew Wells
*
- * Defintion of the RStarTreeSplit class, a class that splits the nodes of an R tree, starting
+ * Definition of the RStarTreeSplit class, a class that splits the nodes of an R tree, starting
* at a leaf node and moving upwards if necessary.
*/
#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP
diff --git a/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp
index 5dd3faf..53392e2 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp
@@ -2,7 +2,7 @@
* @file r_tree_split.hpp
* @author Andrew Wells
*
- * Defintion of the RTreeSplit class, a class that splits the nodes of an R
+ * Definition of the RTreeSplit class, a class that splits the nodes of an R
* tree, starting at a leaf node and moving upwards if necessary.
*/
#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP
diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
index ecdc060..16828a0 100644
--- a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
@@ -2,7 +2,7 @@
* @file x_tre_split.hpp
* @author Andrew Wells
*
- * Defintion of the XTreeSplit class, a class that splits the nodes of an X
+ * Definition of the XTreeSplit class, a class that splits the nodes of an X
* tree, starting at a leaf node and moving upwards if necessary.
*
* This is known to have a bug: see #368.
diff --git a/src/mlpack/core/util/backtrace.cpp b/src/mlpack/core/util/backtrace.cpp
index 582177b..e1cbc85 100644
--- a/src/mlpack/core/util/backtrace.cpp
+++ b/src/mlpack/core/util/backtrace.cpp
@@ -141,7 +141,7 @@ void Backtrace::DecodeAddress(long addr)
if (FIND_LINE)
{
DemangleFunction();
- // Save retrieved informations.
+ // Save retrieved information.
stack.push_back(frame);
}
}
diff --git a/src/mlpack/core/util/backtrace.hpp b/src/mlpack/core/util/backtrace.hpp
index 78d6ca4..bf45324 100644
--- a/src/mlpack/core/util/backtrace.hpp
+++ b/src/mlpack/core/util/backtrace.hpp
@@ -16,7 +16,7 @@ namespace mlpack {
* Provides a backtrace.
*
* The Backtrace class retrieve addresses of each called function from the
- * stack and decode file name, function & line number. Retrieved informations
+ * stack and decode file name, function & line number. Retrieved information
* can be printed in form:
*
* @code
diff --git a/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp b/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp
index 90daccc..a6cc308 100644
--- a/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp
+++ b/src/mlpack/methods/naive_bayes/naive_bayes_classifier.hpp
@@ -22,7 +22,7 @@ namespace naive_bayes /** The Naive Bayes Classifier. */ {
* last row of the data input to the constructor.
*
* Mathematically, it computes P(X_i = x_i | Y = y_j) for each feature X_i for
- * each of the labels y_j. Alongwith this, it also computes the classs
+ * each of the labels y_j. Alongwith this, it also computes the class
* probabilities P(Y = y_j).
*
* For classifying a data point (x_1, x_2, ..., x_n), it computes the following:
More information about the mlpack-git
mailing list