| 4 | |
| 5 | Before |
| 6 | {{{ |
| 7 | sage: g = posets.BooleanLattice(5).hasse_diagram().transitive_closure(); g = g.cartesian_product(g) |
| 8 | sage: %time Poset(g) |
| 9 | CPU times: user 1.3 s, sys: 8 ms, total: 1.3 s |
| 10 | Wall time: 1.29 s |
| 11 | Finite poset containing 1024 elements |
| 12 | }}} |
| 13 | |
| 14 | After |
| 15 | {{{ |
| 16 | sage: g = posets.BooleanLattice(5).hasse_diagram().transitive_closure(); g = g.cartesian_product(g) |
| 17 | sage: %time Poset(g) |
| 18 | CPU times: user 292 ms, sys: 12 ms, total: 304 ms |
| 19 | Wall time: 265 ms |
| 20 | Finite poset containing 1024 elements |
| 21 | }}} |
| 22 | |
| 23 | Note that a LOT of time is lost on calls to `__eq__`. If I make no mistake it is because `Posets` are `UniqueRepresentation`. I would personally be very very glad if we could get rid of that. |