Lines Matching refs:matches
563 // Reserve space for the max number of matches we'll show.
593 // If we've got no matches we can copy everything from the last result.
600 // In hopes of providing a stable popup we try to keep the number of matches
602 // relevant matches) typically result in many successive 'What You Typed'
603 // results filling all the matches, which looks awful.
605 // Instead of starting with the current matches and then adding old matches
606 // until we hit our overall limit, we copy enough old matches so that each
608 // clamp globally. This way, old high-relevance matches will starve new
609 // low-relevance matches, under the assumption that the new matches will
613 // matches, the new ones will all become visible, so we won't have lost
626 void AutocompleteResult::AppendMatches(const ACMatches& matches) {
627 std::copy(matches.begin(), matches.end(), std::back_inserter(matches_));
652 // Sort and trim to the most relevant kMaxMatches matches.
739 const ACMatches& matches) {
740 for (ACMatches::const_iterator i = matches.begin(); i != matches.end(); ++i) {
756 // the highest-relevance matches, we copy in the lowest-relevance matches
757 // first. This means that within each provider's "group" of matches, any
758 // synchronous matches (which tend to have the highest scores) will
759 // "overwrite" the initial matches from that provider's previous results,
760 // minimally disturbing the rest of the matches.
849 // get matches back more quickly). Taking advantage of this reduces flicker.
912 // We allow matches from the previous result set to starve out matches from
913 // the new result set. This means in order to expire matches we have to query
932 result_.AppendMatches((*i)->matches());
934 // Sort the matches and trim to a small number of "best" matches.
937 // Need to validate before invoking CopyOldMatches as the old matches are not
