_list:
function_tuple[0].put((True, data, 1, addr, 5.0))
self.lock.release()
time.sleep(.1)
for sock in self.socket_list:
sock.close()
self.socket_list = []
Thanks,
nnp
--
http://www.smashthestack.org
http://www.unprotectedhex.com
--
Hey,
I'm currently working with propositional boolean formulae of the type
'A & (b -> c)' (for example). I was wondering if anybody knows of a
Python library to create parse trees and convert such formulae to
conjunctive, disjunctive and Tseitin normal forms?
Have a read of this http://www.b-list.org/weblog/2008/dec/05/python-3000/
It's a response to questions similar to yours by James Bennett
On Sun, Dec 7, 2008 at 7:22 PM, walterbyrd <[EMAIL PROTECTED]> wrote:
> IMO: breaking backward compatibility is a big deal, and should only be
> done when it is
I've tried Wing but not NetBeans. I would personally recommend Eclipse
with the PyDev plugin. I prefer it to Wing by *far* and if you prefer
Eclipse to NetBeans for Java then it might be worth your while
checking it out. If you take a few minutes to learn a few of the
shortcuts in Eclipse you can r
r are there any known
bugs with Python's Queue module that could lead to this kind of behaviour?
-nnp
--
http://www.smashthestack.org
http://www.unprotectedhex.com
--
http://mail.python.org/mailman/listinfo/python-list
;t be much point.
Cheers,
nnp
On Thu, Apr 3, 2008 at 5:39 AM, Gabriel Genellina <[EMAIL PROTECTED]>
wrote:
> En Wed, 02 Apr 2008 10:52:08 -0300, nnp <[EMAIL PROTECTED]> escribió:
>
> > Basically I have a system where component 1, 2 and 3 communicate with
> > each
>
