Re: Compression idea
- Posted by Grape_ Vine_ <g__vine at hotmail.com> Jan 20, 2001
- 511 views
The problem is just how to decide what is a sting of data that belongs in the dictionary. >From: Lewis Townsend <keroltarr at HOTMAIL.COM> >Reply-To: Euphoria Programming for MS-DOS <EUPHORIA at LISTSERV.MUOHIO.EDU> >To: EUPHORIA at LISTSERV.MUOHIO.EDU >Subject: Re: Compression idea >Date: Sat, 20 Jan 2001 13:45:10 -0600 > >Hello Grape_, > >Try using match() and equal() to find repeted strings. Don't bother with >strings that are too short or not used enough to mak it worth compressing >them. > >later, >Lewis Townsend >I can not find a good way to build the diconary >Anyone know how to do this???<br clear=all><hr>Get your FREE download of >MSN Explorer at <a _________________________________________________________________ Get your FREE download of MSN Explorer at http://explorer.msn.com