16:23:45mfianoYes, the input is trusted, although i set eval to nil
16:25:03pjbNote: it's an accessor, so you can update the file with: (setf (com.informatimago.common-lisp.cesarum.file:sexp-list-file-contents "file.sexps") '((define-thing x) (define-stuff z)))
17:02:06pjboleo: your code will fail lamentably on CRLF and any other unicode character.
17:03:30pjbWell, no, I'm wrong. It's ok, it just allocates a little more, hidden by the fill pointer. I need a rest.
17:04:33mfianoIs there a way to write a lambda list with destructuring-bind that binds all the BUTLAST forms to a variable, and the LAST form to another variable?
17:08:13dmilesgads, since sbcl was 9x faster at fibonacci than YAP-Prolog .. i figured i'd have a go at trying out some prolog-in-lisps ... if figured i'd see if sbcl running one the the prologs would be faster than YAP, however the bad news is all of the prolog-in-lisp run out of memory at fib(18,_) and above :(
18:00:33jackdanielthanks :) we are slowly moving forward
18:05:14jackdanielcheck out clx repository for a fix. If you want to run McCLIM with CCL I would wait a few days – something is not right and it may not work for you
18:51:20sjl_dmiles: I mean, it has a few tests. it's not really done, and I burned out on it before I finished. I should get back to it some time
18:53:06sjl_It worked to demo my general game playing stuff at ELS, lol
18:58:33sjl_dmiles: I pushed up the half-sketched out docs https://sjl.bitbucket.io/temperance/