21 for (
int i = 0; i < numSolutions; i++) {
25 if (numSolutions >= 2) {
28 if (numSolutions == 3) {
38 for (
int i = 0; i < numSolutions; i++) {
44 if (numSolutions >= 2) {
47 if (numSolutions == 3) {
57 for (
int i = 0; i < numSolutions; i++) {
66 if (numSolutions >= 2) {
69 if (numSolutions == 3) {
static void fuzz_cubic_roots_binary_search(double A, double B, double C, double D)
static void fuzz_cubic_real_roots(double A, double B, double C, double D)
static void fuzz_cubic_roots_valid_t(double A, double B, double C, double D)
#define DEF_FUZZ(name, f)
#define SkASSERT_RELEASE(cond)
bool sk_doubles_nearly_equal_ulps(double a, double b, uint8_t maxUlpsDiff=16)
static int BinarySearchRootsValidT(double A, double B, double C, double D, double solution[3])
static double EvalAt(double A, double B, double C, double D, double t)
static int RootsValidT(double A, double B, double C, double D, double solution[3])
static int RootsReal(double A, double B, double C, double D, double solution[3])