anchor.diff:  lgettext(<<"de">>, <<"navigation">>, <<"Resources">>) ->
       {ok, <<"Ressourcen">>}.
   
  -%% Cover more code in beam_bsm.
  -check_bitstring_list(_Config) ->
  +%% Test more code in beam_bsm.
  +beam_bsm(_Config) ->
       true = check_bitstring_list(<<1:1,0:1,1:1,1:1>>, [1,0,1,1]),
       false = check_bitstring_list(<<1:1,0:1,1:1,1:1>>, [0]),
  +
  +    true = bsm_validate_scheme(<<>>),
  +    true = bsm_validate_scheme(<<5,10>>),
  +    false = bsm_validate_scheme(<<5,10,11,12>>),
  +    true = bsm_validate_scheme([]),
  +    true = bsm_validate_scheme([5,10]),
  +    false = bsm_validate_scheme([5,6,7]),
  +
  +    <<1,2,3>> = bsm_must_save_and_not_save(<<1,2,3>>, []),
  +    D = fun(N) -> 2*N end,
  +    [2,4|<<3>>] = bsm_must_save_and_not_save(<<1,2,3>>, [D,D]),
  +
       ok.
   
   check_bitstring_list(<<H:1,T1/bitstring>>, [H|T2]) ->
  
positive.code: guard_2(<<_>>, Healing) when Healing#{[] => Healing} =:= #{[] => #{}} ->
      ok.
  
  check(F, R) ->
      R = F().
  
  
negative.code: check_bitstring_list(_, _) ->
      false.
  
  bsm_validate_scheme([]) -> true;
  bsm_validate_scheme([H|T]) ->
      case bsm_is_scheme(H) of
          true -> bsm_validate_scheme(T);
          false -> false
      end;
  bsm_validate_scheme(<<>>) -> true;
  bsm_validate_scheme(<<H, Rest/binary>>) ->
      case bsm_is_scheme(H) of
          true -> bsm_validate_scheme(Rest);
          false -> false
      end.
  
  bsm_is_scheme(Int) ->
      Int rem 5 =:= 0.
  
  %% NOT OPTIMIZED: different control paths use different positions in the binary
  bsm_must_save_and_not_save(Bin, []) ->
      Bin;
  bsm_must_save_and_not_save(<<H,T/binary>>, [F|Fs]) ->
      [F(H)|bsm_must_save_and_not_save(T, Fs)];
  bsm_must_save_and_not_save(<<>>, []) ->
      [].
  
  guard(_Config) ->
      Tuple = id({a,b}),
      ok = guard_1(<<1,2,3>>, {1,2,3}),
  