[mlpack-git] master: spelling (b9b4095)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/a27725526b5b0168175b3dd50b92b7121fb49c91...9ef7339d40550a974b3939e9fcb966fac2c09065

>---------------------------------------------------------------

commit b9b4095c307701363165b569d0ee2e0d2c013f62
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


>---------------------------------------------------------------

b9b4095c307701363165b569d0ee2e0d2c013f62
 .../tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp  | 2 +-
 src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp  | 2 +-
 .../rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp     | 2 +-
 .../core/tree/rectangle_tree/x_tree_auxiliary_information.hpp     | 8 ++++----
 src/mlpack/core/tree/space_split/hyperplane.hpp                   | 2 +-
 src/mlpack/methods/ann/init_rules/random_init.hpp                 | 2 +-
 src/mlpack/methods/neighbor_search/ns_model.hpp                   | 4 ++--
 7 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp
index 4db0fa6..ad15882 100644
--- a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_auxiliary_information.hpp
@@ -106,7 +106,7 @@ class HilbertRTreeAuxiliaryInformation
 
   /**
    * Update the auxiliary information in the node. The method returns true if
-   * the update should be propogated downward.
+   * the update should be propagated downward.
    *
    * @param node The node in which the auxiliary information being update.
    */
diff --git a/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp
index c0772f8..af424be 100644
--- a/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/no_auxiliary_information.hpp
@@ -99,7 +99,7 @@ class NoAuxiliaryInformation
   /**
    * Some tree types require to propagate the information upward.
    * This method should return false if this is not the case. If true is
-   * returned, the update will be propogated upward.
+   * returned, the update will be propagated upward.
    *
    * @param node The node in which the auxiliary information being update.
    */
diff --git a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp
index 768c870..c31d5a0 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp
@@ -112,7 +112,7 @@ class RPlusPlusTreeAuxiliaryInformation
   /**
    * Some tree types require to propagate the information upward.
    * This method should return false if this is not the case. If true is
-   * returned, the update will be propogated upward.
+   * returned, the update will be propagated upward.
    *
    * @param node The node in which the auxiliary information being update.
    */
diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp
index ed4a317..7a1f2f2 100644
--- a/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/x_tree_auxiliary_information.hpp
@@ -26,7 +26,7 @@ class XTreeAuxiliaryInformation
   { };
 
   /**
-   * Construct this whith the specified node.
+   * Construct this with the specified node.
    *
    * @param node The node that stores this auxiliary information.
    */
@@ -143,7 +143,7 @@ class XTreeAuxiliaryInformation
   /**
    * Some tree types require to propagate the information upward.
    * This method should return false if this is not the case. If true is
-   * returned, the update will be propogated upward.
+   * returned, the update will be propagated upward.
    * @param node The node in which the auxiliary information being update.
    */
   bool UpdateAuxiliaryInfo(TreeType* )
@@ -210,9 +210,9 @@ class XTreeAuxiliaryInformation
   size_t NormalNodeMaxNumChildren() const { return normalNodeMaxNumChildren; }
   //! Modify the maximum number of a normal node's children.
   size_t& NormalNodeMaxNumChildren() { return normalNodeMaxNumChildren; }
-  //! Return the split history of the node assosiated with this object.
+  //! Return the split history of the node associated with this object.
   const SplitHistoryStruct& SplitHistory() const { return splitHistory; }
-  //! Modify the split history of the node assosiated with this object.
+  //! Modify the split history of the node associated with this object.
   SplitHistoryStruct& SplitHistory() { return splitHistory; }
 
   /**
diff --git a/src/mlpack/core/tree/space_split/hyperplane.hpp b/src/mlpack/core/tree/space_split/hyperplane.hpp
index b64e54a..850e5e0 100644
--- a/src/mlpack/core/tree/space_split/hyperplane.hpp
+++ b/src/mlpack/core/tree/space_split/hyperplane.hpp
@@ -57,7 +57,7 @@ class HyperplaneBase
   {};
 
   /**
-   * Project the given point on the projection vector and substract th
+   * Project the given point on the projection vector and subtract the
    * split value.
    *
    * @param point Point to be projected.
diff --git a/src/mlpack/methods/ann/init_rules/random_init.hpp b/src/mlpack/methods/ann/init_rules/random_init.hpp
index d3c7064..c9f31ba 100644
--- a/src/mlpack/methods/ann/init_rules/random_init.hpp
+++ b/src/mlpack/methods/ann/init_rules/random_init.hpp
@@ -32,7 +32,7 @@ class RandomInitialization
 
   /**
    * Initialize the random initialization rule with the given bound.
-   * Using the negative of the bound as lower bound and the postive bound as
+   * Using the negative of the bound as lower bound and the positive bound as
    * upper bound.
    *
    * @param bound The number used as lower bound
diff --git a/src/mlpack/methods/neighbor_search/ns_model.hpp b/src/mlpack/methods/neighbor_search/ns_model.hpp
index 4f4c47d..ac40084 100644
--- a/src/mlpack/methods/neighbor_search/ns_model.hpp
+++ b/src/mlpack/methods/neighbor_search/ns_model.hpp
@@ -84,7 +84,7 @@ class MonoSearchVisitor : public boost::static_visitor<void>
 
 /**
  * BiSearchVisitor executes a bichromatic neighbor search on the given NSType.
- * We use template specialization to differenciate those tree types that
+ * We use template specialization to differentiate those tree types that
  * accept leafSize as a parameter. In these cases, before doing neighbor search,
  * a query tree with proper leafSize is built from the querySet.
  */
@@ -145,7 +145,7 @@ class BiSearchVisitor : public boost::static_visitor<void>
 
 /**
  * TrainVisitor sets the reference set to a new reference set on the given
- * NSType. We use template specialization to differenciate those tree types that
+ * NSType. We use template specialization to differentiate those tree types that
  * accept leafSize as a parameter. In these cases, a reference tree with proper
  * leafSize is built from the referenceSet.
  */