import streamlit as st
import alg
def imp():
	s = st.text_input("enter text", "Type Here ...")
	l = alg.main(s)
	if(st.button("Submit")):

		st.write(l[0])
		st.write(l[2])

def about():
	st.subheader("What is LZSS")
	st.write("The LZSS algorithm allows enough flexibility to combine characters and pointers (phrase codes) in the output sequence, which to some extent eliminates the wastefulness inherent in LZ77, which manifests itself in the regular transmission of one character in direct form. This modification of the LZ77 was proposed in 1982 by Storer and Szymanski.")

	st.subheader('The relative efficiency of  LZSS')
	st.write("In LZSS, the encoded file consists of a sequence of items, each of which is either a single character or a pointer of the form (offset, length), which replaces a string of length characters that appeared as offsetcharacters earlier in the file. Decoding of such a file is thus a very simple procedure. For the encoding, however, there is a need to locate the longest recurring strings, for which sophisticated data structures such as hash tables or binary trees have been suggested.")

	st.subheader('LZSS vs LZ77')
	st.write("In their original LZ77 algorithm, Lempel and Ziv proposed that all strings be encoded as a length and offset, even strings with no match. Storer and Szymanski observed that individual unmatched symbols or matched strings of one or two symbols take up more space to encode than they do to leave uncoded.")
	
		


