New issue 3083: segfault in recursive code
https://bitbucket.org/pypy/pypy/issues/3083/segfault-in-recursive-code
lesshaste:
Python 3.6.1 \(7.1.1\+dfsg-1~ppa1~ubuntu16.04, Aug 09 2019, 16:05:52\)
\[PyPy 7.1.1 with GCC 5.4.0 20160609
Python 2.7.13 \(7.1.1\+dfsg-1~ppa1~ubuntu16.04, Aug 09
New issue 2770: python 3 code slower with pypy3
https://bitbucket.org/pypy/pypy/issues/2770/python-3-code-slower-with-pypy3
lesshaste:
The following code was written by someone called Dennis.
from functools import lru_cache
@lru_cache(maxsize = None)
def haf(matrix):
n = len(matrix
New issue 2517: Example scientific numpy code 6x slower in pypy
https://bitbucket.org/pypy/pypy/issues/2517/example-scientific-numpy-code-6x-slower-in
lesshaste:
The attached numpy code computes the permanent of a matrix and is about 6 times
slower in pypy 5.7 than cpython. This is a problem
New issue 2424: pypy-dev is required to install numpy from head
https://bitbucket.org/pypy/pypy/issues/2424/pypy-dev-is-required-to-install-numpy-from
lesshaste:
In the docs at http://pypy.org/download.html#installing-numpy and
http://doc.pypy.org/en/latest/install.html steps are set out for
New issue 2088: automatic casting does not work in linalg
https://bitbucket.org/pypy/pypy/issues/2088/automatic-casting-does-not-work-in-linalg
lesshaste:
In ipython the following works
ipython
Python 2.7.6 (default, Jun 22 2015, 17:58:13)
Type "copyright", "credits" o
New issue 2065: Relatively simple code much slower in pypy than cpython
https://bitbucket.org/pypy/pypy/issue/2065/relatively-simple-code-much-slower-in-pypy
lesshaste:
As discussed on IRC, I have some relatively simple code that is much slowed in
pypy than cpython. On my computer here are the
lesshaste added the comment:
It might have been helpful to quote
[PyPy 2.3.0-alpha0 with GCC 4.8.2] on linux2
PyPy bug tracker
<https://bugs.pypy.org/issue1
lesshaste added the comment:
With Python 2.7.6 (e54a3b9abdc0, Apr 22 2014, 12:41:09) and
print timeit.repeat('from __main__ import rosen; import numpy as np; r =
np.arange(100); print rosen(r)' ,number = 50)
I get 3.6s for pypy.
I get 1.4s for cpython.
--
nosy: +lessha
lesshaste added the comment:
I notice that this still fails however.
assert(np.random.choice([None], replace=True) is None)
PyPy bug tracker
<https://bugs.pypy.org/issue1
lesshaste added the comment:
Seems to work now. Thanks!
PyPy bug tracker
<https://bugs.pypy.org/issue1727>
___
pypy-issue mailing list
pypy-issue@python.org
lesshaste added the comment:
Seems to work now. Thanks!
PyPy bug tracker
<https://bugs.pypy.org/issue1724>
___
pypy-issue mailing list
pypy-issue@python.org
lesshaste added the comment:
This may be more interesting...
==
FAIL: Check complex
--
Traceback (most recent call last):
File
"/home/raph/Downloads
New submission from lesshaste :
For example...
==
FAIL: Tests minimum and maximum.
--
Traceback (most recent call last):
File
"/home/raph/Downloads/pyp
New submission from lesshaste :
If you run
np.test('test_2d_w_missing')
You get "Arrays are not almost equal" failures. For example
==
FAIL: Test cov 1 1D varia
lesshaste added the comment:
This was using pypy-2.3-alpha-20140405-linux_x86_64-portable
--
status: unread -> chatting
PyPy bug tracker
<https://bugs.pypy.org/iss
New submission from lesshaste :
If you run np.test(verbose=2), it hangs on
test_large_fancy_indexing (numpy.lib.tests.test_regression.TestRegression) ...
--
messages: 6695
nosy: lesshaste, pypy-issue
priority: bug
status: unread
title: numpy: test hangs on test_large_fancy_indexing
lesshaste added the comment:
Oh that is my mistake. I didn't understand the numbering system. Thanks.
--
status: resolved -> chatting
PyPy bug tracker
<https://bugs.pypy.or
lesshaste added the comment:
pypy-2.2.1-linux_x86_64-portable/bin/my-pypy/bin$ ./pypy
Python 2.7.3 (87aa9de10f9ca71da9ab4a3d53e0ba176b67d086, Apr 09 2014, 14:10:47)
[PyPy 2.2.1 with GCC 4.8.2] on linux2
[...]
r
array([[ 41.87228011, 41.88910105, 49.68946342, ..., 53.14196743
New submission from lesshaste :
np.random.seed(22)
f = np.random.random_sample((1024, 16))
v = np.random.random_sample((16, 32))
r = np.empty((1024, 32))
for i in range(12):
np.dot(f, v, r)
r2 = np.dot(f, v, out=None)
r and r2 should now be equal but they are not.
--
messages
New submission from lesshaste :
March 15 daily snapshot
import numpy as np
np.random.choice([-1,0,0,1], size = 10)
Traceback (most recent call last):
File "", line 1, in
AttributeError: 'module' object has no attribute 'choice'
--
messages: 6675
nosy:
New submission from lesshaste :
March 15 pypy daily snapshot.
#!/usr/bin/python
import numpy as np
def asvoid(arr):
arr = np.ascontiguousarray(arr)
return arr.view(np.dtype((np.void, arr.dtype.itemsize * arr.shape[-1])))
def nodistinctcols(M):
MT = asvoid(M.T)
uniqs
New submission from lesshaste :
Using Mar 15 2014 daily snapshot.
>>>> import numpy as np
>>>> n=10
>>>> v = np.random.binomial(n,1/4,n)
Traceback (most recent call last):
File "", line 1, in
TypeError: 'NoneType' object is not callabl
New submission from lesshaste :
When I run the following simple code np.linalg.matrix_rank(M) on March 6 nightly
it fails with
AttributeError: 'module' object has no attribute 'svd_n'
--
files: circ-singular.py
messages: 6588
nosy: lesshaste, pypy-issue
prio
New submission from lesshaste :
When trying to run this simple (if slightly dumb) script using Thu Mar 6
nightly I get
AttributeError: 'module' object has no attribute 'correlate'
--
files: detectkbit.py
messages: 6567
nosy: lesshaste, pypy-issue
priority: feature
lesshaste added the comment:
This is using git clone https://bitbucket.org/pypy/numpy.git from December 12,
2013.
--
release: -> 2.2
status: unread -> chatting
PyPy bug tracker
<https://bugs.pypy.org/
New submission from lesshaste :
Some simple code fails with the error
Traceback (most recent call last):
File "app_main.py", line 72, in run_toplevel
File "counterfeit.py", line 9, in
F = np.matrix(list(itertools.product([0,1],repeat = n))).transpose()
File &qu
lesshaste added the comment:
Added C code to make a hash of arrays of strings to make it more apples and
apples with my original python code submission.
PyPy bug tracker
<https://bugs.pypy.org/issue1
lesshaste added the comment:
pypy uses about 2GB of RAM (on my 32 bit system) where the C code using around
750MB I think.
PyPy bug tracker
<https://bugs.pypy.org/issue1
lesshaste added the comment:
paste <(seq 2000) <(seq 2 2001) > largefile.txt
Then run the attached read.py. It takes about 40 seconds on my system and
simply
makes one large dict.
However the attached C code takes less than 10 seconds (code taken from public
forums o
lesshaste added the comment:
My fake data isn't very good as it gives you one value per key. Here is a
slightly better attempt.
perl -E 'say int rand 1e7, $", int rand 1e4 for 1 .. 1e7' > largefile.txt
--
status: unread -> chatting
___
New submission from lesshaste :
paste <(seq 2000) <(seq 2 2001) > largefile.txt
Then run the attached read.py. It takes about 1 minute on my system and simply
makes one large dict.
However the attached C code takes less than 10 seconds (code taken from public
forums on the
31 matches
Mail list logo
