Stories
Slash Boxes
Comments
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

use Perl Log In

Log In

[ Create a new account ]

TeeJay (2309)

TeeJay
  (email not shown publicly)
http://www.aarontrevena.co.uk/

Working in Truro
Graduate with BSc (Hons) in Computer Systems and Networks
pm : london.pm, bath.pm, devoncornwall.pm
lug : Devon & Cornwall LUG
CPAN : TEEJAY [cpan.org]
irc : TeeJay
skype : hashbangperl
livejournal : hashbangperl [livejournal.com]
flickr :hashbangperl [flickr.com]

Journal of TeeJay (2309)

Monday January 31, 2005
02:38 PM

search and replace in SQL Server

[ #22955 ]

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 Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More | Login | Reply
Loading... please wait.
  • As somone who tried to do only barely non-trivial arithmetic in a Prolog setting once, I am not surprised that WProlog doesn't feel the need of it. Peano axiom arithmetic would have worked better!

    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(

    --
    Bill
    # I had a sig when sigs were cool
    use Sig;
  • I've uploaded the changes I did last and it should compile.

    Now to write the examples, from which I will get the tests and documentation, which will give me examples, which....

    --

    @JAPH = qw(Hacker Perl Another Just);
    print reverse @JAPH;