include/nbsearch.h

   1 /*
   2  *
   3  *                This source code is part of
   4  *
   5  *                 G   R   O   M   A   C   S
   6  *
   7  *          GROningen MAchine for Chemical Simulations
   8  *
   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.
  13
  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.
  18  *
  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.
  25  *
  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.
  28  *
  29  * For more info, check our website at http://www.gromacs.org
  30  */
  31 /*! \file
  32  * \brief API for neighborhood searching.
  33  *
  34  * The API is documented in more detail on a separate page:
  35  * \ref nbsearch
  36  *
  37  * The functions within this file can be used independently of the other parts
  38  * of the library.
  39  * The library also uses the functions internally.
  40  */
  41 #ifndef NBSEARCH_H
  42 #define NBSEARCH_H
  43
  44 #include <typedefs.h>
  45
  46 #include <indexutil.h>
  47
  48 #ifdef __cplusplus
  49 extern "C" {
  50 #endif
  51
  52 struct gmx_ana_pos_t;
  53
  54 /** Data structure for neighborhood searches. */
  55 typedef struct gmx_ana_nbsearch_t gmx_ana_nbsearch_t;
  56
  57 /** Create a new neighborhood search data structure. */
  58 extern int
  59 gmx_ana_nbsearch_create(gmx_ana_nbsearch_t **d, real cutoff, int maxn);
  60 /** Free memory allocated for neighborhood search. */
  61 extern void
  62 gmx_ana_nbsearch_free(gmx_ana_nbsearch_t *d);
  63
  64 /** Initializes neighborhood search for a new frame. */
  65 extern int
  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.  */
  68 extern int
  69 gmx_ana_nbsearch_pos_init(gmx_ana_nbsearch_t *d, t_pbc *pbc,
  70                           struct gmx_ana_pos_t *p);
  71 /** Check whether a point is within a neighborhood. */
  72 extern bool
  73 gmx_ana_nbsearch_is_within(gmx_ana_nbsearch_t *d, rvec x);
  74 /** Check whether a position is within a neighborhood. */
  75 extern bool
  76 gmx_ana_nbsearch_pos_is_within(gmx_ana_nbsearch_t *d,
  77                                struct gmx_ana_pos_t *p, int i);
  78 /** Calculates the minimun distance from the reference points. */
  79 extern real
  80 gmx_ana_nbsearch_mindist(gmx_ana_nbsearch_t *d, rvec x);
  81 /** Calculates the minimun distance from the reference points. */
  82 extern real
  83 gmx_ana_nbsearch_pos_mindist(gmx_ana_nbsearch_t *d,
  84                              struct gmx_ana_pos_t *p, int i);
  85
  86 #ifdef __cplusplus
  87 }
  88 #endif
  89
  90 #endif