anchor.diff:                  -> SpacingA =< SpacingB
               end, Spacings)
       ),
  -    entry_delete(entry_nodeid(FilterEntry), RT)
  +    FilteredNode = rt_entry_node(FilterEntry),
  +    delete_fd(node:pidX(FilteredNode)),
  +    entry_delete(node:id(FilteredNode), RT)
       .
   
   % @doc Delete an entry from the routing table
  
positive.code:             gb_trees:enter(PredId, NewPred,
                  gb_trees:enter(SuccId, NewSucc, Tree))
      end,
      RT#rt_t{nodes=UpdatedTree}
      .
  
  
negative.code:             end,
  
              Ns = {NewPred, NewNode, NewSucc} = create_entry(Entry, AdaptedType, RT),
              % - if the nodes are all the same, we entered the first node and thus only enter
              % a single node to the tree
              % - if pred and succ are the same, we enter the second node: add that node and
              % an updated pred
              % - else, add the new node and update succ and pred
              Nodes = case Ns of
                  {NewNode, NewNode, NewNode} ->
                      gb_trees:enter(entry_nodeid(NewNode), NewNode, get_rt_tree(RT));
                  {NewPred, NewNode, NewPred} ->
                      gb_trees:enter(entry_nodeid(NewNode), NewNode,
                              gb_trees:enter(entry_nodeid(NewPred), NewPred,
                                  get_rt_tree(RT)));
                  _Else ->
                      gb_trees:enter(entry_nodeid(NewSucc), NewSucc,
                          gb_trees:enter(entry_nodeid(NewNode), NewNode,
                              gb_trees:enter(entry_nodeid(NewPred), NewPred, get_rt_tree(RT))
                          )
                      )
              end,
              rt_set_nodes(RT, Nodes);
          false ->
              case Type of
                  sticky -> % update entry
                      StickyEntry = rt_get_node(node:id(Entry), RT),
                      Nodes = gb_trees:enter(node:id(Entry),
                          StickyEntry#rt_entry{type=sticky},
                          get_rt_tree(RT)),
                      rt_set_nodes(RT, Nodes)
                      ;
                  _ -> RT
              end
      end
      .
  
  