2012-04-15 23:28:46 -04:00
|
|
|
// Copyright (C) 2011, 2012 Strahinja Val Markovic <val@markovic.io>
|
2012-04-15 19:57:10 -04:00
|
|
|
//
|
|
|
|
// 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/>.
|
|
|
|
|
|
|
|
#ifndef CANDIDATE_H_R5LZH6AC
|
|
|
|
#define CANDIDATE_H_R5LZH6AC
|
|
|
|
|
|
|
|
#include "LetterNode.h"
|
|
|
|
|
|
|
|
#include <boost/scoped_ptr.hpp>
|
|
|
|
#include <boost/utility.hpp>
|
|
|
|
|
|
|
|
#include <string>
|
|
|
|
#include <bitset>
|
|
|
|
|
2013-01-19 23:10:52 -05:00
|
|
|
namespace YouCompleteMe {
|
2012-04-15 19:57:10 -04:00
|
|
|
|
2012-09-06 14:37:22 -04:00
|
|
|
class Result;
|
|
|
|
|
2012-04-15 19:57:10 -04:00
|
|
|
typedef std::bitset< NUM_LETTERS > Bitset;
|
|
|
|
|
|
|
|
Bitset LetterBitsetFromString( const std::string &text );
|
|
|
|
|
2013-04-28 16:21:13 -04:00
|
|
|
// Public for tests
|
|
|
|
std::string GetWordBoundaryChars( const std::string &text );
|
|
|
|
|
2013-01-19 23:10:52 -05:00
|
|
|
class Candidate : boost::noncopyable {
|
2012-04-15 19:57:10 -04:00
|
|
|
public:
|
|
|
|
|
|
|
|
explicit Candidate( const std::string &text );
|
|
|
|
|
2013-01-19 23:10:52 -05:00
|
|
|
inline const std::string &Text() const {
|
2012-04-15 19:57:10 -04:00
|
|
|
return text_;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns true if the candidate contains the bits from the query (it may also
|
|
|
|
// contain other bits)
|
2013-01-19 23:10:52 -05:00
|
|
|
inline bool MatchesQueryBitset( const Bitset &query_bitset ) const {
|
2012-04-15 19:57:10 -04:00
|
|
|
return ( letters_present_ & query_bitset ) == query_bitset;
|
|
|
|
}
|
|
|
|
|
2013-03-02 01:18:43 -05:00
|
|
|
Result QueryMatchResult( const std::string &query,
|
|
|
|
bool case_sensitive ) const;
|
2012-04-15 19:57:10 -04:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
std::string text_;
|
|
|
|
std::string word_boundary_chars_;
|
2012-04-17 01:13:05 -04:00
|
|
|
bool text_is_lowercase_;
|
2012-04-15 19:57:10 -04:00
|
|
|
Bitset letters_present_;
|
|
|
|
boost::scoped_ptr< LetterNode > root_node_;
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace YouCompleteMe
|
|
|
|
|
|
|
|
#endif /* end of include guard: CANDIDATE_H_R5LZH6AC */
|
|
|
|
|