/** * Recursively scan a {@link NormalizedNode} instance and its children and * produce a collection of {@link DuplicateEntry} objects. Each holds the * original definition path and a list of hard/softlinks. * * @param node Root node, may not be null. * @return List of entries */ static Map<NormalizedNode<?, ?>, DuplicateEntry> findDuplicates(final NormalizedNode<?, ?> node) { final DuplicateFinder finder = new DuplicateFinder(); finder.findDuplicates(YangInstanceIdentifier.EMPTY, node); return finder.identities; } }
/** * Recursively scan a {@link NormalizedNode} instance and its children and * produce a collection of {@link DuplicateEntry} objects. Each holds the * original definition path and a list of hard/softlinks. * * @param node Root node, may not be null. * @return List of entries */ static Map<NormalizedNode<?, ?>, DuplicateEntry> findDuplicates(final NormalizedNode<?, ?> node) { final DuplicateFinder finder = new DuplicateFinder(); finder.findDuplicates(YangInstanceIdentifier.EMPTY, node); return finder.identities; } }