Home
last modified time | relevance | path

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

12

/dports/cad/scotch/scotch-6.0.4/src/esmumps/
H A Dsymbol_fax.c299 INT sortnum; in symbolFax() local
307 for (sortnum = 0; sortnum < sortnbr; ) { /* For all entries in sorted array */ in symbolFax()
310 colend = sorttab[sortnum]; in symbolFax()
328 (sorttab[sortnum] - 1 == sorttab[sortnum - 1]) && in symbolFax()
329 (sorttab[sortnum] < rangtax[cblkctr + 1])) ; in symbolFax()
330 bloktax[bloknum].lrownum = sorttab[sortnum - 1]; /* Set end of block */ in symbolFax()
347 for (sortnum = 0; sortnum < sortnbr; ) { /* For all entries in sorted array */ in symbolFax()
350 colend = sorttab[sortnum]; in symbolFax()
367 (sorttab[sortnum] - 1 == sorttab[sortnum - 1]) && in symbolFax()
368 (sorttab[sortnum] < rangtax[cblkctr + 1])) ; in symbolFax()
[all …]
/dports/net-mgmt/p5-NetAddr-IP/NetAddr-IP-4.079/t/
H A Dimhoff.t16 my @sortnum = sort { $a cmp $b} @temp;
18 my $sortnum = Compact(map { NetAddr::IP->new($_) } @sortnum);
22 is($sortnum, $sorttag);
23 is($sortnum, $sortdec);
/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Dbdgraph_bipart_ex.c275 int sortnum; in bdgraphBipartEx() local
297 … for (sortnum = 0; sortnum < sortnbr; sortnum ++) /* Increase priority value from found maximum */ in bdgraphBipartEx()
298 sorttab[sortnum].prioval = (sorttab[sortnum].procnum + procglbnbr - procmax) % procglbnbr; in bdgraphBipartEx()
303 …for (sortnum = sortnbr - 1; sortnum >= 0; sortnum --) { /* Process contributions by descending loa… in bdgraphBipartEx()
306 compglbloadtmp = compglbloaddlt - sorttab[sortnum].veloval; in bdgraphBipartEx()
313 if (sorttab[sortnum].procnum != proclocnum) /* If this is not our job to handle it */ in bdgraphBipartEx()
347 if (sorttab[sortnum].procnum == proclocnum) { /* If we are the process to do it */ in bdgraphBipartEx()
350 … complocloaddlt += sorttab[sortnum].veloval; /* We moved all of our local load for this gain */ in bdgraphBipartEx()
H A Dgraph_io_mmkt.c92 Gnum sortnum; in graphGeomLoadMmkt() local
196 for (sortnum = degrmax = 0, vertnum = baseval - 1, edgetmp = edgenum = baseval; in graphGeomLoadMmkt()
197 sortnum < sortnbr; sortnum ++) { in graphGeomLoadMmkt()
200 …if (vertnum < sorttab[sortnum].vertnum[0]) { /* If change of vertex index, that is, first edge en… in graphGeomLoadMmkt()
208 while (vertnum < sorttab[sortnum].vertnum[0]) /* Fill gaps with isolated vertices */ in graphGeomLoadMmkt()
214 vertend = sorttab[sortnum].vertnum[1]; /* Get end of current edge */ in graphGeomLoadMmkt()
H A Dkgraph_map_ex.c90 Gnum sortnum; in kgraphMapEx() local
189 …for (sortnum = sortnbr - 1; sortnum >= 0; sortnum --) { /* For all sorted vertex indices, by desce… in kgraphMapEx()
194 vertnum = sorttab[sortnum].vertnum; in kgraphMapEx()
195 veloval = sorttab[sortnum].veloval; in kgraphMapEx()
/dports/databases/py-gdbm/Python-3.8.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python37/Python-3.7.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python-tools/Python-3.8.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python39/Python-3.9.9/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python38/Python-3.8.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/databases/py-sqlite3/Python-3.8.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python310/Python-3.10.1/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
121 self.assertEqual([1,2,3], sortnum(3,2,1))
122 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/lang/python311/Python-3.11.0a3/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
121 self.assertEqual([1,2,3], sortnum(3,2,1))
122 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Lib/test/
H A Dtest_keywordonlyarg.py21 def sortnum(*nums, reverse=False): function
120 self.assertEqual([1,2,3], sortnum(3,2,1))
121 self.assertEqual([3,2,1], sortnum(1,2,3, reverse=True))
/dports/science/openmx/openmx3.8/source/
H A Dzero_cfrac.c306 static double *sortnum; in Eigen_DGGEVX() local
337 sortnum = (double*)malloc(sizeof(double)*(n+2)); in Eigen_DGGEVX()
451 free(sortnum); in Eigen_DGGEVX()
/dports/www/sarg/sarg-2.4.0/
H A Dindex.c667 int year, month, day, sortnum; in make_file_index() member
709 item->sortnum=(item->year*16+item->month)*32+item->day; in make_file_index()
763 if (item->sortnum>sortlist[i-1]->sortnum) break; in make_file_index()
764 if (item->sortnum==sortlist[i-1]->sortnum) { in make_file_index()
794 if (SortTableJs[0]) fprintf(fp_ou," sorttable_customkey=\"%d\"",item->sortnum); in make_file_index()
/dports/sysutils/eclat/eclat-2.0/tests/
H A Dsortnum.at18 AT_KEYWORDS([sort sortnum])
H A DMakefile.am81 sortnum.at\
H A Dtestsuite.at84 m4_include([sortnum.at])
H A DMakefile.in349 sortnum.at\
H A Dtestsuite636 44;sortnum.at:17;Numeric sort;sort sortnum;
/dports/games/NBlood/NBlood-a1689a4/extras/rrsrc/enginerr/
H A DENGINE.C7129 long bakgxvect, bakgyvect, sortnum, gap, npoints; in drawmapview() local
7147 sortnum = 0; in drawmapview()
7177 tsprite[sortnum++].owner = i; in drawmapview()
7251 gap = 1; while (gap < sortnum) gap = (gap<<1)+1; in drawmapview()
7253 for(i=0;i<sortnum-gap;i++) in drawmapview()
7260 for(s=sortnum-1;s>=0;s--) in drawmapview()
/dports/games/NBlood/NBlood-a1689a4/extras/rrsrc/enginera/
H A DENGINE.C7169 long bakgxvect, bakgyvect, sortnum, gap, npoints; in drawmapview() local
7187 sortnum = 0; in drawmapview()
7217 tsprite[sortnum++].owner = i; in drawmapview()
7291 gap = 1; while (gap < sortnum) gap = (gap<<1)+1; in drawmapview()
7293 for(i=0;i<sortnum-gap;i++) in drawmapview()
7300 for(s=sortnum-1;s>=0;s--) in drawmapview()
/dports/games/jfsw/jfsw-c434002/jfbuild/src/
H A Dengine.c5889 int bakgxvect, bakgyvect, sortnum, gap, npoints; in drawmapview() local
5906 sortnum = 0; in drawmapview()
5960 tsprite[sortnum++].owner = i; in drawmapview()
6036 gap = 1; while (gap < sortnum) gap = (gap<<1)+1; in drawmapview()
6038 for(i=0;i<sortnum-gap;i++) in drawmapview()
6045 for(s=sortnum-1;s>=0;s--) in drawmapview()
/dports/games/NBlood/NBlood-a1689a4/source/build/src/
H A Dengine.cpp9810 int32_t sortnum = 0; in renderDrawMapView() local
9879 tsprite[sortnum++].owner = i; in renderDrawMapView()
9958 while (gap < sortnum) gap = (gap << 1) + 1; in renderDrawMapView()
9961 for (i=0; i<sortnum-gap; i++) in renderDrawMapView()
9968 for (s=sortnum-1; s>=0; s--) in renderDrawMapView()

12