/dports/archivers/dpkg/dpkg-1.19.7/scripts/Dpkg/ |
H A D | Deps.pm | 87 my ($rel_p, $v_p, $rel_q, $v_q) = @_; 90 return unless defined($v_p) and $v_p->is_valid(); 99 return ($v_p < $v_q) ? 0 : undef; 103 return ($v_p > $v_q) ? 0 : undef; 105 return ($v_p == $v_q); 116 return ($v_p > $v_q) ? 0 : undef; 118 return ($v_p <= $v_q) ? 1 : 0; 128 return ($v_p >= $v_p) ? 0 : undef; 132 return ($v_p < $v_q) ? 1 : 0; 145 return ($v_p >= $v_q) ? 1 : 0; [all …]
|
/dports/textproc/tttcmds/tttcmds-1.0.20190920/src/bin/retu_assign/ |
H A D | command.h | 58 v_p = value; \ 61 strncpy(v_p, "@ ", 2); \ 62 v_p += 2; \ 66 strncpy(v_p, GYO_BUFFER[R_ARGV[j]], buf_len); \ 67 v_p += buf_len; \ 68 strncpy(v_p, " ", 1); \ 69 v_p += 1; \ 72 strncpy(v_p, "@", 1); \ 73 v_p += 1; \ 78 v_p += buf_len; \ [all …]
|
/dports/misc/visp/visp-3.4.0/modules/tracker/blob/src/dots/ |
H A D | vpDot2.cpp | 1969 dMv = (float)(0.5 * v_p * v_p); in computeFreemanParameters() 1973 dMv2 = (float)(1.0 / 3. * v_p * v_p * v_p); in computeFreemanParameters() 1982 dMv = (float)(0.5 * v_p * (v_p + 1) + 1.0 / 6.0); in computeFreemanParameters() 1987 dMv2 = (float)(1. / 3. * v_p * (v_p * v_p + 1.5 * v_p + 1.) + 1. / 12.0); in computeFreemanParameters() 2008 dMv = -(float)(0.5 * v_p * (v_p + 1) + 1.0 / 6.0); in computeFreemanParameters() 2013 dMv2 = (float)(-1. / 3. * v_p * (v_p * v_p + 1.5 * v_p + 1.) - 1. / 12.0); in computeFreemanParameters() 2020 dMv = (float)(-0.5 * v_p * v_p); in computeFreemanParameters() 2025 dMv2 = (float)(-1.0 / 3. * v_p * v_p * v_p); in computeFreemanParameters() 2039 dMv2 = (float)(-1. / 3. * v_p * (v_p * v_p - 1.5 * v_p + 1.) - 1. / 12.0); in computeFreemanParameters() 2060 dMv = (float)(0.5 * v_p * (v_p - 1) + 1.0 / 6.0); in computeFreemanParameters() [all …]
|
/dports/math/g2o/g2o-20201223_git/g2o/examples/ba/ |
H A D | ba_demo.cpp | 168 g2o::VertexSBAPointXYZ * v_p in main() local 170 v_p->setId(point_id); in main() 171 v_p->setMarginalized(true); in main() 172 v_p->setEstimate(true_points.at(i) in main() 184 optimizer.addVertex(v_p); in main() 201 e->setVertex(0, dynamic_cast<g2o::OptimizableGraph::Vertex*>(v_p)); in main() 217 Vector3d diff = v_p->estimate() - true_points[i]; in main() 256 g2o::VertexSBAPointXYZ * v_p in main() local 258 if (v_p==0){ in main() 262 Vector3d diff = v_p->estimate()-true_points[it->second]; in main()
|
/dports/math/g2o/g2o-20201223_git/g2o/examples/sba/ |
H A D | sba_demo.cpp | 198 g2o::VertexSBAPointXYZ * v_p in main() local 202 v_p->setId(point_id); in main() 203 v_p->setMarginalized(true); in main() 204 v_p->setEstimate(true_points.at(i) in main() 226 optimizer.addVertex(v_p); in main() 258 = dynamic_cast<g2o::OptimizableGraph::Vertex*>(v_p); in main() 283 Vector3d diff = v_p->estimate() - true_points[i]; in main() 342 g2o::VertexSBAPointXYZ * v_p in main() local 345 if (v_p==0) in main() 351 Vector3d diff = v_p->estimate()-true_points[it->second]; in main()
|
/dports/math/g2o/g2o-20201223_git/g2o/examples/ba_anchored_inverse_depth/ |
H A D | ba_anchored_inverse_depth_demo.cpp | 186 g2o::VertexSBAPointXYZ * v_p in main() local 207 v_p->setId(point_id); in main() 209 v_p->setMarginalized(true); in main() 217 v_p->setEstimate(invert_depth(point_anchor)); in main() 218 optimizer.addVertex(v_p); in main() 232 e->setVertex(0, dynamic_cast<g2o::OptimizableGraph::Vertex*>(v_p)); in main() 252 …Vector3d diff = true_poses[anchor_frame_id].inverse() * invert_depth(v_p->estimate()) - true_point… in main() 280 g2o::VertexSBAPointXYZ* v_p = dynamic_cast<g2o::VertexSBAPointXYZ*>(v_it->second); in main() local 281 if (v_p==0){ in main() 297 …Vector3d diff = v_anchor->estimate().inverse()*invert_depth(v_p->estimate())-true_points[it->secon… in main()
|
/dports/cad/verilator/verilator-4.216/test_regress/t/ |
H A D | t_trace_litendian.v | 33 logic [ -1: 1] v_p = '0; register 58 v_p <= '1; 81 v_p <= v_p << 1;
|
/dports/math/stan/stan-2.28.2/src/test/test-models/good/function-signatures/math/matrix/ |
H A D | csr_extract_v.stan | 15 array[5] int v_p; 16 v_p = csr_extract_v(a_d); 17 v_p = csr_extract_v(a_p);
|
/dports/math/linbox/linbox-1.6.3/linbox/algorithms/ |
H A D | matrix-inverse.h | 169 std::vector<std::pair<int, int> >::reverse_iterator v_p; in matrixInverseIn() local 171 for(v_p = P.rbegin(); v_p != P.rend(); ++ v_p) { in matrixInverseIn() 173 cur_c = A.colBegin() + v_p -> first; in matrixInverseIn() 175 tmp_c = A.colBegin() + v_p -> second; in matrixInverseIn()
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_fields/ |
H A D | idealchinese | 6 vector of elements, gives an element b such that v_p(b-y_p)>=v_p(x) for all 7 prime ideals p dividing x, and v_p(b)>=0 for all other p
|
H A D | idealappr | 6 b such that v_p(b)=v_p(x) for all prime ideals p dividing x, and v_p(b)>=0
|
/dports/devel/libsigrok/libsigrok-0.5.2/src/ |
H A D | strutil.c | 810 SR_API char *sr_period_string(uint64_t v_p, uint64_t v_q) in sr_period_string() argument 815 freq = 1 / ((double)v_p / v_q); in sr_period_string() 818 v = (double)v_p / v_q * 1000000000000.0; in sr_period_string() 822 v = (double)v_p / v_q * 1000000000.0; in sr_period_string() 826 v = (double)v_p / v_q * 1000000.0; in sr_period_string() 830 v = (double)v_p / v_q * 1000.0; in sr_period_string() 834 v = (double)v_p / v_q; in sr_period_string() 856 SR_API char *sr_voltage_string(uint64_t v_p, uint64_t v_q) in sr_voltage_string() argument 859 return g_strdup_printf("%" PRIu64 " mV", v_p); in sr_voltage_string() 861 return g_strdup_printf("%" PRIu64 " V", v_p); in sr_voltage_string() [all …]
|
/dports/security/hexl/hexl-1.2.3/hexl/eltwise/ |
H A D | eltwise-mult-mod-avx512dq.cpp | 602 __m512d v_d = _mm512_fnmadd_pd(v_c, v_p, v_h); in EltwiseMultModAVX512FloatLoopDefault() 605 v_g = _mm512_mask_add_pd(v_g, m, v_g, v_p); in EltwiseMultModAVX512FloatLoopDefault() 696 __m512d v_d_1 = _mm512_fnmadd_pd(v_c_1, v_p, v_h_1); in EltwiseMultModAVX512FloatLoopUnroll() 697 __m512d v_d_2 = _mm512_fnmadd_pd(v_c_2, v_p, v_h_2); in EltwiseMultModAVX512FloatLoopUnroll() 698 __m512d v_d_3 = _mm512_fnmadd_pd(v_c_3, v_p, v_h_3); in EltwiseMultModAVX512FloatLoopUnroll() 699 __m512d v_d_4 = _mm512_fnmadd_pd(v_c_4, v_p, v_h_4); in EltwiseMultModAVX512FloatLoopUnroll() 711 v_g_1 = _mm512_mask_add_pd(v_g_1, m_1, v_g_1, v_p); in EltwiseMultModAVX512FloatLoopUnroll() 712 v_g_2 = _mm512_mask_add_pd(v_g_2, m_2, v_g_2, v_p); in EltwiseMultModAVX512FloatLoopUnroll() 713 v_g_3 = _mm512_mask_add_pd(v_g_3, m_3, v_g_3, v_p); in EltwiseMultModAVX512FloatLoopUnroll() 714 v_g_4 = _mm512_mask_add_pd(v_g_4, m_4, v_g_4, v_p); in EltwiseMultModAVX512FloatLoopUnroll() [all …]
|
/dports/math/g2o/g2o-20201223_git/g2o/examples/icp/ |
H A D | gicp_sba_demo.cpp | 194 g2o::VertexSBAPointXYZ * v_p in main() local 198 v_p->setId(vertex_id++); in main() 199 v_p->setMarginalized(true); in main() 200 v_p->setEstimate(true_points.at(i) in main() 205 optimizer.addVertex(v_p); in main() 224 = dynamic_cast<g2o::OptimizableGraph::Vertex*>(v_p); in main()
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/form/ |
H A D | BilinearForm.cpp | 95 v_p = opv.unknown(); in IntgBilinearForm() 116 v_p = opv.unknown(); in IntgBilinearForm() 132 v_p = opv.unknown(); in IntgBilinearForm() 154 v_p = opv.unknown(); in IntgBilinearForm() 188 v_p = ibf.v_p; in operator =() 225 u_p=&u; v_p=&v; in setUnknowns() 259 if(u_p != v_p && v_p !=u_p->dual_p()) return _noSymmetry; in symType() 299 v_p = ibf.v_p; in operator =() 315 v_p = opv.unknown(); in DoubleIntgBilinearForm() 337 v_p = opv.unknown(); in DoubleIntgBilinearForm() [all …]
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/term/ |
H A D | SuTermMatrix.hpp | 87 const Unknown* v_p; //!< pointer to test function (line) member in xlifepp::SuTermMatrix 159 {return v_p;} //!< return pointer to testfunction (line) in vp() 163 …{return v_p;} //!< return pointer to testfunction (line) (w… in vp() 320 Space * space_v_p, const Unknown* u_p, const Unknown* v_p) in compute() argument 335 …ationAlgorithm<CM>::compute(*itsublf, *(entries_p->rEntries_p), r, space_u_p, space_v_p, u_p, v_p); in compute() 336 …ationAlgorithm<CM>::compute(*itsublf, *(entries_p->cEntries_p), c, space_u_p, space_v_p, u_p, v_p); in compute() 339 …tionAlgorithm<CM>::compute(*itsublf, *(entries_p->rmEntries_p), r, space_u_p, space_v_p, u_p, v_p); in compute() 340 …tionAlgorithm<CM>::compute(*itsublf, *(entries_p->cmEntries_p), c, space_u_p, space_v_p, u_p, v_p); in compute()
|
H A D | SuTermMatrix.cpp | 67 v_p=0; in SuTermMatrix() 85 v_p=0; in SuTermMatrix() 107 v_p = v; in SuTermMatrix() 132 v_p = &ux; in SuTermMatrix() 332 v_p = v; in diagFromSuTermVector() 480 v_p = mat.v_p; in copy() 669 if(v_p!=0) sps.insert(v_p->space()); in unknownSpaces() 1202 v_p = sut->v_p; in compute() 1226 v_p = stM->v_p; in compute() 1363 if(v_p->isComponent()) v=v_p->parent(); in toVectorUnknown() [all …]
|
/dports/x11-fm/rodent/rodent-5.3.16.3/apps/rodent-fm/iconview/ |
H A D | gridview-callbacks.i | 492 view_t *v_p = create_notebook_page (rfm_global_p->window, en); in newpage_f() local 493 v_p->module = view_p->module; in newpage_f() 495 rfm_layout_set_icon_size(v_p, ICON_SIZE_ID(view_p)); in newpage_f() 496 rfm_layout_set_vpane_allocation(v_p); in newpage_f() 497 rfm_layout_configure(v_p, MAX_ELEMENTS(view_p)); in newpage_f() 500 rodent_full_reload_view (v_p, en); in newpage_f() 588 view_t *v_p = g_object_get_data(G_OBJECT(page_child_box), "view_p"); in switch_page_f() local 595 TRACE("hidding page_label_button for view %p\n", v_p); in switch_page_f() 601 if (v_p == view_p) { in switch_page_f() 608 label_text = (v_p->en)?rodent_get_tabname(v_p->en->path): g_strdup(g_get_host_name()); in switch_page_f() [all …]
|
/dports/math/linbox/linbox-1.6.3/tests/ |
H A D | test-butterfly.C | 75 Vector v_p; in testSetButterfly() local 82 stream >> v_p; in testSetButterfly() 84 VD.copy (v, v_p); in testSetButterfly() 86 unsigned long real_k = v_p.first.size (); in testSetButterfly() 94 …for (typename Vector::first_type::iterator iter = v_p.first.begin (); iter != v_p.first.end (); ++… in testSetButterfly()
|
/dports/math/pari/pari-2.13.3/src/functions/modular_symbols/ |
H A D | mspadicinit | 10 Tp(phi) = a_p * phi, with v_p(a_p) >= flag. 18 with $v_p(a_p) \geq \fl$, which is faster as $\fl$ increases. 32 initialization), exceptions will occur if $v_p(a_p)$ violates this bound: 42 *** mstooms: incorrect type in mstooms [v_p(ap) > mspadicinit flag] (t_VEC).
|
/dports/science/code_saturne/code_saturne-7.1.0/src/base/ |
H A D | cs_field.c | 657 BFT_FREE(kv->val.v_p); in _cs_field_free_str() 682 BFT_FREE(kv->val.v_p); in _cs_field_free_struct() 2645 kd->def_val.v_p = NULL; in cs_field_define_key_str() 2701 kd->def_val.v_p = NULL; in cs_field_define_key_struct() 3313 str = kv->val.v_p; in cs_field_get_key_str() 3435 p = kv->val.v_p; in cs_field_get_key_struct() 3439 p = kd->def_val.v_p; in cs_field_get_key_struct() 3513 p = kv->val.v_p; in cs_field_get_key_struct_ptr() 3585 p = kv->val.v_p; in cs_field_get_key_struct_const_ptr() 3589 p = kd->def_val.v_p; in cs_field_get_key_struct_const_ptr() [all …]
|
/dports/math/pari/pari-2.13.3/src/functions/number_fields/ |
H A D | idealappr | 6 b such that v_p(b)=v_p(x) for all prime ideals p dividing x, and v_p(b)>=0
|
/dports/science/dynare/dynare-4.6.4/matlab/ |
H A D | dyn_risky_steadystate_solver.m | 108 x0 = ys0(pm.v_p); 176 x = ys(pm.v_p); 197 v_p = pm.v_p; variable 202 dr.ys(v_p) = x; 249 ys(pm.v_p) = x; 468 v_p = zeros(n_tags,1); variable 470 v_p(i) = find(strncmp(eq_tags(i,3),M.endo_names, ... 473 if any(lead_lag_incidence(lead_index,v_p)) 477 pm.v_p = v_p; 478 v_np = setdiff(1:M.endo_nbr,v_p); [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/examples/PACKAGES/adios/balance/ |
H A D | in.adios_balance2 | 48 dump 2 all custom 50 balance2.dump id v_p x y z 49 dump 3 all custom/adios 50 balance_custom2.bp id v_p x y z 52 #dump 3 all image 50 image.*.jpg v_p type &
|
/dports/devel/isa-l/isa-l-2.30.0/erasure_code/aarch64/ |
H A D | gf_vect_dot_prod_neon.S | 110 v_p .req v_p0 label 255 movi v_p.16b, #0 271 eor v_p.16b, v_data_lo.16b, v_p.16b 272 eor v_p.16b, v_p.16b, v_data_hi.16b
|