Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!jato!vsnyder
From: vsnyder@jato.jpl.nasa.gov (Van Snyder)
Newsgroups: comp.lang.fortran
Subject: Re: NAG Fortran 90 announcement
Message-ID: <1991Jun26.003429.6364@jato.jpl.nasa.gov>
Date: 26 Jun 91 00:34:29 GMT
References: <15634@exodus.Eng.Sun.COM> <26334@lanl.gov> <PRZEMEK.91Jun24225047@rrdstrad.nist.gov>
Reply-To: vsnyder@jato.Jpl.Nasa.Gov (Van Snyder)
Organization: Jet Propulsion Laboratory, Pasadena, CA
Lines: 19

In article <PRZEMEK.91Jun24225047@rrdstrad.nist.gov> przemek@rrdstrad.nist.gov (Przemek Klosowski) writes:
[stuff deleted]
>  In the case of my friend's code, a lot of time was spent in
>calculating distances between particles. Many of these calculations
>were unnecessary because the particles were far apart. If I were
>writing in C, I would venture to create linked lists of particle
>clusters, "topologically" limiting the interactions to clusters of particles
>that are known to lie close to each other (a la Jon Bentley). I do not
>know of a good way of expressing such things in Fortran (flameproof suit on)
>
>		przemek
>--
Flameproof suit or none, linked lists in F90 are no more difficult
than in C (although sometimes a bit more wordy).

-- 
vsnyder@jato.Jpl.Nasa.Gov
ames!elroy!jato!vsnyder
vsnyder@jato.uucp