@@ -335,8 +335,8 @@ module Compat
335
335
| ((Tpat_any | Tpat_var _),_)
336
336
| (_ ,(Tpat_any |Tpat_var _ )) -> true
337
337
(* Structural induction *)
338
- | Tpat_alias (p ,_ ,_ ,_ ,_ ),_ -> compat p q
339
- | _ ,Tpat_alias (q ,_ ,_ ,_ ,_ ) -> compat p q
338
+ | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ),_ -> compat p q
339
+ | _ ,Tpat_alias (q ,_ ,_ ,_ ,_ , _ ) -> compat p q
340
340
| Tpat_or (p1 ,p2 ,_ ),_ ->
341
341
(compat p1 q || compat p2 q)
342
342
| _ ,Tpat_or (q1 ,q2 ,_ ) ->
@@ -1216,7 +1216,7 @@ let build_other ext env =
1216
1216
let rec has_instance p = match p.pat_desc with
1217
1217
| Tpat_variant (l ,_ ,r ) when is_absent l r -> false
1218
1218
| Tpat_any | Tpat_var _ | Tpat_constant _ | Tpat_variant (_ ,None,_ ) -> true
1219
- | Tpat_alias (p ,_ ,_ ,_ ,_ ) | Tpat_variant (_ ,Some p ,_ ) -> has_instance p
1219
+ | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ) | Tpat_variant (_ ,Some p ,_ ) -> has_instance p
1220
1220
| Tpat_or (p1 ,p2 ,_ ) -> has_instance p1 || has_instance p2
1221
1221
| Tpat_construct (_ ,_ ,ps , _ ) | Tpat_array (_ , _ , ps ) ->
1222
1222
has_instances ps
@@ -1676,7 +1676,7 @@ let is_var_column rs =
1676
1676
(* Standard or-args for left-to-right matching *)
1677
1677
let rec or_args p = match p.pat_desc with
1678
1678
| Tpat_or (p1 ,p2 ,_ ) -> p1,p2
1679
- | Tpat_alias (p ,_ ,_ ,_ ,_ ) -> or_args p
1679
+ | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ) -> or_args p
1680
1680
| _ -> assert false
1681
1681
1682
1682
(* Just remove current column *)
@@ -1856,8 +1856,8 @@ and every_both pss qs q1 q2 =
1856
1856
let rec le_pat p q =
1857
1857
match (p.pat_desc, q.pat_desc) with
1858
1858
| (Tpat_var _ |Tpat_any ),_ -> true
1859
- | Tpat_alias (p ,_ ,_ ,_ ,_ ), _ -> le_pat p q
1860
- | _ , Tpat_alias (q ,_ ,_ ,_ ,_ ) -> le_pat p q
1859
+ | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ), _ -> le_pat p q
1860
+ | _ , Tpat_alias (q ,_ ,_ ,_ ,_ , _ ) -> le_pat p q
1861
1861
| Tpat_constant (c1 ), Tpat_constant (c2 ) -> const_compare c1 c2 = 0
1862
1862
| Tpat_construct (_ ,c1 ,ps ,_ ), Tpat_construct (_ ,c2 ,qs ,_ ) ->
1863
1863
Types. equal_tag c1.cstr_tag c2.cstr_tag && le_pats ps qs
@@ -1917,8 +1917,8 @@ let get_mins le ps =
1917
1917
*)
1918
1918
1919
1919
let rec lub p q = match p .pat_desc,q.pat_desc with
1920
- | Tpat_alias (p ,_,_,_,_),_ -> lub p q
1921
- | _ ,Tpat_alias (q ,_,_,_,_) -> lub p q
1920
+ | Tpat_alias (p ,_,_,_,_,_ ),_ -> lub p q
1921
+ | _ ,Tpat_alias (q ,_,_,_,_,_ ) -> lub p q
1922
1922
| (Tpat_any |Tpat_var _ ),_ -> q
1923
1923
| _ ,(Tpat_any |Tpat_var _ ) -> p
1924
1924
| Tpat_or (p1 ,p2,_),_ -> orlub p1 p2 q
@@ -2150,7 +2150,7 @@ let rec collect_paths_from_pat r p = match p.pat_desc with
2150
2150
List. fold_left
2151
2151
(fun r (_ , _ , p ) -> collect_paths_from_pat r p)
2152
2152
r lps
2153
- | Tpat_variant (_ , Some p , _ ) | Tpat_alias (p ,_ ,_ ,_ ,_ ) ->
2153
+ | Tpat_variant (_ , Some p , _ ) | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ) ->
2154
2154
collect_paths_from_pat r p
2155
2155
| Tpat_or (p1 ,p2 ,_ ) ->
2156
2156
collect_paths_from_pat (collect_paths_from_pat r p1) p2
@@ -2290,7 +2290,7 @@ let inactive ~partial pat =
2290
2290
List. for_all (fun (_ ,p ,_ ) -> loop p) ps
2291
2291
| Tpat_construct (_ , _ , ps , _ ) | Tpat_array (Immutable, _ , ps ) ->
2292
2292
List. for_all (fun p -> loop p) ps
2293
- | Tpat_alias (p ,_ ,_ ,_ ,_ ) | Tpat_variant (_ , Some p , _ ) ->
2293
+ | Tpat_alias (p ,_ ,_ ,_ ,_ , _ ) | Tpat_variant (_ , Some p , _ ) ->
2294
2294
loop p
2295
2295
| Tpat_record (ldps ,_ ) ->
2296
2296
List. for_all
@@ -2419,7 +2419,7 @@ type amb_row = { row : pattern list ; varsets : Ident.Set.t list; }
2419
2419
let simplify_head_amb_pat head_bound_variables varsets ~add_column p ps k =
2420
2420
let rec simpl head_bound_variables varsets p ps k =
2421
2421
match (Patterns.General. view p).pat_desc with
2422
- | `Alias (p ,x ,_ ,_ ,_ ) ->
2422
+ | `Alias (p ,x ,_ ,_ ,_ , _ ) ->
2423
2423
simpl (Ident.Set. add x head_bound_variables) varsets p ps k
2424
2424
| `Var (x , _ , _ , _ ) ->
2425
2425
simpl (Ident.Set. add x head_bound_variables) varsets Patterns. omega ps k
0 commit comments