Home
last modified time | relevance | path

Searched refs:p_q (Results 1 – 25 of 103) sorted by relevance

12345

/dports/devel/splint/splint-3.1.2/src/Headers/
H A Dqtype.h24 extern /*@nullwhentrue@*/ bool qtype_isUndefined (qtype p_q);
27 extern /*@falsewhennull@*/ bool qtype_isDefined (qtype p_q);
30 extern ctype qtype_getType (/*@sef@*/ qtype p_q);
34 extern /*@exposed@*/ qualList qtype_getQuals (/*@sef@*/ qtype p_q);
38 extern void qtype_setType (/*@sef@*/ qtype p_q, ctype p_c);
43 extern /*@only@*/ qtype qtype_copy (qtype p_q);
47 extern qtype qtype_addQual (/*@returned@*/ qtype p_qt, qual p_q);
51 extern qtype qtype_resolve (/*@returned@*/ qtype p_q);
53 extern /*@only@*/ cstring qtype_unparse (qtype p_q) /*@*/ ;
54 extern qtype qtype_newBase (/*@returned@*/ qtype p_q, ctype p_ct);
[all …]
H A Dclabstract.h34 extern uentryList fixUentryList (/*@only@*/ idDeclList p_tl, qtype p_q);
35 extern uentryList fixUnnamedDecl (qtype p_q) /*@*/ ;
59 extern void setProcessingTypedef (/*@only@*/ qtype p_q);
60 extern void setProcessingVars (/*@only@*/ qtype p_q);
H A DexprData.h118 /*static*/ /*@only@*/ exprData exprData_makeOffsetof (/*@only@*/ qtype p_q,
122 /*static*/ /*@only@*/ exprData exprData_makeSizeofType (/*@only@*/ qtype p_q);
125 exprData_makeCast (/*@keep@*/ lltok p_tok, /*@keep@*/ exprNode p_e, /*@only@*/ qtype p_q);
H A DvarKinds.h181 extern alkind alkind_fromQual (qual p_q) /*@*/ ;
193 extern exkind exkind_fromQual (qual p_q) /*@*/ ;
197 extern sstate sstate_fromQual (qual p_q) /*@*/ ;
221 extern exitkind exitkind_fromQual (qual p_q) /*@*/ ;
/dports/print/R-cran-tinytex/tinytex/tests/test-travis/
H A Dtest-tlmgr.R27 p_q = function(...) parse_packages(..., quiet = c(TRUE, TRUE, TRUE)) function
28 …(p_q(text = "! Font U/psy/m/n/10=psyr at 10.0pt not loadable: Metric (TFM) file not found") %==% '…
29 (p_q(text = '! The font "FandolSong-Regular" cannot be found.') %==% 'fandol')
30 …(p_q(text = '!pdfTeX error: /usr/local/bin/pdflatex (file tcrm0700): Font tcrm0700 at 600 not foun…
31 (p_q(text = '! Package fontspec Error: The font "Caladea" cannot be found.') %==% 'caladea')
/dports/devel/sunpromake/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/devel/smake/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/devel/sccs/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/devel/schilybase/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/net/rscsi/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/archivers/star/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/sysutils/cdrtools/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/editors/ved/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/sysutils/schilyutils/schily-2021-09-18/sccs/sccs/lib/comobj/src/
H A Drdmod.c118 if (pkt->p_q)
129 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
136 if (pkt->p_q == cur) {
137 pkt->p_q = q;
146 if (pkt->p_ixuser && (q->q_ixmsg = chkix(q, pkt->p_q))) {
160 for (prev = cur = pkt->p_q; cur; cur = (prev = cur)->q_next) {
164 if (pkt->p_q == cur) {
165 pkt->p_q = cur->q_next;
183 for (q = pkt->p_q; q; q = q->q_next) {
/dports/audio/faudio/FAudio-21.01/utils/testfilter/
H A Daudio_player.h60 void filter_change(int p_type, float p_cutoff_frequency, float p_q) in filter_change() argument
62 audio_filter_update(m_filter, p_type, p_cutoff_frequency, p_q); in filter_change()
69 void output_filter_change(int p_type, float p_cutoff_frequency, float p_q) in output_filter_change() argument
71 audio_filter_update(m_output_filter, p_type, p_cutoff_frequency, p_q); in output_filter_change()
H A Daudio_faudio.cpp104 void faudio_filter_update(AudioFilter *p_filter, int p_type, float p_cutoff_frequency, float p_q) in faudio_filter_update() argument
110 p_filter->params.OneOverQ = (float)(1.0 / p_q); in faudio_filter_update()
H A Daudio_xaudio.cpp109 void xaudio_filter_update(AudioFilter *p_filter, int p_type, float p_cutoff_frequency, float p_q) in xaudio_filter_update() argument
115 p_filter->params.OneOverQ = (float)(1.0 / p_q); in xaudio_filter_update()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/include/pcl/apps/
H A Dnn_classification.h194 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/search/include/pcl/search/
H A Doctree.h209 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()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/
H A Dfpfh_estimation.rst23 * 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
/dports/science/gromacs/gromacs-2021.4/src/gromacs/gmxpreprocess/
H A Dgenion.cpp449 int p_num = 0, n_num = 0, p_q = 1, n_q = -1; in gmx_genion() local
457 { "-pq", FALSE, etINT, { &p_q }, "Charge of the positive ion" }, in gmx_genion()
533 n_num = abs(nsalt * p_q); in gmx_genion()
537 int qdelta = p_num * p_q + n_num * n_q + iqtot; in gmx_genion()
541 int gcd = std::gcd(n_q, p_q); in gmx_genion()
547 n_q, p_q); in gmx_genion()
555 qdelta += p_q; in gmx_genion()
649 insert_ion(nsa, &solventMoleculesForReplacement, repl, solventGroup, x, &pbc, 1, p_q, in gmx_genion()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boxm2/cpp/algo/
H A Dboxm2_batch_functors.h303 float p_q = 1.0f-std::exp(-alpha*max_obs_seg_len); in process_cell() local
310 float p_q_new = p_q*term1 / (p_q*term1 + (1.0f-p_q)*term2); in process_cell()
477 float p_q = 1.0f-std::exp(-alpha*max_obs_seg_len); in process_cell() local
479 std::cout << "current alpha: " << alpha << " p_q: " << p_q << '\n'; in process_cell()
483 float p_q_new = p_q*term1 / (p_q*term1 + (1.0f-p_q)*term2); in process_cell()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/impl/
H A Doctree_search.hpp83 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 Doctree_search.h135 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/kdtree/include/pcl/kdtree/
H A Dkdtree.h135 nearestKSearch (const PointT &p_q, unsigned int k,
222 radiusSearch (const PointT &p_q, double radius, Indices &k_indices,

12345