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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Script Generator project on Qt Labs.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef PP_INTERNAL_H
#define PP_INTERNAL_H
#include <algorithm>
#include <stdio.h>
namespace rpp {
namespace _PP_internal
{
inline void extract_file_path (const std::string &__filename, std::string *__filepath)
{
std::size_t __index = __filename.rfind (PATH_SEPARATOR);
if (__index == std::string::npos)
*__filepath = "/";
else
__filepath->assign (__filename, 0, __index + 1);
}
template <typename _OutputIterator>
void output_line(const std::string &__filename, int __line, _OutputIterator __result)
{
std::string __msg;
__msg += "# ";
char __line_descr[16];
pp_snprintf (__line_descr, 16, "%d", __line);
__msg += __line_descr;
__msg += " \"";
if (__filename.empty ())
__msg += "<internal>";
else
__msg += __filename;
__msg += "\"\n";
std::copy (__msg.begin (), __msg.end (), __result);
}
template <typename _InputIterator>
inline bool comment_p (_InputIterator __first, _InputIterator __last) /*const*/
{
if (__first == __last)
return false;
if (*__first != '/')
return false;
if (++__first == __last)
return false;
return (*__first == '/' || *__first == '*');
}
struct _Compare_string: public std::binary_function<bool, pp_fast_string const *, pp_fast_string const *>
{
inline bool operator () (pp_fast_string const *__lhs, pp_fast_string const *__rhs) const
{ return *__lhs < *__rhs; }
};
struct _Equal_to_string: public std::binary_function<bool, pp_fast_string const *, pp_fast_string const *>
{
inline bool operator () (pp_fast_string const *__lhs, pp_fast_string const *__rhs) const
{ return *__lhs == *__rhs; }
};
struct _Hash_string: public std::unary_function<std::size_t, pp_fast_string const *>
{
inline std::size_t operator () (pp_fast_string const *__s) const
{
char const *__ptr = __s->begin ();
std::size_t __size = __s->size ();
std::size_t __h = 0;
for (std::size_t i = 0; i < __size; ++i)
__h = (__h << 5) - __h + __ptr [i];
return __h;
}
};
} // _PP_internal
} // namespace rpp
#endif // PP_INTERNAL_H
// kate: space-indent on; indent-width 2; replace-tabs on;
|
