July 2 2014: Decompression and storage improvements

Notes:
	I have found that on small inputs, this algorithm is actually
	rather terrible. I've been nearly doubling the size of the file
	which is exactly opposite what I wanted with a compression
	program. That was without any delimiting, so I couldn't actually
	go back and re-create the file after I was done. I have now
	tried actually breaking each character down into binary and then
	doing the compression, and that yeilds much better results. I've
	got a few more tests that I would like to run, then I can
	determine if it is actually worth compressing the file or not
	for certain sizes. I may be adding the entire Hamlet play from
	the website: http://shakespeare.mit.edu/hamlet/full.html
	I figure that is long enough to demonstrate what the algorithm
	is capable of.

Modified Files:
	compress:
		I have added a few functions to try working with a more
		compressed outputs that can be stored or re-opened and
		decompressed. I need to be able to get it back into a
		list of tuples with a position and the character or bit.
		I have something right now, but the output can't be
		encoded stricly in numbers because I need a delimiting
		character between tuples. I am using a colon for now.
		I also have the decompression algorithm run on the
		output so I can see that everything is working without
		having to re-run the program

	lz:
		Both algorithms have been completed.
		I have removed the classes since they didn't seem
		necessary, and really were just more overhead. I will be
		just doing some clean up on this file in the future.
		Maybe some optimizations if I feel like it.

Technically, this project is done for the intention of implementing the
algorithm. There are still a few things I would like to make work better
for the sake of using the program in the future in a real application.