anchor.diff:      end.
   
   -spec object_fold_fun(pid()) -> fun().
  -object_fold_fun(Tree) ->
  +object_fold_fun(VNode, Tree) ->
       fun(BKey={Bucket,Key}, RObj, BinBKey) ->
               IndexN = riak_core_util:get_index_n({Bucket, Key}),
  -            insert([{IndexN, BinBKey, hash_object(BKey, RObj)}],
  +            insert([{IndexN, BinBKey, VNode:hash_object(BKey, RObj)}],
                      [if_missing],
                      Tree)
       end.
  
positive.code: %% @doc Generate the folding function
  %% for a riak fold_req
  -spec fold_fun(pid(), boolean()) -> fun().
  fold_fun(Tree, _HasIndexTree = false) ->
      ObjectFoldFun = object_fold_fun(Tree),
      {Limit, Wait} = get_build_throttle(),
      fun(BKey, RObj, Acc) ->
              BinBKey = term_to_binary(BKey),
  
negative.code:             Acc2 = maybe_throttle_build(RObj, Limit, Wait, Acc),
              Acc2
      end;
  fold_fun(VNode,Tree, _HasIndexTree = true) ->
      %% Index AAE backend, so hash the indexes
      ObjectFoldFun = object_fold_fun(VNode,Tree),
      IndexFoldFun = index_fold_fun(Tree),
      {Limit, Wait} = get_build_throttle(),
      fun(BKey = {Bucket, Key}, BinObj, Acc) ->
  