comp.lang.idl-pvwave archive: archive » Re: Efficient sub array extraction

Home » Public Forums » archive » Re: Efficient sub array extraction

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Efficient sub array extraction [message #82423 is a reply to message #82421]

Tue, 11 December 2012 14:34

Phillip M. Bitzer
Messages: 7
Registered: September 2012

Junior Member

In short, array subscripting can take up a lot of memory. Take a peek at:

http://www.idlcoyote.com/misc_tips/submemory.html

There's some helpful information by none other than JD Smith.

On 12/11/12 4:26 PM, markjamie@gmail.com wrote:
> I'm using large 2D arrays e.g 30000 x 30000 and need to remove a 2D sub array for later processing e.g. Rows 30-700 and columns 100-10000.
>
> Is there a more efficient way to do this than using subscript ranges?
>
> For example?
>
> Subarray = largearray[100:10000, 30:700]
>
>
> The exact code I'm using is as follows:
>
> A = [100,10000]
> B = [30,700]
>
> Subarray = largearray[A[0]:A[1],B[0]:B[1]]
>
> Mark
>

Report message to a moderator

[Message index]

		Re: Efficient sub array extraction By: Heinz Stege on Wed, 12 December 2012 08:01
		Re: Efficient sub array extraction By: markjamie on Tue, 11 December 2012 16:00
		Re: Efficient sub array extraction By: Heinz Stege on Tue, 11 December 2012 15:41
		Re: Efficient sub array extraction By: David Fanning on Tue, 11 December 2012 15:40
		Re: Efficient sub array extraction By: Phillip M. Bitzer on Tue, 11 December 2012 14:34

Previous Topic:	Re: increment an array subset based on another subset
Next Topic:	Re: array manipulation (TOTAL-ing or MEDIAN-ing) in uneven bins

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 15:57:41 PDT 2025

Total time taken to generate the page: 0.00386 seconds