Use bit arrays for predicate matching in search.

app/bin/tools/search_benchmark.dart

@@ -25,6 +25,9 @@ Future<void> main(List<String> args) async {
 
   // NOTE: please add more queries to this list, especially if there is a performance bottleneck.
   final queries = [
+    'sdk:dart',
+    'sdk:flutter platform:android',
+    'is:flutter-favorite',
     'chart',
     'json',
     'camera',

app/lib/search/mem_index.dart

@@ -10,6 +10,7 @@ import 'package:collection/collection.dart';
 import 'package:logging/logging.dart';
 import 'package:meta/meta.dart';
 import 'package:pub_dev/service/topics/models.dart';
+import 'package:pub_dev/third_party/bit_array/bit_array.dart';
 
 import '../shared/utils.dart' show boundedList;
 import 'models.dart';
@@ -29,10 +30,9 @@ class InMemoryPackageIndex {
   late final TokenIndex<IndexedApiDocPage> _apiSymbolIndex;
   late final _scorePool = ScorePool(_packageNameIndex._packageNames);
 
-  /// Maps the tag strings to a list of document index values
-  /// (`PackageDocument doc.tags -> List<_documents.indexOf(doc)>`).
-  final _tagDocumentIndices = <String, List<int>>{};
-  final _documentTagIds = <List<int>>[];
+  /// Maps the tag strings to a list of document index values using bit arrays.
+  /// - (`PackageDocument doc.tags -> BitArray(List<_documents.indexOf(doc)>)`).
+  final _tagBitArrays = <String, BitArray>{};
 
   /// Adjusted score takes the overall score and transforms
   /// it linearly into the [0.4-1.0] range.
@@ -63,12 +63,11 @@ class InMemoryPackageIndex {
       _documentsByName[doc.package] = doc;
 
       // transform tags into numberical IDs
-      final tagIds = <int>[];
       for (final tag in doc.tags) {
-        _tagDocumentIndices.putIfAbsent(tag, () => []).add(i);
+        _tagBitArrays
+            .putIfAbsent(tag, () => BitArray(_documents.length))
+            .setBit(i);
       }
-      tagIds.sort();
-      _documentTagIds.add(tagIds);
 
       final apiDocPages = doc.apiDocPages;
       if (apiDocPages != null) {
@@ -133,66 +132,58 @@ class InMemoryPackageIndex {
 
   PackageSearchResult search(ServiceSearchQuery query) {
     // prevent any work if offset is outside of the range
-    if ((query.offset ?? 0) > _documents.length) {
+    if ((query.offset ?? 0) >= _documents.length) {
       return PackageSearchResult.empty();
     }
     return _scorePool.withScore(
-      value: 1.0,
+      value: 0.0,
       fn: (score) {
         return _search(query, score);
       },
     );
   }
 
   PackageSearchResult _search(
-      ServiceSearchQuery query, IndexedScore<String> packageScores) {
-    // filter on package prefix
-    if (query.parsedQuery.packagePrefix != null) {
-      final String prefix = query.parsedQuery.packagePrefix!.toLowerCase();
-      packageScores.retainWhere(
-        (i, _) => _documents[i].packageNameLowerCased.startsWith(prefix),
-      );
-    }
+    ServiceSearchQuery query,
+    IndexedScore<String> packageScores,
+  ) {
+    // TODO: implement pooling of this object similarly to [ScorePool].
+    final packages = BitArray(_documents.length)
+      ..setRange(0, _documents.length);
 
     // filter on tags
     final combinedTagsPredicate =
         query.tagsPredicate.appendPredicate(query.parsedQuery.tagsPredicate);
     if (combinedTagsPredicate.isNotEmpty) {
       for (final entry in combinedTagsPredicate.entries) {
-        final docIndexes = _tagDocumentIndices[entry.key];
-
+        final tagBits = _tagBitArrays[entry.key];
         if (entry.value) {
-          // predicate is required, zeroing the gaps between index values
-          if (docIndexes == null) {
-            // the predicate is required, no document will match it
+          if (tagBits == null) {
+            // the predicate is not matched by any document
             return PackageSearchResult.empty();
           }
-
-          for (var i = 0; i < docIndexes.length; i++) {
-            if (i == 0) {
-              packageScores.fillRange(0, docIndexes[i], 0.0);
-              continue;
-            }
-            packageScores.fillRange(docIndexes[i - 1] + 1, docIndexes[i], 0.0);
-          }
-          packageScores.fillRange(docIndexes.last + 1, _documents.length, 0.0);
+          packages.and(tagBits);
         } else {
-          // predicate is prohibited, zeroing the values
-
-          if (docIndexes == null) {
-            // the predicate is prohibited, no document has it, always a match
+          if (tagBits == null) {
+            // negative predicate without index means all document is matched
             continue;
           }
-          for (final i in docIndexes) {
-            packageScores.setValue(i, 0.0);
-          }
+          packages.andNot(tagBits);
         }
       }
     }
 
+    // filter on package prefix
+    if (query.parsedQuery.packagePrefix != null) {
+      final prefix = query.parsedQuery.packagePrefix!.toLowerCase();
+      packages.clearWhere(
+        (i) => !_documents[i].packageNameLowerCased.startsWith(prefix),
+      );
+    }
+
     // filter on dependency
     if (query.parsedQuery.hasAnyDependency) {
-      packageScores.removeWhere((i, _) {
+      packages.clearWhere((i) {
         final doc = _documents[i];
         if (doc.dependencies.isEmpty) return true;
         for (final dependency in query.parsedQuery.allDependencies) {
@@ -208,22 +199,29 @@ class InMemoryPackageIndex {
 
     // filter on points
     if (query.minPoints != null && query.minPoints! > 0) {
-      packageScores.removeWhere(
-          (i, _) => _documents[i].grantedPoints < query.minPoints!);
+      packages
+          .clearWhere((i) => _documents[i].grantedPoints < query.minPoints!);
     }
 
     // filter on updatedDuration
     final updatedDuration = query.parsedQuery.updatedDuration;
     if (updatedDuration != null && updatedDuration > Duration.zero) {
       final now = clock.now();
-      packageScores.removeWhere(
-          (i, _) => now.difference(_documents[i].updated) > updatedDuration);
+      packages.clearWhere(
+          (i) => now.difference(_documents[i].updated) > updatedDuration);
+    }
+
+    // TODO: find a better way to handle predicate-only filtering and scoring
+    for (final index in packages.asIntIterable()) {
+      if (index >= _documents.length) break;
+      packageScores.setValue(index, 1.0);
     }
 
     // do text matching
     final parsedQueryText = query.parsedQuery.text;
     final textResults = _searchText(
       packageScores,
+      packages,
       parsedQueryText,
       includeNameMatches: (query.offset ?? 0) == 0,
       textMatchExtent: query.textMatchExtent ?? TextMatchExtent.api,
@@ -334,6 +332,7 @@ class InMemoryPackageIndex {
 
   _TextResults? _searchText(
     IndexedScore<String> packageScores,
+    BitArray packages,
     String? text, {
     required bool includeNameMatches,
     required TextMatchExtent textMatchExtent,
@@ -345,12 +344,14 @@ class InMemoryPackageIndex {
     final sw = Stopwatch()..start();
     final words = splitForQuery(text);
     if (words.isEmpty) {
+      // packages.clearAll();
       packageScores.fillRange(0, packageScores.length, 0);
       return _TextResults.empty();
     }
 
     final matchName = textMatchExtent.shouldMatchName();
     if (!matchName) {
+      // packages.clearAll();
       packageScores.fillRange(0, packageScores.length, 0);
       return _TextResults.empty(
           errorMessage:
@@ -376,12 +377,6 @@ class InMemoryPackageIndex {
       }
     }
 
-    // Multiple words are scored separately, and then the individual scores
-    // are multiplied. We can use a package filter that is applied after each
-    // word to reduce the scope of the later words based on the previous results.
-    /// However, API docs search should be filtered on the original list.
-    final indexedPositiveList = packageScores.toIndexedPositiveList();
-
     final matchDescription = textMatchExtent.shouldMatchDescription();
     final matchReadme = textMatchExtent.shouldMatchReadme();
     final matchApi = textMatchExtent.shouldMatchApi();
@@ -425,7 +420,7 @@ class InMemoryPackageIndex {
             if (value < 0.01) continue;
 
             final doc = symbolPages.keys[i];
-            if (!indexedPositiveList[doc.index]) continue;
+            if (!packages[doc.index]) continue;
 
             // skip if the previously found pages are better than the current one
             final pages =

app/lib/search/token_index.dart

@@ -227,24 +227,6 @@ class IndexedScore<K> {
     _values.fillRange(start, end, fillValue);
   }
 
-  void removeWhere(bool Function(int index, K key) fn) {
-    for (var i = 0; i < length; i++) {
-      if (isNotPositive(i)) continue;
-      if (fn(i, _keys[i])) {
-        _values[i] = 0.0;
-      }
-    }
-  }
-
-  void retainWhere(bool Function(int index, K key) fn) {
-    for (var i = 0; i < length; i++) {
-      if (isNotPositive(i)) continue;
-      if (!fn(i, _keys[i])) {
-        _values[i] = 0.0;
-      }
-    }
-  }
-
   void multiplyAllFrom(IndexedScore other) {
     multiplyAllFromValues(other._values);
   }

app/lib/third_party/bit_array/LICENSE

@@ -0,0 +1,27 @@
+Copyright 2018, the project authors. All rights reserved.
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials provided
+      with the distribution.
+    * Neither the name of the project nor the names of its
+      contributors may be used to endorse or promote products derived
+      from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+

app/lib/third_party/bit_array/README.md

@@ -0,0 +1 @@
+Note: this library is vendored from `package:bit_array`.