Now if a company would pay developers to evolve wxpython in such a toolkit... i-village idea might be feasible. Robin said "my dream is to find a way to work full-time on developing, supporting and writing about wxPython and still be able to pay the mortgage and put food on the table" I might add that this is a dream I share, I too would like to see Robin working full time on wxpython BUT the key is to get a guy like this: http://www.markshuttleworth.com/bounty.html
to share the dream
Yes perhaps. I don't know how much dow Mark Shuttleworth (his real name?) actually got from selling Thawte to Verisign, but with only 100k$ budget to spread around for a full year, I think it's going to spread pretty thin indeed. I applaud the effort, but "realistically" I wonder how much mileage he will get out of it. Better than nothing, agreed, but is this the answer?
My own idea would be to have a guy like "this" share the dream: http://www.microsoft.com/billgates/default.asp
Now if a company would pay developers to evolve wxpython in such a toolkit... i-village idea might be feasible. Robin said "my dream is to find a way to work full-time on developing, supporting and writing about wxPython and still be able to pay the mortgage and put food on the table" I might add that this is a dream I share, I too would like to see Robin working full time on wxpython BUT the key is to get a guy like this: http://www.markshuttleworth.com/bounty.html
to share the dream
Yes perhaps. I don't know how much dow Mark Shuttleworth (his real name?) actually got from selling Thawte to Verisign, but with only 100k$ budget to spread around for a full year, I think it's going to spread pretty thin indeed. I applaud the effort, but "realistically" I wonder how much mileage he will get out of it. Better than nothing, agreed, but is this the answer?
It also agreed to acquire closely held Thawte Consulting, a provider of digital certificate software based in South Africa, for $575 million in VeriSign stock. The exact number of shares would be based on VeriSign's closing price on the day the deal closed.
Mark Shuttleworth does other bigger forms of sponsorship too, via the Shuttleworth Foundation, like http://www.go-opensource.org/
The bounties are basically for things he would like to have done personally...
David
Hi
On windows XP with 512MB RAM the following code crashes after about 300
iteration of the outer loop. Each dataset is in the form of data for a
grid table and contains about 5000 rows. Task manager does not show any
excessive memory use prior to the crash.
Any ideas would be much appreciated.
Greg
def matchGrids(parent, dat1, dat2, colnames):
'Loops down sets and if 2 cols match deletes rows'
for r in dat1:
a = r[1].get(colnames[0], None)
b = r[1].get(colnames[1], None)
for s in dat2:
c = s[1].get(colnames[0], None)
d = s[1].get(colnames[1], None)
if int(a) == int(c) and b == d: #Remove rows from both sets
dat1.remove(r)
dat2.remove(s)
break
Hi
On windows XP with 512MB RAM the following code crashes after about 300
iteration of the outer loop. Each dataset is in the form of data for a
grid table and contains about 5000 rows. Task manager does not show any
excessive memory use prior to the crash.
Any ideas would be much appreciated.
Greg
def matchGrids(parent, dat1, dat2, colnames):
'Loops down sets and if 2 cols match deletes rows'
for r in dat1:
a = r[1].get(colnames[0], None)
b = r[1].get(colnames[1], None)
for s in dat2:
c = s[1].get(colnames[0], None)
d = s[1].get(colnames[1], None)
if int(a) == int(c) and b == d: #Remove rows from both sets
dat1.remove(r)
dat2.remove(s)
break
Well, I would just rewrite the loop. It will be very inefficient anyway.
Much better to put the contents of dat1 into a dictionary, with key being
a tuple (a, b) and value being the index (or object) in dat1. Then loop on
dat2 and look up every item in the dictionary. If you find a duplicate,
remove from dat2 and also from dat1.
In Wednesday, June 2, 2004, 8:56:50 AM, Greg wrote:
Hi
On windows XP with 512MB RAM the following code crashes after about 300
iteration of the outer loop. Each dataset is in the form of data for a
grid table and contains about 5000 rows. Task manager does not show any
excessive memory use prior to the crash.
Any ideas would be much appreciated.
Greg
def matchGrids(parent, dat1, dat2, colnames):
'Loops down sets and if 2 cols match deletes rows'
for r in dat1:
a = r[1].get(colnames[0], None)
b = r[1].get(colnames[1], None)
for s in dat2:
c = s[1].get(colnames[0], None)
d = s[1].get(colnames[1], None)
if int(a) == int(c) and b == d: #Remove rows from both sets
dat1.remove(r)
dat2.remove(s)
break
Python doesn't like removing items from an object you are iterating
over. The solution below is pretty time-consuming, but should give you
the desired results:
def matchGrids(parent, dat1, dat2, colnames):
'Loops down sets and if 2 cols match deletes rows'
d1t = ; d2t =
for r in dat1:
a = r[1].get(colnames[0], None)
b = r[1].get(colnames[1], None)
for s in dat2:
c = s[1].get(colnames[0], None)
d = s[1].get(colnames[1], None)
if int(a) == int(c) and b == d:
d1t.append(r)
d2t.append(s)
break
