[12602] in Perl-Users-Digest
Perl-Users Digest, Issue: 15 Volume: 9
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Fri Jul 2 20:57:39 1999
Date: Fri, 2 Jul 1999 17:55:16 -0700 (PDT)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Fri, 2 Jul 1999 Volume: 9 Number: 15
Today's topics:
Problem with Black & Decker Continuous Cleaning Toast-R <revjack@radix.net>
Re: Problem with Black & Decker Continuous Cleaning Toa (M.J.T. Guy)
Programmer Needed <achau@pacbell.net>
Random Numbers rt_daemon@my-deja.com
Re: Random Numbers (David Efflandt)
Re: Random Numbers (elephant)
Re: reading log files (Michel Dalle)
Recursion question <apollock11@hotmail.com>
Re: Recursion question <juex@my-dejanews.com>
Re: regex to match nested paranthesis (Mark-Jason Dominus)
Re: regexp riddle <msoulier@americasm01.nt.com>
Re: regexp riddle <msoulier@americasm01.nt.com>
Re: regexp riddle <msoulier@americasm01.nt.com>
Re: regexp riddle (Greg Bacon)
Re: regExpr question. <marlon@soda.CSUA.Berkeley.EDU>
Re: regExpr question. (Bart Lateur)
Regexpr tool? <pautler@hawaii.edu>
Remote management of IIS metabase via Perl <carvdawg@patriot.net>
Reorder bytes within 90-byte records in a file with 1,0 (Greg Teets)
Re: returning a hash from a function (Bart Lateur)
Re: Robot email/poster (new proposal) (John Stanley)
Re: Robot email/poster (new proposal) (Abigail)
Re: Robot email/poster (new proposal) (Bart Lateur)
Re: Robot email/poster (new proposal) (Bart Lateur)
Re: Robot email/poster (new proposal) (Greg Bacon)
Re: Robot email/poster (new proposal) <gt7202e@prism.gatech.edu>
Re: Robot email/poster (new proposal) (John Stanley)
Re: Robot email/poster (new proposal) (Abigail)
Re: Robot email/poster for this group (Tad McClellan)
Re: Robot email/poster for this group (Bart Lateur)
Digest Administrivia (Last modified: 1 Jul 99) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: 2 Jul 1999 23:26:27 GMT
From: revjack <revjack@radix.net>
Subject: Problem with Black & Decker Continuous Cleaning Toast-R-Oven
Message-Id: <7ljhr3$kde$1@news1.Radix.Net>
Keywords: Hexapodia as the key insight
Sorry if this has already been covered, but I checked all the FAQs. The
problem is the toaster lever on my Black & Decker Continuous Cleaning
Toast-R-Oven only stays down for a few seconds before popping up. It used
to work okay but now it doesn't. What am I doing wrong??? Is this a FAQ? I
am using perl version 5.004_04 built for sun4-solaris.
------------------------------
Date: 3 Jul 1999 00:33:17 GMT
From: mjtg@cus.cam.ac.uk (M.J.T. Guy)
Subject: Re: Problem with Black & Decker Continuous Cleaning Toast-R-Oven
Message-Id: <7ljlod$faj$1@pegasus.csx.cam.ac.uk>
Keywords: Hexapodia as the key insight
In article <7ljhr3$kde$1@news1.Radix.Net>, revjack <revjack@radix.net> wrote:
>Sorry if this has already been covered, but I checked all the FAQs. The
>problem is the toaster lever on my Black & Decker Continuous Cleaning
>Toast-R-Oven only stays down for a few seconds before popping up. It used
>to work okay but now it doesn't. What am I doing wrong??? Is this a FAQ? I
>am using perl version 5.004_04 built for sun4-solaris.
Perl version 5.004_04 ??? Don't you realise that's more than 20 months
old? See
perldoc perlhist
Its DWIM.pm module is not Y2K compatible, has numerous well-known bugs,
not to mention security loopholes too appalling for CERT to report.
Upgrade to perl6 *immediately*.
HAND
Mike Guy
------------------------------
Date: Fri, 2 Jul 1999 16:41:39 -0700
From: "Andy" <achau@pacbell.net>
Subject: Programmer Needed
Message-Id: <r8cf3.2375$FE6.61200@typhoon-sf.snfc21.pbi.net>
Hi,
I am looking for a programmer to create script for my site. Maybe even a
small database.
There is a sample page at home.pacbell.net/achau
It describes in more detail what I am looking for.
You can contact me at
achau@pacbell.net
Thanks
Andy
------------------------------
Date: Fri, 02 Jul 1999 05:45:31 GMT
From: rt_daemon@my-deja.com
Subject: Random Numbers
Message-Id: <7lhjlp$2ro$1@nnrp1.deja.com>
How do I make my random numbers to be of 7 Numbers and between 0 and
9999999
0000000 to 9999999
Sent via Deja.com http://www.deja.com/
Share what you know. Learn what you don't.
------------------------------
Date: 2 Jul 1999 06:50:45 GMT
From: efflandt@xnet.com (David Efflandt)
Subject: Re: Random Numbers
Message-Id: <slrn7noo5o.1id.efflandt@efflandt.xnet.com>
On Fri, 02 Jul 1999 05:45:31 GMT, rt_daemon@my-deja.com
<rt_daemon@my-deja.com> wrote:
>How do I make my random numbers to be of 7 Numbers and between 0 and
>9999999
>
>0000000 to 9999999
You mean 7 digits. See 'perldoc -f rand'.
You probably want something like: int(rand(10000000));
--
David Efflandt efflandt@xnet.com http://www.xnet.com/~efflandt/
http://www.de-srv.com/ http://cgi-help.virtualave.net/
------------------------------
Date: Fri, 2 Jul 1999 18:13:22 +1000
From: e-lephant@b-igpond.com (elephant)
Subject: Re: Random Numbers
Message-Id: <MPG.11e71fa9dbe2b73989ad5@news-server>
rt_daemon@my-deja.com writes ..
>How do I make my random numbers to be of 7 Numbers and between 0 and
>9999999
>
>0000000 to 9999999
my $randomNumber = sprintf( "%07d", int(rand(10000000)));
--
jason - remove all hyphens for email reply -
------------------------------
Date: Fri, 02 Jul 1999 13:03:16 GMT
From: michel.dalle@usa.net (Michel Dalle)
Subject: Re: reading log files
Message-Id: <7lidc1$k7a$2@news.mch.sbs.de>
In article <377C335D.C40D1818@pacbell.net>, jaimedp@pacbell.net wrote:
>Martin, I need to create a report on the log file.
Try analog. It's free, fast and excellent for all 'standard' statistics.
See http://www.statslab.cam.ac.uk/~sret1/analog/
If you want more 'imaginative' reports, try the one below for example :-)
Michel.
--
aWebVisit - extracts visitor information from WWW logfiles and shows
the top entry, transit, exit and 'hit&run' pages, the links followed
inside your website, the time spent per page, the visit duration etc.
For more details, see http://gallery.uunet.be/Michel.Dalle/awv.html
------------------------------
Date: Fri, 2 Jul 1999 14:30:57 -0700
From: "Alvin Pollock" <apollock11@hotmail.com>
Subject: Recursion question
Message-Id: <7ljau5$kos$1@agate.berkeley.edu>
Hi! This isn't strictly a perl question. more of a general programming
issue, but I AM using perl so here goes anyway.
I have a recursive subroutine which navigates the nodes of an unbalanced,
unsorted binary tree. What I would like to do is process the FIRST
occurrence
of a node which matches a given condition then immediately exit the
subroutine,
no matter what depth in the stack I am at. I don't want it to process any
subsequent
occurrences. I can think of several ways to do this, including setting a
global or
static flag, but I can't think of a way to do it in the confines of good
programming
practice. Can anybody help? Here's the subroutine:
&Recurse ($Root, \&Print);
sub Recurse {
my ($node, $sub) = @_;
if ($node) {
if ($node->{location} =~ /$Repository/) {
$sub->($node);
# Need to completely exit &Recurse at this point
}
&Recurse ($node->{sub}, $sub);
&Recurse ($node->{next}, $sub);
}
}
Alvin
apollock11@hotmail.com
------------------------------
Date: Fri, 2 Jul 1999 15:53:59 -0700
From: "Jürgen Exner" <juex@my-dejanews.com>
Subject: Re: Recursion question
Message-Id: <7ljfsg$vc1@news.dns.microsoft.com>
Alvin Pollock <apollock11@hotmail.com> wrote in message
news:7ljau5$kos$1@agate.berkeley.edu...
> Hi! This isn't strictly a perl question. more of a general programming
> issue, but I AM using perl so here goes anyway.
>
> I have a recursive subroutine which navigates the nodes of an unbalanced,
> unsorted binary tree. What I would like to do is process the FIRST
> occurrence
> of a node which matches a given condition then immediately exit the
> subroutine,
> no matter what depth in the stack I am at. I don't want it to process any
> subsequent
> occurrences. I can think of several ways to do this, including setting a
> global or
> static flag, but I can't think of a way to do it in the confines of good
> programming
> practice.
No problem:
Your subroutine must return a value, which basically says "I did the thing"
or "Not done yet, please try next node".
Then inside the subroutine you would do something like (in free-style
notation)
if (this is the node) {
do your job;
return "JobDone";
} else {
if (noSubNodes) {
return "NotDone";
} else {
if (recurse(leftsubnode) eq "JobDone") {
return "JobDone"
} else {
return recurse(rightsubnode);
}}}}}}}}}}}}}}}}}}}}}}}
jue
--
Jürgen Exner
------------------------------
Date: Fri, 02 Jul 1999 16:01:26 GMT
From: mjd@op.net (Mark-Jason Dominus)
Subject: Re: regex to match nested paranthesis
Message-Id: <7linnm$4lv$1@monet.op.net>
In article <7lgqm9$qv7$1@nnrp1.deja.com>,
girish deodhar <calciii@my-deja.com> wrote:
>you have stumbled upon (or cleverly noticed) a basic
>limitation of "finite automata" which is how 'regex'es
>are implemented.
Perl regexes are not finite automata. It's easy to see this: The
language recognized by
/^(.*)\1$/
is clearly not regular and is not recognized by any finite automaton.
On the same hand, the Perl regex
/^(?{local$d=0})(?:\((?{$d++})|\)(?{$d--})(?(?{$d<0})(?!))|(?>[^()]*))*(?(?{$d!=0})(?!))$/
will match strings in which the parentheses are balanced, and only
those strings. (Caution: This does not work yet in 5.005 except in
the maintenance versions.)
Better strategies:
1. use
@parens = $string =~ /[()]/g;
and then loop over @parens like this:
my $d = 0;
for (@parens) {
if ($_ eq '(') { ++$d }
else { ++$bad, last if --$d < 0 }
}
if ($bad || $d > 0) {
# mismatched parentheses
} else {
# correctly nested parentheses
}
2. See http://www.plover.com/~mjd/perl/LOD/#1
3. Write a real parser and do the parenthesis checking as part of the parser.
------------------------------
Date: Fri, 02 Jul 1999 17:02:07 -0400
From: "Soulier, Michael [SKY:1Z22:EXCH]" <msoulier@americasm01.nt.com>
Subject: Re: regexp riddle
Message-Id: <377D28CF.62114650@americasm01.nt.com>
Jordan Hiller wrote:
>
> If it's possible to use backreferences this way, maybe you can attempt something
> like this. This would exclude things that already have been matched but I know
> my code is quite right. Maybe someone can try fixing it up.
>
> ([dxbe])([dxbe^\1])([dxbe^\1\2])([dxbe^\1\2\3])
Now, someone mentioned that the ^ negation in regexps is only supposed
to work if it's the first character in the pattern. The above regexp
doesn't quite do the trick because it assumes 4 characters, but it
almost works. Is it true that it's not supposed to work? Would the fact
that the ^'s cause negation when they're not the first character after
the [ be a bug?
Mike
--
Michael P. Soulier
1Z22, SKY
Tel: 613-765-4699 (ESN: 39-54699)
Email: msoulier@nortelnetworks.com
Carrier Packet Solutions
Nortel Networks Corporation
"...the word HACK is used as a verb to indicate a massive amount
of nerd-like effort."
-Harley Hahn, A Student's Guide to UNIX
------------------------------
Date: Fri, 02 Jul 1999 17:07:01 -0400
From: "Soulier, Michael [SKY:1Z22:EXCH]" <msoulier@americasm01.nt.com>
Subject: Re: regexp riddle
Message-Id: <377D29F5.E7B70C54@americasm01.nt.com>
Ashish Kadakia wrote:
>
> (/(?=[dxeb])([dxeb])(?!\1)([dxeb])?(?!\1|\2)([dxeb])?(?!
> \1|\2|\3)([dxeb])?/
>
> is the one which really works.. None of the solution posted
> earlier really works..People can simplify further..
Someone simplified. Check this out.
^(?:([dxbe])(?!.*\1)){1,4}$
I obviously need to read the "Mastering Regular Expressions" book, but
I think this person read it already. ;-)
Thanks for the help guys.
Mike
--
Michael P. Soulier
1Z22, SKY
Tel: 613-765-4699 (ESN: 39-54699)
Email: msoulier@nortelnetworks.com
Carrier Packet Solutions
Nortel Networks Corporation
"...the word HACK is used as a verb to indicate a massive amount
of nerd-like effort."
-Harley Hahn, A Student's Guide to UNIX
------------------------------
Date: Fri, 02 Jul 1999 17:05:22 -0400
From: "Soulier, Michael [SKY:1Z22:EXCH]" <msoulier@americasm01.nt.com>
Subject: Re: regexp riddle
Message-Id: <377D2992.749D3AEC@americasm01.nt.com>
Thanks for the response Greg, but I said I needed a regexp. A single,
solitary regexp.
I knew how to do it in more than one statement. ;-)
Mike
Greg Bacon wrote:
>
>
> #! /usr/bin/perl -w
>
> use strict;
>
> sub permute {
> my @a = @_;
> my @result;
> my $elt;
--
Michael P. Soulier
1Z22, SKY
Tel: 613-765-4699 (ESN: 39-54699)
Email: msoulier@nortelnetworks.com
Carrier Packet Solutions
Nortel Networks Corporation
"...the word HACK is used as a verb to indicate a massive amount
of nerd-like effort."
-Harley Hahn, A Student's Guide to UNIX
------------------------------
Date: 2 Jul 1999 21:19:21 GMT
From: gbacon@itsc.uah.edu (Greg Bacon)
Subject: Re: regexp riddle
Message-Id: <7ljacp$e0j$1@info2.uah.edu>
In article <377D2992.749D3AEC@americasm01.nt.com>,
"Soulier, Michael [SKY:1Z22:EXCH]" <msoulier@americasm01.nt.com> writes:
: Thanks for the response Greg, but I said I needed a regexp. A single,
: solitary regexp.
Maybe you should look at $re after
my $re = join '|', map { join '', @$_ } @p;
executes.
Greg
--
Sam: What do you say, Norm?
Norm: Any cheap, tawdry thing that'll get me a beer.
------------------------------
Date: Fri, 2 Jul 1999 11:52:39 -0700
From: marlon <marlon@soda.CSUA.Berkeley.EDU>
To: Bart Lateur <bart.lateur@skynet.be>
Subject: Re: regExpr question.
Message-Id: <Pine.BSF.3.96.990702114924.6021A-100000@soda.CSUA.Berkeley.EDU>
On Thu, 1 Jul 1999, Bart Lateur wrote:
> marlon wrote:
>
> >> > $foo =~ /<!-- something unique 1 -->(.*?)<!-- something unique 2 -->/s;
> >> > print $1;
> >
> > 1) Why do I need both the * and the ?, I've tried it with and with out
> > the ? and both results are the same.
>
> Try it with two of those substrings in the string in $foo. You'll soon
> see the difference.
>
> Bart.
Do you mean to use 2 instances of the <!-- someting unique --> strings I
mentioned? Or to double one of them? I really want to learn the
difference, could you clarify your suggestion a little for me, thanks!
marlon
------------------------------
Date: Fri, 02 Jul 1999 20:48:11 GMT
From: bart.lateur@skynet.be (Bart Lateur)
Subject: Re: regExpr question.
Message-Id: <377e20ef.1287167@news.skynet.be>
marlon wrote:
>Do you mean to use 2 instances of the <!-- someting unique --> strings I
>mentioned? Or to double one of them? I really want to learn the
>difference, could you clarify your suggestion a little for me, thanks!
I didn't include an example, because your delimiter is too long for my
taste. I'll try a shorter example.
$_ = "And a <X>one</X>, <X>two</X>, <X>three</X>, and go!";
/<X>(.*)<\/X>/ and print "\"Greedy\" match (.*): $1\n";
/<X>(.*?)<\/X>/ and print "\"Non-greedy\" match (.*?): $1\n";
Run it, and you *will* see the difference.
Bart.
------------------------------
Date: Fri, 02 Jul 1999 13:36:50 -1000
From: David Pautler <pautler@hawaii.edu>
Subject: Regexpr tool?
Message-Id: <377D4D12.E7F2DB14@hawaii.edu>
One feature that I think would be quite difficult to implement, but also
very useful, is a GUI that could be given a regexpr and a source string,
and it would highlight in red the section of the regexpr that led to the
most successful PARTIAL match, assuming there was no perfect match. The
matched part of the source string would also be highlighted.
I would expect that something like this would already exist in the Perl
community. If so, would someone post a url?
-dp-
------------------------------
Date: Fri, 02 Jul 1999 06:46:53 +0100
From: Marquis de Carvdawg <carvdawg@patriot.net>
Subject: Remote management of IIS metabase via Perl
Message-Id: <377C524D.D01D5EC@patriot.net>
Does anyone know of a module that will allow for the
remote management of the IIS metabase via Perl on NT?
Thanks
C
------------------------------
Date: Fri, 02 Jul 1999 19:34:17 GMT
From: greg.teets@frequencymarketing.com (Greg Teets)
Subject: Reorder bytes within 90-byte records in a file with 1,000,000 records?
Message-Id: <377d1368.25948932@199.6.45.7>
I have a big file with over 1,000,000 90-byte records. I would like
to move the bytes around within each record. For instance, bytes
11-15 might be reordered as 15 14 13 12 11.
I've seen pack and unpack suggested but I need some example code for
my example above.
I'd appreciate any help with the most efficient way to do this.
Thanks in advance.
Greg Teets
Cincinnati OH
------------------------------
Date: Fri, 02 Jul 1999 08:53:59 GMT
From: bart.lateur@skynet.be (Bart Lateur)
Subject: Re: returning a hash from a function
Message-Id: <377f7d52.7340506@news.skynet.be>
Derek Lavine wrote:
> my $hash = $self->{"variables"};
> return %$hash;
>}
>
>for some reason
>
>return %$self->{"variables"};
>
>does not work, probably to do with operator precedence.
Yup. Use an extra "block".
return %{$self->{variables}};
Oh, and you don't need the qotes around barewords bewteen the curlies.
On older (?) perls you may get a warning if the bareword is a built-in
function name, but it'll still work.
Bart.
------------------------------
Date: 2 Jul 1999 05:14:01 GMT
From: stanley@skyking.OCE.ORST.EDU (John Stanley)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <7lhhqp$h1q$1@news.NERO.NET>
In article <377C338C.CA0D0E37@prism.gatech.edu>,
andy barfoot <gt7202e@prism.gatech.edu> wrote:
>I don't see how to reduce traffic without using a filter of _some_ kind,
>and requiring sigdashes is the least inconvenient form of
>self-moderation i could think of.
Self-moderation is when you prevent yourself from posting. If you are
going to prevent other people from posting, it's called "moderation".
>I'm interested in any suggestions you
>might have (xor your reasons for believing a high-volume, low S/N is a
>better resource for learning perl),
I've already made the suggestion. If you don't like the question, don't
bother answering it. If you don't like the group, you've got the
moderated one to choose from, where a set of hard-working moderators
already serve the function of the robot you seem so enamored with.
I've not said that high-volume low s/n is good, only that what we have
now (which isn't that low s/n) is better than turning this discussion
group into robot input. If you want a means of sending questions to a
robot, feel free to start the group creation process. You'd have a
group before you have the robot tested.
>since your posts so far have been without content.
You've been happy to reply to them, and you've quoted the content. You
may not agree with it, but most people realize that is not the same as
no content.
------------------------------
Date: 2 Jul 1999 01:33:18 -0500
From: abigail@delanet.com (Abigail)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <slrn7non8s.31h.abigail@alexandra.delanet.com>
Greg Bacon (gbacon@itsc.uah.edu) wrote on MMCXXX September MCMXCIII in
<URL:news:7lgj3r$q67$2@info2.uah.edu>:
""
"" There are other groups that are unmoderated moderated. See alt.hackers
"" or... what's the ciwa.* group that's self moderated?
There's no self moderated ciwa.* group, AFAIK. There's a self appointed
(semi) moderation bot in ciwac, run by someone who I've never seen posting
in the group. But let's not get into that. Let me just say that there's
a reason I never visit ciwac anymore.
Changing a moderation status of the group without a formal Usenet vote
is absurd. That shouldn't be done. Besides, there's already a moderated
Perl group. If people want to have their moderation power trips, that's
the group to join.
Abigail
--
perl5.004 -wMMath::BigInt -e'$^V=Math::BigInt->new(qq]$^F$^W783$[$%9889$^F47]
.qq]$|88768$^W596577669$%$^W5$^F3364$[$^W$^F$|838747$[8889739$%$|$^F673$%$^W]
.qq]98$^F76777$=56]);$^U=substr($]=>$|=>5)*(q.25..($^W=@^V))=>do{print+chr$^V
%$^U;$^V/=$^U}while$^V!=$^W'
-----------== Posted via Newsfeeds.Com, Uncensored Usenet News ==----------
http://www.newsfeeds.com The Largest Usenet Servers in the World!
------== Over 73,000 Newsgroups - Including Dedicated Binaries Servers ==-----
------------------------------
Date: Fri, 02 Jul 1999 08:57:13 GMT
From: bart.lateur@skynet.be (Bart Lateur)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <37807eb1.7691477@news.skynet.be>
andy barfoot wrote:
>We could even say stuff like "On MS Windows systems, this FAQ's
>answer is usually at 'file:...'", and give them something to click on.
It depends on the exact location of their perl tree. You're never sure
where it is.
Bart.
------------------------------
Date: Fri, 02 Jul 1999 11:02:20 GMT
From: bart.lateur@skynet.be (Bart Lateur)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <377e9c09.459941@news.skynet.be>
John Stanley wrote:
>>If we want to reduce the traffic, we should use.. moderation! Suppose
>
>No, we should not use moderation.
Maybe we do need moderation, but not THAT kind of moderation.
Moderation of the tone, for example. ;-)
Bart.
------------------------------
Date: 2 Jul 1999 14:27:09 GMT
From: gbacon@itsc.uah.edu (Greg Bacon)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <7lii7t$9f6$2@info2.uah.edu>
In article <slrn7non8s.31h.abigail@alexandra.delanet.com>,
abigail@delanet.com (Abigail) writes:
: Changing a moderation status of the group without a formal Usenet vote
: is absurd.
I don't think anyone is suggesting that we do that.
: That shouldn't be done.
Agreed.
: Besides, there's already a moderated
: Perl group. If people want to have their moderation power trips, that's
: the group to join.
I don't understand your objections to clpmod. I remember you
complaining about an article being rejected, but I don't recall the
specifics. Does your whole opinion of the group center around one
rejected submission? Which of the moderators do you see as being on
a power trip?
Greg
--
We are Fudd of Borg: Pwepawre to be aswimiwated.
------------------------------
Date: Fri, 02 Jul 1999 12:10:00 -0400
From: andy barfoot <gt7202e@prism.gatech.edu>
Subject: Re: Robot email/poster (new proposal)
Message-Id: <377CE458.B2FB4A45@prism.gatech.edu>
John Stanley wrote:
>
> I've already made the suggestion. If you don't like the question, don't
> bother answering it. If you don't like the group, you've got the
> moderated one to choose from, where a set of hard-working moderators
> already serve the function of the robot you seem so enamored with.
>
> I've not said that high-volume low s/n is good, only that what we have
> now (which isn't that low s/n) is better than turning this discussion
> group into robot input. If you want a means of sending questions to a
> robot, feel free to start the group creation process. You'd have a
> group before you have the robot tested.
I read (and agreed with) your objections to miscy and proposed this bot
as a compromise: it would never post to the group, allow any posts of
any content to be posted (so long as it contained a sigdash), and
politely redirect others to the FAQ (which would tell them how to post).
This is different from the topic-moderation in clp.mod.
I'm not enamoured with the idea; actually i'm content to deal with
hundreds of daily posts by sorting-by-author and ignoring most people. I
just wanted to point out an alternative to two positions expressed in
the thread (do nothing, or write miscy). Since no-one else seems to like
it, i'll drop it.
> >since your posts so far have been without content.
>
> You've been happy to reply to them, and you've quoted the content. You
> may not agree with it, but most people realize that is not the same as
> no content.
True; i should just have said your posts lacked constructive criticism
or alternative solutions, but your harsh tone made me mad, and i was
just barely resisting telling you to go to hell.
--
andy barfoot
#!/bin/grep ^J
Just another grep hacker.
------------------------------
Date: 2 Jul 1999 18:39:20 GMT
From: stanley@skyking.OCE.ORST.EDU (John Stanley)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <7lj10o$bn6$1@news.NERO.NET>
In article <377CE458.B2FB4A45@prism.gatech.edu>,
andy barfoot <gt7202e@prism.gatech.edu> wrote:
>I read (and agreed with) your objections to miscy and proposed this bot
>as a compromise: it would never post to the group, allow any posts of
>any content to be posted (so long as it contained a sigdash), and
How would it dissallow posts that do not contain a sigdash? The only way
a robot could dissallow a posting is if the group were moderated. If you
want a new moderated group, please start the process to create it. This
group is not moderated, and I would bet that a LARGE number of people
would object to any suggestion that it become moderated.
>This is different from the topic-moderation in clp.mod.
It still requires moderation.
>the thread (do nothing, or write miscy). Since no-one else seems to like
>it, i'll drop it.
No, I think there is no objection to a robot per se, just that it should
not be here. Via mail, sure. Web, of course. In THIS discussion group,
no.
>True; i should just have said your posts lacked constructive criticism
>or alternative solutions,
Saying that the robot does not belong here but should be run via mail is
what I would consider constructive. As for "alternative solutions", it
is a common USENET fallacy that someone who objects to one proposal must
provide his own alternate before he can object. The latter argument is
used mainly by those who dont' want to hear objections to their Great
Plan to Improve USENET for All.
>but your harsh tone made me mad, and i was
>just barely resisting telling you to go to hell.
I see. How nice.
------------------------------
Date: 2 Jul 1999 18:50:45 -0500
From: abigail@delanet.com (Abigail)
Subject: Re: Robot email/poster (new proposal)
Message-Id: <slrn7nqk23.31h.abigail@alexandra.delanet.com>
Greg Bacon (gbacon@itsc.uah.edu) wrote on MMCXXXI September MCMXCIII in
<URL:news:7lii7t$9f6$2@info2.uah.edu>:
::
:: I don't understand your objections to clpmod. I remember you
:: complaining about an article being rejected, but I don't recall the
:: specifics. Does your whole opinion of the group center around one
:: rejected submission?
Oh, not "one" rejected submission, and not "one" moderator either.
But getting repeated rejections because answers to questions where
considered off-topic, yet the question itself apparently wasn't makes
one wonder. Or the fact that if you trim your quotation to the minimum
such that the context is still clear, but you have an answer that can be
written down in a line of two, your posting gets rejected because of an
improper ratio of quoted material. I guess if you just include War and
Peace in your answer it would go through.
Whatever. I just don't bother reading the moderation group anymore, and
taken special precautions to strip clpmod from the Newsgroups header in
case I would reply to a crossposted posting.
Anyway, this is about clpmod, and hence off topic in this group.
Followups set.
Abigail
--
perl -we 'print split /(?=(.*))/s => "Just another Perl Hacker\n";'
-----------== Posted via Newsfeeds.Com, Uncensored Usenet News ==----------
http://www.newsfeeds.com The Largest Usenet Servers in the World!
------== Over 73,000 Newsgroups - Including Dedicated Binaries Servers ==-----
------------------------------
Date: Thu, 1 Jul 1999 21:03:23 -0400
From: tadmc@metronet.com (Tad McClellan)
Subject: Re: Robot email/poster for this group
Message-Id: <r43hl7.294.ln@magna.metronet.com>
Alastair (alastair@calliope.demon.co.uk) wrote:
: Daniel Grisinger <dgris@moiraine.dimensional.com> wrote:
: >alastair@calliope.demon.co.uk (Alastair) writes:
: >> It's a grey area.
: >
: >No, it's not. Bots have no place in this newsgroup.
: True, on reflection. As has been said, this group is for human traffic. I have
: no problems with people building something offline though.
I think that would be great!
I'd like to help out with something like that.
Just not something that harvests from Usenet, (even though
it should/could/would be "benevolent" harvesting)
--
Tad McClellan SGML Consulting
tadmc@metronet.com Perl programming
Fort Worth, Texas
------------------------------
Date: Fri, 02 Jul 1999 20:48:09 GMT
From: bart.lateur@skynet.be (Bart Lateur)
Subject: Re: Robot email/poster for this group
Message-Id: <377d1ef7.783505@news.skynet.be>
John Stanley wrote:
>Not like the robot that sends the FAQ to each new poster, the proposed
>robot would read your articles and try to figure out what question you
>were asking. Then it would mail you the "correct" FAQ, and possibly
>post a message to the newsgroup saying it had mailed you the FAQ.
>
>So, if you come to the group after reading the FAQ and have a question,
>you may very well get a nice email telling you to read the FAQ, and a
>posting here that says that the answer is in the FAQ you were mailed. If
>you don't ask it in terms that the robot has programmed into it, you may
>get a FAQ that is irrelevant to the question. If you are simply
>expressing an opinion, you may get mailed a FAQ with the answer to your
>opinion.
If this robot idea is to stand *any* chance at all, it should be
"moderated". I.e. just like every post in the c.l.p.moderated group is
checked by a human just to see if the post is perl-relavant enough just
to be allowed on the newsgroup, *every* answer by Miscy would have to be
checked by a human, just to see if indeed it gives an appropriate
answer.
Bart.
------------------------------
Date: 1 Jul 99 21:33:47 GMT (Last modified)
From: Perl-Users-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 1 Jul 99)
Message-Id: <null>
Administrivia:
The Perl-Users Digest is a retransmission of the USENET newsgroup
comp.lang.perl.misc. For subscription or unsubscription requests, send
the single line:
subscribe perl-users
or:
unsubscribe perl-users
to almanac@ruby.oce.orst.edu.
To submit articles to comp.lang.perl.misc (and this Digest), send your
article to perl-users@ruby.oce.orst.edu.
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
To request back copies (available for a week or so), send your request
to almanac@ruby.oce.orst.edu with the command "send perl-users x.y",
where x is the volume number and y is the issue number.
The Meta-FAQ, an article containing information about the FAQ, is
available by requesting "send perl-users meta-faq". The real FAQ, as it
appeared last in the newsgroup, can be retrieved with the request "send
perl-users FAQ". Due to their sizes, neither the Meta-FAQ nor the FAQ
are included in the digest.
The "mini-FAQ", which is an updated version of the Meta-FAQ, is
available by requesting "send perl-users mini-faq". It appears twice
weekly in the group, but is not distributed in the digest.
For other requests pertaining to the digest, send mail to
perl-users-request@ruby.oce.orst.edu. Do not waste your time or mine
sending perl questions to the -request address, I don't have time to
answer them even if I did know the answer.
------------------------------
End of Perl-Users Digest V9 Issue 15
************************************
