anchor.diff:  do_insert_expanded([], _Opts, State) ->
       State;
   do_insert_expanded([{Id, Key, Hash}|Rest], Opts, State=#state{trees=Trees}) ->
  -    State2 = 
  +    State2 =
       case orddict:find(Id, Trees) of
           {ok, Tree} ->
               Tree2 = hashtree:insert(Key, Hash, Tree, Opts),
  
positive.code: valid_time(_) ->
      false.
  
  do_insert(Items, Opts, State=#state{trees=Trees}) ->
      HasIndex = has_index_tree(Trees),
      do_insert_expanded(expand_items(HasIndex, Items), Opts, State).
  
  expand_items(HasIndex, Items) ->
      lists:foldl(fun(I, Acc) ->
                          expand_item(HasIndex, I, Acc)
                  end, [], Items).
  
  expand_item(Has2ITree, {object, BKey, RObj}, Others) ->
      IndexN = riak_core_util:get_index_n(BKey),
      BinBKey = term_to_binary(BKey),
      ObjHash = hash_object(BKey, RObj),
      Item0 = {IndexN, BinBKey, ObjHash},
      case Has2ITree of
          false ->
  
negative.code:             Hash2i =  hash_index_data(IndexData),
              [Item0, {?INDEX_2I_N, BinBKey, Hash2i} | Others]
      end;
  expand_item(_, _, Item, Others) ->
      [Item | Others].
  
  -spec do_insert_expanded([{index_n(), binary(), binary()}], proplist(),
  