42   const RootsType& roots( psolve.roots() );  in aux_evalSolver()  local
44   for( int i=0; i<roots.size(); ++i ){  in aux_evalSolver()
45     evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }  in aux_evalSolver()
52     cerr << "Roots found: " << roots.transpose() << endl;  in aux_evalSolver()
53     cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl;  in aux_evalSolver()
57   std::vector<Scalar> rootModuli( roots.size() );  in aux_evalSolver()
58   Map< EvalRootsType > aux( &rootModuli[0], roots.size() );  in aux_evalSolver()
59   aux = roots.array().abs();  in aux_evalSolver()
92 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
93 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro…  in evalSolverSugarFunction()  argument
104     // 1) the roots found are correct  in evalSolverSugarFunction()
105     // 2) the roots have distinct moduli  in evalSolverSugarFunction()
128     VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),  in evalSolverSugarFunction()
132     VERIFY( internal::isApprox( roots.array().abs().minCoeff(),  in evalSolverSugarFunction()