2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2012, by the GROMACS development team, led by
5 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
6 * others, as listed in the AUTHORS file in the top-level source
7 * 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.
35 #include "gmx_lapack.h"
37 void F77_FUNC(dlasrt2,DLASRT2)(const char *id,
60 if (*id=='D' || *id=='d')
62 else if (*id=='I' || *id=='i')
83 start = stack[(stkpnt << 1) - 2];
84 endd = stack[(stkpnt << 1) - 1];
86 if (endd - start > 0) {
91 for (i__ = start + 1; i__ <= i__1; ++i__) {
93 for (j = i__; j >= i__2; --j) {
94 if (d__[j] > d__[j - 1]) {
110 for (i__ = start + 1; i__ <= i__1; ++i__) {
112 for (j = i__; j >= i__2; --j) {
113 if (d__[j] < d__[j - 1]) {
128 } else if (endd - start > 20) {
132 i__ = (start + endd) / 2;
137 } else if (d3 < d2) {
145 } else if (d3 < d1) {
159 if (d__[j] < dmnmx) {
164 if (d__[i__] > dmnmx) {
176 if (j - start > endd - j - 1) {
178 stack[(stkpnt << 1) - 2] = start;
179 stack[(stkpnt << 1) - 1] = j;
181 stack[(stkpnt << 1) - 2] = j + 1;
182 stack[(stkpnt << 1) - 1] = endd;
185 stack[(stkpnt << 1) - 2] = j + 1;
186 stack[(stkpnt << 1) - 1] = endd;
188 stack[(stkpnt << 1) - 2] = start;
189 stack[(stkpnt << 1) - 1] = j;
198 if (d__[j] > dmnmx) {
203 if (d__[i__] < dmnmx) {
215 if (j - start > endd - j - 1) {
217 stack[(stkpnt << 1) - 2] = start;
218 stack[(stkpnt << 1) - 1] = j;
220 stack[(stkpnt << 1) - 2] = j + 1;
221 stack[(stkpnt << 1) - 1] = endd;
224 stack[(stkpnt << 1) - 2] = j + 1;
225 stack[(stkpnt << 1) - 1] = endd;
227 stack[(stkpnt << 1) - 2] = start;
228 stack[(stkpnt << 1) - 1] = j;