Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Christian Gollwitzer Newsgroups: comp.lang.python Subject: Re: list comprehension return a list and sum over in loop Date: Fri, 12 Dec 2014 10:09:17 +0100 Organization: A noiseless patient Spider Lines: 16 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 12 Dec 2014 09:08:59 +0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="0e5522bc36df6ad040e4598fab9db9ed"; logging-data="4356"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+S1v28cySNDt7zUhZH7Yw8/CdYul/1e8E=" User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:24.0) Gecko/20100101 Thunderbird/24.6.0 In-Reply-To: Cancel-Lock: sha1:baHWfV4X3K4EAc2el/F5elebqk8= Xref: csiph.com comp.lang.python:82428 Am 12.12.14 09:30, schrieb KK Sasa: > Mark Lawrence於 2014年12月12日星期五UTC+8下午3時17分43秒寫道: > Hi Mark and Yotam, Thanks for kind reply. I think I didn't make my > problem clear enough. The slow part is "[d2(t[k]) for k in > xrange(1000)]". In addition, I don't need to construct a list of 1000 > lists inside, but my aim is to get the sum of all "d2(t[k])". I > wonder if there is any method to sum up efficiently. Not sure I understand what you need, but it seems that NumPy would be a more efficient method. numpy.sum can sum elements along every dimensions of a higher-dimensional matrix, and in general NumPy stores the elements in native doubles instead of Python lists, which improves both performance and memory usage Christian