Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.000 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'duplicate': 0.07; 'memory.': 0.07; 'problem?': 0.07; 'ex:': 0.09; 'function,': 0.09; 'generators': 0.09; 'iterate': 0.09; 'objects,': 0.09; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'sequences.': 0.09; "'a',": 0.16; "'b'": 0.16; "'b',": 0.16; '(meaning': 0.16; "['a',": 0.16; 'called.': 0.16; 'iterator,': 0.16; 'itertools': 0.16; 'lambda:': 0.16; 'over:': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'shallow': 0.16; 'subject:skip:m 10': 0.16; 'there?': 0.16; 'wrote:': 0.18; 'memory': 0.22; 'header:User-Agent:1': 0.23; 'ist,': 0.24; 'right.': 0.26; 'header:X-Complaints-To:1': 0.27; 'header:In- Reply-To:1': 0.27; 'idea': 0.28; 'point': 0.28; 'am,': 0.29; 'array': 0.29; "doesn't": 0.30; 'consumption': 0.31; 'lists': 0.32; 'cases': 0.33; 'received:fr': 0.33; 'problem': 0.35; "can't": 0.35; 'objects': 0.35; 'but': 0.35; 'there': 0.35; 'thanks': 0.36; 'subject:?': 0.36; 'should': 0.36; 'two': 0.37; 'list': 0.37; 'generic': 0.38; 'product.': 0.38; 'to:addr:python- list': 0.38; 'pm,': 0.38; 'does': 0.39; 'sure': 0.39; 'to:addr:python.org': 0.39; 'received:org': 0.40; 'how': 0.40; 'even': 0.60; 'entire': 0.61; 'times': 0.62; 'making': 0.63; 'skip:n 10': 0.64; 'products': 0.71; 'received:109': 0.72; 'batchelder': 0.84; 'gelonida': 0.84; 'subject:space': 0.84 X-Injected-Via-Gmane: http://gmane.org/ To: python-list@python.org From: Gelonida N Subject: Re: Pythonic way to iterate through multidimensional space? Date: Wed, 08 Oct 2014 12:48:23 +0200 References: <20140806063923.750b81d6@bigbox.christie.dr> Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Gmane-NNTP-Posting-Host: 1-75-190-109.dsl.ovh.fr User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.6.0 In-Reply-To: X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 54 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1412765326 news.xs4all.nl 2961 [2001:888:2000:d::a6]:57026 X-Complaints-To: abuse@xs4all.nl Path: csiph.com!usenet.pasdenom.info!bete-des-vosges.org!feed.ac-versailles.fr!nerim.net!novso.com!newsfeed.xs4all.nl!newsfeed1a.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Xref: csiph.com comp.lang.python:78836 On 10/7/2014 1:01 PM, Ned Batchelder wrote: > On 10/7/14 2:10 AM, Gelonida N wrote: >> >> Disadvantage of itertools.product() is, that it makes a copy in memory. >> Reason ist, that itertools also makes products of generators (meaning of >> objects, that one can't iterate several times through) >> >> >> There are two use cases, that I occasionaly stumble over: >> >> One is making the product over lists(), >> product( list_of_lists ) >> >> ex: >> >> product( [ [1,2,3], ['A','B'], ['a', 'b', 'c'] ] ) >> >> the other one making a product over a list of functions, which will >> create generators >> >> ex: >> product( [ lambda: [ 'A', 'B' ], lambda: xrange(3) ] ) >> >> >> I personally would also be interested in a fast generic solution that >> can iterate through an N-dimensional array and which does not duplicate >> the memory or iterate through a list of generator-factories or however >> this would be called. > > itertools.product makes a copy of the sequences passed in, but it is a > shallow copy. It doesn't copy the objects in the sequences. It also > doesn't store the entire product. > > If you are calling product(j, k, l, m, n), where len(j)==J, the extra > memory is J+K+L+M+N, which is much smaller than the number of iterations > product will produce. Are you sure that much extra memory use is a > problem? How large are your lists that you are product'ing together? > Thanks for the clarification. You are right. Consumption of a shallow copy of each iterator, should not be a problem in the cases that I encountered so far. > I don't understand your point about a list of functions that create > generators? What is the problem there? > The idea was to even avoid the creation of a shallow copy, by having a function, that will return the same generator over and over again (thus no need for shallow copy)