searchtools.js 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514
  1. /*
  2. * searchtools.js
  3. * ~~~~~~~~~~~~~~~~
  4. *
  5. * Sphinx JavaScript utilities for the full-text search.
  6. *
  7. * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
  8. * :license: BSD, see LICENSE for details.
  9. *
  10. */
  11. if (!Scorer) {
  12. /**
  13. * Simple result scoring code.
  14. */
  15. var Scorer = {
  16. // Implement the following function to further tweak the score for each result
  17. // The function takes a result array [filename, title, anchor, descr, score]
  18. // and returns the new score.
  19. /*
  20. score: function(result) {
  21. return result[4];
  22. },
  23. */
  24. // query matches the full name of an object
  25. objNameMatch: 11,
  26. // or matches in the last dotted part of the object name
  27. objPartialMatch: 6,
  28. // Additive scores depending on the priority of the object
  29. objPrio: {0: 15, // used to be importantResults
  30. 1: 5, // used to be objectResults
  31. 2: -5}, // used to be unimportantResults
  32. // Used when the priority is not in the mapping.
  33. objPrioDefault: 0,
  34. // query found in title
  35. title: 15,
  36. partialTitle: 7,
  37. // query found in terms
  38. term: 5,
  39. partialTerm: 2
  40. };
  41. }
  42. if (!splitQuery) {
  43. function splitQuery(query) {
  44. return query.split(/\s+/);
  45. }
  46. }
  47. /**
  48. * Search Module
  49. */
  50. var Search = {
  51. _index : null,
  52. _queued_query : null,
  53. _pulse_status : -1,
  54. htmlToText : function(htmlString) {
  55. var virtualDocument = document.implementation.createHTMLDocument('virtual');
  56. var htmlElement = $(htmlString, virtualDocument);
  57. htmlElement.find('.headerlink').remove();
  58. docContent = htmlElement.find('[role=main]')[0];
  59. if(docContent === undefined) {
  60. console.warn("Content block not found. Sphinx search tries to obtain it " +
  61. "via '[role=main]'. Could you check your theme or template.");
  62. return "";
  63. }
  64. return docContent.textContent || docContent.innerText;
  65. },
  66. init : function() {
  67. var params = $.getQueryParameters();
  68. if (params.q) {
  69. var query = params.q[0];
  70. $('input[name="q"]')[0].value = query;
  71. this.performSearch(query);
  72. }
  73. },
  74. loadIndex : function(url) {
  75. $.ajax({type: "GET", url: url, data: null,
  76. dataType: "script", cache: true,
  77. complete: function(jqxhr, textstatus) {
  78. if (textstatus != "success") {
  79. document.getElementById("searchindexloader").src = url;
  80. }
  81. }});
  82. },
  83. setIndex : function(index) {
  84. var q;
  85. this._index = index;
  86. if ((q = this._queued_query) !== null) {
  87. this._queued_query = null;
  88. Search.query(q);
  89. }
  90. },
  91. hasIndex : function() {
  92. return this._index !== null;
  93. },
  94. deferQuery : function(query) {
  95. this._queued_query = query;
  96. },
  97. stopPulse : function() {
  98. this._pulse_status = 0;
  99. },
  100. startPulse : function() {
  101. if (this._pulse_status >= 0)
  102. return;
  103. function pulse() {
  104. var i;
  105. Search._pulse_status = (Search._pulse_status + 1) % 4;
  106. var dotString = '';
  107. for (i = 0; i < Search._pulse_status; i++)
  108. dotString += '.';
  109. Search.dots.text(dotString);
  110. if (Search._pulse_status > -1)
  111. window.setTimeout(pulse, 500);
  112. }
  113. pulse();
  114. },
  115. /**
  116. * perform a search for something (or wait until index is loaded)
  117. */
  118. performSearch : function(query) {
  119. // create the required interface elements
  120. this.out = $('#search-results');
  121. this.title = $('<h2>' + _('Searching') + '</h2>').appendTo(this.out);
  122. this.dots = $('<span></span>').appendTo(this.title);
  123. this.status = $('<p class="search-summary">&nbsp;</p>').appendTo(this.out);
  124. this.output = $('<ul class="search"/>').appendTo(this.out);
  125. $('#search-progress').text(_('Preparing search...'));
  126. this.startPulse();
  127. // index already loaded, the browser was quick!
  128. if (this.hasIndex())
  129. this.query(query);
  130. else
  131. this.deferQuery(query);
  132. },
  133. /**
  134. * execute search (requires search index to be loaded)
  135. */
  136. query : function(query) {
  137. var i;
  138. // stem the searchterms and add them to the correct list
  139. var stemmer = new Stemmer();
  140. var searchterms = [];
  141. var excluded = [];
  142. var hlterms = [];
  143. var tmp = splitQuery(query);
  144. var objectterms = [];
  145. for (i = 0; i < tmp.length; i++) {
  146. if (tmp[i] !== "") {
  147. objectterms.push(tmp[i].toLowerCase());
  148. }
  149. if ($u.indexOf(stopwords, tmp[i].toLowerCase()) != -1 || tmp[i] === "") {
  150. // skip this "word"
  151. continue;
  152. }
  153. // stem the word
  154. var word = stemmer.stemWord(tmp[i].toLowerCase());
  155. // prevent stemmer from cutting word smaller than two chars
  156. if(word.length < 3 && tmp[i].length >= 3) {
  157. word = tmp[i];
  158. }
  159. var toAppend;
  160. // select the correct list
  161. if (word[0] == '-') {
  162. toAppend = excluded;
  163. word = word.substr(1);
  164. }
  165. else {
  166. toAppend = searchterms;
  167. hlterms.push(tmp[i].toLowerCase());
  168. }
  169. // only add if not already in the list
  170. if (!$u.contains(toAppend, word))
  171. toAppend.push(word);
  172. }
  173. var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" "));
  174. // console.debug('SEARCH: searching for:');
  175. // console.info('required: ', searchterms);
  176. // console.info('excluded: ', excluded);
  177. // prepare search
  178. var terms = this._index.terms;
  179. var titleterms = this._index.titleterms;
  180. // array of [filename, title, anchor, descr, score]
  181. var results = [];
  182. $('#search-progress').empty();
  183. // lookup as object
  184. for (i = 0; i < objectterms.length; i++) {
  185. var others = [].concat(objectterms.slice(0, i),
  186. objectterms.slice(i+1, objectterms.length));
  187. results = results.concat(this.performObjectSearch(objectterms[i], others));
  188. }
  189. // lookup as search terms in fulltext
  190. results = results.concat(this.performTermsSearch(searchterms, excluded, terms, titleterms));
  191. // let the scorer override scores with a custom scoring function
  192. if (Scorer.score) {
  193. for (i = 0; i < results.length; i++)
  194. results[i][4] = Scorer.score(results[i]);
  195. }
  196. // now sort the results by score (in opposite order of appearance, since the
  197. // display function below uses pop() to retrieve items) and then
  198. // alphabetically
  199. results.sort(function(a, b) {
  200. var left = a[4];
  201. var right = b[4];
  202. if (left > right) {
  203. return 1;
  204. } else if (left < right) {
  205. return -1;
  206. } else {
  207. // same score: sort alphabetically
  208. left = a[1].toLowerCase();
  209. right = b[1].toLowerCase();
  210. return (left > right) ? -1 : ((left < right) ? 1 : 0);
  211. }
  212. });
  213. // for debugging
  214. //Search.lastresults = results.slice(); // a copy
  215. //console.info('search results:', Search.lastresults);
  216. // print the results
  217. var resultCount = results.length;
  218. function displayNextItem() {
  219. // results left, load the summary and display it
  220. if (results.length) {
  221. var item = results.pop();
  222. var listItem = $('<li style="display:none"></li>');
  223. var requestUrl = "";
  224. var linkUrl = "";
  225. if (DOCUMENTATION_OPTIONS.BUILDER === 'dirhtml') {
  226. // dirhtml builder
  227. var dirname = item[0] + '/';
  228. if (dirname.match(/\/index\/$/)) {
  229. dirname = dirname.substring(0, dirname.length-6);
  230. } else if (dirname == 'index/') {
  231. dirname = '';
  232. }
  233. requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + dirname;
  234. linkUrl = requestUrl;
  235. } else {
  236. // normal html builders
  237. requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX;
  238. linkUrl = item[0] + DOCUMENTATION_OPTIONS.LINK_SUFFIX;
  239. }
  240. listItem.append($('<a/>').attr('href',
  241. linkUrl +
  242. highlightstring + item[2]).html(item[1]));
  243. if (item[3]) {
  244. listItem.append($('<span> (' + item[3] + ')</span>'));
  245. Search.output.append(listItem);
  246. listItem.slideDown(5, function() {
  247. displayNextItem();
  248. });
  249. } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) {
  250. $.ajax({url: requestUrl,
  251. dataType: "text",
  252. complete: function(jqxhr, textstatus) {
  253. var data = jqxhr.responseText;
  254. if (data !== '' && data !== undefined) {
  255. listItem.append(Search.makeSearchSummary(data, searchterms, hlterms));
  256. }
  257. Search.output.append(listItem);
  258. listItem.slideDown(5, function() {
  259. displayNextItem();
  260. });
  261. }});
  262. } else {
  263. // no source available, just display title
  264. Search.output.append(listItem);
  265. listItem.slideDown(5, function() {
  266. displayNextItem();
  267. });
  268. }
  269. }
  270. // search finished, update title and status message
  271. else {
  272. Search.stopPulse();
  273. Search.title.text(_('Search Results'));
  274. if (!resultCount)
  275. Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.'));
  276. else
  277. Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
  278. Search.status.fadeIn(500);
  279. }
  280. }
  281. displayNextItem();
  282. },
  283. /**
  284. * search for object names
  285. */
  286. performObjectSearch : function(object, otherterms) {
  287. var filenames = this._index.filenames;
  288. var docnames = this._index.docnames;
  289. var objects = this._index.objects;
  290. var objnames = this._index.objnames;
  291. var titles = this._index.titles;
  292. var i;
  293. var results = [];
  294. for (var prefix in objects) {
  295. for (var name in objects[prefix]) {
  296. var fullname = (prefix ? prefix + '.' : '') + name;
  297. var fullnameLower = fullname.toLowerCase()
  298. if (fullnameLower.indexOf(object) > -1) {
  299. var score = 0;
  300. var parts = fullnameLower.split('.');
  301. // check for different match types: exact matches of full name or
  302. // "last name" (i.e. last dotted part)
  303. if (fullnameLower == object || parts[parts.length - 1] == object) {
  304. score += Scorer.objNameMatch;
  305. // matches in last name
  306. } else if (parts[parts.length - 1].indexOf(object) > -1) {
  307. score += Scorer.objPartialMatch;
  308. }
  309. var match = objects[prefix][name];
  310. var objname = objnames[match[1]][2];
  311. var title = titles[match[0]];
  312. // If more than one term searched for, we require other words to be
  313. // found in the name/title/description
  314. if (otherterms.length > 0) {
  315. var haystack = (prefix + ' ' + name + ' ' +
  316. objname + ' ' + title).toLowerCase();
  317. var allfound = true;
  318. for (i = 0; i < otherterms.length; i++) {
  319. if (haystack.indexOf(otherterms[i]) == -1) {
  320. allfound = false;
  321. break;
  322. }
  323. }
  324. if (!allfound) {
  325. continue;
  326. }
  327. }
  328. var descr = objname + _(', in ') + title;
  329. var anchor = match[3];
  330. if (anchor === '')
  331. anchor = fullname;
  332. else if (anchor == '-')
  333. anchor = objnames[match[1]][1] + '-' + fullname;
  334. // add custom score for some objects according to scorer
  335. if (Scorer.objPrio.hasOwnProperty(match[2])) {
  336. score += Scorer.objPrio[match[2]];
  337. } else {
  338. score += Scorer.objPrioDefault;
  339. }
  340. results.push([docnames[match[0]], fullname, '#'+anchor, descr, score, filenames[match[0]]]);
  341. }
  342. }
  343. }
  344. return results;
  345. },
  346. /**
  347. * search for full-text terms in the index
  348. */
  349. performTermsSearch : function(searchterms, excluded, terms, titleterms) {
  350. var docnames = this._index.docnames;
  351. var filenames = this._index.filenames;
  352. var titles = this._index.titles;
  353. var i, j, file;
  354. var fileMap = {};
  355. var scoreMap = {};
  356. var results = [];
  357. // perform the search on the required terms
  358. for (i = 0; i < searchterms.length; i++) {
  359. var word = searchterms[i];
  360. var files = [];
  361. var _o = [
  362. {files: terms[word], score: Scorer.term},
  363. {files: titleterms[word], score: Scorer.title}
  364. ];
  365. // add support for partial matches
  366. if (word.length > 2) {
  367. for (var w in terms) {
  368. if (w.match(word) && !terms[word]) {
  369. _o.push({files: terms[w], score: Scorer.partialTerm})
  370. }
  371. }
  372. for (var w in titleterms) {
  373. if (w.match(word) && !titleterms[word]) {
  374. _o.push({files: titleterms[w], score: Scorer.partialTitle})
  375. }
  376. }
  377. }
  378. // no match but word was a required one
  379. if ($u.every(_o, function(o){return o.files === undefined;})) {
  380. break;
  381. }
  382. // found search word in contents
  383. $u.each(_o, function(o) {
  384. var _files = o.files;
  385. if (_files === undefined)
  386. return
  387. if (_files.length === undefined)
  388. _files = [_files];
  389. files = files.concat(_files);
  390. // set score for the word in each file to Scorer.term
  391. for (j = 0; j < _files.length; j++) {
  392. file = _files[j];
  393. if (!(file in scoreMap))
  394. scoreMap[file] = {};
  395. scoreMap[file][word] = o.score;
  396. }
  397. });
  398. // create the mapping
  399. for (j = 0; j < files.length; j++) {
  400. file = files[j];
  401. if (file in fileMap && fileMap[file].indexOf(word) === -1)
  402. fileMap[file].push(word);
  403. else
  404. fileMap[file] = [word];
  405. }
  406. }
  407. // now check if the files don't contain excluded terms
  408. for (file in fileMap) {
  409. var valid = true;
  410. // check if all requirements are matched
  411. var filteredTermCount = // as search terms with length < 3 are discarded: ignore
  412. searchterms.filter(function(term){return term.length > 2}).length
  413. if (
  414. fileMap[file].length != searchterms.length &&
  415. fileMap[file].length != filteredTermCount
  416. ) continue;
  417. // ensure that none of the excluded terms is in the search result
  418. for (i = 0; i < excluded.length; i++) {
  419. if (terms[excluded[i]] == file ||
  420. titleterms[excluded[i]] == file ||
  421. $u.contains(terms[excluded[i]] || [], file) ||
  422. $u.contains(titleterms[excluded[i]] || [], file)) {
  423. valid = false;
  424. break;
  425. }
  426. }
  427. // if we have still a valid result we can add it to the result list
  428. if (valid) {
  429. // select one (max) score for the file.
  430. // for better ranking, we should calculate ranking by using words statistics like basic tf-idf...
  431. var score = $u.max($u.map(fileMap[file], function(w){return scoreMap[file][w]}));
  432. results.push([docnames[file], titles[file], '', null, score, filenames[file]]);
  433. }
  434. }
  435. return results;
  436. },
  437. /**
  438. * helper function to return a node containing the
  439. * search summary for a given text. keywords is a list
  440. * of stemmed words, hlwords is the list of normal, unstemmed
  441. * words. the first one is used to find the occurrence, the
  442. * latter for highlighting it.
  443. */
  444. makeSearchSummary : function(htmlText, keywords, hlwords) {
  445. var text = Search.htmlToText(htmlText);
  446. var textLower = text.toLowerCase();
  447. var start = 0;
  448. $.each(keywords, function() {
  449. var i = textLower.indexOf(this.toLowerCase());
  450. if (i > -1)
  451. start = i;
  452. });
  453. start = Math.max(start - 120, 0);
  454. var excerpt = ((start > 0) ? '...' : '') +
  455. $.trim(text.substr(start, 240)) +
  456. ((start + 240 - text.length) ? '...' : '');
  457. var rv = $('<div class="context"></div>').text(excerpt);
  458. $.each(hlwords, function() {
  459. rv = rv.highlightText(this, 'highlighted');
  460. });
  461. return rv;
  462. }
  463. };
  464. $(document).ready(function() {
  465. Search.init();
  466. });