anchor.diff:  %% key/hash pair will be ignored.
   %% If `HasIndexTree` is true, also update the index spec tree.
   -spec fold_keys(atom(), index(), pid(), boolean()) -> ok.
  -fold_keys(Master, Partition, Tree, HasIndexTree) ->
  -    FoldFun = fold_fun(Tree, HasIndexTree),
  +fold_keys(VNode, Partition, Tree, HasIndexTree) ->
  +    Master = Master:master(),
  +    FoldFun = fold_fun(VNode, Tree, HasIndexTree),
       Req = riak_core_util:make_fold_req(FoldFun,
                                          0, false, 
                                          [aae_reconstruction,
  
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:     end.
  
  -spec object_fold_fun(pid()) -> fun().
  object_fold_fun(VNode, Tree) ->
      fun(BKey={Bucket,Key}, RObj, BinBKey) ->
              IndexN = riak_core_util:get_index_n({Bucket, Key}),
              insert([{IndexN, BinBKey, VNode:hash_object(BKey, RObj)}],
                     [if_missing],
                     Tree)
      end.
  