anchor.diff:  % @doc Get the inner node:node_type() of a rt_entry
   -spec rt_entry_node(N :: rt_entry()) -> node:node_type().
   rt_entry_node(#rt_entry{node=N}) -> N.
  +
  +% @doc Set the inner node:node_type() of a rt_entry
  +-spec rt_entry_set_node(Entry :: rt_entry(), Node :: node:node_type()) -> rt_entry().
  +rt_entry_set_node(#rt_entry{} = Entry, Node) -> Entry#rt_entry{node=Node}.
   
   % @doc Calculate the distance between two nodes in the routing table
   -spec rt_entry_distance(From :: rt_entry(), To :: rt_entry()) -> non_neg_integer().
  
positive.code:                     )
              end,
              rt_set_nodes(RT, Nodes);
          false ->
              case Type of
                  sticky -> % update entry
                      StickyEntry = rt_get_node(node:id(Entry), RT),
  
negative.code:                                         intervals:in(node:id(Entry), Interval2)
                              end;
                          false ->
                              % Only two nodes are existing in the ring (otherwise, Pred == Succ
                              % means there is a bug somewhere!). When two nodes are in the
                              % system, another third node will be either the successor or
                              % predecessor of the source node when added.
                              true
  