Home
last modified time | relevance | path

Searched refs:ind1 (Results 1 – 25 of 1561) sorted by relevance

12345678910>>...63

/dports/math/py-deap/deap-1.3.1/deap/tools/
H A Dcrossover.py18 def cxOnePoint(ind1, ind2): argument
32 ind1[cxpoint:], ind2[cxpoint:] = ind2[cxpoint:], ind1[cxpoint:]
34 return ind1, ind2
60 return ind1, ind2
89 ind1[i], ind2[i] = ind2[i], ind1[i]
91 return ind1, ind2
135 ind1[i], ind1[p1[temp2]] = temp2, temp1
179 ind1[i], ind1[p1[temp2]] = temp2, temp1
236 ind1[i], ind2[i] = ind2[i], ind1[i]
405 for i, (x1, s1, x2, s2) in enumerate(zip(ind1, ind1.strategy,
[all …]
/dports/textproc/pear-File_MARC/File_MARC-1.4.1/tests/
H A Dmarc_017.phpt17 …ind1":" ","ind2":" ","subfields":[{"a":"9515008808"},{"c":"FIM 72:00"}]}},{"035":{"ind1":" ","ind2…
H A Dmarc_021.phpt32 …ind1":" ","ind2":" ","subfields":[{"a":"9515008808"},{"c":"FIM 72:00"}]}},{"035":{"ind1":" ","ind2…
H A Dmarc_xml_008.phpt45 <datafield tag="010" ind1=" " ind2=" ">
48 <datafield tag="035" ind1=" " ind2=" ">
51 <datafield tag="035" ind1="9" ind2=" ">
54 <datafield tag="040" ind1=" " ind2=" ">
57 <datafield tag="050" ind1="0" ind2="0">
62 <datafield tag="245" ind1="0" ind2="4">
66 <datafield tag="260" ind1=" " ind2=" ">
71 <datafield tag="300" ind1=" " ind2=" ">
75 <datafield tag="500" ind1=" " ind2=" ">
78 <datafield tag="505" ind1="0" ind2=" ">
[all …]
H A Dmarc_016.phpt45 <datafield tag="010" ind1=" " ind2=" ">
48 <datafield tag="035" ind1=" " ind2=" ">
51 <datafield tag="035" ind1="9" ind2=" ">
54 <datafield tag="040" ind1=" " ind2=" ">
57 <datafield tag="050" ind1="0" ind2="0">
62 <datafield tag="245" ind1="0" ind2="4">
66 <datafield tag="260" ind1=" " ind2=" ">
71 <datafield tag="300" ind1=" " ind2=" ">
75 <datafield tag="500" ind1=" " ind2=" ">
78 <datafield tag="505" ind1="0" ind2=" ">
[all …]
H A Dmarc_xml_001.phpt25 <datafield tag="020" ind1=" " ind2=" ">
29 <datafield tag="035" ind1=" " ind2=" ">
32 <datafield tag="040" ind1=" " ind2=" ">
35 <datafield tag="042" ind1=" " ind2=" ">
39 <datafield tag="084" ind1=" " ind2=" ">
43 <datafield tag="084" ind1=" " ind2=" ">
48 <datafield tag="084" ind1=" " ind2=" ">
53 <datafield tag="084" ind1=" " ind2=" ">
58 <datafield tag="100" ind1="1" ind2=" ">
62 <datafield tag="245" ind1="0" ind2="4">
[all …]
H A Dmarc_xml_002.phpt25 <datafield tag="010" ind1=" " ind2=" ">
28 <datafield tag="020" ind1=" " ind2=" ">
32 <datafield tag="040" ind1=" " ind2=" ">
37 <datafield tag="042" ind1=" " ind2=" ">
40 <datafield tag="050" ind1="0" ind2="0">
44 <datafield tag="082" ind1="0" ind2="0">
48 <datafield tag="100" ind1="1" ind2=" ">
52 <datafield tag="245" ind1="1" ind2="0">
56 <datafield tag="250" ind1=" " ind2=" ">
59 <datafield tag="260" ind1=" " ind2=" ">
[all …]
/dports/java/java3d/java3d-1.5.2/j3d-core-utils/src/classes/share/com/sun/j3d/utils/geometry/
H A DEarClip.java78 int ind0, ind1, ind2; in classifyAngles() local
82 ind1 = ind; in classifyAngles()
83 i1 = triRef.fetchData(ind1); in classifyAngles()
94 ind1 = ind2; in classifyAngles()
95 } while (ind1 != ind); in classifyAngles()
101 int ind1; in classifyEars() local
112 ind1 = ind; in classifyEars()
113 i1 = triRef.fetchData(ind1); in classifyEars()
121 ind1 = triRef.fetchNextData(ind1); in classifyEars()
123 } while (ind1 != ind); in classifyEars()
[all …]
H A DBridge.java151 ind1[0] = ind; in findBridge()
170 ind1[0] = triRef.fetchNextData(ind1[0]); in findBridge()
188 ind1[0] = triRef.fetchNextData(ind1[0]); in findBridge()
233 ind1[0] = ind; in findBridge()
242 int ind1, i1; in findLeftMostVertex() local
244 ind1 = ind; in findLeftMostVertex()
246 leftInd[0] = ind1; in findLeftMostVertex()
248 ind1 = triRef.fetchNextData(ind1); in findLeftMostVertex()
250 while (ind1 != ind) { in findLeftMostVertex()
252 leftInd[0] = ind1; in findLeftMostVertex()
[all …]
H A DDesperate.java80 int[] ind1 = new int[1]; in desperate() local
121 ind1[0] = ind; in existsCrossOver()
137 ind1[0] = ind2[0]; in existsCrossOver()
146 } while (ind1[0] != ind); in existsCrossOver()
194 int ind0, ind1, ind2; in letsHope() local
199 ind1 = ind; in letsHope()
211 ind1 = triRef.fetchNextData(ind1); in letsHope()
213 } while (ind1 != ind); in letsHope()
247 ind1[0] = ind; in existsSplit()
261 ind1[0] = ind4; in existsSplit()
[all …]
H A DProject.java118 int ind0, ind1, ind2; in determineNormal() local
122 ind1 = ind; in determineNormal()
123 i1 = triRef.fetchData(ind1); in determineNormal()
144 ind1 = ind2; in determineNormal()
147 while (ind1 != ind) { in determineNormal()
159 ind1 = ind2; in determineNormal()
190 int ind, ind1; in projectPoints() local
237 ind1 = ind; in projectPoints()
242 ind1 = triRef.fetchNextData(ind1); in projectPoints()
244 while (ind1 != ind) { in projectPoints()
[all …]
/dports/science/PETSc/petsc-3.14.1/src/mat/tests/
H A Dex117.c27 ind1[0]=0;ind1[1]=1; in main()
29 ierr = MatSetValues(mat,2,ind1,2,ind1,temp,INSERT_VALUES);CHKERRQ(ierr); in main()
33 ind1[0]=2;ind1[1]=3; in main()
35 ierr = MatSetValues(mat,2,ind1,2,ind1,temp,INSERT_VALUES);CHKERRQ(ierr); in main()
36 ind1[0]=4;ind1[1]=5; in main()
38 ierr = MatSetValues(mat,2,ind1,2,ind1,temp,INSERT_VALUES);CHKERRQ(ierr); in main()
44 ind1[0]=0;ind1[1]=1; in main()
46 ierr = MatSetValues(mat,2,ind1,2,ind1,temp,INSERT_VALUES);CHKERRQ(ierr); in main()
50 ind1[0]=2;ind1[1]=3; in main()
52 ierr = MatSetValues(mat,2,ind1,2,ind1,temp,INSERT_VALUES);CHKERRQ(ierr); in main()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dsquared_distance_2_2.h40 distance_index(int &ind1, in distance_index() argument
63 ind1 = 1; ind2 = 2; in distance_index()
66 ind1 = 1; ind2 = -1; in distance_index()
82 ind1 = 0; ind2 = -1; in distance_index()
85 ind1 = 0; ind2 = 1; in distance_index()
109 ind1 = 1; ind2 = 2; in distance_index()
163 ind1 = 0; ind2 = 2; in distance_index()
222 if (ind1 == -1) in squared_distance_indexed()
239 int ind1,ind2; in squared_distance() local
309 ind_ray = ind1; in squared_distance()
[all …]
H A DSmall_side_angle_bisector_decomposition_2.h171 unsigned int ind1, ind2; in operator() local
504 for (ind1 = 0; ind1 < vec.size(); ++ind1) { in _compute_min_diagonal()
539 u_ind = ind1; in _compute_min_diagonal()
569 if (ind1 > ind2) { in _split_by_diagonal()
570 i1 = ind1; in _split_by_diagonal()
571 ind1 = ind2; in _split_by_diagonal()
591 if (i1 == ind1) { in _split_by_diagonal()
626 vec1[i1-ind1].visible.push_back(*iter - ind1); in _split_by_diagonal()
634 vec1[i1-ind1].non_visible.push_back(*iter - ind1); in _split_by_diagonal()
660 if (i1 == ind1) { in _split_by_diagonal()
[all …]
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/
H A Dsparse.py79 def sparse_sum(ind1, data1, ind2, data2): argument
90 j1 = ind1[i1]
117 while i1 < ind1.shape[0]:
118 j1 = ind1[i1]
143 def sparse_diff(ind1, data1, ind2, data2): argument
172 def sparse_mul(ind1, data1, ind2, data2): argument
181 j1 = ind1[i1]
406 if ind1.shape[0] == ind2.shape[0] and np.all(ind1 == ind2):
571 for i in range(ind1.shape[0]):
579 all_indices = arr_union(ind1, ind2)
[all …]
/dports/biology/star/STAR-2.7.9a/source/
H A DsjdbBuildIndex.cpp145 if (ind1<nGsj) { in sjdbBuildIndex()
148 ind1=(ind1-nGsj) | N2bit; in sjdbBuildIndex()
160 uint ind1=SA[isa]; in sjdbBuildIndex() local
161 if ( (ind1 & N2bit)>0 ) in sjdbBuildIndex()
194 if (ind1<nGsj) { in sjdbBuildIndex()
197 ind1=(ind1-nGsj) | N2bit; in sjdbBuildIndex()
263 int64 ind1=0; in sjdbBuildIndex() local
266 ind1 <<= 2; in sjdbBuildIndex()
269 ind1+=3; in sjdbBuildIndex()
277 ind1 <<= 2; in sjdbBuildIndex()
[all …]
H A DinsertSeqSA.cpp35 uint64 ind1=SA[isa]; in insertSeqSA() local
36 if ( (ind1 & N2bit)>0 ) in insertSeqSA()
45 if ( ind1>=nG ) in insertSeqSA()
162 if (ind1<nG1) { in insertSeqSA()
163 ind1+=nG; in insertSeqSA()
165 ind1=(ind1-nG1+nG2) | N2bit; in insertSeqSA()
189 uint ind1=indArray[isa1*2+1]; in insertSeqSA() local
190 if (ind1<nG1) in insertSeqSA()
192 ind1+=nG; in insertSeqSA()
195 ind1=(ind1-nG1+nG2) | N2bit; in insertSeqSA()
[all …]
/dports/biology/molden/molden5.8/
H A Dfiles.f26 2170 ind1 = j
27 do j=ind1,320
33 fniun = keyori(ind1:ind2)
34 do j=ind1,ind2
71 2170 ind1 = j
73 do j=ind1,320
87 do j=ind1,ind2
117 2170 ind1 = j
118 do j=ind1,320
146 2170 ind1 = j
[all …]
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/components/genebuilder/cv/
H A DAbstractCvBox.java51 int ind2 = qualifierString.indexOf(";", ind1); in getField()
55 if(ind2 > ind1 && ind1 > -1) in getField()
56 field = qualifierString.substring(ind1+len,ind2); in getField()
57 else if(ind1 > -1) in getField()
58 field = qualifierString.substring(ind1+len); in getField()
102 int ind2 = newQualifierString.indexOf(";", ind1); in changeField()
106 if(ind2 > ind1 && ind1 > -1) in changeField()
110 newQualifierString.substring(0, ind1) + in changeField()
114 newQualifierString.substring(0, ind1+len) + in changeField()
118 else if(ind1 > -1) in changeField()
[all …]
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/ML/Cluster/Murtagh/
H A Dhc.c132 ind1 = ioffset_(n, &i2, &j2);
149 ind1 = ioffset_(n, &i2, &k);
151 ind1 = ioffset_(n, &k, &i2);
164 diss[ind1] = (membr[i2] + membr[k]) * diss[ind1] + (membr[j2] +
166 diss[ind1] /= x;
188 diss[ind1] = (membr[i2] * diss[ind1] + membr[j2] * diss[ind2]) / (
195 diss[ind1] = diss[ind1] * (float).5 + diss[ind2] * (float).5;
201 diss[ind1] = diss[ind1] * (float).5 + diss[ind2] * (float).5 - xx
208 diss[ind1] = (membr[i2] * diss[ind1] + membr[j2] * diss[ind2] -
216 if (diss[ind1] >= dmin__) {
[all …]
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/editor/
H A DHitInfo.java107 int ind1 = header.indexOf(" "); in setBLASTPInfo() local
108 if(ind1 > -1) in setBLASTPInfo()
110 id = header.substring(0,ind1); in setBLASTPInfo()
161 ind1 = header.lastIndexOf(" "); in setBLASTPInfo()
178 int ind1 = header.indexOf(" "); in setFastaHitInfo() local
179 if(ind1 > -1) in setFastaHitInfo()
181 id = header.substring(0,ind1); in setFastaHitInfo()
215 ind1 = ind2; in setFastaHitInfo()
224 ind1 = ind2+1; in setFastaHitInfo()
457 int ind1 = s.indexOf("(EC "); in appendDescription() local
[all …]
/dports/math/nfft/nfft-3.5.2/matlab/nfsft/@f_hat/
H A Dsubsasgn.m26 ind1 = s.subs{1}; variable
29 if (any(round(ind1) ~= ind1) || min(ind1) < 0 || max(ind1) > p.N)
37 if (length(ind1) == 1 && min(ind2) >= -ind1 && max(ind2) <= ind1)
38 p.f_hat(ind1^2+ind1+1+ind2) = v;
39 elseif (length(ind2) == 1 && min(ind1) >= abs(ind2))
40 ind = zeros(size(ind1));
41 for k = 1:length(ind1)
42 ind(k) = ind1(k)^2+ind1(k)+1+ind2;
H A Dsubsref.m26 ind1 = s.subs{1}; variable
29 if (any(round(ind1) ~= ind1) || min(ind1) < 0 || max(ind1) > p.N)
37 if (length(ind1) == 1 && min(ind2) >= -ind1 && max(ind2) <= ind1)
38 b = p.f_hat(ind1^2+ind1+1+ind2);
39 elseif (length(ind2) == 1 && min(ind1) >= abs(ind2))
40 b = zeros(size(ind1));
41 for k = 1:length(ind1)
42 b(k) = p.f_hat(ind1(k)^2+ind1(k)+1+ind2);
/dports/math/py-deap/deap-1.3.1/doc/code/tutorials/part_3/
H A D3_next_step.py18 ind1 = toolbox.individual() variable
20 print ind1 # [0.86..., 0.27..., 0.70..., 0.03..., 0.87...]
21 print ind1.fitness.valid # False
30 ind1.fitness.values = evaluate(ind1)
31 print ind1.fitness.valid # True
32 print ind1.fitness # (2.73, 0.2)
35 mutant = toolbox.clone(ind1)
40 print mutant is ind1 # False
43 child1, child2 = [toolbox.clone(ind) for ind in (ind1, ind2)]
55 population = [ind1, ind2]*10
/dports/science/dynare/dynare-4.6.4/matlab/
H A Didentification_checks.m84 Xparnonzero = Xpar(ind1,ind1); % focus on non-zero rows and columns for Qu and Tkachenko's G
111 ind1 = ind1(find(ind11)); % find non-zero columns variable
117 Xparnonzero = Xpar(ind1,ind1); % focus on non-zero rows and columns for Qu and Tkachenko's G
127 ind0(ind1) = 1;
135 deltaX = sqrt(diag(X(ind1,ind1)));
136 tildaX = X(ind1,ind1)./((deltaX)*(deltaX'));
138 Pco(ind1,ind1)=inv(X(ind1,ind1));
151 if length(ind1)<param_nbr
177 Pco(ind1(ii),ind1(ii)) = 1;
179 Pco(ind1(ii),ind1(jj)) = cosn([Xparnonzero(:,ii),Xparnonzero(:,jj),Xrest]);
[all …]

12345678910>>...63