Path: utzoo!attcan!uunet!snorkelwacker!usc!jarthur!spectre.ccsf.caltech.edu!tybalt.caltech.edu!adler From: adler@tybalt.caltech.edu (B.Thomas Adler) Newsgroups: comp.sys.ibm.pc.programmer Subject: Re: Tesseract Message-ID: <1990Feb27.192123.23463@spectre.ccsf.caltech.edu> Date: 27 Feb 90 19:21:23 GMT References: <14284@reed.UUCP> Sender: news@spectre.ccsf.caltech.edu Organization: California Institute of Technology, Pasadena Lines: 34 In article <14284@reed.UUCP> minar@reed.bitnet (Nelson Minar) writes: >Given the number of TSR questions that have been asked lately.. >Has anyone out there written any utilities with the program called Tesseract? I've written TSRs with the Tesseract package. In particular, I was working on a project which needed TSRs to be used while word-processing. I read all the standard references, most of which did not help. The most useful book I found was "Inside Turbo Pascal" or some such. It's put out by Osbourne, and is a huge book, containing *lots* of useful info for the ibm programmer. It's section on TSR was easy to understand, and included a functioning example of one. Even with all the research I did on TSRs, my program still caused fluctuations in the performance of Word Perfect, and so I resorted to the Tesseract package. I was quite surprised with what I found, and very pleased when my program finally worked with no bugs. (I suspect that I was not being careful enough in using DOS functions, in my original attempts.) The documentation to Tess. is fairly informative, but a little cryptic. I ended up taking the example programs they provided, and hacked in my own code, rather than take the time to figure out what the docs said. Overall, I'd recommend Tesseract, but be prepared for some serious delving into its operation to figure out how to use it, unless you hack on an example, like I did. Happy Hacking! -Bo -- /----------------------------------------------------------------------\ | B. Thomas Adler | "No fucking shit, lady! | | | Do I sound like I'm | | | ordering a pizza?!?" |