anchor.diff:  check_duplicated_keys([LC|LCs], Acc) ->
       [{FirstK, _}|LCPo] = read_po_file(LC),
       case check_duplicated_keys_lc(LCPo, FirstK) of
  -	ok -> 
  +	ok ->
   	    io:format("~p does not have duplicated keys~n", [get_lang_dir(LC)]),
   	    check_duplicated_keys(LCs, [{LC, true}|Acc]);
   	duplicated ->
  
positive.code: get_new_old_keys(KVDef, LC) ->
      KVCus = read_po_file(LC),
      get_new_old_keys(KVDef, KVCus, {[], []}).
  get_new_old_keys([{K,_}|KVDef], [{K,_}|KVCus], Acc) -> 
      get_new_old_keys(KVDef, KVCus, Acc);
  get_new_old_keys([{K1,_}|_] = KVDef, [{K2,_}|KVCus], {New, Old}) when K1 > K2 -> 
      get_new_old_keys(KVDef, KVCus, {New, [K2|Old]});
  get_new_old_keys([{K1,_}|KVDef], KVCus, {New, Old}) -> 
      get_new_old_keys(KVDef, KVCus, {[K1|New], Old});
  get_new_old_keys([], _KVCus, Acc) ->
      Acc.
  
  get_keys_to_be_replaced_from_ids(KeysToBeReplaced) ->
      case polish_server:get_new_old_keys() of
  	undefined -> 
  	    [];
  	NewOldKeys -> 
  	    get_keys_to_be_replaced_from_ids(KeysToBeReplaced, NewOldKeys, [])
      end.
  get_keys_to_be_replaced_from_ids([{NewId, OldId}|KeysToBeReplaced], 
  				 {NewKeys, OldKeys} = NLK, Acc) ->
      
      NewKey = lists:nth(NewId, NewKeys),
      OldKey = lists:nth(OldId, OldKeys),
      get_keys_to_be_replaced_from_ids(KeysToBeReplaced, NLK, [{NewKey,OldKey}|Acc]);
  get_keys_to_be_replaced_from_ids([], _NLK, Acc) ->
      Acc.
  
  
negative.code: find_end(Str, Sep) ->
      find_end(Str, Sep, 1, ?PIVOT, []).
  
  find_end([Sep|T], Sep, N, Pivot, Acc) when N =< Pivot-> {true, [Sep|Acc], T};
  find_end(_Str, _Sep, N, Pivot, _Acc) when N > Pivot  -> false;
  find_end([H|T], Sep, N, Pivot, Acc)                  -> find_end(T,Sep,N+1,
  								 Pivot,[H|Acc]);
  find_end([], _Sep, _N, _Pivot, Acc)                  -> {true, Acc, []}.
  
  reverse_tape(Acc, Str) ->
      reverse_tape(Acc, Str, ?SEP).
  
  