anchor.diff:  close_trees(State=#state{trees=Trees}) ->
       Trees2 = [{IdxN, hashtree:close(Tree)} || {IdxN, Tree} <- Trees],
       State#state{trees=Trees2}.
  +
  +get_index_n(VNode, BKey) ->
  +    case erlang:function_exported(VNode, get_index_n, 1) of
  +        true ->
  +            VNode:get_index_n({Bucket, Key});
  +        false ->
  +            riak_core_util:get_index_n({Bucket, Key})
  +    end.
  
positive.code:     {reply, ok, State2};
  handle_call({insert_object, BKey, RObj}, _From, State) ->
      VNode = State#state.vnode,
      IndexN = riak_core_util:get_index_n(BKey),
      State2 = do_insert(IndexN, term_to_binary(BKey), VNode:hash_object(BKey, RObj), [], State),
      {reply, ok, State2};
  handle_call({delete, BKey}, _From, State) ->
      IndexN = riak_core_util:get_index_n(BKey),
      State2 = do_delete(IndexN, term_to_binary(BKey), State),
      {reply, ok, State2};
  
  
negative.code: 
  handle_cast({insert_object, BKey, RObj}, State) ->
      VNode = State#state.vnode,
      IndexN = get_index_n(VNode, BKey),
      State2 = do_insert(IndexN, term_to_binary(BKey), VNode:hash_object(BKey, RObj), [], State),
      {noreply, State2};
  
  