Loading graph_framework/arithmetic.hpp +0 −8 Original line number Diff line number Diff line Loading @@ -194,7 +194,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -225,7 +224,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Idenity reductions. if (this->left->is_match(this->right)) { Loading Loading @@ -710,7 +708,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -741,7 +738,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Common factor reduction. If the left and right are both muliply nodes check // for a common factor. So you can change a*b - a*c -> a*(b - c). Loading Loading @@ -1306,7 +1302,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -1337,7 +1332,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Move constants to the left. if (is_constant_promotable(this->right, this->left)) { Loading Loading @@ -2091,7 +2085,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -2122,7 +2115,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif if (this->left->is_match(this->right)) { return one<T, SAFE_MATH> (); Loading graph_framework/math.hpp +0 −2 Original line number Diff line number Diff line Loading @@ -898,7 +898,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -929,7 +928,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif auto lp = pow_cast(this->left); // Only run this reduction if the right is an integer constant value. Loading graph_framework/trigonometry.hpp +0 −2 Original line number Diff line number Diff line Loading @@ -601,7 +601,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -632,7 +631,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif return this->shared_from_this(); } Loading Loading
graph_framework/arithmetic.hpp +0 −8 Original line number Diff line number Diff line Loading @@ -194,7 +194,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -225,7 +224,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Idenity reductions. if (this->left->is_match(this->right)) { Loading Loading @@ -710,7 +708,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -741,7 +738,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Common factor reduction. If the left and right are both muliply nodes check // for a common factor. So you can change a*b - a*c -> a*(b - c). Loading Loading @@ -1306,7 +1302,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -1337,7 +1332,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif // Move constants to the left. if (is_constant_promotable(this->right, this->left)) { Loading Loading @@ -2091,7 +2085,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -2122,7 +2115,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif if (this->left->is_match(this->right)) { return one<T, SAFE_MATH> (); Loading
graph_framework/math.hpp +0 −2 Original line number Diff line number Diff line Loading @@ -898,7 +898,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -929,7 +928,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif auto lp = pow_cast(this->left); // Only run this reduction if the right is an integer constant value. Loading
graph_framework/trigonometry.hpp +0 −2 Original line number Diff line number Diff line Loading @@ -601,7 +601,6 @@ namespace graph { pr2->get_right()); } #if 1 // Combine 2D and 1D piecewise constants if a row or column matches. if (pr2.get() && pr2->is_row_match(this->left)) { backend::buffer<T> result = pl1->evaluate(); Loading Loading @@ -632,7 +631,6 @@ namespace graph { pl2->get_left(), pl2->get_right()); } #endif return this->shared_from_this(); } Loading