public boolean visit()

in src/main/java/org/apache/nifi/NarProvidedDependenciesMojo.java [164:185]

• 13 lines of code
• 3 McCabe index (conditional complexity)

        public boolean visit(DependencyNode node) {
            // add this node
            hierarchy.push(node);

            // don't print test deps, but still add to hierarchy as they will
            // be removed in endVisit below
            if (isTest(node)) {
                return false;
            }

            // build the padding
            final StringBuilder pad = new StringBuilder();
            for (int i = 0; i < hierarchy.size() - 1; i++) {
                pad.append("   ");
            }
            pad.append("+- ");

            // log it
            output.append(pad).append(node.toNodeString()).append(System.lineSeparator());

            return true;
        }