| /dports/math/fxt/fxt/demo/graph/ |
| H A D | graph-gray-demo.cc | 95 ulong sortq = 1; in main() local
96 NXARG(sortq, "whether to do edge-sorting 0:no, 1:lex 2:blue, >2:randomize"); in main()
104 if ( 1==sortq ) dg.sort_edges(cmp_lex); in main()
105 if ( 2==sortq ) dg.sort_edges(cmp_blue); in main()
106 srand( (uint)sortq ); in main()
107 if ( 3<=sortq ) dg.randomize_edge_order(); in main()
|
| H A D | graph-mtl-demo.cc | 114 ulong sortq = 1; in main() local
115 NXARG(sortq, "Whether to do edge-sorting 0:no, 1:yes >1:randomize"); in main()
127 if ( 1==sortq ) dg.sort_edges(cmp_mtl); in main()
128 if ( 1<sortq ) in main()
130 srand( (uint)sortq ); in main()
|
| H A D | graph-monotonicgray-demo.cc | 137 ulong sortq = 0; in main() local
138 NXARG(sortq, "whether to do edge-sorting"); in main()
143 if ( sortq ) dg.sort_edges(my_cmp); in main()
|
| /dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/web/feeds/recipes/ |
| H A D | model.py | 71 self.sortq = 0, ''
73 self.sortq = 1, ''
75 self.sortq = 2, self.cdata
88 return '::category::{}'.format(self.sortq[0])
98 return self.sortq < getattr(other, 'sortq', (3, ''))
110 self.sortq = primary_sort_key(self.title)
142 return self.sortq < other.sortq
|
| /dports/devel/ga/ga-5.8/tcgmsg/examples/ |
| H A D | diagon.f | 162 call sortq(q,ilifq,iipt,newbas,nrow)
181 subroutine sortq(q,ilifq,iipt,newbas,nrow) subroutine
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/tpl/ampl/ |
| H A D | nqpcheck.c | 518 sortq(og0, q) ograd *og0, **q; in sortq() function
520 sortq(ograd *og0, ograd **q)
590 Q->Lq = sortq(og, q);
591 Q->Rq = og == Q->Rq ? Q->Lq : sortq(Q->Rq, q);
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/ampl/ |
| H A D | nqpcheck.c | 518 sortq(og0, q) ograd *og0, **q; in sortq() function
520 sortq(ograd *og0, ograd **q)
590 Q->Lq = sortq(og, q);
591 Q->Rq = og == Q->Rq ? Q->Lq : sortq(Q->Rq, q);
|
| /dports/math/asl/solvers/ |
| H A D | mqpcheckv.c | 481 sortq(ograd *og0, ograd **q) in sortq() function
546 Q->Lq = sortq(og, q); in dsort()
547 Q->Rq = og == Q->Rq ? Q->Lq : sortq(Q->Rq, q); in dsort()
|
| H A D | nqpcheck.c | 464 sortq(ograd *og0, ograd **q) in sortq() function
529 Q->Lq = sortq(og, q); in dsort()
530 Q->Rq = og == Q->Rq ? Q->Lq : sortq(Q->Rq, q); in dsort()
|
| /dports/devel/guile-lib/guile-lib-0.2.6.1/unit-tests/ |
| H A D | guile-library.api | 48 (topological-sortq procedure (arity 1 0 #f))
|
| /dports/mail/libmilter/sendmail-8.16.1/sendmail/ |
| H A D | queue.c | 131 static int sortq __P((int));
2170 njobs = sortq(Queue[qgrp]->qg_maxlist);
2986 sortq(max) in sortq() function
4928 (void) sortq(Queue[qgrp]->qg_maxlist);
|
| /dports/devel/guile-lib/guile-lib-0.2.6.1/doc/ |
| H A D | guile-library.texi | 287 @anchor{graph topological-sort topological-sortq}@defun topological-sortq dag
|