diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2021-11-21 17:04:21 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2021-11-21 17:09:35 +0900 |
| commit | e6ba08c3b21cdb14ee3a97b5d584759a4597b54b (patch) | |
| tree | e8b4121323f2f448aeaa15bf3bddb465f36aea8b /debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp | |
| parent | f312c235ea5f9971066f3808997d20f89c25f33b (diff) | |
| download | extra-dependencies-e6ba08c3b21cdb14ee3a97b5d584759a4597b54b.tar.gz extra-dependencies-e6ba08c3b21cdb14ee3a97b5d584759a4597b54b.zip | |
uncrustify-trinity: updated based on upstream version 0.74.0
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp')
| -rw-r--r-- | debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp | 61 |
1 files changed, 0 insertions, 61 deletions
diff --git a/debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp b/debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp deleted file mode 100644 index 6f49594d..00000000 --- a/debian/uncrustify-trinity/uncrustify-trinity-0.73.0/tests/input/cpp/toggle_processing_cmt.cpp +++ /dev/null @@ -1,61 +0,0 @@ -void func() { } - -// **ABC** -void func() { } -// *INDENT-ON* - -void func() { } - -/** - * Function to solve for roots of a generic quartic polynomial of the following form: - * \verbatim - - p(x) = a * x^4 + b * x^3 + c * x^2 + d * x + e, - - where a, b, c, d, and e are real coefficients - - * \endverbatim - * - * This object's tolerance defines a threshold for root solutions above which iterative methods will be employed to achieve the desired accuracy - * - * \verbatim - this should cause the following line to not wrap due to cmt_width - * Upon success, the roots array contains the solution to the polynomial p(x) = 0 - * \endverbatim - * + Return value on output: - * - 0, if an error occurs (invalid coefficients) - * - 1, if all roots are real - * - 2, if two roots are real and two roots are complex conjugates - * - 3, if the roots are two pairs of complex conjugates - */ -int solve(double a, - double b, - double c, - double d, - double e, - std::complex<double> roots[4]); - -/** - * Function to solve for roots of a generic quartic polynomial of the following form: - * - - p(x) = a * x^4 + b * x^3 + c * x^2 + d * x + e, - where a, b, c, d, and e are real coefficients - * - * Upon success, root1, root2, root3, and root4 contain the solution to the polynomial p(x) = 0 - * + Return value on output: - * - 0, if an error occurs (invalid coefficients) - * - 1, if all roots are real - * - 2, if two roots are real and two roots are complex conjugates - * - 3, if the roots are two pairs of complex conjugates - */ -/* **ABC** */ - int solve(double a, - double b, - double c, - double d, - double e, - std::complex<double> &root1, - std::complex<double> &root2, - std::complex<double> &root3, - std::complex<double> &root4); -/* ??DEF?? */ |
