96 lines
3.8 KiB
C#
96 lines
3.8 KiB
C#
/*
|
|
*
|
|
* (c) Copyright Ascensio System Limited 2010-2018
|
|
*
|
|
* This program is freeware. You can redistribute it and/or modify it under the terms of the GNU
|
|
* General Public License (GPL) version 3 as published by the Free Software Foundation (https://www.gnu.org/copyleft/gpl.html).
|
|
* In accordance with Section 7(a) of the GNU GPL its Section 15 shall be amended to the effect that
|
|
* Ascensio System SIA expressly excludes the warranty of non-infringement of any third-party rights.
|
|
*
|
|
* THIS PROGRAM IS DISTRIBUTED WITHOUT ANY WARRANTY; WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR
|
|
* FITNESS FOR A PARTICULAR PURPOSE. For more details, see GNU GPL at https://www.gnu.org/copyleft/gpl.html
|
|
*
|
|
* You can contact Ascensio System SIA by email at sales@onlyoffice.com
|
|
*
|
|
* The interactive user interfaces in modified source and object code versions of ONLYOFFICE must display
|
|
* Appropriate Legal Notices, as required under Section 5 of the GNU GPL version 3.
|
|
*
|
|
* Pursuant to Section 7 § 3(b) of the GNU GPL you must retain the original ONLYOFFICE logo which contains
|
|
* relevant author attributions when distributing the software. If the display of the logo in its graphic
|
|
* form is not reasonably feasible for technical reasons, you must include the words "Powered by ONLYOFFICE"
|
|
* in every copy of the program you distribute.
|
|
* Pursuant to Section 7 § 3(e) we decline to grant you any rights under trademark law for use of our trademarks.
|
|
*
|
|
*/
|
|
|
|
|
|
namespace ASC.Data.Storage
|
|
{
|
|
public class Wildcard
|
|
{
|
|
public static bool IsMatch(string pattern, string input)
|
|
{
|
|
return IsMatch(pattern, input, false);
|
|
}
|
|
|
|
public static bool IsMatch(string pattern, string input, bool caseInsensitive)
|
|
{
|
|
var offsetInput = 0;
|
|
var isAsterix = false;
|
|
|
|
int i;
|
|
for (i = 0; i < pattern.Length;)
|
|
{
|
|
switch (pattern[i])
|
|
{
|
|
case '?':
|
|
isAsterix = false;
|
|
offsetInput++;
|
|
break;
|
|
case '*':
|
|
isAsterix = true;
|
|
while (i < pattern.Length && pattern[i] == '*')
|
|
{
|
|
i++;
|
|
}
|
|
if (i >= pattern.Length)
|
|
{
|
|
return true;
|
|
}
|
|
continue;
|
|
default:
|
|
if (offsetInput >= input.Length)
|
|
{
|
|
return false;
|
|
}
|
|
if ((caseInsensitive ? char.ToLower(input[offsetInput]) : input[offsetInput]) != (caseInsensitive ? char.ToLower(pattern[i]) : pattern[i]))
|
|
{
|
|
if (!isAsterix)
|
|
{
|
|
return false;
|
|
}
|
|
offsetInput++;
|
|
continue;
|
|
}
|
|
offsetInput++;
|
|
break;
|
|
} // end switch
|
|
i++;
|
|
} // end for
|
|
|
|
// have we finished parsing our input?
|
|
if (i > input.Length)
|
|
{
|
|
return false;
|
|
}
|
|
// do we have any lingering asterixes we need to skip?
|
|
while (i < pattern.Length && pattern[i] == '*')
|
|
{
|
|
++i;
|
|
}
|
|
// final evaluation. The index should be pointing at the
|
|
// end of the string.
|
|
return (offsetInput == input.Length);
|
|
}
|
|
}
|
|
} |