/usr/include/qsopt_ex/eg_numutil_dbl.h is in libqsopt-ex-dev 2.5.10.3-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 | /* WARNING! This file was autogenerated from template */
/* EGlib "Efficient General Library" provides some basic structures and
* algorithms commons in many optimization algorithms.
*
* Copyright (C) 2005 Daniel Espinoza and Marcos Goycoolea.
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by the
* Free Software Foundation; either version 2.1 of the License, or (at your
* option) any later version.
*
* This library is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
* */
#ifndef dbl___EG_NUMUTIL_H__
#define dbl___EG_NUMUTIL_H__
#include "eg_macros.h"
#include "eg_nummacros.h"
#include "eg_lpnum.h"
/* ========================================================================= */
/** @defgroup EGlpNumUtil General Number Utilities
* Here we put some utilities common for different number types but thaat we
* want to implement as templates, like permutation sorting, inner product of
* vectors, and so-on..
*
* @par History:
* Revision 0.0.2
* - 2007-10-08
* - Separate template file and independet file into eg_nummacros.h
* - Move EGabs, EGswap, EGmin and EGmax to this file
* - 2005-10-31
* - First implementation.
* */
/** @{*/
/** @file
* @brief This file provide the user interface and function definitions for
* general number utilities.
* */
/* Swap two double variables using the third as a temporary. */
#define dbl_EGLPNUM_SWAP(a,b,t) ((dbl_EGlpNumCopy(t,a)),(dbl_EGlpNumCopy(a,b)),(dbl_EGlpNumCopy(b,t)))
/* ========================================================================= */
/** @brief compute the inner product of two arrays.
* @param arr1 first array.
* @param arr2 second array.
* @param length number of entries to consider in both arrays, from zero to
* length - 1.
* @param rop where to store the result.
* */
#define dbl_EGlpNumInnProd(__rop,__arr1,__arr2,__length) dbl___EGlpNumInnProd((&(__rop)),__arr1,__arr2,__length)
/* ========================================================================= */
/** @brief internal version, this is done to avoid using stdc99 and rely on
* more basic stdc89 */
void dbl___EGlpNumInnProd(double*rop,double*const arr1,double*const arr2, const size_t length);
/* ========================================================================= */
/** @brief Sort (in increasing order) a sub-set of entries in an array using
* quicksort, by permutating the order of the elements in the subset rather
* than in the whole original array.
* @param sz length of the permutation array.
* @param perm array of indices of elements that we want to sort.
* @param elem array (of length at least max(perm[k]:k=0,...,sz-1)) containing
* the elements to be sorted.
* @note The array of elements is not changed by this function.
* @note This code is based in concorde's implementation of
* permutation-quick-sort.
* */
void dbl_EGutilPermSort (const size_t sz,
int *const perm,
const double * const elem);
/* ========================================================================= */
/** @brief Sort (in decreasing order) a sub-set of entries in an array using
* quicksort, by permutating the order of the elements in the subset rather
* than in the whole original array.
* @param sz length of the permutation array.
* @param perm array of indices of elements that we want to sort.
* @param elem array (of length at least max(perm[k]:k=0,...,sz-1)) containing
* the elements to be sorted.
* @note The array of elements is not changed by this function.
* @note This code is based in concorde's implementation of
* permutation-quick-sort.
* */
void dbl_EGutilPermSort2 (const size_t sz,
int*const perm,
const double*const elem);
/* ========================================================================= */
/** @}*/
#endif
|