Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[pre-commit.ci] pre-commit autoupdate #317

Merged
merged 2 commits into from
May 14, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .pre-commit-config.yaml
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ ci:
autoupdate_branch: 'devel'
repos:
- repo: https://github.com/pre-commit/mirrors-clang-format
rev: v18.1.4
rev: v18.1.5
hooks:
- id: clang-format
args: ['--style={BasedOnStyle: Mozilla, SortIncludes: false}']
Expand Down
20 changes: 12 additions & 8 deletions include/proxsuite/proxqp/dense/solver.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -1793,29 +1793,33 @@ qp_solve( //
std::cout << "objective: " << qpresults.info.objValue << std::endl;
switch (qpresults.info.status) {
case QPSolverOutput::PROXQP_SOLVED: {
std::cout << "status: " << "Solved" << std::endl;
std::cout << "status: "
<< "Solved" << std::endl;
break;
}
case QPSolverOutput::PROXQP_MAX_ITER_REACHED: {
std::cout << "status: " << "Maximum number of iterations reached"
<< std::endl;
std::cout << "status: "
<< "Maximum number of iterations reached" << std::endl;
break;
}
case QPSolverOutput::PROXQP_PRIMAL_INFEASIBLE: {
std::cout << "status: " << "Primal infeasible" << std::endl;
std::cout << "status: "
<< "Primal infeasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_DUAL_INFEASIBLE: {
std::cout << "status: " << "Dual infeasible" << std::endl;
std::cout << "status: "
<< "Dual infeasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_SOLVED_CLOSEST_PRIMAL_FEASIBLE: {
std::cout << "status: " << "Solved closest primal feasible"
<< std::endl;
std::cout << "status: "
<< "Solved closest primal feasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_NOT_RUN: {
std::cout << "status: " << "Solver not run" << std::endl;
std::cout << "status: "
<< "Solver not run" << std::endl;
break;
}
}
Expand Down
20 changes: 12 additions & 8 deletions include/proxsuite/proxqp/sparse/solver.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -1630,29 +1630,33 @@ qp_solve(Results<T>& results,
std::cout << "objective: " << results.info.objValue << std::endl;
switch (results.info.status) {
case QPSolverOutput::PROXQP_SOLVED: {
std::cout << "status: " << "Solved" << std::endl;
std::cout << "status: "
<< "Solved" << std::endl;
break;
}
case QPSolverOutput::PROXQP_MAX_ITER_REACHED: {
std::cout << "status: " << "Maximum number of iterations reached"
<< std::endl;
std::cout << "status: "
<< "Maximum number of iterations reached" << std::endl;
break;
}
case QPSolverOutput::PROXQP_PRIMAL_INFEASIBLE: {
std::cout << "status: " << "Primal infeasible" << std::endl;
std::cout << "status: "
<< "Primal infeasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_DUAL_INFEASIBLE: {
std::cout << "status: " << "Dual infeasible" << std::endl;
std::cout << "status: "
<< "Dual infeasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_SOLVED_CLOSEST_PRIMAL_FEASIBLE: {
std::cout << "status: " << "Solved closest primal feasible"
<< std::endl;
std::cout << "status: "
<< "Solved closest primal feasible" << std::endl;
break;
}
case QPSolverOutput::PROXQP_NOT_RUN: {
std::cout << "status: " << "Solver not run" << std::endl;
std::cout << "status: "
<< "Solver not run" << std::endl;
break;
}
}
Expand Down
Loading