2 * Copyright (c) 2015 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.yangtools.yang.data.api.schema;
10 import java.util.HashMap;
11 import java.util.IdentityHashMap;
13 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
15 final class DuplicateFinder {
16 private final Map<NormalizedNode<?, ?>, DuplicateEntry> identities = new IdentityHashMap<>();
17 private final Map<NormalizedNode<?, ?>, DuplicateEntry> duplicates = new HashMap<>();
19 private DuplicateFinder() {
23 private void findDuplicates(final YangInstanceIdentifier path, final NormalizedNode<?, ?> node) {
24 final DuplicateEntry i = identities.get(node);
26 final DuplicateEntry d = duplicates.get(node);
28 final DuplicateEntry n = new DuplicateEntry(path);
29 identities.put(node, n);
30 duplicates.put(node, n);
35 if (node instanceof NormalizedNodeContainer<?, ?, ?>) {
36 final NormalizedNodeContainer<?, ?, ?> container = (NormalizedNodeContainer<?, ?, ?>) node;
38 for (NormalizedNode<?, ?> c : container.getValue()) {
39 findDuplicates(path.node(c.getIdentifier()), c);
48 * Recursively scan a {@link NormalizedNode} instance and its children and
49 * produce a collection of {@link DuplicateEntry} objects. Each holds the
50 * original definition path and a list of hard/softlinks.
52 * @param node Root node, may not be null.
53 * @return List of entries
55 static Map<NormalizedNode<?, ?>, DuplicateEntry> findDuplicates(final NormalizedNode<?, ?> node) {
56 final DuplicateFinder finder = new DuplicateFinder();
57 finder.findDuplicates(YangInstanceIdentifier.empty(), node);
58 return finder.identities;