factbase 0.16.8 → 0.17.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: '0156369b495c6ca1f2ef02f8154f9f639c710e01ac481d230781dc8eecd96e63'
-  data.tar.gz: 7b90b7b1efdc0128a73287becca34609b57e1779089312fe8367064a8bfff10b
+  metadata.gz: 91ef3ed499ea15abb77bc39cfed30eb9af704921e86c3c03c7bdd9b13cb44270
+  data.tar.gz: 3c2e80d00620e0de14ec4be35ff08b28393793c69742dda9bda55c4a5ae01c8f
 SHA512:
-  metadata.gz: bab2eb3a28c5d26d5815c89f75331205dbcb164cd94c833cbb1c1e5a7eed7903f7d51953be249b49224970221c95d24ecf465592b01a8ebae12d871518dcb759
-  data.tar.gz: 5a20d5698d0757c8a33e1de0a044a4567c19e44e5f52a4be21982d52389cfb058933fa14b7ef81da03ec7c671241e629f057caf9c6f3e118d379a04d5741b887
+  metadata.gz: 9c6e18a32a5ae773e78672e449cce031a2c7641b1291b9f637ccb28afb6afddc87091955ce06e75c0e35326f4db37b04fac5b827b1cdc203a8b0262c105ca2c3
+  data.tar.gz: 923207d8494313e1af4fae0ecf3068372a5dde28924840edbe1b6d625127afb7e4eb2cf44c9f86a28d9d7fc650336abce9c9b99cd492b3ff29bcbb4cf214c83e

data/Gemfile

@@ -6,17 +6,19 @@
 source 'https://rubygems.org'
 gemspec
 
+gem 'benchmark', '~>0.5', require: false
 gem 'minitest', '~>5.25', require: false
 gem 'minitest-reporters', '~>1.7', require: false
 gem 'os', '~>1.1', require: false
 gem 'qbash', '~>0.4', require: false
 gem 'rake', '~>13.2', require: false
-gem 'rdoc', '6.14.2', require: false # GPL
+gem 'rdoc', '6.16.1', require: false # GPL
 gem 'rubocop', '~>1.74', require: false
 gem 'rubocop-minitest', '~>0.38', require: false
 gem 'rubocop-performance', '~>1.25', require: false
 gem 'rubocop-rake', '~>0.7', require: false
 gem 'simplecov', '~>0.22', require: false
 gem 'simplecov-cobertura', '~>3.0', require: false
+gem 'stackprof', '~>0.2', require: false, platforms: [:ruby]
 gem 'threads', '~>0.4', require: false
 gem 'yard', '~>0.9', require: false

data/Gemfile.lock

@@ -19,23 +19,24 @@ GEM
     ansi (1.5.0)
     ast (2.4.3)
     backtrace (0.4.1)
+    benchmark (0.5.0)
     builder (3.3.0)
     concurrent-ruby (1.3.5)
-    date (3.4.1)
+    date (3.5.0)
     decoor (0.1.0)
     docile (1.4.1)
     elapsed (0.2.0)
       loog (~> 0.6)
       tago (~> 0.1)
     ellipsized (0.3.0)
-    erb (5.0.2)
-    json (2.15.0)
+    erb (6.0.0)
+    json (2.17.1)
     language_server-protocol (3.17.0.5)
     lint_roller (1.1.0)
     logger (1.7.0)
     loog (0.6.1)
       logger (~> 1.0)
-    minitest (5.25.5)
+    minitest (5.26.2)
     minitest-reporters (1.7.1)
       ansi
       builder
@@ -52,27 +53,28 @@ GEM
     os (1.1.4)
     others (0.1.1)
     parallel (1.27.0)
-    parser (3.3.9.0)
+    parser (3.3.10.0)
       ast (~> 2.4.1)
       racc
-    prism (1.5.1)
+    prism (1.6.0)
     psych (5.2.6)
       date
       stringio
-    qbash (0.4.5)
+    qbash (0.4.8)
       backtrace (> 0)
       elapsed (> 0)
       loog (> 0)
       tago (> 0)
     racc (1.8.1)
     rainbow (3.1.1)
-    rake (13.3.0)
-    rdoc (6.14.2)
+    rake (13.3.1)
+    rdoc (6.16.1)
       erb
       psych (>= 4.0.0)
+      tsort
     regexp_parser (2.11.3)
     rexml (3.4.4)
-    rubocop (1.81.1)
+    rubocop (1.81.7)
       json (~> 2.3)
       language_server-protocol (~> 3.17.0.2)
       lint_roller (~> 1.1.0)
@@ -83,17 +85,17 @@ GEM
       rubocop-ast (>= 1.47.1, < 2.0)
       ruby-progressbar (~> 1.7)
       unicode-display_width (>= 2.4.0, < 4.0)
-    rubocop-ast (1.47.1)
+    rubocop-ast (1.48.0)
       parser (>= 3.3.7.2)
       prism (~> 1.4)
     rubocop-minitest (0.38.2)
       lint_roller (~> 1.1)
       rubocop (>= 1.75.0, < 2.0)
       rubocop-ast (>= 1.38.0, < 2.0)
-    rubocop-performance (1.26.0)
+    rubocop-performance (1.26.1)
       lint_roller (~> 1.1)
       rubocop (>= 1.75.0, < 2.0)
-      rubocop-ast (>= 1.44.0, < 2.0)
+      rubocop-ast (>= 1.47.1, < 2.0)
     rubocop-rake (0.7.1)
       lint_roller (~> 1.1)
       rubocop (>= 1.72.1)
@@ -107,16 +109,18 @@ GEM
       simplecov (~> 0.19)
     simplecov-html (0.13.2)
     simplecov_json_formatter (0.1.4)
-    stringio (3.1.7)
-    tago (0.2.0)
-    threads (0.4.1)
+    stackprof (0.2.27)
+    stringio (3.1.9)
+    tago (0.4.0)
+    threads (0.5.0)
       backtrace (~> 0)
       concurrent-ruby (~> 1.0)
+    tsort (0.2.0)
     unicode-display_width (3.2.0)
       unicode-emoji (~> 4.1)
     unicode-emoji (4.1.0)
     yaml (0.4.0)
-    yard (0.9.37)
+    yard (0.9.38)
 
 PLATFORMS
   arm64-darwin-22
@@ -125,24 +129,27 @@ PLATFORMS
   x64-mingw-ucrt
   x86_64-darwin-20
   x86_64-darwin-21
+  x86_64-darwin-24
   x86_64-linux
 
 DEPENDENCIES
+  benchmark (~> 0.5)
   factbase!
   minitest (~> 5.25)
   minitest-reporters (~> 1.7)
   os (~> 1.1)
   qbash (~> 0.4)
   rake (~> 13.2)
-  rdoc (= 6.14.2)
+  rdoc (= 6.16.1)
   rubocop (~> 1.74)
   rubocop-minitest (~> 0.38)
   rubocop-performance (~> 1.25)
   rubocop-rake (~> 0.7)
   simplecov (~> 0.22)
   simplecov-cobertura (~> 3.0)
+  stackprof (~> 0.2)
   threads (~> 0.4)
   yard (~> 0.9)
 
 BUNDLED WITH
-   2.5.16
+   2.6.8

data/README.md

@@ -4,6 +4,7 @@
 [![We recommend RubyMine](https://www.elegantobjects.org/rubymine.svg)](https://www.jetbrains.com/ruby/)
 
 [![rake](https://github.com/yegor256/factbase/actions/workflows/rake.yml/badge.svg)](https://github.com/yegor256/factbase/actions/workflows/rake.yml)
+[![discipline](https://zerocracy.github.io/judges-action/zerocracy-badge.svg)](https://zerocracy.github.io/judges-action/zerocracy-vitals.html)
 [![PDD status](https://www.0pdd.com/svg?name=yegor256/factbase)](https://www.0pdd.com/p?name=yegor256/factbase)
 [![Gem Version](https://badge.fury.io/rb/factbase.svg)](https://badge.fury.io/rb/factbase)
 [![Test Coverage](https://img.shields.io/codecov/c/github/yegor256/factbase.svg)](https://codecov.io/github/yegor256/factbase?branch=master)
@@ -193,7 +194,7 @@ Read
 [these guidelines](https://www.yegor256.com/2014/04/15/github-guidelines.html).
 Make sure your build is green before you contribute
 your pull request. You will need to have
-[Ruby](https://www.ruby-lang.org/en/) 3.2+ and
+[Ruby](https://www.ruby-lang.org/en/) 3.4+ and
 [Bundler](https://bundler.io/) installed. Then:
 
 ```bash
@@ -210,35 +211,35 @@ This is the result of the benchmark:
 <!-- benchmark_begin -->
 ```text
                                                                    user
-insert 20000 facts                                             0.595620
-export 20000 facts                                             0.019511
-import 410903 bytes (20000 facts)                              0.021517
-insert 10 facts                                                0.039990
-query 10 times w/txn                                           2.051662
-query 10 times w/o txn                                         0.043900
-modify 10 attrs w/txn                                          1.928921
-delete 10 facts w/txn                                          1.075461
-(and (eq what 'issue-was-closed') (exists... -> 200            1.120060
-(and (eq what 'issue-was-closed') (exists... -> 200/txn        1.114975
-(and (eq what 'issue-was-closed') (exists... -> zero           1.080422
-(and (eq what 'issue-was-closed') (exists... -> zero/txn       1.131242
-(gt time '2024-03-23T03:21:43Z')                               0.342271
-(gt cost 50)                                                   0.188269
-(eq title 'Object Thinking 5000')                              0.089654
-(and (eq foo 42.998) (or (gt bar 200) (absent z...             0.050858
-(and (exists foo) (not (exists blue)))                         0.920006
-(eq id (agg (always) (max id)))                                0.597035
-(join "c<=cost,b<=bar" (eq id (agg (always) (ma...             1.319789
-(and (eq what "foo") (join "w<=what" (and (eq i...             7.039262
-delete!                                                        0.219260
-Taped.append() x50000                                          0.025503
-Taped.each() x125                                              1.345823
-Taped.delete_if() x375                                         0.818237
+insert 20000 facts                                             0.637574
+export 20000 facts                                             0.019855
+import 410750 bytes (20000 facts)                              0.035065
+insert 10 facts                                                0.044615
+query 10 times w/txn                                           2.455739
+query 10 times w/o txn                                         0.050423
+modify 10 attrs w/txn                                          1.894240
+delete 10 facts w/txn                                          1.043079
+(and (eq what 'issue-was-closed') (exists... -> 200            1.279827
+(and (eq what 'issue-was-closed') (exists... -> 200/txn        1.263302
+(and (eq what 'issue-was-closed') (exists... -> zero           1.253773
+(and (eq what 'issue-was-closed') (exists... -> zero/txn       1.292489
+(gt time '2024-03-23T03:21:43Z')                               0.398074
+(gt cost 50)                                                   0.254020
+(eq title 'Object Thinking 5000')                              0.037238
+(and (eq foo 42.998) (or (gt bar 200) (absent z...             0.047599
+(and (exists foo) (not (exists blue)))                         1.115156
+(eq id (agg (always) (max id)))                                0.711832
+(join "c<=cost,b<=bar" (eq id (agg (always) (ma...             1.393622
+(and (eq what "foo") (join "w<=what" (and (eq i...             7.428505
+delete!                                                        0.272962
+Taped.append() x50000                                          0.020619
+Taped.each() x125                                              1.721876
+Taped.delete_if() x375                                         0.844673
 ```
 
 The results were calculated in [this GHA job][benchmark-gha]
-on 2025-08-21 at 14:27,
+on 2025-10-15 at 14:53,
 on Linux with 4 CPUs.
 <!-- benchmark_end -->
 
-[benchmark-gha]: https://github.com/yegor256/factbase/actions/runs/17129904396
+[benchmark-gha]: https://github.com/yegor256/factbase/actions/runs/18533080805

data/Rakefile

@@ -44,6 +44,7 @@ require 'yard'
 desc 'Build Yard documentation'
 YARD::Rake::YardocTask.new do |t|
   t.files = ['lib/**/*.rb']
+  t.options = ['--fail-on-warning']
 end
 
 require 'rubocop/rake_task'
@@ -53,20 +54,43 @@ RuboCop::RakeTask.new(:rubocop) do |task|
 end
 
 desc 'Benchmark them all'
-task :benchmark do
+task :benchmark, [:name] do |_t, args|
+  bname = args[:name] || 'all'
   require_relative 'lib/factbase'
-  fb = Factbase.new
   require_relative 'lib/factbase/cached/cached_factbase'
-  fb = Factbase::CachedFactbase.new(fb)
   require_relative 'lib/factbase/indexed/indexed_factbase'
-  fb = Factbase::IndexedFactbase.new(fb)
   require_relative 'lib/factbase/sync/sync_factbase'
-  fb = Factbase::SyncFactbase.new(fb)
   require 'benchmark'
   Benchmark.bm(60) do |b|
-    Dir['benchmark/bench_*.rb'].each do |f|
+    fb = Factbase.new
+    fb = Factbase::CachedFactbase.new(fb)
+    fb = Factbase::IndexedFactbase.new(fb)
+    fb = Factbase::SyncFactbase.new(fb)
+    if bname == 'all'
+      Dir['benchmark/bench_*.rb'].each do |f|
+        require_relative f
+        Kernel.send(File.basename(f).gsub(/\.rb$/, '').to_sym, b, fb)
+      end
+    else
+      f = "benchmark/#{bname}.rb"
       require_relative f
       Kernel.send(File.basename(f).gsub(/\.rb$/, '').to_sym, b, fb)
     end
   end
 end
+
+# Run profiling on a benchmark and generate a flamegraph.
+# To run this task, you need to have stackprof installed.
+# https://github.com/tmm1/stackprof
+# To run profiling for a specific benchmark you can run:
+#   bundle exec rake flamegraph\[bench_slow_query\]
+desc 'Profile a benchmark (e.g., flamegraph[bench_slow_query])'
+task :flamegraph, [:name] do |_t, args|
+  require 'stackprof'
+  bname = args[:name] || 'all'
+  puts "Starting profiling for '#{bname}'..."
+  StackProf.run(mode: :cpu, out: 'stackprof-cpu-myapp.dump', raw: true) do
+    Rake::Task['benchmark'].invoke(bname)
+  end
+  `stackprof --d3-flamegraph stackprof-cpu-myapp.dump > flamegraph.html`
+end

data/lib/factbase/cached/cached_query.rb

@@ -12,6 +12,8 @@ require_relative 'cached_fact'
 # Copyright:: Copyright (c) 2024-2025 Yegor Bugayenko
 # License:: MIT
 class Factbase::CachedQuery
+  include Enumerable
+
   # Constructor.
   # @param [Factbase::Query] origin Original query
   # @param [Hash] cache The cache

data/lib/factbase/indexed/indexed_absent.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'absent'.
+class Factbase::IndexedAbsent
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, _fb, _params)
+    return nil if @idx.nil?
+    key = [maps.object_id, @term.operands.first, @term.op]
+    if @idx[key].nil?
+      @idx[key] = []
+      prop = @term.operands.first.to_s
+      maps.to_a.each do |m|
+        @idx[key].append(m) if m[prop].nil?
+      end
+    end
+    (maps & []) | @idx[key]
+  end
+end

data/lib/factbase/indexed/indexed_and.rb

@@ -0,0 +1,79 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'and'.
+class Factbase::IndexedAnd
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, fb, params)
+    return nil if @idx.nil?
+    key = [maps.object_id, @term.operands.first, @term.op]
+    r = nil
+    if @term.operands.all? { |o| o.op == :eq } && @term.operands.size > 1 \
+      && @term.operands.all? { |o| o.operands.first.is_a?(Symbol) && _scalar?(o.operands[1]) }
+      props = @term.operands.map { |o| o.operands.first }.sort
+      key = [maps.object_id, props, :multi_and_eq]
+      if @idx[key].nil?
+        @idx[key] = {}
+        maps.to_a.each do |m|
+          _all_tuples(m, props).each do |t|
+            @idx[key][t] = [] if @idx[key][t].nil?
+            @idx[key][t].append(m)
+          end
+        end
+      end
+      tuples = Enumerator.product(
+        *@term.operands.sort_by { |o| o.operands.first }.map do |o|
+          if o.operands[1].is_a?(Symbol)
+            params[o.operands[1].to_s] || []
+          else
+            [o.operands[1]]
+          end
+        end
+      )
+      j = tuples.map { |t| @idx[key][t] || [] }.reduce(&:|)
+      r = (maps & []) | j
+    else
+      @term.operands.each do |o|
+        n = o.predict(maps, fb, params)
+        break if n.nil?
+        if r.nil?
+          r = n
+        elsif n.size < r.size * 8 # to skip some obvious matchings
+          r &= n.to_a
+        end
+        break if r.size < maps.size / 32 # it's already small enough
+        break if r.size < 128 # it's obviously already small enough
+      end
+    end
+    r
+  end
+
+  private
+
+  def _scalar?(item)
+    item.is_a?(String) || item.is_a?(Time) || item.is_a?(Integer) || item.is_a?(Float) || item.is_a?(Symbol)
+  end
+
+  def _all_tuples(fact, props)
+    prop = props.first.to_s
+    tuples = []
+    tuples += (fact[prop] || []).zip
+    if props.size > 1
+      tails = _all_tuples(fact, props[1..])
+      ext = []
+      tuples.each do |t|
+        tails.each do |tail|
+          ext << (t + tail)
+        end
+      end
+      tuples = ext
+    end
+    tuples
+  end
+end

data/lib/factbase/indexed/indexed_eq.rb

@@ -0,0 +1,46 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'eq'.
+class Factbase::IndexedEq
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, _fb, params)
+    return nil if @idx.nil?
+    key = [maps.object_id, @term.operands.first, @term.op]
+    return unless @term.operands.first.is_a?(Symbol) && _scalar?(@term.operands[1])
+    if @idx[key].nil?
+      @idx[key] = {}
+      prop = @term.operands.first.to_s
+      maps.to_a.each do |m|
+        m[prop]&.each do |v|
+          @idx[key][v] = [] if @idx[key][v].nil?
+          @idx[key][v].append(m)
+        end
+      end
+    end
+    vv =
+      if @term.operands[1].is_a?(Symbol)
+        params[@term.operands[1].to_s] || []
+      else
+        [@term.operands[1]]
+      end
+    if vv.empty?
+      (maps & [])
+    else
+      j = vv.map { |v| @idx[key][v] || [] }.reduce(&:|)
+      (maps & []) | j
+    end
+  end
+
+  private
+
+  def _scalar?(item)
+    item.is_a?(String) || item.is_a?(Time) || item.is_a?(Integer) || item.is_a?(Float) || item.is_a?(Symbol)
+  end
+end

data/lib/factbase/indexed/indexed_exists.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'exists'.
+class Factbase::IndexedExists
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, _fb, _params)
+    return nil if @idx.nil?
+    key = [maps.object_id, @term.operands.first, @term.op]
+    if @idx[key].nil?
+      @idx[key] = []
+      prop = @term.operands.first.to_s
+      maps.to_a.each do |m|
+        @idx[key].append(m) unless m[prop].nil?
+      end
+    end
+    (maps & []) | @idx[key]
+  end
+end

data/lib/factbase/indexed/indexed_factbase.rb

@@ -57,8 +57,57 @@ class Factbase::IndexedFactbase
   # Run an ACID transaction.
   # @return [Factbase::Churn] How many facts have been changed (zero if rolled back)
   def txn
-    @origin.txn do |fbt|
-      yield Factbase::IndexedFactbase.new(fbt, @idx)
+    result =
+      @origin.txn do |fbt|
+        yield Factbase::IndexedFactbase.new(fbt, @idx)
+      end
+    @idx.clear
+    result
+  end
+
+  # Export it into a chain of bytes, including both data and index.
+  #
+  # Here is how you can export it to a file, for example:
+  #
+  #  fb = Factbase::IndexedFactbase.new(Factbase.new)
+  #  fb.insert.foo = 42
+  #  File.binwrite("foo.fb", fb.export)
+  #
+  # The data is binary, it's not a text!
+  #
+  # @return [String] Binary string containing serialized data and index
+  def export
+    Marshal.dump({ maps: @origin.export, idx: @idx })
+  end
+
+  # Import from a chain of bytes, including both data and index.
+  #
+  # Here is how you can read it from a file, for example:
+  #
+  #  fb = Factbase::IndexedFactbase.new(Factbase.new)
+  #  fb.import(File.binread("foo.fb"))
+  #
+  # The facts that existed in the factbase before importing will remain there.
+  # The facts from the incoming byte stream will be added to them.
+  # If the byte stream doesn't contain an index (for backward compatibility),
+  # the index will be empty and will be built on first use.
+  #
+  # @param [String] bytes Binary string to import
+  def import(bytes)
+    raise 'Empty input, cannot load a factbase' if bytes.empty?
+    data = Marshal.load(bytes)
+    if data.is_a?(Hash) && data.key?(:maps)
+      @origin.import(data[:maps])
+      @idx.merge!(data[:idx]) if data[:idx].is_a?(Hash)
+    else
+      @origin.import(bytes)
+      @idx.clear
     end
   end
+
+  # Size, the total number of facts in the factbase.
+  # @return [Integer] How many facts are in there
+  def size
+    @origin.size
+  end
 end

data/lib/factbase/indexed/indexed_gt.rb

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'gt'.
+class Factbase::IndexedGt
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, _fb, params)
+    return nil if @idx.nil?
+    return unless @term.operands.first.is_a?(Symbol) && _scalar?(@term.operands[1])
+    prop = @term.operands.first.to_s
+    cache_key = [maps.object_id, @term.operands.first, :sorted]
+    if @idx[cache_key].nil?
+      @idx[cache_key] = []
+      maps.to_a.each do |m|
+        values = m[prop]
+        next if values.nil?
+        values.each do |v|
+          @idx[cache_key] << [v, m]
+        end
+      end
+      @idx[cache_key].sort_by! { |pair| pair[0] }
+    end
+    threshold = @term.operands[1].is_a?(Symbol) ? params[@term.operands[1].to_s]&.first : @term.operands[1]
+    return nil if threshold.nil?
+    i = @idx[cache_key].bsearch_index { |pair| pair[0] > threshold } || @idx[cache_key].size
+    result = @idx[cache_key][i..].map { |pair| pair[1] }.uniq
+    (maps & []) | result
+  end
+
+  private
+
+  def _scalar?(item)
+    item.is_a?(String) || item.is_a?(Time) || item.is_a?(Integer) || item.is_a?(Float) || item.is_a?(Symbol)
+  end
+end

data/lib/factbase/indexed/indexed_lt.rb

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'lt'.
+class Factbase::IndexedLt
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, _fb, params)
+    return nil if @idx.nil?
+    return unless @term.operands.first.is_a?(Symbol) && _scalar?(@term.operands[1])
+    prop = @term.operands.first.to_s
+    cache_key = [maps.object_id, @term.operands.first, :sorted]
+    if @idx[cache_key].nil?
+      @idx[cache_key] = []
+      maps.to_a.each do |m|
+        values = m[prop]
+        next if values.nil?
+        values.each do |v|
+          @idx[cache_key] << [v, m]
+        end
+      end
+      @idx[cache_key].sort_by! { |pair| pair[0] }
+    end
+    threshold = @term.operands[1].is_a?(Symbol) ? params[@term.operands[1].to_s]&.first : @term.operands[1]
+    return nil if threshold.nil?
+    i = @idx[cache_key].bsearch_index { |pair| pair[0] >= threshold } || @idx[cache_key].size
+    result = @idx[cache_key][0...i].map { |pair| pair[1] }.uniq
+    (maps & []) | result
+  end
+
+  private
+
+  def _scalar?(item)
+    item.is_a?(String) || item.is_a?(Time) || item.is_a?(Integer) || item.is_a?(Float) || item.is_a?(Symbol)
+  end
+end

data/lib/factbase/indexed/indexed_not.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# Indexed term 'not'.
+class Factbase::IndexedNot
+  def initialize(term, idx)
+    @term = term
+    @idx = idx
+  end
+
+  def predict(maps, fb, params)
+    return nil if @idx.nil?
+    key = [maps.object_id, @term.operands.first, @term.op]
+    if @idx[key].nil?
+      yes = @term.operands.first.predict(maps, fb, params)
+      if yes.nil?
+        @idx[key] = { r: nil }
+      else
+        yes = yes.to_a.to_set
+        @idx[key] = { r: maps.to_a.reject { |m| yes.include?(m) } }
+      end
+    end
+    r = @idx[key][:r]
+    if r.nil?
+      nil
+    else
+      (maps & []) | r
+    end
+  end
+end