Third part of onap rename

[appc.git] / appc-dispatcher / appc-dispatcher-common / ranking-framework-lib / src / main / java / org / onap / appc / rankingframework / impl / BacktraceStrategy.java

diff --git a/appc-dispatcher/appc-dispatcher-common/ranking-framework-lib/src/main/java/org/onap/appc/rankingframework/impl/BacktraceStrategy.java b/appc-dispatcher/appc-dispatcher-common/ranking-framework-lib/src/main/java/org/onap/appc/rankingframework/impl/BacktraceStrategy.java
new file mode 100644 (file)
index 0000000..6523fef
--- /dev/null
+++ b/appc-dispatcher/appc-dispatcher-common/ranking-framework-lib/src/main/java/org/onap/appc/rankingframework/impl/BacktraceStrategy.java
@@ -0,0 +1,122 @@
+/*-
+ * ============LICENSE_START=======================================================
+ * ONAP : APPC
+ * ================================================================================
+ * Copyright (C) 2017 AT&T Intellectual Property. All rights reserved.
+ * ================================================================================
+ * Copyright (C) 2017 Amdocs
+ * =============================================================================
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ * 
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ * 
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ * 
+ * ECOMP is a trademark and service mark of AT&T Intellectual Property.
+ * ============LICENSE_END=========================================================
+ */
+
+package org.onap.appc.rankingframework.impl;
+
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+import org.onap.appc.rankingframework.RankedAttributesContext;
+import com.att.eelf.configuration.EELFLogger;
+import com.att.eelf.configuration.EELFManager;
+
+class BacktraceStrategy implements Strategy {
+
+    private static final EELFLogger logger = EELFManager.getInstance().getLogger(BacktraceStrategy.class);
+
+    @Override
+    public <R> R resolve(CompositeNode<R> rootNode, List<String> rankedNames, RankedAttributesContext context) {
+
+        if (logger.isDebugEnabled()) {
+            StringBuilder buff = new StringBuilder(128);
+            for (String name : rankedNames) {
+                buff.append("/{").append(name).append(" = ").append(Utils.value(context.getAttributeValue(name))).append('}');
+            }
+            logger.debug(String.format("Trying to resolve path: %s", buff));
+        }
+
+        Set<String> visited = new HashSet<>();
+
+        CompositeNode<R> parentNode = rootNode;
+        int depth = 0;
+        boolean stop = false;
+        R result = null;
+
+        String attribute = null;
+        Object value = null;
+
+        do {
+            if (value == null) {
+                attribute = rankedNames.get(depth);
+                value = Utils.value(context.getAttributeValue(attribute));
+            }
+
+            Node<R> childNode = parentNode.children().get(value);
+
+            if (childNode != null) {
+                if (logger.isDebugEnabled()) {
+                    logger.debug(String.format("Found matching node '%s' - checking it out", childNode));
+                }
+
+                if (!visited.add(childNode.id())) {
+                    if (logger.isDebugEnabled()) {
+                        logger.debug(String.format("The matching node '%s' was checked before - ignoring it", childNode));
+                    }
+                    childNode = null;
+                }
+            } else {
+                if (logger.isDebugEnabled()) {
+                    logger.debug(String.format("Node '%s/{%s = %s}' not found  - falling back", parentNode, attribute, value != null ? value : "NULL"));
+                }
+            }
+
+            if (childNode != null) {
+                switch (childNode.type()) {
+                    case COMPOSITE:
+                        depth++;
+                        value = null;
+                        parentNode = (CompositeNode<R>) childNode;
+                        break;
+                    case LEAF:
+                        if (logger.isDebugEnabled()) {
+                            logger.debug( String.format("Result node has been resolved succesfully - '%s'", childNode));
+                        }
+                        result = ((LeafNode<R>) childNode).result();
+                        stop = true;
+                        break;
+                    default:
+                        throw new IllegalStateException(childNode.type().name());
+                }
+            } else {
+                if (!value.equals(Constants.DEFAULT_MATCH)) {
+                    logger.debug("Exact match didn't work, trying the default option, if any");
+                    value = Constants.DEFAULT_MATCH;
+                } else if (depth > 0) {
+                    if (logger.isDebugEnabled()) {
+                        logger.debug(String.format("Exact match didn't work and no default option available beneath '%s' - moving out", parentNode));
+                    }
+                    depth--;
+                    value = null;
+                    parentNode = parentNode.parent();
+                } else {
+                    logger.debug("Didn't success to resolve the path - stopping without result");
+                    stop = true;
+                }
+            }
+        } while (!stop);
+
+        return result;
+    }
+}