anchor.diff:          [New|AccIn]
       end, Nodes, ExtNodes),
       NewNodes1 = lists:sort(NewNodes),
  -    NewClock = vector_clock:increment(node(), Clock),
  +    NewClock = mem3_vclock:increment(node(), Clock),
       NewState = State#mem{nodes=NewNodes1, clock=NewClock},
       install_new_state(NewState),
       {ok, NewState}.
  
positive.code: %%      return match | {bad_state_match, Node, NodesThatDontMatch}
  compare_state_with_rest(#mem{clock=Clock} = _State, States) ->
      Results = lists:map(fun({Node, #mem{clock=Clock1}}) ->
          {vector_clock:equals(Clock, Clock1), Node}
      end, States),
      BadResults = lists:foldl(fun({true, _N}, AccIn) -> AccIn;
                                  ({false, N}, AccIn) -> [N | AccIn]
  
negative.code: 
  merge_states(#mem{clock=RemoteClock, nodes=RemoteNodes} = _RemoteState,
               #mem{clock=LocalClock, nodes=LocalNodes} = LocalState) ->
      MergedClock = mem3_vclock:merge(RemoteClock, LocalClock),
      MergedNodes = merge_nodes(RemoteNodes, LocalNodes),
      LocalState#mem{clock=MergedClock, nodes=MergedNodes}.
  
  