@@ -201,6 +201,7 @@ hash_float_value!((half::f16, u16), (f32, u32), (f64, u64));
201201/// Create a `SeedableRandomState` whose per-hasher seed incorporates `seed`.
202202/// This folds the previous hash into the hasher's initial state so only the
203203/// new value needs to pass through the hash function — same cost as `hash_one`.
204+ #[ cfg( not( feature = "force_hash_collisions" ) ) ]
204205#[ inline]
205206#[ cfg( not( feature = "force_hash_collisions" ) ) ]
206207fn seeded_state ( seed : u64 ) -> foldhash:: fast:: SeedableRandomState {
@@ -307,6 +308,7 @@ fn hash_array<T>(
307308/// HAS_NULLS: do we have to check null in the inner loop
308309/// HAS_BUFFERS: if true, array has external buffers; if false, all strings are inlined/ less then 12 bytes
309310/// REHASH: if true, combining with existing hash, otherwise initializing
311+ #[ cfg( not( feature = "force_hash_collisions" ) ) ]
310312#[ inline( never) ]
311313#[ cfg( not( feature = "force_hash_collisions" ) ) ]
312314fn hash_string_view_array_inner <
@@ -434,6 +436,7 @@ fn hash_generic_byte_view_array<T: ByteViewType>(
434436/// - `HAS_NULL_KEYS`: Whether to check for null dictionary keys
435437/// - `HAS_NULL_VALUES`: Whether to check for null dictionary values
436438/// - `MULTI_COL`: Whether to combine with existing hash (true) or initialize (false)
439+ #[ cfg( not( feature = "force_hash_collisions" ) ) ]
437440#[ inline( never) ]
438441#[ cfg( not( feature = "force_hash_collisions" ) ) ]
439442fn hash_dictionary_inner <
0 commit comments