/*
 * suffie 0.01, suffix mathing tool for linguistic purposes.
 *
 * Copyright (C) 2008 Jindrich Novy (jnovy@redhat.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 <stdio.h>
#include <string.h>
#include <strings.h>
#include <ctype.h>
#include <stdlib.h>

char *m, *bm;
off_t size;
char **w, **wp, **b;
int words, printed_words, blacklisted;

int add_word( char *word ) {
	int i;
	
	for (i=0; i<words; i++) {
		if (!strcasecmp(word, w[i])) return 0;
	}
	words++;
	w = realloc(w, words*sizeof(char*));
	w[words-1] = word;
	return 1;
}

int print_word( char *word ) {
	int i;
	
	for (i=0; i<printed_words; i++) {
		if ( !strcasecmp(wp[i], word) ) return 0;
	}
	for (i=0; i<blacklisted; i++) {
		if ( !strcasecmp(b[i], word) ) return 0;
	}
	printed_words++;
	wp = realloc(wp, printed_words*sizeof(char*));
	wp[printed_words-1] = word;
//	printf("%s\n", word);
	{
		char *ww, *wl;
		for (ww=word-50; ww<word; ww++) {
			char ch = ww>=m?*ww:' ';
			ch = ch<' '?' ':ch;
			putchar(ch);
		}
		printf("| %s |", word);
		wl = word+60;
		for (ww=word+strlen(word); ww<wl; ww++) {
			char ch = ww<&m[size]?*ww:' ';
			ch = ch<' '?' ':ch;
			putchar(ch);
		}
		putchar('\n');
	}
	return 1;
}

int sort_func(const void *s1, const void *s2) {
	int i;
	const char *p1 = *(char**)s1;
	const char *p2 = *(char**)s2;
	
	for (i=0; isalpha(p1[i]) && isalpha(p2[i]); i++) {
		if ( tolower(p1[i]) < tolower(p2[i]) ) return -1;
		if ( tolower(p1[i]) > tolower(p2[i]) ) return 1;
	}
	if ( !isalpha(p1[i]) && !isalpha(p2[i]) ) return 0;
	if ( isalpha(p1[i])) return -1;
	return 1;
}

void read_blacklist( char *name ) {
	FILE *f = fopen(name,"rt");
	off_t size, i;
	
	if (!f) {
		fprintf(stderr,"Unable to read %s.\n", name);
		return;
	}
	fseek(f, 0, SEEK_END);
	size = ftell(f);
	fseek(f, 0, SEEK_SET);
	bm = malloc(size+1);
	fread(bm, 1, size, f);
	fclose(f);
	for (i=0; i<size; i++) {
		if ( bm[i] == '\n' || bm[i] == '\r' ) {
			bm[i] = '\0';
		}
	}
	for (i=0; i<size;) {
		for (; !isalpha(bm[i]) && i<size; i++);
		blacklisted++;
		b = realloc(b, blacklisted*sizeof(char*));
		b[blacklisted-1] = &bm[i];
		for (; isalpha(bm[i]) && i<size; i++);
	}
	bm[size] = '\0';
}

int main( int argc, char **argv ) {
	int i;
	
	if ( argc < 2 ) {
		printf("Usage: %s <text file>\n", argv[0]);
		return 1;
	}
	if ( argc >= 3 ) {
		read_blacklist(argv[2]);
	}
	
	{
		FILE *f = fopen(argv[1],"rt");
		if ( !f ) {
			fprintf(stderr, "Error opening %s for reading.\n", argv[1]);
			return 1;
		}
		fseek(f, 0, SEEK_END);
		size = ftell(f);
		fseek(f, 0, SEEK_SET);
		m = malloc(size);
		fread(m, 1, size, f);
		
		for (i=0; i<size;) {
			off_t n;
			for(; !isalpha(m[i]) && i<size; i++);
			for(n=i; isalpha(m[n]) && n<size; n++);
			if ( m[n-1] == 'o' || m[n-1] == 'a' || m[n-1] == 'e' || m[n-1] == 'i' ||
			     m[n-1] == 'O' || m[n-1] == 'A' || m[n-1] == 'E' || m[n-1] == 'I') {
				m[n] = 0;
				add_word(&m[i]);
			}
			i=n+1;
		}
		
		qsort(w, words, sizeof(char*), sort_func);
		for (i=1; i<words; i++) {
			if ( strlen(w[i]) == strlen(w[i-1]) && !strncasecmp(w[i], w[i-1], strlen(w[i])-1) ) {
				print_word(w[i-1]);
				print_word(w[i]);
			}
		}
		fclose(f);
	}
	
	return 0;
}