anchor.diff:          Id ->
               Best = State#state.best_candidate,
               BestCandidate =
  -                case lists:keysearch(requests, 1, Best) of
  -                    {value, {requests, {_LoadChange, Node}}} -> Node;
  +                case lists:keyfind(requests, 1, Best) of
  +                    {requests, {_LoadChange, Node}} -> Node;
                       _ ->
  -                        case lists:keysearch(items, 1, Best) of
  -                            {value, {items, {_LoadChange, Node}}} -> Node;
  +                        case lists:keyfind(items, 1, Best) of
  +                            {items, {_LoadChange, Node}} -> Node;
                               _ -> nil
                           end
                   end,
  
positive.code:                 [] -> comm:send_local(self(), {pick_best_candidate, Id});
                  _  -> ok
              end,
              {value, {ThisReqId, NodeX}} = lists:keysearch(ThisReqId, 1, ReqIds),
  
              Best = State#state.best_candidate,
              {BestLoadChange, _Node} = proplists:get_value(Metric, Best, {0, nil}),
  
negative.code: %% assuming the two nodes are neighbors. If not we'll contact
  %% the light node's successor for more load information.
  handle_dht_msg({lb_active, phase1, NodeX, Options}, DhtState) ->
      {epsilon, Epsilon} = lists:keyfind(epsilon, 1, Options),
  	MyLBInfo = lb_info:new(dht_node_state:details(DhtState)),
      IsValid = lb_info:is_valid(MyLBInfo),
  	MyLoad = lb_info:get_load(MyLBInfo),
  