1 /*
2 * Copyright (C) 2014, Andrey Loskutov <loskutov@gmx.de>
3 * and other copyright owners as documented in the project's IP log.
4 *
5 * This program and the accompanying materials are made available
6 * under the terms of the Eclipse Distribution License v1.0 which
7 * accompanies this distribution, is reproduced below, and is
8 * available at http://www.eclipse.org/org/documents/edl-v10.php
9 *
10 * All rights reserved.
11 *
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
14 * conditions are met:
15 *
16 * - Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 *
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials provided
22 * with the distribution.
23 *
24 * - Neither the name of the Eclipse Foundation, Inc. nor the
25 * names of its contributors may be used to endorse or promote
26 * products derived from this software without specific prior
27 * written permission.
28 *
29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
30 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
31 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
32 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
34 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
35 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
36 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
37 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
38 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
40 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
41 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42 */
43 package org.eclipse.jgit.ignore.internal;
44
45 import static org.eclipse.jgit.ignore.internal.Strings.getPathSeparator;
46
47 /**
48 * Matcher built from patterns for file names (single path segments). This class
49 * is immutable and thread safe.
50 *
51 * @since 3.6
52 */
53 public class NameMatcher extends AbstractMatcher {
54
55 final boolean beginning;
56
57 final char slash;
58
59 final String subPattern;
60
61 NameMatcher(String pattern, Character pathSeparator, boolean dirOnly,
62 boolean deleteBackslash) {
63 super(pattern, dirOnly);
64 slash = getPathSeparator(pathSeparator);
65 if (deleteBackslash) {
66 pattern = Strings.deleteBackslash(pattern);
67 }
68 beginning = pattern.length() == 0 ? false : pattern.charAt(0) == slash;
69 if (!beginning)
70 this.subPattern = pattern;
71 else
72 this.subPattern = pattern.substring(1);
73 }
74
75 public boolean matches(String path, boolean assumeDirectory) {
76 int end = 0;
77 int firstChar = 0;
78 do {
79 firstChar = getFirstNotSlash(path, end);
80 end = getFirstSlash(path, firstChar);
81 boolean match = matches(path, firstChar, end, assumeDirectory);
82 if (match)
83 // make sure the directory matches: either if we are done with
84 // segment and there is next one, or if the directory is assumed
85 return !dirOnly ? true : (end > 0 && end != path.length())
86 || assumeDirectory;
87 } while (!beginning && end != path.length());
88 return false;
89 }
90
91 public boolean matches(String segment, int startIncl, int endExcl,
92 boolean assumeDirectory) {
93 // faster local access, same as in string.indexOf()
94 String s = subPattern;
95 if (s.length() != (endExcl - startIncl))
96 return false;
97 for (int i = 0; i < s.length(); i++) {
98 char c1 = s.charAt(i);
99 char c2 = segment.charAt(i + startIncl);
100 if (c1 != c2)
101 return false;
102 }
103 return true;
104 }
105
106 private int getFirstNotSlash(String s, int start) {
107 int slashIdx = s.indexOf(slash, start);
108 return slashIdx == start ? start + 1 : start;
109 }
110
111 private int getFirstSlash(String s, int start) {
112 int slashIdx = s.indexOf(slash, start);
113 return slashIdx == -1 ? s.length() : slashIdx;
114 }
115
116 }