AAI-1523 Batch reformat aai-schema-ingest

[aai/aai-common.git] / aai-schema-ingest / src / main / java / org / onap / aai / edges / TypeAlphabetizer.java

diff --git a/aai-schema-ingest/src/main/java/org/onap/aai/edges/TypeAlphabetizer.java b/aai-schema-ingest/src/main/java/org/onap/aai/edges/TypeAlphabetizer.java
index fd1f511..4cae19e 100644 (file)
--- a/aai-schema-ingest/src/main/java/org/onap/aai/edges/TypeAlphabetizer.java
+++ b/aai-schema-ingest/src/main/java/org/onap/aai/edges/TypeAlphabetizer.java
@@ -24,42 +24,42 @@ package org.onap.aai.edges;
  * Helper class to produce alphabetized keys for EdgeIngestor and EdgeValidator
  */
 public class TypeAlphabetizer {
-       /**
-        * Builds key for edge rules, where nodetypes are alphabetically sorted
-        * (ignoring dashes).
-        * 
-        * @param nodeA - first nodetype
-        * @param nodeB - second nodetype
-        * @return {alphabetically first nodetype}|{alphabetically second nodetype}
-        *              ex: buildAlphabetizedKey("l-interface", "logical-link") -> "l-interface|logical-link"
-        *                      buildAlphabetizedKey("logical-link", "l-interface") -> "l-interface|logical-link"
-        * 
-        * This is alphabetical order to normalize the keys, as sometimes there will be multiple
-        * rules for a pair of node types but the from/to value in the json is flipped for some of them.
-        */
-       public String buildAlphabetizedKey(String nodeA, String nodeB) {
-               if (nodeA == null) {
-                       nodeA = "";
-               }
-               if (nodeB == null) {
-                       nodeB = "";
-               }
-               
-               //normalize
-               String normalizedNodeA = nodeA.replace("-", "");
-               String normalizedNodeB = nodeB.replace("-", "");
-               int cmp = normalizedNodeA.compareTo(normalizedNodeB);
-               
-               StringBuilder sb = new StringBuilder();
-               if (cmp <= 0) {
-                       sb.append(nodeA);
-                       sb.append("|");
-                       sb.append(nodeB);
-               } else {
-                       sb.append(nodeB);
-                       sb.append("|");
-                       sb.append(nodeA);
-               }
-               return sb.toString();
-       }
+    /**
+     * Builds key for edge rules, where nodetypes are alphabetically sorted
+     * (ignoring dashes).
+     * 
+     * @param nodeA - first nodetype
+     * @param nodeB - second nodetype
+     * @return {alphabetically first nodetype}|{alphabetically second nodetype}
+     *         ex: buildAlphabetizedKey("l-interface", "logical-link") -> "l-interface|logical-link"
+     *         buildAlphabetizedKey("logical-link", "l-interface") -> "l-interface|logical-link"
+     * 
+     *         This is alphabetical order to normalize the keys, as sometimes there will be multiple
+     *         rules for a pair of node types but the from/to value in the json is flipped for some of them.
+     */
+    public String buildAlphabetizedKey(String nodeA, String nodeB) {
+        if (nodeA == null) {
+            nodeA = "";
+        }
+        if (nodeB == null) {
+            nodeB = "";
+        }
+
+        // normalize
+        String normalizedNodeA = nodeA.replace("-", "");
+        String normalizedNodeB = nodeB.replace("-", "");
+        int cmp = normalizedNodeA.compareTo(normalizedNodeB);
+
+        StringBuilder sb = new StringBuilder();
+        if (cmp <= 0) {
+            sb.append(nodeA);
+            sb.append("|");
+            sb.append(nodeB);
+        } else {
+            sb.append(nodeB);
+            sb.append("|");
+            sb.append(nodeA);
+        }
+        return sb.toString();
+    }
 }