SciTE - Open Source Text Editor for Windows & Linux - [21] :: Программы

Сижу ни диалапе такчто выкладываю
текст процедуры автокомплита для api+файл сдесь.
Работает и ладно

Начал разбираться с фолдингом SQL.
Может ктонибудь пытался раньше разбираться, буду рад любой помощи.

bool SciTEBase::StartAutoComplete() {
SString line = GetLine();
    int current = GetCaretInLine();
     if (current >= line.size())
         return false;

    int startword = current;
    // Autocompletion of pure numbers is mostly an annoyance
    bool allNumber = true;
    while (startword > 0 && wordCharacters.contains(line[startword - 1])) {
        startword--;
        if (line[startword] < '0' || line[startword] > '9') {
            allNumber = false;
        }
    }
    bool onlyOneWord=false;
    if (startword == current || allNumber)
        return true;
    SString root = line.substr(startword, current - startword);
    int doclen = LengthDocument();
    TextToFind ft = {{0, 0}, 0, {0, 0}};
    ft.lpstrText = const_cast<char*>(root.c_str());
    ft.chrg.cpMin = 0;
    ft.chrgText.cpMin = 0;
    ft.chrgText.cpMax = 0;
    int flags = SCFIND_WORDSTART | (autoCompleteIgnoreCase ? 0 : SCFIND_MATCHCASE);
    int posCurrentWord = SendEditor(SCI_GETCURRENTPOS) - root.length();
    unsigned int minWordLength = 0;
    unsigned int nwords = 0;

    // wordsNear contains a list of words separated by single spaces and with a space
    // at the start and end. This makes it easy to search for words.
    SString wordsNear;
    wordsNear.setsizegrowth(1000);
    wordsNear += " ";

    for (;;) {    // search all the document
        ft.chrg.cpMax = doclen;
        int posFind = SendEditorString(SCI_FINDTEXT, flags, reinterpret_cast<char *>(&ft));
        if (posFind == -1 || posFind >= doclen)
            break;
        if (posFind == posCurrentWord) {
            ft.chrg.cpMin = posFind + root.length();
            continue;
        }
        // Grab the word and put spaces around it
        const unsigned int wordMaxSize = 800;
        char wordstart[wordMaxSize];
        wordstart[0] = ' ';
        GetRange(wEditor, posFind, Platform::Minimum(posFind + wordMaxSize - 3, doclen), wordstart + 1);
        char *wordend = wordstart + 1 + root.length();
        while (iswordcharforsel(*wordend))            wordend++;
        *wordend++ = ' ';
        *wordend = '\0';
        unsigned int wordlen = wordend - wordstart - 2;
        if (wordlen > root.length()) {
            if (!wordsNear.contains(wordstart)) {    // add a new entry
                wordsNear += wordstart + 1;
                if (minWordLength < wordlen)
                    minWordLength = wordlen;

                nwords++;
                if (onlyOneWord && nwords > 1) {
                    return true;
                }
            }
        }
        ft.chrg.cpMin = posFind + wordlen;
    }

    if (apis) {
        char *words = apis.GetNearestWords(root.c_str(), root.length(),
                                            autoCompleteIgnoreCase, calltipParametersStart[0]);
        if (words) {
wordsNear += words;
            delete []words;
        }
    }

    size_t length = wordsNear.length();
if ((length > 2) && (!onlyOneWord || (minWordLength > root.length()))) {
        WordList wl;
        wl.Set(wordsNear.c_str());
        char *words = wl.GetNearestWords("", 0, autoCompleteIgnoreCase);
EliminateDuplicateWords(words);
        SendEditorString(SCI_AUTOCSHOW, root.length(), words);
        delete []words;
    } else {
        SendEditor(SCI_AUTOCCANCEL);
    }
    return true;

}

Модерирует : gyra, Maz
Widok (09-10-2007 14:48): лимит страниц. продолжаем здесь	Версия для печати • Подписаться • Добавить в закладки
Страницы: 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