anchor.diff:  	 strings = <<>>		    :: binary(),	%String pool
   	 lambdas = [],				%[{...}]
   	 literals = dict:new()	    :: literal_tab(),
  -	 fnames = gb_trees:empty()  :: fname_tab(),
  +	 fnames = #{}               :: fname_tab(),
   	 lines = #{}                :: line_tab(),
   	 num_lines = 0		    :: non_neg_integer(), %Number of line instructions
   	 next_import = 0	    :: non_neg_integer(),
  
positive.code: 
  -type atom_tab()   :: #{atom() => index()}.
  -type import_tab() :: gb_trees:tree(mfa(), index()).
  -type fname_tab()  :: gb_trees:tree(Name :: term(), index()).
  -type line_tab()   :: #{{Fname :: index(), Line :: term()} => index()}.
  -type literal_tab() :: dict:dict(Literal :: term(), index()).
  
  
negative.code:      non_neg_integer(),[{non_neg_integer(),non_neg_integer()}]}.
  
  line_table(#asm{fnames=Fnames0,lines=Lines0,num_lines=NumLineInstrs}) ->
      NumFnames = maps:size(Fnames0),
      Fnames1 = lists:keysort(2, maps:to_list(Fnames0)),
      Fnames = [Name || {Name,_} <- Fnames1],
      NumLines = maps:size(Lines0),
      Lines1 = lists:keysort(2, maps:to_list(Lines0)),
  