keith-turner commented on PR #113: URL: https://github.com/apache/accumulo-access/pull/113#issuecomment-4057972013
> I feel like adding the caching optimization for the predicate case means we don't really need the overloaded method for accepting a set of strings, since that's a trivial special case of this one. That is what I was going for, however I have since realized there is a big difference. For the case a of a known set of set user auths we can optimize only that set. For the case of the predicate it is optimizing on the set of auths that occur in expressions. Those are two different sets and the set of auths that occur in expressions could be much larger than the set of auths the user has. This has me worried about memory use for this change. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
