286     /* Best model (so far) */
291     } best;  member
590  * - The buffer for the best-so-far homography
605     best.inl    = NULL;  in initialize()
606     best.numInl = 0;  in initialize()
774     return isBestModelGoodEnough() ? best.numInl : 0;  in rhoHest()
825     best.H      = (float*)     (ptr + best_H_of);  in allocatePerObj()
862     best.inl  = (char*)(ptr + best_inl_of);  in allocatePerRun()
874     best.inl  = NULL;  in deallocatePerRun()
891     best.H      = NULL;  in deallocatePerObj()
909  * Writes: curr.*, best.*, ctrl.*, eval.*
970     memset(best.inl, 0, arg.N);  in initRun()
995     memset(best.H, 0, HSIZE);  in initRun()
996     best.numInl       = 0;  in initRun()
1014  * the best and current inlier masks, which are equal in size to p->arg.N
1017  * Reads:  arg.bestInl, curr.inl, best.inl
1018  * Writes: curr.inl, best.inl
1057  * everything before, save as new best model (and possibly refine it).
1104  * Check whether best-model-so-far refinement is enabled.
1106  * @return Zero if best-model-so-far refinement disabled; non-zero if not.
1562  * Return whether the current model is the best model so far.
1567  * Reads    (direct): curr.numInl, best.numInl
1574     return curr.numInl > best.numInl;  in isBestModel()
1578  * Returns whether the current-best model is good enough to be an
1579  * acceptable best model, by checking whether it meets the minimum
1585  * Reads    (direct): best.numInl, arg.minInl
1592     return best.numInl >= arg.minInl;  in isBestModelGoodEnough()
1596  * Make current model new best model by swapping the homography, inlier mask
1597  * and count of inliers between the current and best models.
1600  *                    best.H, best.inl, best.numInl
1603  *                    best.H, best.inl, best.numInl
1612     curr.H       = best.H;  in saveBestModel()
1613     curr.inl     = best.inl;  in saveBestModel()
1614     curr.numInl  = best.numInl;  in saveBestModel()
1616     best.H       = H;  in saveBestModel()
1617     best.inl     = inl;  in saveBestModel()
1618     best.numInl  = numInl;  in saveBestModel()
1645  * Reads    (direct): arg.N, best.numInl, nr.tbl, arg.inl, ctrl.phMax,
1656     unsigned bestNumInl   = best.numInl;  in nStarOptimize()
1667         testNumInl -= !!best.inl[test_n-1];  in nStarOptimize()
1683  * Reads    (direct): arg.maxI, arg.cfd, best.numInl, arg.N
1691                                 (double)best.numInl/arg.N,  in updateBounds()
1697  * Ouput the best model so far to the output argument.
1699  * Reads    (direct): arg.finalH, best.H, arg.inl, best.inl, arg.N
1707         memcpy(arg.finalH, best.H, HSIZE);  in outputModel()
1709             memcpy(arg.inl, best.inl, arg.N);  in outputModel()
1755  * proportion of inliers in the best model so far and sample size.
2061  * Reads    (direct): best.numInl
2073     return best.numInl > (unsigned)SMPL_SIZE;  in canRefine()
2078  * Refines the best-so-far homography (p->best.H).
2080  * Reads    (direct): best.H, arg.src, arg.dst, best.inl, arg.N, lm.JtJ,
2083  * Writes   (direct): best.H, lm.JtJ, lm.Jte, lm.tmp1
2098     sacCalcJacobianErrors(best.H, arg.src, arg.dst, best.inl, arg.N,  in refine()
2115          * the solution x becomes a step (dH) that is applied to best.H in  in refine()
2129         sacSub8x1     (newH,       best.H,  dH);  in refine()
2130         sacCalcJacobianErrors(newH, arg.src, arg.dst, best.inl, arg.N,  in refine()
2157             memcpy(best.H, newH, sizeof(newH));  in refine()
2158             sacCalcJacobianErrors(best.H, arg.src, arg.dst, best.inl, arg.N,  in refine()