Home
last modified time | relevance | path

Searched refs:nv1 (Results 1 – 25 of 912) sorted by relevance

12345678910>>...37

/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/base/
H A Dview_prop_unittest.cc27 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
31 ViewProp prop(nv1, kKey1, data1); in TEST()
32 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
36 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
41 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
46 EXPECT_EQ(data2, ViewProp::GetValue(nv1, kKey1)); in TEST()
50 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
54 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
60 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
64 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/ui/base/
H A Dview_prop_unittest.cc27 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
31 ViewProp prop(nv1, kKey1, data1); in TEST()
32 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
36 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
41 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
46 EXPECT_EQ(data2, ViewProp::GetValue(nv1, kKey1)); in TEST()
50 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
54 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
60 EXPECT_EQ(data1, ViewProp::GetValue(nv1, kKey1)); in TEST()
64 EXPECT_EQ(NULL, ViewProp::GetValue(nv1, kKey1)); in TEST()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Common/
H A Dnetwork.c40 int nv0, nv1; in create_net() local
119 verts[nv1].first = verts[nv1].last = adjlist; in create_net()
120 verts[nv1].degree++; in create_net()
125 verts[nv1].degree++; in create_net()
161 int nv0, nv1; in create_flow_net() local
253 if (nv0 < nv1){ in create_flow_net()
278 if (nv0 < nv1){ in create_flow_net()
294 net_edges->v0 = nv0 < nv1 ? nv0 : nv1; in create_flow_net()
295 net_edges->v1 = nv0 < nv1 ? nv1 : nv0; in create_flow_net()
310 verts[nv1].first = verts[nv1].last = adjlist; in create_flow_net()
[all …]
/dports/math/p5-Math-MPFR/Math-MPFR-4.17/t/
H A Datonv.t19 my($nv1, $nv2, $nv3, $double);
25 $nv1 = atonv('0b0.100001e-1074');
28 if($nv1 == $nv2 && $double == $nv2 && $nv2 == $nv3 && $nv1 > 0) {print "ok 1\n"}
30 warn "\n \$double: $double\n \$nv1: $nv1\n \$nv2: $nv2\n \$nv3: $nv3\n";
38 $nv1 = atonv('0b0.100001e-16445');
41 if($nv1 == $nv2 && $nv2 == $nv3 && $nv1 > 0) {print "ok 1\n"}
43 warn "\n \$nv1: $nv1\n \$nv2: $nv2\n \$nv3: $nv3\n";
83 if($nv1 == $nv2 && $nv2 == $nv3 && $nv1 > 0) {print "ok 1\n"}
85 warn "\n \$nv1: $nv1\n \$nv2: $nv2\n";
121 $nv1 = atonv('0.625');
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/
H A Dvrp_dg_network.c161 nv1 = nv->snode_next; in dg_net_shrink_chains()
163 ne = nv1->first; in dg_net_shrink_chains()
164 nv1->first = nv1->last; in dg_net_shrink_chains()
166 nv1->last = ne; in dg_net_shrink_chains()
176 nv1 = nv; in dg_net_shrink_chains()
185 nv1->snode_size++; in dg_net_shrink_chains()
196 if (nv1->snode_size){ in dg_net_shrink_chains()
197 nv1->first->next_edge = nv1->last = ne; in dg_net_shrink_chains()
201 dat->tail = nv1; in dg_net_shrink_chains()
203 dat->head = nv1; in dg_net_shrink_chains()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/
H A Dcnrp_dg_network.c160 nv1 = nv->snode_next; in dg_net_shrink_chains()
162 ne = nv1->first; in dg_net_shrink_chains()
163 nv1->first = nv1->last; in dg_net_shrink_chains()
165 nv1->last = ne; in dg_net_shrink_chains()
175 nv1 = nv; in dg_net_shrink_chains()
184 nv1->snode_size++; in dg_net_shrink_chains()
195 if (nv1->snode_size){ in dg_net_shrink_chains()
196 nv1->first->next_edge = nv1->last = ne; in dg_net_shrink_chains()
200 dat->tail = nv1; in dg_net_shrink_chains()
202 dat->head = nv1; in dg_net_shrink_chains()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Common/
H A Dnetwork.c40 int nv0, nv1; in createnet() local
105 if (!verts[nv1].first){ in createnet()
106 verts[nv1].first = verts[nv1].last = adjlist; in createnet()
107 verts[nv1].degree++; in createnet()
111 verts[nv1].last = adjlist; in createnet()
112 verts[nv1].degree++; in createnet()
149 int nv0, nv1; in createnet2() local
231 verts[nv1].first = verts[nv1].last = adjlist; in createnet2()
232 verts[nv1].degree++; in createnet2()
236 verts[nv1].last = adjlist; in createnet2()
[all …]
/dports/science/quantum-espresso/q-e-qe-6.7.0/PW/src/
H A Dlchk_tauxk.f9030 INTEGER :: nv1, nv2 local
46 DO nv1 = 1, nvec-1
47 DO nv2 = nv1+1, nvec
49 IF ( eqvect( vaux(1,nv1), vaux(1,nv2), zero, accep ) ) THEN
50 zero(:) = vaux(:,nv1) - vaux(:,nv2)
52 WRITE (message,'("atoms #",i4," and #",i4," overlap!")') nv1, nv2
56 nv1, nv2, NINT(zero)
/dports/math/cvc4/CVC4-1.7/src/expr/
H A Dmetakind_template.cpp66 bool NodeValueCompare::compare(const ::CVC4::expr::NodeValue* nv1, in compare() argument
68 if(nv1->d_kind != nv2->d_kind) { in compare()
72 if(nv1->getMetaKind() == kind::metakind::CONSTANT) { in compare()
73 switch(nv1->d_kind) { in compare()
76 Unhandled(::CVC4::expr::NodeValue::dKindToKind(nv1->d_kind)); in compare()
80 if(nv1->d_nchildren != nv2->d_nchildren) { in compare()
84 ::CVC4::expr::NodeValue::const_nv_iterator i = nv1->nv_begin(); in compare()
86 ::CVC4::expr::NodeValue::const_nv_iterator i_end = nv1->nv_end(); in compare()
99 template bool NodeValueCompare::compare<true>(const ::CVC4::expr::NodeValue* nv1,
101 template bool NodeValueCompare::compare<false>(const ::CVC4::expr::NodeValue* nv1,
/dports/science/py-ase/ase-3.22.0/ase/geometry/
H A Dgeometry.py252 (v0, v1), (nv0, nv1) = conditional_find_mic([v0, v1], cell, pbc)
254 if (nv0 <= 0).any() or (nv1 <= 0).any():
257 v1n = v1 / nv1[:, np.newaxis]
276 (v0, v1), (nv0, nv1) = conditional_find_mic([v0, v1], cell, pbc)
284 product = nv0 * nv1
289 - np.einsum('ij,i->ij', v1, cos_angles / nv1**2))
307 v1n = v1 / nv1[:, np.newaxis]
334 (v0, v1, v2), (nv0, nv1, nv2) = conditional_find_mic([v0, v1, v2], cell,
338 v1 /= nv1[:, np.newaxis]
351 deriv_d1 = (((nv1 + nv0 * cos_psi01) / nv1)[:, np.newaxis] * -deriv_d0
[all …]
/dports/graphics/geomview/geomview-1.9.5/src/bin/geomutil/ucd/
H A Dmake_frame.c44 HPoint3 nv1, nv2; in make_tform() local
47 VSUB3(p2, p1, &nv1); in make_tform()
49 nv1.w = 1.0; nv2.w = 1.0; in make_tform()
50 NORMALIZE3(&nv1); in make_tform()
52 if ( !make_rotation(&nv1, &nv2, m)) /* if collinear, use most recent rotation */ in make_tform()
/dports/misc/rump/buildrump.sh-b914579/src/usr.bin/config/
H A Dlint.c130 struct nvlist *nv1; in do_emit_instances() local
175 for (nv1 = a->a_devs; nv1 != NULL; nv1 = nv1->nv_next) in do_emit_instances()
176 do_emit_instances(nv1->nv_ptr, a); in do_emit_instances()
/dports/audio/surge-synthesizer-lv2/surge-release_1.9.0/src/common/dsp/
H A DMSEGModulationHelper.cpp182 float lv1 = r.nv1; in valueAt()
192 if (r.nv1 != r.v0) in valueAt()
194 lcpv = cpratio * (r.nv1 - lv0) + lv0; in valueAt()
792 ms->segments[sn].nv1 = nv; in extendTo()
824 float pv1 = ms->segments[idx].nv1; in splitSegment()
830 ms->segments[idx].nv1 = nv; in splitSegment()
835 ms->segments[idx + 1].nv1 = pv1; in splitSegment()
891 ms->segments[prior].nv1 = ms->segments[idx].nv1; in unsplitSegment()
1048 ms->segments[0].nv1 = 0.f; in clearMSEG()
1066 ms->segments[i].nv1 = 0; in blankAllSegments()
[all …]
/dports/graphics/cimg/CImg-v.2.9.7/examples/
H A Dtron.cpp161 int nu1 = u1, nv1 = v1, nu2 = u2, nv2 = v2; in main() local
162 if (disp.is_keyARROWLEFT()) { nu1 = -1; nv1 = 0; } in main()
163 if (disp.is_keyARROWRIGHT()) { nu1 = 1; nv1 = 0; } in main()
164 if (disp.is_keyARROWUP()) { nu1 = 0; nv1 = -1; } in main()
165 if (disp.is_keyARROWDOWN()) { nu1 = 0; nv1 = 1; } in main()
174 if (nu1!=-u1 && nv1!=-v1) { u1 = nu1; v1 = nv1; } in main()
/dports/graphics/gmic-qt/CImg-v.2.9.8/examples/
H A Dtron.cpp161 int nu1 = u1, nv1 = v1, nu2 = u2, nv2 = v2; in main() local
162 if (disp.is_keyARROWLEFT()) { nu1 = -1; nv1 = 0; } in main()
163 if (disp.is_keyARROWRIGHT()) { nu1 = 1; nv1 = 0; } in main()
164 if (disp.is_keyARROWUP()) { nu1 = 0; nv1 = -1; } in main()
165 if (disp.is_keyARROWDOWN()) { nu1 = 0; nv1 = 1; } in main()
174 if (nu1!=-u1 && nv1!=-v1) { u1 = nu1; v1 = nv1; } in main()
/dports/science/hdf/hdf-4.2.15/mfhdf/hdiff/
H A Dhdiff_vs.c206 int32 nv1, interlace1, vsize1; in vdata_cmp() local
220 VSinquire(vs1, &nv1, &interlace1, fields1, &vsize1, vsname1); in vdata_cmp()
229 if (vsotag1 != vsotag2 || nv1 != nv2 || interlace1 != interlace2 || in vdata_cmp()
237 vsotag1, nv1, interlace1, fields1, vsize1, vsclass1); in vdata_cmp()
246 buf1 = (uint8 *)HDmalloc((unsigned) (nv1 * vsize1)); in vdata_cmp()
256 VSread(vs1, buf1, nv1, interlace1); in vdata_cmp()
278 for (i=0; i<nv1; i++) in vdata_cmp()
331 for (i=0; i<nv1; i++) in vdata_cmp()
/dports/science/mpqc/mpqc-2.3.1/src/bin/mpqc/validate/
H A Dcheckout.pl337 my $nv1 = @v1;
339 if ($nv1 != $nv2) {
365 my $nv1 = @v1;
367 if ($nv1 != $nv2) {
393 my $nv1 = @v1;
395 if ($nv1 != $nv2) {
416 my $nv1 = @v1;
418 if ($nv1 != $nv2) {
/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/
H A DVrpNetwork.cpp49 int nv0, nv1, i; in createNet() local
92 nv1 = edges->v1 = edgeList[*indices]->getv1(); in createNet()
103 adjlist->other_end = nv1; in createNet()
104 adjlist->other = verts_ + nv1; in createNet()
106 if (!verts_[nv1].first){ in createNet()
107 verts_[nv1].first = verts_[nv1].last = adjlist; in createNet()
108 verts_[nv1].degree++; in createNet()
111 verts_[nv1].last->next_edge = adjlist; in createNet()
112 verts_[nv1].last = adjlist; in createNet()
113 verts_[nv1].degree++; in createNet()
/dports/math/asl/solvers/
H A Dfg_read.c171 if (a == nv1) in new_derp()
242 rv->a = nv1; in new_expr()
342 rvf->a = nv1; in eread()
637 rv->a = nv1; in eread()
1366 rvh->a = nv1; in aholread()
1387 rvh->a = nv1; in bholread()
1399 int n = nv1; in nlvzap()
1433 #undef nv1 in fg_read_ASL()
1434 int nv1; in fg_read_ASL() local
1505 nv = nv1; in fg_read_ASL()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutPool/
H A Dcnrp_cp.c535 int nv0 = 0, nv1 = 0; local
558 nv1 = edges[(indices[i] << 1) + 1];
561 nv1 = edges[((indices[i]-total_edgenum) << 1) + 1];
565 if (pedge->other_end == nv1){
567 for (pedge = verts[nv1].first; pedge; pedge = pedge->next){
580 nv1 = edges[(indices[i] << 1) + 1];
589 adjlist->other_end = nv1;
592 if (!verts[nv1].first)
593 verts[nv1].first = adjlist;
595 adjlist->next = verts[nv1].first;
[all …]
/dports/science/libccp4/libccp4-6.5.1/fortran/
H A Dcmaplib_f.c460 *nu1, *nu2, *nv1, *nv2, *nw1, *nsecs,
505 *nu1, *nu2, *nv1, *nv2, *nw1, *nsecs,
572 *nu1, *nu2, *nv1, *nv2, *nw1, *nsecs,
616 *nu1, *nu2, *nv1, *nv2, *nw1, *nsecs,
657 int *nu2, int *nv1, int *nv2, float cell[6], int *lspgrp,
704 mxyz, nu1, nu2, nv1, nv2, nw1,
724 int *nu2, int *nv1, int *nv2, float cell[6], int *lspgrp,
772 mxyz, nu1, nu2, nv1, nv2, nw1,
815 int *nu2, int *nv1, int *nv2, float cell[6], int *lspgrp,
853 mxyz, nu1, nu2, nv1, nv2, nw1,
[all …]
/dports/cad/opencascade/opencascade-7.6.0/tests/lowalgos/intss/
H A Dbug29972_444 set nv1 [ dval dx1*dx1+dy1*dy1+dz1*dz1 ]
47 set nv1 [ expr sqrt($nv1) ]
52 if {$dp < [ expr 0.25881904510252076234889883762405 * $nv1 * $nv2 ] } {
H A Dbug29972_650 set nv1 [ dval dx1*dx1+dy1*dy1+dz1*dz1 ]
53 set nv1 [ expr sqrt($nv1) ]
58 if {$dp < [ expr 0.76604444311897803520239265055542 * $nv1 * $nv2 ] } {
H A Dbug29972_550 set nv1 [ dval dx1*dx1+dy1*dy1+dz1*dz1 ]
53 set nv1 [ expr sqrt($nv1) ]
58 if {$dp < [ expr 0.76604444311897803520239265055542 * $nv1 * $nv2 ] } {
/dports/textproc/sdf/sdf-2.001/bin/
H A Dsdngen269 local(*nv1, *nv2, *name_list) = @_;
274 return %nv1 unless %nv2;
279 $diff{$name} = $nv1{$name} unless $nv1{$name} eq $nv2{$name};

12345678910>>...37