2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2010,2011,2013, by the GROMACS development team, led by
5 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
6 * and including many others, as listed in the AUTHORS file in the
7 * top-level source directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
39 #include "types/simple.h"
40 #include "gmx_fatal.h"
42 /*Make range-array (Permutation identity) for sorting */
43 void rangeArray(int *ar, int size)
46 for (i = 0; i < size; i++)
52 void pswap(int *v1, int *v2)
61 void Swap (real *v1, real *v2)
71 void insertionSort(real *arr, int *perm, int startndx, int endndx, int direction)
77 for (i = startndx; i <= endndx; i++)
81 while (j > startndx && arr[j - 1] > arr[j])
83 Swap(&arr[j], &arr[j-1]);
84 pswap(&perm[j], &perm[j-1]);
94 for (i = startndx; i <= endndx; i++)
98 while (j > startndx && arr[j - 1] < arr[j])
100 Swap(&arr[j], &arr[j-1]);
101 pswap(&perm[j], &perm[j-1]);
110 int BinarySearch (real *array, int low, int high, real key, int direction)
116 /*Iterative implementation*/
123 if (key < array[mid-1])
135 else if (direction < 0)
140 if (key > array[mid-1])
151 } /*end -ifelse direction*/
156 int start_binsearch(real *array, int *perm, int low, int high,
157 real key, int direction)
159 insertionSort(array, perm, low, high, direction);
160 return BinarySearch(array, low, high, key, direction);
163 int LinearSearch (double *array, int startindx, int stopindx,
164 double key, int *count, int direction)
166 /*Iterative implementation - assume elements sorted*/
172 keyindex = startindx;
173 for (i = startindx; i <= stopindx; i++)
183 else if (direction < 0)
186 for (i = stopindx; i >= startindx; i--)
199 gmx_fatal(FARGS, "Startindex=stopindex=%d\n", startindx);