Searched refs:quicksort (Results 1 - 7 of 7) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A Dquicksort.h39 void quicksort(void *v[], int left, int right,
H A Dquicksort.cc60 * quicksort( (void**)v, left, right, (int (*)(void *, void *))comp)
62 void quicksort(void *v[], int left, int right, function in typeref:typename:void
75 quicksort(v, left, last-1, comp);
76 quicksort(v, last+1, right, comp);
H A DpartitionY.cc45 #include "quicksort.h"
430 quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void*, void*)) compInY);
452 quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void*, void*)) compInY);
H A DdirectedLine.cc44 #include "quicksort.h"
465 quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void *, void *)) compInY2);
H A DmonoChain.cc47 #include "quicksort.h"
664 quicksort( (void**)array, 0, total_num_chains-1, (Int (*)(void*, void*))compChainHeadInY);
665 //printf("after quicksort\n");
/xsrc/external/mit/glu/dist/
H A DMakefile.am123 src/libnurbs/nurbtess/quicksort.cc \
224 src/libnurbs/nurbtess/quicksort.h \
H A DMakefile.in231 src/libnurbs/nurbtess/quicksort.lo \
327 src/libnurbs/nurbtess/$(DEPDIR)/quicksort.Plo \
671 src/libnurbs/nurbtess/quicksort.cc \
772 src/libnurbs/nurbtess/quicksort.h \
1115 src/libnurbs/nurbtess/quicksort.lo: \
1226 @AMDEP_TRUE@@am__include@ @am__quote@src/libnurbs/nurbtess/$(DEPDIR)/quicksort.Plo@am__quote@ # am--include-marker
1710 -rm -f src/libnurbs/nurbtess/$(DEPDIR)/quicksort.Plo
1846 -rm -f src/libnurbs/nurbtess/$(DEPDIR)/quicksort.Plo

Completed in 16 milliseconds