96 lines
3.6 KiB
C#
96 lines
3.6 KiB
C#
// (c) Copyright Ascensio System SIA 2010-2022
|
|
//
|
|
// This program is a free software product.
|
|
// You can redistribute it and/or modify it under the terms
|
|
// of the GNU Affero General Public License (AGPL) version 3 as published by the Free Software
|
|
// Foundation. In accordance with Section 7(a) of the GNU AGPL 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 details, see
|
|
// the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
|
|
//
|
|
// You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia, EU, LV-1021.
|
|
//
|
|
// The interactive user interfaces in modified source and object code versions of the Program must
|
|
// display Appropriate Legal Notices, as required under Section 5 of the GNU AGPL version 3.
|
|
//
|
|
// Pursuant to Section 7(b) of the License you must retain the original Product logo when
|
|
// distributing the program. Pursuant to Section 7(e) we decline to grant you any rights under
|
|
// trademark law for use of our trademarks.
|
|
//
|
|
// All the Product's GUI elements, including illustrations and icon sets, as well as technical writing
|
|
// content are licensed under the terms of the Creative Commons Attribution-ShareAlike 4.0
|
|
// International. See the License terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
|
|
|
|
namespace ASC.Data.Storage;
|
|
|
|
public static 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;
|
|
|
|
var i = 0;
|
|
while (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;
|
|
}
|
|
}
|