Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
TraversalStrategyBase |
|
| 1.0;1 |
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 | 368 | public abstract class TraversalStrategyBase implements TraversalStrategy { |
38 | 368 | private boolean preOutboundTraversal = true; |
39 | 368 | private boolean preInboundTraversal = true; |
40 | 368 | private boolean postOutboundTraversal = false; |
41 | 368 | private boolean postInboundTraversal = false; |
42 | ||
43 | public boolean doPreOutboundTraversal() { | |
44 | 2555 | return preOutboundTraversal; |
45 | } | |
46 | ||
47 | public void setPreOutboundTraversal(boolean preOutboundTraversal) { | |
48 | 27 | this.preOutboundTraversal = preOutboundTraversal; |
49 | 27 | } |
50 | ||
51 | public boolean doPreInboundTraversal() { | |
52 | 2555 | return preInboundTraversal; |
53 | } | |
54 | ||
55 | public void setPreInboundTraversal(boolean preInboundTraversal) { | |
56 | 27 | this.preInboundTraversal = preInboundTraversal; |
57 | 27 | } |
58 | ||
59 | public boolean doPostOutboundTraversal() { | |
60 | 2555 | return postOutboundTraversal; |
61 | } | |
62 | ||
63 | public void setPostOutboundTraversal(boolean postOutboundTraversal) { | |
64 | 27 | this.postOutboundTraversal = postOutboundTraversal; |
65 | 27 | } |
66 | ||
67 | public boolean doPostInboundTraversal() { | |
68 | 2555 | return postInboundTraversal; |
69 | } | |
70 | ||
71 | public void setPostInboundTraversal(boolean postInboundTraversal) { | |
72 | 27 | this.postInboundTraversal = postInboundTraversal; |
73 | 27 | } |
74 | ||
75 | public <T extends Node> Collection<T> order(Collection<T> collection) { | |
76 | 6029 | return new ArrayList<T>(collection); |
77 | } | |
78 | } |