File indexing completed on 2024-04-21 04:36:04

 /*
    Copyright 2007 David Nolden <david.nolden.kdevelop@art-master.de>
 
    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Library General Public
    License version 2 as published by the Free Software Foundation.
 
    This library 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
    Library General Public License for more details.
 
    You should have received a copy of the GNU Library General Public License
    along with this library; see the file COPYING.LIB.  If not, write to
    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
    Boston, MA 02110-1301, USA.
  */
 
 #include <language/duchain/stringhelpers.h>
 #include <QString>
 #include <QChar>
 
 namespace Utils {
 enum { T_ACCESS, T_PAREN, T_BRACKET, T_IDE, T_UNKNOWN, T_TEMP };
 
 int expressionAt(const QString& text, int index)
 {
     if (index == 0) {
         return 0;
     }
 
     int last = T_UNKNOWN;
     int start = index;
     --index;
 
     while (index > 0) {
         while (index > 0 && text[index].isSpace()) {
             --index;
         }
 
         QChar ch = text[index];
         QString ch2 = text.mid(index - 1, 2);
         if ((last != T_IDE) && (ch.isLetterOrNumber() || ch == '_' || ch == '$')) {
             while (index > 0 && (text[index].isLetterOrNumber() || text[index] == '_' || text[index] == '$')) {
                 --index;
             }
             last = T_IDE;
         } else if (last != T_IDE && ch == ')') {
             int count = 0;
             while (index > 0) {
                 QChar ch = text[index];
                 if (ch == '(') {
                     ++count;
                 } else if (ch == ')') {
                     --count;
                 }
                 --index;
                 if (count == 0) {
                     //index;
                     last = T_PAREN;
                     break;
                 }
             }
         } else if (ch == ']') {
             int count = 0;
             while (index > 0) {
                 QChar ch = text[index];
                 if (ch == '[') {
                     ++count;
                 } else if (ch == ']') {
                     --count;
                 } else if (count == 0) {
                     //--index;
                     last = T_BRACKET;
                     break;
                 }
                 --index;
             }
         } else if (ch2 == "::") {
             index -= 2;
             last = T_ACCESS;
         } else if (ch2 == "->") {
             index -= 2;
             last = T_ACCESS;
         } else {
             if (start > index) {
                 ++index;
             }
             last = T_UNKNOWN;
             break;
         }
     }
 
     ///If we're at the first item, the above algorithm cannot be used safely,
     ///so just determine whether the sign is valid for the beginning of an expression, if it isn't reject it.
     if (index == 0 && start > index && !(text[index].isLetterOrNumber() || text[index] == '_' || text[index] == '$' || text[index] == ':')) {
         ++index;
     }
 
     return index;
 }
 }