By the way, the error was generated by following the tutorial and
compiling in lazarus
> After Much Looking and pointers from the author, There is this most
> excellent post by the same author at
>
> http://wiki.lazarus.freepascal.org/Developing_Python_Modules_with_Pascal
>
> This nearly works b
After Much Looking and pointers from the author, There is this most
excellent post by the same author at
http://wiki.lazarus.freepascal.org/Developing_Python_Modules_with_Pascal
This nearly works but I have issue with the linking of the new module. The
error is
Linking PyMinMod.so
/usr/bin/ld: P
Hi people
Is there a Method for wrapping delphi and/or pascal code into python like
SWIG?
I've googled to no avail, Can anyone help me?
Andy
___
Tutor maillist - Tutor@python.org
http://mail.python.org/mailman/listinfo/tutor
Hi people,
After watching a nice Google video on Python 3K, and seeing the
forthcoming removal of range, I've looked at substitution range with
xrange within my code. Direct substitution works for 90% percent of the
case (i.e. for thing in xrange(number): ), however i can't change the
examp
Hi people
Is there a way to use a list with printf formating without having to
explicitly expanding the list after the %
e.g
a = [1, 2, 3]
print """ Testing
%i, %i, %i """ %(a[0], a[1], a[2])
Cheers
Andy
___
Tutor maillist - Tut
That's great and it works too, thank you!
My only arising question is why should i
"derive from object, so that you get a new-style class."
I've looked online and found this
(http://www.geocities.com/foetsch/python/new_style_classes.htm) but I
not sure it tells why I would want to do this this
Hi people
I've written a complex program in python/numpy/scipy which creates a
dictionary of objects(which takes a while to create). I am hoping to
save these objects to disk and then access them using a different
session, thus bypassing the time to create the objects.
My initial tests using p
Dear nice people
I'm trying to match a row (b) within a large numpy array (a). My most
successful attempt is below
hit = equal(b, a)
total_hits = add.reduce(hit, 1)
max_hit = argmax(total_hits, 0)
answer = a[max_hit]
where ...
a = array([[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
I think you could use sets, (I asked a similar question a few days ago
re numpy arrays).
ie
Convert both list to sets
use Set intersection
convert answer to lists
HTH
Andy
Tom Fitzhenry wrote:
> On Fri, Aug 10, 2007 at 02:54:44AM -0700, Jaggo wrote:
>> Can anyone think of any better way?
>
> If
Andy
Bob Gailer wrote:
> Eric Brunson wrote:
>> Bob Gailer wrote:
>>> Andy Cheesman wrote:
>>>
>>>> Hi people,
>>>>
>>>> If I've two numpy arrays, is there a non-looping way of finding common
>>>> values. (the exam
Hi people,
If I've two numpy arrays, is there a non-looping way of finding common
values. (the example below has identical shapes for the arrays but this
may not be the case in my scenario)
e.g
a = array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
b = array([ 5, 6, 7, 8, 9, 10, 11, 12, 13, 14])
answer =
Thanks for your help Kent
The error was that I was trying to assign to a non-assignable reference
as you highlighted. Everything works now
Thanks
Andy
Kent Johnson wrote:
> Andy Cheesman wrote:
>> for thing in ["top", "right", "bottom", "left&
Dear people,
Sorry for the vague title, I'm struggling to define the problem but an
example will be better/clearer.
If I've a list of strings, which relate to objects(lists) elsewhere in
my code, I can call list action fine within the loop but I was wondering
how do I apply an external function as
Dear People,
I wondering if any of you lovely people can make a suggestion on a
problem which I have with a n dimensional array.
For example, I've a 3x3 array and I have been mapping an element from 1D
to the one directly above it. 3->12
0 1 2
3 4 5
6 7 8
9 10 11
12 13 14
15 16 17
The problem
Hi people
Thanks to people's most excellent help with the Automatic generation of
an "all possible combinations" array. I've got a beta version of my
program working.
However, I was wondering if there is an "easy" way to animate changes
between arrays and to show the number of the loop which the p
urn map(lambda x: x+[0], recursive_bit_list(n-1)) + \
> map(lambda x: x+[1], recursive_bit_list(n-1))
>
> Hope this helps!
>
> -Hugh
>
>
> On 6/14/07, *Andy Cheesman* <[EMAIL PROTECTED]
> <mailto:[EMAIL PROTECTED]>> wrote:
>
>
Hi people
I am trying to generate an array of all possible combinations of 1, and
zeros (see example data) for a rather nice Kinetic mote Carlo program
which I am writing python. So far, I've been working out for
combinations for 4 or less species by hand as it is quick! but I am
looking to automa
Dear People
Silly question, I'm using Ipython and importing python modules which
I've written. After a code modification, is there an easy, quick way to
refresh changed modules?
I've googled for the solutions but the answers does not seem clear!
Andy
_
18 matches
Mail list logo