PLSTsearch v1.0 ~~~~~~~~~~~~~~~ - by Ola Ekström (c) 1997 - - Written in C using the DICE Freeware compiler - IMPORTANT!: ~~~~~~~~~~~ You use this program totally on your own risk. I am not responsible for anything that this program does to your hardware and/or software. Remember that it is always a healthy thing to make backups of your data on a regular basis. PLSTsearch is Freeware, this means that it may be distributed and used freely, but it may not be sold for money. What is PLSTsearch and how do I use it? ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ PLSTsearch is a search-tool for plst-files produced by Protracker and it's close relatives. It can only be run from the CLI and use this command format: PLSTsearch . You must replace with the full path to where your plst is stored. Usually this is the root-directory of dh0: but I thought it would be nice to have it all defineable by the user. Directories defined by the path command will not be checked. You will replace with any string that you would like to search the plst for. I.e. if you search for "snare", PLSTsearch will report back all entries found with where "snare" is part of the name. If you don't specify a search-string, the whole plst will be listed. 22 lines at a time will be listed, and then you will be prompted to press the return key, so you'd better maximize the CLI-window if you don't want to miss anything. PLSTsearch will also tell you on which disk the sample is on and the length of the sample. PLSTsearch does not support wild-cards or other advanced forms of searching. If your searchstring contains spaces you must enclose it within quotation marks. Like this: "string.with a.space.in.it". Why? ~~~~ Why write a program like this, you might ask yourself. The plst is already arranged in alphabetical order... Well, that is true, but when your plst grows bigger, it will be harder and harder to remember the names of individual samples. If you have 30 snare-drum samples called things like: bigsnare, smallsnare, shortsnare etc. it will not help you very much if they are listed alphabeticaly. My plst contains about 600 entries and I don't think it's very large, yet it's hard to locate things sometimes. I can imagine how hard it would be to find one's way around a plst with a couple of 1000 entries. If you only remember a part of a name or want to list samples of a special type, you can use PLSTsearch. Last Words: ~~~~~~~~~~~ I would like to thank Rober Lager, sysop of Lager BBS (phone: +46-(0)141-213636) for betatesting. Thanx! If you want to reach me (for reporting bugs etc.) you can send e-mail to me at this address: olaek321@student.liu.se (valid at least to January 1998) or if you have access to FidoNet at 2:204/255 (I don't think that FidoNet accepts swedish characters so you will probably have to substitute 'ö' with an 'o'). I can also be reached at above mentioned BBS. Hope you will find PLSTsearch usefull! / Ola Ekström, 19 Oct 1997.