Searched defs:edge (Results 1 - 2 of 2) sorted by relevance

/forgerock/openam-v13/openam-uma/src/main/java/org/forgerock/openam/uma/rest/
H A DPolicyGraph.java268 for (PolicyEdge edge : graph.edgesOf(resourceOwner)) {
269 findRights0(rights, new HashSet<>(singleton(resourceOwner)), edge, new HashSet<>(edge.actions));
275 private void findRights0(Map<String, Set<String>> rights, Set<String> visited, PolicyEdge edge, argument
277 if (!rights.containsKey(edge.subject)) {
278 rights.put(edge.subject, new HashSet<String>());
281 receivedScopes.retainAll(edge.actions);
282 if (rights.get(edge.subject).containsAll(receivedScopes)) {
285 rights.get(edge.subject).addAll(receivedScopes);
286 visited.add(edge
[all...]
/forgerock/openam/openam-uma/src/main/java/org/forgerock/openam/uma/rest/
H A DPolicyGraph.java268 for (PolicyEdge edge : graph.edgesOf(resourceOwner)) {
269 findRights0(rights, new HashSet<>(singleton(resourceOwner)), edge, new HashSet<>(edge.actions));
275 private void findRights0(Map<String, Set<String>> rights, Set<String> visited, PolicyEdge edge, argument
277 if (!rights.containsKey(edge.subject)) {
278 rights.put(edge.subject, new HashSet<String>());
281 receivedScopes.retainAll(edge.actions);
282 if (rights.get(edge.subject).containsAll(receivedScopes)) {
285 rights.get(edge.subject).addAll(receivedScopes);
286 visited.add(edge
[all...]

Completed in 37 milliseconds