/dports/games/KnightCap/Export/ |
H A D | epd.c | 2189 bv[bi++] = map_upper(ascpv[p_q]); in EPDEncodeFEN() 2193 bv[bi++] = map_lower(ascpv[p_q]); in EPDEncodeFEN() 3128 case p_q: in EPDSANEncodeAux() 4577 case p_q: in EPDGeneratePL() 6780 for (p = p_p; p <= p_q; p++) in EPDTBGetSignature() 6797 for (p = p_p; p <= p_q; p++) in EPDTBGetInvertedSignature() 7355 p = p_q; in EPDTBInitTBID() 7780 ascpv[p_q] = 'Q'; in EPDInit() 7814 cv_p_scmvv[scmv_ppq] = p_q; in EPDInit() 7838 cv_cp_c_pv[c_w][p_q] = cp_wq; in EPDInit() [all …]
|
H A D | epddefs.h | 139 #define p_q 4 /* queen */ macro
|
H A D | epdglue.c | 111 p = p_q; in EGMapFromHostPiece() 149 case p_q: in EGMapToHostPiece()
|
/dports/games/crafty/crafty-25.2_1/ |
H A D | epd.c | 1646 bv[bi++] = map_upper(ascpv[p_q]); in EPDEncode() 1650 bv[bi++] = map_lower(ascpv[p_q]); in EPDEncode() 1928 case p_q: in EPDSANEncodeAux() 2452 if (flag && (count_cpv[c_w][p_q] > 1)) { in EPDIsLegal() 2453 apv[c_w] -= (count_cpv[c_w][p_q] - 1); in EPDIsLegal() 2458 if (flag && (count_cpv[c_b][p_q] > 1)) { in EPDIsLegal() 2791 case p_q: in EPDGeneratePL() 4275 ascpv[p_q] = 'Q'; in EPDInit() 4303 cv_p_scmvv[scmv_ppq] = p_q; in EPDInit() 4323 cv_cp_c_pv[c_w][p_q] = cp_wq; in EPDInit() [all …]
|
H A D | epddefs.h | 120 # define p_q 4 macro
|
/dports/games/linwarrior/linwarrior/source/psi3d/ |
H A D | md5frmt.h | 561 float p_q[4]; in toLocalJoints() local 562 quat_cpy(p_q, p->q); in toLocalJoints() 563 quat_conj(p_q); in toLocalJoints() 572 quat_apply(v_local, p_q, v_local); in toLocalJoints() 574 quat_mul(q_local, j->q, p_q); in toLocalJoints()
|
/dports/games/supertux2/SuperTux-v0.6.3-Source/contrib/ |
H A D | schroedingers-boxes-pr-390.patch | 4320 zgkHYChI=I~rIwHLwd<KNY%<(an4$q(WbtvfBg|&pD1D^rD#p_q&Rygm&nC!1jHlBX
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/include/pcl/apps/ |
H A D | nn_classification.h | 194 classify(const PointT& p_q, double radius, float gaussian_param, int max_nn = INT_MAX) 198 getSimilarExemplars(p_q, radius, k_indices, k_sqr_distances, max_nn); 213 getKNearestExemplars(const PointT& p_q, in getKNearestExemplars() argument 220 return tree_->nearestKSearch(p_q, k, k_indices, k_sqr_distances); in getKNearestExemplars() 233 getSimilarExemplars(const PointT& p_q, 239 return tree_->radiusSearch(p_q, radius, k_indices, k_sqr_distances, max_nn);
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/ |
H A D | fpfh_estimation.rst | 23 * in a first step, for each query point :math:`p_q` a set of tuples 29 neighboring SPFH values are used to weight the final histogram of :math:`p_q` 37 :math:`p_q` and a neighbor point :math:`p_i` in some given metric space, thus 38 scoring the (:math:`p_q, p_i`) pair, but could just as well be selected as a 41 k-neighborhood set centered at :math:`p_q`. 46 Thus, for a given query point :math:`p_q`, the algorithm first estimates its 49 by a re-weighting of the SPFH values of :math:`p_q` using the SPFH values of its 50 :math:`k` neighbors, thus creating the FPFH for :math:`p_q`. The extra FPFH 61 1. the FPFH does not fully interconnect all neighbors of :math:`p_q` as it
|
H A D | pfh_estimation.rst | 38 for a query point (:math:`p_q`), marked with red and placed in the middle of a
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/kdtree/include/pcl/kdtree/ |
H A D | kdtree.h | 135 nearestKSearch (const PointT &p_q, unsigned int k, 222 radiusSearch (const PointT &p_q, double radius, Indices &k_indices,
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/impl/ |
H A D | octree_search.hpp | 83 const PointT& p_q, in nearestKSearch() argument 89 assert(isFinite(p_q) && in nearestKSearch() 108 p_q, k, this->root_node_, key, 1, smallest_dist, point_candidates); in nearestKSearch() 135 const PointT& p_q, index_t& result_index, float& sqr_distance) in approxNearestSearch() argument 138 assert(isFinite(p_q) && in approxNearestSearch() 145 p_q, this->root_node_, key, 1, result_index, sqr_distance); in approxNearestSearch() 163 const PointT& p_q, in radiusSearch() argument 169 assert(isFinite(p_q) && in radiusSearch() 177 getNeighborsWithinRadiusRecursive(p_q, in radiusSearch()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/ |
H A D | octree_search.h | 135 nearestKSearch(const PointT& p_q, 179 approxNearestSearch(const PointT& p_q, index_t& result_index, float& sqr_distance); 223 radiusSearch(const PointT& p_q,
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/search/include/pcl/search/ |
H A D | octree.h | 209 radiusSearch (const PointT &p_q, 215 tree_->radiusSearch (p_q, radius, k_indices, k_sqr_distances, max_nn); 261 approxNearestSearch (const PointT &p_q, index_t &result_index, float &sqr_distance) in approxNearestSearch() argument 263 return (tree_->approxNearestSearch (p_q, result_index, sqr_distance)); in approxNearestSearch()
|
H A D | organized.h | 156 radiusSearch (const PointT &p_q, 176 nearestKSearch (const PointT &p_q,
|
/dports/japanese/fcitx-mozc/mozc-2.23.2815.102.01/src/data/typing/ |
H A D | typing_model_flick-hiragana.tsv | 81841 p_q 3456
|
H A D | typing_model_toggle_flick-hiragana.tsv | 87786 p_q 3620
|
/dports/japanese/ibus-mozc/mozc-2.23.2815.102.01/src/data/typing/ |
H A D | typing_model_flick-hiragana.tsv | 81841 p_q 3456
|
H A D | typing_model_toggle_flick-hiragana.tsv | 87786 p_q 3620
|
/dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/data/typing/ |
H A D | typing_model_flick-hiragana.tsv | 81841 p_q 3456
|
H A D | typing_model_toggle_flick-hiragana.tsv | 87786 p_q 3620
|
/dports/japanese/mozc-server/mozc-2.23.2815.102.01/src/data/typing/ |
H A D | typing_model_flick-hiragana.tsv | 81841 p_q 3456
|
H A D | typing_model_toggle_flick-hiragana.tsv | 87786 p_q 3620
|
/dports/japanese/mozc-tool/mozc-2.23.2815.102.01/src/data/typing/ |
H A D | typing_model_flick-hiragana.tsv | 81841 p_q 3456
|
H A D | typing_model_toggle_flick-hiragana.tsv | 87786 p_q 3620
|