The org applications for Google Season of Docs are now open.
https://developers.google.com/season-of-docs/docs/get-started/. The deadline is
April 23 which is in about two weeks.
Jason, we should schedule a time to work on it. If anyone else is interested in
helping let me know.
Aaron
In that case, it would be better to model your object after Predicate and
AppliedPredicate, which work the same way (except in Boolean expressions).
Aaron Meurer
> On Feb 5, 2016, at 5:37 PM, Bogdan Opanchuk wrote:
>
> Hi Aaron,
>
> Thank you for your reply.
>
>> If you
It seems like a good idea to me. There are some identities that hold for
variance and covariance independent of the probability distribution and it
would be cool to be able to apply those identities symbolically.
Aaron Meurer
> On Dec 15, 2015, at 11:05 AM, Francesco Bonazzi
The exe installer is built using the standard setup.py command. bdist_win32 or
something like that.
By the way, I forgot that Matthew Brett has a bot that should have build
Windows installers for this release. I'll need to check on it and see if they
work.
Aaron Meurer
On Nov 26, 2014, at
On Mar 4, 2014, at 9:57 PM, Ondřej Čertík ondrej.cer...@gmail.com wrote:
On Tue, Mar 4, 2014 at 6:47 PM, Aaron Meurer asmeu...@gmail.com wrote:
You should use SymPy 0.7.5. There were some issues with
init_printing() in recent older versions, but they should have all
been straightened out.
Yes, let's get it done. Should I freeze the google code issues?
Aaron Meurer
Sent from my iPhone.
On Mar 5, 2014, at 11:11 AM, Ondřej Čertík ondrej.cer...@gmail.com wrote:
On Wed, Mar 5, 2014 at 10:02 AM, Sergey B Kirpichev
skirpic...@gmail.com wrote:
On Wed, Mar 05, 2014 at 09:20:52AM
All I remember was that there was an introduction in another language (French
possibly), and it was on a mailing list discussion with Tom. I can probably
find it with a little searching when I get to my computer.
Aaron Meurer
Sent from my iPhone.
On Feb 26, 2014, at 6:51 PM, someone
Merry Christmas to all. I added a little surprise to the website, courtesy of
Anna Bujak (one of our GCI students).
Aaron Meurer
On Dec 24, 2013, at 10:58 PM, Manoj Kumar manojkumarsivaraj...@gmail.com
wrote:
Thanks and Happy Hoildays to everyone :)
--
You received this message
docscrape currently only works in python 2. We need to backport the python 3
version. The compatibility one is probably not an issue. The rest likely are.
By the way, running pyflakes in python 3 and looking for undefined variables
might uncover more of these issues.
Aaron Meurer
Sent from
Assumedly if it doesn't, then you would be able to tell just by applying the
sympy cse and seeing if it makes a significant difference in the run time.
Aaron Meurer
On Nov 5, 2013, at 6:45 PM, Matthew Rocklin mrock...@gmail.com wrote:
Sadly I'm not an expert in C compilers and I no longer
I don't think the key makes any guarantees, other than that the prefer will be
platform and python version independent. It also should be very hard to produce
two different objects with the same key.
It was probably originally designed to give the same ordering to reduce the
pain of
On Jun 22, 2011, at 8:51 AM, Ondrej Certik wrote:
On Wed, Jun 22, 2011 at 12:09 AM, Aaron Meurer asmeu...@gmail.com wrote:
So far, I've coded up an import_module function, that wraps the try,
except ImportError logic into a single unified function. It has
support for checking the module
During some of the discussions from GSoC, we decided that reimplementing one of
the dozen of graph theory modules (including networkx) in SymPy would be a
waste of time.
However, if the graph theory were done in a symbolic way, so that it would
really require SymPy to be implemented, then I
I think he was not using the git version at all. To get those features Chris
mentioned, you need to use the development version, or else use the 0.7.0
version that will be coming out in a few days.
Aaron Meurer
On Jun 22, 2011, at 5:57 AM, Chris Smith wrote:
Sometimes you have two sympy
On Jun 22, 2011, at 6:55 AM, Ted Horst wrote:
Seem like it would be more consistent to raise an ImportError rather than
return None. That would also mean less change to existing code.
That would defeat the whole purpose of the function, except when we need to
check for versions or you
Hi.
I'm not sure if it will be the same as how you envision this to work, but these
are all supported in SymPy:
In [7]: a, b = symbols('a b', commutative=False)
In [8]: a*b - b*a
Out[8]: a⋅b - b⋅a
Note the symbols are complex by default.
In [9]: x = Symbol('x')
In [10]: sqrt(x**2)
Out[10]:
Well, the thing that bugs me the most is that you can do the same things with
what would appear to be rational functions:
In [7]: Poly(1/x)
Out[7]: Poly(1/x, 1/x, domain='ZZ')
In [8]: Poly(1/x)*x
Out[8]: Poly(x*1/x, 1/x, domain='ZZ[x]')
In [9]: Poly(1/x)*x - 1
Out[9]: Poly(x*1/x - 1, 1/x,
On Jun 16, 2011, at 11:17 PM, Ondrej Certik wrote:
On Thu, Jun 16, 2011 at 10:06 PM, Aaron Meurer asmeu...@gmail.com wrote:
On Thu, Jun 16, 2011 at 11:00 PM, Ondrej Certik ondrej.cer...@gmail.com
wrote:
On Thu, Jun 16, 2011 at 8:34 PM, Ondrej Certik ondrej.cer...@gmail.com
wrote:
On Thu,
Meurer
On Jun 16, 2011, at 6:19 PM, Aaron S. Meurer wrote:
Well, the thing that bugs me the most is that you can do the same things with
what would appear to be rational functions:
In [7]: Poly(1/x)
Out[7]: Poly(1/x, 1/x, domain='ZZ')
In [8]: Poly(1/x)*x
Out[8]: Poly(x*1/x, 1/x, domain='ZZ[x
Sorting by the number of comments does't seem to be implemented, so I created
http://code.google.com/p/support/issues/detail?id=5446.
Aaron Meurer
On Jun 14, 2011, at 12:58 AM, Aaron Meurer wrote:
This already exists. The star is a way for users to vote for issues.
The issue tracker is set
There's a sample script at
http://code.google.com/p/sympy/issues/detail?id=1797. I don't know if it's
still relevant.
Aaron Meurer
On Jun 13, 2011, at 12:31 AM, Ondrej Certik wrote:
Hi,
when I try to import isympy in the newest ipython (installed in
Qsnake from qsnake.com), I get:
I think SymPy fits this need. It only really requires git and Python to
develop in (though depending on what you are doing, you may need other tools as
well). And since it is written in Python, the deveopment turnover time is
fast, meaning that you can get a lot done in a sprint.
Our issue
Well, I just noticed that sympy does not import under Python 2.4. I have fixed
this in the 0.7.0 branch. Please report any other problems that you find, and
I'll roll them out into a 0.7.0.rc2.
Aaron Meurer
On Jun 11, 2011, at 11:48 PM, Aaron Meurer wrote:
After weeks of work, and more
If you have numpy installed, then you will get the following
sympy/test_external/test_numpy.py[20] Warning: invalid value encountered in
power
[OK]
This is because the test tests
array([3, 8, -1])**5.5
and the -1**5.5 gives that error. Can this be
See the issue page. It has something to do with the new default lexicographic
ordering for printing.
Aaron Meurer
On Jun 8, 2011, at 2:20 AM, Luke wrote:
I was writing some documentation for physics/units.py and discovered
some infinite recursion RuntimeError:
from sympy.physics.units
I think it's so that we can use symbols in boolean expressions, like
In [2]: x y
Out[2]: x ∧ y
But I think this is a bad design. We should rather have a BooleanSymbol to do
this.
Aaron Meurer
On Jun 8, 2011, at 2:41 PM, krastanov.ste...@gmail.com wrote:
Why is it necessary?
--
You
On Mon, Jun 6, 2011 at 3:06 PM, Hector hector1...@gmail.com wrote:
On Tue, Jun 7, 2011 at 1:04 AM, Aaron S. Meurer asmeu...@gmail.com wrote:
On Jun 6, 2011, at 10:44 AM, Hector wrote:
On Tue, Mar 29, 2011 at 5:42 AM, Mateusz Paprocki matt...@gmail.com
wrote:
Hi
You should submit a pull request only if you feel that your code is ready to be
merged in. So 2.
If you just want feedback, you can write to the list with a link to your branch
on GitHub. It's even possible for people to leave comments on lines of code
without you creating a pull request.
This has actually been discussed quite a bit before (a lot of people want to
use Lagrangians). You can search the mailing list. From what I've seen, you
will either have to write your own custom diff routine or do clever
substitution of functions and derivatives with symbols. I don't think
On Jun 1, 2011, at 9:35 PM, Ronan Lamy wrote:
Le mercredi 01 juin 2011 à 20:12 -0600, Aaron Meurer a écrit :
A few things:
- Even if we made isympy play nice, doctests assume just a regular
pure Python shell. So any doctest of a function that somehow has a
list, tuple, or dict of sympy
On May 31, 2011, at 11:11 AM, Ronan Lamy wrote:
Le mardi 31 mai 2011 à 09:43 -0700, Vinzent Steinberg a écrit :
On May 30, 9:52 pm, Mateusz Paprocki matt...@gmail.com wrote:
That could work:
ZZ.sum([1, 2, 3]) - sum([1, 2, 3])
RR.sum([1.0, 2.0]) - mpmath.fsum([1.0, 2.0])
EX.sum([x, y, z])
In [1] you will find a very simple comparison of Integer, int and mpz. This
applies to the rational case as well, just the difference is even bigger.
Did you make those graphs manually, or do you have some program that automates
it? It would be nice to have something that can make timing
On Jun 2, 2011, at 9:48 AM, Brian Granger wrote:
On Thu, Jun 2, 2011 at 1:28 AM, Mateusz Paprocki matt...@gmail.com wrote:
Hi,
On 2 June 2011 04:09, Brian Granger elliso...@gmail.com wrote:
Is there a link somewhere to documentation about the groundtypes in
polys? I am interested why
On Jun 2, 2011, at 10:13 AM, sherjiloz...@gmail.com wrote:
Yes and no and no.
Numpy/scipy matrices have their backend in C/fortran types. Arbitrary objects
can't be put inside them.
That's where sympy comes in and finds a market for its use. I'm adding a
dtype(the usgae of this name
Yeah, it would be cool to have assumptions for functions. Stuff like
one-to-one, onto, increasing, strictly increasing (implies one-to-one),
continuous, etc.
Aaron Meurer
On Jun 2, 2011, at 12:52 PM, Christophe BAL wrote:
Hello.
On the other hand, maybe solve should be able to tell
This is indeed a very interesting application of SymPy. Here we see one
example of the power of symbolic computer algebra systems, which is that
symbolic preprocessing, even very simple preprocessing like what we have here,
can greatly optimize arbitrary code execution.
If your expressions
Is there a specific reason why you want to use evalf() to do your lookups, or
is it just because you want something that will recurse down the expression
tree?
Aaron Meurer
On Jun 2, 2011, at 2:10 PM, luke wrote:
My bad, sorry for my inexperience with sympy, final code: (this is
really
On Jun 2, 2011, at 9:21 PM, Ronan Lamy wrote:
Le jeudi 02 juin 2011 à 17:07 -0600, Aaron S. Meurer a écrit :
On May 31, 2011, at 11:11 AM, Ronan Lamy wrote:
Le mardi 31 mai 2011 à 09:43 -0700, Vinzent Steinberg a écrit :
On May 30, 9:52 pm, Mateusz Paprocki matt...@gmail.com wrote
On Jun 2, 2011, at 10:09 PM, Ronan Lamy wrote:
Le jeudi 02 juin 2011 à 21:28 -0600, Aaron S. Meurer a écrit :
On Jun 2, 2011, at 9:21 PM, Ronan Lamy wrote:
Le jeudi 02 juin 2011 à 17:07 -0600, Aaron S. Meurer a écrit :
On May 31, 2011, at 11:11 AM, Ronan Lamy wrote:
Le mardi 31 mai 2011
I don't think it's worth it.
Aaron Meurer
On May 26, 2011, at 11:59 PM, smichr wrote:
What do you think about changing the names integer_nthroot and
factorint - iroot and ifactor?
--
You received this message because you are subscribed to the Google Groups
sympy group.
To post to this
Shouldn't it return 1?
Aaron Meurer
On May 27, 2011, at 3:14 PM, smichr wrote:
There are two questions, really:
1) why does gcd(2/3, 4/9) give 2/9 instead of (the greater) 2/3? I
know what the code is doing...but should it be doing that? I read
that
This definition is consistent with
You might also look at the discussion at
http://code.google.com/p/sympy/issues/detail?id=135. We used to override
__eq__ to retune Eq(), but we changed it to be like it is now. You can see at
around comment 22 that the main reason for the change was for performance
purposes.
But I would
If I try this with mpmath 0.16 (the version we currently have in sympy in the
latest git master), I get:
In [22]: print 'subs: ', mpmath.findroot(lambda xi: p.subs(x, xi), 1.0)
subs:
---
ValueError
.
Thanks again,
Matt
On Thu, May 26, 2011 at 08:28:51PM -0600, Aaron S. Meurer wrote:
If I try this with mpmath 0.16 (the version we currently have in sympy in
the latest git master), I get:
In [22]: print 'subs: ', mpmath.findroot(lambda xi: p.subs(x, xi), 1.0)
subs
That is a very old commit. If the reduction was hard, then it was probably
moved to an XFAIL test. Are you sure it isn't in one of those?
Aaron Meurer
On May 24, 2011, at 8:28 PM, Chris Smith wrote:
e12fb20c2405b4fdcac8dff980c0b6637c46ec06
--
You received this message because you are
What happens if you make it use an algebraic domain, i.e., set extension=True?
Aaron Meurer
On May 24, 2011, at 10:14 PM, smichr wrote:
One of the problems I am running into with polys is this:
p1,p2=[(x - 5)**2 + (y - 5)**2 - 4, -(-x + 5)*(-x - 2*2**(1/
S(2)) + 5) - (-y
+ 5)*(-y +
On May 25, 2011, at 3:01 AM, Mateusz Paprocki wrote:
Hi,
On 25 May 2011 10:43, Aaron S. Meurer asmeu...@gmail.com wrote:
What happens if you make it use an algebraic domain, i.e., set extension=True?
That's a good suggestion. Usually polys (domains or whatever else) in not the
problem
That's basically correct. The problem is that certain polynomial algorithms
(in this case, polynomial division) rely on the ability to determine zero
equivalence in the coefficients. But floating point numbers, as we all know,
have the problem where they will often give something like 1e-14
What is the SHA1 of the commit?
Aaron Meurer
On May 24, 2011, at 3:38 PM, smichr wrote:
I see that a test which is proving difficult to verify was deleted in
the commit that made this change:
def test_1st_homogeneous_coeff_ode2():
eq1 = f(x).diff(x) - f(x)/x+1/sin(f(x)/x)
eq2 =
Hi.
On May 24, 2011, at 5:50 PM, Matthew Rocklin wrote:
Hi Everyone,
I'm revamping Sets a bit as a precursor to my GSoC project. The first part of
this is creating a FiniteSet object to go along with Intervals (like (0, 1] )
and Unions (like [-1,0) U (0, 1] ).
I changed the default
matt...@gmail.com wrote:
Hi,
On 24 May 2011 17:42, Aaron S. Meurer asmeu...@gmail.com wrote:
Hi.
On May 24, 2011, at 5:50 PM, Matthew Rocklin wrote:
Hi Everyone,
I'm revamping Sets a bit as a precursor to my GSoC project. The first
part of this is creating a FiniteSet
Just a reminder to students that this means that you need to blog at some point
this week. You don't have to do it until the end of the day on Saturday. But
it's just a reminder that it needs to be done.
If you don't have anything to blog about because you haven't done much yet,
then a
On May 22, 2011, at 9:31 PM, Renato Coutinho wrote:
On Mon, May 23, 2011 at 12:28 AM, Mateusz Paprocki matt...@gmail.com wrote:
Hi,
On 23 May 2011 05:18, smichr smi...@gmail.com wrote:
Will list(e.free_symbols) be OS independent?
.free_symbols is implemented using sets so it is
On May 22, 2011, at 7:43 PM, Andy Ray Terrel wrote:
On Sun, May 22, 2011 at 7:27 PM, Aaron S. Meurer asmeu...@gmail.com wrote:
On May 22, 2011, at 12:12 PM, Mateusz Paprocki wrote:
Hi,
On 22 May 2011 18:17, Aaron S. Meurer asmeu...@gmail.com wrote:
Is it possible to implement x*y*z
On May 23, 2011, at 12:40 PM, Chris Smith wrote:
Aaron S. Meurer wrote:
On May 22, 2011, at 9:31 PM, Renato Coutinho wrote:
On Mon, May 23, 2011 at 12:28 AM, Mateusz Paprocki
matt...@gmail.com wrote:
Hi,
On 23 May 2011 05:18, smichr smi...@gmail.com wrote:
Will list(e.free_symbols
On May 23, 2011, at 12:49 PM, Mateusz Paprocki wrote:
Hi,
On 23 May 2011 20:46, Aaron S. Meurer asmeu...@gmail.com wrote:
On May 23, 2011, at 12:40 PM, Chris Smith wrote:
Aaron S. Meurer wrote:
On May 22, 2011, at 9:31 PM, Renato Coutinho wrote:
On Mon, May 23, 2011 at 12:28 AM
On May 22, 2011, at 9:50 AM, Chris Smith wrote:
Ronan Lamy wrote:
Le dimanche 22 mai 2011 à 14:38 +0545, Chris Smith a écrit :
I think that sets make more sense, too, but it's useful to
have the
variables in the output, and dicts are the easiest way to
handle
On May 23, 2011, at 4:43 PM, Ronan Lamy wrote:
Le lundi 23 mai 2011 à 12:53 -0600, Aaron S. Meurer a écrit :
On May 22, 2011, at 9:50 AM, Chris Smith wrote:
Ronan Lamy wrote:
Le dimanche 22 mai 2011 à 14:38 +0545, Chris Smith a écrit :
I think that sets make more sense, too
On May 23, 2011, at 6:23 PM, Ronan Lamy wrote:
Le lundi 23 mai 2011 à 18:01 -0600, Aaron S. Meurer a écrit :
On May 23, 2011, at 4:43 PM, Ronan Lamy wrote:
Le lundi 23 mai 2011 à 12:53 -0600, Aaron S. Meurer a écrit :
On May 22, 2011, at 9:50 AM, Chris Smith wrote:
Ronan Lamy wrote:
Le
Hi.
On May 23, 2011, at 10:55 PM, Rajeev Singh wrote:
Hi,
I asked this question on sage mailing list already and it seems appropriate
to ask here as well. I wish to simplify some calculation that appear in
quantum mechanics. To begin we use non-commutative variables as -
sage: x, y =
+ 2⋅y⋅x
The output below was from the latest development branch, and will be present in
the next release.
Aaron Meurer
On May 23, 2011, at 11:06 PM, Aaron S. Meurer wrote:
Hi.
On May 23, 2011, at 10:55 PM, Rajeev Singh wrote:
Hi,
I asked this question on sage mailing list already
On May 21, 2011, at 10:10 PM, Ondrej Certik wrote:
Hi,
I have refactored all the code running planet.sympy.org and it is now
fully hosted by github. The repository is here:
https://github.com/sympy/planet.sympy.org
see the README for information how it works. The blogs subscriptions
On May 22, 2011, at 9:47 AM, Aaron S. Meurer wrote:
On May 21, 2011, at 10:10 PM, Ondrej Certik wrote:
Hi,
I have refactored all the code running planet.sympy.org and it is now
fully hosted by github. The repository is here:
https://github.com/sympy/planet.sympy.org
see
On May 22, 2011, at 9:34 AM, Andy Ray Terrel wrote:
On Sat, May 21, 2011 at 10:51 PM, Ondrej Certik ond...@certik.cz wrote:
On Sat, May 21, 2011 at 8:21 PM, Andy Ray Terrel andy.ter...@gmail.com
wrote:
On Sat, May 21, 2011 at 10:10 PM, Ronan Lamy ronan.l...@gmail.com wrote:
Le samedi 21
Is it possible to implement x*y*z as reduce(operator.mul, [x, y, z])?
Aaron Meurer
On May 21, 2011, at 9:11 PM, Andy Ray Terrel andy.ter...@gmail.com
wrote:
My experience with developing languages in Ignition, is largely the
same as what Brian outlined. Another solution though is to
On May 22, 2011, at 12:12 PM, Mateusz Paprocki wrote:
Hi,
On 22 May 2011 18:17, Aaron S. Meurer asmeu...@gmail.com wrote:
Is it possible to implement x*y*z as reduce(operator.mul, [x, y, z])?
It works:
In [2]: import operator
In [3]: reduce(operator.mul, [x, y, z])
Out[3]: x⋅y⋅z
On May 22, 2011, at 5:16 PM, Andy Ray Terrel wrote:
On Sun, May 22, 2011 at 1:49 PM, Andy Ray Terrel andy.ter...@gmail.com
wrote:
On Sun, May 22, 2011 at 1:12 PM, Mateusz Paprocki matt...@gmail.com wrote:
Hi,
On 22 May 2011 18:17, Aaron S. Meurer asmeu...@gmail.com wrote
On May 22, 2011, at 11:12 AM, Ondrej Certik wrote:
On Sun, May 22, 2011 at 8:47 AM, Aaron S. Meurer asmeu...@gmail.com wrote:
On May 21, 2011, at 10:10 PM, Ondrej Certik wrote:
Hi,
I have refactored all the code running planet.sympy.org and it is now
fully hosted by github
This is kind of similar to the oeis() function (issue 2203). Maybe we should
create a module for these kinds of things. It should to in utilities.
Aaron Meurer
On May 21, 2011, at 2:11 PM, Ondrej Certik wrote:
On Sat, May 21, 2011 at 12:27 PM, Vinzent Steinberg
On May 20, 2011, at 8:44 PM, Ronan Lamy wrote:
I think it would be good to tidy up our package structure before the
release, because we won't get another opportunity to do so for quite a
while. Here's a list of things to consider in no particular order,
bearing in mind that compatibility with
I agree.
Like I said, unless you want to create very abstract objects that represent
permutations with symbolic n, which would be implemented completely differently
from the explicit permutations, then don't worry about symbolic support for
this one. The main thing for the issue of making
So I guess it might be less useful to do this with permutation per se than for
some of the other things in Saptarshi's GSoC project. The example I gave in
the comment to his proposal was that he should do things like
class Totient(Expr):
def __init__ ...
instead of
def totient(n):
I don't own an Android, but can you not somehow cd into the sympy directory and
run ./setup.py install?
Aaron Meurer
On May 8, 2011, at 5:11 AM, Roberto Colistete Jr. wrote:
Hi,
It is my first participation here : how can I install Sympy on
Android (using SL4A with Python) ? I tried
On May 5, 2011, at 1:00 PM, Haz wrote:
On Thu, May 5, 2011 at 12:29 PM, Aaron Meurer asmeu...@gmail.com wrote:
The big questions that remain are those involving (1): it is generally
accepted that the old assumption system should give way to the new one, but
to what extent we remove
On May 6, 2011, at 10:32 AM, Ronan Lamy wrote:
Le jeudi 05 mai 2011 à 20:18 +0100, Tom Bachmann a écrit :
First of all thanks alexey, for steering the discussion into an
important direction!
On 05.05.2011 19:42, Alexey U. Gudchenko wrote:
Well, when I have concerned the assumptions, I
On May 6, 2011, at 6:09 PM, Alexey U. Gudchenko wrote:
02.05.2011 20:25, Ronan Lamy пишет:
Le dimanche 01 mai 2011 à 23:37 -0700, Ondrej Certik a écrit :
You should assume it. Non commutative symbols are just making things
very complicated, and it was a mistake to add them into the core
On May 3, 2011, at 6:30 PM, Ondrej Certik wrote:
On Tue, May 3, 2011 at 2:02 PM, Tom Bachmann e_mc...@web.de wrote:
On 03.05.2011 21:47, Ondrej Certik wrote:
On Tue, May 3, 2011 at 8:44 AM, Fredrik Johansson
fredrik.johans...@gmail.com wrote:
On Tue, May 3, 2011 at 3:00 PM, Tom
On May 4, 2011, at 2:06 PM, Ronan Lamy wrote:
Le mercredi 04 mai 2011 à 20:09 +0200, Fredrik Johansson a écrit :
On Tue, May 3, 2011 at 11:24 PM, Ronan Lamy ronan.l...@gmail.com wrote:
Le mardi 03 mai 2011 à 22:02 +0100, Tom Bachmann a écrit :
On 03.05.2011 21:47, Ondrej Certik wrote:
On
On May 4, 2011, at 4:52 PM, Tom Bachmann wrote:
Singleton objects are useful for more important things than optimising
'==' with 'is'. They represent 'sui generis' objects that have specific
behaviour. But that wasn't my point (not that you could have known it,
given that I forgot half the
I agree that Frederik's idea is an interesting one, but we would need to have
other people who understand it well if we were to attempt to implement it. If
you could write something up on the wiki, it would go a long way towards this.
Aaron Meurer
On May 2, 2011, at 11:49 AM, Haz wrote:
A
So there has been some discussion recently, both on and off list, as to what
SymPy is and what it should be. That is why I think that we need to have a
mission statement, which clearly outlines what SymPy is and where it should go.
Fortunately, I think we have really had one all along. I
On May 1, 2011, at 12:44 PM, Ondrej Certik wrote:
On Sun, May 1, 2011 at 10:30 AM, Aaron S. Meurer asmeu...@gmail.com wrote:
On Apr 30, 2011, at 11:13 PM, Ondrej Certik wrote:
On Sat, Apr 30, 2011 at 4:10 PM, Vinzent Steinberg
vinzent.steinb...@googlemail.com wrote:
On Apr 30, 11:59 pm
On May 1, 2011, at 1:35 PM, Tom Bachmann wrote:
On 1 Mai, 16:40, Haz christian.mu...@gmail.com wrote:
The cache issue runs deeper -- variable x, that depends on variably y, may
simplify to something that doesn't even involve y because of the assumptions
that come with y. In this case, a
On May 1, 2011, at 2:40 PM, Haz wrote:
This is the chunk that things get done in:
- https://github.com/sympy/sympy/blob/master/sympy/core/cache.py#L75
Have a global variable called working, and a local variable called first.
Put this at the top of wrapper:
first = False
if not
Does anyone have any ideas on ways that we can better manage the pull requests
at GitHub and the issues at Google Code? Right now there are some issues:
- People forget to reference the issue number on the pull request or the pull
request on the issue. The best case is that I notice this and
On Apr 29, 2011, at 12:17 PM, Ronan Lamy wrote:
Le vendredi 29 avril 2011 à 09:50 -0700, Tom Bachmann a écrit :
snip
I don't really think it's worth the hassle fixing this as long as we
can only do trivial cases anyway.
I think limit() needs to get smarter, not gruntz(). It should be able
The tests are supposed to print the names of the functions after the colons in
xpassed tests _
sympy/solvers/tests/test_ode.py:
sympy/solvers/tests/test_ode.py:
sympy/solvers/tests/test_ode.py:
But it is broken somehow.
Anyway,
, 2011, at 12:58 PM, Aaron S. Meurer wrote:
It works in Python 2.6. Something in Python 2.7 broke it:
xpassed tests
_
sympy/simplify/tests/test_sqrtdenest.py:'XPASS: test_sqrtdenest2'
Aaron Meurer
On Apr 29, 2011, at 12:52
So I agree with Brian here. TableForm is just another printer, which clearly
belongs in SymPy.
Aaron Meurer
On Apr 29, 2011, at 12:56 PM, Ondrej Certik wrote:
On Fri, Apr 29, 2011 at 11:24 AM, Brian Granger elliso...@gmail.com wrote:
In my mind the different mathematica *Form functions are
On Apr 29, 2011, at 1:08 PM, Haz wrote:
What were the road-blocks from moving the issues to github again?
On Fri, Apr 29, 2011 at 2:38 PM, Aaron S. Meurer asmeu...@gmail.com wrote:
Does anyone have any ideas on ways that we can better manage the pull
requests at GitHub and the issues
On Apr 29, 2011, at 4:01 PM, Vinzent Steinberg wrote:
On Apr 29, 10:59 pm, Ronan Lamy ronan.l...@gmail.com wrote:
Le vendredi 29 avril 2011 à 11:56 -0700, Ondrej Certik a écrit :
On Fri, Apr 29, 2011 at 11:24 AM, Brian Granger elliso...@gmail.com wrote:
In my mind the different mathematica
So Ondřej, Christian, and I talked about this before GSoC, but I forgot to
mention it on the list. We need to figure out, as a community, how to remove
the old assumptions system and merge in the new one. We have already had
several branches attempting to do it, and we couldn't even get a
most of that, no?
On Fri, Apr 29, 2011 at 6:42 PM, Aaron S. Meurer asmeu...@gmail.com wrote:
Technically, Google Code has a better tag system, because it lets you have
tags like our Priority, Status, and Type that can only take one value per
issue.
Also, the default labels functionality
I hope pastebin doesn't mind so many posts. And what about using gist?
Also, you should consider making use tox.
Aaron Meurer
On Apr 28, 2011, at 4:20 AM, Ondrej Certik wrote:
Hi,
I have spent 4 hours and created a SymPy Bot:
https://github.com/sympy/sympy-bot
I have reused Tom's
I already thought of much of this a while back. See
http://code.google.com/p/sympy/issues/detail?id=2142. We should consider
creating our own SymPyDeprecationWarning, since in Python 2.5+
DeprecationWarnings are not shown by default, but I think we ought to enable
them at least in isympy.
I only mean that they should be turned into exceptions for the tests. Of
course, otherwise they should stay as warnings.
Aaron Meurer
On Apr 27, 2011, at 1:08 PM, Alexey U. Gudchenko wrote:
27.04.2011 22:22, Aaron S. Meurer пишет:
I already thought of much of this a while back. See
http
On Apr 27, 2011, at 1:31 AM, Mateusz Paprocki wrote:
Hi,
On 27 April 2011 09:20, Ondrej Certik ond...@certik.cz wrote:
On Tue, Apr 26, 2011 at 8:39 PM, Aaron S. Meurer asmeu...@gmail.com wrote:
On Apr 26, 2011, at 7:08 PM, Ondrej Certik wrote:
On Tue, Apr 26, 2011 at 5:18 PM, Haz
On Apr 26, 2011, at 7:08 PM, Ondrej Certik wrote:
On Tue, Apr 26, 2011 at 5:18 PM, Haz christian.mu...@gmail.com wrote:
Couldn't some VM's do the trick?
On Tue, Apr 26, 2011 at 8:05 PM, Mateusz Paprocki matt...@gmail.com wrote:
Hi,
On 26 April 2011 16:59, Ondrej Certik ond...@certik.cz
On Apr 25, 2011, at 1:54 PM, Tom Bachmann wrote:
Dear list,
I would like to open a discussion on how to merge my (fairly
extensive) fixes to the gruntz algorithm. As far as I understand
release is currently top priority, so merging a large change might
seem a no-go (and I shall not assume
On Apr 25, 2011, at 5:12 PM, Ondrej Certik wrote:
On Mon, Apr 25, 2011 at 12:59 PM, Aaron S. Meurer asmeu...@gmail.com wrote:
On Apr 25, 2011, at 1:54 PM, Tom Bachmann wrote:
Dear list,
I would like to open a discussion on how to merge my (fairly
extensive) fixes to the gruntz
1 - 100 of 951 matches
Mail list logo