After a few hours fighting this problem a couple of weeks ago, I find this rather handy script to find and replace a string in a TEXT field in SQL Server.
SQL Server really does make some tasks incredibly awkward that are trivial in even relatively lightweight databases like MySQL - it is rubbish at find/replace, and its fulltext search requires sceduled indexing and godawful syntax.
on a sidenote I have started yet another personal project - Mayfly. So far I have put together some very very crufty alpha code that provides a CDBI API to Bugzilla that will form the underlying model while Maypole will handle the View/Control aspects and Email::* will handle mail. see the following link for work so far.. Development-Bugzilla svn repository
The maze program's suc/2 predicate provides equivalent to Peano axioms. Interesting, the wall/1 predicate defines a wall around two sides of a node, toward the lower numbers?
It's unclear to me why solve(p(2,2), L) would run long, but I'm assmunig its because it depth-first searches and has to backtrack from p(1,1)->p(1,8)->p(8,8). Good luck tracking down the (1,1) (2,2)
Re:Prolog and Arithmetic
broquaint on 2005-02-01T08:20:20
Shouldn't this be on reply to Ovid's recent journal entry?Re:Prolog and Arithmetic
n1vux on 2005-02-03T20:31:41
Yup. I wonder how it got here.
Now to write the examples, from which I will get the tests and documentation, which will give me examples, which....
