anchor.diff:                    % need to hash here since we won't keep the bucket!
                     Hash = run_leaf_hf(lists:ukeysort(1, Bucket), Interval,
                                        Config#mt_config.leaf_hf),
  -                  {Hash, Count, 0, [], Interval, []}
  +                  {Hash, Count, 1, [], Interval, []}
              end,
       build_childs(T, Config, [Node | Acc]);
   build_childs([], _, Acc) ->
  
positive.code:                             end, 0, ChildList),
      Hash = run_inner_hf(NewChilds, InnerHf),
      {Hash, Count, LeafCount, [], Interval, NewChilds};
  gen_hash_node({Hash, _Cnt, _LCnt = 0, _Bkt, _I, []} = N, _InnerHf,
                _LeafHf, false, _CleanBuckets) when Hash =/= nil ->
      % leaf node, no bucket contents, keep_bucket false
      % -> we already hashed the value in bulk_build and cannot insert any more
  
negative.code:     % leaf node, no bucket contents, keep_bucket true
      Bucket1 = lists:ukeysort(1, Bucket),
      Hash = run_leaf_hf(Bucket1, Interval, LeafHf),
      {Hash, Count, 1, ?IIF(CleanBuckets, [], Bucket1), Interval, Childs}.
  
  %% @doc Hashes an inner node based on its childrens' hashes.
  -spec run_inner_hf([mt_node(),...], InnerHf::inner_hash_fun()) -> mt_node_key().
  