This article describes how to use the free zlib code to compress files. Detailed source code, plus a 32 bit ActiveX control accompany the article. A new data compression technique, using a text transform discovered by Wheeler and Burrows. Detailed source code accompanies the article. A quick overview of the construction of the Suffix Tree data structure.
Suffix trees give linear search times for string, with linear time and space for construction.
Detailed source code accompanies the article. A review of Microsoft's Word add-on, Internet Assistant, a tool for creating HTML documents. An example of how you can run into trouble when performing floating point comparisons. An example of how to use STL priority queues, with an implementation of Huffman coding as an example. A look at five popular Windows based source code editors.