My student and I are writing a C extension that produces a large
integer in binary which we'd like to convert to a python long. The
number of bits can be a lot more than 32 or even 64. My student found
the function _PyLong_FromByteArray in longobject.h which is exactly
what we need, but the
Bryan [EMAIL PROTECTED] writes:
on the python wiki
NumArray is the current reimplementation of NumPy.
http://wiki.python.org/moin/NumArray
so, was Numarray written *before* NumPY, or was it a reimplementation of
NumPy
which implies it came *after* NumPy?
I clarified that wiki page to
Raymond Hettinger [EMAIL PROTECTED] writes:
Felipe Almeida Lessa writes:
I love benchmarks, so as I was testing the options, I saw something very
strange:
$ python2.4 -mtimeit 'x = range(10); '
100 loops, best of 3: 6.7 msec per loop
$ python2.4 -mtimeit 'x = range(10); del
Felipe Almeida Lessa [EMAIL PROTECTED] writes:
I love benchmarks, so as I was testing the options, I saw something very
strange:
$ python2.4 -mtimeit 'x = range(10); '
100 loops, best of 3: 6.7 msec per loop
$ python2.4 -mtimeit 'x = range(10); del x[:]'
100 loops, best of 3: 6.35
Peter Otten [EMAIL PROTECTED] writes:
Steven D'Aprano wrote:
When using the timeit module, you pass the code you
want to time as strings:
...
This is all very well, but it feels quite unnatural to
me. Why am I passing strings around when functions are
first class objects? Have I missed
James Stroud [EMAIL PROTECTED] writes:
I'm very curious about what is going on here. I'm sure my curiosity has
something to do with ignorance of some fundamental concept of computer
science (maybe that 8 is just a vertical infinity?):
py b = '\xb6'
py b[0]
'\xb6'
py b[0][0]
'\xb6'
ross [EMAIL PROTECTED] writes:
What are the ideal languages for the following examples?
1. Starting from a certain folder, look in the subfolders for all
filenames matching *FOOD*.txt Any files matching in each folder should
be copied to a new subfolder within the current folder called
Ron Adam [EMAIL PROTECTED] writes:
So it seems using 0's for the missing day or month may be how to do it.
This doesn't allow more specific amounts of ambiguity. I suggest
either a pair of dates, which represent the earliest and latest that
the event could have been (and are equal if there is
andrea crotti [EMAIL PROTECTED] writes:
Hi everbybody again,
I have a little problem, I don't understand the reason of this:
a = [10,1,2,3]
def foo():
global a
for n in range(len(a)):
a[n] = a[n]*2
If I type the above, and then call foo, I get what looks like
reasonable output:
djw [EMAIL PROTECTED] writes:
Paul Rubin wrote:
Stelios Xanthakis [EMAIL PROTECTED] writes:
- The demo is an x86/linux binary only. You shouldn't trust binaries,
run it in a chrooted environment not as root!
Are you going to release the source? If not, it's a lot less interesting.
Roel Schroeven [EMAIL PROTECTED] writes:
There's no level 12 yet though.
Now there's a 12 and a 13 (at least!).
Dan
--
http://mail.python.org/mailman/listinfo/python-list
Jeremy Sanders [EMAIL PROTECTED] writes:
Veusz 0.5
-
Velvet Ember Under Sky Zenith
-
http://home.gna.org/veusz/
Veusz is a scientific plotting package written in Python (currently
100% Python). It uses PyQt for display and user-interfaces, and
numarray
Bill Mill [EMAIL PROTECTED] writes:
Bill Mill [EMAIL PROTECTED] writes:
I would profile your app to see that it's your append which is taking
ages, but to preallocate a list of strings would look like:
[This is an average length string for i in range(approx_length)]
I don't think there's
13 matches
Mail list logo
