On Tue, Apr 10, 2012 at 11:12 AM, Aaron Meurer wrote:
> On Sun, Apr 8, 2012 at 1:52 PM, Joachim Durchholz wrote:
>> Am 08.04.2012 19:18, schrieb Vladimir Perić:
>>
>>> As I wrote in the subject, it bills itself as "A hosted
>>> continuous integration service for the open source community"; more
>
Also, if you are using his translation as a base, you should commit
with --author="Lorenz Leutgeb " so you can
give him credit in the commit history (another option would be to
start with his branch and work off of it).
Aaron Meurer
On Mon, Apr 9, 2012 at 10:53 PM, Ondřej Čertík wrote:
> Hi Joac
On Mon, Apr 9, 2012 at 11:03 PM, Joachim Durchholz wrote:
> Am 10.04.2012 05:31, schrieb Aaron Meurer:
>
>> So I think we should
>> just fix issue 2899, and even if there are other recursion problems
>> they shouldn't show up (unless we are very unlucky). We need to fix
>> that issue anyway.
>
>
On Sun, Apr 8, 2012 at 1:52 PM, Joachim Durchholz wrote:
> Am 08.04.2012 19:18, schrieb Vladimir Perić:
>
>> As I wrote in the subject, it bills itself as "A hosted
>> continuous integration service for the open source community"; more
>> importantly, it has excellent integration with Github and t
On Mon, Apr 9, 2012 at 11:03 PM, Ondřej Čertík wrote:
> On Fri, Mar 30, 2012 at 11:40 AM, Brian Granger wrote:
>> Aaron,
>>
>> +1
>>
>> I fully agree with this.
>
> The same here.
>
>> It takes discipline to break up a big
>> project into a set of smaller pull requests, but it is extremely
>> imp
Am 10.04.2012 06:55, schrieb Ondřej Čertík:
If you can try it on your fork
and see how it works and if it is usable,
then we can definitely put some file into the main repository.
I've put that on my list, but I'm still busy cleaning up old issues.
So if anybody has time, please feel free to tr
On Fri, Mar 30, 2012 at 11:40 AM, Brian Granger wrote:
> Aaron,
>
> +1
>
> I fully agree with this.
The same here.
> It takes discipline to break up a big
> project into a set of smaller pull requests, but it is extremely
> important. Students need to think very carefully about how they will
>
Am 10.04.2012 05:31, schrieb Aaron Meurer:
So I think we should
just fix issue 2899, and even if there are other recursion problems
they shouldn't show up (unless we are very unlucky). We need to fix
that issue anyway.
As far as I understand the situation, we have an infinite recursion on
the
Hi,
On Sun, Apr 8, 2012 at 12:52 PM, Joachim Durchholz wrote:
> Am 08.04.2012 19:18, schrieb Vladimir Perić:
>
>> As I wrote in the subject, it bills itself as "A hosted
>> continuous integration service for the open source community"; more
>> importantly, it has excellent integration with Github
Hi Joachim,
On Sun, Apr 8, 2012 at 1:12 PM, Joachim Durchholz wrote:
> I'm now (finally, my apologies!) getting around to wrapping up Lorenz
> Leutgeb's German GCI translation of the website.
>
> What I have now is a fork of the website, with all files replaced by their
> German translations. (Th
On Mon, Apr 9, 2012 at 8:31 PM, Aaron Meurer wrote:
> Well, they've already got a patch for that on the Python issue. It
> will likely be fixed in Python 3.3.
>
> In the meanwhile, if I understand the issue correctly, it should be
> enough to just fix this one recursion error. So I think we shou
Well, they've already got a patch for that on the Python issue. It
will likely be fixed in Python 3.3.
In the meanwhile, if I understand the issue correctly, it should be
enough to just fix this one recursion error. So I think we should
just fix issue 2899, and even if there are other recursion
How does the similarity measure help in either of these cases?
Aaron Meurer
On Mon, Apr 9, 2012 at 6:22 PM, manoj babu wrote:
> in many cases we are just using term.match(pattern) but applying the
> similarity between these two trees expr tree and pattern tree it would
> become useful in some ca
in many cases we are just using term.match(pattern) but applying the
similarity between these two trees expr tree and pattern tree it would
become useful in some cases like...
simplify(sinx + siny + 2sin(x-y/2)cos(x+y/2)) which will result in 2*cos(x)
On Tue, Apr 10, 2012 at 5:48 AM, manoj babu wr
I think it should be useful for term.match(pattern).
On Mon, Apr 9, 2012 at 11:59 PM, Aaron Meurer wrote:
> An expression tree is essentially the tree you get from recursively
> calling .args on an expression. For example, if you have expr =
> sin(x) + 1, then expr.args = (sin(x), 1), and sin(x
Yeah, this is clearly a Python bug. I've submitted
http://bugs.python.org/issue14537 for this.
In the meantime, we need to do one of the following:
- Revert the above commit
- Fix the recursion error bug
- Comment out the XFAIL test.
So that the tests can be run in Python 3 again. If we choose
An expression tree is essentially the tree you get from recursively
calling .args on an expression. For example, if you have expr =
sin(x) + 1, then expr.args = (sin(x), 1), and sin(x).args = (x,).
The idea is to come up with some measures that use this tree structure
to indicate how similar two
> What is the best way to test if a sympy expression contains a function,
> either a named function such as sin(x) or a general function such as
> f(x,y,z). I would prefer not to differentiate with respect to all possible
> arguments and see if all the results are zero.
>>> eq=f(x)+sin(x)
>>> eq.
You can also get a set of all the the objects you want with .atoms():
In [1]: e = x + y + z + sin(x)
In [2]: e.atoms(Function)
Out[2]: set(sin(x))
In [3]: e = x + y + z + sin(x) + f(x)
In [4]: e.atoms(Function)
Out[4]: set(f(x), sin(x))
In [5]: e.atoms(sin)
Out[5]: set(sin(x))
Sean
On Mon, A
I know how to use "has" method:
In [6]: e = x + y + z + sin(x)
In [7]: e.has(Function)
Out[7]: True
Applied abstract function like f = Function("f"), in SymPy classified as
AppliedUndef:
In [1]: from sympy.core.function import AppliedUndef
In [2]: e = x + y + z + sin(x)
In [3]: e.has(Applied
20 matches
Mail list logo
