I am currently revising my z/Architecture book for application programmers with practical examples where appropriate. What I am still missing is a practical example for UPT (Update Tree). Although there have been a number of SHARE papers published on this topic, they discuss only limited aspects of using UPT (and CFC) for sort applications and ignore some critical considerations, as does the example in the Principles of Operations. Does anyone have a small complete example of UPT usage? I can imagine that a binary tree application would be a suitable candidate. I have also seen an old reference to a Burrows-Wheeler transformation implemented with UPT.
Can anyone help. Regards Tony ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
