Am 11.10.2010 06:24, schrieb Denis Gomes:
Hi Everyone,
I have a basic python question. I am writing an n dimensional vector
class by inheriting from the builtin python list object. I want to be
able to hide the parent object's methods in the derived class instances.
Why inheriting then?
A
Hi Everyone,
I have a basic python question. I am writing an n dimensional vector
class by inheriting from the builtin python list object. I want to be
able to hide the parent object's methods in the derived class instances.
I know I can overload the method in the derived class and raise some
Hello all.
I am new to Python.
I have been reading and studying most of the information I have found
on the site. I really like what I have seen until now.
I was wondering if you can help on this.
I am in the process of leaving Windows as my environment and moving
to Ubuntu or a Mac. For a
On 2:59 PM, Alan Gauld wrote:
"Francesco Loffredo" wrote
did, Roelof's code would work perfectly, and you could store in a list
all the subsequent changes of a dictionary without calling them with
different names.
You don;'t need dfifferent names. Provided the name creates a
new object ins
Emile beat me to it, but here goes anyway...
On 10/10/2010 3:35 PM, Josep M. Fontana wrote:
Hi,
First let me apologize for taking so long to acknowledge your answers
and to thank you (Eduardo, Peter, Greg, Emile, Joel and Alan, sorry if
I left anyone) for your help and your time.
One of th
"Francesco Loffredo" wrote
did, Roelof's code would work perfectly, and you could store in a
list
all the subsequent changes of a dictionary without calling them with
different names.
You don;'t need dfifferent names. Provided the name creates a
new object inside the loop you can reuse the
On 10/10/2010 12:35 PM Josep M. Fontana said...
OK. Let's start with -b- . My first problem is that I don't really know how
to go about building a dictionary from the file with the comma separated
values. I've discovered that if I use a file method called 'readlines' I can
create a list whose el
Hi,
First let me apologize for taking so long to acknowledge your answers and to
thank you (Eduardo, Peter, Greg, Emile, Joel and Alan, sorry if I left
anyone) for your help and your time.
One of the reasons I took so long in responding (besides having gotten busy
with some urgent matters related
On 09/10/2010 10.25, Alan Gauld wrote:
"Francesco Loffredo" wrote
> On the next iteration you overwrite those two dictionaries
> with new values then append them to the list again.
> So you wind up with 2 copies of the updated dictionaries.
> ...
This is difficult for me too: why does this hap
Thanks a lots. it's really helpful,, I am reading it
--
From: "Emile van Sebille"
Sent: Sunday, October 10, 2010 11:51 PM
To:
Subject: Re: [Tutor] OpenMP
On 10/9/2010 9:45 PM Ahmed AL-Masri said...
Thanks for fast responding. I will try to use
On 10/9/2010 9:45 PM Ahmed AL-Masri said...
Thanks for fast responding. I will try to use the threads and see how the
performance would be.. actually I am using that for my artificial neural
network and the problem is regarding to the ANN limitation when I used a
big
no of inputs. so one way to
"Steven D'Aprano" wrote
Only if glob now descends into the file system... which is why
you'd
choose os.walk instead.
Do you mean you want to point at a single directory and have it
search
any and all subdirectories, no matter how deeply nested? Well, yes,
that would be a good use-case for
12 matches
Mail list logo
