/dports/games/kodi-addon-game.libretro.beetle-psx/game.libretro.beetle-psx-0.9.44.22-Matrix/depends/common/beetle-psx/mednafen/psx/ |
H A D | gpu_polygon_sub.cpp | 142 gpu->min_u = UINT16_MAX; in Reset_UVLimits() 154 uint16 min_u = gpu->min_u; in Extend_UVLimits() local 164 min_u = std::min(min_u, uint16_t(vertices[i].u)); in Extend_UVLimits() 173 min_u = 0; in Extend_UVLimits() 179 gpu->min_u = min_u; in Extend_UVLimits() 191 uint16 min_u = gpu->min_u; in Finalise_UVLimits() local 202 min_u += off_u; in Finalise_UVLimits() 211 if (max_u > min_u) in Finalise_UVLimits() 218 if ((max_u & 0xff00) == (min_u & 0xff00)) in Finalise_UVLimits() 226 min_u = 0; in Finalise_UVLimits() [all …]
|
/dports/games/libretro-beetle_psx/beetle-psx-libretro-3ec155d/mednafen/psx/ |
H A D | gpu_polygon_sub.cpp | 142 gpu->min_u = UINT16_MAX; in Reset_UVLimits() 154 uint16 min_u = gpu->min_u; in Extend_UVLimits() local 164 min_u = std::min(min_u, uint16_t(vertices[i].u)); in Extend_UVLimits() 173 min_u = 0; in Extend_UVLimits() 179 gpu->min_u = min_u; in Extend_UVLimits() 191 uint16 min_u = gpu->min_u; in Finalise_UVLimits() local 202 min_u += off_u; in Finalise_UVLimits() 211 if (max_u > min_u) in Finalise_UVLimits() 218 if ((max_u & 0xff00) == (min_u & 0xff00)) in Finalise_UVLimits() 226 min_u = 0; in Finalise_UVLimits() [all …]
|
/dports/graphics/tesseract/tesseract-5.0.0/src/training/common/ |
H A D | ctc.cpp | 95 int min_u = num_labels_ - 1; in ComputeLabelLimits() local 96 if (labels_[min_u] == null_char_) { in ComputeLabelLimits() 97 --min_u; in ComputeLabelLimits() 100 min_labels_[t] = min_u; in ComputeLabelLimits() 101 if (min_u > 0) { in ComputeLabelLimits() 102 --min_u; in ComputeLabelLimits() 103 if (labels_[min_u] == null_char_ && min_u > 0 && labels_[min_u + 1] != labels_[min_u - 1]) { in ComputeLabelLimits() 104 --min_u; in ComputeLabelLimits()
|
/dports/www/squid/squid-4.15/src/ |
H A D | urn.cc | 92 url_entry *min_u = NULL; in urnFindMinRtt() local 120 min_u = u; in urnFindMinRtt() 127 (min_u ? min_u->url : "NONE") << "' RTT " << in urnFindMinRtt() 130 return min_u; in urnFindMinRtt() 232 url_entry *min_u; in urnHandleReply() local 321 min_u = urnFindMinRtt(urls, urnState->request->method, NULL); in urnHandleReply() 356 if (min_u) { in urnHandleReply() 357 rep->header.putStr(Http::HdrType::LOCATION, min_u->url); in urnHandleReply()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/recognition/include/pcl/recognition/impl/hv/ |
H A D | occlusion_reasoning.hpp | 122 float max_u, max_v, min_u, min_v; in computeDepthMap() local 124 min_u = min_v = std::numeric_limits<float>::max (); in computeDepthMap() 131 if (b_x < min_u) in computeDepthMap() 132 min_u = b_x; in computeDepthMap() 141 …float maxC = std::max (std::max (std::abs (max_u), std::abs (max_v)), std::max (std::abs (min_u), … in computeDepthMap()
|
/dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 169 vertex_t min_u = graph_traits< Graph >::null_vertex(); in is_kuratowski_subgraph() local 197 && (min_u == graph_traits< Graph >::null_vertex() in is_kuratowski_subgraph() 198 || neighbors[u].size() < neighbors[min_u].size())) in is_kuratowski_subgraph() 200 min_u = u; in is_kuratowski_subgraph() 204 if (min_u == graph_traits< Graph >::null_vertex()) in is_kuratowski_subgraph() 210 u = min_u; in is_kuratowski_subgraph()
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 187 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 220 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 221 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 224 min_u = u; in is_kuratowski_subgraph() 229 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 234 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 169 vertex_t min_u = graph_traits< Graph >::null_vertex(); in is_kuratowski_subgraph() local 197 && (min_u == graph_traits< Graph >::null_vertex() in is_kuratowski_subgraph() 198 || neighbors[u].size() < neighbors[min_u].size())) in is_kuratowski_subgraph() 200 min_u = u; in is_kuratowski_subgraph() 204 if (min_u == graph_traits< Graph >::null_vertex()) in is_kuratowski_subgraph() 210 u = min_u; in is_kuratowski_subgraph()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 169 vertex_t min_u = graph_traits< Graph >::null_vertex(); in is_kuratowski_subgraph() local 197 && (min_u == graph_traits< Graph >::null_vertex() in is_kuratowski_subgraph() 198 || neighbors[u].size() < neighbors[min_u].size())) in is_kuratowski_subgraph() 200 min_u = u; in is_kuratowski_subgraph() 204 if (min_u == graph_traits< Graph >::null_vertex()) in is_kuratowski_subgraph() 210 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 186 vertex_t min_u = graph_traits<Graph>::null_vertex(); in is_kuratowski_subgraph() local 219 (min_u == graph_traits<Graph>::null_vertex() || in is_kuratowski_subgraph() 220 neighbors[u].size() < neighbors[min_u].size()) in is_kuratowski_subgraph() 223 min_u = u; in is_kuratowski_subgraph() 228 if (min_u == graph_traits<Graph>::null_vertex()) in is_kuratowski_subgraph() 233 u = min_u; in is_kuratowski_subgraph()
|
/dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
H A D | is_kuratowski_subgraph.hpp | 169 vertex_t min_u = graph_traits< Graph >::null_vertex(); in is_kuratowski_subgraph() local 197 && (min_u == graph_traits< Graph >::null_vertex() in is_kuratowski_subgraph() 198 || neighbors[u].size() < neighbors[min_u].size())) in is_kuratowski_subgraph() 200 min_u = u; in is_kuratowski_subgraph() 204 if (min_u == graph_traits< Graph >::null_vertex()) in is_kuratowski_subgraph() 210 u = min_u; in is_kuratowski_subgraph()
|
/dports/emulators/atari800/atari800-3.1.0/src/gles2/ |
H A D | video.c | 94 #define min_u 24.0f/TEX_WIDTH macro 95 #define max_u (float)WIDTH/TEX_WIDTH - min_u 101 min_u, min_v, 104 min_u, max_v,
|
/dports/games/kodi-addon-game.libretro.beetle-psx/game.libretro.beetle-psx-0.9.44.22-Matrix/depends/common/beetle-psx/rsx/ |
H A D | rsx_intf.cpp | 564 uint16_t min_u, uint16_t min_v, in rsx_intf_push_triangle() argument 596 min_u, min_v, max_u, max_v, in rsx_intf_push_triangle() 608 min_u, min_v, max_u, max_v, in rsx_intf_push_triangle() 629 uint16_t min_u, uint16_t min_v, in rsx_intf_push_quad() argument 665 min_u, min_v, max_u, max_v, in rsx_intf_push_quad() 678 min_u, min_v, max_u, max_v, in rsx_intf_push_quad()
|
/dports/www/firefox-esr/firefox-91.8.0/media/libyuv/libyuv/util/ |
H A D | psnr_main.cc | 42 double min_y, min_u, min_v, min_all; member 310 if (distorted_frame->u < cur_distortion_psnr->min_u) { in UpdateMetrics() 311 cur_distortion_psnr->min_u = distorted_frame->u; in UpdateMetrics() 406 cur_distortion_psnr->min_u = kMaxPSNR; in main() 586 cur_distortion_psnr->min_y, cur_distortion_psnr->min_u, in main() 592 cur_distortion_ssim->min_y, cur_distortion_ssim->min_u, in main()
|