/******************************************************************************** Copyright (C) 1992-2006 Trolltech ASA. All rights reserved.**** This file is part of the QtCore module of the Qt Toolkit.**** This file may be used under the terms of the GNU General Public** License version 2.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 GNU** General Public Licensing requirements will be met:** http://www.trolltech.com/products/qt/opensource.html**** If you are unsure which license is appropriate for your use, please** review the following information:** http://www.trolltech.com/products/qt/licensing.html or contact the** sales department at sales@trolltech.com.**** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.******************************************************************************/#ifndef QMETAOBJECT_P_H#define QMETAOBJECT_P_H////  W A R N I N G//  -------------//// This file is not part of the Qt API.  It exists for the convenience// of moc.  This header file may change from version to version without notice,// or even be removed.//// We mean it.//#ifndef UTILS_H// mirrored in moc's utils.hstatic inline bool is_ident_char(char s){    return ((s >= 'a' && s <= 'z')            || (s >= 'A' && s <= 'Z')            || (s >= '0' && s <= '9')            || s == '_'       );}static inline bool is_space(char s){    return (s == ' ' || s == '\t');}#endif// This code is shared with moc.cppstatic QByteArray normalizeTypeInternal(const char *t, const char *e, bool fixScope = false, bool adjustConst = true){    int len = e - t;    /*      Convert 'char const *' into 'const char *'. Start at index 1,      not 0, because 'const char *' is already OK.    */    QByteArray constbuf;    for (int i = 1; i < len; i++) {        if ( t[i] == 'c'             && strncmp(t + i + 1, "onst", 4) == 0             && (i + 5 >= len || !is_ident_char(t[i + 5]))             && !is_ident_char(t[i-1])            ) {            constbuf = QByteArray(t, len);            if (is_space(t[i-1]))                constbuf.remove(i-1, 6);            else                constbuf.remove(i, 5);            constbuf.prepend("const ");            t = constbuf.data();            e = constbuf.data() + constbuf.length();            break;        }        /*          We musn't convert 'char * const *' into 'const char **'          and we must beware of 'Bar<const Bla>'.        */        if (t[i] == '&' || t[i] == '*' ||t[i] == '<')            break;    }    if (adjustConst && e > t + 6 && strncmp("const ", t, 6) == 0) {        if (*(e-1) == '&') { // treat const reference as value            t += 6;            --e;        } else if (is_ident_char(*(e-1))) { // treat const value as value            t += 6;        }    }    QByteArray result;    result.reserve(len);    // some type substitutions for 'unsigned x'    if (strncmp("unsigned ", t, 9) == 0) {        if (strncmp("int", t+9, 3) == 0) {            t += 9+3;            result += "uint";        } else if (strncmp("long", t+9, 4) == 0                   // preserve '[unsigned] long int'                   && (strlen(t + 9 + 4) < 4                       || strncmp(t + 9 + 4, " int", 4) != 0                      )                   // preserve '[unsigned] long long'                   && (strlen(t + 9 + 4) < 5                       || strncmp(t + 9 + 4, " long", 5) != 0                      )                  ) {            t += 9+4;            result += "ulong";        }    }    while (t != e) {        char c = *t++;        if (fixScope && c == ':' && *t == ':' ) {            ++t;            c = *t++;            int i = result.size() - 1;            while (i >= 0 && is_ident_char(result.at(i)))                   --i;            result.resize(i + 1);        }        result += c;        if (c == '<') {            //template recursion            const char* tt = t;            int templdepth = 1;            while (t != e) {                c = *t++;                if (c == '<')                    ++templdepth;                if (c == '>')                    --templdepth;                if (templdepth == 0) {                    result += normalizeTypeInternal(tt, t-1, fixScope, false);                    result += c;                    if (*t == '>')                        result += ' '; // avoid >>                    break;                }            }        }    }    return result;}#endif