-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathmain.cpp
More file actions
114 lines (102 loc) · 3.2 KB
/
main.cpp
File metadata and controls
114 lines (102 loc) · 3.2 KB
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
/* RLZ compress
* Copyright (C) 2011 Shanika Kuruppu
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
/*
* RLZ - Relative Lempel Ziv
* Implements the RLZ compression algorithm.
* Authors: Shanika Kuruppu (kuruppu@csse.unimelb.edu.au)
* Simon J. Puglisi (simon.puglisi@rmit.edu.au)
*/
#include <getopt.h>
#include "RLZ.h"
using namespace std;
int main(int argc, char **argv)
{
char usage[] = "Usage: rlz [OPTIONS] REF FILE1 FILE2 ...\n\
-d: Decompress (all other options ignored)\n\
-e: Type of encoding (t: text, b: binary) (default: b)\n\
-i: Output a self-index with given name (all options except -r ignored)\n\
-l: Enable LISS encoding\n\
-r: Only enable random access in the index (used with -i)\n\
-s: Output short factors as substring and length pairs\n\
REF: Name of reference sequence\n\
FILE1 ...: Names of files to be compressed\n";
char option, encoding='b', idxname[1024];
bool isdecomp = false, isshort = false, isliss = false;
bool isindex = false, displayonly = false;
if (argc < 3)
{
cerr << usage;
exit(1);
}
while ((option = getopt(argc, argv, "de:i:lrs")) != EOF)
{
switch (option)
{
case 'd':
isdecomp = true;
break;
case 'e':
sscanf(optarg, "%c", &encoding);
if (encoding != 't' && encoding != 'b')
{
cerr << usage;
exit(1);
}
break;
case 'i':
isindex = true;
sscanf(optarg, "%s", idxname);
if (strlen(idxname) == 0)
{
cerr << usage;
exit(1);
}
break;
case 's':
isshort = true;
break;
case 'l':
isliss = true;
break;
case 'r':
displayonly = true;
break;
default:
cerr << usage;
exit(1);
}
}
// If index, all other options except -r are ignored
if (isindex)
{
RLZCompress rlz(argv+optind, argc-optind, idxname, displayonly);
rlz.compress();
}
else if (!isdecomp)
{
RLZCompress rlz(argv+optind, argc-optind, encoding, isshort,
isliss);
//RLZCompress rlz(argv+optind, argc-optind, true);
rlz.compress();
}
else
{
RLZDecompress rlzd(argv+optind, argc-optind);
rlzd.decompress();
}
return 0;
}