File tree 1 file changed +4
-7
lines changed
1 file changed +4
-7
lines changed Original file line number Diff line number Diff line change 36
36
use_enum_map1_var /1 ,
37
37
use_enum_map2 /1 ,
38
38
use_enum_map3 /1 ,
39
- invariant_tyvar /2
39
+ invariant_tyvar2 /2
40
40
]).
41
41
42
42
-gradualizer ([solve_constraints ]).
@@ -250,13 +250,10 @@ use_enum_map3(SomeStruct) ->
250
250
% % The type variable `A` in `id_fun_arg/2` is invariant in its result type.
251
251
% % Thus, if there are multiple possible substitutions, none of them is minimal.
252
252
% % In this case we choose `A = the_lower_bound_of_A | any()' which is a bit
253
- % % lenient in some cases, as shown in invariant_tyvar /2. Hopefully, invariant
253
+ % % lenient in some cases, as shown in invariant_tyvar2 /2. Hopefully, invariant
254
254
% % type variables are very rare.
255
255
256
- -spec id_fun_arg (fun ((A ) -> B ), A ) -> {fun ((A ) -> B ), A }.
257
- id_fun_arg (Fun , Arg ) -> {Fun , Arg }.
258
-
259
- -spec invariant_tyvar (integer (), boolean ()) -> any ().
260
- invariant_tyvar (Int , Bool ) ->
256
+ -spec invariant_tyvar2 (integer (), boolean ()) -> any ().
257
+ invariant_tyvar2 (Int , Bool ) ->
261
258
{Fun , _Arg } = id_fun_arg (fun positive /1 , Int ),
262
259
Fun (Bool ).
You can’t perform that action at this time.
0 commit comments