anchor.diff:      case PredId =:= SuccId of
           false ->
               {set_adjacent_succ(Pred, NodeId),
  -                NewEntry,
  -                set_adjacent_pred(Succ, NodeId)
  +             NewEntry,
  +             set_adjacent_pred(Succ, NodeId)
               };
           true ->
               AdjacentNode = set_adjacent_fingers(Pred, NodeId, NodeId),
  
positive.code:         end
          , adjacent_fingers={PredId, SuccId}
      }.
  
  % Get the tuple of adjacent finger ids with Node being in the middle:
  % {Predecessor, Node, Successor}
  
negative.code: get_sticky_entries(#rt_t{nodes=Nodes}) ->
      util:gb_trees_foldl(fun(_K, #rt_entry{type=sticky} = E, Acc) -> [E|Acc];
                        (_,_,Acc) -> Acc
                    end, [], Nodes).
  
  % @doc Check if a node exists in the routing table
  -spec entry_exists(EntryKey :: key(), rt()) -> boolean().
  