Skip to content

Commit f957315

Browse files
committed
Clarify cases optimization apply
1 parent 3d4bffe commit f957315

1 file changed

Lines changed: 2 additions & 3 deletions

File tree

‎lib/elixir/lib/module/types/descr.ex‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6366,9 +6366,8 @@ defmodule Module.Types.Descr do
63666366
# (D1 and (D2 or U2)) or (U1 and D2)}
63676367
#
63686368
# This formula is longer, meaning more operations, but it does preserve
6369-
# unions in place whenever possible. This change has reduced the algorithmic
6370-
# complexity in the past, but perhaps it is rendered less useful now due to
6371-
# the eager literal intersections.
6369+
# unions in place whenever possible, especially in the cases where C1
6370+
# and C2 are top, D1 and D2 are bottom.
63726371
{:eq, {_, lit, c1, u1, d1}, {_, _, c2, u2, d2}} ->
63736372
bdd_node_new(
63746373
lit,

0 commit comments

Comments
 (0)