val iter_core_type :
(Migrate_parsetree.Ast_405.Parsetree.core_type -> unit) ->
Migrate_parsetree.Ast_405.Parsetree.core_type ->
unitIteration on core_type, like Btype.iter_type_expr
val constrs_in_core_type :
Migrate_parsetree.Ast_405.Parsetree.core_type ->
Longident.t listReferred constrs and classes
val constrs_in_type_declaration :
Migrate_parsetree.Ast_405.Parsetree.type_declaration ->
Longident.t listReferred constrs and classes
val is_gadt : Migrate_parsetree.Ast_405.Parsetree.type_declaration -> boolReturn true if it defines a GADT
val group_type_declarations :
Migrate_parsetree.Ast_405.Parsetree.type_declaration list ->
Migrate_parsetree.Ast_405.Parsetree.type_declaration list list
* Migrate_parsetree.Ast_405.Parsetree.type_declaration listGroup the type declarations defined by one type without nonrec. The result consists of the two components. The first is the truly mutual type declaration groups. The type declarations of each group are defined truly mutual recursively. The second is the the type declarations not really recursively defined.
For example, type t = Foo of u and u = label : t; label2 : v; and v = Zee of v and w = Boo the function returns the following: ( [t; u]; [v] , w)