anchor.diff:  -type import_tab() :: gb_trees:tree(mfa(), index()).
   -type fname_tab()  :: #{Name :: term() => index()}.
   -type line_tab()   :: #{{Fname :: index(), Line :: term()} => index()}.
  --type literal_tab() :: dict:dict(Literal :: term(), index()).
  +-type literal_tab() :: #{Literal :: term() => index()}.
   
   -type lambda_info() :: {label(),{index(),label(),non_neg_integer()}}.
   -type lambda_tab() :: {non_neg_integer(),[lambda_info()]}.
  
positive.code: -spec literal_table(bdict()) -> {non_neg_integer(), [[binary(),...]]}.
  
  literal_table(#asm{literals=Tab,next_literal=NumLiterals}) ->
      L0 = dict:fold(fun(Lit, Num, Acc) ->
  			   [{Num,my_term_to_binary(Lit)}|Acc]
  		   end, [], Tab),
      L1 = lists:sort(L0),
  
negative.code: -spec literal(term(), bdict()) -> {non_neg_integer(), bdict()}.
  
  literal(Lit, #asm{literals=Tab0,next_literal=NextIndex}=Dict) ->
      case Tab0 of
          #{Lit:=Index} ->
  	    {Index,Dict};
          #{} ->
  	    Tab = Tab0#{Lit=>NextIndex},
  	    {NextIndex,Dict#asm{literals=Tab,next_literal=NextIndex+1}}
      end.
  
  