From: Ronan Lamy
Mul._eval_expand_mul, Pow._eval_expand_multinomial and Pow._eval_nseries
internally used excessively broad .expand() method instead of more focused
methods. This degraded performance and caused disallowed expand hints
to be applied anyway in some cases. This has been fixed and
Le mercredi 08 juillet 2009 à 12:27 -0600, Aaron S. Meurer a écrit :
> Thanks for fixing this. Most of this is stuff that I messed up.
>
> Aaron Meurer
It's not so easy to do. You need to understand the structure of the
expressions at each step and which transformations you want to apply. I
bac
Le dimanche 09 août 2009 à 01:31 -0600, Ondrej Certik a écrit :
> On Sun, Aug 9, 2009 at 1:25 AM, Luke wrote:
> > Attached is a patch that allows expand to handle negative integer
> > powers. This effectively allows expressions like:
> > expr = (x+y)**(-2)
> > to be expanded by calling
> > expr.e
Le dimanche 09 août 2009 à 16:34 -0700, Luke a écrit :
> >
> > * This line suggests that it would be helpful to create an 'inverse'
> > property - less work is needed to create this inverse than for a generic
> > Pow instance.
>
> Could you elaborate on what you mean here? Do you mean an inverse
Le dimanche 29 novembre 2009 à 17:51 +0100, Vinzent Steinberg a écrit :
> I now took a real-world example from sympy.
>
> Vinzent
On 32-bit, you've merely replaced one failure with another - so it's
maybe not such a good exemple.
Ronan
--
You received this message because you are subscribed t
Le vendredi 30 avril 2010 à 14:23 -0700, Ondrej Certik a écrit :
> On Fri, Apr 30, 2010 at 6:26 AM, jegerjensen wrote:
> >> Also, shouldn't this go into sympy.core?
> >>
> >> Ondrej
> >> """
> >
> > That is probably a good idea. Where should we put the decorator
> > _tuple_wrapper? Or should the
Le vendredi 30 avril 2010 à 16:06 -0700, Ondrej Certik a écrit :
> On Fri, Apr 30, 2010 at 3:04 PM, Ronan Lamy wrote:
> > Le vendredi 30 avril 2010 à 14:23 -0700, Ondrej Certik a écrit :
> >> On Fri, Apr 30, 2010 at 6:26 AM, jegerjensen
> >> wrote:
> >
Le vendredi 30 avril 2010 à 19:59 -0600, Aaron S. Meurer a écrit :
> On Apr 30, 2010, at 5:26 PM, Ronan Lamy wrote:
>
> > Le vendredi 30 avril 2010 à 16:06 -0700, Ondrej Certik a écrit :
> >> On Fri, Apr 30, 2010 at 3:04 PM, Ronan Lamy wrote:
> >>> Le vendredi 30
Le jeudi 17 juin 2010 à 14:02 -0700, Ondrej Certik a écrit :
> Yes, in this branch we should brake compatibility. We should totally
> get rid of the old assumptions, thus breaking compatibility. Make sure
> that things work nicely, all tests pass and there are no hacks.
I don't understand. Have Ch
Le vendredi 18 juin 2010 à 02:02 +0200, Vinzent Steinberg a écrit :
> Using the local assumptions hack we could keep compatibility and avoid
> rewriting sympy.
I don't see how. Putting everything into global_assumptions works just
as well, it's only less efficient. Changing the assumption system
Le lundi 05 juillet 2010 à 19:17 +0200, Øyvind Jensen a écrit :
> > Yep. I just got back from SciPy and I talked a lot with one of the
> > devs of theano:
> >
> > http://deeplearning.net/software/theano/
>
> Thanks for bringing theano to my attention!
Yes, that's very interesting!
> > Are you
Le lundi 09 août 2010 à 13:15 -0700, Christian Muise a écrit :
> Hello,
> I'd like to formally request that this branch be merged into the
> SymPy trunk:
> - http://github.com/haz/sympy/tree/soc-final
>
That's quite a big chunk to review! Globally, this looks good, but I
don't have time to revie
Le mardi 10 août 2010 à 14:07 -0400, Christian Muise a écrit :
> I really don't think that static compilation to Python
> code is a good idea. It prevents any extension to the system
> and makes
> it very hard to maintain. It would be much more useful to
> c
Le mercredi 25 août 2010 à 10:56 -0700, Christian Muise a écrit :
> Vinzent, et al, does the branch seem alright to go in at this point?
> I'm sitting on this merge request before bringing up the more
> debatable points surrounding the removal of the old assumption system.
> Thanks.
>
> Cheers
>
Le vendredi 19 novembre 2010 à 01:28 -0800, smichr a écrit :
>
> On Nov 19, 8:08 am, sy...@googlecode.com wrote:
> > Comment #10 on issue 1915 by ronan.l...@gmail.com: Unify make_list with
> > as_Add/as_Mulhttp://code.google.com/p/sympy/issues/detail?id=1915
> >
> > I think I've found a better n
Le mardi 30 novembre 2010 à 10:42 -0800, freevryheid a écrit :
> hmm
>
> 'Mul' object has no attribute 'count_chars'
>
> On Nov 30, 12:38 pm, freevryheid wrote:
> > What about adding the following function to basic.py:
> >
> > def count_chars(self):
> > """
> > Return the num
Le mardi 30 novembre 2010 à 14:58 -0700, Aaron S. Meurer a écrit :
> There is also .count_ops(), which is faster and also gives a better
> insight into the actual size of an expression, since it doesn't give
> more weight to " + " and to symbols and numbers that are more than one
> character long.
Coverage test runs must be run in the same process.
You can merge this Pull Request by running:
git pull https://github.com/rlamy/sympy coverage_report
Or you can view, comment on it, or merge it online at:
https://github.com/sympy/sympy/pull/1404
-- Commit Summary --
* Fix bin/coverage_r
This makes all cache retrievals faster, eg:
before
In [1]: %timeit Pow(y, 2)
10 loops, best of 3: 9.8 us per loop
after
In [1]: %timeit Pow(y, 2)
10 loops, best of 3: 7.5 us per loop
You can merge this Pull Request by running:
git pull https://github.com/rlamy/sympy caching
Or you ca
19 matches
Mail list logo
