factbase 0.17.0 → 0.17.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8e2593945542e79d93c93e662467bb704ad98d9a481887b5447341c700e4abf8
-  data.tar.gz: 5e13613617c829b0669235a275a1796c6556ca8cdced3ef9ee3502cbb2c300db
+  metadata.gz: 91ef3ed499ea15abb77bc39cfed30eb9af704921e86c3c03c7bdd9b13cb44270
+  data.tar.gz: 3c2e80d00620e0de14ec4be35ff08b28393793c69742dda9bda55c4a5ae01c8f
 SHA512:
-  metadata.gz: 22d7965bd3b3f60070ca8293e3c054ea5b2553913ccb091328f3d51f2aab3a42c3be56b5197536014c550eecceb708186a826cb1fe67b6e31deb636819ceb866
-  data.tar.gz: 5e5fef55d3e316d19d5d96c2de10b23d1788541c09a2331c8762cd73c1c4b15b468c7cb4c0ff4b4f33f3b296f0a875673568f7a1eca92744fbf54c2e0c042233
+  metadata.gz: 9c6e18a32a5ae773e78672e449cce031a2c7641b1291b9f637ccb28afb6afddc87091955ce06e75c0e35326f4db37b04fac5b827b1cdc203a8b0262c105ca2c3
+  data.tar.gz: 923207d8494313e1af4fae0ecf3068372a5dde28924840edbe1b6d625127afb7e4eb2cf44c9f86a28d9d7fc650336abce9c9b99cd492b3ff29bcbb4cf214c83e

data/Gemfile

@@ -12,12 +12,13 @@ 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.15.1', 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

@@ -30,7 +30,7 @@ GEM
       tago (~> 0.1)
     ellipsized (0.3.0)
     erb (6.0.0)
-    json (2.16.0)
+    json (2.17.1)
     language_server-protocol (3.17.0.5)
     lint_roller (1.1.0)
     logger (1.7.0)
@@ -68,7 +68,7 @@ GEM
     racc (1.8.1)
     rainbow (3.1.1)
     rake (13.3.1)
-    rdoc (6.15.1)
+    rdoc (6.16.1)
       erb
       psych (>= 4.0.0)
       tsort
@@ -109,7 +109,8 @@ GEM
       simplecov (~> 0.19)
     simplecov-html (0.13.2)
     simplecov_json_formatter (0.1.4)
-    stringio (3.1.8)
+    stackprof (0.2.27)
+    stringio (3.1.9)
     tago (0.4.0)
     threads (0.5.0)
       backtrace (~> 0)
@@ -119,7 +120,7 @@ GEM
       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
@@ -139,13 +140,14 @@ DEPENDENCIES
   os (~> 1.1)
   qbash (~> 0.4)
   rake (~> 13.2)
-  rdoc (= 6.15.1)
+  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)
 

data/Rakefile

@@ -78,3 +78,19 @@ task :benchmark, [:name] do |_t, args|
     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/indexed/indexed_factbase.rb

@@ -57,9 +57,12 @@ 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)
-    end
+    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.

data/lib/factbase/term.rb

@@ -52,6 +52,12 @@ require_relative 'terms/when'
 require_relative 'terms/either'
 require_relative 'terms/count'
 require_relative 'terms/first'
+require_relative 'terms/nth'
+require_relative 'terms/sum'
+require_relative 'terms/agg'
+require_relative 'terms/empty'
+require_relative 'terms/min'
+require_relative 'terms/max'
 
 # Term.
 #
@@ -89,12 +95,6 @@ class Factbase::Term
   # @return [Array] The operands
   attr_reader :operands
 
-  require_relative 'terms/logical'
-  include Factbase::Logical
-
-  require_relative 'terms/aggregates'
-  include Factbase::Aggregates
-
   require_relative 'terms/shared'
   include Factbase::TermShared
 
@@ -149,7 +149,13 @@ class Factbase::Term
       when: Factbase::When.new(operands),
       either: Factbase::Either.new(operands),
       count: Factbase::Count.new(operands),
-      first: Factbase::First.new(operands)
+      first: Factbase::First.new(operands),
+      nth: Factbase::Nth.new(operands),
+      sum: Factbase::Sum.new(operands),
+      agg: Factbase::Agg.new(operands),
+      empty: Factbase::Empty.new(operands),
+      min: Factbase::Min.new(operands),
+      max: Factbase::Max.new(operands)
     }
   end
 
@@ -211,11 +217,15 @@ class Factbase::Term
   # Simplify it if possible.
   # @return [Factbase::Term] New term or itself
   def simplify
-    m = "#{@op}_simplify"
-    if respond_to?(m, true)
-      send(m)
+    if @terms.key?(@op) && @terms[@op].respond_to?(:simplify)
+      @terms[@op].simplify
     else
-      self
+      m = "#{@op}_simplify"
+      if respond_to?(m, true)
+        send(m)
+      else
+        self
+      end
     end
   end
 

data/lib/factbase/terms/agg.rb

@@ -0,0 +1,35 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative 'base'
+# The term 'agg' that aggregates.
+class Factbase::Agg < Factbase::TermBase
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands = [])
+    super()
+    @operands = operands
+    @op = :agg
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] fb Factbase to use for sub-queries
+  # @return [Object] The result of evaluation
+  def evaluate(fact, maps, fb)
+    assert_args(2)
+    selector = @operands[0]
+    unless selector.is_a?(Factbase::Term) || selector.is_a?(Factbase::TermBase)
+      raise "A term is expected, but '#{selector}' provided"
+    end
+    term = @operands[1]
+    unless term.is_a?(Factbase::Term) || selector.is_a?(Factbase::TermBase)
+      raise "A term is expected, but '#{term}' provided"
+    end
+    subset = fb.query(selector, maps).each(fb, fact).to_a
+    term.evaluate(nil, subset, fb)
+  end
+end

data/lib/factbase/terms/and.rb

@@ -5,6 +5,7 @@
 
 require_relative 'base'
 require_relative 'boolean'
+require_relative 'simplified'
 # The 'and' term that represents a logical AND operation between multiple operands.
 class Factbase::And < Factbase::TermBase
   # Constructor.
@@ -25,4 +26,10 @@ class Factbase::And < Factbase::TermBase
     end
     true
   end
+
+  def simplify
+    unique = Factbase::Simplified.new(@operands).unique
+    return unique[0] if unique.size == 1
+    Factbase::Term.new(@op, unique)
+  end
 end

data/lib/factbase/terms/best.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+# The 'best' term evaluates the best value for a given key.
+class Factbase::Best
+  def initialize(&block)
+    @criteria = block
+  end
+
+  def evaluate(key, maps)
+    raise "A symbol is expected, but #{key} provided" unless key.is_a?(Symbol)
+    best = nil
+    maps.each do |m|
+      vv = m[key.to_s]
+      next if vv.nil?
+      vv = [vv] unless vv.respond_to?(:to_a)
+      vv.each do |v|
+        best = v if best.nil? || @criteria.call(v, best)
+      end
+    end
+    best
+  end
+end

data/lib/factbase/terms/empty.rb

@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative 'base'
+
+# The 'empty' term checks for emptiness in the results of a query evaluation.
+class Factbase::Empty < Factbase::TermBase
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands)
+    super()
+    @operands = operands
+    @op = :empty
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] fb Factbase to use for sub-queries
+  # @return [Boolean] The result of the emptiness check
+  def evaluate(fact, maps, fb)
+    assert_args(1)
+    term = @operands[0]
+    unless term.is_a?(Factbase::Term) || term.is_a?(Factbase::TermBase)
+      raise "A term is expected, but '#{term}' provided"
+    end
+    # rubocop:disable Lint/UnreachableLoop
+    fb.query(term, maps).each(fb, fact) do
+      return false
+    end
+    # rubocop:enable Lint/UnreachableLoop
+    true
+  end
+end

data/lib/factbase/terms/max.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative '../../factbase'
+require_relative 'best'
+require_relative 'base'
+
+# The 'max' term.
+# This term calculates the max value among the evaluated operands.
+class Factbase::Max < Factbase::TermBase
+  MAX = Factbase::Best.new { |v, b| v > b }
+
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands)
+    super()
+    @operands = operands
+    @op = :max
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] _fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] _fb Factbase to use for sub-queries
+  # @return [Object] The max value among the evaluated operands
+  def evaluate(_fact, maps, _fb)
+    assert_args(1)
+    MAX.evaluate(@operands[0], maps)
+  end
+end

data/lib/factbase/terms/min.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative '../../factbase'
+require_relative 'best'
+require_relative 'base'
+
+# The 'min' term.
+# This term calculates the minimum value among the evaluated operands.
+class Factbase::Min < Factbase::TermBase
+  MIN = Factbase::Best.new { |v, b| v < b }
+
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands)
+    super()
+    @operands = operands
+    @op = :min
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] _fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] _fb Factbase to use for sub-queries
+  # @return [Object] The minimum value among the evaluated operands
+  def evaluate(_fact, maps, _fb)
+    assert_args(1)
+    MIN.evaluate(@operands[0], maps)
+  end
+end

data/lib/factbase/terms/nth.rb

@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative 'base'
+# Represents an 'nth' term in the Factbase.
+# Retrieves the value of a specified key from the nth map.
+class Factbase::Nth < Factbase::TermBase
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands)
+    super()
+    @operands = operands
+    @op = :nth
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] _fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] _fb Factbase to use for sub-queries
+  # @return [Object] The value of the specified key from the nth map
+  def evaluate(_fact, maps, _fb)
+    assert_args(2)
+    pos = @operands[0]
+    raise "An integer is expected, but #{pos} provided" unless pos.is_a?(Integer)
+    k = @operands[1]
+    raise "A symbol is expected, but #{k} provided" unless k.is_a?(Symbol)
+    m = maps[pos]
+    return nil if m.nil?
+    m[k.to_s]
+  end
+end

data/lib/factbase/terms/or.rb

@@ -5,6 +5,7 @@
 
 require_relative 'base'
 require_relative 'boolean'
+require_relative 'simplified'
 # The 'or' term that represents a logical OR operation between multiple operands.
 class Factbase::Or < Factbase::TermBase
   # Constructor.
@@ -25,4 +26,10 @@ class Factbase::Or < Factbase::TermBase
     end
     false
   end
+
+  def simplify
+    unique = Factbase::Simplified.new(@operands).unique
+    return unique[0] if unique.size == 1
+    Factbase::Term.new(@op, unique)
+  end
 end

data/lib/factbase/terms/simplified.rb

@@ -0,0 +1,31 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative '../../factbase'
+
+# Simplified operands.
+#
+# Author:: Yegor Bugayenko (yegor256@gmail.com)
+# Copyright:: Copyright (c) 2024-2025 Yegor Bugayenko
+# License:: MIT
+class Factbase::Simplified
+  def initialize(operands)
+    @operands = operands
+  end
+
+  # Removes duplicate operands
+  def unique
+    strs = []
+    ops = []
+    @operands.each do |o|
+      o = o.simplify
+      s = o.to_s
+      next if strs.include?(s)
+      strs << s
+      ops << o
+    end
+    ops
+  end
+end

data/lib/factbase/terms/sum.rb

@@ -0,0 +1,38 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative 'base'
+
+# This class represents a specialized 'sum' term.
+# This term  calculates the sum of values for a specified key.
+class Factbase::Sum < Factbase::TermBase
+  # Constructor.
+  # @param [Array] operands Operands
+  def initialize(operands)
+    super()
+    @operands = operands
+    @op = :sum
+  end
+
+  # Evaluate term on a fact.
+  # @param [Factbase::Fact] _fact The fact
+  # @param [Array<Factbase::Fact>] maps All maps available
+  # @param [Factbase] _fb Factbase to use for sub-queries
+  # @return [Integer] The sum of values for the specified key across all maps
+  def evaluate(_fact, maps, _fb)
+    k = @operands[0]
+    raise "A symbol is expected, but '#{k}' provided" unless k.is_a?(Symbol)
+    sum = 0
+    maps.each do |m|
+      vv = m[k.to_s]
+      next if vv.nil?
+      vv = [vv] unless vv.respond_to?(:to_a)
+      vv.each do |v|
+        sum += v
+      end
+    end
+    sum
+  end
+end

data/lib/factbase/version.rb

@@ -9,5 +9,5 @@
 # License:: MIT
 class Factbase
   # Current version of the gem (changed by .rultor.yml on every release)
-  VERSION = '0.17.0' unless const_defined?(:VERSION)
+  VERSION = '0.17.1' unless const_defined?(:VERSION)
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: factbase
 version: !ruby/object:Gem::Version
-  version: 0.17.0
+  version: 0.17.1
 platform: ruby
 authors:
 - Yegor Bugayenko
@@ -208,13 +208,14 @@ files:
 - lib/factbase/tee.rb
 - lib/factbase/term.rb
 - lib/factbase/terms/absent.rb
-- lib/factbase/terms/aggregates.rb
+- lib/factbase/terms/agg.rb
 - lib/factbase/terms/always.rb
 - lib/factbase/terms/and.rb
 - lib/factbase/terms/arithmetic.rb
 - lib/factbase/terms/as.rb
 - lib/factbase/terms/assert.rb
 - lib/factbase/terms/base.rb
+- lib/factbase/terms/best.rb
 - lib/factbase/terms/boolean.rb
 - lib/factbase/terms/compare.rb
 - lib/factbase/terms/concat.rb
@@ -222,6 +223,7 @@ files:
 - lib/factbase/terms/defn.rb
 - lib/factbase/terms/div.rb
 - lib/factbase/terms/either.rb
+- lib/factbase/terms/empty.rb
 - lib/factbase/terms/env.rb
 - lib/factbase/terms/eq.rb
 - lib/factbase/terms/exists.rb
@@ -231,23 +233,27 @@ files:
 - lib/factbase/terms/head.rb
 - lib/factbase/terms/inverted.rb
 - lib/factbase/terms/join.rb
-- lib/factbase/terms/logical.rb
 - lib/factbase/terms/lt.rb
 - lib/factbase/terms/lte.rb
 - lib/factbase/terms/many.rb
 - lib/factbase/terms/matches.rb
+- lib/factbase/terms/max.rb
+- lib/factbase/terms/min.rb
 - lib/factbase/terms/minus.rb
 - lib/factbase/terms/never.rb
 - lib/factbase/terms/nil.rb
 - lib/factbase/terms/not.rb
+- lib/factbase/terms/nth.rb
 - lib/factbase/terms/one.rb
 - lib/factbase/terms/or.rb
 - lib/factbase/terms/plus.rb
 - lib/factbase/terms/prev.rb
 - lib/factbase/terms/shared.rb
+- lib/factbase/terms/simplified.rb
 - lib/factbase/terms/size.rb
 - lib/factbase/terms/sorted.rb
 - lib/factbase/terms/sprintf.rb
+- lib/factbase/terms/sum.rb
 - lib/factbase/terms/times.rb
 - lib/factbase/terms/to_float.rb
 - lib/factbase/terms/to_integer.rb

data/lib/factbase/terms/aggregates.rb

@@ -1,86 +0,0 @@
-# frozen_string_literal: true
-
-# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
-# SPDX-License-Identifier: MIT
-
-require_relative '../../factbase'
-
-# Aggregating terms.
-#
-# Author:: Yegor Bugayenko (yegor256@gmail.com)
-# Copyright:: Copyright (c) 2024-2025 Yegor Bugayenko
-# License:: MIT
-module Factbase::Aggregates
-  def min(_fact, maps, _fb)
-    assert_args(1)
-    _best(maps) { |v, b| v < b }
-  end
-
-  def max(_fact, maps, _fb)
-    assert_args(1)
-    _best(maps) { |v, b| v > b }
-  end
-
-  def nth(_fact, maps, _fb)
-    assert_args(2)
-    pos = @operands[0]
-    raise "An integer is expected, but #{pos} provided" unless pos.is_a?(Integer)
-    k = @operands[1]
-    raise "A symbol is expected, but #{k} provided" unless k.is_a?(Symbol)
-    m = maps[pos]
-    return nil if m.nil?
-    m[k.to_s]
-  end
-
-  def sum(_fact, maps, _fb)
-    k = @operands[0]
-    raise "A symbol is expected, but '#{k}' provided" unless k.is_a?(Symbol)
-    sum = 0
-    maps.each do |m|
-      vv = m[k.to_s]
-      next if vv.nil?
-      vv = [vv] unless vv.respond_to?(:to_a)
-      vv.each do |v|
-        sum += v
-      end
-    end
-    sum
-  end
-
-  def agg(fact, maps, fb)
-    assert_args(2)
-    selector = @operands[0]
-    raise "A term is expected, but '#{selector}' provided" unless selector.is_a?(Factbase::Term)
-    term = @operands[1]
-    raise "A term is expected, but '#{term}' provided" unless term.is_a?(Factbase::Term)
-    subset = fb.query(selector, maps).each(fb, fact).to_a
-    term.evaluate(nil, subset, fb)
-  end
-
-  def empty(fact, maps, fb)
-    assert_args(1)
-    term = @operands[0]
-    raise "A term is expected, but '#{term}' provided" unless term.is_a?(Factbase::Term)
-    # rubocop:disable Lint/UnreachableLoop
-    fb.query(term, maps).each(fb, fact) do
-      return false
-    end
-    # rubocop:enable Lint/UnreachableLoop
-    true
-  end
-
-  def _best(maps)
-    k = @operands[0]
-    raise "A symbol is expected, but #{k} provided" unless k.is_a?(Symbol)
-    best = nil
-    maps.each do |m|
-      vv = m[k.to_s]
-      next if vv.nil?
-      vv = [vv] unless vv.respond_to?(:to_a)
-      vv.each do |v|
-        best = v if best.nil? || yield(v, best)
-      end
-    end
-    best
-  end
-end

data/lib/factbase/terms/logical.rb

@@ -1,41 +0,0 @@
-# frozen_string_literal: true
-
-# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
-# SPDX-License-Identifier: MIT
-
-require_relative '../../factbase'
-
-# Logical terms.
-#
-# Author:: Yegor Bugayenko (yegor256@gmail.com)
-# Copyright:: Copyright (c) 2024-2025 Yegor Bugayenko
-# License:: MIT
-module Factbase::Logical
-  # Simplifies AND or OR expressions by removing duplicates
-  # @return [Factbase::Term] Simplified term
-  def and_or_simplify
-    strs = []
-    ops = []
-    @operands.each do |o|
-      o = o.simplify
-      s = o.to_s
-      next if strs.include?(s)
-      strs << s
-      ops << o
-    end
-    return ops[0] if ops.size == 1
-    self.class.new(@op, ops)
-  end
-
-  # Simplifies AND expressions by removing duplicates
-  # @return [Factbase::Term] Simplified term
-  def and_simplify
-    and_or_simplify
-  end
-
-  # Simplifies OR expressions by removing duplicates
-  # @return [Factbase::Term] Simplified term
-  def or_simplify
-    and_or_simplify
-  end
-end