summaryrefslogtreecommitdiff
path: root/sort.c
blob: 4ab673b4d397a86c71a25339aef6ce3197e574f2 (plain)
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
 * Mini find implementation for busybox
 *
 *
 * Copyright (C) 1999 by Lineo, inc.
 * Written by John Beppu <beppu@lineo.com>
 *
 * 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 *
 */

#include "internal.h"
#include <sys/types.h>
#include <fcntl.h>
#include <dirent.h>
#include <stdio.h>
#include <errno.h>

static const char sort_usage[] =
"Usage: sort [OPTION]... [FILE]...\n\n"
;


/* line node */
typedef struct {
    char	*data;	    /* line data */
    struct Line *next;	    /* pointer to next line node */
} Line;

/* singly-linked list of lines */
typedef struct {
    int		len;	    /* number of Lines */
    Line	*line;	    /* array fed to qsort */
    Line	*head;	    /* head of List */
} List;


/* Line methods */

static const int max = 1024;

static Line *
line_new()
{
    char buffer[max];
}


/* Comparison */

static int
compare_ascii(const void *, const void *);

static int
compare_numeric(const void *, const void *);


/* List */

static void
list_insert();

static void
list_sort();

static void
list_print();



/*
 * I need a list
 * to insert lines into
 * then I need to sort this list
 * and finally print it
 */

int 
sort_main(int argc, char **argv)
{
    int i;
    char opt;

    /* default behaviour */

    /* parse argv[] */
    for (i = 1; i < argc; i++) {
	if (argv[i][0] == '-') {
	    opt = argv[i][1];
	    switch (opt) {
		case 'h':
		    usage(sort_usage);
		    break;
		default:
		    fprintf(stderr, "sort: invalid option -- %c\n", opt);
		    usage(sort_usage);
	    }
	} else {
	    break;
	}
    }

    /* go through remaining args (if any) */
    if (i >= argc) {

    } else {
	for ( ; i < argc; i++) {
	}
    }

    exit(0);
}

/* $Date: 1999/12/21 20:00:35 $ */
/* $Id: sort.c,v 1.1 1999/12/21 20:00:35 beppu Exp $ */