Rename files so they are under the absurd 100-byte filename limit.
This commit is contained in:
@@ -16,7 +16,7 @@
|
||||
#include <mlpack/core.hpp>
|
||||
|
||||
#include "fitness_functions/fitness_functions.hpp"
|
||||
#include "split_functions/split_functions.hpp"
|
||||
#include "splits/splits.hpp"
|
||||
#include "select_functions/select_functions.hpp"
|
||||
|
||||
namespace mlpack {
|
||||
|
||||
@@ -13,7 +13,7 @@
|
||||
#define MLPACK_METHODS_DECISION_TREE_SELECT_FUNCTIONS_SELECT_FUNCTIONS_HPP
|
||||
|
||||
#include "all_dimension_select.hpp"
|
||||
#include "multiple_random_dimension_select.hpp"
|
||||
#include "mult_random_dimension_select.hpp"
|
||||
#include "random_dimension_select.hpp"
|
||||
|
||||
#endif
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/all_categorical_split.hpp
|
||||
* @file methods/decision_tree/splits/all_categorical_split.hpp
|
||||
* @author Ryan Curtin
|
||||
*
|
||||
* This file defines a tree splitter that split a categorical feature into all
|
||||
@@ -10,8 +10,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_ALL_CATEGORICAL_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_ALL_CATEGORICAL_SPLIT_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_ALL_CATEGORICAL_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_ALL_CATEGORICAL_SPLIT_HPP
|
||||
|
||||
#include <mlpack/prereqs.hpp>
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/all_categorical_split_impl.hpp
|
||||
* @file methods/decision_tree/splits/all_categorical_split_impl.hpp
|
||||
* @author Ryan Curtin
|
||||
*
|
||||
* Implementation of the AllCategoricalSplit categorical split class.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_ALL_CATEGORICAL_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_ALL_CATEGORICAL_SPLIT_IMPL_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_ALL_CATEGORICAL_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_ALL_CATEGORICAL_SPLIT_IMPL_HPP
|
||||
|
||||
namespace mlpack {
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/best_binary_categorical_split.hpp
|
||||
* @file methods/decision_tree/splits/best_binary_categorical_split.hpp
|
||||
* @author Nikolay Apanasov (nikolay@apanasov.org)
|
||||
*
|
||||
* A tree splitter that finds the best binary categorical split.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_BEST_BINARY_CATEGORICAL_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_BEST_BINARY_CATEGORICAL_SPLIT_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_CATEGORICAL_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_CATEGORICAL_SPLIT_HPP
|
||||
|
||||
#include <mlpack/prereqs.hpp>
|
||||
|
||||
+1
-1
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/all_categorical_split_impl.hpp
|
||||
* @file methods/decision_tree/splits/all_categorical_split_impl.hpp
|
||||
* @author Nikolay Apanasov (nikolay@apanasov.org)
|
||||
*
|
||||
* Implementation of the BestBinaryCategoricalSplit categorical split class.
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/best_binary_numeric_split.hpp
|
||||
* @file methods/decision_tree/splits/best_binary_numeric_split.hpp
|
||||
* @author Ryan Curtin
|
||||
*
|
||||
* A tree splitter that finds the best binary numeric split.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_NUMERIC_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_NUMERIC_SPLIT_HPP
|
||||
|
||||
#include <mlpack/prereqs.hpp>
|
||||
#include <mlpack/methods/decision_tree/fitness_functions/mse_gain.hpp>
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/best_binary_numeric_split_impl.hpp
|
||||
* @file methods/decision_tree/splits/best_binary_numeric_split_impl.hpp
|
||||
* @author Ryan Curtin
|
||||
*
|
||||
* Implementation of strategy that finds the best binary numeric split.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_BEST_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
|
||||
namespace mlpack {
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/random_binary_numeric_split.hpp
|
||||
* @file methods/decision_tree/splits/random_binary_numeric_split.hpp
|
||||
* @author Rishabh Garg
|
||||
*
|
||||
* A tree splitter that finds a random binary numeric split.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_RANDOM_BINARY_NUMERIC_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_RANDOM_BINARY_NUMERIC_SPLIT_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_RANDOM_BINARY_NUMERIC_SPLIT_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_RANDOM_BINARY_NUMERIC_SPLIT_HPP
|
||||
|
||||
#include <mlpack/prereqs.hpp>
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/random_binary_numeric_split_impl.hpp
|
||||
* @file methods/decision_tree/splits/random_binary_numeric_split_impl.hpp
|
||||
* @author Rishabh Garg
|
||||
*
|
||||
* Implementation of strategy that finds the random binary numeric split.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_RANDOM_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_RANDOM_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLITS_RANDOM_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLITS_RANDOM_BINARY_NUMERIC_SPLIT_IMPL_HPP
|
||||
|
||||
#include <mlpack/core/math/random.hpp>
|
||||
|
||||
+3
-3
@@ -1,5 +1,5 @@
|
||||
/**
|
||||
* @file methods/decision_tree/split_functions/split_functions.hpp
|
||||
* @file methods/decision_tree/split_functions/splits.hpp
|
||||
* @author Abhimanyu Dayal
|
||||
*
|
||||
* Include all split policies for decision trees.
|
||||
@@ -9,8 +9,8 @@
|
||||
* 3-clause BSD license along with mlpack. If not, see
|
||||
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
|
||||
*/
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLIT_FUNCTIONS_SPLIT_FUNCTIONS_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLIT_FUNCTIONS_SPLIT_FUNCTIONS_HPP
|
||||
#ifndef MLPACK_METHODS_DECISION_TREE_SPLIT_FUNCTIONS_SPLITS_HPP
|
||||
#define MLPACK_METHODS_DECISION_TREE_SPLIT_FUNCTIONS_SPLITS_HPP
|
||||
|
||||
#include "all_categorical_split.hpp"
|
||||
#include "best_binary_numeric_split.hpp"
|
||||
Reference in New Issue
Block a user