|
1
|
1 /****************************************************************************
|
|
|
2 **
|
|
|
3 ** Copyright (C) 1992-2008 Nokia. All rights reserved.
|
|
|
4 ** Copyright 2005 Roberto Raggi <roberto@kdevelop.org>
|
|
|
5 **
|
|
|
6 ** This file is part of Qt Jambi.
|
|
|
7 **
|
|
|
8 ** * Commercial Usage
|
|
|
9 * Licensees holding valid Qt Commercial licenses may use this file in
|
|
|
10 * accordance with the Qt Commercial License Agreement provided with the
|
|
|
11 * Software or, alternatively, in accordance with the terms contained in
|
|
|
12 * a written agreement between you and Nokia.
|
|
|
13 *
|
|
|
14 *
|
|
|
15 * GNU General Public License Usage
|
|
|
16 * Alternatively, this file may be used under the terms of the GNU
|
|
|
17 * General Public License versions 2.0 or 3.0 as published by the Free
|
|
|
18 * Software Foundation and appearing in the file LICENSE.GPL included in
|
|
|
19 * the packaging of this file. Please review the following information
|
|
|
20 * to ensure GNU General Public Licensing requirements will be met:
|
|
|
21 * http://www.fsf.org/licensing/licenses/info/GPLv2.html and
|
|
|
22 * http://www.gnu.org/copyleft/gpl.html. In addition, as a special
|
|
|
23 * exception, Nokia gives you certain additional rights. These rights
|
|
|
24 * are described in the Nokia Qt GPL Exception version 1.2, included in
|
|
|
25 * the file GPL_EXCEPTION.txt in this package.
|
|
|
26 *
|
|
|
27 * Qt for Windows(R) Licensees
|
|
|
28 * As a special exception, Nokia, as the sole copyright holder for Qt
|
|
|
29 * Designer, grants users of the Qt/Eclipse Integration plug-in the
|
|
|
30 * right for the Qt/Eclipse Integration to link to functionality
|
|
|
31 * provided by Qt Designer and its related libraries.
|
|
|
32 *
|
|
|
33 *
|
|
|
34 * If you are unsure which license is appropriate for your use, please
|
|
|
35 * contact the sales department at qt-sales@nokia.com.
|
|
|
36
|
|
|
37 **
|
|
|
38 ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
|
39 ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
40 **
|
|
|
41 ****************************************************************************/
|
|
|
42
|
|
|
43 #ifndef PP_INTERNAL_H
|
|
|
44 #define PP_INTERNAL_H
|
|
|
45
|
|
|
46 #include <algorithm>
|
|
|
47
|
|
|
48 namespace rpp {
|
|
|
49
|
|
|
50 namespace _PP_internal
|
|
|
51 {
|
|
|
52
|
|
|
53 inline void extract_file_path (const std::string &__filename, std::string *__filepath)
|
|
|
54 {
|
|
|
55 std::size_t __index = __filename.rfind (PATH_SEPARATOR);
|
|
|
56
|
|
|
57 if (__index == std::string::npos)
|
|
|
58 *__filepath = "/";
|
|
|
59
|
|
|
60 else
|
|
|
61 __filepath->assign (__filename, 0, __index + 1);
|
|
|
62 }
|
|
|
63
|
|
|
64 template <typename _OutputIterator>
|
|
|
65 void output_line(const std::string &__filename, int __line, _OutputIterator __result)
|
|
|
66 {
|
|
|
67 std::string __msg;
|
|
|
68
|
|
|
69 __msg += "# ";
|
|
|
70
|
|
|
71 char __line_descr[16];
|
|
|
72 pp_snprintf (__line_descr, 16, "%d", __line);
|
|
|
73 __msg += __line_descr;
|
|
|
74
|
|
|
75 __msg += " \"";
|
|
|
76
|
|
|
77 if (__filename.empty ())
|
|
|
78 __msg += "<internal>";
|
|
|
79 else
|
|
|
80 __msg += __filename;
|
|
|
81
|
|
|
82 __msg += "\"\n";
|
|
|
83 std::copy (__msg.begin (), __msg.end (), __result);
|
|
|
84 }
|
|
|
85
|
|
|
86 template <typename _InputIterator>
|
|
|
87 inline bool comment_p (_InputIterator __first, _InputIterator __last) /*const*/
|
|
|
88 {
|
|
|
89 if (__first == __last)
|
|
|
90 return false;
|
|
|
91
|
|
|
92 if (*__first != '/')
|
|
|
93 return false;
|
|
|
94
|
|
|
95 if (++__first == __last)
|
|
|
96 return false;
|
|
|
97
|
|
|
98 return (*__first == '/' || *__first == '*');
|
|
|
99 }
|
|
|
100
|
|
|
101 struct _Compare_string: public std::binary_function<bool, pp_fast_string const *, pp_fast_string const *>
|
|
|
102 {
|
|
|
103 inline bool operator () (pp_fast_string const *__lhs, pp_fast_string const *__rhs) const
|
|
|
104 { return *__lhs < *__rhs; }
|
|
|
105 };
|
|
|
106
|
|
|
107 struct _Equal_to_string: public std::binary_function<bool, pp_fast_string const *, pp_fast_string const *>
|
|
|
108 {
|
|
|
109 inline bool operator () (pp_fast_string const *__lhs, pp_fast_string const *__rhs) const
|
|
|
110 { return *__lhs == *__rhs; }
|
|
|
111 };
|
|
|
112
|
|
|
113 struct _Hash_string: public std::unary_function<std::size_t, pp_fast_string const *>
|
|
|
114 {
|
|
|
115 inline std::size_t operator () (pp_fast_string const *__s) const
|
|
|
116 {
|
|
|
117 char const *__ptr = __s->begin ();
|
|
|
118 std::size_t __size = __s->size ();
|
|
|
119 std::size_t __h = 0;
|
|
|
120
|
|
|
121 for (std::size_t i = 0; i < __size; ++i)
|
|
|
122 __h = (__h << 5) - __h + __ptr [i];
|
|
|
123
|
|
|
124 return __h;
|
|
|
125 }
|
|
|
126 };
|
|
|
127
|
|
|
128 } // _PP_internal
|
|
|
129
|
|
|
130 } // namespace rpp
|
|
|
131
|
|
|
132 #endif // PP_INTERNAL_H
|
|
|
133
|
|
|
134 // kate: space-indent on; indent-width 2; replace-tabs on;
|
