00001 /* 00002 COSTA: Problem solving environment for data assimilation 00003 Copyright (C) 2007 Nils van Velzen 00004 00005 This library is free software; you can redistribute it and/or 00006 modify it under the terms of the GNU Lesser General Public 00007 License as published by the Free Software Foundation; either 00008 version 2.1 of the License, or (at your option) any later version. 00009 00010 This library is distributed in the hope that it will be useful, 00011 but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00013 Lesser General Public License for more details. 00014 00015 You should have received a copy of the GNU Lesser General Public 00016 License along with this library; if not, write to the Free Software 00017 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00018 */ 00019 00020 /** 00021 \file cta_util_sort.h 00022 \brief Interface to the sorting utility functions of COSTA. 00023 This header file handles the C/FORTRAN interfacing 00024 */ 00025 00026 #ifndef CTA_UTILSORT_H 00027 #define CTA_UTILSORT_H 00028 00029 #include "cta_system.h" 00030 00031 00032 #define CTA_IQSort2 F77_FUNC(cta_iqsort2,CTA_IQSORT2) 00033 #ifdef __cplusplus 00034 extern "C" /* prevent C++ name mangling */ 00035 #endif 00036 00037 /** \brief Sort an integer array using the Quicksort algorithm. 00038 * An additional interger array is permutated in way as the unsorted array 00039 * 00040 * \param id (input) CHARACTER*1 00041 * - = 'I': sort D in increasing order; 00042 * - = 'D': sort D in decreasing order. 00043 * 00044 * \param n (input) INTEGER 00045 * The length of the array D. 00046 * 00047 * \param d (input/output) array, dimension (N) 00048 * On entry, the array to be sorted. 00049 * On exit, D has been sorted into increasing order 00050 * - (D(1) <= ... <= D(N) ) or into decreasing order 00051 * - (D(1) >= ... >= D(N) ), depending on ID. 00052 * 00053 * \param dextra (input/output) array, dimension (N) 00054 * 00055 * \param info (output) INTEGER 00056 * - = 0: successful exit 00057 * - < 0: if INFO = -i, the i-th argument had an illegal value 00058 * 00059 * \return error status: CTA_OK if successful 00060 */ 00061 CTAEXPORT void CTA_IQSort2(char *id, int *n, int *d, int *dextra, int *info); 00062 00063 #define CTA_DQSort2 F77_FUNC(cta_dqsort2,CTA_DQSORT2) 00064 #ifdef __cplusplus 00065 extern "C" /* prevent C++ name mangling */ 00066 #endif 00067 00068 /** \brief Sort an double array using the Quicksort algorithm. 00069 * An additional interger array is permutated in way as the unsorted array 00070 * 00071 * \param id (input) CHARACTER*1 00072 * - = 'I': sort D in increasing order; 00073 * - = 'D': sort D in decreasing order. 00074 * 00075 * \param n (input) INTEGER 00076 * The length of the array D. 00077 * 00078 * \param d (input/output) array, dimension (N) 00079 * On entry, the array to be sorted. 00080 * On exit, D has been sorted into increasing order 00081 * - (D(1) <= ... <= D(N) ) or into decreasing order 00082 * - (D(1) >= ... >= D(N) ), depending on ID. 00083 * 00084 * \param dextra (input/output) array, dimension (N) 00085 * 00086 * \param info (output) INTEGER 00087 * - = 0: successful exit 00088 * - < 0: if INFO = -i, the i-th argument had an illegal value 00089 * 00090 * \return error status: CTA_OK if successful 00091 */ 00092 CTAEXPORT void CTA_DQSort2(char *id, int *n, double *d, int *dextra, int *info); 00093 00094 #endif 00095 00096 00097 00098 00099 00100