| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| ClosureStartSelector |
|
| 1.3;1.3 |
| 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 | public class ClosureStartSelector extends ClosureSelector { | |
| 36 | private SelectionCriteria criteria; | |
| 37 | ||
| 38 | public ClosureStartSelector(NodeFactory factory, SelectionCriteria criteria) { | |
| 39 | 91 | super(factory); |
| 40 | ||
| 41 | 91 | this.criteria = criteria; |
| 42 | 91 | } |
| 43 | ||
| 44 | public void visitPackageNode(PackageNode node) { | |
| 45 | 256 | if (criteria.matches(node)) { |
| 46 | 47 | getSelectedNodes().add(node); |
| 47 | 47 | getCopiedNodes().add(getFactory().createPackage(node.getName(), node.isConfirmed())); |
| 48 | } | |
| 49 | ||
| 50 | 256 | traverseNodes(node.getClasses()); |
| 51 | 256 | } |
| 52 | ||
| 53 | public void visitInboundPackageNode(PackageNode node) { | |
| 54 | // Do nothing | |
| 55 | 0 | } |
| 56 | ||
| 57 | public void visitOutboundPackageNode(PackageNode node) { | |
| 58 | // Do nothing | |
| 59 | 0 | } |
| 60 | ||
| 61 | public void visitClassNode(ClassNode node) { | |
| 62 | 235 | if (criteria.matches(node)) { |
| 63 | 37 | getSelectedNodes().add(node); |
| 64 | 37 | getCopiedNodes().add(getFactory().createClass(node.getName(), node.isConfirmed())); |
| 65 | } | |
| 66 | ||
| 67 | 235 | traverseNodes(node.getFeatures()); |
| 68 | 235 | } |
| 69 | ||
| 70 | public void visitInboundClassNode(ClassNode node) { | |
| 71 | // Do nothing | |
| 72 | 0 | } |
| 73 | ||
| 74 | public void visitOutboundClassNode(ClassNode node) { | |
| 75 | // Do nothing | |
| 76 | 0 | } |
| 77 | ||
| 78 | public void visitFeatureNode(FeatureNode node) { | |
| 79 | 239 | if (criteria.matches(node)) { |
| 80 | 78 | getSelectedNodes().add(node); |
| 81 | 78 | getCopiedNodes().add(getFactory().createFeature(node.getName(), node.isConfirmed())); |
| 82 | } | |
| 83 | 239 | } |
| 84 | ||
| 85 | public void visitInboundFeatureNode(FeatureNode node) { | |
| 86 | // Do nothing | |
| 87 | 0 | } |
| 88 | ||
| 89 | public void visitOutboundFeatureNode(FeatureNode node) { | |
| 90 | // Do nothing | |
| 91 | 0 | } |
| 92 | } |