This Ruby gem manages an in-memory database of facts. A fact is simply an associative array of properties and their values. The values are either atomic literals or non-empty sets of literals. It is possible to delete a fact, but impossible to delete a property from a fact.
Here is how you use it (it's thread-safe, by the way):
fb = Factbase.new
f = fb.insert
f.kind = 'book'
f.title = 'Object Thinking'
fb.query('(eq kind "book")').each do |f|
f.seen = true
end
fb.insert
fb.query('(not (exists seen))').each do |f|
f.title = 'Elegant Objects'
endYou can save the factbase to the disk and then load it back:
file = '/tmp/simple.fb'
f1 = Factbase.new
f = f1.insert
f.foo = 42
File.save(file, f1.export)
f2 = Factbase.new
f2.import(File.read(file))
assert(f2.query('(eq foo 42)').each.to_a.size == 1)You can check the presence of an attribute by name and then set it, also by name:
n = 'foo'
if f[n].nil?
f.send("#{n}=", 'Hello, world!')
endYou can make a factbase log all operations:
require 'loog'
require 'factbase/logged'
log = Loog::VERBOSE
fb = Factbase::Logged.new(Factbase.new, log)
f = fb.insertYou can also count the amount of changes made to a factbase:
require 'loog'
require 'factbase/tallied'
log = Loog::VERBOSE
fb = Factbase::Tallied.new(Factbase.new, log)
f = fb.insert
churn = fb.churn
assert churn.inserted == 1There are some boolean terms available in a query
(they return either true or false):
(always)and(never)aretrueandfalse(nil v)istrueifvisnil(not b)is the inverse ofb(or b1 b2 ...)istrueif at least one argument istrue(and b1 b2 ...)— if all arguments aretrue(when b1 b2)— ifb1istrueandb2istrueorb1isfalse(exists p)— ifpproperty exists(absent p)— ifpproperty is absent(zero v)— if anyvequals to zero(eq v1 v2)— if anyv1equals to anyv2(lt v1 v2)— if anyv1is less than anyv2(gt v1 v2)— if anyv1is greater than anyv2(many v)— ifvhas many values(one v)— ifvhas one value
There are string manipulators:
(concat v1 v2 v3 ...)— concatenates allv(sprintf v v1 v2 ...)— creates a string byvformat with params(matches v s)— if anyvmatches thesregular expression
There are a few terms that return non-boolean values:
(at i v)is thei-th value ofv(size v)is the cardinality ofv(zero ifvisnil)(type v)is the type ofv("String","Integer","Float","Time", or"Array")(either v1 v1)isv2ifv1isnil
It's possible to modify the facts retrieved, on fly:
(as p v)adds propertypwith the valuev(join s t)adds properties named by thesmask with the values retrieved by thetterm, for example,(join "x<=foo,y<=bar" (gt x 5))will addxandyproperties, setting them to values found in thefooandbarproperties in the facts that match(gt x 5)
Also, some simple arithmetic:
(plus v1 v2)is a sum of∑v1and∑v2(minus v1 v2)is a deduction of∑v2from∑v1(times v1 v2)is a multiplication of∏v1and∏v2(div v1 v2)is a division of∏v1by∏v2
It's possible to add and deduct string values to time values, like
(plus t '2 days') or (minus t '14 hours').
Types may be converted:
(to_int v)is an integer ofv(to_str v)is a string ofv(to_float v)is a float ofv
One term is for meta-programming:
(defn f "self.to_s")defines a new term using Ruby syntax and returnstrue(undef f)undefines a term (nothing happens if it's not defined yet), returnstrue
There are terms that are history of search aware:
(prev p)returns the value ofpproperty in the previously seen fact(unique p1 p2 ...)returns true if at least one property value hasn't been seen yet; returns false when all specified properties have duplicate values in this particular combination
The agg term enables sub-queries by evaluating the first argument (term)
over all available facts, passing the entire subset to the second argument,
and then returning the result as an atomic value:
(lt age (agg (eq gender 'F') (max age)))selects all facts where theageis smaller than the maximumageof all women(eq id (agg (always) (max id)))selects the fact with the largestid(eq salary (agg (eq dept $dept) (avg salary)))selects the facts with the salary average in their departments
There are also terms that match the entire factbase
and must be used primarily inside the (agg ..) term:
(nth v p)returns thepproperty of the v-th fact (must be a positive integer)(first p)returns thepproperty of the first fact(count)returns the tally of facts(max p)returns the maximum value of thepproperty in all facts(min p)returns the minimum(sum p)returns the arithmetic sum of all values of thepproperty
It's also possible to use a sub-query in a shorter form than with the agg:
(empty q)is true if the subqueryqis empty
It's possible to post-process a list of facts, for agg and join:
(sorted p expr)sorts them by the value ofpproperty(inverted expr)reverses them(head n expr)takes onlynfacts from the head of the list
There are some system-level terms:
(env v1 v2)returns the value of environment variablev1or the stringv2if it's not set
Read these guidelines. Make sure your build is green before you contribute your pull request. You will need to have Ruby 3.2+ and Bundler installed. Then:
bundle update
bundle exec rakeIf it's clean and you don't see any error messages, submit your pull request.
This is the result of the benchmark:
user
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 on 2025-10-15 at 14:53, on Linux with 4 CPUs.