Home
last modified time | relevance | path

Searched refs:j_count (Results 1 – 25 of 26) sorted by relevance

12

/dports/science/py-pyscf/pyscf-2.0.1/pyscf/lib/ao2mo/
H A Dr_ao2mo.c59 int j_count = envs->ket_count; in AO2MOmmm_r_iltj() local
105 mo2 = mo1 + n2c*j_count; in AO2MOmmm_r_iltj()
111 vout2 = vout1 + i_count * j_count; in AO2MOmmm_r_iltj()
112 vout3 = vout2 + i_count * j_count; in AO2MOmmm_r_iltj()
153 int j_count = envs->ket_count; in AO2MOmmm_r_igtj() local
156 double *buf2 = buf1 + n2c*j_count; in AO2MOmmm_r_igtj()
157 double *buf3 = buf2 + n2c*j_count; in AO2MOmmm_r_igtj()
174 mo2 = mo1 + n2c*j_count; in AO2MOmmm_r_igtj()
208 &D1, buf1, &j_count, mo_r, &n2c, &D0, vout1, &j_count); in AO2MOmmm_r_igtj()
210 &D1, bufr, &j_count, mo2, &n2c, &D0, vout2, &j_count); in AO2MOmmm_r_igtj()
[all …]
H A Dnr_incore.h21 int i_start, int i_count, int j_start, int j_count,
25 int i_start, int i_count, int j_start, int j_count,
30 int i_start, int i_count, int j_start, int j_count);
H A Dnr_incore.c63 int i_start, int i_count, int j_start, int j_count) in AO2MOnr_e1incore_drv() argument
69 envs.ket_count = j_count; in AO2MOnr_e1incore_drv()
78 nao, i_count, j_count) \ in AO2MOnr_e1incore_drv()
81 double *buf = malloc(sizeof(double) * (nao+i_count) * (nao+j_count)); in AO2MOnr_e1incore_drv()
H A Dnr_ao2mo.c185 int j_count = envs->ket_count; in AO2MOmmm_nr_s1_iltj() local
194 &D0, vout, &j_count); in AO2MOmmm_nr_s1_iltj()
217 int j_count = envs->ket_count; in AO2MOmmm_nr_s1_igtj() local
223 &D0, buf, &j_count); in AO2MOmmm_nr_s1_igtj()
226 &D0, vout, &j_count); in AO2MOmmm_nr_s1_igtj()
253 int j_count = envs->ket_count; in AO2MOmmm_nr_s2_s2() local
269 buf1 += j_count; in AO2MOmmm_nr_s2_s2()
306 &D0, vout, &j_count); in AO2MOmmm_nr_s2_iltj()
342 &D0, vout, &j_count); in AO2MOmmm_nr_s2_igtj()
391 &D0, vout, &j_count); in AO2MOmmm_ket_nr_s1()
[all …]
/dports/science/py-pyscf/pyscf-2.0.1/pyscf/lib/cc/
H A Dccsd_grad.c46 int j_count = envs->ket_count; in CCmmm_transpose_sum() local
49 double *buf1 = buf + nao*j_count; in CCmmm_transpose_sum()
51 dgemm_(&TRANS_N, &TRANS_T, &j_count, &nao, &i_count, in CCmmm_transpose_sum()
52 &D1, vin, &j_count, mo_coeff+i_start*nao, &nao, in CCmmm_transpose_sum()
53 &D0, buf, &j_count); in CCmmm_transpose_sum()
54 dgemm_(&TRANS_N, &TRANS_N, &nao, &nao, &j_count, in CCmmm_transpose_sum()
55 &D1, mo_coeff+j_start*nao, &nao, buf, &j_count, in CCmmm_transpose_sum()
/dports/science/py-pyscf/pyscf-2.0.1/pyscf/lib/ri/
H A Dr_df_incore.c77 int j_count = envs->ket_count; in RIhalfmmm_r_s1_ket() local
80 zgemm_(&TRANS_T, &TRANS_N, &j_count, &n2c, &n2c, in RIhalfmmm_r_s1_ket()
82 &Z0, vout, &j_count); in RIhalfmmm_r_s1_ket()
128 int j_count = envs->ket_count; in RIhalfmmm_r_s2_ket() local
130 double complex *buf = malloc(sizeof(double complex)*n2c*j_count); in RIhalfmmm_r_s2_ket()
133 zhemm_(&SIDE_L, &UPLO_U, &n2c, &j_count, in RIhalfmmm_r_s2_ket()
137 for (i = 0; i < j_count; i++) { in RIhalfmmm_r_s2_ket()
140 vout += j_count; in RIhalfmmm_r_s2_ket()
/dports/databases/vfront/vfront-0.96c/inc/
H A Dfunc.browser_detection.php399 $j_count = count( $a_moz_types );
400 for ( $j = 0; $j < $j_count; $j++ )
512 $j_count = count( $a_webkit_types );
513 for ( $j = 0; $j < $j_count; $j++ )
870 $j_count = count($os_working_data);
871 for ($j = 0; $j < $j_count; $j++)
887 $j_count = count($os_working_data);
888 for ($j = 0; $j < $j_count; $j++)
1026 $j_count = count( $a_mobile_search );
1027 for ($j = 0; $j < $j_count; $j++)
/dports/net-im/tg_owt/tg_owt-d578c76/src/base/android/
H A Danimation_frame_time_histogram.cc16 jint j_count) { in JNI_AnimationFrameTimeHistogram_SaveHistogram() argument
22 for (int i = 0; i < j_count; ++i) { in JNI_AnimationFrameTimeHistogram_SaveHistogram()
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/old/
H A Dtest_concurrent_vector_v2.cpp232 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
233 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
234 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
235 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
236 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
237 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
238 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
239 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/devel/tbb/oneTBB-2020.3/src/old/
H A Dtest_concurrent_vector_v2.cpp232 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
233 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
234 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
235 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
236 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
237 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
238 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
239 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/old/
H A Dtest_concurrent_vector_v2.cpp232 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
233 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
234 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
235 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
236 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
237 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
238 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
239 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/mp2_grad/
H A Dmp2_grad_utils.F57 integer j,j_count,b,b_count,count
/dports/science/nwchem-data/nwchem-7.0.2-release/src/mp2_grad/
H A Dmp2_grad_utils.F57 integer j,j_count,b,b_count,count
/dports/devel/onetbb/oneTBB-2021.4.0/test/conformance/
H A Dconformance_concurrent_vector.cpp57 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
58 REQUIRE( ((i==j)==(i_count==j_count)) ); in CheckIteratorComparison()
59 REQUIRE( ((i!=j)==(i_count!=j_count)) ); in CheckIteratorComparison()
60 REQUIRE( ((i-j)==(i_count-j_count)) ); in CheckIteratorComparison()
61 REQUIRE( ((i<j)==(i_count<j_count)) ); in CheckIteratorComparison()
62 REQUIRE( ((i>j)==(i_count>j_count)) ); in CheckIteratorComparison()
63 REQUIRE( ((i<=j)==(i_count<=j_count)) ); in CheckIteratorComparison()
64 REQUIRE( ((i>=j)==(i_count>=j_count)) ); in CheckIteratorComparison()
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/
H A Dtest_concurrent_vector.cpp241 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
242 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
243 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
244 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
245 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
246 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
247 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
248 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/devel/tbb/oneTBB-2020.3/src/test/
H A Dtest_concurrent_vector.cpp241 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
242 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
243 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
244 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
245 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
246 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
247 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
248 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/
H A Dtest_concurrent_vector.cpp241 for( int j_count=0; j_count<100; ++j_count ) { in CheckIteratorComparison() local
242 ASSERT( (i==j)==(i_count==j_count), NULL ); in CheckIteratorComparison()
243 ASSERT( (i!=j)==(i_count!=j_count), NULL ); in CheckIteratorComparison()
244 ASSERT( (i-j)==(i_count-j_count), NULL ); in CheckIteratorComparison()
245 ASSERT( (i<j)==(i_count<j_count), NULL ); in CheckIteratorComparison()
246 ASSERT( (i>j)==(i_count>j_count), NULL ); in CheckIteratorComparison()
247 ASSERT( (i<=j)==(i_count<=j_count), NULL ); in CheckIteratorComparison()
248 ASSERT( (i>=j)==(i_count>=j_count), NULL ); in CheckIteratorComparison()
/dports/editors/focuswriter/focuswriter-1.7.6/src/
H A Dsymbols_dialog.cpp149 for (int j = 0, j_count = names.count(); j < j_count; ++j) { in SymbolsDialog() local
/dports/science/mcstas-comps/mcstas-comps-2.5-src/contrib/union/
H A DPowder_process.comp150 double q_count=0, j_count=0, F2_count=0;
290 if (!j_count) j_count = j;
293 && fabs(F2_count-F2) < 0.0001*fabs(F2) && j_count == j) {
312 j_count = j;
/dports/science/mcxtrace-comps/mcxtrace-comps-1.2-src/samples/
H A DPowderN.comp290 double q_count=0, j_count=0, F2_count=0;
415 if (!j_count) j_count = j;
418 && fabs(F2_count-F2) < 0.0001*fabs(F2) && j_count == j) {
436 j_count = j;
/dports/science/mcstas-comps/mcstas-comps-2.5-src/samples/
H A DPowderN.comp300 double q_count=0, j_count=0, F2_count=0;
453 if (!j_count) j_count = j;
456 && fabs(F2_count-F2) < 0.0001*fabs(F2) && j_count == j) {
477 j_count = j;
H A DIsotropic_Sqw.comp487 double q_count=0, j_count=0, F2_count=0;
584 if (!j_count) j_count = j;
587 && fabs(F2_count-F2) < 0.0001*fabs(F2) && j_count == j) {
604 j_count = j;
/dports/graphics/openorienteering-mapper/mapper-0.9.2/src/core/objects/
H A Dboolean_tool.cpp334 for (int j = 0, j_count = node.Childs[i]->ChildCount(); j < j_count; ++j) in outerPolyNodeToPathObjects() local
/dports/science/mcstas-comps/mcstas-comps-2.5-src/obsolete/
H A DIsotropic_Sqw_legacy.comp417 double q_count=0, j_count=0, F2_count=0;
512 if (!j_count) j_count = j;
515 && fabs(F2_count-F2) < 0.0001*fabs(F2) && j_count == j) {
532 j_count = j;
/dports/games/wesnoth/wesnoth-1.14.17/src/units/
H A Dunit.cpp1656 for(unsigned j = 0, j_count = modification_count("advancement", adv["id"]); j < j_count; ++j) { in amla_icons() local

12