Dear Jesse,
thanks for the hint.
I see you are already assigned to the FIFO bug
(http://bugs.python.org/issue4999), so I won't burden you even more.
Clearly, a reliable FIFO behavior of multiprocessing.Queue helps more
than a priority queue, since it can be used to build one, so that
should r
On 2009-05-10 09:24:36 +0200, Piet van Oostrum said:
These days ElementTree is considered the most pythonic way.
http://docs.python.org/library/xml.etree.elementtree.html
There is also a reimplementation of the ElementTree API based on libxml2
and libxslt, which has more features but require
The Queue module, apparently, is thread safe, but *not* process safe.
If you try to use an ordinary Queue, it appears inaccessible to the
worker process. (Which, after all, is quite logical, since methods for
moving items between the threads of the same process are quite
different from inter-pr
Scott David Daniels wrote:
>
> ? "one producer, many consumers" ?
> What would the priority queue do? Choose a consumer?
Sorry, I should have provided a little more detail. There is one
producer thread, reading urls from multiple files and external input.
These urls have a certain priority, and
consumers" type multiprocessing setup would
be welcomed!
:|
On 2009-05-09 18:42:34 +0200, uuid said:
Hello,
I was wondering whether there was a way to make multiprocessing.Queue
behave in a priority queue-like fashion. Subclassing with heappush and
heappop for put and get doesn
Hello,
I was wondering whether there was a way to make multiprocessing.Queue
behave in a priority queue-like fashion. Subclassing with heappush and
heappop for put and get doesn't work the old way (multiprocessing.Queue
seems to use different data structures than Queue.Queue?)
Could one creat
My first intuition would be that - even if it works - this would break
future OS X updates, since you're probably not fixing the receipt files.
On 2009-04-29 23:43:34 +0200, Omita said:
However, as I am using OSX Server I would ideally like the install
location to be here:
/System/Library/F
On 2009-04-28 16:18:43 +0200, John Posner said:
Don't be disheartened! Many people -- myself included, absolutely! --
occasionally let a blind spot show in their messages to this list.
Thanks for the encouragement :)
BTW:
container[:] = sorted(container, key=getkey)
... is equivalent
I am at the same time impressed with the concise answer and
disheartened by my inability to see this myself.
My heartfelt thanks!
On 2009-04-28 10:06:24 +0200, Andre Engels said:
When sorting strings, including strings that represent numbers,
sorting is done alphabetically. In this alphabeti
I would be very interested in a logical explanation why this happens on
python 2.5.1:
In order to sort an etree by the .text value of one child, I adapted
this snippet from effbot.org:
import xml.etree.ElementTree as ET
tree = ET.parse("data.xml")
def getkey(elem):
return elem.findtext
10 matches
Mail list logo
