ruby-prolog 2.1.0 → 2.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ffa39b815b60de57f1865b1c5b2abd00345623c2d90a81c4185f5800bfe957ca
-  data.tar.gz: 2b279f1a9c1e6cfb9320de5c52a6ee484f47e62f1001a58d3bd17c56ff9fca57
+  metadata.gz: 4dd70c2b7255275600ce03afa496196c08e1934e8c8a76d4300ea6a29ffa89f5
+  data.tar.gz: 2d0aa3ed40c536a4d1f3d39d883640238f1aa569c80de4f16066b08fa7db82d9
 SHA512:
-  metadata.gz: 6efaec42888b2749232637261b933e3a07c0a889b4ebc73995b7252e02048438b74b11d9c55a24e2687ecb0581e6d3c6d1efaad43444e3fa4601b5bc9165c432
-  data.tar.gz: f73024546d7bfd77b39fbd738bd06eacb0b1b3f025309fc55b3a43e332e7b2b8c8ab714db399886a62003a1b261ceab2ed65ee5d7adff9ac3cb267a399a864de
+  metadata.gz: ad4daa2df49daf2c182142148c67b54d81828eb953fc54be41f540a47e280afc735dc322d507201afbbdd9dbfb93badc9dc943abb3f019abf8cbf25efba0169b
+  data.tar.gz: 06e32aac58dedaaa865be276203f4b3667447ca4e4c3a5ae855d2eaa0c94c14eb47900e59b4445e8f79665e83536edcd1b5d1cfff08af96b8e48c0d3116d1d10

data/README.md

@@ -89,6 +89,37 @@ end
 
 This will mutate your database. If you want to "fork" your database instead, you can call `db.clone`, which will return a new instance with all stored data. Cloning like this is optimized to copy as little as possible.
 
+### `to_prolog`
+
+If you're loading rules from a database, you might be generating predicates like this:
+
+```rb
+rules = Ruleset.find_by(org: ...).rules
+db = RubyProlog.new do
+  rules['permissions'].map do |role, perm|
+    permission[role, perm].fact
+  end
+end
+```
+
+However, if something doesn't work, how do find out why?
+
+This is where `#to_prolog` comes in handy. Just run it on your instance:
+
+```rb
+puts db.to_prolog
+```
+
+and you'll get something that looks like this:
+
+```text
+permission('admin', 'invite').
+permission('admin', 'ban').
+permission('membe', 'create_post').
+```
+
+Then you can do a quick copy/paste into an environment like [Tau Prolog's sandbox](http://tau-prolog.org/sandbox/) or [SWISH](https://swish.swi-prolog.org) and run some queries.
+
 Examples
 ----
 

data/lib/ruby-prolog/ruby-prolog.rb

@@ -14,8 +14,8 @@ module RubyProlog
     attr_reader :id, :name
     attr_accessor :db, :clauses
 
-    def initialize(db, name)
-      @id = (@@id_counter += 1)
+    def initialize(db, name, explicit_id: nil)
+      @id = explicit_id || (@@id_counter += 1)
       @db = db
       @name = name
       @clauses = []
@@ -52,6 +52,7 @@ module RubyProlog
       goals = rhs.map do |x|
         case x
         when TempClause then x.to_goal
+        when false then Goal.new(0, 'false', [])
         else x
         end
       end
@@ -259,8 +260,12 @@ module RubyProlog
     attr_reader :by_name, :by_id
 
     def initialize
-      @by_name = {}
-      @by_id = {}
+      @by_name = {
+        'false' => Predicate.new(self, 'false', explicit_id: 0)
+      }
+      @by_id = {
+        0 => @by_name['false']
+      }
       @listing_enabled = false
       @listing = {}
     end

data/lib/ruby-prolog/version.rb

@@ -1,5 +1,5 @@
 module RubyProlog
 
-	VERSION = '2.1.0'
+	VERSION = '2.2.0'
 
 end

data/test/lib/ruby-prolog/ruby-prolog_test.rb

@@ -90,6 +90,22 @@ describe RubyProlog do
     _( two.query {_= foo[:X] } ).must_equal [{X: 10}, {X: 30}]
   end
 
+  it 'supports false' do
+    db = RubyProlog.new do
+      foo[:_] << [false]
+      foo['x'].fact
+
+      bar[:_] << [:CUT, false]
+      bar['x'].fact
+
+      baz[false].fact
+    end
+
+    _( db.query{ foo['x'] } ).must_equal [{}]
+    _( db.query{ bar['x'] } ).must_equal []
+    _( db.query{ baz[false] } ).must_equal [{}]
+  end
+
   it 'should be able to query simple family trees.' do
 
     c = RubyProlog.new do

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby-prolog
 version: !ruby/object:Gem::Version
-  version: 2.1.0
+  version: 2.2.0
 platform: ruby
 authors:
 - Preston Lee
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2020-04-01 00:00:00.000000000 Z
+date: 2020-04-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler