@@ -1653,8 +1653,7 @@ void ClassFinalizer::RehashTypes() {
1653
1653
for (intptr_t i = 0 ; i < types.Length (); i++) {
1654
1654
type ^= types.At (i);
1655
1655
bool present = types_table.Insert (type);
1656
- // Two recursive types with different topology (and hashes) may be equal.
1657
- ASSERT (!present || type.IsRecursive ());
1656
+ ASSERT (!present);
1658
1657
}
1659
1658
object_store->set_canonical_types (types_table.Release ());
1660
1659
@@ -1674,8 +1673,7 @@ void ClassFinalizer::RehashTypes() {
1674
1673
for (intptr_t i = 0 ; i < function_types.Length (); i++) {
1675
1674
function_type ^= function_types.At (i);
1676
1675
bool present = function_types_table.Insert (function_type);
1677
- // Two recursive types with different topology (and hashes) may be equal.
1678
- ASSERT (!present || function_type.IsRecursive ());
1676
+ ASSERT (!present);
1679
1677
}
1680
1678
object_store->set_canonical_function_types (function_types_table.Release ());
1681
1679
@@ -1695,8 +1693,7 @@ void ClassFinalizer::RehashTypes() {
1695
1693
for (intptr_t i = 0 ; i < typeparams.Length (); i++) {
1696
1694
typeparam ^= typeparams.At (i);
1697
1695
bool present = typeparams_table.Insert (typeparam);
1698
- // Two recursive types with different topology (and hashes) may be equal.
1699
- ASSERT (!present || typeparam.IsRecursive ());
1696
+ ASSERT (!present);
1700
1697
}
1701
1698
object_store->set_canonical_type_parameters (typeparams_table.Release ());
1702
1699
@@ -1720,8 +1717,7 @@ void ClassFinalizer::RehashTypes() {
1720
1717
for (intptr_t i = 0 ; i < typeargs.Length (); i++) {
1721
1718
typearg ^= typeargs.At (i);
1722
1719
bool present = typeargs_table.Insert (typearg);
1723
- // Two recursive types with different topology (and hashes) may be equal.
1724
- ASSERT (!present || typearg.IsRecursive ());
1720
+ ASSERT (!present);
1725
1721
}
1726
1722
object_store->set_canonical_type_arguments (typeargs_table.Release ());
1727
1723
}
0 commit comments