From 07bec462ccdeed20cacdb3d460c79c2e8b3da820 Mon Sep 17 00:00:00 2001 From: William Kim Date: Tue, 20 Aug 2013 14:09:14 -0400 Subject: [PATCH] added comment about why we can't use set intersection method. --- .../main/java/org/mitre/openid/connect/view/UserInfoView.java | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/openid-connect-server/src/main/java/org/mitre/openid/connect/view/UserInfoView.java b/openid-connect-server/src/main/java/org/mitre/openid/connect/view/UserInfoView.java index 0414774ce..d0a551450 100644 --- a/openid-connect-server/src/main/java/org/mitre/openid/connect/view/UserInfoView.java +++ b/openid-connect-server/src/main/java/org/mitre/openid/connect/view/UserInfoView.java @@ -222,6 +222,10 @@ public class UserInfoView extends AbstractView { // Filter claims from the request object with the claims from the claims request parameter, if it exists + + // Doing the set intersection manually because the claim entries may be referring to + // the same claim but have different 'individual claim values', causing the Entry<> to be unequal, + // which doesn't allow the use of the more compact Sets.intersection() type method. Set> requestClaimsSet = Sets.newHashSet(); if (claimsRequest != null) {