Thanks.
=
To summarize: You use pointers to "individual record" arrays instead of
allocatable arrays. Allocate new pointers, make some of them point to the old
records, and deallocate the old pointers. Looks like a good solution - almost
obvious, once you have seen it.
=
There is still extra temporary space and copying required, but only for the
pointers instead of the entire data.
Loren P. Meissner
[log in to unmask]
> -----Original Message-----
> From: [log in to unmask]
> [mailto:[log in to unmask]]On Behalf Of Friedrich R.
> Hertweck
> Sent: Sunday, November 08, 1998 12:09 AM
> To: Loren P. Meissner
> Cc: A Fortran 90 Mailing List; Bart Childs
> Subject: Re: A little advice, please
>
>
> On Sat, 17 Oct 1998, Loren P. Meissner wrote:
>
> > I have just been communicating with a person about the problem of
> > reading a "huge" file of data when you can't predict in advance how big
> > it will be. For purposes of illustration, suppose that the idea is to do
> > an internal sort (say, Quicksort) after the data has been read in. I am
> > trying to compare two options:
> >
. . .
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|