anchor.diff:                                            end
                                     end,
                                     0, NodeList),
  -    % then collect matching nodes and as many unmatching nodes as needed to 
  +    % then collect matching nodes and as many unmatching nodes as needed to
       % have a result of at least MinLength elements
       % -> beware not to destroy the order of the list!
       UnsatisfyingNodesToAdd = MinLength - SatisfyingCount,
  -    NewNodeList = 
  +    NewNodeList =
           case UnsatisfyingNodesToAdd =< 0 of
               true -> [Node || Node <- NodeList, FilterFun(Node)];
               false ->
  
positive.code:     ensure_lists_not_empty(Preds, BaseNode, Succs).
  
  %% @doc Merges nodes of Neighbors2 into Neighbors1 and truncates the predecessor
  %%      and successor lists to the given sizes. 
  -spec merge(Neighbors1::neighborhood(), Neighbors2::neighborhood(), PredsLength::pos_integer(),
              SuccsLength::pos_integer()) -> neighborhood().
  merge(Neighbors1, Neighbors2, PredsLength, SuccsLength) ->
  
negative.code:             SuccOrd = fun(N1, N2) -> succ_ord_node(N1, N2, BaseNode) end,
              SuccsUpdSorted = lists:usort(SuccOrd, ViewUpd),
              PredsUpdSorted = lists:reverse(SuccsUpdSorted),
  
              trunc(new(PredsUpdSorted, BaseNode, SuccsUpdSorted), PredsLength, SuccsLength);
          true ->
              throw_if_newer(NodeToAdd, BaseNode),
  