STOW V1.0 © December 13, 1994 by Leonard D Atkinson II Concept: Doc of Doc's House BBS ************************************************************ ** Licence Information ** ************************************************************ Everything in this archive is copyright 1994 by Leonard D Atkinson II. I'm only copyrighting this for the sake of proving that I wrote it, otherwise anything may be done with it. Suffice it to say I'm putting it under the GNU licence. It may be included in a shareware-type archive like Aminet or the Fish disks without my permission and sold for profit. If it is included, I'd appreciate getting word about it, but it's not necessary. If you still feel like giving me something, send me some email. A word of thanks is actually more interesting than five bucks. My internet address is lda@netcom.com. ************************************************************ ** What does it do? ** ************************************************************ Put simply, stow copies files to floppies, leaving a minimum of extra space left over. You tell it a minimum amount of space to leave unused and it makes as many disks as possible from the files provided. Now, you might ask why you'd want to do this...well, I guess most people don't care about stuff like this, but for anyone who collects lots and lots of stuff off the net (like me), it saves some disks. It also save the time of figuring out where to put which file. Most people copy each file by hand from hard drive to floppy. So they either end up with disks with 50K free, or they spend long hours trying to squeeze as much space out of the disks as they can. ************************************************************ ** How does it work? ** ************************************************************ First, stow makes a list of all the files in the directory you give it. It will ignore all files with a size of zero, which include directories. So, no, there's not recursive directory traversal. I could make it do this, but I beg you not to tempt the creeping feature creature. So, anyway, then stow just starts throwing files onto a scratch pad and hoping they fit. If it doesn't work out, then one file is removed and another takes its place. This proceeds until a disk is found. Then files are all copied onto the real floppy and we start all over again. I think this is the best balance of time versus space-saving. If you've got another idea, modify my source (and send it to me). ************************************************************ ** How do I work it? ** ************************************************************ OK, the syntax stow expects is (in bnf): stow {