Zig 0.17.0-dev (Split by item) This is an example of documentation generated by
ZigDoc , an alternative to Zig's built-in
Auto Doc feature. See also
examples in other modes/formats . The project being documented here (as the example) is the Zig standard library.
std › sort › block › mergeExternal Private Function mergeExternal Doc Source Private Function std.sort.block.mergeExternal
fn mergeExternal (
comptime T : type ,
items : []T ,
A : Range ,
B : Range ,
cache : []T ,
context : anytype ,
comptime lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool ,
) void Params T : type items : []T A : Range B : Range cache : []T context lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool File sort/block.zig: 1025
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060 fn mergeExternal (
comptime T : type ,
items : []T ,
A : Range ,
B : Range ,
cache : []T ,
context : anytype ,
comptime lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool ,
) void {
// A fits into the cache, so use that instead of the internal buffer
var A_index : usize = 0 ;
var B_index : usize = B .start ;
var insert_index : usize = A .start ;
const A_last = A .length ();
const B_last = B .end ;
if (B .length () > 0 and A .length () > 0 ) {
while (true ) {
if (!lessThan (context , items [B_index ], cache [A_index ])) {
items [insert_index ] = cache [A_index ];
A_index += 1 ;
insert_index += 1 ;
if (A_index == A_last ) break ;
} else {
items [insert_index ] = items [B_index ];
B_index += 1 ;
insert_index += 1 ;
if (B_index == B_last ) break ;
}
}
}
// copy the remainder of A into the final array
const cache_a = cache [A_index ..A_last ];
@memcpy (items [insert_index ..][0 ..cache_a .len ], cache_a );
}