// Copyright (C) 2011, 2012, 2013 Strahinja Val Markovic // // 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 . #include "PythonSupport.h" #include "standard.h" #include "Result.h" #include "Candidate.h" #include "CandidateRepository.h" #include #include #include using boost::algorithm::any_of; using boost::algorithm::is_upper; using boost::python::len; using boost::python::extract; using boost::python::object; typedef boost::python::list pylist; namespace YouCompleteMe { namespace { std::vector< const Candidate * > CandidatesFromObjectList( const pylist &candidates, const std::string &candidate_property ) { int num_candidates = len( candidates ); std::vector< std::string > candidate_strings; candidate_strings.reserve( num_candidates ); for ( int i = 0; i < num_candidates; ++i ) { if ( candidate_property.empty() ) { candidate_strings.push_back( extract< std::string >( candidates[ i ] ) ); } else { object holder = extract< object >( candidates[ i ] ); candidate_strings.push_back( extract< std::string >( holder[ candidate_property.c_str() ] ) ); } } return CandidateRepository::Instance().GetCandidatesForStrings( candidate_strings ); } } // unnamed namespace boost::python::list FilterAndSortCandidates( const boost::python::list &candidates, const std::string &candidate_property, const std::string &query ) { pylist filtered_candidates; if ( query.empty() ) return filtered_candidates; std::vector< const Candidate * > repository_candidates = CandidatesFromObjectList( candidates, candidate_property ); Bitset query_bitset = LetterBitsetFromString( query ); bool query_has_uppercase_letters = any_of( query, is_upper() ); int num_candidates = len( candidates ); std::vector< ResultAnd< int > > object_and_results; for ( int i = 0; i < num_candidates; ++i ) { const Candidate *candidate = repository_candidates[ i ]; if ( !candidate->MatchesQueryBitset( query_bitset ) ) continue; Result result = candidate->QueryMatchResult( query, query_has_uppercase_letters ); if ( result.IsSubsequence() ) { ResultAnd< int > object_and_result( i, result ); object_and_results.push_back( boost::move( object_and_result ) ); } } std::sort( object_and_results.begin(), object_and_results.end() ); foreach ( const ResultAnd< int > &object_and_result, object_and_results ) { filtered_candidates.append( candidates[ object_and_result.extra_object_ ] ); } return filtered_candidates; } } // namespace YouCompleteMe