| /dports/graphics/libimagequant/libimagequant-2.17.0/ |
| H A D | nearest.c | 163 … if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { in vp_search_node()
164 best_candidate->distance = distance; in vp_search_node()
165 best_candidate->distance_squared = distance_squared; in vp_search_node()
166 best_candidate->idx = node->idx; in vp_search_node()
172 …if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i… in vp_search_node()
175 best_candidate->idx = node->rest[i].idx; in vp_search_node()
196 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
214 vp_search_tmp best_candidate = { in nearest_search() local
220 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
222 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/graphics/gifski/gifski-1.5.0/cargo-crates/imagequant-sys-3.0.6+sys2.15.0/msvc-dist/ |
| H A D | nearest.c | 163 … if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { in vp_search_node()
164 best_candidate->distance = distance; in vp_search_node()
165 best_candidate->distance_squared = distance_squared; in vp_search_node()
166 best_candidate->idx = node->idx; in vp_search_node()
172 …if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i… in vp_search_node()
175 best_candidate->idx = node->rest[i].idx; in vp_search_node()
196 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
214 vp_search_tmp best_candidate = { in nearest_search() local
220 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
222 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/graphics/gifski/gifski-1.5.0/cargo-crates/imagequant-sys-3.0.6+sys2.15.0/ |
| H A D | nearest.c | 163 … if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { in vp_search_node()
164 best_candidate->distance = distance; in vp_search_node()
165 best_candidate->distance_squared = distance_squared; in vp_search_node()
166 best_candidate->idx = node->idx; in vp_search_node()
172 …if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i… in vp_search_node()
175 best_candidate->idx = node->rest[i].idx; in vp_search_node()
196 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
214 vp_search_tmp best_candidate = { in nearest_search() local
220 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
222 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/graphics/pngquant/pngquant-2.17.0/lib/ |
| H A D | nearest.c | 163 … if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { in vp_search_node()
164 best_candidate->distance = distance; in vp_search_node()
165 best_candidate->distance_squared = distance_squared; in vp_search_node()
166 best_candidate->idx = node->idx; in vp_search_node()
172 …if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i… in vp_search_node()
175 best_candidate->idx = node->rest[i].idx; in vp_search_node()
196 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
214 vp_search_tmp best_candidate = { in nearest_search() local
220 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
222 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/graphics/pngquant/pngquant-2.17.0/lib/msvc-dist/ |
| H A D | nearest.c | 163 … if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { in vp_search_node()
164 best_candidate->distance = distance; in vp_search_node()
165 best_candidate->distance_squared = distance_squared; in vp_search_node()
166 best_candidate->idx = node->idx; in vp_search_node()
172 …if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i… in vp_search_node()
175 best_candidate->idx = node->rest[i].idx; in vp_search_node()
196 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
214 vp_search_tmp best_candidate = { in nearest_search() local
220 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
222 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/imagequant-sys-2.12.5/msvc-dist/ |
| H A D | nearest.c | 142 if (distance < best_candidate->distance && best_candidate->exclude != node->idx) { in vp_search_node()
143 best_candidate->distance = distance; in vp_search_node()
144 best_candidate->idx = node->idx; in vp_search_node()
150 vp_search_node(node->near, needle, best_candidate); in vp_search_node()
155 if (node->far && distance >= node->radius - best_candidate->distance) { in vp_search_node()
162 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
164 if (node->near && distance <= node->radius + best_candidate->distance) { in vp_search_node()
180 vp_search_tmp best_candidate = { in nearest_search() local
185 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
187 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/imagequant-sys-2.12.5/ |
| H A D | nearest.c | 142 if (distance < best_candidate->distance && best_candidate->exclude != node->idx) { in vp_search_node()
143 best_candidate->distance = distance; in vp_search_node()
144 best_candidate->idx = node->idx; in vp_search_node()
150 vp_search_node(node->near, needle, best_candidate); in vp_search_node()
155 if (node->far && distance >= node->radius - best_candidate->distance) { in vp_search_node()
162 vp_search_node(node->far, needle, best_candidate); in vp_search_node()
164 if (node->near && distance <= node->radius + best_candidate->distance) { in vp_search_node()
180 vp_search_tmp best_candidate = { in nearest_search() local
185 vp_search_node(handle->root, px, &best_candidate); in nearest_search()
187 *diff = best_candidate.distance * best_candidate.distance; in nearest_search()
[all …]
|
| /dports/games/openage/openage-0.3.0-1262-ga554ab49/libopenage/pathfinding/ |
| H A D | a_star.cpp | 90 node_pt best_candidate = node_candidates.pop(); in a_star() local
92 best_candidate->was_best = true; in a_star()
95 if (valid_end(best_candidate->position)) { in a_star()
100 return best_candidate->generate_backtrace(); in a_star()
104 if (best_candidate->heuristic_cost < closest_node->heuristic_cost) { in a_star()
105 closest_node = best_candidate; in a_star()
109 for (node_pt neighbor : best_candidate->get_neighbors(visited_tiles)) { in a_star()
113 if (not passable_line(best_candidate, neighbor, passable)) { in a_star()
118 cost_t new_past_cost = best_candidate->past_cost + best_candidate->cost_to(*neighbor); in a_star()
133 neighbor->path_predecessor = best_candidate; in a_star()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/remoting/host/ |
| H A D | resizing_host_observer.cc | 174 CandidateResolution best_candidate(resolutions.front(), resolution); in SetScreenResolution() local
178 if (candidate.IsBetterThan(best_candidate)) { in SetScreenResolution()
179 best_candidate = candidate; in SetScreenResolution()
185 if (!best_candidate.resolution().Equals(current_resolution)) { in SetScreenResolution()
189 << best_candidate.resolution().dimensions().width() << "x" in SetScreenResolution()
190 << best_candidate.resolution().dimensions().height(); in SetScreenResolution()
191 desktop_resizer_->SetResolution(best_candidate.resolution()); in SetScreenResolution()
194 << best_candidate.resolution().dimensions().width() << "x" in SetScreenResolution()
195 << best_candidate.resolution().dimensions().height(); in SetScreenResolution()
|
| /dports/sysutils/getdelta/getdelta-0.7.8_5/ |
| H A D | getdelta.sh | 698 best_candidate="$name"
703 output "${GREEN}The best of all is ... ${CYAN}${best_candidate}\n"
708 if [ "${best_candidate}" = "${NEW_FILE}" ]
711 if ! check_file "${best_candidate}"
722 check_file "${best_candidate}" || FILE_IS_CORRUPT=true
727 remove ${best_candidate}
747 FILESIZE=$(stat -f "%z" "${DISTDIR}/${best_candidate}")
804 if [ -f ${best_candidate}-${NEW_FILE}.failed ]
808 rm -rf ${best_candidate}-${NEW_FILE}.failed
811 if [ -f ${best_candidate}-${NEW_FILE}.dtu ]
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/viz/service/display/ |
| H A D | overlay_strategy_single_on_top.cc | 34 OverlayCandidate best_candidate; in Attempt() local
51 best_candidate.display_rect.size().GetArea()) { in Attempt()
52 best_candidate = candidate; in Attempt()
60 if (TryOverlay(quad_list, primary_plane, candidate_list, best_candidate, in Attempt()
62 if (previous_frame_resource_id_ != best_candidate.resource_id) { in Attempt()
63 previous_frame_resource_id_ = best_candidate.resource_id; in Attempt()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/components/viz/service/display/ |
| H A D | overlay_strategy_single_on_top.cc | 37 OverlayCandidate best_candidate; in Attempt() local
55 best_candidate.display_rect.size().GetArea()) { in Attempt()
56 best_candidate = candidate; in Attempt()
64 if (TryOverlay(quad_list, primary_plane, candidate_list, best_candidate, in Attempt()
66 if (previous_frame_resource_id_ != best_candidate.resource_id) { in Attempt()
67 previous_frame_resource_id_ = best_candidate.resource_id; in Attempt()
|
| /dports/devel/py-pipenv/pipenv-2021.5.29/pipenv/patched/notpip/_internal/index/ |
| H A D | package_finder.py | 366 if best_candidate is None:
369 assert best_candidate in applicable_candidates
374 self.best_candidate = best_candidate
571 link = best_candidate.link
584 return best_candidate
601 best_candidate=best_candidate,
937 best_candidate = best_candidate_result.best_candidate
968 best_candidate is None or
984 best_candidate.version,
1000 best_candidate.version,
[all …]
|
| /dports/lang/mono/mono-5.10.1.57/mcs/mcs/ |
| H A D | ecore.cs | 3923 MethodSpec best_candidate; field in Mono.CSharp.MethodGroupExpr
3949 return best_candidate;
4026 best_candidate = best, in CreatePredefined()
4156 if (best_candidate != null && best_candidate.Kind == MemberKind.Destructor) in OverloadResolve()
4226 …cc.CheckAll (best_candidate.GetGenericMethodDefinition (), best_candidate.TypeArguments, best_cand… in OverloadResolve()
5556 best_candidate = null;
6958 best_candidate = spec; in PropertyExpr()
7010 return best_candidate;
7251 if (best_candidate.HasGet && !best_candidate.Get.Parameters.IsEmpty) { in OverloadResolve()
7257 } else if (best_candidate.HasSet && best_candidate.Set.Parameters.Count > 1) { in OverloadResolve()
[all …]
|
| /dports/finance/electrum/Electrum-4.1.5/packages/pip/_internal/index/ |
| H A D | package_finder.py | 356 if best_candidate is None:
359 assert best_candidate in applicable_candidates
364 self.best_candidate = best_candidate
553 best_candidate = max(candidates, key=self._sort_key)
554 return best_candidate
571 best_candidate=best_candidate,
892 best_candidate = best_candidate_result.best_candidate
924 best_candidate is None or
940 best_candidate.version,
956 best_candidate.version,
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/obj-x86_64-pc-linux-gnu/_virtualenvs/init/lib/python2.7/site-packages/pip/_internal/index/ |
| H A D | package_finder.py | 362 if best_candidate is None:
365 assert best_candidate in applicable_candidates
370 self.best_candidate = best_candidate
559 best_candidate = max(candidates, key=self._sort_key)
560 return best_candidate
577 best_candidate=best_candidate,
901 best_candidate = best_candidate_result.best_candidate
933 best_candidate is None or
949 best_candidate.version,
965 best_candidate.version,
[all …]
|
| /dports/devel/py-pip/pip-20.3.4/src/pip/_internal/index/ |
| H A D | package_finder.py | 361 if best_candidate is None:
364 assert best_candidate in applicable_candidates
369 self.best_candidate = best_candidate
558 best_candidate = max(candidates, key=self._sort_key)
559 return best_candidate
576 best_candidate=best_candidate,
902 best_candidate = best_candidate_result.best_candidate
934 best_candidate is None or
950 best_candidate.version,
966 best_candidate.version,
[all …]
|
| /dports/databases/postgresql96-server/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-pltcl/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-plpython/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-client/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-plperl/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-contrib/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/databases/postgresql96-docs/postgresql-9.6.24/src/backend/parser/ |
| H A D | parse_func.c | 1275 FuncCandidateList best_candidate; in func_get_detail() local
1299 for (best_candidate = raw_candidates; in func_get_detail()
1300 best_candidate != NULL; in func_get_detail()
1301 best_candidate = best_candidate->next) in func_get_detail()
1307 if (best_candidate == NULL) in func_get_detail()
1434 if (!best_candidate) in func_get_detail()
1440 if (best_candidate) in func_get_detail()
1463 *funcid = best_candidate->oid; in func_get_detail()
1464 *nvargs = best_candidate->nvargs; in func_get_detail()
1491 best_candidate->oid); in func_get_detail()
[all …]
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | spellcheck.c | 141 const char *best_candidate = NULL; in find_closest_string() local
153 best_candidate = candidate; in find_closest_string()
159 if (best_candidate) in find_closest_string()
161 unsigned int cutoff = MAX (len_target, strlen (best_candidate)) / 2; in find_closest_string()
166 return best_candidate; in find_closest_string()
|