Home
last modified time | relevance | path

Searched refs:nb1 (Results 26 – 50 of 770) sorted by relevance

12345678910>>...31

/dports/security/keepass-plugin-keepassrpc/keepassrpc-1.8.0/Jayrock/tests/Jayrock/Json/
H A DTestNamedJsonBuffer.cs90 NamedJsonBuffer nb1 = new NamedJsonBuffer("foo", JsonBuffer.From("bar")); in Equality()
92 Assert.AreEqual(nb1, nb2); in Equality()
98 NamedJsonBuffer nb1 = new NamedJsonBuffer("foo", JsonBuffer.From("bar")); in NameInequality()
100 Assert.AreNotEqual(nb1, nb2); in NameInequality()
106 NamedJsonBuffer nb1 = new NamedJsonBuffer("foo", JsonBuffer.From("bar")); in BufferInequality()
108 Assert.AreNotEqual(nb1, nb2); in BufferInequality()
/dports/math/drgeo/drgeo-1.1.0/geo/
H A Dliste_elem.cc160 int nb1 = l1.nb_elem, nb2 = l2.nb_elem; in contenue() local
161 if (nb1 > nb2) in contenue()
164 while (nb1 != 0 && rep) in contenue()
168 nb1--; in contenue()
207 int nb1 = l1.nb_elem, nb2 = l2.nb_elem; in liste_elem_egale() local
209 if (nb1 != nb2) in liste_elem_egale()
213 while (nb1-- != 0) in liste_elem_egale()
/dports/science/quantum-espresso/q-e-qe-6.7.0/PW/src/
H A Dnew_nsg.f90285 CALL symonpair(na1,na2,isym,nb1,nb2)
287 viz_b = find_viz(nb1,nb2)
305 nrg(m00,m0,viz_b,nb1,is) * &
314 nrg(m00,m0,viz_b,nb1,is) * &
323 nrg(m00,m0,viz_b,nb1,is) * &
332 nrg(m00,m0,viz_b,nb1,is) * &
341 nrg(m00,m0,viz_b,nb1,is) * &
350 nrg(m00,m0,viz_b,nb1,is) * &
359 nrg(m00,m0,viz_b,nb1,is) * &
368 nrg(m00,m0,viz_b,nb1,is) * &
[all …]
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/brillouin_zone/
H A Dbrillioun.F473 integer nb0,nb1
492 nb1 = brillioun_unique_index(nbrillioun,dbl_mb(tks(1)))
493 kw(nb1) = kw(nb1) + dbl_mb(tks(1)+4*(nbrillioun)+3)
495 if (nb1.eq.(nbrillioun+1)) then
526 integer nb1
537 nb1 = 1
539 do while ((nb1.le.nbrillm).and.(.not.found))
540 found = brillioun_k_sym_compare(kc,ksvec_all(1,nb1))
541 if (.not.found) nb1 = nb1 + 1
544 brillioun_unique_index = nb1
/dports/cad/opencascade/opencascade-7.6.0/src/StepData/
H A DStepData_FieldList.cxx48 Standard_Integer i1,i2, nb1 = 1, nb2 = 1, ari = fi.Arity(); in FillShared() local
49 if (ari == 1) nb1 = fi.Length(); in FillShared()
50 if (ari == 2) { nb1 = fi.Length(1); nb2 = fi.Length(2); } in FillShared()
51 for (i1 = 1; i1 <= nb1; i1 ++) in FillShared()
/dports/games/xray_re-tools/xray_re-tools-52721d2/sources/utils/converter/opcode/
H A DOPC_BoxPruning.cpp94 bool Opcode::BipartiteBoxPruning(udword nb0, const AABB** array0, udword nb1, const AABB** array1, … in BipartiteBoxPruning() argument
97 if(!nb0 || !array0 || !nb1 || !array1) return false; in BipartiteBoxPruning()
106 float* MinPosList1 = new float[nb1]; in BipartiteBoxPruning()
110 for(udword i=0;i<nb1;i++) MinPosList1[i] = array1[i]->GetMin(Axis0); in BipartiteBoxPruning()
116 const udword* Sorted1 = RS1->Sort(MinPosList1, nb1).GetRanks(); in BipartiteBoxPruning()
122 const udword* const LastSorted1 = &Sorted1[nb1]; in BipartiteBoxPruning()
328 bool Opcode::BruteForceBipartiteBoxTest(udword nb0, const AABB** array0, udword nb1, const AABB** a… in BruteForceBipartiteBoxTest() argument
331 if(!nb0 || !array0 || !nb1 || !array1) return false; in BruteForceBipartiteBoxTest()
336 for(udword j=0;j<nb1;j++) in BruteForceBipartiteBoxTest()
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/Chem/
H A DTorsionFingerprints.py177 while len(nb1) == 1 and atomFlags[a1]:
179 a1 = nb1[0].GetIdx()
196 if nb1 and nb2:
197 bonds.append((a1, a2, nb1, nb2))
200 bonds.append((a1, a2, nb1, nb2))
234 for a1, a2, nb1, nb2 in bonds:
235 d1 = _getIndexforTorsion(nb1, inv)
245 if len(nb1) == 2:
254 if len(nb1) == 2 and len(nb2) == 2: # case 9
381 nb1 = _getHeavyAtomNeighbors(b.GetBeginAtom())
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/RWHeaderSection/
H A DRWHeaderSection_RWFileDescription.cxx42 Standard_Integer nb1 = data->NbParams(nsub1); in ReadStep() local
43 if (nb1 > 0) in ReadStep()
45 aDescription = new Interface_HArray1OfHAsciiString (1, nb1); in ReadStep()
46 for (Standard_Integer i1 = 1; i1 <= nb1; i1 ++) { in ReadStep()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/v3p/netlib/laso/
H A Ddlabfc.c41 integer i__, j, k, l, m, la, ld, kk, nb1, lpm; in dlabfc_() local
98 nb1 = *nband - 1; in dlabfc_()
138 m = min(i__2,nb1); in dlabfc_()
160 if (nb1 == 0) { in dlabfc_()
164 i__2 = nb1; in dlabfc_()
227 l = k - nb1; in dlabfc_()
235 if (nb1 == 0) { in dlabfc_()
240 i__2 = nb1; in dlabfc_()
/dports/misc/vxl/vxl-3.3.2/v3p/netlib/laso/
H A Ddlabfc.c41 integer i__, j, k, l, m, la, ld, kk, nb1, lpm; in dlabfc_() local
98 nb1 = *nband - 1; in dlabfc_()
138 m = min(i__2,nb1); in dlabfc_()
160 if (nb1 == 0) { in dlabfc_()
164 i__2 = nb1; in dlabfc_()
227 l = k - nb1; in dlabfc_()
235 if (nb1 == 0) { in dlabfc_()
240 i__2 = nb1; in dlabfc_()
/dports/java/eclipse-ecj/eclipse-ecj-4.4.2_1/org/eclipse/jdt/internal/compiler/flow/
H A DUnconditionalFlowInfo.java140 nb1, nb2, nb3, nb4; in addInfoFrom() local
400 nb1, nb2, nb3, nb4; in addPotentialNullInfoFrom() local
410 this.nullBit2 = b2 & (nb3 | (nb1 = ~b1)) in addPotentialNullInfoFrom()
412 this.nullBit3 = b3 & (nb1 & b2 in addPotentialNullInfoFrom()
418 this.nullBit4 = na3 & (nb1 & nb3 & b4 in addPotentialNullInfoFrom()
493 this.extra[3 + 1][i] = b3 & (nb1 & b2 in addPotentialNullInfoFrom()
1669 nb1, nb2, nb3, nb4, in mergedWith() local
1692 | b3 & (nb1 | b1 & nb2); in mergedWith()
1703 |nb1 & b2 & b3 & b4; in mergedWith()
1832 | b3 & (nb1 | b1 & nb2); in mergedWith()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/flow/
H A DUnconditionalFlowInfo.java160 nb1, nb2, nb3, nb4; in addInfoFrom() local
471 nb1, nb2, nb3, nb4; in addPotentialNullInfoFrom() local
481 this.nullBit2 = b2 & (nb3 | (nb1 = ~b1)) in addPotentialNullInfoFrom()
483 this.nullBit3 = b3 & (nb1 & b2 in addPotentialNullInfoFrom()
489 this.nullBit4 = na3 & (nb1 & nb3 & b4 in addPotentialNullInfoFrom()
559 this.extra[3 + 1][i] = b3 & (nb1 & b2 in addPotentialNullInfoFrom()
1740 nb1, nb2, nb3, nb4, in mergedWith() local
1765 | b3 & (nb1 | b1 & nb2); in mergedWith()
1776 |nb1 & b2 & b3 & b4; in mergedWith()
1931 | b3 & (nb1 | b1 & nb2); in mergedWith()
[all …]
/dports/net/haproxy20/haproxy-2.0.26/reg-tests/webstats/
H A Dwebstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/net/haproxy19/haproxy-1.9.16/reg-tests/webstats/
H A Dh_webstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/net/haproxy22/haproxy-2.2.19/reg-tests/webstats/
H A Dwebstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/net/haproxy23/haproxy-2.3.16/reg-tests/webstats/
H A Dwebstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/net/haproxy21/haproxy-2.1.12/reg-tests/webstats/
H A Dwebstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/games/zdoom/zdoom-2.8.1/gdtoa/
H A DstrtoIg.c43 unsigned int nb1, nb11; local
57 nb1 = nb & 31;
58 nb11 = (nb1 - 1) & 31;
77 || (nb1 && b1->x[nw1] & 1L << nb1)) {
/dports/misc/rump/buildrump.sh-b914579/src/lib/libc/gdtoa/
H A DstrtoIg.c45 unsigned int nb1, nb11; local
63 nb1 = nb & 31;
64 nb11 = (nb1 - 1) & 31;
83 || (nb1 && b1->x[nw1] & 1L << nb1)) {
/dports/games/ecwolf/ecwolf-1.3.3-src/gdtoa/
H A DstrtoIg.c43 unsigned int nb1, nb11; local
57 nb1 = nb & 31;
58 nb11 = (nb1 - 1) & 31;
77 || (nb1 && b1->x[nw1] & 1L << nb1)) {
/dports/net/nuster/nuster-5.0.4.21/reg-tests/webstats/
H A Dwebstats-scope-and-post-change.vtc60 expect resp.body ~ ".*\nb1,BACKEND.*"
82 …expect ~ "\nb1,srv1.*MAINT.*\nb1,srv2.*DRAIN.*\nb1,srv3.*MAINT.*\nb1,BACKEND.*DOWN.*\nb2,srv1.*MAI…
/dports/math/gap/gap-4.11.0/pkg/cohomolo-1.6.8/standalone/progs.d/
H A Dsubdir.c15 { short npt1,npt2,i,l,m,n,np,np1,np2,*p,*q,mxp,*perm2,nb1,nb2,nb; char err; in main() local
54 scanf("%hd",&nb1); in main()
55 if (nb1>=mb) in main()
57 for (i=1;i<=nb1;i++) scanf("%hd",base+i); in main()
59 scanf("%hd",&nb2); nb=nb1+nb2; in main()
62 p=base+nb1+1; in main()
/dports/science/openmx/openmx3.8/source/
H A Dexx_debug.c20 int iep, nep, iatm, nb, nb1, nb2, nbmax; in EXX_Debug_Copy_DM() local
59 nb1 = Spe_Total_CNO[WhatSpecies[GA_AN]]; in EXX_Debug_Copy_DM()
74 for (i=0; i<nb1; i++){ in EXX_Debug_Copy_DM()
89 nb1 = Spe_Total_CNO[WhatSpecies[GA_AN]]; in EXX_Debug_Copy_DM()
101 for (i=0; i<nb1; i++){ in EXX_Debug_Copy_DM()
190 int nb1, nb2; in EXX_Debug_Check_DM() local
199 nb1 = Spe_Total_CNO[WhatSpecies[GA_AN]]; in EXX_Debug_Check_DM()
214 for (i=0; i<nb1; i++){ in EXX_Debug_Check_DM()
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/phylip/src/
H A Dprotdist.cpp1150 long i, j, k, m, n, s, nb1, nb2; in maketrans() local
1206 pie[nb1 - 1] += x; in maketrans()
1211 prob[nb1 - 1][nb1 - 1] += x * (1.0 - ease); in maketrans()
1213 prob[nb1 - 1][nb2 - 1] += x; in maketrans()
1215 prob[nb1 - 1][nb1 - 1] += x; in maketrans()
1360 void predict(long nb1, long nb2, long cat) in predict() argument
1384 if (nb1 == nb2) { in predict()
1453 predict(nb1, nb2, cat); in prot_makedists()
1492 predict(nb1, 3L, cat); in prot_makedists()
1493 predict(nb1, 4L, cat); in prot_makedists()
[all …]
/dports/math/fxt/fxt/src/sort/
H A Dmerge-sort.h106 const ulong nb1 = nb>>1; in merge_sort_rec4() local
107 const ulong nb2 = nb - nb1; in merge_sort_rec4()
108 merge_sort_rec4(f+na, nb1, t); in merge_sort_rec4()
109 merge_sort_rec4(f+na+nb1, nb2, t); in merge_sort_rec4()
113 merge(f+na, nb1, nb2, t+na); in merge_sort_rec4()

12345678910>>...31