123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139 |
- /*
- * 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.internal.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 + 1;
- for (int j = 1; j < needleLen; j++, si++) {
- if (neq(needle[j], text[si]))
- continue OUTER;
- }
- return matchPos;
- }
- 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;
- }
-
- /** {@inheritDoc} */
- @Override
- public String toString() {
- return pattern();
- }
- }
|