It definitely could help with some things. However, I am a bit turned off on using it considering statements about comparing a highly optimized special purpose library with SageMath:
This comparison isn't very fair (C++ vs python). On the same system, > iterating over all (24 choose 12) combinations, sage takes 12.2 seconds. > Discreture takes approximately 0.005 seconds. No point in graphing that. > Also, that is somewhat of a poor choice to do a benchmark against as that is a recursive python iteration as opposed to, say, Partitions. A proper benchmark instead of immediate dismissal and needless editorial would have been much better (and useful). On a more technical aspect, the boost dependency might be a problem. We have a slimmed down boost, but if it requires the full boost, then that might be a problem. I'm also not sure how Sage will work with a header only library. Best, Travis On Monday, August 6, 2018 at 9:03:29 PM UTC+10, Samuel Lelievre wrote: > > Dear sage-combinat-devel, > > Discreture is a C++ library for iterating through various combinatorial > structures such as combinations, permutations, partitions, etc. > > https://github.com/mraggi/discreture > > Could it bring speedups to any of Sage's combinatorics? > > Kind regards, > Samuel > -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/d/optout.
