1 /*
2 * Copyright (c) 2002-2023, City of Paris
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 * 1. Redistributions of source code must retain the above copyright notice
10 * and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright notice
13 * and the following disclaimer in the documentation and/or other materials
14 * provided with the distribution.
15 *
16 * 3. Neither the name of 'Mairie de Paris' nor 'Lutece' nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
24 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
31 *
32 * License 1.0
33 */
34
35 package fr.paris.lutece.plugins.strois.util;
36
37 public class S3Util
38 {
39 private S3Util( )
40 {
41
42 }
43
44 public static boolean matchesList( String [ ] listPatterns, String strText )
45 {
46 if ( listPatterns != null )
47 {
48 for ( String pattern : listPatterns )
49 {
50 if ( matches( pattern, strText ) )
51 {
52 return true;
53 }
54 }
55 }
56 return false;
57 }
58
59 public static boolean matches( String strPattern, String strText )
60 {
61 String strTextTmp = strText + '\u0000';
62 String strPatternTmp = strPattern + '\u0000';
63 int nLength = strPatternTmp.length( );
64 boolean [ ] states = new boolean [ nLength + 1];
65 boolean [ ] old = new boolean [ nLength + 1];
66 old [0] = true;
67
68 for ( int i = 0; i < strTextTmp.length( ); ++i )
69 {
70 char c = strTextTmp.charAt( i );
71 states = new boolean [ nLength + 1];
72
73 for ( int j = 0; j < nLength; ++j )
74 {
75 char p = strPatternTmp.charAt( j );
76 if ( old [j] && p == '*' )
77 {
78 old [j + 1] = true;
79 }
80
81 if ( old [j] && p == c )
82 {
83 states [j + 1] = true;
84 }
85
86 if ( old [j] && p == '?' )
87 {
88 states [j + 1] = true;
89 }
90
91 if ( old [j] && p == '*' )
92 {
93 states [j] = true;
94 }
95
96 if ( old [j] && p == '*' )
97 {
98 states [j + 1] = true;
99 }
100 }
101
102 old = states;
103 }
104
105 return states [nLength];
106 }
107 }