factbase 0.15.8 → 0.16.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c8a08255776b850ff21a081e627196da1696622452c9953f331f3e585cd2877b
-  data.tar.gz: 6a0dd5bbd7cf3dd7fcd418297d189be1808474685111946c991bc9415d59c4d2
+  metadata.gz: 8fa39d2285106eb0a074d6dbb21bf2d25c5f2307be35e12496bac61cb130e67b
+  data.tar.gz: 61081f7b97fd49dfbd92c4960b02eee002cbc3bd14db718d07b7c789fb6d690e
 SHA512:
-  metadata.gz: 0b4151e52ef377a639025b96e0136dab4b56320d73773dfa15396f3267ae0a310c71e45f82115fe36e59b1c6cd34831e401e91062c279ac7bfefa278a940f471
-  data.tar.gz: d773f631b328ac501a1d19d18f671cb1637ea3b7ee4df684256ddd07b45ef2e84826b52441d6c4a0b57f24d95a7821fe57cf251887884b98f0b0c4a2961eeeb3
+  metadata.gz: ab0927194278acc74075b9abc96d3a05a284ba05b8296680b79c2e7e8a2ed12b3cc73e303ce97c1471b29e3bc47b8db46590fe256dc948853acee675f5813062
+  data.tar.gz: d17d7750750e46eba2dfe73c6622ceb894f97425c97912c1cdcabf3821cd7f9822fd094d478dafd58fa546fb83c8a8efe5a5c12dc816c832f347da2d4ea0d156

data/Gemfile.lock

@@ -72,7 +72,7 @@ GEM
       psych (>= 4.0.0)
     regexp_parser (2.11.2)
     rexml (3.4.2)
-    rubocop (1.80.1)
+    rubocop (1.80.2)
       json (~> 2.3)
       language_server-protocol (~> 3.17.0.2)
       lint_roller (~> 1.1.0)

data/README.md

@@ -176,6 +176,12 @@ It's also possible to use a sub-query in a shorter form than with the `agg`:
 
 * `(empty q)` is true if the subquery `q` is empty
 
+It's possible to post-process a list of facts, for `agg` and `join`:
+
+* `(sorted p expr)` sorts them by the value of `p` property
+* `(inverted expr)` reverses them
+* `(head n expr)` takes only `n` facts from the head of the list
+
 There are some system-level terms:
 
 * `(env v1 v2)` returns the value of environment variable `v1` or the string

data/lib/factbase/cached/cached_term.rb

@@ -17,6 +17,7 @@ module Factbase::CachedTerm
   # @return [bool] TRUE if matches
   def evaluate(fact, maps, fb)
     return super unless static? && !abstract?
+    return super if %i[head unique].include?(@op)
     key = [maps.object_id, to_s]
     before = @cache[key]
     @cache[key] = super if before.nil?

data/lib/factbase/indexed/indexed_term.rb

@@ -19,7 +19,9 @@ module Factbase::IndexedTerm
   # @param [Array<Hash>] maps Array of facts
   # @param [Hash] params Key/value params to use
   # @return [Array<Hash>|nil] Returns a new array, or NIL if the original array must be used
-  def predict(maps, params)
+  def predict(maps, fb, params)
+    m = :"#{@op}_predict"
+    return send(m, maps, fb, params) if respond_to?(m)
     key = [maps.object_id, @operands.first, @op]
     case @op
     when :one
@@ -144,7 +146,7 @@ module Factbase::IndexedTerm
         r = (maps & []) | j
       else
         @operands.each do |o|
-          n = o.predict(maps, params)
+          n = o.predict(maps, fb, params)
           break if n.nil?
           if r.nil?
             r = n
@@ -159,7 +161,7 @@ module Factbase::IndexedTerm
     when :or
       r = nil
       @operands.each do |o|
-        n = o.predict(maps, params)
+        n = o.predict(maps, fb, params)
         if n.nil?
           r = nil
           break
@@ -171,7 +173,7 @@ module Factbase::IndexedTerm
       r
     when :not
       if @idx[key].nil?
-        yes = @operands.first.predict(maps, params)
+        yes = @operands.first.predict(maps, fb, params)
         if yes.nil?
           @idx[key] = { r: nil }
         else

data/lib/factbase/query.rb

@@ -44,7 +44,7 @@ class Factbase::Query
     return to_enum(__method__, fb, params) unless block_given?
     yielded = 0
     params = params.transform_keys(&:to_s) if params.is_a?(Hash)
-    maybe = @term.predict(@maps, Factbase::Tee.new({}, params))
+    maybe = @term.predict(@maps, fb, Factbase::Tee.new({}, params))
     maybe ||= @maps unless maybe.equal?(@maps)
     maybe.each do |m|
       extras = {}

data/lib/factbase/tee.rb

@@ -27,7 +27,8 @@ class Factbase::Tee
   end
 
   def all_properties
-    @fact.all_properties + (@upper.is_a?(Hash) ? @upper.keys : @upper.all_properties)
+    (@fact.is_a?(Hash) ? @fact.keys : @fact.all_properties) +
+      (@upper.is_a?(Hash) ? @upper.keys : @upper.all_properties)
   end
 
   others do |*args|

data/lib/factbase/term.rb

@@ -53,6 +53,9 @@ class Factbase::Term
   require_relative 'terms/aggregates'
   include Factbase::Aggregates
 
+  require_relative 'terms/lists'
+  include Factbase::Lists
+
   require_relative 'terms/strings'
   include Factbase::Strings
 
@@ -107,8 +110,13 @@ class Factbase::Term
   # @param [Array<Hash>] maps Records to iterate, maybe
   # @param [Hash] _params Params to use (keys must be strings, not symbols, with values as arrays)
   # @return [Array<Hash>] Records to iterate
-  def predict(maps, _params)
-    maps
+  def predict(maps, fb, params)
+    m = :"#{@op}_predict"
+    if respond_to?(m)
+      send(m, maps, fb, params)
+    else
+      maps
+    end
   end
 
   # Does it match the fact?

data/lib/factbase/terms/lists.rb

@@ -0,0 +1,57 @@
+# frozen_string_literal: true
+
+# SPDX-FileCopyrightText: Copyright (c) 2024-2025 Yegor Bugayenko
+# SPDX-License-Identifier: MIT
+
+require_relative '../../factbase'
+
+# Lists management.
+#
+# Author:: Yegor Bugayenko (yegor256@gmail.com)
+# Copyright:: Copyright (c) 2024-2025 Yegor Bugayenko
+# License:: MIT
+module Factbase::Lists
+  def sorted(_fact, _maps, _fb)
+    true
+  end
+
+  def sorted_predict(maps, fb, params)
+    assert_args(2)
+    prop = @operands[0]
+    raise "A symbol is expected as first argument of 'sorted'" unless prop.is_a?(Symbol)
+    term = @operands[1]
+    raise "A term is expected, but '#{term}' provided" unless term.is_a?(Factbase::Term)
+    fb.query(term, maps).each(fb, params).to_a
+      .reject { |m| m[prop].nil? }
+      .sort_by { |m| m[prop].first }
+      .map { |m| m.all_properties.to_h { |k| [k, m[k]] } }
+  end
+
+  def inverted(_fact, _maps, _fb)
+    true
+  end
+
+  def inverted_predict(maps, fb, params)
+    assert_args(1)
+    term = @operands[0]
+    raise "A term is expected, but '#{term}' provided" unless term.is_a?(Factbase::Term)
+    fb.query(term, maps).each(fb, params).to_a
+      .reverse
+      .map { |m| m.all_properties.to_h { |k| [k, m[k]] } }
+  end
+
+  def head(_fact, _maps, _fb)
+    true
+  end
+
+  def head_predict(maps, fb, params)
+    assert_args(2)
+    max = @operands[0]
+    raise "An integer is expected as first argument of 'sorted'" unless max.is_a?(Integer)
+    term = @operands[1]
+    raise "A term is expected, but '#{term}' provided" unless term.is_a?(Factbase::Term)
+    fb.query(term, maps).each(fb, params).to_a
+      .take(max)
+      .map { |m| m.all_properties.to_h { |k| [k, m[k]] } }
+  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.15.8' unless const_defined?(:VERSION)
+  VERSION = '0.16.1' unless const_defined?(:VERSION)
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: factbase
 version: !ruby/object:Gem::Version
-  version: 0.15.8
+  version: 0.16.1
 platform: ruby
 authors:
 - Yegor Bugayenko
@@ -202,6 +202,7 @@ files:
 - lib/factbase/terms/casting.rb
 - lib/factbase/terms/debug.rb
 - lib/factbase/terms/defn.rb
+- lib/factbase/terms/lists.rb
 - lib/factbase/terms/logical.rb
 - lib/factbase/terms/math.rb
 - lib/factbase/terms/meta.rb