grue@cs.uq.oz.au (Frobozz) (04/30/91)
hiya,
After the success of my routine to convert a string to uppercase (it
was fast wasn't it :-) and after a couple of requests to post a version that
did the conversion the other way (i.e. from upper case to lower case), I decided
to write the other version. It should run as fast as the first program for
most strings (the pathalogical case is different and it involves a multiply
sign this time) and it is also very small.
This program checks for the existance and the correct type of its
agruments and doesn't modify the passed string in-situ (this means things
like undo will work and that the program is in general, well behaved).
Any non-profit usage of this piece of code is permitted. People, who want
to use this in a for-profit venture should either contact me and get my
permission first or write their own version (probably the latter if they
are serious about it ;-)
Comments anybody?
I include ther code in ASC-> format. This string is 182 bytes long
and has a checksum of # 7210h. The object you get on the stack after
running it through ASC-> has a size of 85.5 bytes and a checksum of
# A308h.
"D9D20ECE81D0040D9D2075660CCD20380008FB9760147134164146819F2CECE8
AAE4D71643104AE514A9EC0331B59EAD131FB9EAE131FD9EE51317D962C03102
A6A148161CF8AF2C8F2D760142164808CB2130B2130803A"
At least it isn't one of those really chunky looking ASC-> programs
several pages long ;-}
Pauli
seeya
Paul Dale | Internet/CSnet: grue@cs.uq.oz.au
Dept of Computer Science| Bitnet: grue%cs.uq.oz.au@uunet.uu.net
Uni of Qld | JANET: grue%cs.uq.oz.au@uk.ac.ukc
Australia, 4072 | EAN: grue@cs.uq.oz
| UUCP: uunet!munnari!cs.uq.oz!grue
f4e6g4Qh4++ | JUNET: grue@cs.uq.oz.au
--