/dports/editors/yudit/yudit-3.0.7/stoolkit/ |
H A D | SStringVector.cpp | 257 CHECK_NEW(indeces); in sort() 261 indeces[i] = i; in sort() 263 sort (indeces, ascending, 0, size()-1); in sort() 270 append (nv[indeces[i]]); in sort() 272 delete[] indeces; in sort() 306 indeces[(unsigned int)i] = indeces[(unsigned int)j]; in sort() 307 indeces[(unsigned int)j] = o; in sort() 314 indeces[(unsigned int)mid] = indeces[(unsigned int)j]; in sort() 315 indeces[(unsigned int)j] = o; in sort() 317 sort (indeces, ascending, left, j-1); in sort() [all …]
|
H A D | SStringVector.h | 53 void sort(unsigned int* indeces, bool ascending, int left, int right); 54 int compare (unsigned int* indeces, int i1, int i2);
|
/dports/math/gap/gap-4.11.0/pkg/guarana-0.96.2/exams/ |
H A D | polycy.gi | 26 # get indeces of elms of finite order 48 N := Subgroup( G, Pcp(G){indeces[3]} ); 50 C := Subgroup( G, Pcp(G){indeces[2]} ); 52 return [G,indeces,N,NN,C,CC]; 99 indeces := [ [], [1], [2..hl+1] ]; 104 return [G,indeces,N,NN,C,CC]; 126 indeces := [ [], [1], [2..hl+1] ]; 131 return [G,indeces,N,NN,C,CC]; 187 indeces := [[1..3],[4,5],[6..17]]; 188 N := Subgroup( G, Pcp(G){indeces[3]} ); [all …]
|
/dports/math/gap/gap-4.11.0/pkg/guarana-0.96.2/gap/collec/ |
H A D | test.gi | 26 indeces := Concatenation( malCol!.indeces[2], malCol!.indeces[3] ); 27 pcpCN := Pcp( malCol!.G ){indeces}; 30 exp_gh2 := Exponents( g2*h2 ){indeces}; 55 ind_f := malCol!.indeces[1]; 56 ind_c := malCol!.indeces[2]; 67 indeces := Concatenation( malCol!.indeces[2], malCol!.indeces[3] ); 68 pcpCN := pcpG{indeces}; 98 indeces := Concatenation( malCol!.indeces[2], malCol!.indeces[3] ); 99 pcpCN := Pcp( malCol!.G ){indeces}; 180 # get indeces malcev records [all …]
|
H A D | elms.gi | 51 hlCN_N := Length( malCol!.indeces[2] ); 82 hlCN_N := Length( malCol!.indeces[2] ); 166 indeces := malCol!.indeces; 169 for i in indeces[1] do 177 exps_cn := exps{ Concatenation(indeces[2],indeces[3]) }; 191 indeces := malCol!.indeces; 192 exps_f := exps{indeces[1]}; 193 exps_cn := exps{ Concatenation(indeces[2],indeces[3]) }; 255 indeces := malCol!.indeces; 257 for i in indeces[1] do [all …]
|
H A D | setup.gi | 84 indeces := args[2]; 89 lengths := [ Length(indeces[1]), Length( indeces[2] ), 90 Length( indeces[3] ) ]; 103 obj := rec( G := G, indeces := indeces, lengths := lengths, 442 rels := rels_G{ malCol!.indeces[1] }; 522 local indeces, exps_cn, cn_elm; 523 indeces := malCol!.indeces; 524 if exps{indeces[1]} <> 0*exps{indeces[1]} then 527 exps_cn := exps{ Concatenation(indeces[2],indeces[3]) }; 549 indeces := malCol!.indeces; [all …]
|
/dports/biology/bamutil/bamUtil-1.0.15/libStatGen/general/ |
H A D | InplaceMerge.h | 42 std::vector<int> &indeces, in inplace_merge() argument 57 inplace_merge(indeces, counts, middle, last, values); in inplace_merge() 61 inplace_merge(indeces, counts, first, middle, values); in inplace_merge() 72 typename std::vector<T>::iterator startIterator = values.begin()+indeces[first]; in inplace_merge() 73 typename std::vector<T>::iterator middleIterator = values.begin() + indeces[last-1]; in inplace_merge() 74 …typename std::vector<T>::iterator endIterator = values.begin() + indeces[last-1] + counts[last - 1… in inplace_merge()
|
H A D | InplaceMerge.cpp | 36 std::vector<int> indeces, counts; in main() local 38 indeces.push_back(0); in main() 39 indeces.push_back(5); in main() 40 indeces.push_back(10); in main() 46 inplace_merge(indeces, counts, 0, 3, z); in main()
|
/dports/math/octave-forge-strings/strings-1.2.0/src/ |
H A D | pcregexp.cc | 95 Matrix indeces = Matrix(matches, 2); variable 97 indeces(i, 0) = ovector[2*i]+1; 98 indeces(i, 1) = ovector[2*i+1]; 99 if (indeces(i, 0) == 0) indeces(i, 1) = 0; 101 retval(0) = indeces;
|
/dports/www/emacs-w3m/emacs-w3m-3925d1c/shimbun/ |
H A D | sb-javaconf.el | 56 (indeces) 59 (push (shimbun-expand-url (match-string 1) shimbun-javaconf-url) indeces)) 61 (dolist (elem indeces)
|
/dports/math/R-cran-gss/gss/src/ |
H A D | smolyak.c | 155 indeces[k] = sw[i]; in formula() 171 indeces[k] = sw[i]; in formula1() 197 for (i=0; i<=n[indeces[k]]; i++) in eval() 215 for (i=0; i<=n[indeces[k]]; i++) in eval1() 302 indsum[r][s] = ninv[indeces[r]]; in sumind() 326 p=lookind[indeces[r]][argind[r]]; in wl() 331 if (indeces[r]==0) sum+=dnu[sw[i]][0]; in wl() 358 if (indeces[r]==0) return dnu[sw[l]][0]; in we() 437 x[k-1]= xnu[indeces[k]][2*argind[k]+1]; in fsum() 457 if (indeces[k]==0) in fsum1() [all …]
|
/dports/databases/mariadb104-server/mariadb-10.4.24/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; in main() local 445 bzero(indeces, sizeof(uint) * WRITERS); in main() 447 bzero(indeces, sizeof(indeces)); in main() 476 index= indeces[rec.short_trid] / 2; in main() 477 stage= indeces[rec.short_trid] % 2; in main() 537 indeces[rec.short_trid]++; in main()
|
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; in main() local 445 bzero(indeces, sizeof(uint) * WRITERS); in main() 447 bzero(indeces, sizeof(indeces)); in main() 476 index= indeces[rec.short_trid] / 2; in main() 477 stage= indeces[rec.short_trid] % 2; in main() 537 indeces[rec.short_trid]++; in main()
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; in main() local 445 bzero(indeces, sizeof(uint) * WRITERS); in main() 447 bzero(indeces, sizeof(indeces)); in main() 476 index= indeces[rec.short_trid] / 2; in main() 477 stage= indeces[rec.short_trid] % 2; in main() 537 indeces[rec.short_trid]++; in main()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; 445 bzero(indeces, sizeof(uint) * WRITERS); 447 bzero(indeces, sizeof(indeces)); 476 index= indeces[rec.short_trid] / 2; 477 stage= indeces[rec.short_trid] % 2; 537 indeces[rec.short_trid]++;
|
/dports/databases/mariadb103-server/mariadb-10.3.34/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; 445 bzero(indeces, sizeof(uint) * WRITERS); 447 bzero(indeces, sizeof(indeces)); 476 index= indeces[rec.short_trid] / 2; 477 stage= indeces[rec.short_trid] % 2; 537 indeces[rec.short_trid]++;
|
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/maria/unittest/ |
H A D | ma_test_loghandler_multithread-t.c | 442 uint indeces[WRITERS]; in main() local 445 bzero(indeces, sizeof(uint) * WRITERS); in main() 447 bzero(indeces, sizeof(indeces)); in main() 476 index= indeces[rec.short_trid] / 2; in main() 477 stage= indeces[rec.short_trid] % 2; in main() 537 indeces[rec.short_trid]++; in main()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/xtp/xtp-2a31d70/src/libxtp/ |
H A D | IndexParser.cc | 72 const std::vector<Index>& indeces) const { 73 std::set<Index> s(indeces.begin(), indeces.end());
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/xtp/src/libxtp/ |
H A D | IndexParser.cc | 72 const std::vector<Index>& indeces) const { in CreateIndexString() 73 std::set<Index> s(indeces.begin(), indeces.end()); in CreateIndexString()
|
/dports/math/R-cran-lava/lava/man/ |
H A D | parpos.Rd | 5 \title{Generic method for finding indeces of model parameters} 15 Generic method for finding indeces of model parameters
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/gpu/surface/src/cuda/ |
H A D | convex_hull.cu | 652 int indeces[] = { facet, facet + facet_count, facet + facet_count * 2 }; in operator ()() local 683 new_idx = indeces[new_idx]; in operator ()() 799 size_t pcl::device::remove_duplicates(DeviceArray<int>& indeces) in remove_duplicates() argument 801 thrust::device_ptr<int> beg(indeces.ptr()); in remove_duplicates() 802 thrust::device_ptr<int> end = beg + indeces.size(); in remove_duplicates() 813 __global__ void gatherKernel(const PtrSz<int> indeces, const PointType* src, PointType* dst) in gatherKernel() argument 817 if (idx < indeces.size) in gatherKernel() 818 dst[idx] = src[indeces.data[idx]]; in gatherKernel() 824 void pcl::device::pack_hull(const DeviceArray<PointType>& points, const DeviceArray<int>& indeces, … in pack_hull() argument 826 output.create(indeces.size()); in pack_hull() [all …]
|
/dports/math/pspp/pspp-1.4.1/src/ui/gui/ |
H A D | dict-display.c | 179 gint *indeces; 192 indeces = gtk_tree_path_get_indices (path); 194 dict_index = indeces [0];
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/gpu/surface/src/ |
H A D | internal.h | 118 std::size_t remove_duplicates(DeviceArray<int>& indeces); 119 …void pack_hull(const DeviceArray<PointType>& points, const DeviceArray<int>& indeces, DeviceArray<…
|
/dports/graphics/lightzone/LightZone-4.1.8-3-g36e87773/lightcrafts/jnisrc/EDISON/segm/ |
H A D | rlist.cpp | 147 void RegionList::AddRegion(int label, int pointCount, int *indeces) in AddRegion() argument 173 indexTable[freeBlockLoc+i] = indeces[i]; in AddRegion()
|
/dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/csg-da5c1dc/src/libcsg/ |
H A D | imcio.cc | 155 std::vector<std::pair<std::string, tools::RangeParser> > indeces; in imcio_read_index() local 173 indeces.push_back(std::pair<std::string, tools::RangeParser>(name, rp)); in imcio_read_index() 176 return indeces; in imcio_read_index()
|