2013-10-19 15:25:32 +02:00
|
|
|
/*
|
2017-09-12 18:22:02 +02:00
|
|
|
* Copyright (C) 2011-2017 Max Kellermann <max.kellermann@gmail.com>
|
2013-10-19 15:25:32 +02:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2014-08-07 15:03:08 +02:00
|
|
|
#ifndef CHAR_UTIL_HXX
|
|
|
|
#define CHAR_UTIL_HXX
|
2013-10-19 15:25:32 +02:00
|
|
|
|
2017-09-12 18:22:02 +02:00
|
|
|
#ifdef _UNICODE
|
|
|
|
#include "WCharUtil.hxx"
|
|
|
|
#endif
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsASCII(const unsigned char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch < 0x80;
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsASCII(const char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return IsASCII((unsigned char)ch);
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsWhitespaceOrNull(const char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return (unsigned char)ch <= 0x20;
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsWhitespaceNotNull(const char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch > 0 && ch <= 0x20;
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2014-08-07 15:05:27 +02:00
|
|
|
/**
|
|
|
|
* Is the given character whitespace? This calls the faster one of
|
|
|
|
* IsWhitespaceOrNull() or IsWhitespaceNotNull(). Use this if you
|
|
|
|
* want the fastest implementation, and you don't care if a null byte
|
|
|
|
* matches.
|
|
|
|
*/
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsWhitespaceFast(const char ch) noexcept
|
2014-08-07 15:05:27 +02:00
|
|
|
{
|
|
|
|
return IsWhitespaceOrNull(ch);
|
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsPrintableASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return (signed char)ch >= 0x20;
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsDigitASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch >= '0' && ch <= '9';
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsUpperAlphaASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch >= 'A' && ch <= 'Z';
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsLowerAlphaASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch >= 'a' && ch <= 'z';
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsAlphaASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return IsUpperAlphaASCII(ch) || IsLowerAlphaASCII(ch);
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr bool
|
2019-07-05 18:05:04 +02:00
|
|
|
IsAlphaNumericASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return IsAlphaASCII(ch) || IsDigitASCII(ch);
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Convert the specified ASCII character (0x00..0x7f) to upper case.
|
|
|
|
* Unlike toupper(), it ignores the system locale.
|
|
|
|
*/
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr char
|
2019-07-05 18:05:04 +02:00
|
|
|
ToUpperASCII(char ch) noexcept
|
2013-10-19 15:25:32 +02:00
|
|
|
{
|
2014-08-07 15:03:08 +02:00
|
|
|
return ch >= 'a' && ch <= 'z'
|
|
|
|
? (ch - ('a' - 'A'))
|
|
|
|
: ch;
|
2013-10-19 15:25:32 +02:00
|
|
|
}
|
|
|
|
|
2014-08-11 18:42:05 +02:00
|
|
|
/**
|
|
|
|
* Convert the specified ASCII character (0x00..0x7f) to lower case.
|
2015-01-15 19:34:02 +01:00
|
|
|
* Unlike tolower(), it ignores the system locale.
|
2014-08-11 18:42:05 +02:00
|
|
|
*/
|
2019-01-21 21:18:23 +01:00
|
|
|
constexpr char
|
2019-07-05 18:05:04 +02:00
|
|
|
ToLowerASCII(char ch) noexcept
|
2014-08-11 18:42:05 +02:00
|
|
|
{
|
|
|
|
return ch >= 'A' && ch <= 'Z'
|
|
|
|
? (ch + ('a' - 'A'))
|
|
|
|
: ch;
|
|
|
|
}
|
|
|
|
|
2013-10-19 15:25:32 +02:00
|
|
|
#endif
|