Auto merge of #149472 - notriddle:stringdex/20251127, r=<try>

[PERF] try stringdex next version

Author: rust-bors[bot]

Cargo.lock

@@ -5357,10 +5357,10 @@ dependencies = [
 [[package]]
 name = "stringdex"
 version = "0.0.3"
-source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "556a6126952cb2f5150057c98a77cc6c771027dea2825bf7fa03d3d638b0a4f8"
+source = "git+https://gitlab.com/notriddle/stringdex?rev=349c7cee0fb7cbb4710ec03c96e0f9593c92d0e1#349c7cee0fb7cbb4710ec03c96e0f9593c92d0e1"
 dependencies = [
  "stacker",
+ "thin-vec",
 ]
 
 [[package]]

src/librustdoc/Cargo.toml

@@ -21,7 +21,7 @@ rustdoc-json-types = { path = "../rustdoc-json-types" }
 serde = { version = "1.0", features = ["derive"] }
 serde_json = "1.0"
 smallvec = "1.8.1"
-stringdex = "=0.0.3"
+stringdex = { git = "https://gitlab.com/notriddle/stringdex", rev = "349c7cee0fb7cbb4710ec03c96e0f9593c92d0e1" }
 tempfile = "3"
 threadpool = "1.8.1"
 tracing = "0.1"

src/librustdoc/html/static/js/search.js

@@ -1799,6 +1799,20 @@ class DocSearch {
                 if (pb[i] === 0) {
                     invertedFunctionInputsIndex.push(RoaringBitmap.empty());
                     i += 1;
+                } else if (pb[i] < 0x3a) {
+                    let bitmap = new RoaringBitmap(null);
+                    const l = pb[i];
+                    i += 1;
+                    for (let j = 0; j < l; ++j) {
+                        bitmap = bitmap.union(RoaringBitmap.makeSingleton(
+                            pb[i] +
+                            (pb[i + 1] << 8) +
+                            (pb[i + 2] << 16) +
+                            (pb[i + 3] << 24),
+                        ));
+                        i += 4;
+                    }
+                    invertedFunctionInputsIndex.push(bitmap);
                 } else {
                     const bitmap = new RoaringBitmap(pb, i);
                     i += bitmap.consumed_len_bytes;
@@ -1812,6 +1826,20 @@ class DocSearch {
                 if (pb[i] === 0) {
                     invertedFunctionOutputIndex.push(RoaringBitmap.empty());
                     i += 1;
+                } else if (pb[i] < 0x3a) {
+                    let bitmap = new RoaringBitmap(null);
+                    const l = pb[i];
+                    i += 1;
+                    for (let j = 0; j < l; ++j) {
+                        bitmap = bitmap.union(RoaringBitmap.makeSingleton(
+                            pb[i] +
+                            (pb[i + 1] << 8) +
+                            (pb[i + 2] << 16) +
+                            (pb[i + 3] << 24),
+                        ));
+                        i += 4;
+                    }
+                    invertedFunctionOutputIndex.push(bitmap);
                 } else {
                     const bitmap = new RoaringBitmap(pb, i);
                     i += bitmap.consumed_len_bytes;
@@ -1865,6 +1893,20 @@ class DocSearch {
             if (pb[i] === 0) {
                 invertedFunctionSignatureIndex.push(RoaringBitmap.empty());
                 i += 1;
+            } else if (pb[i] < 0x3a) {
+                let bitmap = new RoaringBitmap(null);
+                const l = pb[i];
+                i += 1;
+                for (let j = 0; j < l; ++j) {
+                    bitmap = bitmap.union(RoaringBitmap.makeSingleton(
+                        pb[i] +
+                        (pb[i + 1] << 8) +
+                        (pb[i + 2] << 16) +
+                        (pb[i + 3] << 24),
+                    ));
+                    i += 4;
+                }
+                invertedFunctionSignatureIndex.push(bitmap);
             } else {
                 const bitmap = new RoaringBitmap(pb, i);
                 i += bitmap.consumed_len_bytes;