when not to use queue, it is faster now
for ii in getcombinations():
item = ii
On Friday, October 14, 2016 at 5:11:35 PM UTC+8, meInvent bbird wrote:
> succeed to run,
> is it the yield return the whole list 2000 * 2000 * 2000 items?
> as i know that yield is return [1,1,1] etc one by one once it get
> if it return 2000*2000*2000 items, why?
> i have to add a queue get this yield in order to succeed
> but i do not understand the situation when
> using queue and yield at the same time
> will the speed same as the situation that no yield?
> while True:
> if q.qsize() > 0:
> item = q.get()
> #item = getcombinations()