anchor.diff:      check_links(Mod, T);
   check_links(_, []) ->
       ok.
  +
  +%% Special binary_to_atom that deals with <<"'and'">>
  +b2a(Bin) ->
  +    case erl_scan:string(binary_to_list(Bin)) of
  +        {ok,[{atom,_,A}],_} -> A;
  +        {ok,[{A,_}],_} -> A
  +    end.
   
   docsmap(Fun) ->
       lists:map(fun F({Mod,_,_}) ->
  
positive.code:       end).
  
  check_links(Mod, [{a,Attr,C}|T]) ->
      TargetMod = binary_to_atom(proplists:get_value(module, Attr, atom_to_binary(Mod))),
      case code:get_doc(TargetMod) of
          {ok, _ModDoc} ->
              case {proplists:get_value(function, Attr), proplists:get_value(arity, Attr) } of
                  {undefined, undefined} ->
                      ok;
                  {Func, Arity} ->
                      case shell_docs:get_doc(TargetMod,
                                              binary_to_atom(Func),
                                              binary_to_integer(Arity)) of
                          [_]  -> ok;
                          _Else -> throw({could_not_find,TargetMod,
                                          binary_to_atom(Func),
                                          binary_to_integer(Arity)})
                      end
              end;
          _Else ->
              throw({could_not_find, TargetMod})
      end,
      check_links(Mod, C),
      check_links(Mod, T);
  
negative.code: init_per_testcase(_Case, Config) ->
      Config.
  
  end_per_testcase(_Case, _Config) ->
      ok.
  
  suite() ->
  