On Wed, 2007-09-19 at 16:21 +0100, Andrew Findlay wrote:Hmm: I think the different-attributes case is actually *simpler* to code. The algorithm for enumerating members is almost identical.
- for each nested group { + for each member {
The algorithm complexity is the same, although, it is true, a client may require more operations.
_______________________________________________ Ldapext mailing list Ldapext@ietf.org https://www1.ietf.org/mailman/listinfo/ldapext