Home
last modified time | relevance | path

Searched refs:mergesort (Results 1 – 13 of 13) sorted by relevance

/external/apache-xml/src/main/java/org/apache/xalan/transformer/
DNodeSorter.java99 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/llvm/test/CodeGen/Mips/
D2011-05-26-BranchKillsVreg.ll12 define i32 @mergesort(i8* %base, i32 %nmemb, i32 %size, i32 (i8*, i8*)* nocapture %cmp) nounwind {
/external/llvm-project/llvm/test/CodeGen/Mips/
D2011-05-26-BranchKillsVreg.ll12 define i32 @mergesort(i8* %base, i32 %nmemb, i32 %size, i32 (i8*, i8*)* nocapture %cmp) nounwind {
/external/rust/crates/rayon/src/slice/
Dmergesort.rs302 unsafe fn mergesort<T, F>(v: &mut [T], buf: *mut T, is_less: &F) -> MergesortResult in mergesort() function
660 let res = unsafe { mergesort(v, buf, &is_less) }; in par_mergesort()
681 (l, r, mergesort(chunk, buf, &is_less)) in par_mergesort()
Dmod.rs8 mod mergesort; module
13 use self::mergesort::par_mergesort;
/external/tremolo/Tremolo/
Dfloor1.c76 static void mergesort(ogg_uint8_t *index,ogg_uint16_t *vals,ogg_uint16_t n){ in mergesort() function
171 mergesort(info->forward_index,info->postlist,info->posts); in floor1_info_unpack()
/external/rust/crates/grpcio-sys/grpc/third_party/upb/bazel/
Dragel.BUILD138 "aapl/mergesort.h",
/external/deqp/external/vulkancts/data/vulkan/amber/graphicsfuzz/
Dindex.txt311 { "spv-stable-mergesort-O-prop-up-mutate-var.amber", "spv-stable-mergesort-O-prop-up-muta…
312 { "spv-stable-mergesort-flatten-selection-dead-continues.amber", "spv-stable-mergesort-flatt…
313 { "spv-stable-mergesort-func-inline-mutate-var.amber", "spv-stable-mergesort-func-inline-m…
328 { "stable-mergesort-for-always-false-if-discard.amber", "stable-mergesort-for-always-false…
329 { "stable-mergesort-reversed-for-loop.amber", "stable-mergesort-reversed-for-loop", …
/external/python/cpython3/Objects/
Dlistsort.txt3 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
/external/python/cpython2/Objects/
Dlistsort.txt3 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
/external/zstd/lib/dictBuilder/
Dcover.c617 mergesort(ctx->suffix, ctx->suffixSize, sizeof(U32), in COVER_ctx_init()
/external/pdfium/third_party/yasm/
DBUILD.gn263 "source/patched-yasm/libyasm/mergesort.c",
/external/rust/crates/rayon/
DRELEASES.md698 - New mergesort demo.