001: /*
002: * Copyright (c) 2001-2007, Jean Tessier
003: * All rights reserved.
004: *
005: * Redistribution and use in source and binary forms, with or without
006: * modification, are permitted provided that the following conditions
007: * are met:
008: *
009: * * Redistributions of source code must retain the above copyright
010: * notice, this list of conditions and the following disclaimer.
011: *
012: * * Redistributions in binary form must reproduce the above copyright
013: * notice, this list of conditions and the following disclaimer in the
014: * documentation and/or other materials provided with the distribution.
015: *
016: * * Neither the name of Jean Tessier nor the names of his contributors
017: * may be used to endorse or promote products derived from this software
018: * without specific prior written permission.
019: *
020: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
021: * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
022: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
023: * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
024: * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
025: * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
026: * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
027: * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
028: * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
029: * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
030: * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
031: */
032:
033: package com.jeantessier.dependency;
034:
035: import java.util.*;
036:
037: public abstract class DecoratorTraversalStrategy implements
038: TraversalStrategy {
039: private TraversalStrategy strategy;
040:
041: public DecoratorTraversalStrategy(TraversalStrategy strategy) {
042: this .strategy = strategy;
043: }
044:
045: public boolean doPreOutboundTraversal() {
046: return strategy.doPreOutboundTraversal();
047: }
048:
049: public void setPreOutboundTraversal(boolean preOutboundTraversal) {
050: strategy.setPreOutboundTraversal(preOutboundTraversal);
051: }
052:
053: public boolean doPreInboundTraversal() {
054: return strategy.doPreInboundTraversal();
055: }
056:
057: public void setPreInboundTraversal(boolean preInboundTraversal) {
058: strategy.setPreInboundTraversal(preInboundTraversal);
059: }
060:
061: public boolean doPostOutboundTraversal() {
062: return strategy.doPostOutboundTraversal();
063: }
064:
065: public void setPostOutboundTraversal(boolean postOutboundTraversal) {
066: strategy.setPostOutboundTraversal(postOutboundTraversal);
067: }
068:
069: public boolean doPostInboundTraversal() {
070: return strategy.doPostInboundTraversal();
071: }
072:
073: public void setPostInboundTraversal(boolean postInboundTraversal) {
074: strategy.setPostInboundTraversal(postInboundTraversal);
075: }
076:
077: public boolean isInScope(PackageNode node) {
078: return strategy.isInScope(node);
079: }
080:
081: public boolean isInScope(ClassNode node) {
082: return strategy.isInScope(node);
083: }
084:
085: public boolean isInScope(FeatureNode node) {
086: return strategy.isInScope(node);
087: }
088:
089: public boolean isInFilter(PackageNode node) {
090: return strategy.isInFilter(node);
091: }
092:
093: public boolean isInFilter(ClassNode node) {
094: return strategy.isInFilter(node);
095: }
096:
097: public boolean isInFilter(FeatureNode node) {
098: return strategy.isInFilter(node);
099: }
100:
101: public Collection<? extends Node> order(
102: Collection<? extends Node> collection) {
103: return strategy.order(collection);
104: }
105: }
|