On Feb 4, 3:34 pm, Gabriel Genellina [EMAIL PROTECTED] wrote:
En Mon, 04 Feb 2008 20:59:16 -0200, breal [EMAIL PROTECTED]
escribió:
I have a soap server written in Python that acts as an intermediary
between a web service and an InDesign server. The indesign server is
non-threaded, so
I have a soap server written in Python that acts as an intermediary
between a web service and an InDesign server. The indesign server is
non-threaded, so when all instances are used up I want to create a new
instance, get the pid, use the process, then kill it.
What is the best way to do this?
On Feb 4, 9:25 pm, Gabriel Genellina [EMAIL PROTECTED] wrote:
On 4 feb, 22:21, breal [EMAIL PROTECTED] wrote:
On Feb 4, 3:34 pm, Gabriel Genellina [EMAIL PROTECTED] wrote:
En Mon, 04 Feb 2008 20:59:16 -0200, breal [EMAIL PROTECTED]
escribió:
I have a soap server written in Python
I have a db table that holds a list of ports. There is a column
in_use that is used as a flag for whether the port is currently in
use. When choosing a port the table is read and the first available
port with in_use = 0 is used, updated to in_use = 1, used, then
updated to in_use = 0. I am
On Feb 20, 8:05 am, M.-A. Lemburg [EMAIL PROTECTED] wrote:
On 2008-02-20 16:24, breal wrote:
I have a db table that holds a list of ports. There is a column
in_use that is used as a flag for whether the port is currently in
use. When choosing a port the table is read and the first
Forgive me for this question which is most likely stupid...
How do I determine the number of bytes a string takes up? I have a
soap server that is returning a serialized string. It seems that when
the string goes over 65978 characters it does not return to the soap
client. Instead I get an
On Mar 27, 2:10 pm, John Machin [EMAIL PROTECTED] wrote:
On Mar 28, 6:45 am, breal [EMAIL PROTECTED] wrote:
Forgive me for this question which is most likely stupid...
The contents of your question are not stupid. The subject however does
invite a stupid answer like: len(the_string
I have a list that looks like the following
[(10, 100010), (15, 17), (19, 100015)]
I would like to be able to determine which of these overlap each
other. So, in this case, tuple 1 overlaps with tuples 2 and 3. Tuple
2 overlaps with 1. Tuple 3 overlaps with tuple 1.
In my
http://xkcd.com/353/
--
http://mail.python.org/mailman/listinfo/python-list
On Dec 18, 11:56 am, Bruno Desthuilliers
[EMAIL PROTECTED] wrote:
Breal a écrit :
http://xkcd.com/353/
Bad luck: it *is* a repost.
While we're at it, did you notice the alternate text for the image ?-)
Did not notice the alt text... friggin hilarious!!!
--
http://mail.python.org/mailman
I have three lists... for instance
a = ['big', 'small', 'medium'];
b = ['old', 'new'];
c = ['blue', 'green'];
I want to take those and end up with all of the combinations they
create like the following lists
['big', 'old', 'blue']
['small', 'old', 'blue']
['medium', 'old', 'blue']
['big', 'old',
On Jan 16, 11:33 am, Reedick, Andrew [EMAIL PROTECTED] wrote:
-Original Message-
From: [EMAIL PROTECTED] [mailto:python-
[EMAIL PROTECTED] On Behalf Of breal
Sent: Wednesday, January 16, 2008 2:15 PM
To: [EMAIL PROTECTED]
Subject: Creating unique combinations from lists
I
12 matches
Mail list logo
