Searched refs:best_fit (Results 1 – 5 of 5) sorted by relevance
| /external/llvm-project/libcxx/utils/google-benchmark/src/ |
| D | complexity.cc | 130 LeastSq best_fit; in MinimalLeastSq() local
136 best_fit = MinimalLeastSq(n, time, FittingCurve(o1)); in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
142 if (current_fit.rms < best_fit.rms) { in MinimalLeastSq()
143 best_fit = current_fit; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
148 best_fit = MinimalLeastSq(n, time, FittingCurve(complexity)); in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
152 return best_fit; in MinimalLeastSq()
|
| /external/llvm-project/llvm/utils/benchmark/src/ |
| D | complexity.cc | 127 LeastSq best_fit; in MinimalLeastSq() local
133 best_fit = MinimalLeastSq(n, time, FittingCurve(o1)); in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
139 if (current_fit.rms < best_fit.rms) { in MinimalLeastSq()
140 best_fit = current_fit; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
145 best_fit = MinimalLeastSq(n, time, FittingCurve(complexity)); in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
149 return best_fit; in MinimalLeastSq()
|
| /external/libcxx/utils/google-benchmark/src/ |
| D | complexity.cc | 130 LeastSq best_fit; in MinimalLeastSq() local
136 best_fit = MinimalLeastSq(n, time, FittingCurve(o1)); in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
142 if (current_fit.rms < best_fit.rms) { in MinimalLeastSq()
143 best_fit = current_fit; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
148 best_fit = MinimalLeastSq(n, time, FittingCurve(complexity)); in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
152 return best_fit; in MinimalLeastSq()
|
| /external/google-benchmark/src/ |
| D | complexity.cc | 133 LeastSq best_fit; in MinimalLeastSq() local
139 best_fit = MinimalLeastSq(n, time, FittingCurve(o1)); in MinimalLeastSq()
140 best_fit.complexity = o1; in MinimalLeastSq()
145 if (current_fit.rms < best_fit.rms) { in MinimalLeastSq()
146 best_fit = current_fit; in MinimalLeastSq()
147 best_fit.complexity = fit; in MinimalLeastSq()
151 best_fit = MinimalLeastSq(n, time, FittingCurve(complexity)); in MinimalLeastSq()
152 best_fit.complexity = complexity; in MinimalLeastSq()
155 return best_fit; in MinimalLeastSq()
|
| /external/ImageMagick/coders/ |
| D | ashlar.c | 182 best_fit; member
298 if (ashlar_info->best_fit == MagickFalse) in AssignBestTileLocation()
320 if (ashlar_info->best_fit != MagickFalse) in AssignBestTileLocation()
597 ashlar_info.best_fit=IsStringTrue(value) != MagickFalse ? MagickTrue : in WriteASHLARImage()
|