/usr/include/ladr/order.h is in libladr-dev 0.0.200911a-2.1.
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 | /* Copyright (C) 2006, 2007 William McCune
This file is part of the LADR Deduction Library.
The LADR Deduction Library is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License,
version 2.
The LADR Deduction 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with the LADR Deduction Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef TP_ORDER_H
#define TP_ORDER_H
#include <stdlib.h> /* for malloc/free */
/* INTRODUCTION
This package defines Ordertype and has a generic sorting
routine merge_sort() that can be used to sort any kind of data.
*/
/* Public definitions */
/* basic order relations */
typedef enum { NOT_COMPARABLE,
SAME_AS,
LESS_THAN,
GREATER_THAN,
LESS_THAN_OR_SAME_AS,
GREATER_THAN_OR_SAME_AS,
NOT_LESS_THAN,
NOT_GREATER_THAN
} Ordertype;
/* End of public definitions */
/* Public function prototypes from order.c */
void merge_sort_recurse(void *a[], /* array to sort */
void *w[], /* work array */
int start, /* index of first element */
int end, /* index of last element */
Ordertype (*comp_proc) (void *, void *));
void merge_sort(void *a[], /* array to sort */
int n, /* size of array */
Ordertype (*comp_proc) (void *, void *));
Ordertype compare_vecs(int *a, int *b, int n);
void copy_vec(int *a, int *b, int n);
#endif /* conditional compilation of whole file */
|