1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
/* -*- C++ -*-
* Cppcheck - A tool for static C/C++ code analysis
* Copyright (C) 2007-2024 Cppcheck team.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
//---------------------------------------------------------------------------
#ifndef matchcompilerH
#define matchcompilerH
#include <string>
namespace MatchCompiler {
template<unsigned int n>
class ConstString {
public:
using StringRef = const char (&)[n];
explicit ConstString(StringRef s)
: _s(s) {}
operator StringRef() const {
return _s;
}
private:
StringRef _s;
};
template<unsigned int n>
inline bool equalN(const char s1[], const char s2[])
{
return (*s1 == *s2) && equalN<n-1>(s1+1, s2+1);
}
template<>
inline bool equalN<0>(const char /*s1*/[], const char /*s2*/[])
{
return true;
}
template<unsigned int n>
inline bool operator==(const std::string & s1, ConstString<n> const & s2)
{
return equalN<n>(s1.c_str(), s2);
}
template<unsigned int n>
inline bool operator!=(const std::string & s1, ConstString<n> const & s2)
{
return !operator==(s1,s2);
}
template<unsigned int n>
inline ConstString<n> makeConstString(const char (&s)[n])
{
return ConstString<n>(s);
}
}
#endif // matchcompilerH
|
