anchor.diff:        v2_solve_conj(NewFlags, Cs, 1, Map, Conj, IsFlat, V2State,
                       [], [], [U|VarsUp], Map, NewFlags)
     end;
  +v2_solve_conj(every_i, Cs, I, Map, Conj, IsFlat, V2State, UL, NewFs, VarsUp,
  +              LastMap, LastFlags) ->
  +  NewIs = case Cs of
  +            [] -> [];
  +            _ -> [I|every_i]
  +          end,
  +  v2_solve_conj(NewIs, Cs, I, Map, Conj, IsFlat, V2State, UL, NewFs, VarsUp,
  +                LastMap, LastFlags);
   v2_solve_conj(Is, [_|Tail], I, Map, Conj, IsFlat, V2State, UL, NewFs, VarsUp,
                LastMap, LastFlags) ->
     v2_solve_conj(Is, Tail, I+1, Map, Conj, IsFlat, V2State, UL, NewFs, VarsUp,
  
positive.code:   NewAcc = [[t_var_name(D) || D <- t_collect_vars(Type)]|Acc],
    find_constraint_deps(Tail, NewAcc);
  find_constraint_deps([], Acc) ->
    lists:flatten(Acc).
  
  mk_constraint_1(Lhs, eq, Rhs, Deps) when Lhs < Rhs ->
    #constraint{lhs = Lhs, op = eq, rhs = Rhs, deps = Deps};
  
negative.code: %%-----------------------------------------------------------------------
  %% %CopyrightBegin%
  %%
  %% Copyright Ericsson AB 2006-2017. All Rights Reserved.
  %%
  %% Licensed under the Apache License, Version 2.0 (the "License");
  %% you may not use this file except in compliance with the License.
  