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 › mergeInto Private Function mergeInto Doc Source Private Function std.sort.block.mergeInto
fn mergeInto (
comptime T : type ,
from : []T ,
A : Range ,
B : Range ,
into : []T ,
context : anytype ,
comptime lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool ,
) void Params T : type from : []T A : Range B : Range into : []T context lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool File sort/block.zig: 985
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023 fn mergeInto (
comptime T : type ,
from : []T ,
A : Range ,
B : Range ,
into : []T ,
context : anytype ,
comptime lessThan : fn (@TypeOf (context ), lhs : T , rhs : T ) bool ,
) void {
var A_index : usize = A .start ;
var B_index : usize = B .start ;
const A_last = A .end ;
const B_last = B .end ;
var insert_index : usize = 0 ;
while (true ) {
if (!lessThan (context , from [B_index ], from [A_index ])) {
into [insert_index ] = from [A_index ];
A_index += 1 ;
insert_index += 1 ;
if (A_index == A_last ) {
// copy the remainder of B into the final array
const from_b = from [B_index ..B_last ];
@memcpy (into [insert_index ..][0 ..from_b .len ], from_b );
break ;
}
} else {
into [insert_index ] = from [B_index ];
B_index += 1 ;
insert_index += 1 ;
if (B_index == B_last ) {
// copy the remainder of A into the final array
const from_a = from [A_index ..A_last ];
@memcpy (into [insert_index ..][0 ..from_a .len ], from_a );
break ;
}
}
}
}