Lines Matching refs:roots
839 * array and places the non-complex roots back into the same array,
840 * returning the number of roots. The quadratic solved is represented
850 * @return the number of roots, or <code>-1</code> if the equation is
860 * array and places the non-complex roots into the <code>res</code>
861 * array, returning the number of roots.
872 * @param res the array that contains the non-complex roots
874 * @return the number of roots, or <code>-1</code> if the equation is
882 int roots = 0;
889 res[roots++] = -c / b;
894 // If d < 0.0, then there are no roots
908 res[roots++] = q / a;
910 res[roots++] = c / q;
913 return roots;