BUG-865: deprecate pre-Beryllium parser elements

[yangtools.git] / yang / yang-parser-impl / src / main / java / org / opendaylight / yangtools / yang / parser / impl / GroupingSort.java

diff --git a/yang/yang-parser-impl/src/main/java/org/opendaylight/yangtools/yang/parser/impl/GroupingSort.java b/yang/yang-parser-impl/src/main/java/org/opendaylight/yangtools/yang/parser/impl/GroupingSort.java
index 0296f91b05ecb41ad5c85739edaf8a722e9a9769..4112d4f2ca4c24ee5a38bda229cce39fa79a8e1b 100644 (file)
--- a/yang/yang-parser-impl/src/main/java/org/opendaylight/yangtools/yang/parser/impl/GroupingSort.java
+++ b/yang/yang-parser-impl/src/main/java/org/opendaylight/yangtools/yang/parser/impl/GroupingSort.java
@@ -27,6 +27,10 @@ import org.opendaylight.yangtools.yang.parser.util.NodeWrappedType;
 import org.opendaylight.yangtools.yang.parser.util.TopologicalSort;
 import org.opendaylight.yangtools.yang.parser.util.TopologicalSort.Node;
 
+/**
+ * @deprecated Pre-Beryllium implementation, scheduled for removal.
+ */
+@Deprecated
 public final class GroupingSort {
     private GroupingSort() {
         throw new UnsupportedOperationException("Utility class should not be instantiated");
@@ -34,17 +38,17 @@ public final class GroupingSort {
 
     /**
      * Sorts set <code>groupingDefinitions</code> according to the mutual
-     * dependencies.<br />
+     * dependencies.<br>
      *
      * Elements of <code>groupingDefinitions</code> are firstly transformed to
      * {@link org.opendaylight.yangtools.yang.parser.util.TopologicalSort.Node
      * Node} interfaces and then are sorted by
      * {@link org.opendaylight.yangtools.yang.parser.util.TopologicalSort#sort(Set)
-     * sort()} method of <code>TopologicalSort</code>.<br />
-     * <br />
+     * sort()} method of <code>TopologicalSort</code>.<br>
+     * <br>
      *
      *
-     * <i>Definition of dependency relation:<br />
+     * <i>Definition of dependency relation:<br>
      * The first <code>GroupingDefinition</code> object (in this context)
      * depends on second <code>GroupingDefinition</code> object if the first one
      * contains in its set of <code>UsesNode</code> (obtained through
@@ -134,7 +138,7 @@ public final class GroupingSort {
      */
     public static Set<UsesNodeBuilder> getAllUsesNodes(final DataNodeContainerBuilder container) {
         Set<UsesNodeBuilder> ret = new HashSet<>();
-        Set<UsesNodeBuilder> usesNodes = container.getUsesNodeBuilders();
+        List<UsesNodeBuilder> usesNodes = container.getUsesNodeBuilders();
         ret.addAll(usesNodes);
 
         for (UsesNodeBuilder usesNode : usesNodes) {
@@ -146,7 +150,7 @@ public final class GroupingSort {
         for (GroupingBuilder groupingDefinition : groupings) {
             ret.addAll(getAllUsesNodes(groupingDefinition));
         }
-        Set<DataSchemaNodeBuilder> childNodes = container.getChildNodeBuilders();
+        List<DataSchemaNodeBuilder> childNodes = container.getChildNodeBuilders();
         for (DataSchemaNodeBuilder childNode : childNodes) {
             if (childNode instanceof DataNodeContainerBuilder) {
                 ret.addAll(getAllUsesNodes((DataNodeContainerBuilder) childNode));