291     } best;  member
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()
970     memset(best.inl, 0, arg.N);  in initRun()
995     memset(best.H, 0, HSIZE);  in initRun()
996     best.numInl       = 0;  in initRun()
1574     return curr.numInl > best.numInl;  in isBestModel()
1592     return best.numInl >= arg.minInl;  in isBestModelGoodEnough()
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()
1656     unsigned bestNumInl   = best.numInl;  in nStarOptimize()
1667         testNumInl -= !!best.inl[test_n-1];  in nStarOptimize()
1691                                 (double)best.numInl/arg.N,  in updateBounds()
1707         memcpy(arg.finalH, best.H, HSIZE);  in outputModel()
1709             memcpy(arg.inl, best.inl, arg.N);  in outputModel()
2073     return best.numInl > (unsigned)SMPL_SIZE;  in canRefine()
2098     sacCalcJacobianErrors(best.H, arg.src, arg.dst, best.inl, arg.N,  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()