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 › array_hash_map › ArrayHashMap › getSlotByKey Private Function getSlotByKey Doc Source Private Function std.array_hash_map.ArrayHashMap.getSlotByKey
fn getSlotByKey (self : Self , key : anytype , ctx : anytype , header : *IndexHeader , comptime I : type , indexes : []Index (I )) ?usize Params File array_hash_map.zig: 1392
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418 fn getSlotByKey (self : Self , key : anytype , ctx : anytype , header : *IndexHeader , comptime I : type , indexes : []Index (I )) ?usize {
const slice = self .entries .slice ();
const hashes_array = if (store_hash ) slice .items (.hash ) else {};
const keys_array = slice .items (.key );
const h = checkedHash (ctx , key );
const start_index = safeTruncate (usize , h );
const end_index = start_index +% indexes .len ;
var index = start_index ;
var distance_from_start_index : I = 0 ;
while (index != end_index ) : ({
index +%= 1 ;
distance_from_start_index += 1 ;
}) {
const slot = header .constrainIndex (index );
const slot_data = indexes [slot ];
if (slot_data .isEmpty () or slot_data .distance_from_start_index < distance_from_start_index )
return null ;
const i = slot_data .entry_index ;
const hash_match = if (store_hash ) h == hashes_array [i ] else true ;
if (hash_match and checkedEql (ctx , key , keys_array [i ], i ))
return slot ;
}
unreachable ;
}