file.h (d1d015864103b253b3fcb2f72a0da5b0cfeb31b6) file.h (b1a409863f4784ab8a7a9fa04b3e9b3c92e7fd72)
1/* $FreeBSD$ */
2
3/*-
4 * Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
5 * Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 14 unchanged lines hidden (view full) ---

23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30#if !defined(__SORT_FILE_H__)
1/* $FreeBSD$ */
2
3/*-
4 * Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
5 * Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 14 unchanged lines hidden (view full) ---

23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30#if !defined(__SORT_FILE_H__)
31#define __SORT_FILE_H__
31#define __SORT_FILE_H__
32
33#include "coll.h"
34#include "sort.h"
35
36#define SORT_DEFAULT 0
37#define SORT_QSORT 1
38#define SORT_MERGESORT 2
39#define SORT_HEAPSORT 3
40#define SORT_RADIXSORT 4
41
32
33#include "coll.h"
34#include "sort.h"
35
36#define SORT_DEFAULT 0
37#define SORT_QSORT 1
38#define SORT_MERGESORT 2
39#define SORT_HEAPSORT 3
40#define SORT_RADIXSORT 4
41
42#define DEFAULT_SORT_ALGORITHM SORT_HEAPSORT
43#define DEFAULT_SORT_FUNC heapsort
42#define DEFAULT_SORT_ALGORITHM SORT_HEAPSORT
43#define DEFAULT_SORT_FUNC heapsort
44
45/*
46 * List of data to be sorted.
47 */
48struct sort_list
49{
50 struct sort_list_item **list;
51 unsigned long long memsize;

--- 87 unchanged lines hidden --- 		44
45/*
46 * List of data to be sorted.
47 */
48struct sort_list
49{
50 struct sort_list_item **list;
51 unsigned long long memsize;

--- 87 unchanged lines hidden ---