How about a perl filter to strip all non-fwp posts to this list?
I have posted this on a couple of other perl lists and recieved no
response, so I thought I would try here.
I get this error on more than one module:
Digest-SHA1-2.03]# make test
PERL_DL_NONLAZY=1 /usr/bin/perl -MExtUtils::Command::MM -e
test_harness(0, 'blib/lib', 'blib/arch') t/*.t
Gareth wrote:
How about a perl filter to strip all non-fwp posts to this list?
Depends on one's definition of fun I guess - some might say it's perl
programs that are whimsical in some way like the Camel script, or a
well-obfuscated japh, whereas some might say it's a really meaty problem
that
* Tim Dolezal [EMAIL PROTECTED] [2003-07-17 07:27]:
I have posted this on a couple of other perl lists
Including this one...
and recieved no response,
But you did. A couple people on this list told you to try setting LANG. This
wasn't much fun the first time around, but it's even less fun
On Thu, Jul 17, 2003 at 09:31:31AM +0100, Moran, Matthew wrote:
Gareth wrote:
How about a perl filter to strip all non-fwp posts to this list?
Depends on one's definition of fun I guess - some might say it's perl
programs that are whimsical in some way like the Camel script, or a
This list needs a fun subject...
What is the most interesting program that is restricted to
use each ASCII character at most once?
This isn't golf, its up to the inspiration of all to develop the wierdest,
most wonderful program.
Example valid program: print 42
Let the fun begin...
Richard
Gareth James Hughes said:
[ fwp_filter.pl: message filtered for non fun content ]
--
Paul Johnson - [EMAIL PROTECTED]
http://www.pjcj.net
Richard Proctor wrote:
What is the most interesting program that is restricted to
use each ASCII character at most once?
Anybody who can do a JAPH like that?
Steffen
--
@n=([283488072,6076],[2105905181,8583184],[1823729722,9282996],[281232,
What is the most interesting program that is restricted to
use each ASCII character at most once?
The definition I chose was to check if a program (from @ARGV) contains
duplicate chars and printing a duplicate char iff it has one. This had a
sort of quiney feel to it and hence could be
So, this list is live again, huh?
(I re-subscribed 2 month ago and after 2 weeks of silence I thought there is
something wrong with the mail server since no email was coming...)
Anyway...
Ronald, I'm a beginner in JAPHS but I managed to see what's the idea in
yours. (Of course calculating the
* [EMAIL PROTECTED] [EMAIL PROTECTED] [2003-07-17 21:15]:
What is the most interesting program that is restricted to
use each ASCII character at most once?
The definition I chose was to check if a program (from @ARGV)
contains duplicate chars and printing a duplicate char iff it
has one.
[EMAIL PROTECTED] schreef:
Can anyone improve the above so that it checks the whole of , not just one
line? Bonus points for an explicit multi-character message rather than undef
on failure.
#!perl -0234
=~m{(.)[^$/]*\1}sandtwo
contains no characters twice (except for the final \n), checks
12 matches
Mail list logo