[gmx-users] dynamic selection memory allocation problem

[Teemu Murtola]

My point about being non-illustrative was that it is impossible for people
to suggest alternative solutions if they don't know what you are trying to
achieve. If you really want to calculate the same distance multiple times,
I'd suggest to calculate it just once, and have a postprocessing script to
duplicate it in the output.
On Jun 27, 2014 4:28 PM, "gigo" <gigo at ibb.waw.pl> wrote:

> Dear Teemu,
> Thank you for your reply.
>
>  Please file a report a <http://redmine.gromacs.org> with files and the
>> exact selection necessary to reproduce the problem (a single .gro
>> structure
>> is likely sufficient).
>>
>
> I will do so.
>
>  While your approach is likely a very inefficient way
>> to use the selections (plus/merge is not designed for massive copying, and
>> your selection probably evaluates some parts multiple times over all the
>> atoms in the system), it would be useful to find out what is the actual
>> problem.
>>
>
> OK. What approach would you suggest for calculating many distances without
> writing an index file then?
>
>  Your example is not particularly illustrative, as there is no point in
>> computing the same distance 15 times...
>>
>
> The purpose of the example was to show that the dynamic selection
> mechanism has a limited capacity in terms of the length of the input
> string, and not to show that my research is of any value for anybody. Id
> did the job, so it was illustrative.
>
> Thank you once more,
>
> g
>
> --
> Gromacs Users mailing list
>
> * Please search the archive at http://www.gromacs.org/
> Support/Mailing_Lists/GMX-Users_List before posting!
>
> * Can't post? Read http://www.gromacs.org/Support/Mailing_Lists
>
> * For (un)subscribe requests visit
> https://maillist.sys.kth.se/mailman/listinfo/gromacs.org_gmx-users or
> send a mail to gmx-users-request at gromacs.org.
>