270 lines
6.4 KiB
C++
270 lines
6.4 KiB
C++
/*
|
|
* This file is a part of PikoTools
|
|
* and is distributed under the (new) BSD licence.
|
|
* Author: Tomasz Sowa <t.sowa@ttmath.org>
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 2017-2018, Tomasz Sowa
|
|
* All rights reserved.
|
|
*
|
|
* 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.
|
|
*
|
|
* * Neither the name Tomasz Sowa nor the names of contributors to this
|
|
* project may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* 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 COPYRIGHT OWNER 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.
|
|
*/
|
|
|
|
#ifndef headerfile_picotools_convert_text
|
|
#define headerfile_picotools_convert_text
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
namespace PT
|
|
{
|
|
|
|
bool IsWhite(wchar_t c, bool check_additional_chars = true, bool treat_new_line_as_white = true);
|
|
|
|
|
|
bool IsDigit(wchar_t c, int base = 10, int * digit = 0);
|
|
|
|
|
|
template<class CharType>
|
|
CharType * SkipWhite(CharType * str, bool check_additional_chars = true, bool treat_new_line_as_white = true)
|
|
{
|
|
while( IsWhite(static_cast<wchar_t>(*str), check_additional_chars, treat_new_line_as_white) )
|
|
{
|
|
str += 1;
|
|
}
|
|
|
|
return str;
|
|
}
|
|
|
|
|
|
/*
|
|
*
|
|
* str_end is pointing at the end of the string (the last item + one)
|
|
*
|
|
* return value is a pointer to the first white character after a non-white character at the end
|
|
* or to the last+one if there is no any white characters
|
|
*
|
|
*/
|
|
template<class CharType>
|
|
CharType * SkipWhiteFromBack(CharType * str_begin, CharType * str_end, bool check_additional_chars = true, bool treat_new_line_as_white = true)
|
|
{
|
|
while( str_end > str_begin && IsWhite(static_cast<wchar_t>(*(str_end-1)), check_additional_chars, treat_new_line_as_white) )
|
|
{
|
|
str_end -= 1;
|
|
}
|
|
|
|
return str_end;
|
|
}
|
|
|
|
|
|
template<class CharType>
|
|
CharType * SkipWhiteFromBack(CharType * str, bool check_additional_chars = true, bool treat_new_line_as_white = true)
|
|
{
|
|
CharType * str_begin = str;
|
|
|
|
while( *str != 0 )
|
|
{
|
|
str += 1;
|
|
}
|
|
|
|
return SkipWhiteFromBack(str_begin, str, check_additional_chars, treat_new_line_as_white);
|
|
}
|
|
|
|
|
|
wchar_t ToLower(wchar_t c);
|
|
wchar_t ToUpper(wchar_t c);
|
|
|
|
|
|
// change to a template
|
|
void ToLower(std::wstring & s);
|
|
void ToUpper(std::wstring & s);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
int CompareNoCase(const StringType1 * str1, const StringType2 * str2)
|
|
{
|
|
while( *str1 && *str2 && ToLower(*str1) == ToLower(*str2) )
|
|
{
|
|
++str1;
|
|
++str2;
|
|
}
|
|
|
|
if( *str1 == 0 && *str2 == 0 )
|
|
return 0;
|
|
|
|
return (int)ToLower(*str1) - (int)ToLower(*str2);
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
int CompareNoCase(const StringType1 & str1, const StringType2 & str2)
|
|
{
|
|
return CompareNoCase(str1.c_str(), str2.c_str());
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
int CompareNoCasep(const StringType1 * str1, const StringType2 * str2)
|
|
{
|
|
return CompareNoCase(str1, str2);
|
|
}
|
|
|
|
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
int CompareNoCase(const StringType1 * str1_begin, const StringType1 * str1_end, const StringType2 * str2)
|
|
{
|
|
while( str1_begin < str1_end && *str2 && ToLower(*str1_begin) == ToLower(*str2) )
|
|
{
|
|
++str1_begin;
|
|
++str2;
|
|
}
|
|
|
|
if( str1_begin == str1_end && *str2 == 0 )
|
|
return 0;
|
|
|
|
wchar_t str1_char = 0;
|
|
|
|
if( str1_begin < str1_end )
|
|
str1_char = *str1_begin;
|
|
|
|
return (int)ToLower(str1_char) - (int)ToLower(*str2);
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool EqualNoCase(const StringType1 * str1, const StringType2 * str2)
|
|
{
|
|
return CompareNoCase(str1, str2) == 0;
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool EqualNoCase(const StringType1 & str1, const StringType2 & str2)
|
|
{
|
|
return EqualNoCase(str1.c_str(), str2.c_str());
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool EqualNoCasep(const StringType1 * str1, const StringType2 * str2)
|
|
{
|
|
return EqualNoCase(str1, str2);
|
|
}
|
|
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool EqualNoCase(const StringType1 * str1_begin, const StringType1 * str1_end, const StringType2 * str2)
|
|
{
|
|
return CompareNoCase(str1_begin, str1_end, str2) == 0;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubStringp(const StringType1 * short_str, const StringType2 * long_str)
|
|
{
|
|
while( *short_str && *long_str && wchar_t(*short_str) == wchar_t(*long_str) )
|
|
{
|
|
++short_str;
|
|
++long_str;
|
|
}
|
|
|
|
if( *short_str == 0 )
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubString(const StringType1 * short_str, const StringType2 * long_str)
|
|
{
|
|
return IsSubStringp(short_str, long_str);
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubString(const StringType1 & short_str, const StringType2 & long_str)
|
|
{
|
|
return IsSubStringp(short_str.c_str(), long_str.c_str());
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubStringNoCasep(const StringType1 * short_str, const StringType2 * long_str)
|
|
{
|
|
while( *short_str && *long_str && ToLower(*short_str) == ToLower(*long_str) )
|
|
{
|
|
++short_str;
|
|
++long_str;
|
|
}
|
|
|
|
if( *short_str == 0 )
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubStringNoCase(const StringType1 * short_str, const StringType2 * long_str)
|
|
{
|
|
return IsSubStringNoCasep(short_str, long_str);
|
|
}
|
|
|
|
|
|
template<class StringType1, class StringType2>
|
|
bool IsSubStringNoCase(const StringType1 & short_str, const StringType2 & long_str)
|
|
{
|
|
return IsSubStringNoCasep(short_str.c_str(), long_str.c_str());
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
#endif
|