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
|
// Copyright (C) 2011, 2012 Google Inc.
//
// This file is part of YouCompleteMe.
//
// YouCompleteMe is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// YouCompleteMe 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with YouCompleteMe. If not, see <http://www.gnu.org/licenses/>.
#include "LetterNodeListMap.h"
#include "standard.h"
#include <algorithm>
namespace YouCompleteMe {
const int kNumLetters = NUM_LETTERS;
static const int kLettersIndexStart = 0;
static const int kNumbersIndexStart = 26;
bool IsUppercase( char letter ) {
return 'A' <= letter && letter <= 'Z';
}
int IndexForChar( char letter ) {
if ( IsUppercase( letter ) )
return letter + ( 'a' - 'A' );
return letter;
}
LetterNodeListMap::LetterNodeListMap() {
std::fill( letters_.begin(),
letters_.end(),
static_cast< std::list< LetterNode * >* >( NULL ) );
}
LetterNodeListMap::~LetterNodeListMap() {
for ( uint i = 0; i < letters_.size(); ++i ) {
delete letters_[ i ];
}
}
bool LetterNodeListMap::HasLetter( char letter ) {
int letter_index = IndexForChar( letter );
std::list< LetterNode * > *list = letters_[ letter_index ];
return list;
}
std::list< LetterNode * > &LetterNodeListMap::operator[] ( char letter ) {
int letter_index = IndexForChar( letter );
std::list< LetterNode * > *list = letters_[ letter_index ];
if ( list )
return *list;
letters_[ letter_index ] = new std::list< LetterNode * >();
return *letters_[ letter_index ];
}
std::list< LetterNode * > *LetterNodeListMap::ListPointerAt( char letter ) {
return letters_[ IndexForChar( letter ) ];
}
bool LetterNodeListMap::HasLetter( char letter ) const {
return letters_[ IndexForChar( letter ) ] != NULL;
}
} // namespace YouCompleteMe
|
