--------------------<snip>--------------
The instructions used for sorting, UPT and CFC, are implemented over
radix partition trees, and the doc is in the Principles of Operation.
They are extremely fast, since both of these instructions are
implemented in millicode. However, using these instructions is not for
the faint of heart.
I have given a SHARE session on using them for sorting (their intended
use) and will be giving another at the summer SHARE this year, along
with Michael Stack (a double session).
There is additional documentation if you search with Google, and as I
recall Lynn Wheeler knew the person who was the definitive expert of
radix partition trees.
I've not seen them used for a binary search, but it might just work if
you're very clever.
---------------<unsnip>-------------------
Thanks, Tom. I'm trying to figure out how to productively use the RPT
software that's in OS/390 and z/OS, with an eye toward using this
software on another platform that may not (read DOESN'T) have those two
instructions.
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
