Searched refs:mergesort (Results 1 – 5 of 5) sorted by relevance
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | NodeSorter.java | 99 mergesort(nodes, scratchVector, 0, n - 1, support); in sort()
295 void mergesort(Vector a, Vector b, int l, int r, XPathContext support) in mergesort() method in NodeSorter
303 mergesort(a, b, l, m, support); in mergesort()
304 mergesort(a, b, m + 1, r, support); in mergesort()
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/Mips/ |
| D | 2011-05-26-BranchKillsVreg.ll | 12 define i32 @mergesort(i8* %base, i32 %nmemb, i32 %size, i32 (i8*, i8*)* nocapture %cmp) nounwind {
|
| /external/llvm/test/CodeGen/Mips/ |
| D | 2011-05-26-BranchKillsVreg.ll | 12 define i32 @mergesort(i8* %base, i32 %nmemb, i32 %size, i32 (i8*, i8*)* nocapture %cmp) nounwind {
|
| /external/tremolo/Tremolo/ |
| D | floor1.c | 76 static void mergesort(ogg_uint8_t *index,ogg_uint16_t *vals,ogg_uint16_t n){ in mergesort() function
170 mergesort(info->forward_index,info->postlist,info->posts); in floor1_info_unpack()
|
| /external/python/cpython2/Objects/ |
| D | listsort.txt | 3 This describes an adaptive, stable, natural mergesort, modestly called
25 It turns out that Perl is moving to a stable mergesort, and the code for
278 compares, but it's still more compares than necessary, and-- mergesort's
500 McIlroy paper in particular has good analysis of a mergesort that's
|