| /dports/science/siconos/siconos-4.4.0/kernel/src/utils/SiconosAlgebra/ |
| H A D | SiconosAlgebraProd.cpp | 83 if(numA == Siconos::BLOCK) in prod()
86 if(numA == Siconos::ZERO) in prod()
93 else if(numA == Siconos::IDENTITY) in prod()
273 if(numA == Siconos::BLOCK) in prod()
494 if(numA == Siconos::DENSE) in prod()
507 if(numA == Siconos::DENSE) in prod()
526 if (numA == numB) in prod()
606 switch(numA) in prod()
772 switch(numA) in prod()
1148 if(numA == Siconos::DENSE) in taxpy()
[all …]
|
| H A D | SimpleMatrixFreeOperators.cpp | 48 else if(numA == IDENTITY) in operator *()
64 else if(numA == SPARSE) in operator *()
66 else if(numA == BANDED) in operator *()
102 else if(numA == SPARSE) in operator *()
106 else if(numA == BANDED) in operator *()
145 else if(numA == SPARSE) in operator /()
147 else if(numA == BANDED) in operator /()
203 if(numA == DENSE) in operator +()
233 if(numA == DENSE) in operator +()
373 if(numA == DENSE) in operator -()
[all …]
|
| H A D | SimpleMatrixArithmetic.cpp | 37 Siconos::UBLAS_TYPE numA = A.num(); in add() local
56 if(numA == Siconos::ZERO) // A = 0 in add()
77 if(numA == numB && numA != 0) // A and B are of the same type and NOT block in add()
79 if(numC == numA) in add()
81 if(numA == Siconos::DENSE) in add()
98 if(numA == Siconos::DENSE) in add()
111 … else if(numA != 0 && numB != 0 && numA != numB) // A and B of different types and none is block in add()
117 if(numA == Siconos::DENSE) in add()
304 if(numA == numB && numA != 0) // A and B are of the same type and NOT block in sub()
360 if(numA == numB && numA != 0) // A and B are of the same type and NOT block in sub()
[all …]
|
| H A D | SimpleMatrixBLAS3.cpp | 240 Siconos::UBLAS_TYPE numA = A.num(); in axpy_prod() local
286 if(numA == Siconos::DENSE) in axpy_prod()
292 else if(numA == Siconos::SPARSE) in axpy_prod()
299 if(numA == Siconos::DENSE) in axpy_prod()
305 else if(numA == Siconos::SPARSE) in axpy_prod()
312 if(numA == Siconos::DENSE) in axpy_prod()
318 else if(numA == Siconos::SPARSE) in axpy_prod()
325 if(numA == Siconos::DENSE) in axpy_prod()
331 else if(numA == Siconos::SPARSE) in axpy_prod()
338 if(numA == Siconos::DENSE) in axpy_prod()
[all …]
|
| H A D | SiconosAlgebraSubProd.cpp | 60 Siconos::UBLAS_TYPE numA = A.num(); in subprod() local
67 if(numA == Siconos::ZERO) // A = 0 in subprod()
107 if(numA == Siconos::DENSE) in subprod()
122 else if(numA == Siconos::SPARSE) in subprod()
143 if(numA == Siconos::DENSE) in subprod()
193 if(numA == Siconos::DENSE) in subprod()
226 if(numA == Siconos::DENSE) in subprod()
270 if(numA == Siconos::DENSE) in subprod()
306 if(numA == Siconos::DENSE) in subprod()
355 if(numA == Siconos::DENSE) in subprod()
[all …]
|
| H A D | SiconosAlgebraScal.cpp | 48 Siconos::UBLAS_TYPE numA = A.num(); in scal() local
54 if(numA == Siconos::ZERO) in scal()
58 else if(numA == Siconos::IDENTITY) in scal()
74 if(numA == numB) // if A and B are of the same type ... in scal()
76 switch(numA) in scal()
151 if(numA == Siconos::BLOCK || numB == Siconos::BLOCK) // if A or B is block in scal()
172 switch(numA) in scal()
196 switch(numA) in scal()
|
| /dports/science/pybrain/pybrain-0.3.3/pybrain/rl/learners/modelbased/ |
| H A D | policyiteration.py | 57 numA = len(Ts)
59 Qs = zeros((dim, numA))
61 for a in range(numA):
80 numA = len(Ts)
82 policy = zeros((dim, numA))
94 numA = len(Qs[0])
95 policy = zeros((dim, numA))
105 numA = len(Ts)
107 return ones((dim, numA)) / float(numA), mean(array(Ts), axis=0)
112 numA = len(Ts)
[all …]
|
| H A D | leastsquares.py | 73 numA = len(Ts)
76 fMapRep = zeros((numF * numA, dim * numA))
77 for a in range(numA):
80 statMatrix = zeros((numF * numA, numF * numA))
81 statResidual = zeros(numF * numA)
84 fto = zeros(numF * numA)
85 for nextA in range(numA):
88 for a in range(numA):
94 Qs = zeros((dim, numA))
96 for a in range(numA):
|
| /dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/externals/fetk/mc/src/bam/ |
| H A D | mat.c | 92 thee->numA = 0; in Mat_ctor()
239 thee->numA = thee->numO; in Mat_initStructure()
240 if ( thee->numA > 0 ) { in Mat_initStructure()
262 if ( thee->numA > 0 ) { in Mat_initStructure()
285 if ( thee->numA > 0 ) { in Mat_initStructure()
323 if ( thee->numA > 0 ) { in Mat_initStructure()
344 if ( thee->numA > 0 ) { in Mat_initStructure()
468 if ( thee->numA > 0 ) { in Mat_copyStructure()
800 return thee->numA; in Mat_numA()
1908 &(thee->numA), in Mat_galerkin()
[all …]
|
| /dports/science/teem/teem-1.11.0-src/src/limn/test/ |
| H A D | intx.c | 32 unsigned int numA, numB, numC, idxA, idxB; in flipListIntx() local
34 numA = _srcA[0]; in flipListIntx()
39 for (idxA=0; idxA<numA; idxA++) { in flipListIntx()
55 unsigned int *srcA, *srcB, *dstC, *_srcA, *_srcB, numA, numB, numC, idx; in main() local
59 "list of values", &numA); in main()
69 for (idx=0; idx<numA; idx++) { in main()
79 _srcA = AIR_CAST(unsigned int*, calloc(1+numA, sizeof(unsigned int))); in main()
83 dstC = AIR_CAST(unsigned int*, calloc(1+AIR_MAX(numA,numB), in main()
87 _srcA[0] = numA; in main()
88 for (idx=0; idx<numA; idx++) { in main()
|
| /dports/math/ogdf/OGDF/src/ogdf/energybased/fast_multipole_embedder/ |
| H A D | FMEKernel.cpp | 330 eval_direct(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB, in eval_direct_fast()
331 x, y, s, fx, fy, numA); in eval_direct_fast()
337 eval_direct(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB); in eval_direct_fast()
339 eval_direct_aligned_SSE(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB); in eval_direct_fast()
341 eval_direct(x+ numA, y+ numA, s+ numA, fx+ numA, fy+ numA, numB, in eval_direct_fast()
445 eval_direct(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB,
446 x, y, s, fx, fy, numA);
452 eval_direct(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB);
454 eval_direct_aligned_aligned_sse(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB);
456 eval_direct_aligned_aligned_sse(x+numA, y+numA, s+numA, fx+numA, fy+numA, numB);
[all …]
|
| /dports/astro/siril/siril/src/registration/matching/ |
| H A D | match.c | 114 static void reset_copy_ids(int numA, struct s_star *star_list_A,
117 static int reset_A_coords(int numA, struct s_star *post_list_A,
128 int numA, numB; in new_star_match() local
214 if (get_stars(s1, n, &numA, &star_list_A)) { in new_star_match()
238 g_assert(numA_copy == numA); in new_star_match()
244 reset_copy_ids(numA, star_list_A, star_list_A_copy); in new_star_match()
284 atApplyTrans(numA, star_list_A, trans); in new_star_match()
361 if (reset_A_coords(numA, star_list_A, star_list_A_copy) != 0) { in new_star_match()
369 atApplyTrans(numA, star_list_A, trans); in new_star_match()
475 for (i = 0; i < numA; i++) { in reset_copy_ids()
[all …]
|
| /dports/biology/mothur/mothur-1.46.1/source/calculators/ |
| H A D | calculator.cpp | 345 if (numA == asx) { //B asn or asp (3 or 4) in fillNums()
364 if (numA == glx) { //Z gln or glu (6 or 7) in fillNums()
383 if (numA < ser2) { numA++; } in fillNums()
385 numAs.push_back(numA); numBs.push_back(3); //numA, asn in fillNums()
386 numAs.push_back(numA); numBs.push_back(4); //numA, asp in fillNums()
387 numAs.push_back(numA); numBs.push_back(3); //numA, asn in fillNums()
423 int numA = seqA[i].getNum(); in makeDists() local
426 if (numA != stop && numA != del && numA != quest && numA != unk && in makeDists()
432 if (numA != asx && numA != glx && numB != asx && numB != glx) { in makeDists()
433 if (numA < ser2) { numA++; } in makeDists()
[all …]
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/onlineupdate/source/update/updater/xpcom/glue/ |
| H A D | nsVersionComparator.cxx | 24 int32_t numA; member
37 int32_t numA; member
57 aResult.numA = 0; in ParseVP()
76 aResult.numA = INT32_MAX; in ParseVP()
81 aResult.numA = strtol(aPart, const_cast<char**>(&aResult.strB), 10); in ParseVP()
95 ++aResult.numA; in ParseVP()
142 aResult.numA = 0; in ParseVP()
161 aResult.numA = INT32_MAX; in ParseVP()
180 ++aResult.numA; in ParseVP()
286 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/xpcom/base/ |
| H A D | nsVersionComparator.cpp | 18 int32_t numA; member
30 int32_t numA; member
49 aResult.numA = 0; in ParseVP()
65 aResult.numA = INT32_MAX; in ParseVP()
68 aResult.numA = strtol(aPart, const_cast<char**>(&aResult.strB), 10); in ParseVP()
78 ++aResult.numA; in ParseVP()
116 aResult.numA = 0; in ParseVP()
134 aResult.numA = INT32_MAX; in ParseVP()
147 ++aResult.numA; in ParseVP()
233 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/xpcom/glue/ |
| H A D | nsVersionComparator.cpp | 19 int32_t numA; member
32 int32_t numA; member
54 aResult.numA = 0; in ParseVP()
70 aResult.numA = INT32_MAX; in ParseVP()
73 aResult.numA = strtol(aPart, const_cast<char**>(&aResult.strB), 10); in ParseVP()
83 ++aResult.numA; in ParseVP()
125 aResult.numA = 0; in ParseVP()
141 aResult.numA = INT32_MAX; in ParseVP()
154 ++aResult.numA; in ParseVP()
248 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/onlineupdate/source/update/updater/xpcom/glue/ |
| H A D | nsVersionComparator.cxx | 29 int32_t numA; member
42 int32_t numA; member
64 aResult.numA = 0; in ParseVP()
83 aResult.numA = INT32_MAX; in ParseVP()
88 aResult.numA = strtol(aPart, const_cast<char**>(&aResult.strB), 10); in ParseVP()
102 ++aResult.numA; in ParseVP()
152 aResult.numA = 0; in ParseVP()
171 aResult.numA = INT32_MAX; in ParseVP()
190 ++aResult.numA; in ParseVP()
301 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/xpcom/base/ |
| H A D | nsVersionComparator.cpp | 20 int32_t numA; member
32 int32_t numA; member
74 aResult.numA = 0; in ParseVP()
90 aResult.numA = INT32_MAX; in ParseVP()
93 aResult.numA = ns_strtol(aPart, const_cast<char**>(&aResult.strB)); in ParseVP()
103 ++aResult.numA; in ParseVP()
159 aResult.numA = 0; in ParseVP()
177 aResult.numA = INT32_MAX; in ParseVP()
190 ++aResult.numA; in ParseVP()
277 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/xpcom/base/ |
| H A D | nsVersionComparator.cpp | 20 int32_t numA; member
32 int32_t numA; member
74 aResult.numA = 0; in ParseVP()
90 aResult.numA = INT32_MAX; in ParseVP()
93 aResult.numA = ns_strtol(aPart, const_cast<char**>(&aResult.strB)); in ParseVP()
103 ++aResult.numA; in ParseVP()
159 aResult.numA = 0; in ParseVP()
177 aResult.numA = INT32_MAX; in ParseVP()
190 ++aResult.numA; in ParseVP()
277 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/www/firefox/firefox-99.0/xpcom/base/ |
| H A D | nsVersionComparator.cpp | 20 int32_t numA; member
32 int32_t numA; member
74 aResult.numA = 0; in ParseVP()
90 aResult.numA = INT32_MAX; in ParseVP()
93 aResult.numA = ns_strtol(aPart, const_cast<char**>(&aResult.strB)); in ParseVP()
103 ++aResult.numA; in ParseVP()
159 aResult.numA = 0; in ParseVP()
177 aResult.numA = INT32_MAX; in ParseVP()
190 ++aResult.numA; in ParseVP()
277 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/xpcom/base/ |
| H A D | nsVersionComparator.cpp | 20 int32_t numA; member
32 int32_t numA; member
74 aResult.numA = 0; in ParseVP()
90 aResult.numA = INT32_MAX; in ParseVP()
93 aResult.numA = ns_strtol(aPart, const_cast<char**>(&aResult.strB)); in ParseVP()
103 ++aResult.numA; in ParseVP()
159 aResult.numA = 0; in ParseVP()
177 aResult.numA = INT32_MAX; in ParseVP()
190 ++aResult.numA; in ParseVP()
277 int32_t r = ns_cmp(aVer1.numA, aVer2.numA); in CompareVP()
[all …]
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/addon-sdk/source/python-lib/cuddlefish/ |
| H A D | version_comparator.py | 76 self.numA = 0
85 self.numA = sys.maxint
88 self.numA = int(match.group(1))
92 self.numA += 1
121 r = cmp(self.numA, other.numA)
136 return repr((self.numA, self.strB, self.numC, self.extraD))
|
| /dports/astro/match/match-1.0/ |
| H A D | match.c | 114 static int reset_A_coords(int numA, struct s_star *post_list_A,
142 int numA, numB; in main() local
548 &numA, &star_list_A) != SH_SUCCESS) { in main()
568 shAssert(numA_copy == numA); in main()
574 reset_copy_ids(numA, star_list_A, star_list_A_copy); in main()
619 atApplyTrans(numA, star_list_A, trans); in main()
633 atMatchLists(numA, star_list_A, numB, star_list_B, in main()
699 atApplyTrans(numA, star_list_A, trans); in main()
794 for (i = 0; i < numA; i++) { in reset_copy_ids()
836 if (numA == 0) { in reset_A_coords()
[all …]
|
| H A D | atpmatch.h | 203 int atFindTrans(int numA, s_star *listA, int numB, s_star *listB,
210 int atMatchLists(int numA, s_star *listA, int numB, s_star *listB,
215 int numA, struct s_star *listA, int nobj, char *outfile);
218 atSmallTrans(int numA, struct s_star *listA,
227 atRecalcTrans(int numA, struct s_star *listA,
|
| /dports/java/apache-commons-lang/commons-lang-2.6-src/src/test/java/org/apache/commons/lang/mutable/ |
| H A D | MutableIntTest.java | 87 void testEquals(final Number numA, final Number numB, final Number numC) { in testEquals() argument
88 assertEquals(true, numA.equals(numA)); in testEquals()
89 assertEquals(true, numA.equals(numB)); in testEquals()
90 assertEquals(true, numB.equals(numA)); in testEquals()
92 assertEquals(false, numA.equals(numC)); in testEquals()
95 assertEquals(false, numA.equals(null)); in testEquals()
96 assertEquals(false, numA.equals(new Integer(0))); in testEquals()
97 assertEquals(false, numA.equals("0")); in testEquals()
|