1002     edge* leftmost = 0;  in rect_nfa()  local
1007             if(!leftmost) // if uninitialized  in rect_nfa()
1009                 leftmost = &ordered_x[i];  in rect_nfa()
1011             else if (leftmost->p.x > ordered_x[i].p.x)  in rect_nfa()
1013                 leftmost = &ordered_x[i];  in rect_nfa()
1017     leftmost->taken = true;  in rect_nfa()
1055     double flstep = (min_y->p.y != leftmost->p.y) ?  in rect_nfa()
1056 …                 (min_y->p.x - leftmost->p.x) / (min_y->p.y - leftmost->p.y) : 0; //first left step  in rect_nfa()
1057     double slstep = (leftmost->p.y != tailp->p.x) ?  in rect_nfa()
1058 …                (leftmost->p.x - tailp->p.x) / (leftmost->p.y - tailp->p.x) : 0; //second left step  in rect_nfa()
1088         if(y >= leftmost->p.y) { lstep = slstep; }  in rect_nfa()