1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/*
* Copyright (C) 2007, Robin Rosenberg <robin.rosenberg@dewire.com>
* Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
* and other copyright owners as documented in the project's IP log.
*
* This program and the accompanying materials are made available
* under the terms of the Eclipse Distribution License v1.0 which
* accompanies this distribution, is reproduced below, and is
* available at http://www.eclipse.org/org/documents/edl-v10.php
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* - Neither the name of the Eclipse Foundation, Inc. nor the
* names of its contributors may be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.eclipse.jgit.treewalk.filter;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import org.eclipse.jgit.errors.StopWalkException;
import org.eclipse.jgit.treewalk.TreeWalk;
/**
* Includes tree entries only if they match one or more configured paths.
* <p>
* Operates like {@link PathFilter} but causes the walk to abort as soon as the
* tree can no longer match any of the paths within the group. This may bypass
* the boolean logic of a higher level AND or OR group, but does improve
* performance for the common case of examining one or more modified paths.
* <p>
* This filter is effectively an OR group around paths, with the early abort
* feature described above.
*/
public class PathFilterGroup {
/**
* Create a collection of path filters from Java strings.
* <p>
* Path strings are relative to the root of the repository. If the user's
* input should be assumed relative to a subdirectory of the repository the
* caller must prepend the subdirectory's path prior to creating the filter.
* <p>
* Path strings use '/' to delimit directories on all platforms.
* <p>
* Paths may appear in any order within the collection. Sorting may be done
* internally when the group is constructed if doing so will improve path
* matching performance.
*
* @param paths
* the paths to test against. Must have at least one entry.
* @return a new filter for the list of paths supplied.
*/
public static TreeFilter createFromStrings(final Collection<String> paths) {
if (paths.isEmpty())
throw new IllegalArgumentException("At least one path is required.");
final PathFilter[] p = new PathFilter[paths.size()];
int i = 0;
for (final String s : paths)
p[i++] = PathFilter.create(s);
return create(p);
}
/**
* Create a collection of path filters.
* <p>
* Paths may appear in any order within the collection. Sorting may be done
* internally when the group is constructed if doing so will improve path
* matching performance.
*
* @param paths
* the paths to test against. Must have at least one entry.
* @return a new filter for the list of paths supplied.
*/
public static TreeFilter create(final Collection<PathFilter> paths) {
if (paths.isEmpty())
throw new IllegalArgumentException("At least one path is required.");
final PathFilter[] p = new PathFilter[paths.size()];
paths.toArray(p);
return create(p);
}
private static TreeFilter create(final PathFilter[] p) {
if (p.length == 1)
return new Single(p[0]);
return new Group(p);
}
static class Single extends TreeFilter {
private final PathFilter path;
private final byte[] raw;
private Single(final PathFilter p) {
path = p;
raw = path.pathRaw;
}
@Override
public boolean include(final TreeWalk walker) {
final int cmp = walker.isPathPrefix(raw, raw.length);
if (cmp > 0)
throw StopWalkException.INSTANCE;
return cmp == 0;
}
@Override
public boolean shouldBeRecursive() {
return path.shouldBeRecursive();
}
@Override
public TreeFilter clone() {
return this;
}
public String toString() {
return "FAST_" + path.toString();
}
}
static class Group extends TreeFilter {
private static final Comparator<PathFilter> PATH_SORT = new Comparator<PathFilter>() {
public int compare(final PathFilter o1, final PathFilter o2) {
return o1.pathStr.compareTo(o2.pathStr);
}
};
private final PathFilter[] paths;
private Group(final PathFilter[] p) {
paths = p;
Arrays.sort(paths, PATH_SORT);
}
@Override
public boolean include(final TreeWalk walker) {
final int n = paths.length;
for (int i = 0;;) {
final byte[] r = paths[i].pathRaw;
final int cmp = walker.isPathPrefix(r, r.length);
if (cmp == 0)
return true;
if (++i < n)
continue;
if (cmp > 0)
throw StopWalkException.INSTANCE;
return false;
}
}
@Override
public boolean shouldBeRecursive() {
for (final PathFilter p : paths)
if (p.shouldBeRecursive())
return true;
return false;
}
@Override
public TreeFilter clone() {
return this;
}
public String toString() {
final StringBuffer r = new StringBuffer();
r.append("FAST(");
for (int i = 0; i < paths.length; i++) {
if (i > 0)
r.append(" OR ");
r.append(paths[i].toString());
}
r.append(")");
return r.toString();
}
}
}
|
