Seuss.java

import java.io.File;

import java.io.FileNotFoundException;

import java.io.PrintWriter;

import java.util.Scanner;

public class Seuss {

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

{

LinkedSet set=new LinkedSet();

File infile = new File("./src./greenEggs.txt");

File outfile = new File("words.txt");

String word=null;

PrintWriter out=null;

Scanner read = null;

try {

read = new Scanner(infile);

out=new PrintWriter(outfile);

while(read.hasNext())

{

word=remmovePunc(read.next());

set.add(word);

}

System.out.print(set);

while(true)

{

word=set.remove();

if(word==null)

{

break;

}

out.write(word+" ");

out.flush();

}

} catch (FileNotFoundException e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

}

public static String remmovePunc(String s)

{

String str="";

String a=s.toLowerCase();

for(int i=0;i

{

if (Character.isLetter(a.charAt(i))){

str=str+a.charAt(i);

}

}

return str;

}

}

greenEggs.txt

I am Sam

I am Sam

Sam I am

That Sam I am!

That Sam I am!

I do not like that Sam I am!

Do you like green eggs and ham?

I do not like them, Sam I am.

I do not like green eggs and ham.

Would you like them here or there?

I would not like them here or there.

I would not like them anywhere.

I do not like green eggs and ham.

I do not like them, Sam I am.

Would you like them in a house?

Would you like them with a mouse?

I do not like them in a house.

I do not like them with a mouse.

I do not like them here or there.

I do not like them anywhere.

I do not like green eggs and ham.

I do not like them, Sam I am.

Would you eat them in a box?

Would you eat them with a fox?

Not in a box.

Not with a fox.

Not in a house.

Not with a mouse.

I would not eat them here or there.

I would not eat them anywhere.

I would not eat green eggs and ham.

I do not like them, Sam I am.

Would you?

Could you?

In a car?

Eat them!

Eat them!

Here they are.

I would not, could not, in a car.

You may like them.

You will see.

You may like them in a tree!

I would not, could not in a tree.

Not in a car! You let me be!

I do not like them in a box.

I do not like them with a fox.

I do not like them in a house.

I do not like them with a mouse.

I do not like them here or there.

I do not like them anywhere.

I do not like green eggs and ham.

I do not like them, Sam I am.

A train!

A train!

A train!

A train!

Could you, would you, on a train?

Not on a train!

Not in a tree!

Not in a car!

Sam! Let me be!

I would not, could not, in a box.

I could not, would not, with a fox.

I will not eat them with a mouse.

I will not eat them in a house.

i will not eat them here or there.

I will not eat them anywhere.

I do not eat green eggs and ham.

I do not like them, Sam I am.

Say!

In the dark?

Here in the dark!

Would you, could you, in the dark?

I would not, could not,

in the dark.

Would you, could you, in the rain?

I would not, could not, in the rain.

Not in the dark.

Not on a train.

Not in a car.

Not in a tree.

I do not like them, Sam, you see.

Not in a house.

Not in a box.

Not with a mouse.

Not with a fox.

I will not eat them here or there.

I do not like them anywhere!

You do not like green eggs and ham?

I do not like them, Sam I am.

Could you, would you with a goat?

I would not, could not, with a goat!

Would you, could you, on a boat?

I could not, would not, on a boat.

I will not, will not, with a goat.

I will not eat them in the rain.

I will not eat them on a train.

Not in the dark!

Not in a tree!

Not in a car!

You let me be!

I do not like them in a box.

I do not like them with a fox.

I will not eat them in a house.

I do not like them with a mouse.

I do not like them here or there.

I do not like them ANYWHERE

I do not like green eggs and ham!

I do not like them, Sam I am.

You do not like them.

So you say.

Try them!

Try them!

And you may.

Try them and you may, I say.

Sam!

If you will let me be,

I will try them.

You will see.

Say!

I like green eggs and ham!

I do!

I like them, Sam I am!

And I would eat them in a boat.

And I would eat them with a goat...

And I will eat them in the rain.

And in the dark.

And on a train.

And in a car.

And in a tree.

They are so good, so good, you see!

So I will eat them in a box.

And I will eat them with a fox.

And I will eat them in a house.

And I will eat them with a mouse.

And I will eat them here and there.

Say! I will eat them ANYWHERE!

I do so like green eggs and ham!

Thank you!

Thank you, Sam I am!

/*

* implements a hash table using chains of nodes for the buckets

*/

public class HashSet implements Set

{

private class Node

{

private T data;

private Node next;

public Node(T item)

{

data = item;

next = null;

}

public String toString()

{

return "" + data;

}

}

public static final int DEFAULT_CAPACITY = 9;

private Node[] hashtable;

private int size;

private int items;

public HashSet ()

{

this(DEFAULT_CAPACITY);

}

@SuppressWarnings("unchecked")

public HashSet (int capacity)

{

hashtable = (Node[]) new HashSet.Node[capacity];

size = capacity;

items = 0;

}

public boolean add (T item)

{

checkForNull(item);

int index = getIndex(item);

Node current = hashtable[index];

if (current == null)

{

hashtable[index] = new Node(item);

items++;

return true;

}

while (current.next!= null)

{

if (current.data.equals(item))

{

return false;

}

current = current.next;

}

if (current.data.equals(item))

{

return false;

}

current.next = new Node(item);

items++;

return true;

}

public boolean remove (T item)

{

checkForNull(item);

int index = getIndex(item);

Node current = hashtable[index];

if (current == null){

return false;

}

if(current.data.equals(item)) {

current = current.next;

hashtable[index] = current;

items--;

return true;

}else{

while (current.next!= null){

if (current.next.data.equals(item)){

current.next = current.next.next;

items--;

return true;

}

current = current.next;

}

}

return false;

}

public T remove ()

{

return null;

}

public T get()

{

boolean filled = false;

int random = 0;

while (!filled)

{

random = (int)(Math.random() * items);

if (hashtable[random] != null)

{

filled = true;

}

}

return hashtable[random].data;

}

public boolean contains(T item)

{

int index = getIndex(item);

Node current = hashtable[index];

if (current == null)

{

return false;

}

while (current.next != null)

{

if (current.data.equals(item))

{

return true;

}

current = current.next;

}

if (current.data.equals(item))

{

return true;

}

return false;

}

public int size()

{

return size;

}

public String toString()

{

if (size == 0)

{

return "[]";

}

String h = "";

for (int i = 0; i

{

Node current = hashtable[i];

if (current == null) h+= i + "\t" + " " + " ";

else

{

h+= i + "\t" + current + " ";

while (current.next != null)

{

current = current.next;

h+= current + " ";

}

h+= " ";

}

}

return h;

}

private void checkForNull(T item)

{

if (item == null)

{

throw new IllegalArgumentException("null not a possible value!");

}

}

private int getIndex(T item)

{

int index = item.hashCode() % size;

if (index

{

index += size;

}

return index;

}

}

Next, revise your implementation of Seuss.java so that instead of using a list-based set, it uses a hash set. Call the new file Seuss3, and use a hash set of size 20 to store the words. Your output should look like this: 0 ham them here car mee 1 the 2 eggs tree 17 18 19 a may if dark you green box be