Changes between Initial Version and Version 3 of Ticket #19161


Ignore:
Timestamp:
09/08/15 09:32:54 (6 years ago)
Author:
jmantysalo
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #19161

    • Property Status changed from new to needs_review
    • Property Commit changed from to bf8fdd5dd0702a6158691183ac6a3351461a650e
    • Property Branch changed from to u/jmantysalo/faster_is_complemented
  • Ticket #19161 – Description

    initial v3  
    11As playing with matrices is much faster than looping over elements, this patch makes `is_complemented()` much faster.
    22
    3 Let `L10` bet the list of all lattices of 10 elements and `B10` be the Boolean lattice with `2^10` elements. Then without the patch it takes 7,76 seconds to run `len([L for L in L10 if L.is_complemented()])` and 101,84 seconds to run `L.is_complemented()`. With the patch the time reduces to 0,38 and 0,23 seconds.
     3Let `L10` bet the list of all lattices of 10 elements and `B10` be the Boolean lattice with `2^10` elements. Then without the patch it takes 7,76 seconds to run `len([L for L in L10 if L.is_complemented()])` and 101,84 seconds to run `B10.is_complemented()`. With the patch the time reduces to 0,38 and 0,23 seconds.