| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // This file is part of INSTINCT, the INS Toolkit for Integrated | ||
| 2 | // Navigation Concepts and Training by the Institute of Navigation of | ||
| 3 | // the University of Stuttgart, Germany. | ||
| 4 | // | ||
| 5 | // This Source Code Form is subject to the terms of the Mozilla Public | ||
| 6 | // License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| 7 | // file, You can obtain one at https://mozilla.org/MPL/2.0/. | ||
| 8 | |||
| 9 | #include "PolynomialRegressor.hpp" | ||
| 10 | |||
| 11 | namespace NAV | ||
| 12 | { | ||
| 13 | |||
| 14 | ✗ | const char* to_string(PolynomialRegressor<>::Strategy strategy) | |
| 15 | { | ||
| 16 | ✗ | switch (strategy) | |
| 17 | { | ||
| 18 | ✗ | case PolynomialRegressor<>::Strategy::IncrementalLeastSquares: | |
| 19 | ✗ | return "Incremental Least Squares"; | |
| 20 | ✗ | case PolynomialRegressor<>::Strategy::LeastSquares: | |
| 21 | ✗ | return "Least Squares"; | |
| 22 | ✗ | case PolynomialRegressor<>::Strategy::HouseholderQR: | |
| 23 | ✗ | return "Householder QR"; | |
| 24 | ✗ | case PolynomialRegressor<>::Strategy::BDCSVD: | |
| 25 | ✗ | return "Bidiagonal Divide and Conquer SVD"; | |
| 26 | ✗ | case PolynomialRegressor<>::Strategy::COD: | |
| 27 | ✗ | return "Complete Orthogonal Decomposition"; | |
| 28 | ✗ | case PolynomialRegressor<>::Strategy::COUNT: | |
| 29 | ✗ | return ""; | |
| 30 | } | ||
| 31 | ✗ | return ""; | |
| 32 | } | ||
| 33 | |||
| 34 | } // namespace NAV | ||
| 35 |