/usr/include/sc_sort.h is in libp4est-dev 1.1-4.
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 | /*
This file is part of the SC Library.
The SC Library provides support for parallel scientific applications.
Copyright (C) 2010 The University of Texas System
The SC 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.
The SC 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 the SC Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#ifndef SC_SORT_H
#define SC_SORT_H
#include <sc.h>
SC_EXTERN_C_BEGIN;
/** Sort a distributed set of values in parallel.
* This algorithm uses bitonic sort between processors and qsort locally.
* The partition of the data can be arbitrary and is not changed.
* \param [in] mpicomm Communicator to use.
* \param [in] base Pointer to the local subset of data.
* \param [in] nmemb Array of mpisize counts of local data.
* \param [in] size Size in bytes of each data value.
* \param [in] compar Comparison function to use.
*/
void sc_psort (sc_MPI_Comm mpicomm, void *base,
size_t * nmemb, size_t size,
int (*compar) (const void *, const void *));
SC_EXTERN_C_END;
#endif /* SC_SORT_H */
|