Further, possibly obvious, thought: overflow. What will happen if the highest xxxxx is 99999?

If you are not wedded to numbers for xxxxx, I have a fast routine to increment an alpha-numeric string by 1. You'd still face overflow issues, but it would likely take longer.



On 10/2/2021 12:47 PM, Sam_L wrote:
So if I understand correctly, you are looking for a value of AABCCxxxxx which does not exist in the SRCPF or as a program?

So max( max(SRCPF name), max(pgm name))?  Then you'd add 1 to xxxxx and proceed.  (Though this might still produce collisions in a multi use enrironment and you'd have to retry.)

You could do the max logic with SQL or using OUTFILES if SQL isn't an option.


On 10/1/2021 8:42 PM, James H. H. Lampert via MIDRANGE-L wrote:

For argument's sake, let's assume the generated names are of the form AABCCxxxxx, where AABCC is determined by what the generated program does, and xxxxx is a 5-digit number. And that users might not bother to override the generated name for programs they want to keep for future use, and may or may not bother to delete the programs (or source-members) generated for one-time use.

Any suggestions?


As an Amazon Associate we earn from qualifying purchases.

This thread ...


Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2022 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.