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
|
/*
* Copyright (C) 2009, Google Inc.
* 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.util;
import org.eclipse.jgit.JGitText;
import org.eclipse.jgit.lib.Constants;
/**
* Searches text using only substring search.
* <p>
* Instances are thread-safe. Multiple concurrent threads may perform matches on
* different character sequences at the same time.
*/
public class RawSubStringPattern {
private final String needleString;
private final byte[] needle;
/**
* Construct a new substring pattern.
*
* @param patternText
* text to locate. This should be a literal string, as no
* meta-characters are supported by this implementation. The
* string may not be the empty string.
*/
public RawSubStringPattern(final String patternText) {
if (patternText.length() == 0)
throw new IllegalArgumentException(JGitText.get().cannotMatchOnEmptyString);
needleString = patternText;
final byte[] b = Constants.encode(patternText);
needle = new byte[b.length];
for (int i = 0; i < b.length; i++)
needle[i] = lc(b[i]);
}
/**
* Match a character sequence against this pattern.
*
* @param rcs
* the sequence to match. Must not be null but the length of the
* sequence is permitted to be 0.
* @return offset within <code>rcs</code> of the first occurrence of this
* pattern; -1 if this pattern does not appear at any position of
* <code>rcs</code>.
*/
public int match(final RawCharSequence rcs) {
final int needleLen = needle.length;
final byte first = needle[0];
final byte[] text = rcs.buffer;
int matchPos = rcs.startPtr;
final int maxPos = rcs.endPtr - needleLen;
OUTER: for (; matchPos < maxPos; matchPos++) {
if (neq(first, text[matchPos])) {
while (++matchPos < maxPos && neq(first, text[matchPos])) {
/* skip */
}
if (matchPos == maxPos)
return -1;
}
int si = ++matchPos;
for (int j = 1; j < needleLen; j++, si++) {
if (neq(needle[j], text[si]))
continue OUTER;
}
return matchPos - 1;
}
return -1;
}
private static final boolean neq(final byte a, final byte b) {
return a != b && a != lc(b);
}
private static final byte lc(final byte q) {
return (byte) StringUtils.toLowerCase((char) (q & 0xff));
}
/**
* Get the literal pattern string this instance searches for.
*
* @return the pattern string given to our constructor.
*/
public String pattern() {
return needleString;
}
@Override
public String toString() {
return pattern();
}
}
|
