-
Notifications
You must be signed in to change notification settings - Fork 5
/
ftable.java
454 lines (424 loc) · 12.5 KB
/
ftable.java
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
/**
* Class which creates a frequency table for input file,
* counting only letters.
*
* This class can be used to crack the Vigenere cipher
* with ic.java and kasiski.java
*
*@version Project 2 CSC 456
*@author Kim Paterson
*/
import java.util.HashMap;
import java.lang.Math;
import java.lang.NumberFormatException;
import java.util.Map;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.LinkedHashMap;
public class ftable{
private BufferedReader read = null;
private BufferedWriter write = null;
//total number of characters
private int total_num;
//once some characters are removed, we need to store the remaining
private String shortened_input = "";
public static void main(String[] args){
boolean verbose = false;
//number of characters to skip at the beginning of the string
int num_to_skip = 0;
//skip ever n characters
int num_period = 1;
String input_file = null;
String output_file = null;
ftable ftable_obj = new ftable();
//command line arguments with no dashes for skipping
//all arguments there
if ( args.length == 7 ){
if ( args[0].equals("-v") ){
verbose = true;
}
else{
ftable_obj.print_usage();
}
if ( args[1].equals("-s") ) {
if ( args[2].equals("-p") ){
ftable_obj.print_usage();
}
try{
num_to_skip = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else{
ftable_obj.print_usage();
}
if ( args[3].equals("-p") ) {
try{
num_period = Integer.parseInt(args[4]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else{
ftable_obj.print_usage();
}
input_file = args[5];
output_file = args[6];
}
/* Possible arguments of length 6:
* -v -s num -p num infile
* -s num -p num infile outfile
*/
else if ( args.length == 6 ) {
if ( args[0].equals("-v") ){
verbose = true;
if ( args[1].equals("-s") ) {
if ( args[2].equals("-p") ){
ftable_obj.print_usage();
}
try{
num_to_skip = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
if ( args[3].equals("-p") ) {
try{
num_period = Integer.parseInt(args[4]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
input_file = args[5];
}
else{
ftable_obj.print_usage();
}
}
else if ( args[0].equals("-s") ) {
if ( args[1].equals("-p") ){
ftable_obj.print_usage();
}
try{
num_to_skip = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
if ( args[2].equals("-p") ) {
try{
num_period = Integer.parseInt(args[3]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
input_file = args[4];
output_file = args[5];
}
else {
ftable_obj.print_usage();
}
}
/* Possible arguments of length 5:
* -v -s num -p num
* -v -s num infile outfile
* -v -p num infile outfile
* -s num -p num infile
*/
else if ( args.length == 5 ) {
if ( args[0].equals("-v") ) {
verbose = true;
}
else if ( args[0].equals("-s") ){
try{
num_to_skip = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
if ( args[2].equals("-p") ) {
try{
num_period = Integer.parseInt(args[3]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else {
ftable_obj.print_usage();
}
input_file = args[4];
}
if ( args[1].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
input_file = args[3];
output_file = args[4];
}
else if ( args[1].equals("-p") ) {
try{
num_period = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
input_file = args[3];
output_file = args[4];
}
if ( args[3].equals("-p") ) {
try{
num_period = Integer.parseInt(args[4]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
}
/* Possible arguments of length 4:
* -v -s num infile
* -v -p num infile
* -s num -p num
* -s num infile outfile
* -p num infile outfile
*/
else if ( args.length == 4) {
if ( args[0].equals("-v") ) {
verbose = true;
if ( args[1].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else if ( args[1].equals("-p") ) {
try{
num_period = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else {
ftable_obj.print_usage();
}
input_file = args[3];
}
else if ( args[0].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
if ( args[2].equals("-p") ) {
try{
num_period = Integer.parseInt(args[3]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else {
input_file = args[2];
output_file = args[3];
}
}
}
/* Possible arguments of length 3:
* -v -s num
* -v -p num
* -s num infile
* -p num infile
* -v infile outfile
*/
else if ( args.length == 3 ) {
if ( args[0].equals("-v") ) {
verbose = true;
if ( args[1].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else if ( args[1].equals("-p") ) {
try{
num_period = Integer.parseInt(args[2]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else {
input_file = args[1];
output_file = args[2];
}
}
else if ( args[0].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
input_file = args[2];
}
else if ( args[0].equals("-p") ) {
try{
num_period = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
input_file = args[2];
}
}
/* Possible arguments of length 2:
* -v infile
* -s num
* -p num
*/
else if ( args.length == 2 ) {
if ( args[0].equals("-v") ) {
verbose = true;
input_file = args[1];
}
else if ( args[0].equals("-s") ) {
try{
num_to_skip = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
else if ( args[0].equals("-p") ) {
try{
num_period = Integer.parseInt(args[1]);
} catch (NumberFormatException e){
ftable_obj.print_usage();
}
}
}
/* Possible arguments of length 1:
* -v
* infile
*/
else if ( args.length == 1 ) {
if ( args[0].equals("-v") ) {
verbose = true;
}
else {
input_file = args[0];
}
}
if (verbose){
System.out.println("verbose: " + verbose + " -s " + num_to_skip
+ " -p " + num_period +
" input: " + input_file + " output: " + output_file);
}
//open and read files
cipherio io = new cipherio();
io.openRW(input_file, output_file);
String input = io.readFile();
LinkedHashMap<String, Integer> map = new LinkedHashMap<String, Integer>();
//process input, create linkedhashmap
map = ftable_obj.fill_ftable(map, input, num_to_skip, num_period, verbose);
//output the frequencues in Map
ftable_obj.print_output(map);
io.closeStreams();
}//end main
/**
* Computes the frequencies for characters in input and skips
* characters according to num_to_skip and num_period.
*@param map is a character map of inputs
*@param input is the input string read from the file
*@param num_to_skip designates to skip the first n characters
*@param num_period designates the method to skip every n characters
*@param verbose optional flag that prints extra output
*@return returns a map of the characters
*
*/
private LinkedHashMap<String, Integer> fill_ftable( LinkedHashMap<String,
Integer> map, String input,
int num_to_skip,
int num_period,
boolean verbose ){
if (num_period == 0 ){
num_period = 1;
}
//sanity check on num_input and num_period
if ( num_to_skip >= input.length() ){
num_to_skip = 1;
}
if ( num_period >= input.length() ){
num_period = 0;
}
String[] alphabet = {"A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K",
"L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V",
"W", "X", "Y", "Z"};
//convert to uppercase
input = input.toUpperCase();
if ( verbose ) {
System.out.println("Input: '" + input + "'");
}
//start count of characters
total_num = 0;
//initialize map with all letters
for ( String letter : alphabet ){
map.put(letter, 0);
}
//Remove spaces
input = input.replaceAll("[^A-Za-z]", "");
for ( int i = num_to_skip; i < input.length(); i+=num_period ){
String temp = input.substring(i, i+1);
shortened_input += temp;
while (temp.equals(" ") && i < input.length()){
i++;
}
if (map.get(temp) != null && !temp.equals(" ")){
map.put(temp, (map.get(temp) + 1));
total_num++;
}
else if(!temp.equals(" ")){
map.put(temp, 1);
total_num++;
}
}
System.out.println("");
return map;
}
/**
* Prints usage for program and exits
*/
private void print_usage(){
System.out.println("Usage: ftable [-v] [-s sum]"
+ "[-p num] [infile [outfile]]");
System.exit(1);
}
/**
* Prints final output including the frequency count for each
* character and then finally prints the index of coincidence
* for all the characters in the inptu text.
*@param table takes in map of character frequencies
*/
private void print_output(LinkedHashMap<String, Integer> table){
System.out.printf("Total chars: %d\n", total_num);
//if total_num is 0, then we divide by 0, which we don't want
if ( total_num == 0 ) {
total_num = 1;
}
for ( Map.Entry entry : table.entrySet() ){
double percent = ((double)(Integer)entry.getValue() / total_num);
System.out.printf(" %s:%9d ( %5.2f" , entry.getKey(), entry.getValue(),
percent * 100);
System.out.print("%) ");
for (int i=0; i < Math.ceil(percent*100); i++){
System.out.print("*");
}
System.out.print("\n");
}
// print IC
ic ic_gen = new ic();
//gets the index of coincidence for the input text
double ic_val = ic_gen.calc_ic(shortened_input, shortened_input.length());
System.out.printf("\nIndex of Coincidence: %5.4f \n", ic_val);
}
}//end of class