Coverage Report - com.jeantessier.dependency.SelectiveVisitor
 
Classes in this File Line Coverage Branch Coverage Complexity
SelectiveVisitor
100%
36/36
100%
18/18
1.692
 
 1  
 /*
 2  
  *  Copyright (c) 2001-2009, Jean Tessier
 3  
  *  All rights reserved.
 4  
  *
 5  
  *  Redistribution and use in source and binary forms, with or without
 6  
  *  modification, are permitted provided that the following conditions
 7  
  *  are met:
 8  
  *
 9  
  *      * Redistributions of source code must retain the above copyright
 10  
  *        notice, this list of conditions and the following disclaimer.
 11  
  *
 12  
  *      * Redistributions in binary form must reproduce the above copyright
 13  
  *        notice, this list of conditions and the following disclaimer in the
 14  
  *        documentation and/or other materials provided with the distribution.
 15  
  *
 16  
  *      * Neither the name of Jean Tessier nor the names of his contributors
 17  
  *        may be used to endorse or promote products derived from this software
 18  
  *        without specific prior written permission.
 19  
  *
 20  
  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 21  
  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 22  
  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 23  
  *  A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR
 24  
  *  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 25  
  *  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 26  
  *  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 27  
  *  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 28  
  *  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 29  
  *  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 30  
  *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 31  
  */
 32  
 
 33  
 package com.jeantessier.dependency;
 34  
 
 35  
 import java.util.*;
 36  
 
 37  
 public class SelectiveVisitor extends VisitorDecorator {
 38  
     private final TraversalStrategy traversalStrategy;
 39  
 
 40  21
     public SelectiveVisitor(TraversalStrategy traversalStrategy) {
 41  21
         this.traversalStrategy = traversalStrategy;
 42  21
     }
 43  
 
 44  
     public void traverseNodes(Collection<? extends Node> nodes) {
 45  1
         super.traverseNodes(traversalStrategy.order(nodes));
 46  1
     }
 47  
 
 48  
     public void traverseInbound(Collection<? extends Node> nodes) {
 49  1
         super.traverseInbound(traversalStrategy.order(nodes));
 50  1
     }
 51  
 
 52  
     public void traverseOutbound(Collection<? extends Node> nodes) {
 53  1
         super.traverseOutbound(traversalStrategy.order(nodes));
 54  1
     }
 55  
 
 56  
     public void visitPackageNode(PackageNode node) {
 57  2
         if (traversalStrategy.isInScope(node)) {
 58  1
             super.visitPackageNode(node);
 59  
         }
 60  2
     }
 61  
 
 62  
     public void visitInboundPackageNode(PackageNode node) {
 63  2
         if (traversalStrategy.isInFilter(node)) {
 64  1
             super.visitInboundPackageNode(node);
 65  
         }
 66  2
     }
 67  
 
 68  
     public void visitOutboundPackageNode(PackageNode node) {
 69  2
         if (traversalStrategy.isInFilter(node)) {
 70  1
             super.visitOutboundPackageNode(node);
 71  
         }
 72  2
     }
 73  
 
 74  
     public void visitClassNode(ClassNode node) {
 75  2
         if (traversalStrategy.isInScope(node)) {
 76  1
             super.visitClassNode(node);
 77  
         }
 78  2
     }
 79  
 
 80  
     public void visitInboundClassNode(ClassNode node) {
 81  2
         if (traversalStrategy.isInFilter(node)) {
 82  1
             super.visitInboundClassNode(node);
 83  
         }
 84  2
     }
 85  
 
 86  
     public void visitOutboundClassNode(ClassNode node) {
 87  2
         if (traversalStrategy.isInFilter(node)) {
 88  1
             super.visitOutboundClassNode(node);
 89  
         }
 90  2
     }
 91  
 
 92  
     public void visitFeatureNode(FeatureNode node) {
 93  2
         if (traversalStrategy.isInScope(node)) {
 94  1
             super.visitFeatureNode(node);
 95  
         }
 96  2
     }
 97  
 
 98  
     public void visitInboundFeatureNode(FeatureNode node) {
 99  2
         if (traversalStrategy.isInFilter(node)) {
 100  1
             super.visitInboundFeatureNode(node);
 101  
         }
 102  2
     }
 103  
 
 104  
     public void visitOutboundFeatureNode(FeatureNode node) {
 105  2
         if (traversalStrategy.isInFilter(node)) {
 106  1
             super.visitOutboundFeatureNode(node);
 107  
         }
 108  2
     }
 109  
 }