55   const RootsType& roots( psolve.roots() );  in aux_evalSolver()  local
59   for( int i=0; i<roots.size(); ++i ){  in aux_evalSolver()
60     evr[i] = std::abs( poly_eval( pols, roots[i] ) );  in aux_evalSolver()
61     der[i] = numext::maxi(RealScalar(1.), std::abs( poly_eval( pols_der, roots[i] ) ));  in aux_evalSolver()
72     cerr << "Roots found: " << roots.transpose() << endl;  in aux_evalSolver()
73     cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl;  in aux_evalSolver()
77   std::vector<RealScalar> rootModuli( roots.size() );  in aux_evalSolver()
78   Map< EvalRootsType > aux( &rootModuli[0], roots.size() );  in aux_evalSolver()
79   aux = roots.array().abs();  in aux_evalSolver()
112 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
113 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro…  in evalSolverSugarFunction()  argument
125     // 1) the roots found are correct  in evalSolverSugarFunction()
126     // 2) the roots have distinct moduli  in evalSolverSugarFunction()
147     VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),  in evalSolverSugarFunction()
151     VERIFY( internal::isApprox( roots.array().abs().minCoeff(),  in evalSolverSugarFunction()