Holgersson

package textproc;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class Holgersson {

	public static final String[] REGIONS = { "blekinge", "bohuslän", "dalarna", "dalsland", "gotland", "gästrikland",
			"halland", "hälsingland", "härjedalen", "jämtland", "lappland", "medelpad", "närke", "skåne", "småland",
			"södermanland", "uppland", "värmland", "västerbotten", "västergötland", "västmanland", "ångermanland",
			"öland", "östergötland" };

	public static void main(String[] args) throws FileNotFoundException {

		long t0 = System.nanoTime();

		List<TextProcessor> wordList = new ArrayList<TextProcessor>();

		TextProcessor p = new SingleWordCounter("nils");
		TextProcessor norge = new SingleWordCounter("norge");
		TextProcessor multi = new MultiWordCounter(REGIONS);

		Scanner scan = new Scanner(new File("undantagsord.txt"));
		Set<String> stopwords = new HashSet<String>();
		while (scan.hasNext()) {
			stopwords.add(scan.next());
		}
		TextProcessor undantag = new GeneralWordCounter(stopwords);

		wordList.add(p);
		wordList.add(norge);
		wordList.add(multi);
		wordList.add(undantag);

		Scanner s = new Scanner(new File("nilsholg.txt"));
		s.useDelimiter("(\\s|,|\\.|:|;|!|\\?|'|\\\")+"); // se handledning

		while (s.hasNext()) {
			String word = s.next().toLowerCase();
			for (TextProcessor tp : wordList) {
				tp.process(word);
			}

		}

		s.close();
		scan.close();

		for (TextProcessor tp : wordList) {
			tp.report();
		}

		long t1 = System.nanoTime();
		System.out.println("tid: " + (t1 - t0) / 1000000.0 + " ms");
		// treemap 273, 290, 312
		// hashmap 243

	}
}