123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384 |
- // 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
|