3 * This source code is part of
7 * GROningen MAchine for Chemical Simulations
9 * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
10 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
11 * Copyright (c) 2001-2009, The GROMACS development team,
12 * check out http://www.gromacs.org for more information.
14 * This program is free software; you can redistribute it and/or
15 * modify it under the terms of the GNU General Public License
16 * as published by the Free Software Foundation; either version 2
17 * of the License, or (at your option) any later version.
19 * If you want to redistribute modifications, please consider that
20 * scientific software is very special. Version control is crucial -
21 * bugs must be traceable. We will be happy to consider code for
22 * inclusion in the official distribution, but derived work must not
23 * be called official GROMACS. Details are found in the README & COPYING
24 * files - if they are missing, get the official version at www.gromacs.org.
26 * To help us fund GROMACS development, we humbly ask that you cite
27 * the papers on the package - you can find them in the top README file.
29 * For more info, check our website at http://www.gromacs.org
32 * \brief API for neighborhood searching.
34 * The API is documented in more detail on a separate page:
37 * The functions within this file can be used independently of the other parts
39 * The library also uses the functions internally.
46 #include "indexutil.h"
54 /** Data structure for neighborhood searches. */
55 typedef struct gmx_ana_nbsearch_t gmx_ana_nbsearch_t
;
57 /** Create a new neighborhood search data structure. */
59 gmx_ana_nbsearch_create(gmx_ana_nbsearch_t
**d
, real cutoff
, int maxn
);
60 /** Free memory allocated for neighborhood search. */
62 gmx_ana_nbsearch_free(gmx_ana_nbsearch_t
*d
);
64 /** Initializes neighborhood search for a new frame. */
66 gmx_ana_nbsearch_init(gmx_ana_nbsearch_t
*d
, t_pbc
*pbc
, int n
, rvec x
[]);
67 /** Initializes neighborhood search for a frame using \c gmx_ana_pos_t. */
69 gmx_ana_nbsearch_pos_init(gmx_ana_nbsearch_t
*d
, t_pbc
*pbc
,
70 struct gmx_ana_pos_t
*p
);
71 /** Sets the exclusions for the next neighborhood search. */
73 gmx_ana_nbsearch_set_excl(gmx_ana_nbsearch_t
*d
, int nexcl
, int excl
[]);
74 /** Check whether a point is within a neighborhood. */
76 gmx_ana_nbsearch_is_within(gmx_ana_nbsearch_t
*d
, rvec x
);
77 /** Check whether a position is within a neighborhood. */
79 gmx_ana_nbsearch_pos_is_within(gmx_ana_nbsearch_t
*d
,
80 struct gmx_ana_pos_t
*p
, int i
);
81 /** Calculates the minimun distance from the reference points. */
83 gmx_ana_nbsearch_mindist(gmx_ana_nbsearch_t
*d
, rvec x
);
84 /** Calculates the minimun distance from the reference points. */
86 gmx_ana_nbsearch_pos_mindist(gmx_ana_nbsearch_t
*d
,
87 struct gmx_ana_pos_t
*p
, int i
);
88 /** Finds the first reference position within the cutoff. */
90 gmx_ana_nbsearch_first_within(gmx_ana_nbsearch_t
*d
, rvec x
, int *jp
);
91 /** Finds the first reference position within the cutoff. */
93 gmx_ana_nbsearch_pos_first_within(gmx_ana_nbsearch_t
*d
,
94 struct gmx_ana_pos_t
*p
, int i
, int *jp
);
95 /** Finds the next reference position within the cutoff. */
97 gmx_ana_nbsearch_next_within(gmx_ana_nbsearch_t
*d
, int *jp
);