anchor.diff:  	    index_parameter_types(Fs, Acc0)
       end;
   index_parameter_types([], Acc) ->
  -    gb_trees:from_orddict(lists:sort(Acc)).
  +    gb_trees:from_orddict(sort(Acc)).
   
   index_parameter_types_1([{'%', {type_info, Reg, Type0}} | Is], Entry, Acc) ->
       Type = case Type0 of
  
positive.code: 
  validate_3({Ls2,Is}, Name, Arity, Entry, Mod, Ls1, Ft) ->
      Offset = 1 + length(Ls1) + 1 + length(Ls2),
      EntryOK = lists:member(Entry, Ls2),
      if
  	EntryOK ->
  	    St = init_state(Arity),
  	    Vst0 = #vst{current=St,
  			branched=gb_trees_from_list([{L,St} || L <- Ls1]),
  			labels=gb_sets:from_list(Ls1++Ls2),
  			ft=Ft},
  	    MFA = {Mod,Name,Arity},
  	    Vst = valfun(Is, MFA, Offset, Vst0),
  	    validate_fun_info_branches(Ls1, MFA, Vst);
  
negative.code: labels_1(Is, R) ->
      {reverse(R),Is}.
  
  init_vst(Arity, Ls1, Ls2, Ft) ->
      Xs = init_regs(Arity, term),
      Ys = init_regs(0, initialized),
      St = #st{x=Xs,y=Ys},
      Branches = gb_trees_from_list([{L,St} || L <- Ls1]),
      Labels = gb_sets:from_list(Ls1++Ls2),
      #vst{branched=Branches,
           current=St,
           labels=Labels,
           ft=Ft}.
  
  kill_heap_allocation(St) ->
      St#st{h=0,hf=0}.
  