Had to bring in my own soundcard just so that I could stream DI properly. We seriously need some upgrades here.slocate
Read up on the new algorithm for searching compressed text files quickly. It uses a basic 2 byte pair -> 1 byte compression scheme. Makes it easy to encode the search string and search the compressed format directly. It uses a unique method of calculating non-overlapping pairs so that a word cannot have more than one encoding. The file size seems to be compressed 30% on average, but this is on essay and dictionary type documents. A filesystem tree will have many more duplicate pairs so the compression should be quite good. The fronal encoding algorithm currently used compresses about 85%. Have only read the paper, just need to implement and test it.Life
Mom and cousin are coming down for the weekend todo some Christmas shopping in the 'Big City' . Should be fun, havn't seem them in a while.