You're talking RACF, here? I once wrote a REXX that determines whether a DSN matches a RACF-style resource name with wild characters, but here you're asking how to figure out which of two such wildcard strings are the BEST match. I've never done that.
But IIRC RACF has pretty simple rules for determining the closes match. Longest string? Not quite that simple. Longest before the first wildcard character? Hold on while I look... Yeah, that's closer: "In general, given two profiles that match a data set, you can find the more specific one by comparing the profile names from left to right. Where they differ, a non-generic character is more specific than a generic character. In comparing generics, a % is more specific than an *, and an * is more specific than **. Another way to determine the most specific profile is with the SEARCH command, as there are some rare exceptions to the general rule. SEARCH always lists the profiles in the order of the most specific to the least specific." --- Bob Bridges, [email protected], cell 336 382-7313 /* Men occasionally stumble over the truth, but most of them pick themselves up and hurry off as if nothing ever happened. -Winston Churchill (1874-1965) */ > --- On Tue, 7 Jun 2022 15:45:50 +0300, ITschak Mugzach wrote: > >I think this issue was discussed here in the past, but I can't find it. > >Anyway, I am trying to figure out what is a better fit for a generic mask. > >Assume I have SYS1.PARMLIB.OLD and I am looking into two strings: > >SYS1.PARM** and SYS1.PARM*.OLD > >Is there a way to identify which is better covers SYS1.PARMLIB.OLD > >(the second one, of course)( using Rexx? ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
