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 |
c60cac27a0a7 |
| children |
cb324d188513 |
Bones is a logic programming library for Common Lisp.
**Bones is still in development, don't actually try to use this for anything
yet. It should be usable by mid-2016.**
* **License:** MIT/X11
* **Documentation:** <http://sjl.bitbucket.org/bones/>
* **Code:** <http://bitbucket.org/sjl/bones/>
* **Issues:** <http://bitbucket.org/sjl/bones/issues/>
<img src="https://i.imgur.com/EWPGAHa.gif"
style="border: 1px solid #222; margin: 15px 0px 10px; width: 100%;"/>