anchor.diff:      Node = #rt_entry{type=sticky} = rt_get_node(EntryKey, RT),
       NewNode = Node#rt_entry{type=normal},
       UpdatedTree = gb_trees:enter(EntryKey, NewNode, get_rt_tree(RT)),
  -    RT#rt_t{nodes=UpdatedTree}
  -    .
  -
  -
  --spec rt_entry_from(Node::node:node_type()
  -                    , Type :: entry_type()
  -                    , PredId :: key_t()
  -                    , SuccId :: key_t()
  -                   ) -> rt_entry().
  +    RT#rt_t{nodes=UpdatedTree}.
  +
  +
  +-spec rt_entry_from(Node::node:node_type(), Type :: entry_type(),
  +                    PredId :: key_t(), SuccId :: key_t()) -> rt_entry().
   rt_entry_from(Node, Type, PredId, SuccId) ->
  -    #rt_entry{
  -        node=Node
  -        , type=Type
  -        , adjacent_fingers={PredId, SuccId}
  -    }.
  +    #rt_entry{node=Node , type=Type , adjacent_fingers={PredId, SuccId}}.
   
   % @doc Create an rt_entry and return the entry together with the Pred und Succ node, where
   % the adjacent fingers are changed for each node.
  
positive.code: 
      rt_loop:set_rt(State, NewRT)
      ;
  
  handle_custom_message(_Message, _State) -> unknown_event.
  %% userdevguide-end rt_frtchord:handle_custom_message
  
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().
  