anchor.diff:      VEqual = V1 =:= V2,
       TSEqual = riak_dt_vclock:equal(TS1, TS2),
       if VEqual andalso TSEqual ->
  -            equal(T1, T2);
  +            eq(T1, T2);
           true ->
               false
       end;
   eq(_, _) ->
       false.
   
  --spec stats(mvreg()) -> [{atom(), number()}].
  +-spec stats(mvreg()) -> [{atom(), non_neg_integer()}].
   stats(MVReg) ->
       [{value_size, stat(value_size, MVReg)}].
   
  --spec stat(atom(), mvreg()) -> number() | undefined.
  +-spec stat(atom(), mvreg()) -> non_neg_integer() | undefined.
   stat(value_size, MVReg) ->
       Values = value(MVReg),
       TS = value(timestamp, MVReg),
  
positive.code: 
  %% @doc Find a least-uppder bound for all non-compatible vector clocks in MVReg 
  %% (if there is any) and then increment timestamp for `Actor' by one.
  incVV(MVReg, Actor) ->
      TSL = [TS || {_Val, TS}<- MVReg],
      [H|T] = TSL,
      MaxVC = getMax(T, H),
      NewVC = riak_dt_vclock:increment(Actor, MaxVC),
      NewVC.
  
  %% @doc If the timestamp is larger than the counter of all corresponding entries.
  larger_than(_TS, _Actor, []) ->
      true;
  larger_than(TS, Actor, [H|T]) ->
  
negative.code:     case larger_than(TS, Actor, MVReg) of 
          true ->
              VV = incVV(MVReg, Actor),
              NewMVReg = init(Value, VV),
              update({assign, Value, TS}, Actor, NewMVReg); 
          false ->
              {ok, MVReg}
  