Thanks, fixed in our svn. When I push 2.9.1 to sourceforge, the fix will be there.
2013-05-06 09:13:43 PDT in SHOP
Thank you for the correction. I have modified the text in the manual to give the basis case (a TaskList may be a TaskAtom) of the recursion. It will be there when the next patch level of SHOP2 is released.
2013-05-03 13:42:17 PDT in SHOP
Thanks, Brad. I have tried to use the Lispworks personal version, but I doubt it will work for this purpose. Some of the tests need a fair number of cycles and memory, and I believe that LW personal is limited that way. Also, I can't run it in a shell, which makes testing painful...
2013-05-03 11:07:56 PDT in SHOP
Oh, yes, sorry, I see. That was simply a typo. Will fix that, too. Many thanks!
2013-05-01 08:20:21 PDT in SHOP
Thanks for these. I'm pushing the first two in, and they will appear in a future version 2.9.1. Unfortunately, I can't actually test on lispworks. As for the test fail, I need to check on how this will work -- FiveAM has drifted, and we haven't pulled our local version together with upstream in a while.
2013-05-01 08:18:35 PDT in SHOP
I'm afraid that the Java version of SHOP is simply dead, as far as I can tell. If you are interested in the Lisp version I could help, but otherwise you are on your own, sorry -- no one has shown any interest in maintaining JSHOP.
2013-03-19 07:08:41 PDT in SHOP
That makes sense: we may not be collecting enough information to create the plan trees if you don't pass :plan-tree t into find-plans. Haven't actually checked.
2013-02-22 08:51:54 PST in SHOP
I'm afraid I don't have the time to do this myself, but it would be a relatively simple extension for an interested party to make. Here's the short answer: Find the call to plan-found-hook. You need to add a plan tree to the arguments passed to it. Plan trees are not normally computed, so you need to do this. Fortunately, it should be pretty simple. The additional argument you would...
2013-02-21 19:46:23 PST in SHOP