summaryrefslogtreecommitdiffstats
blob: 2fd0547431ec343da23a75ba636085f37fda2301 (plain)
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
/*
 * Copyright (c) 2010 Kevin Smith
 * Licensed under the GNU General Public License v3.
 * See Documentation/Licenses/GPLv3.txt for more information.
 */

#include "SwifTools/TabComplete.h"

#include <algorithm>

#include "Swiften/Base/foreach.h"

namespace Swift {

void TabComplete::addWord(const String& word) {
	words_.push_back(word);
	if (word.getLowerCase().beginsWith(lastShort_)) {
		lastCompletionCandidates_.push_back(word);
	}
}

void TabComplete::removeWord(const String& word) {
	words_.erase(std::remove(words_.begin(), words_.end(), word), words_.end());
	lastCompletionCandidates_.erase(std::remove(lastCompletionCandidates_.begin(), lastCompletionCandidates_.end(), word), lastCompletionCandidates_.end());
}

String TabComplete::completeWord(const String& word) {
	if (word == lastCompletion_) {
		if (lastCompletionCandidates_.size() != 0) {
			size_t match = 0;
			for (match = 0; match < lastCompletionCandidates_.size(); match++) {
				if (lastCompletionCandidates_[match] == lastCompletion_) {
					break;
				}
			}
			size_t nextIndex = match + 1;
			nextIndex = nextIndex >= lastCompletionCandidates_.size() ? 0 : nextIndex;
			lastCompletion_ = lastCompletionCandidates_[nextIndex];
		}		
	} else {
		lastShort_ = word.getLowerCase();
		lastCompletionCandidates_.clear();
		foreach (String candidate, words_) {
			if (candidate.getLowerCase().beginsWith(word.getLowerCase())) {
				lastCompletionCandidates_.push_back(candidate);
			}
		}
		lastCompletion_ = lastCompletionCandidates_.size() > 0 ? lastCompletionCandidates_[0] : word;
	}
	return lastCompletion_;
}

}