RubyGems - bitclust-core - Versions diffs - 1.3.0 → 1.6.0 - Mend

bitclust-core 1.3.0 → 1.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (152) hide show

checksums.yaml +4 -4
data/Gemfile +3 -0
data/README.md +65 -0
data/Rakefile +32 -0
data/data/bitclust/catalog/ja_JP.UTF-8 +19 -1
data/data/bitclust/searchpage/index.html +90 -0
data/data/bitclust/template/class +69 -8
data/data/bitclust/template/function +2 -2
data/data/bitclust/template/layout +11 -3
data/data/bitclust/template/method +2 -2
data/data/bitclust/template/search +1 -1
data/data/bitclust/template.epub/class +22 -1
data/data/bitclust/template.epub/function +2 -2
data/data/bitclust/template.epub/layout +1 -3
data/data/bitclust/template.epub/method +2 -2
data/data/bitclust/template.lillia/class +26 -5
data/data/bitclust/template.lillia/layout +1 -3
data/data/bitclust/template.lillia/method +2 -2
data/data/bitclust/template.offline/class +48 -4
data/data/bitclust/template.offline/function +2 -2
data/data/bitclust/template.offline/layout +27 -3
data/data/bitclust/template.offline/method +2 -2
data/lib/bitclust/app.rb +16 -17
data/lib/bitclust/capi_converter.rb +20 -0
data/lib/bitclust/classentry.rb +67 -17
data/lib/bitclust/compat.rb +2 -2
data/lib/bitclust/completion.rb +58 -27
data/lib/bitclust/crossrubyutils.rb +8 -5
data/lib/bitclust/database.rb +28 -8
data/lib/bitclust/doc_converter.rb +63 -0
data/lib/bitclust/docentry.rb +1 -1
data/lib/bitclust/entity_splitter.rb +221 -0
data/lib/bitclust/entry.rb +47 -7
data/lib/bitclust/functiondatabase.rb +13 -1
data/lib/bitclust/functionentry.rb +5 -1
data/lib/bitclust/functionreferenceparser.rb +4 -4
data/lib/bitclust/generators/epub.rb +10 -3
data/lib/bitclust/htmlutils.rb +1 -1
data/lib/bitclust/include_graph.rb +375 -0
data/lib/bitclust/include_pruner.rb +144 -0
data/lib/bitclust/interface.rb +1 -1
data/lib/bitclust/libraryentry.rb +8 -7
data/lib/bitclust/lineinput.rb +7 -5
data/lib/bitclust/link_checker.rb +179 -0
data/lib/bitclust/markdown_bridge.rb +186 -0
data/lib/bitclust/markdown_orchestrator.rb +267 -0
data/lib/bitclust/markdown_to_rrd.rb +824 -0
data/lib/bitclust/markdown_tree.rb +217 -0
data/lib/bitclust/mdcompiler.rb +883 -0
data/lib/bitclust/mdparser.rb +347 -0
data/lib/bitclust/messagecatalog.rb +3 -3
data/lib/bitclust/method_since_calculator.rb +117 -0
data/lib/bitclust/methoddatabase.rb +124 -14
data/lib/bitclust/methodentry.rb +125 -7
data/lib/bitclust/methodid.rb +12 -11
data/lib/bitclust/methodsignature.rb +10 -4
data/lib/bitclust/nameutils.rb +41 -22
data/lib/bitclust/preprocessor.rb +66 -29
data/lib/bitclust/rdcompiler.rb +195 -95
data/lib/bitclust/refsdatabase.rb +23 -8
data/lib/bitclust/reloadable_request_handler.rb +72 -0
data/lib/bitclust/requesthandler.rb +21 -16
data/lib/bitclust/ridatabase.rb +10 -4
data/lib/bitclust/rrd_to_markdown.rb +925 -0
data/lib/bitclust/rrdparser.rb +196 -30
data/lib/bitclust/runner.rb +17 -2
data/lib/bitclust/screen.rb +80 -11
data/lib/bitclust/search_index_generator.rb +288 -0
data/lib/bitclust/searcher.rb +69 -20
data/lib/bitclust/simplesearcher.rb +24 -12
data/lib/bitclust/subcommand.rb +7 -1
data/lib/bitclust/subcommands/ancestors_command.rb +9 -2
data/lib/bitclust/subcommands/checklink_command.rb +54 -0
data/lib/bitclust/subcommands/chm_command.rb +15 -7
data/lib/bitclust/subcommands/classes_command.rb +5 -0
data/lib/bitclust/subcommands/extract_command.rb +5 -0
data/lib/bitclust/subcommands/htmlfile_command.rb +21 -7
data/lib/bitclust/subcommands/init_command.rb +4 -1
data/lib/bitclust/subcommands/list_command.rb +12 -4
data/lib/bitclust/subcommands/lookup_command.rb +28 -9
data/lib/bitclust/subcommands/methods_command.rb +10 -2
data/lib/bitclust/subcommands/methodsince_command.rb +80 -0
data/lib/bitclust/subcommands/preproc_command.rb +5 -0
data/lib/bitclust/subcommands/property_command.rb +2 -1
data/lib/bitclust/subcommands/searchpage_command.rb +102 -0
data/lib/bitclust/subcommands/server_command.rb +10 -8
data/lib/bitclust/subcommands/setup_command.rb +24 -10
data/lib/bitclust/subcommands/statichtml_command.rb +129 -6
data/lib/bitclust/subcommands/update_command.rb +110 -2
data/lib/bitclust/syntax_highlighter.rb +48 -4
data/lib/bitclust/textutils.rb +3 -3
data/lib/bitclust/version.rb +1 -1
data/lib/bitclust/version_badges.rb +90 -0
data/lib/bitclust/whole_file_gate.rb +137 -0
data/test/test_app.rb +269 -0
data/test/test_bitclust.rb +2 -0
data/test/test_capi_converter.rb +91 -0
data/test/test_class_screen.rb +413 -0
data/test/test_copy_doc_md.rb +53 -0
data/test/test_doc_converter.rb +78 -0
data/test/test_entity_splitter.rb +231 -0
data/test/test_entry.rb +207 -2
data/test/test_eol_warning.rb +43 -0
data/test/test_functionreferenceparser.rb +11 -0
data/test/test_include_graph.rb +640 -0
data/test/test_include_pruner.rb +133 -0
data/test/test_link_checker.rb +114 -0
data/test/test_lookup_command.rb +135 -0
data/test/test_markdown_bridge.rb +217 -0
data/test/test_markdown_orchestrator.rb +478 -0
data/test/test_markdown_to_rrd.rb +757 -0
data/test/test_markdown_tree.rb +369 -0
data/test/test_mdcompiler.rb +1276 -0
data/test/test_mdparser.rb +538 -0
data/test/test_method_screen.rb +166 -0
data/test/test_method_since_calculator.rb +290 -0
data/test/test_methoddatabase.rb +16 -0
data/test/test_methodentry.rb +328 -0
data/test/test_methodsignature.rb +3 -1
data/test/test_methodsince_command.rb +168 -0
data/test/test_nameutils.rb +22 -0
data/test/test_preprocessor.rb +215 -0
data/test/test_rdcompiler.rb +401 -30
data/test/test_refsdatabase.rb +32 -0
data/test/test_rrd_to_markdown.rb +968 -0
data/test/test_rrdparser.rb +295 -2
data/test/test_run_ruby_wasm.rb +54 -0
data/test/test_run_worker_prelude.rb +83 -0
data/test/test_runner.rb +51 -0
data/test/test_search_index_generator.rb +513 -0
data/test/test_search_screen.rb +48 -0
data/test/test_searcher.rb +132 -0
data/test/test_searchpage_command.rb +167 -0
data/test/test_simplesearcher.rb +28 -0
data/test/test_statichtml_command.rb +204 -0
data/test/test_syntax_highlighter.rb +60 -0
data/test/test_whole_file_gate.rb +175 -0
data/theme/default/js/NOTICE +42 -0
data/theme/default/js/run-worker.js +111 -0
data/theme/default/js/run.js +350 -0
data/theme/default/js/search_controller.js +134 -0
data/theme/default/js/search_init.js +176 -0
data/theme/default/js/search_navigation.js +110 -0
data/theme/default/js/search_page.js +202 -0
data/theme/default/js/search_ranker.js +244 -0
data/theme/default/script.js +91 -18
data/theme/default/search.css +149 -0
data/theme/default/style.css +193 -21
data/theme/default/syntax-highlight.css +8 -0
data/theme/lillia/style.css +45 -1
metadata +161 -20
data/README +0 -32

data/theme/default/js/search_init.js ADDED Viewed

@@ -0,0 +1,176 @@
+'use strict';
+/*
+ * Part of BitClust. Distributed under the Ruby License or the MIT License.
+ *
+ * Wires up the client-side search box for statichtml output.
+ *
+ * The sibling files search_navigation.js, search_ranker.js and
+ * search_controller.js are vendored verbatim from RDoc's Aliki theme.
+ * They expect two globals to be defined before this script runs:
+ *
+ *   search_data       - defined by js/search_data.js (the index)
+ *   index_rel_prefix  - relative path from the current page to the site root,
+ *                       set inline in the page <head> by the layout template.
+ */
+(function() {
+  // BitClust extension (the vendored Aliki files above are kept verbatim).
+  //
+  // RDoc's parseQuery() rewrites "." to "::" (its class-method separator) and
+  // matches "::"/"."/"#" queries against full_name instead of name. Ruby's
+  // special variables are indexed with their "$" sigil in full_name, and one of
+  // them ($.) contains a literal "." — so a "$." query would become "$::" and
+  // never match. Wrap parseQuery so that any "$"-prefixed (special variable)
+  // query keeps its literal text and is matched against full_name.
+  // See https://github.com/rurema/bitclust/issues/194
+  //
+  // Separately (bitclust#279): BitClust keeps a literal "." in full_name for
+  // singleton methods ("File.open") and ".#"/"?." for module functions
+  // ("Kernel.#open" pre-4.0, "Kernel?.open" 4.0+ — see #250), instead of
+  // RDoc's "::" convention. The same "." -> "::" rewrite above then makes
+  // every one of those dot-qualified queries miss its own entry. Fold "?."
+  // to ".#" here so both module-function spellings collapse to the same
+  // query text before the "." -> "::" rewrite runs; the other half of the
+  // fix (matching against SearchIndexGenerator's match_name instead of
+  // full_name) is the computeScore wrap below.
+  if (typeof parseQuery === 'function') {
+    var alikiParseQuery = parseQuery;
+    parseQuery = function(query) {
+      var folded = query.indexOf('?.') === -1 ? query : query.replace(/\?\./g, '.#');
+      var q = alikiParseQuery(folded);
+      if (query.charAt(0) === '$') {
+        q.normalized = query.toLowerCase();  // undo the "." -> "::" rewrite
+        q.matchesFullName = true;            // the "$" sigil lives in full_name
+      }
+      q.original = query;  // keep the real original text, not the folded one
+      return q;
+    };
+  }
+  // bitclust#279 (continued): computeScore() scores a query against
+  // entry.full_name, which — per the comment above — doesn't use "::" the
+  // way parseQuery's rewrite expects. SearchIndexGenerator adds a
+  // match_name to affected entries (full_name with "?." folded to ".#" and
+  // then every "." turned into "::", mirroring parseQuery's own rewrite —
+  // see search_index_generator.rb's header comment). When an entry carries
+  // one, score a shallow clone with full_name swapped to match_name instead
+  // — the original entry object (and its displayed full_name) is never
+  // touched, so this only affects which entries match, not what is shown.
+  // Entries without a match_name (instance methods, constants, classes,
+  // special variables, ...) are scored exactly as before.
+  if (typeof computeScore === 'function') {
+    var alikiComputeScore = computeScore;
+    computeScore = function(entry, q) {
+      if (entry && entry.match_name) {
+        return alikiComputeScore({ name: entry.name, full_name: entry.match_name, type: entry.type }, q);
+      }
+      return alikiComputeScore(entry, q);
+    };
+  }
+  // bitclust#279 (continued): highlightMatch() compares q.normalized (with
+  // "." already rewritten to "::" and "?." folded to ".#" by the wrap
+  // above) against the displayed full_name, which keeps its literal
+  // "."/".#"/"?." — so the dot-qualified queries fixed above matched their
+  // entry but never earned an <em> highlight (at best the vendored fuzzy
+  // fallback gave up at the first ":"). Whenever the vendored code found
+  // nothing to mark, retry a contiguous match with the user's *original*
+  // query text (q.original, restored by the parseQuery wrap), treating
+  // ".#" and "?." as the same module-function spelling. Both marks are two
+  // characters long, so indexes into the folded strings map 1:1 onto the
+  // displayed text and the markers can be spliced straight into it.
+  if (typeof highlightMatch === 'function') {
+    var alikiHighlightMatch = highlightMatch;
+    highlightMatch = function(text, q) {
+      var marked = alikiHighlightMatch(text, q);
+      if (marked !== text) return marked;         // the vendored code managed
+      if (!text || !q || !q.original) return marked;
+      var canonText = text.toLowerCase().replace(/\.#/g, '?.');
+      var canonQuery = q.original.toLowerCase().replace(/\.#/g, '?.');
+      if (!canonQuery) return marked;
+      var start = canonText.indexOf(canonQuery);
+      if (start === -1) return marked;
+      var end = start + canonQuery.length;
+      return text.substring(0, start) +
+        '\u0001' + text.substring(start, end) + '\u0002' +
+        text.substring(end);
+    };
+  }
+  function createSearchInstance(input, result) {
+    if (!input || !result) return null;
+    var search = new SearchController(search_data, input, result);
+    search.renderItem = function(r) {
+      var li = document.createElement('li');
+      var html = '<p class="search-match"><a href="' +
+        index_rel_prefix + this.escapeHTML(r.path) + '">' +
+        this.hlt(r.title) + '</a>';
+      if (r.type) {
+        var typeClass = r.type.replace(/_/g, '-');
+        html += '<span class="search-type search-type-' +
+          this.escapeHTML(typeClass) + '">' + this.formatType(r.type) + '</span>';
+      }
+      html += '</p>';
+      if (r.snippet) html += '<div class="search-snippet">' + r.snippet + '</div>';
+      li.innerHTML = html;
+      return li;
+    };
+    search.formatType = function(type) {
+      var labels = {
+        'class': 'class', 'module': 'module', 'object': 'object',
+        'constant': 'const', 'instance_method': 'method', 'class_method': 'method',
+        'variable': 'var', 'library': 'lib', 'document': 'doc', 'function': 'func',
+        'heading': 'section'
+      };
+      return labels[type] || type;
+    };
+    search.select = function(selected) {
+      if (selected) window.location.href = selected.firstChild.firstChild.href;
+    };
+    return search;
+  }
+  function hookSearch() {
+    var input = document.querySelector('#search-field');
+    var result = document.querySelector('#search-results');
+    if (!input || !result) return;
+    var search = createSearchInstance(input, result);
+    if (!search) return;
+    document.addEventListener('click', function(e) {
+      if (!e.target.closest('#search-section')) search.hide();
+    });
+    document.addEventListener('keydown', function(e) {
+      if (e.key === 'Escape' && input.matches(':focus')) { search.hide(); input.blur(); }
+    });
+    input.addEventListener('focus', function() {
+      if (input.value.trim()) search.show();
+    });
+    if (typeof URLSearchParams !== 'undefined') {
+      var q = new URLSearchParams(window.location.search).get('q');
+      if (q) { input.value = q; search.search(q, false); }
+    }
+  }
+  // Press "/" anywhere to focus the search box.
+  function hookFocus() {
+    document.addEventListener('keydown', function(e) {
+      if (document.activeElement && document.activeElement.tagName === 'INPUT') return;
+      if (e.key === '/') {
+        var f = document.querySelector('#search-field');
+        if (f) { e.preventDefault(); f.focus(); }
+      }
+    });
+  }
+  document.addEventListener('DOMContentLoaded', function() {
+    hookSearch();
+    hookFocus();
+  });
+})();

data/theme/default/js/search_navigation.js ADDED Viewed

@@ -0,0 +1,110 @@
+/*
+ * Vendored from RDoc's Aliki theme (lib/rdoc/generator/template/aliki/js/), RDoc v7.2.0.
+ * Copyright (c) 2025 Stan Lo. Released under the MIT License.
+ * See https://github.com/ruby/rdoc/blob/v7.2.0/LEGAL.rdoc
+ */
+/*
+ * SearchNavigation allows movement using the arrow keys through the search results.
+ *
+ * When using this library you will need to set scrollIntoView to the
+ * appropriate function for your layout.  Use scrollInWindow if the container
+ * is not scrollable and scrollInElement if the container is a separate
+ * scrolling region.
+ */
+SearchNavigation = new function() {
+  this.initNavigation = function() {
+    var _this = this;
+    document.addEventListener('keydown', function(e) {
+      _this.onkeydown(e);
+    });
+    this.navigationActive = true;
+  }
+  this.setNavigationActive = function(state) {
+    this.navigationActive = state;
+  }
+  this.onkeydown = function(e) {
+    if (!this.navigationActive) return;
+    switch(e.key) {
+      case 'ArrowLeft':
+        if (this.moveLeft()) e.preventDefault();
+        break;
+      case 'ArrowUp':
+        if (e.key == 'ArrowUp' || e.ctrlKey) {
+          if (this.moveUp()) e.preventDefault();
+        }
+        break;
+      case 'ArrowRight':
+        if (this.moveRight()) e.preventDefault();
+        break;
+      case 'ArrowDown':
+        if (e.key == 'ArrowDown' || e.ctrlKey) {
+          if (this.moveDown()) e.preventDefault();
+        }
+        break;
+      case 'Enter':
+        if (this.current) e.preventDefault();
+        this.select(this.current);
+        break;
+    }
+    if (e.ctrlKey && e.shiftKey) this.select(this.current);
+  }
+  this.moveRight = function() {
+  }
+  this.moveLeft = function() {
+  }
+  this.move = function(isDown) {
+  }
+  this.moveUp = function() {
+    return this.move(false);
+  }
+  this.moveDown = function() {
+    return this.move(true);
+  }
+  /*
+   * Scrolls to the given element in the scrollable element view.
+   */
+  this.scrollInElement = function(element, view) {
+    var offset, viewHeight, viewScroll, height;
+    offset = element.offsetTop;
+    height = element.offsetHeight;
+    viewHeight = view.offsetHeight;
+    viewScroll = view.scrollTop;
+    if (offset - viewScroll + height > viewHeight) {
+      view.scrollTop = offset - viewHeight + height;
+    }
+    if (offset < viewScroll) {
+      view.scrollTop = offset;
+    }
+  }
+  /*
+   * Scrolls to the given element in the window.  The second argument is
+   * ignored
+   */
+  this.scrollInWindow = function(element, ignored) {
+    var offset, viewHeight, viewScroll, height;
+    offset = element.offsetTop;
+    height = element.offsetHeight;
+    viewHeight = window.innerHeight;
+    viewScroll = window.scrollY;
+    if (offset - viewScroll + height > viewHeight) {
+      window.scrollTo(window.scrollX, offset - viewHeight + height);
+    }
+    if (offset < viewScroll) {
+      window.scrollTo(window.scrollX, offset);
+    }
+  }
+}

data/theme/default/js/search_page.js ADDED Viewed

@@ -0,0 +1,202 @@
+'use strict';
+/*
+ * Part of BitClust. Distributed under the Ruby License or the MIT License.
+ *
+ * Wires up the standalone cross-version search page (the static replacement
+ * for the server-backed rurema-search app at /ja/search/).
+ *
+ * The sibling files search_navigation.js, search_ranker.js and
+ * search_controller.js are vendored verbatim from RDoc's Aliki theme.
+ * They expect these globals to be defined before this script runs:
+ *
+ *   search_data         - defined by js/search_data.js. Each entry carries a
+ *                         `versions` array (ascending) added by
+ *                         SearchIndexGenerator.merge.
+ *   search_versions     - all indexed versions, ascending (inline in the page).
+ *   search_version_base - relative path from this page to the directory that
+ *                         holds the per-version document roots ("../" when the
+ *                         page lives at /ja/search/).
+ */
+(function() {
+  // BitClust extension (the vendored Aliki files above are kept verbatim).
+  //
+  // Same special-variable handling as search_init.js: keep "$"-prefixed
+  // queries literal (no "." -> "::" rewrite) and match them against
+  // full_name, where the "$" sigil lives.
+  // See https://github.com/rurema/bitclust/issues/194
+  //
+  // Same bitclust#279 handling as search_init.js too: fold "?." to ".#" so
+  // both module-function spellings ("Kernel.#open" pre-4.0, "Kernel?.open"
+  // 4.0+ — see #250) normalize the same way, and score dot-qualified
+  // entries via their match_name (added by SearchIndexGenerator) instead of
+  // full_name, since BitClust keeps a literal "." there for display while
+  // parseQuery's rewrite expects "::". See search_init.js for the full
+  // rationale; SearchIndexGenerator.merge keeps match_name on merged
+  // cross-version entries same as any other field.
+  if (typeof parseQuery === 'function') {
+    var alikiParseQuery = parseQuery;
+    parseQuery = function(query) {
+      var folded = query.indexOf('?.') === -1 ? query : query.replace(/\?\./g, '.#');
+      var q = alikiParseQuery(folded);
+      if (query.charAt(0) === '$') {
+        q.normalized = query.toLowerCase();
+        q.matchesFullName = true;
+      }
+      q.original = query;
+      return q;
+    };
+  }
+  if (typeof computeScore === 'function') {
+    var alikiComputeScore = computeScore;
+    computeScore = function(entry, q) {
+      if (entry && entry.match_name) {
+        return alikiComputeScore({ name: entry.name, full_name: entry.match_name, type: entry.type }, q);
+      }
+      return alikiComputeScore(entry, q);
+    };
+  }
+  // Same highlightMatch wrap as search_init.js: when the vendored code
+  // found nothing to mark (dot-qualified queries never contiguous-match a
+  // literal-dot full_name once "." has been rewritten to "::"), retry with
+  // the user's original query text, treating ".#" and "?." as the same
+  // module-function spelling. On this page the merged index only carries
+  // the "?." spelling (SearchIndexGenerator.merge folds ".#" away), so
+  // this is what lets a query typed in the pre-4.0 ".#" notation still
+  // light up the "?."-spelled row it matched. Both marks are two
+  // characters, so indexes into the folded strings map 1:1 onto the text.
+  if (typeof highlightMatch === 'function') {
+    var alikiHighlightMatch = highlightMatch;
+    highlightMatch = function(text, q) {
+      var marked = alikiHighlightMatch(text, q);
+      if (marked !== text) return marked;         // the vendored code managed
+      if (!text || !q || !q.original) return marked;
+      var canonText = text.toLowerCase().replace(/\.#/g, '?.');
+      var canonQuery = q.original.toLowerCase().replace(/\.#/g, '?.');
+      if (!canonQuery) return marked;
+      var start = canonText.indexOf(canonQuery);
+      if (start === -1) return marked;
+      var end = start + canonQuery.length;
+      return text.substring(0, start) +
+        '\u0001' + text.substring(start, end) + '\u0002' +
+        text.substring(end);
+    };
+  }
+  function versionHref(version, path) {
+    return search_version_base + version + '/' + path;
+  }
+  function compareVersions(a, b) {
+    var as = a.split('.');
+    var bs = b.split('.');
+    for (var i = 0; i < Math.max(as.length, bs.length); i++) {
+      var d = parseInt(as[i] || '0', 10) - parseInt(bs[i] || '0', 10);
+      if (d) return d;
+    }
+    return 0;
+  }
+  // ranker の formatResult は {title, path, type} だけを結果に残し、統合 index の
+  // versions を落とす（vendored ファイルは verbatim 維持）。path から versions を
+  // 引けるよう対応表を作る。同じ path が複数エントリに現れる稀なケース
+  // （版によって type 等が違う）は、ページとしては存在する版の和集合が正しい
+  function buildVersionsByPath() {
+    var map = {};
+    for (var i = 0; i < search_data.index.length; i++) {
+      var e = search_data.index[i];
+      var list = map[e.path] || (map[e.path] = []);
+      var vs = e.versions || [];
+      for (var j = 0; j < vs.length; j++) {
+        if (list.indexOf(vs[j]) < 0) list.push(vs[j]);
+      }
+    }
+    return map;
+  }
+  // rurema-search compatibility: accept ?q=, its ?query= parameter, and its
+  // /query:<word>/ path form (the latter only reaches this page when the
+  // server rewrites unknown /ja/search/* paths here).
+  function initialQuery() {
+    var q = null;
+    if (typeof URLSearchParams !== 'undefined') {
+      var params = new URLSearchParams(window.location.search);
+      q = params.get('q') || params.get('query');
+    }
+    if (!q) {
+      var m = window.location.pathname.match(/\/query:([^\/]+)/);
+      if (m) {
+        try {
+          q = decodeURIComponent(m[1]);
+        } catch (e) {
+          q = m[1];
+        }
+      }
+    }
+    return q;
+  }
+  function init() {
+    var input = document.querySelector('#search-field');
+    var result = document.querySelector('#search-results');
+    if (!input || !result) return;
+    var search = new SearchController(search_data, input, result);
+    var versionsByPath = buildVersionsByPath();
+    search.renderItem = function(r) {
+      var li = document.createElement('li');
+      var versions = (versionsByPath[r.path] || [])
+        .slice().sort(compareVersions).reverse();  // newest first
+      var newest = versions[0] || '';
+      var html = '<p class="search-match"><a href="' +
+        this.escapeHTML(versionHref(newest, r.path)) + '">' +
+        this.hlt(r.title) + '</a>';
+      if (r.type) {
+        var typeClass = r.type.replace(/_/g, '-');
+        html += '<span class="search-type search-type-' +
+          this.escapeHTML(typeClass) + '">' + this.formatType(r.type) + '</span>';
+      }
+      html += '</p><p class="search-versions">';
+      for (var i = 0; i < versions.length; i++) {
+        html += '<a href="' + this.escapeHTML(versionHref(versions[i], r.path)) +
+          '">' + this.escapeHTML(versions[i]) + '</a>';
+      }
+      html += '</p>';
+      li.innerHTML = html;
+      return li;
+    };
+    search.formatType = function(type) {
+      var labels = {
+        'class': 'class', 'module': 'module', 'object': 'object',
+        'constant': 'const', 'instance_method': 'method', 'class_method': 'method',
+        'variable': 'var', 'library': 'lib', 'document': 'doc', 'function': 'func',
+        'heading': 'section'
+      };
+      return labels[type] || type;
+    };
+    search.select = function(selected) {
+      if (selected) window.location.href = selected.firstChild.firstChild.href;
+    };
+    // Keep the query shareable: mirror the box into the ?q= parameter.
+    input.addEventListener('input', function() {
+      var q = input.value.trim();
+      var url = q ? '?q=' + encodeURIComponent(q) : window.location.pathname;
+      window.history.replaceState(null, '', url);
+    });
+    var q = initialQuery();
+    if (q) {
+      input.value = q;
+      window.history.replaceState(null, '', '?q=' + encodeURIComponent(q));
+      search.search(q, false);
+    }
+    input.focus();
+  }
+  document.addEventListener('DOMContentLoaded', init);
+})();