Henrik Barthels

A variation on the "alternative solution" that is perhaps a bit more general: One could make it possible to only show a summary of the notes that only contains what...

> Do you have by chance a better suggestion for this? Unfortunately, I don't. I'm really not an expert in C++. However, one of the reasons why we use yield...

> > If you know that you only need one of those two cases, there might be no need to implement yield at all. > > The commutative matcher in...

I think that's a reasonable feature. Unfortunately, I don't have much time to invest on MatchPy right now. If you want to implemented that, you are more than welcome to...

Our many-to-one matching algorithms don't support this. How to do this depends on the actual problem. If you only have three rules that you want to match one after another,...

You want to use a many-to-one matcher whenever you have multiple rules and want to know which ones match. Think of a many-to-one matcher as parallel matching. Matching rules are...

> Also replace_all() of matchpy.functions module maintains an order. But is very slow for large number of rules. This `replace_all()` does not use many-to-one matching, so it will be slow...

I don't know the Rubi rules well enough to say anything about many-to-one matching, but the fact that MatchPy supports sequence variables should not affect matching if you don't use...

Can you provide examples of cases where you would want to get such warnings? - For something like `f(x) -> g(x)` and `f(x) -> h(x)`, it should be trivial. -...

> Any cases it could cover would be helpful. Even if it started with only the trivial cases you pointed out. I'm somewhat skeptical about this. If we produce warnings...