Use a queues instead of lists for the logic frame pending predicates
I wonder if this is ACTUALLY faster, since often there will probably only be
a couple of entries in a particular predicate's list? But then again there are
some HUGE predicates (e.g. successor relations), so it'll benefit us there.
Either way, conceptually the thing should be FIFO, so as long as using queues
doesn't COST us performance I'm happy.
| author |
Steve Losh <steve@stevelosh.com> |
| date |
Tue, 05 Jul 2016 23:37:14 +0000 |
| parents |
410acaae0c14 |
| children |
2415dbe555d2 |
(defpackage #:bones
(:use #:cl)
(:export #:hello))
(defpackage #:bones.utils
(:use
#:cl
#:defstar
#:cl-arrows
#:bones.quickutils)
(:export
#:repeat
#:hex
#:push-if-new
#:recursively
#:recur
#:when-let
#:unique-items
#:dis
#:gethash-or-init
#:make-queue
#:enqueue
#:dequeue
#:queue-contents
#:queue-empty-p
#:queue-append)
(:shadowing-import-from #:cl-arrows
#:->))
(defpackage #:bones.circle
(:use #:cl #:defstar)
(:export
#:make-circle-with
#:make-empty-circle
#:circle-to-list
#:circle-prepend
#:circle-prepend-circle
#:circle-append
#:circle-append-circle
#:circle-next
#:circle-prev
#:circle-forward
#:circle-backward
#:circle-value
#:circle-rotate
#:circle-nth
#:circle-insert-before
#:circle-insert-after
#:circle-sentinel-p
#:circle-empty-p
#:circle-remove
#:circle-backward-remove
#:circle-forward-remove
#:circle-replace
#:circle-backward-replace
#:circle-forward-replace
#:circle-splice
#:circle-backward-splice
#:circle-forward-splice
#:circle-insert-beginning
#:circle-insert-end))
(defpackage #:bones.wam
(:use
#:cl
#:defstar
#:optima
#:cl-arrows
#:bones.circle
#:bones.quickutils
#:bones.utils)
(:import-from #:optima
#:match)
(:shadowing-import-from #:cl-arrows
#:->))
(defpackage #:bones.paip
(:use
#:cl
#:defstar
#:bones.quickutils)
(:documentation "Test?")
(:export
;; Unification, constants
#:unify
#:fail
#:no-bindings
#:*check-occurs*
;; Destructive unification
#:unify!
#:unbound
#:bound-p
;; Database management
#:clear-db
#:clear-predicate
#:fact
#:rule
#:add-fact
#:rule-fact
;; Lisp data structures as results
#:return-one
#:return-all
;; Interactive queries
#:query
#:query-one
#:query-all))