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/>.
|
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
#include "IdentifierCompleter.h"
|
2012-07-06 17:06:21 -04:00
|
|
|
#include "standard.h"
|
2012-07-12 01:08:04 -04:00
|
|
|
#include "CandidateRepository.h"
|
2012-07-12 01:14:28 -04:00
|
|
|
#include "Candidate.h"
|
2012-04-29 19:36:31 -04:00
|
|
|
#include "Utils.h"
|
2012-04-15 19:57:10 -04:00
|
|
|
|
2012-05-06 02:48:22 -04:00
|
|
|
#include <boost/bind.hpp>
|
|
|
|
#include <boost/make_shared.hpp>
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
using boost::packaged_task;
|
|
|
|
using boost::bind;
|
|
|
|
using boost::unique_future;
|
|
|
|
using boost::make_shared;
|
|
|
|
using boost::shared_ptr;
|
|
|
|
using boost::bind;
|
|
|
|
using boost::thread;
|
2012-04-29 22:51:20 -04:00
|
|
|
|
2012-04-15 19:57:10 -04:00
|
|
|
namespace YouCompleteMe
|
|
|
|
{
|
|
|
|
|
2012-07-15 23:49:56 -04:00
|
|
|
extern const unsigned int MAX_ASYNC_THREADS = 4;
|
|
|
|
extern const unsigned int MIN_ASYNC_THREADS = 2;
|
|
|
|
|
2012-05-06 02:48:22 -04:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
2012-07-06 15:14:25 -04:00
|
|
|
void ThreadMain( LatestTask &latest_task )
|
2012-05-06 02:48:22 -04:00
|
|
|
{
|
|
|
|
while ( true )
|
|
|
|
{
|
2012-07-06 15:14:25 -04:00
|
|
|
( *latest_task.Get() )();
|
2012-05-06 02:48:22 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} // unnamed namespace
|
|
|
|
|
2012-04-29 22:51:20 -04:00
|
|
|
|
2012-07-12 01:08:04 -04:00
|
|
|
IdentifierCompleter::IdentifierCompleter()
|
|
|
|
: candidate_repository_( CandidateRepository::Instance() ),
|
|
|
|
threading_enabled_( false )
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
IdentifierCompleter::IdentifierCompleter(
|
|
|
|
const std::vector< std::string > &candidates )
|
2012-07-12 01:08:04 -04:00
|
|
|
: candidate_repository_( CandidateRepository::Instance() ),
|
|
|
|
threading_enabled_( false )
|
2012-04-15 23:10:39 -04:00
|
|
|
{
|
2012-05-12 18:20:03 -04:00
|
|
|
AddCandidatesToDatabase( candidates, "", "", true );
|
2012-04-15 23:10:39 -04:00
|
|
|
}
|
|
|
|
|
2012-04-29 19:36:31 -04:00
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
IdentifierCompleter::IdentifierCompleter(
|
|
|
|
const std::vector< std::string > &candidates,
|
|
|
|
const std::string &filetype,
|
|
|
|
const std::string &filepath )
|
2012-07-12 01:08:04 -04:00
|
|
|
: candidate_repository_( CandidateRepository::Instance() ),
|
|
|
|
threading_enabled_( false )
|
2012-04-29 19:36:31 -04:00
|
|
|
{
|
2012-05-12 18:20:03 -04:00
|
|
|
AddCandidatesToDatabase( candidates, filetype, filepath, true );
|
2012-04-29 19:36:31 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-06 02:48:22 -04:00
|
|
|
// We need this mostly so that we can not use it in tests. Apparently the
|
|
|
|
// GoogleTest framework goes apeshit on us if we enable threads by default.
|
2012-07-11 02:13:12 -04:00
|
|
|
void IdentifierCompleter::EnableThreading()
|
2012-05-06 02:48:22 -04:00
|
|
|
{
|
|
|
|
threading_enabled_ = true;
|
|
|
|
InitThreads();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
void IdentifierCompleter::AddCandidatesToDatabase(
|
2012-05-08 01:10:28 -04:00
|
|
|
const std::vector< std::string > &new_candidates,
|
|
|
|
const std::string &filetype,
|
2012-05-12 18:20:03 -04:00
|
|
|
const std::string &filepath,
|
|
|
|
bool clear_database )
|
2012-04-15 19:57:10 -04:00
|
|
|
{
|
2012-05-11 00:56:19 -04:00
|
|
|
std::list< const Candidate *> &candidates =
|
|
|
|
GetCandidateList( filetype, filepath );
|
2012-05-12 18:20:03 -04:00
|
|
|
|
|
|
|
if ( clear_database )
|
|
|
|
candidates.clear();
|
2012-04-29 22:51:20 -04:00
|
|
|
|
2012-07-12 01:08:04 -04:00
|
|
|
std::vector< const Candidate* > repository_candidates =
|
|
|
|
candidate_repository_.GetCandidatesForStrings( new_candidates );
|
2012-04-29 22:51:20 -04:00
|
|
|
|
2012-07-12 01:08:04 -04:00
|
|
|
candidates.insert( candidates.end(),
|
|
|
|
repository_candidates.begin(),
|
|
|
|
repository_candidates.end() );
|
2012-04-15 19:57:10 -04:00
|
|
|
}
|
|
|
|
|
2012-04-29 19:36:31 -04:00
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
std::vector< std::string > IdentifierCompleter::CandidatesForQuery(
|
2012-05-08 01:10:28 -04:00
|
|
|
const std::string &query ) const
|
2012-04-29 22:51:20 -04:00
|
|
|
{
|
2012-05-08 01:10:28 -04:00
|
|
|
return CandidatesForQueryAndType( query, "" );
|
2012-04-29 22:51:20 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
std::vector< std::string > IdentifierCompleter::CandidatesForQueryAndType(
|
2012-05-08 01:10:28 -04:00
|
|
|
const std::string &query,
|
|
|
|
const std::string &filetype ) const
|
2012-05-06 02:48:22 -04:00
|
|
|
{
|
|
|
|
std::vector< Result > results;
|
|
|
|
ResultsForQueryAndType( query, filetype, results );
|
|
|
|
|
2012-05-08 01:10:28 -04:00
|
|
|
std::vector< std::string > candidates;
|
2012-07-12 01:41:32 -04:00
|
|
|
candidates.reserve( results.size() );
|
|
|
|
|
2012-05-06 02:48:22 -04:00
|
|
|
foreach ( const Result& result, results )
|
|
|
|
{
|
2012-05-08 01:10:28 -04:00
|
|
|
candidates.push_back( *result.Text() );
|
2012-05-06 02:48:22 -04:00
|
|
|
}
|
2012-05-08 01:10:28 -04:00
|
|
|
return candidates;
|
2012-05-06 02:48:22 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-15 23:49:56 -04:00
|
|
|
Future< AsyncResults > IdentifierCompleter::CandidatesForQueryAndTypeAsync(
|
2012-05-06 02:48:22 -04:00
|
|
|
const std::string &query,
|
|
|
|
const std::string &filetype ) const
|
|
|
|
{
|
|
|
|
// TODO: throw exception when threading is not enabled and this is called
|
2012-07-15 23:49:56 -04:00
|
|
|
if ( !threading_enabled_ )
|
|
|
|
return Future< AsyncResults >();
|
2012-05-06 02:48:22 -04:00
|
|
|
|
2012-07-16 23:23:17 -04:00
|
|
|
FunctionReturnsStringVector functor =
|
|
|
|
bind( &IdentifierCompleter::CandidatesForQueryAndType,
|
|
|
|
boost::cref( *this ),
|
|
|
|
query,
|
|
|
|
filetype );
|
|
|
|
|
2012-05-06 02:48:22 -04:00
|
|
|
// Try not to look at this too hard, it may burn your eyes.
|
|
|
|
shared_ptr< packaged_task< AsyncResults > > task =
|
|
|
|
make_shared< packaged_task< AsyncResults > >(
|
2012-07-15 23:49:56 -04:00
|
|
|
bind( ReturnValueAsShared< std::vector< std::string > >,
|
2012-07-16 23:23:17 -04:00
|
|
|
functor ) );
|
2012-05-06 02:48:22 -04:00
|
|
|
|
|
|
|
unique_future< AsyncResults > future = task->get_future();
|
|
|
|
|
2012-07-06 15:14:25 -04:00
|
|
|
latest_task_.Set( task );
|
2012-07-20 00:17:39 -04:00
|
|
|
return Future< AsyncResults >( boost::move( future ) );
|
2012-05-06 02:48:22 -04:00
|
|
|
}
|
|
|
|
|
2012-05-08 01:10:28 -04:00
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
void IdentifierCompleter::ResultsForQueryAndType(
|
|
|
|
const std::string &query,
|
|
|
|
const std::string &filetype,
|
|
|
|
std::vector< Result > &results ) const
|
2012-04-15 19:57:10 -04:00
|
|
|
{
|
2012-04-29 22:51:20 -04:00
|
|
|
FiletypeMap::const_iterator it = filetype_map_.find( filetype );
|
2012-07-15 22:44:35 -04:00
|
|
|
if ( it == filetype_map_.end() || query.empty() )
|
2012-04-29 22:51:20 -04:00
|
|
|
return;
|
|
|
|
|
2012-04-15 19:57:10 -04:00
|
|
|
Bitset query_bitset = LetterBitsetFromString( query );
|
|
|
|
|
2012-04-29 22:51:20 -04:00
|
|
|
foreach ( const FilepathToCandidates::value_type &path_and_candidates,
|
|
|
|
*it->second )
|
2012-04-15 19:57:10 -04:00
|
|
|
{
|
2012-05-08 01:27:08 -04:00
|
|
|
foreach ( const Candidate* candidate, *path_and_candidates.second )
|
2012-04-29 22:51:20 -04:00
|
|
|
{
|
|
|
|
if ( !candidate->MatchesQueryBitset( query_bitset ) )
|
|
|
|
continue;
|
2012-04-15 19:57:10 -04:00
|
|
|
|
2012-04-29 22:51:20 -04:00
|
|
|
Result result = candidate->QueryMatchResult( query );
|
|
|
|
if ( result.IsSubsequence() )
|
|
|
|
results.push_back( result );
|
|
|
|
}
|
2012-04-15 19:57:10 -04:00
|
|
|
}
|
|
|
|
|
2012-04-29 22:51:20 -04:00
|
|
|
std::sort( results.begin(), results.end() );
|
2012-04-15 19:57:10 -04:00
|
|
|
}
|
|
|
|
|
2012-04-29 19:36:31 -04:00
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
std::list< const Candidate* >& IdentifierCompleter::GetCandidateList(
|
2012-04-29 22:51:20 -04:00
|
|
|
const std::string &filetype,
|
|
|
|
const std::string &filepath )
|
|
|
|
{
|
|
|
|
boost::shared_ptr< FilepathToCandidates > &path_to_candidates =
|
|
|
|
filetype_map_[ filetype ];
|
|
|
|
|
|
|
|
if ( !path_to_candidates )
|
|
|
|
path_to_candidates.reset( new FilepathToCandidates() );
|
|
|
|
|
2012-05-11 00:56:19 -04:00
|
|
|
boost::shared_ptr< std::list< const Candidate* > > &candidates =
|
2012-04-29 22:51:20 -04:00
|
|
|
(*path_to_candidates)[ filepath ];
|
|
|
|
|
|
|
|
if ( !candidates )
|
2012-05-11 00:56:19 -04:00
|
|
|
candidates.reset( new std::list< const Candidate* >() );
|
2012-04-29 22:51:20 -04:00
|
|
|
|
|
|
|
return *candidates;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-11 02:13:12 -04:00
|
|
|
void IdentifierCompleter::InitThreads()
|
2012-05-06 02:48:22 -04:00
|
|
|
{
|
|
|
|
int threads_to_create =
|
|
|
|
std::max( MIN_ASYNC_THREADS,
|
|
|
|
std::min( MAX_ASYNC_THREADS, thread::hardware_concurrency() ) );
|
|
|
|
|
|
|
|
for ( int i = 0; i < threads_to_create; ++i )
|
|
|
|
{
|
2012-07-06 15:14:25 -04:00
|
|
|
threads_.create_thread( bind( ThreadMain, boost::ref( latest_task_ ) ) );
|
2012-05-06 02:48:22 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-04-15 19:57:10 -04:00
|
|
|
} // namespace YouCompleteMe
|