Home
last modified time | relevance | path

Searched refs:idx1 (Results 1 – 25 of 4517) sorted by relevance

12345678910>>...181

/dports/multimedia/libquicktime-lame/libquicktime-1.2.4/src/
H A Davi_idx1.c41 if(idx1->table) free(idx1->table); in quicktime_delete_idx1()
69 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_read_idx1() local
80 idx1->table_allocation = idx1->table_size; in quicktime_read_idx1()
81 idx1->table = calloc(sizeof(quicktime_idx1table_t), idx1->table_size); in quicktime_read_idx1()
131 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_set_idx1_keyframe() local
159 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_update_idx1table() local
182 if(idx1->table_size >= idx1->table_allocation) in quicktime_update_idx1table()
186 idx1->table = realloc(idx1->table, sizeof(*idx1->table) * idx1->table_allocation); in quicktime_update_idx1table()
187 memset(idx1->table + idx1->table_size, 0, in quicktime_update_idx1table()
188 sizeof(*idx1->table) * (idx1->table_allocation - idx1->table_size)); in quicktime_update_idx1table()
[all …]
/dports/multimedia/libquicktime/libquicktime-1.2.4/src/
H A Davi_idx1.c41 if(idx1->table) free(idx1->table); in quicktime_delete_idx1()
69 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_read_idx1() local
80 idx1->table_allocation = idx1->table_size; in quicktime_read_idx1()
81 idx1->table = calloc(sizeof(quicktime_idx1table_t), idx1->table_size); in quicktime_read_idx1()
131 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_set_idx1_keyframe() local
159 quicktime_idx1_t *idx1 = &riff->idx1; in quicktime_update_idx1table() local
182 if(idx1->table_size >= idx1->table_allocation) in quicktime_update_idx1table()
186 idx1->table = realloc(idx1->table, sizeof(*idx1->table) * idx1->table_allocation); in quicktime_update_idx1table()
187 memset(idx1->table + idx1->table_size, 0, in quicktime_update_idx1table()
188 sizeof(*idx1->table) * (idx1->table_allocation - idx1->table_size)); in quicktime_update_idx1table()
[all …]
/dports/math/libpgmath/flang-d07daf3/runtime/flang/
H A Dftni64misc.c45 int idx1, idx2, match; local
46 for (idx1 = 0; idx1 < a1_len; idx1++) {
57 return (idx1 + 1);
81 int ret_val, idx1; local
106 for (idx1 = 0; idx1 < (a1_len - a2_len); idx1++) {
130 for (idx1 = 0; idx1 < (a2_len - a1_len); idx1++) {
157 for (idx1 = 0; idx1 < a1_len; idx1++) {
168 return (idx1 + 1);
192 _LONGLONG_T idx1; local
218 for (idx1 = 0; idx1 < (a1_len - a2_len); idx1++) {
[all …]
/dports/security/hashcat/hashcat-6.2.5/tools/test_modules/
H A Dm11300.pm111 my $idx1 = index ($hash, "\$", 9);
113 return if ($idx1 < 1);
123 my $cry_master = substr ($hash, $idx1 + 1, $idx2 - $idx1 - 1);
129 $idx1 = index ($hash, "\$", $idx2 + 1);
131 return if ($idx1 < 1);
137 $idx2 = index ($hash, "\$", $idx1 + 1);
141 my $salt = substr ($hash, $idx1 + 1, $idx2 - $idx1 - 1);
149 return if ($idx1 < 1);
159 my $ckey_len = substr ($hash, $idx1 + 1, $idx2 - $idx1 - 1);
165 return if ($idx1 < 1);
[all …]
/dports/math/jtransforms/JTransforms/src/edu/emory/mathcs/jtransforms/fft/
H A DFloatFFT_2D.java1120 int idx1 = 2 * r; in mixedRadixRealForwardFull() local
1291 int idx1 = 2 * r; in mixedRadixRealForwardFull() local
1461 int idx1 = 2 * r; in mixedRadixRealInverseFull() local
1632 int idx1 = 2 * r; in mixedRadixRealInverseFull() local
1662 int idx1, idx2; in rdft2d_sub() local
2488 idx1 = r * columns; in fillSymmetric()
2489 idx2 = 2 * idx1; in fillSymmetric()
2492 a[idx1 + c] = 0; in fillSymmetric()
2584 idx1 = n1d2 * twon2; in fillSymmetric()
2585 a[idx1 + columns] = -a[idx1 + 1]; in fillSymmetric()
[all …]
H A DDoubleFFT_2D.java1120 int idx1 = 2 * r; in mixedRadixRealForwardFull() local
1291 int idx1 = 2 * r; in mixedRadixRealForwardFull() local
1461 int idx1 = 2 * r; in mixedRadixRealInverseFull() local
1632 int idx1 = 2 * r; in mixedRadixRealInverseFull() local
1662 int idx1, idx2; in rdft2d_sub() local
2488 idx1 = r * columns; in fillSymmetric()
2489 idx2 = 2 * idx1; in fillSymmetric()
2492 a[idx1 + c] = 0; in fillSymmetric()
2584 idx1 = n1d2 * twon2; in fillSymmetric()
2585 a[idx1 + columns] = -a[idx1 + 1]; in fillSymmetric()
[all …]
H A DDoubleFFT_1D.java636 a[idx1] = -a[idx1]; in realInverseFull()
1233 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_complex()
1241 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_complex()
1389 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_full()
1397 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_real_full()
1485 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_real_forward()
1498 a[offa + idx1] = bk1[idx1] * ak[idx1] + bk1[idx2] * ak[idx2]; in bluestein_real_forward()
1507 a[offa + idx1] = bk1[idx1] * ak[idx1] + bk1[idx2] * ak[idx2]; in bluestein_real_forward()
1622 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_inverse()
1699 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_inverse2()
[all …]
H A DFloatFFT_1D.java636 a[idx1] = -a[idx1]; in realInverseFull()
1233 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_complex()
1241 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_complex()
1389 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_full()
1397 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_real_full()
1485 ak[idx1] = ak[idx1] * bk2[idx1] - ak[idx2] * bk2[idx2]; in bluestein_real_forward()
1498 a[offa + idx1] = bk1[idx1] * ak[idx1] + bk1[idx2] * ak[idx2]; in bluestein_real_forward()
1507 a[offa + idx1] = bk1[idx1] * ak[idx1] + bk1[idx2] * ak[idx2]; in bluestein_real_forward()
1622 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_inverse()
1699 ak[idx1] = ak[idx1] * bk2[idx1] + ak[idx2] * bk2[idx2]; in bluestein_real_inverse2()
[all …]
H A DFloatFFT_3D.java4480 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4482 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4494 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4496 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4510 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4512 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4724 a[idx1][0][columns] = a[idx1][0][1]; in fillSymmetric()
4726 a[idx1][0][columns + 1] = a[idx1][0][0]; in fillSymmetric()
4728 a[idx1][n2d2][columns] = a[idx1][n2d2][1]; in fillSymmetric()
4730 a[idx1][n2d2][columns + 1] = a[idx1][n2d2][0]; in fillSymmetric()
[all …]
H A DDoubleFFT_3D.java4481 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4483 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4495 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4497 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4511 a[idx1] = 0.5f * (a[idx2] - a[idx1]); in rdft3d_sub()
4513 a[idx1 + 1] = 0.5f * (a[idx2 + 1] + a[idx1 + 1]); in rdft3d_sub()
4725 a[idx1][0][columns] = a[idx1][0][1]; in fillSymmetric()
4727 a[idx1][0][columns + 1] = a[idx1][0][0]; in fillSymmetric()
4729 a[idx1][n2d2][columns] = a[idx1][n2d2][1]; in fillSymmetric()
4731 a[idx1][n2d2][columns + 1] = a[idx1][n2d2][0]; in fillSymmetric()
[all …]
/dports/math/jtransforms/JTransforms/src/edu/emory/mathcs/jtransforms/dct/
H A DDoubleDCT_1D.java451 int idx1, idx2; in bitrv2() local
861 int idx1, idx2; in bitrv2conj() local
1070 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1132 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1248 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1262 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1458 idx1 = offa + j1; in cftf1st()
1601 idx1 = offa + j1; in cftf1st()
2852 int idx1, idx2; in rftfsub() local
2877 int idx1, idx2; in rftbsub() local
[all …]
H A DFloatDCT_1D.java451 int idx1, idx2; in bitrv2() local
861 int idx1, idx2; in bitrv2conj() local
1070 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1132 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1248 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1262 a[idx1 - 1] = -a[idx1 - 1]; in bitrv2conj()
1458 idx1 = offa + j1; in cftf1st()
1601 idx1 = offa + j1; in cftf1st()
2852 int idx1, idx2; in rftfsub() local
2877 int idx1, idx2; in rftbsub() local
[all …]
H A DFloatDCT_3D.java696 int idx0, idx1, idx2; in ddxt3da_sub() local
730 t[r] = a[idx1]; in ddxt3da_sub()
737 a[idx1] = t[r]; in ddxt3da_sub()
774 t[r] = a[idx1]; in ddxt3da_sub()
781 a[idx1] = t[r]; in ddxt3da_sub()
874 int idx0, idx1, idx2; in ddxt3db_sub() local
908 t[s] = a[idx1]; in ddxt3db_sub()
915 a[idx1] = t[s]; in ddxt3db_sub()
953 t[s] = a[idx1]; in ddxt3db_sub()
960 a[idx1] = t[s]; in ddxt3db_sub()
[all …]
H A DDoubleDCT_3D.java696 int idx0, idx1, idx2; in ddxt3da_sub() local
730 t[r] = a[idx1]; in ddxt3da_sub()
737 a[idx1] = t[r]; in ddxt3da_sub()
774 t[r] = a[idx1]; in ddxt3da_sub()
781 a[idx1] = t[r]; in ddxt3da_sub()
874 int idx0, idx1, idx2; in ddxt3db_sub() local
908 t[s] = a[idx1]; in ddxt3db_sub()
915 a[idx1] = t[s]; in ddxt3db_sub()
953 t[s] = a[idx1]; in ddxt3db_sub()
960 a[idx1] = t[s]; in ddxt3db_sub()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/slam/tests/
H A Dslam_map_BivariateMap.cpp106 for(auto idx1 = 0; idx1 < m.firstSetSize(); ++idx1) in constructAndTestCartesianMap() local
116 for(auto idx1 = 0; idx1 < m.firstSetSize(); ++idx1) in constructAndTestCartesianMap() local
126 for(auto idx1 = 0; idx1 < m.firstSetSize(); ++idx1) in constructAndTestCartesianMap() local
128 SubMapType sm = m(idx1); in constructAndTestCartesianMap()
221 for(auto idx1 = 0; idx1 < rel.fromSetSize(); idx1++) in constructAndTestRelationSetMap() local
237 for(auto idx1 = 0; idx1 < rel.fromSetSize(); idx1++) in constructAndTestRelationSetMap() local
262 for(auto idx1 = 0; idx1 < rel.fromSetSize(); idx1++) in constructAndTestRelationSetMap() local
329 for(auto idx1 = 0; idx1 < m.firstSetSize(); ++idx1) in constructAndTestBivariateMapIterator() local
339 for(auto idx1 = 0; idx1 < m.firstSetSize(); ++idx1) in constructAndTestBivariateMapIterator() local
343 for(auto iter = m.begin(idx1); iter != m.end(idx1); ++iter, ++idx2) in constructAndTestBivariateMapIterator()
[all …]
/dports/math/py-pandas/pandas-1.2.5/pandas/tests/util/
H A Dtest_assert_index_equal.py19 idx1 = Index([1, 2, 3])
47 idx1 = Index([1, 2, 3])
61 idx1 = Index([1, 2, 3])
69 idx1 = Index([1, 2, 3.0])
86 idx1 = Index([1, 2, 3.0])
104 idx1 = Index([1, 2, 3])
120 idx1 = Index([1, 2, 3])
161 idx1 = Index([1, 2, 3], name=name1)
165 tm.assert_index_equal(idx1, idx2)
176 tm.assert_index_equal(idx1, idx2)
[all …]
/dports/databases/namazu2/namazu-2.0.21/tests/
H A Dnamazu-57 docnum=`perl -lne 'print $1 if /^files (\d+)/' idx1/NMZ.status`
16 test `./namazu -c '"' ../tests/idx1` != '0' && exit 1
17 test `./namazu -c '/' ../tests/idx1` != '0' && exit 1
18 test `./namazu -c '{' ../tests/idx1` != '0' && exit 1
19 test `./namazu -c '}' ../tests/idx1` != '0' && exit 1
20 test `./namazu -c '""' ../tests/idx1` != '0' && exit 1
21 test `./namazu -c '{}' ../tests/idx1` != '0' && exit 1
22 test `./namazu -c '" "' ../tests/idx1` != '0' && exit 1
23 test `./namazu -c '{ }' ../tests/idx1` != '0' && exit 1
24 test `./namazu -c '" "' ../tests/idx1` != '0' && exit 1
[all …]
/dports/net/ss5/ss5-3.8.9/common/
H A DSS5OpenLdap.c34 register UINT idx1; in DirectoryCheck() local
64 for(idx1 = 0, idx2 = 0; user[idx1] && (idx1 < (sizeof(ntbuser) - 1)); idx1++ ) { in DirectoryCheck()
65 if( user[idx1] == '\\' || user[idx1] == '@' ) { in DirectoryCheck()
66 ntbdomain[idx1] = '\0'; in DirectoryCheck()
69 idx1++; in DirectoryCheck()
73 ntbdomain[idx1] = user[idx1]; in DirectoryCheck()
74 ntbuser[idx1] = user[idx1]; in DirectoryCheck()
118 register UINT idx1,idx2; in DirectoryQuery() local
168 …for(idx1 = 0; (baseDn[idx1] = S5Ldap[dirid].Base[idx1]) != '%' && idx1 < strlen(S5Ldap[dirid].Base… in DirectoryQuery()
169 baseDn[idx1] = '\0'; in DirectoryQuery()
[all …]
/dports/devel/raknet/raknet-3.9.2_10,1/DependentExtensions/SQLite3Plugin/
H A DSQLite3PluginCommon.cpp16 DataStructures::DefaultIndexType idx1, idx2; in Serialize() local
17 for (idx1=0; idx1 < columnNames.GetSize(); idx1++) in Serialize()
18 bitStream->Write(columnNames[idx1]); in Serialize()
20 for (idx1=0; idx1 < rows.GetSize(); idx1++) in Serialize()
22 for (idx2=0; idx2 < rows[idx1]->entries.GetSize(); idx2++) in Serialize()
24 bitStream->Write(rows[idx1]->entries[idx2]); in Serialize()
35 DataStructures::DefaultIndexType idx1,idx2; in Deserialize() local
37 for (idx1=0; idx1 < numColumns; idx1++) in Deserialize()
43 for (idx1=0; idx1 < numRows; idx1++) in Deserialize()
/dports/math/py-fastcluster/fastcluster-1.2.4/src/
H A Dfastcluster.cpp633 min = idx1<idx2 ? D_(idx1,idx2) : D_(idx2,idx1); in NN_chain_core()
642 idx1 = i; in NN_chain_core()
648 idx1 = i; in NN_chain_core()
652 idx2 = idx1; in NN_chain_core()
659 if (idx1>idx2) { in NN_chain_core()
661 idx1 = idx2; in NN_chain_core()
1039 while ( mindist[idx1] < D_(idx1, n_nghbr[idx1]) ) { in generic_linkage()
1220 f_ward(&D_(j, idx2), D_(j, idx1), mindist[idx1], in generic_linkage()
1237 f_ward(&D_(idx2, j), D_(idx1, j), mindist[idx1], in generic_linkage()
1241 f_ward(&D_(idx2, j), D_(idx1, j), mindist[idx1], in generic_linkage()
[all …]
/dports/science/mcstas-comps/mcstas-comps-2.5-src/contrib/
H A DSNS_source.comp100 //printf("idx1 %i xvec %g yvec %g\n",idx1,xvec[idx1],yvec[idx1]);
105 // printf("idx1 %i\n",idx1);
314 idx1=0;
329 Prob[idx1]=(Prob[idx1-1]+junk);
363 Prob[idx1]=(Prob[idx1-1]+junk);
424 for(idx1=0;idx1<200;idx1++){
428 for(idx1=0;idx1<200;idx1++){
447 for(idx1=0;idx1<nEvals;idx1++){
449 //printf("idx2 %d idx1 %d tyval: %g\n",idx2,idx1,Imat[idx2][idx1]);
464 for(idx1=0;idx1<200;idx1++){
[all …]
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/xfeatures2d/src/pct_signatures/
H A Ddistance.hpp75 const Mat& points1, int idx1, in distanceL0_25() argument
90 const Mat& points1, int idx1, in distanceL0_5() argument
104 const Mat& points1, int idx1, in distanceL1() argument
118 const Mat& points1, int idx1, in distanceL2() argument
132 const Mat& points1, int idx1, in distanceL2Squared() argument
146 const Mat& points1, int idx1, in distanceL5() argument
160 const Mat& points1, int idx1, in distanceLInfinity() argument
188 const Mat& points1, int idx1, in computeDistance() argument
198 return distanceL1(points1, idx1, points2, idx2); in computeDistance()
200 return distanceL2(points1, idx1, points2, idx2); in computeDistance()
[all …]
/dports/www/gitea/gitea-1.16.5/vendor/github.com/andybalholm/brotli/
H A Dcluster_command.go15 p.idx1 = p.idx2
18 if idx1 == idx2 {
22 if idx2 < idx1 {
24 idx2 = idx1
25 idx1 = t
28 p.idx1 = idx1
31 p.cost_diff -= out[idx1].bit_cost_
34 if out[idx1].total_count_ == 0 {
81 var idx1 uint
82 for idx1 = 0; idx1 < num_clusters; idx1++ {
[all …]
/dports/games/diaspora/Diaspora_R1_Linux/Diaspora/fs2_open/code/nebula/
H A Dneb.cpp766 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_copy()
773 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_copy()
780 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_copy()
812 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_gen_slice()
832 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_gen_slice()
852 for (idx1=0; idx1<Neb2_slices; idx1++) { in neb2_gen_slice()
952 for (idx1=Neb2_slices-1; idx1>0; idx1--) { in neb2_render_player()
960 for (idx1=0; idx1<Neb2_slices-1; idx1++) { in neb2_render_player()
968 for (idx1=Neb2_slices-1; idx1>0; idx1--) { in neb2_render_player()
976 for (idx1=0; idx1<Neb2_slices-1; idx1++) { in neb2_render_player()
[all …]
/dports/math/jtransforms/JTransforms/src/edu/emory/mathcs/jtransforms/dst/
H A DFloatDST_3D.java695 int idx0, idx1, idx2; in ddxt3da_sub() local
729 t[r] = a[idx1]; in ddxt3da_sub()
736 a[idx1] = t[r]; in ddxt3da_sub()
773 t[r] = a[idx1]; in ddxt3da_sub()
780 a[idx1] = t[r]; in ddxt3da_sub()
873 int idx0, idx1, idx2; in ddxt3db_sub() local
907 t[s] = a[idx1]; in ddxt3db_sub()
914 a[idx1] = t[s]; in ddxt3db_sub()
952 t[s] = a[idx1]; in ddxt3db_sub()
959 a[idx1] = t[s]; in ddxt3db_sub()
[all …]

12345678910>>...181