Gecko [ paroquia-rio-de-mouro.pt ]

Name	Size	Permission	Date
AugmentPageProps.php	468 B	-rw-r--r--	2016-11-28 20:20
DummySearchIndexFieldDefinition.php	555 B	-rw-r--r--	2016-11-28 20:20
NullIndexField.php	994 B	-rw-r--r--	2016-11-28 20:20
ParserOutputSearchDataExtractor.php	2.5 KB	-rw-r--r--	2016-11-28 20:20
PerRowAugmentor.php	852 B	-rw-r--r--	2016-11-28 20:20
ResultAugmentor.php	253 B	-rw-r--r--	2016-11-28 20:20
ResultSetAugmentor.php	271 B	-rw-r--r--	2016-11-28 20:20
SearchDatabase.php	1.49 KB	-rw-r--r--	2016-11-28 20:20
SearchEngine.php	22.22 KB	-rw-r--r--	2016-11-28 20:20
SearchEngineConfig.php	2.5 KB	-rw-r--r--	2016-11-28 20:20
SearchEngineFactory.php	1.3 KB	-rw-r--r--	2016-11-28 20:20
SearchExactMatchRescorer.php	5.36 KB	-rw-r--r--	2016-11-28 20:20
SearchHighlighter.php	15.44 KB	-rw-r--r--	2016-11-28 20:20
SearchIBM_DB2.php	6.17 KB	-rw-r--r--	2011-05-28 21:00
SearchIndexField.php	1.81 KB	-rw-r--r--	2016-11-28 20:20
SearchIndexFieldDefinition.php	2.42 KB	-rw-r--r--	2016-11-28 20:20
SearchMssql.php	6.15 KB	-rw-r--r--	2016-11-28 20:20
SearchMySQL.php	12.27 KB	-rw-r--r--	2016-11-28 20:20
SearchNearMatchResultSet.php	593 B	-rw-r--r--	2016-11-28 20:20
SearchNearMatcher.php	4.35 KB	-rw-r--r--	2016-11-28 20:20
SearchOracle.php	7.22 KB	-rw-r--r--	2016-11-28 20:20
SearchPostgres.php	6.16 KB	-rw-r--r--	2016-11-28 20:20
SearchResult.php	6.27 KB	-rw-r--r--	2016-11-28 20:20
SearchResultSet.php	6.05 KB	-rw-r--r--	2016-11-28 20:20
SearchSqlite.php	8.57 KB	-rw-r--r--	2016-11-28 20:20
SearchSuggestion.php	4.38 KB	-rw-r--r--	2016-11-28 20:20
SearchSuggestionSet.php	5.64 KB	-rw-r--r--	2016-11-28 20:20
SearchUpdate.php	3.63 KB	-rw-r--r--	2011-11-30 01:41
SqlSearchResultSet.php	1.22 KB	-rw-r--r--	2016-11-28 20:20

Rename

<?php

/**
 * Search suggestion sets
 *
 * This program 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 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 * http://www.gnu.org/copyleft/gpl.html
 *
 */

/**
 * A set of search suggestions.
 * The set is always ordered by score, with the best match first.
 */
class SearchSuggestionSet {
	/**
	 * @var SearchSuggestion[]
	 */
	private $suggestions = [];

/**
	 *
	 * @var array
	 */
	private $pageMap = [];

/**
	 * Builds a new set of suggestions.
	 *
	 * NOTE: the array should be sorted by score (higher is better),
	 * in descending order.
	 * SearchSuggestionSet will not try to re-order this input array.
	 * Providing an unsorted input array is a mistake and will lead to
	 * unexpected behaviors.
	 *
	 * @param SearchSuggestion[] $suggestions (must be sorted by score)
	 */
	public function __construct( array $suggestions ) {
		foreach ( $suggestions as $suggestion ) {
			$pageID = $suggestion->getSuggestedTitleID();
			if ( $pageID && empty( $this->pageMap[$pageID] ) ) {
				$this->pageMap[$pageID] = true;
			}
			$this->suggestions[] = $suggestion;
		}
	}

/**
	 * Get the list of suggestions.
	 * @return SearchSuggestion[]
	 */
	public function getSuggestions() {
		return $this->suggestions;
	}

/**
	 * Call array_map on the suggestions array
	 * @param callback $callback
	 * @return array
	 */
	public function map( $callback ) {
		return array_map( $callback, $this->suggestions );
	}

/**
	 * Add a new suggestion at the end.
	 * If the score of the new suggestion is greater than the worst one,
	 * the new suggestion score will be updated (worst - 1).
	 *
	 * @param SearchSuggestion $suggestion
	 */
	public function append( SearchSuggestion $suggestion ) {
		$pageID = $suggestion->getSuggestedTitleID();
		if ( $pageID && isset( $this->pageMap[$pageID] ) ) {
			return;
		}
		if ( $this->getSize() > 0 && $suggestion->getScore() >= $this->getWorstScore() ) {
			$suggestion->setScore( $this->getWorstScore() - 1 );
		}
		$this->suggestions[] = $suggestion;
		if ( $pageID ) {
			$this->pageMap[$pageID] = true;
		}
	}

/**
	 * Add suggestion set to the end of the current one.
	 * @param SearchSuggestionSet $set
	 */
	public function appendAll( SearchSuggestionSet $set ) {
		foreach ( $set->getSuggestions() as $sugg ) {
			$this->append( $sugg );
		}
	}

/**
	 * Move the suggestion at index $key to the first position
	 */
	public function rescore( $key ) {
		$removed = array_splice( $this->suggestions, $key, 1 );
		unset( $this->pageMap[$removed[0]->getSuggestedTitleID()] );
		$this->prepend( $removed[0] );
	}

/**
	 * Add a new suggestion at the top. If the new suggestion score
	 * is lower than the best one its score will be updated (best + 1)
	 * @param SearchSuggestion $suggestion
	 */
	public function prepend( SearchSuggestion $suggestion ) {
		$pageID = $suggestion->getSuggestedTitleID();
		if ( $pageID && isset( $this->pageMap[$pageID] ) ) {
			return;
		}
		if ( $this->getSize() > 0 && $suggestion->getScore() <= $this->getBestScore() ) {
			$suggestion->setScore( $this->getBestScore() + 1 );
		}
		array_unshift( $this->suggestions,  $suggestion );
		if ( $pageID ) {
			$this->pageMap[$pageID] = true;
		}
	}

/**
	 * @return float the best score in this suggestion set
	 */
	public function getBestScore() {
		if ( empty( $this->suggestions ) ) {
			return 0;
		}
		return $this->suggestions[0]->getScore();
	}

/**
	 * @return float the worst score in this set
	 */
	public function getWorstScore() {
		if ( empty( $this->suggestions ) ) {
			return 0;
		}
		return end( $this->suggestions )->getScore();
	}

/**
	 * @return int the number of suggestion in this set
	 */
	public function getSize() {
		return count( $this->suggestions );
	}

/**
	 * Remove any extra elements in the suggestions set
	 * @param int $limit the max size of this set.
	 */
	public function shrink( $limit ) {
		if ( count( $this->suggestions ) > $limit ) {
			$this->suggestions = array_slice( $this->suggestions, 0, $limit );
		}
	}

/**
	 * Builds a new set of suggestion based on a title array.
	 * Useful when using a backend that supports only Titles.
	 *
	 * NOTE: Suggestion scores will be generated.
	 *
	 * @param Title[] $titles
	 * @return SearchSuggestionSet
	 */
	public static function fromTitles( array $titles ) {
		$score = count( $titles );
		$suggestions = array_map( function( $title ) use ( &$score ) {
			return SearchSuggestion::fromTitle( $score--, $title );
		}, $titles );
		return new SearchSuggestionSet( $suggestions );
	}

/**
	 * Builds a new set of suggestion based on a string array.
	 *
	 * NOTE: Suggestion scores will be generated.
	 *
	 * @param string[] $titles
	 * @return SearchSuggestionSet
	 */
	public static function fromStrings( array $titles ) {
		$score = count( $titles );
		$suggestions = array_map( function( $title ) use ( &$score ) {
			return SearchSuggestion::fromText( $score--, $title );
		}, $titles );
		return new SearchSuggestionSet( $suggestions );
	}

/**
	 * @return SearchSuggestionSet an empty suggestion set
	 */
	public static function emptySuggestionSet() {
		return new SearchSuggestionSet( [] );
	}
}