| Graham,
I found it out how it works. And it's very interesting HOW it works.
My first successfull try (with the help of Helmut Graef) was
for acl$:"oa$temp:t.t" do -
write add acl$:"oa$temp:x.x" -
identifier = .identifier,-
default = .default,-
hidden = .hidden,-
protected = .protected,-
nopropagae = .nopropagate,-
read = .read,-
write = .write,-
execute = .execute,-
delete = .delete,-
control = .control,-
shared = .shared
This gets me a sorted ACL on the secondary temp file x.x which could
be easily copied back to my original file t.t
Second try:
for acl$:"oa$temp:t.t" do -
write add acl$:"oa$temp:t.t" -
identifier = .identifier,-
default = .default,-
hidden = .hidden,-
protected = .protected,-
nopropagae = .nopropagate,-
read = .read,-
write = .write,-
execute = .execute,-
delete = .delete,-
control = .control,-
shared = .shared
This gets me the sorted ACL on the original file t.t. It's interesting
that the ACL$ dsab doesn't give me a duplicate key error like any other
dsab.
Third try
for acl$:"oa$temp:t.t" do -
write copy acl$:"oa$temp:t.t" %key = .%key, %key = .%key
This worked too and is the most elegant (shortest) version.
Fritz
|
| >
> Third try
>
> for acl$:"oa$temp:t.t" do -
> write copy acl$:"oa$temp:t.t" %key = .%key, %key = .%key
>
>
> This worked too and is the most elegant (shortest) version.
... but not the quickest version
in the example above the ACL will be sorted n-times, where n is the
number of ACE's of the ACL. One write copy is sufficient to sort
the ACL
for FIRST acl$:"oa$temp:t.t" do -
write copy acl$:"oa$temp:t.t" %key = .%key, %key = .%key
Fritz
|