#include <iostream>
#include <iomanip>
using namespace std;

#include "MpIeee.hh"
#include "CMpIeee.hh"
#include "ArithmosIO.hh"

/* sort/gsl_sort_vector_ulong.h
 * 
 * Copyright (C) 1996, 1997, 1998, 1999, 2000 Thomas Walter, Brian Gough
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or (at
 * your option) any later version.
 * 
 * This program 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
 * General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

#ifndef __GSL_SORT_VECTOR_ULONG_H__
#define __GSL_SORT_VECTOR_ULONG_H__

#include <stdlib.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_permutation.h>
#include <gsl/gsl_vector_ulong.h>

#undef __BEGIN_DECLS
#undef __END_DECLS
#ifdef __cplusplus
# define __BEGIN_DECLS extern "C" {
# define __END_DECLS }
#else
# define __BEGIN_DECLS /* empty */
# define __END_DECLS /* empty */
#endif

__BEGIN_DECLS

void gsl_sort_vector_ulong (gsl_vector_ulong * v);
int  gsl_sort_vector_ulong_index(gsl_permutation * p, const gsl_vector_ulong * v);

int  gsl_sort_vector_ulong_smallest(unsigned long * dest, const size_t k, const gsl_vector_ulong * v);
int  gsl_sort_vector_ulong_largest(unsigned long * dest, const size_t k, const gsl_vector_ulong * v);

int  gsl_sort_vector_ulong_smallest_index(size_t * p, const size_t k, const gsl_vector_ulong * v);
int  gsl_sort_vector_ulong_largest_index(size_t * p, const size_t k, const gsl_vector_ulong * v);

__END_DECLS

#endif /* __GSL_SORT_VECTOR_ULONG_H__ */
