68 lines
2.3 KiB
C++
68 lines
2.3 KiB
C++
/*
|
|
* Copyright 2013-2018 Max Kellermann <max.kellermann@gmail.com>
|
|
*
|
|
* 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.
|
|
*
|
|
* 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
|
|
* FOUNDATION 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.
|
|
*/
|
|
|
|
#include "WStringCompare.hxx"
|
|
|
|
bool
|
|
StringEndsWith(const wchar_t *haystack, const wchar_t *needle) noexcept
|
|
{
|
|
const size_t haystack_length = StringLength(haystack);
|
|
const size_t needle_length = StringLength(needle);
|
|
|
|
return haystack_length >= needle_length &&
|
|
StringIsEqual(haystack + haystack_length - needle_length, needle);
|
|
}
|
|
|
|
bool
|
|
StringEndsWithIgnoreCase(const wchar_t *haystack,
|
|
const wchar_t *needle) noexcept
|
|
{
|
|
const size_t haystack_length = StringLength(haystack);
|
|
const size_t needle_length = StringLength(needle);
|
|
|
|
return haystack_length >= needle_length &&
|
|
StringIsEqualIgnoreCase(haystack + haystack_length - needle_length,
|
|
needle);
|
|
}
|
|
|
|
const wchar_t *
|
|
FindStringSuffix(const wchar_t *p, const wchar_t *suffix) noexcept
|
|
{
|
|
const size_t p_length = StringLength(p);
|
|
const size_t suffix_length = StringLength(suffix);
|
|
|
|
if (p_length < suffix_length)
|
|
return nullptr;
|
|
|
|
const auto *q = p + p_length - suffix_length;
|
|
return memcmp(q, suffix, suffix_length * sizeof(*suffix)) == 0
|
|
? q
|
|
: nullptr;
|
|
}
|