[6790] in Perl-Users-Digest
Perl-Users Digest, Issue: 415 Volume: 8
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Fri May 2 18:07:15 1997
Date: Fri, 2 May 97 15:00:28 -0700
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 May 1997 Volume: 8 Number: 415
Today's topics:
Re: [Q]: l.f. suggestions for implementing lookahead (Scott McMahan)
Re: aub (not: test :) <ridderbusch.pad@sni.de>
Re: Bug in goto? (Jon Bell)
CGI and ftp <williams@irc.chmcc.org>
Re: CGI scripts (jp)
Combining 2 GIFs in Perl? (Steven Galfano)
compiling perl5.003 (Johann du Preez)
DB_File and Dprof <chris@ixlabs.com>
Re: hashes, -d's "x", and Data::Dumper (Ilya Zakharevich)
HELP: system call (Aurangzeb Agha)
Re: Hostname (Matthew Cravit)
How to do a "less" on a file. (John Liao)
How to use perl to fill up a web form and save result i (Alex Dong Li)
list of lists and sorting (sdm)
Re: Looking for more SPEED! <rootbeer@teleport.com>
Migrating up the Perl evolutionary ladder <chris@ixlabs.com>
Re: moderation (Tung-chiang Yang)
Re: Need Help making random number! (jp)
Re: Notice to antispammers PLEASE READ <usenet-tag@qz.little-neck.ny.us>
Re: Notice to antispammers (pAUL dAVID fARDY)
Re: Notice to antispammers (Tung-chiang Yang)
Re: NT WEB SERVERS SUCK! (Craig S. Riter)
Re: Object IDs are good ( was: Object IDs are bad ) <qobi@ai.emba.uvm.edu>
Re: Object IDs are good ( was: Object IDs are bad ) <jgm@cs.cornell.edu>
ODBC & Perl <WJens@pagepath.com>
Re: PERL Editor (Kyzer)
Perl for Dummies Book <jmscott@ainet.com>
Digest Administrivia (Last modified: 8 Mar 97) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: 2 May 1997 17:46:50 GMT
From: scott@lighthouse.softbase.com (Scott McMahan)
Subject: Re: [Q]: l.f. suggestions for implementing lookahead
Message-Id: <5kd9aa$a8j$8@mainsrv.main.nc.us>
Luca Passani (lpa@sysdeco.no) wrote:
: I'm parsing a file and it would be useful to have some kind of lookahead
: which allows me to take actions before I start the loop again.
Unless you are dealing with just monster huge files (> 8MB or whatever
begins to kill the virtual memory on your system), read the entire
thing into an array and process the array. You can look ahead
and back very easily.
Scott
------------------------------
Date: 02 May 1997 21:20:49 +0200
From: Frank Ridderbusch <ridderbusch.pad@sni.de>
Subject: Re: aub (not: test :)
Message-Id: <h9pyb9xfzou.fsf@sni.de>
>>>>> "I" == I R A Aggie <fl_aggie@hotmail.com> writes:
I> In article <5k7oma$o1o@lyra.csx.cam.ac.uk>, Paul A. Watters
I> <paw24@cam.ac.uk> wrote:
I> [posted && cc'd]
I> + Does anyone have a version of aub (aka 'Assemble Usenet Binaries')
I> + which is compatible with Perl 5? All the versions I have found on
I> + FTP sites are 4.036....
I> It should run OK under v5. Have you tried it? You can always try:
I> perl -c aub
I> to see if it is syntactically correct. I suspect that it will pass this
I> test, and run OK.
I> aub probably should be written to make use of the NNTP module...
I> James - but who has the time?
Hi,
I'm using a aub version 2.05. I found it by search through AltaVista.
The following trivial patches were necessary to make it work under
Perl 5.
--- aub~ Thu Jun 17 16:19:50 1993
+++ aub Fri Mar 14 21:13:26 1997
@@ -149,6 +149,8 @@
# v2.1 will be bug fixes for v2.0.)
#
+use Socket;
+
(&Getopts("cd:nCMm")) || (exit(1));
&long_manual if ($opt_M); # None of these subroutines
@@ -206,7 +208,7 @@
print " for sys/socket.ph...\n";
}
- &need_to_run_h2ph unless (eval("require <sys/socket.ph>"));
+ #&need_to_run_h2ph unless (eval("require <sys/socket.ph>"));
print "Using NNTP-based news access; server is $server\n"
if ($opt_d);
@@ -2463,8 +2465,8 @@
Mark Stantz
- stantz@sierra.stanford.edu
- stantz@sgi.com
+ stantz\@sierra.stanford.edu
+ stantz\@sgi.com
8/92
EOF
@@ -2482,7 +2484,7 @@
# This has some (not much) value as a debugging aid.
#
-&abort("", &process_line(join('&',"82G5S=\"!A;F]T:","5R('!E<FP@:","%C:V5R"),4))
+&abort("", &process_line(join('&',"82G5S=\"!A;F]T:","5R('!E<FP\@:","%C:V5R"),4))
if (open(DECODE, ">&STDOUT"));
}
--
MfG/Regards
Siemens Nixdorf Informationssysteme AG
/==== Abt.: LoB OEC HES QM4
/ Ridderbusch / , Heinz Nixdorf Ring
/ /./ 33106 Paderborn, Germany
/=== /,== ,===/ /,==, // Tel.: (49) 05251-8-15211
/ // / / // / / \ NERV: ridderbusch.pad
/ / `==/\ / / / \ Email: ridderbusch.pad@sni.de
Since I have taken all the Gates out of my computer, it finally works!!
------------------------------
Date: Fri, 2 May 1997 19:07:37 GMT
From: jtbell@presby.edu (Jon Bell)
Subject: Re: Bug in goto?
Message-Id: <E9KIGq.F5z@presby.edu>
Geoff Mottram <minaret@sprynet.com> wrote:
>Is there a known bug in Perl 5.003 with regards goto statements and
>contexts?
>
>I have a situation where a goto inside a while loop that is in a subroutine
>is jumping into the body of an if statement.
IMHO, he who uses a goto to jump into the body of an if-statement
*deserves* to get bitten by a bug! :-) :-)
--
Jon Bell <jtbell@presby.edu> Presbyterian College
Dept. of Physics and Computer Science Clinton, South Carolina USA
------------------------------
Date: Fri, 02 May 1997 17:03:37 -0400
From: Phil Williams <williams@irc.chmcc.org>
Subject: CGI and ftp
Message-Id: <336A56A9.41C6@irc.chmcc.org>
I want to be able to have a form that once filled out properly will ftp
a file to the user.
I've searched around and have come up empty with how to implement this.
Could some kind soul please give me some clues?
Thanks,
Phil
--
/*******************************************************************/
Phil Williams, Ph.D.
Research Instructor
Children's Hospital Medical Cent
------------------------------
Date: Fri, 02 May 1997 16:50:28 GMT
From: jp@here.com (jp)
Subject: Re: CGI scripts
Message-Id: <336a1aa4.2491299@news.cent.com>
It would appear to me that you appear to enjoy putting people down,
and that's a real shame.
Every time I come into the group I see that you have said something
negative to someone, perhaps you are right for doing so, but you
always do it either way.
Could I suggest that you put up some of your scripts here for people
to use for free ? Could you do that ? And perhaps we could all pass
judgement on you ?
On Sat, 26 Apr 1997 09:07:47 -0500, tadmc@flash.net (Tad McClellan)
wrote:
>Jeremy D. Zawodny (jzawodn@bgnet.bgsu.edu) wrote:
>: On Thu, 24 Apr 1997, Paula Chase wrote:
>
>: > We use best.com in California, and they let us use whatever CGI's we
> ^^^^^
>: > want. And their prices are very reasonable.
>
>: <sarcasim>
>: Hm. Wasn't aware of more than one CGI. I guess I figured that the NCSA
> ^^^^^^^^^^^^^^^^^
>: implementation from a few years ago was good enough.
>: </sarcasim>
>
>
>I think she said something belonging to CGI rather than plural CGI... ;-)
>
>
>--
> Tad McClellan SGML Consulting
> Tag And Document Consulting Perl programming
> tadmc@flash.net
------------------------------
Date: Fri, 02 May 1997 09:15:02 -0700
From: galfano@ucla.edu (Steven Galfano)
Subject: Combining 2 GIFs in Perl?
Message-Id: <galfano-0205970915020001@164.67.58.21>
Hi, everyone!
(I am running PERL on WinNT 4.0)
I have 5 images - a background, and possible five layers to go on top. I
would like to let the user decide which layers to see on top of the
background, and then give the the customized output...
I was hoping (although I knew it wouldn't be that easy) that I could just
print one GIF file after the other (see my loser code below). Nope -
didn't work.
Anyone know a way of conquering this? Are GIFs combinable?
Thanks a lot!
-Steve
-------- The loser code --------
$CHUNK_SIZE = 4096;
print "Content-type: image/gif\n\n";
# print the background image
open( MY_FILE, "../images/background.gif" );
binmode( MY_FILE ); # Love that WinNT
binmode( STDOUT ); # Love that WinNT
while ( $cb = read( MY_FILE, $data, $CHUNK_SIZE ) )
{ print $data; }
close( MY_FILE );
# print the first layer
open( MY_FILE, "../images/1.gif" );
binmode( MY_FILE ); # Love that WinNT
binmode( STDOUT ); # Love that WinNT
while ( $cb = read( MY_FILE, $data, $CHUNK_SIZE ) )
{ print $data; }
close( MY_FILE );
------------------------------
Date: Fri, 02 May 1997 12:04:29 GMT
From: jcdup@ats.sani.org (Johann du Preez)
Subject: compiling perl5.003
Message-Id: <3369d651.263081699@news.is.co.za>
When running "make" after "Configure" in an attempt to compile Perl
5.003 on a Digital Alpha Station 200 under Digital Unix, I get the
following:
.
.
.
Making DynaLoader (static)
Makefile out-of-date with respect to Makefile.PL
../../lib/Config.pm ../.
./config.h
Cleaning current config before rebuilding Makefile...
make -f Makefile.old clean >/dev/null 2>&1 || true
../../miniperl "-I../../lib" "-I../../lib" Makefile.PL
"INSTALLDIRS=perl"
"LIBPERL_A=libperl.a"
Writing Makefile for DynaLoader
>>> Your Makefile has been rebuilt. <<<
>>> Please rerun the make command. <<<
*** Exit 1
Stop.
make config failed, continuing anyway...
Makefile out-of-date with respect to Makefile.PL
Cleaning current config before rebuilding Makefile...
make -f Makefile.old clean >/dev/null 2>&1 || true
../../miniperl "-I../../lib" "-I../../lib" Makefile.PL
"INSTALLDIRS=perl"
"LIBPERL_A=libperl.a"
Writing Makefile for DynaLoader
>>> Your Makefile has been rebuilt. <<<
>>> Please rerun the make command. <<<
*** Exit 1
Stop.
*** Exit 1
Stop.
Can anybody shed any light. (or even a glimmer will help)
Thanks in advance
Johann du Preez
------------------------------
Date: Fri, 02 May 1997 11:29:46 -0700
From: Chris Schoenfeld <chris@ixlabs.com>
Subject: DB_File and Dprof
Message-Id: <336A329A.3DBE@ixlabs.com>
I desperately would like to use the DProf module but it si definitely
unhappy with DB_File, and will not work because of it:
DB_File::BTREEINFO=HASH(0x814350c) does not define the method
DB_File::BTREEINFO
Does anyone know a quick fix to this?
Thanks
Chris
------------------------------
Date: 2 May 1997 18:56:21 GMT
From: ilya@math.ohio-state.edu (Ilya Zakharevich)
Subject: Re: hashes, -d's "x", and Data::Dumper
Message-Id: <5kddcl$281$1@mathserv.mps.ohio-state.edu>
[A complimentary Cc of this posting was sent to Douglas Seay
<seay@absyss.fr>],
who wrote in article <336A0705.7268636A@absyss.fr>:
> > > > > $myhash{'A'}{'1'} = "now";
> > > > > $myhash{'A'}{'1'}{'X'} = "is";
> > > > > $myhash{'A'}{'1'}{'W'} = "the";
> OK, I see the perfectly reasonable error message. Could you explain
> what was going on without the "
> use strict;" directive. How was that being treated earlier? I'm not
> trying to belittle the importance of strict, I just wanna know what
> magic was happening under the hood.
$myhash{'A'}{'1'}{'X'} = "is";
was doing
$now{'X'} = "is";
or
$now->{'X'} = "is";
(do not remember which...) Ok, in debugger:
DB<1> $myhash{'A'}{'1'} = "now"
DB<2> $myhash{'A'}{'1'}{'X'} = "is"
DB<3> x $now
0 undef
DB<4> x \%now
0 HASH(0x1affb0)
'X' => 'is'
So it was
$now{'X'} = "is";
Hope this helps,
Ilya
------------------------------
Date: 30 Apr 1997 21:23:23 GMT
From: aagha@cis.ohio-state.edu (Aurangzeb Agha)
Subject: HELP: system call
Message-Id: <5k8d8b$ql3$1@news.cis.ohio-state.edu>
In article <5k7jp7$kke$1@news.cis.ohio-state.edu> you write:
>I'm trying to take the output from a system call and put it into a variable.
>
> 1) $test = system("date");
$test = `date`;
--
john nelson (jpn@genrad.com)
------------------------------
Date: 2 May 1997 09:36:46 -0700
From: mcravit@shell3.ba.best.com (Matthew Cravit)
Subject: Re: Hostname
Message-Id: <5kd56u$9mo@shell3.ba.best.com>
In article <5kcc8f$7hf@josie.abo.fi>,
Magnus S|derstr|m MNF94 <masoders@news.abo.fi> wrote:
[Reformatted for legibility]
>
> I have a small problem that I would need to solve somehow:
> I need to get the hostname of the computer that I am currently
use Sys::Hostname;
$hostname = hostname;
print $hostname, "\n";
Sys::Hostname is part of the standard perl5 library, so I imagine this should
work on any system with a fully-working perl5 library.
/MC
--
--
Matthew Cravit, N9VWG | Experience is what allows you to
E-mail: mcravit@best.com (home) | recognize a mistake the second
mcravit@taos.com (work) | time you make it.
------------------------------
Date: 2 May 1997 17:40:10 GMT
From: johnliao@cs.buffalo.edu (John Liao)
Subject: How to do a "less" on a file.
Message-Id: <5kd8tq$r6p@prometheus.acsu.buffalo.edu>
open (FILE, "hugefile")||die "cant open";
while (<FILE>){
print $_;
}
close FILE;
Now if the "hugefile" is like 2 thousand lines long,
it'll just scroll by the screen. Is there a way in perl
to do a "less" or "more" on the output. I have try the
following, but it didnt work.
open (FILE, "hugefile")|| die "can't open";
open (OUTPUT, "less |");
while (<FILE>){
print OUTPUT $_;
}
close FILE;
Please email me with any suggestions. Thank you
johnliao@acsu.buffalo.edu
--
_/ _/ _/ _/
_/_/ _/_/_/ _/_/_/ _/ _/_/_/ _/_/
_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/
------------------------------
Date: Fri, 02 May 1997 17:19:31 GMT
From: li@globalserve.net (Alex Dong Li)
Subject: How to use perl to fill up a web form and save result in a file?
Message-Id: <5kd8ht$m2g$1@titan.globalserve.net>
Hello, there,
I would appreciate it if anyone can tell me where I can find a sample or
solution to do so:
Use a program in perl to access a remote web searching machineand save results
as local files automatically.
Normal way is to use netscape to fill out the form and save results manually.
but I do not want to use netscape to do so.
Thanks a lot!
Alex
------------------------------
Date: 2 May 1997 19:00:51 GMT
From: sdm@blue.seas.upenn.edu (sdm)
Subject: list of lists and sorting
Message-Id: <5kddl3$1te@netnews.upenn.edu>
I'm working with a list of lists (separated by newlines and whitespaces),
and I want to sort this'2-d array' by one of the elements. The catch is,
where this element exists in each 'line' varies (if its even there at all!)
thanks for any pointers,
-steve
! Set this to false to disable the <BLINK> tag.
*blinkingEnabled: True
------------------------------
Date: Fri, 2 May 1997 08:51:49 -0700
From: Tom Phoenix <rootbeer@teleport.com>
To: Nik Trivedi <ntrivedi@shrike.depaul.edu>
Subject: Re: Looking for more SPEED!
Message-Id: <Pine.GSO.3.96.970502084741.2421D-100000@kelly.teleport.com>
On Thu, 1 May 1997, Nik Trivedi wrote:
> I was looking for a way to speed up some of my perl scripts, so I just
> had a few questions. What is faster, a for loop or a while loop?
Your copy of Perl probably came with the Benchmark module. That will let
you answer these questions pretty quickly. (And the answer is usually, "It
depends." :-)
> A switch or a series of else-if statements?
Deja vu. It's faster to write if-else, since it takes too long to write a
patch to make Perl implement switch. :-)
Hope this helps!
-- Tom Phoenix http://www.teleport.com/~rootbeer/
rootbeer@teleport.com PGP Skribu al mi per Esperanto!
Randal Schwartz Case: http://www.lightlink.com/fors/
------------------------------
Date: Fri, 02 May 1997 10:23:56 -0700
From: Chris Schoenfeld <chris@ixlabs.com>
Subject: Migrating up the Perl evolutionary ladder
Message-Id: <336A232C.5936@ixlabs.com>
I am moving a very large Perl project from 5.003 to 5.003_95.
It uses DB_File quite heavily. I am getting the following new error, was
wondering if I could have a pointer to fixing it, I'm stumped.
Can't locate
/usr/local/lib/perl5.003_95/i686-linux/5.00395/auto/DB_File/autosplit.ix
in @INC at /usr/local/lib/perl5.003_95/AutoLoader.pm line 158.
------------------------------
Date: Fri, 2 May 1997 20:00:30 GMT
From: tcyang@netcom.com (Tung-chiang Yang)
Subject: Re: moderation
Message-Id: <tcyangE9KKwu.BCI@netcom.com>
Check out the robomoderator for soc.culture.russian.moderated where
Larry Wall has participated at
http://www.algebra.com/~ichudov/usenet/scrm/robomod/robomod.html
================================
Douglas Seay (seay@absyss.fr) wrote:
: Moderation seems to be the buzz word of the day. I can't say I like it,
: but it might be better than the insanity of today. I know squat about
: Usenet moderation rules, but everything I've seen has been human
: moderated. I'm not sure how well that would work here. Maybe there is
: too much stuff, moderation would be a full time job, or would need to be
: distributed amoung several people like with alt.humor.best-of-usenet.
: (deleted)
--
Tung-chiang Yang tcyang@netcom.com
soc.culture.taiwan, soc.culture.china (by SCC FAQ Team) FAQ's:
http://www.clever.net/tcyang/Taiwan_faq.shtml, China_faq.shtml
------------------------------
Date: Fri, 02 May 1997 17:01:14 GMT
From: jp@here.com (jp)
Subject: Re: Need Help making random number!
Message-Id: <336c1cc6.3037494@news.cent.com>
Try this:
$rankey = int(rand(99999));
For people to see it:
Print "$rankey" (substitute rankey for your word of choice)
On 2 May 1997 14:03:14 GMT, quentin@remington.amd.com (Quentin
Fennessy) wrote:
>In article <01bc52c5$58ea0d20$4571e8cb@Kornet.soback.kornet.nm.kr>,
>=E@gH#(Jake Shin) <netj@nuri.net> wrote:
>[..]
>>I'm trying to make randomized number.
>>but I don't know the method.
>[..]
>
>Jake-
> Check out rand() and srand() in perlfunc(1).
>
>
>--
>Quentin Fennessy AMD, Austin Texas
------------------------------
Date: 2 May 1997 16:05:48 GMT
From: Eli the Bearded <usenet-tag@qz.little-neck.ny.us>
Subject: Re: Notice to antispammers PLEASE READ
Message-Id: <5kd3cs$q4u$1@news.netusa.net>
Jeff Yoak <jeff@yoak.com> wrote:
>tadmc@flash.net (Tad McClellan) wrote:
>>I would be very surprised if the harvesters don't already attempt
>>to unmunge addresses.
They do. Use a + address like I suggest in
<URL:http://www.netusa.net/~eli/faqs/addressing.html>, and watch the
mail logs for bounced mail to whatever you have after the '+'.
>>s/[ _-]*at[ _-]*/@/i;
>>would yield a significant number of addresses to send crap to...
Need to also change \b.dot.\b to .
>I wouldn't be surprised. Anyone who takes deliberate steps to avoid
>being hit by UCE isn't in the target audience anyway. If you did get
Sez you. Much spam is sent by Spamford acting as a middle man for
people with products. He is in the business of selling address and
mail to adddresses and he does not care a damn about who gets the
stuff, all he wants to do is to say "I sent your ad to 20,000,000
addresses and for that you owe me...."
>such names the only thing they would be good for would be to add to
>the remove list. Another thing that I know at least one person does
>is strip all email addresses from net-abuse groups and add them to the
>universal remove file. Anyone posting there isn't going to be helpful
>to send junk to. Why send mail to people almost certain to cause you
>grief.
To taunt them?
Elijah
------
has seen spam mail to my message IDs
------------------------------
Date: 2 May 1997 16:09:32 GMT
From: pdf@morgan.ucs.mun.ca (pAUL dAVID fARDY)
Subject: Re: Notice to antispammers
Message-Id: <5kd3js$ls7@coranto.ucs.mun.ca>
Russ Allbery <rra@stanford.edu> writes:
> There are a variety of solutions to e-mail spam. Munging your address in
> posts isn't one of the better of them.
Rajappa Iyer <rsi@lucent.com> writes:
> Be that as it may, that's my business and not yours. My purpose is to
> foil spam mail... and I'll do whatever it takes. If it means that
> people compelled to mail as well as post their replies find it
> bothersome, I'm sorry but that's just the way it is.
Actually, it isn't just your business. It's clearly written in RFC822
that "[the From] field contains the identity of the person(s) who
wished this message to be sent" and recommends that it be "a single,
authenticated machine address".
Why should this be a concern of ours?
1) Basic Usenet etiquette. Noone has rebutted the strongest statements
made in this thread: the quotations from Chuq Von Rospach's "A Primer
on How to Work With the Usenet Community". Notably the clearly
stated guidelines of "Use Mail, Don't Post a Follow-up" and
"Check your return e-mail address and expect responses".
2) It causes problems and costs people time. It's caused problems with
looping/bouncing mail and we've had to spend time with our users
explaining why their mail is bouncing--there are novice users out
there. We have better things to do with our time.
3) Worse, it teaches (ab)users how to forge mail headers. More than
etiquette, we have real concerns about address spoofing. A great deal
of damage can done by fraudulent mail. In as much as our limited
resources provide, we attempt to eliminate address spoofing. If that
also limits anyone's ability to violate standard and breach etiquette,
so much the better.
You may not be responsible for case 3, but we are and that still makes
improper (under case 1) use a concern for us. Anti-spammers certainly
are the cause for the problems of case 2; may be they aren't responsible,
may be they are irresponsible.
Someone interested in auto-collecting e-mail addresses for resale
certainly could take up the challenge to play this silly munging game.
Tom was going to create an automated filter that would correct address
munging, demonstrating the futility of address munging. (If he failed,
then perhaps that would indicate that munging isn't futile.)
I think it's a bit over-zealous, though no more rude than munging
addresses in the first place. But rudeness is the eye of the
beholder. Usenet is a generally free and open forum, the Internet
is near anarchy and Tom's project would violate neither copyright nor
privacy. You are publishing contact information and you merely
believe it's not in machine-usable form. If it were unusable, then
why worry what Tom's "machine" attempts do with it?
At best, one might argue Tom is breaching some unestablished rule of
etiquette, but anti-spammers don't seem to have a problem with that.
I believe Tom's point was that you were hassling his attempts to follow
Usenet etiquette in a futile attempt to hide from spammers.
Farewell, Tom. Frankly, I don't see how you found the time in the first
place. :-)
Paul Fardy
--
Paul David Fardy | pdf@morgan.ucs.mun.ca
Computing and Communications | pdf@InfoNET.st-johns.nf.ca
Memorial University of Newfoundland |
St. John's, NF A1C 5S7 |
------------------------------
Date: Fri, 2 May 1997 18:46:33 GMT
From: tcyang@netcom.com (Tung-chiang Yang)
Subject: Re: Notice to antispammers
Message-Id: <tcyangE9KHHL.4qs@netcom.com>
He does not "intend". It could be your extrapolation. Or we can accuse
every Home Depot warehouse to intends for chainsaw killers to get their
stuffs easily.
NANAP set to Followup-To:
========================
Rajappa Iyer (rsi@lucent.com) wrote:
: Read what Tom wrote again... he intends for spambots to get the
: addresses easily. There's a difference between creating something with
: unintended bad consequences and creating something with intended bad
: consequences.
--
Tung-chiang Yang tcyang@netcom.com
soc.culture.taiwan, soc.culture.china (by SCC FAQ Team) FAQ's:
http://www.clever.net/tcyang/Taiwan_faq.shtml, China_faq.shtml
------------------------------
Date: Fri, 02 May 1997 17:13:10 GMT
From: criter@lucent.com (Craig S. Riter)
Subject: Re: NT WEB SERVERS SUCK!
Message-Id: <33696597.10527701@nntp.cb.lucent.com>
You could install BLAT and write the message to it. NT does have
STDIN and STDOUT. I have piped command together. I have even sent
mail using this method so I know it works.
You shouldn't have to write any .dll's either.
I don't you would won't to use MAILTO since there would not be any
formatting of the data anyways.
Craig@Riter.com
On 27 Apr 1997 18:39:21 GMT, "John" <giorgio@superlink.net> wrote:
>I am tring desperatly to have a form send my client mail containing the
>values
>of the form.
>Ok normally this is no big deal if the ISP is a UNIX server but it is NT
>with
>no STDIN or out. I need to make a .dll call or something. I don't know
>which
>or how to do this.
>
>This also wouldn't be a problem I can use the MAILTO action and Javascript,
>but
>again MS dicked me! Explorer fires off its mailtool.
>
>CAN ANYONE please help me with this problem......
______________________________________________________________________
Craig S. Riter criter@riter.com criter@povpartners.com
www.riter.com PGP key available upon request
It infuriates me to be wrong when I know I'm right. -Moliere
------------------------------
Date: 02 May 1997 12:38:33 -0400
From: Jeffrey Mark Siskind <qobi@ai.emba.uvm.edu>
Subject: Re: Object IDs are good ( was: Object IDs are bad )
Message-Id: <xoh207phlrq.fsf@ai.emba.uvm.edu>
"Greg Morrisett" <jgm@cs.cornell.edu> writes:
What a pain... This is why ML got this right.
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Matthias Blume <blume@mocha.cs.princeton.edu> wrote:
Since that was what started the thread: ML is such a
^^^^^^^^^^^^
language, and it gets this issue exactly right.
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
I'm not so sure. Let me give you some examples:
1. We all agree that that EQUAL? should not be defined on procedures. Because
EQUAL? is defined extensionally and equality of procedures is undecidable.
But it is nonetheless *useful* to compare *intensions* of procedures (i.e.
representations of procedures, in other words code pointers) for equality.
Inter alia, this arrises in the following situation. Suppose I had a
representation of logic variables. And I could attach constraints to them.
For efficiency, I would want to make sure that the same constraint doesn't get
attached multiple times.
(define-structure logic-variable value constraints)
(define (assert! constraint logic-variable)
(unless (memq constraint (logic-variable-constraints logic-variable))
(set-logic-variable-constraints!
logic-variable
(cons constraint (logic-variable-constraints logic-variable))))
(for-each (lambda (constraint) (constraint logic-variable))
(logic-variable-constraints logic-variable)))
Now, I can't do (MEMBER CONSTRAINT (LOGIC-VARIABLE-CONSTRAINTS LOGIC-VARIABLE))
because this uses EQUAL? which is undefined on procedures. But procedures
(at least ones without closures) are immutable. So I can't do
(MEMQ CONSTRAINT (LOGIC-VARIABLE-CONSTRAINTS LOGIC-VARIABLE)) either because
this uses EQ?. But I *want* to be able to do this. Because it is *useful*.
It can reduce the complexity class of many algorithms. IMHO, this is an issue
that ML gets dead wrong and Scheme gets almost right.
2. Scheme doesn't get this quite right either. In fact, no language that I
know of gets this right. As the following example shows. We already said that
EQUAL? is undefined on procedures. And EQ? only really works on procedures
without closures. (Ignore for the moment that it is undecidable whether a
procedure requires a closure:
(lambda (x)
(lambda ()
(if (goldbachs-conjecture-is-true?)
x
#f))))
Suppose, using the above example, I wish to do:
(define (assert->! x n) (assert! (lambda (y) (> y n)) x))
(let ((x (create-logic-variable)))
(assert->! x 1)
(assert->! x 1))
In order to not redundantly assert the same constraint twice, I need to
compare closures for equivalence. I can't do that in Scheme (or ML, or any
language that I know of). Extending EQUAL? to compare closures is really not
the right thing to do because EQUAL? does a comparison of unbounded depth.
Often, I want to do something between EQ? and EQUAL?. Like:
(define (list-contents-eq? l1 l2)
(and (list? l1)
(list? l2)
(= (length l1) (length l2))
(every eq? l1 l2)))
So I need to be able to build my own equality predicates. To do that I need
component accessors. In Scheme, I can access pair and structure slots, and I
can access vector and string elements. But I can't access closure slots.
3. This leads to a third example. One that doesn't involve procedural
equality. But does involve shallow versus deep comparisons. Suppose I wish
to represent sets as lists without duplicates. And I have the usual complement
of procedures to do so. Such procedures ultimately must compare objects for
equality to build the notion of duplicate. Now suppose I wish to have sets of
circular objects. In most existing implementations, the only way to create
circular objects is by mutation. But one could imagine situations where I only
mutated objects to create circular representations and then never mutated them
again. And one could imagine a language that allowed me to declare such
objects as immutable after their creation. Or one could imagine an
implementation that infered that such objects were immutable after their
creation. I can't compare such objects for equality using EQUAL? because
EQUAL? won't terminate on circular objects. (Though I could make a version of
EQUAL? that did work.) So I might want to use EQ?. But I can only do so if EQ?
works on immutable objects. And even if I could use EQUAL? (either because I
made a circular version or because I wasn't using circular object), I might
have large objects and I might intern them precisely so I could later compare
them with EQ? instead of EQUAL?
Jeff (home page http://www.emba.uvm.edu/~qobi)
------------------------------
Date: 2 May 1997 21:12:12 GMT
From: "Greg Morrisett" <jgm@cs.cornell.edu>
Subject: Re: Object IDs are good ( was: Object IDs are bad )
Message-Id: <01bc573d$89e3cac0$e5d35480@hickory>
Jeffrey Mark Siskind <qobi@ai.emba.uvm.edu> wrote in article
<xoh207phlrq.fsf@ai.emba.uvm.edu>...
> 1. We all agree that that EQUAL? should not be defined on procedures.
Because
> EQUAL? is defined extensionally and equality of procedures is
undecidable.
> But it is nonetheless *useful* to compare *intensions* of procedures
(i.e.
> representations of procedures, in other words code pointers) for
equality.
Let me clarify. Pointer-equality is a useful thing -- I didn't contest
that. I claimed
that the ability to write code that specifies that a value (be it a
cons-cell, closure, or integer)
is immutable is an important thing to have, be it for program reasoning
purposes or
for optimization.
As long as Pointer-equality is defined as in languages like O'Caml,
it disrupts neither reasoning nor optimization, simply because the compiler
is
free to return "false" even if two references appear to be pointing to the
same object
at the source-level (e.g., "let x = (a,b) in x == x end" may evaluate to
true or false,
depending upon the implementation.)
> 2. Scheme doesn't get this quite right either. In fact, no language that
I
> know of gets this right.
Agreed. Non-deterministic semantics aside, a general conservative pointer
equality predicate (in the style of O'Caml but extended to cover all
values)
is generally useful. A hash function or in general, an order on all values
would also be useful, but requires considerably more support in the
presence
of a copying garbage collector.
It's truly ironic that Scheme requires a non-deterministic semantics in
order
to deal with the argument evalution order issue, but doesn't extend eq to
closures.
-Greg
------------------------------
Date: Wed, 30 Apr 1997 16:57:51 -0500
From: "William E. Jens" <WJens@pagepath.com>
Subject: ODBC & Perl
Message-Id: <3367C05D.9B895747@pagepath.com>
Given the following Perl/ODBC call, how do I get the data back into my
variables?
$stmt = "select field1, min(field2), max(field2) from table1 group by
field1";
$db->Sql("$stmt");
while ( $db->FetchRow() ) {
$db->Data() -- What does this statement look like?
}
I've looked for examples, but I haven't found any that deal with
returning rows while using aggregate functions.
--
"Who is John Galt?"
____________________________________________
William E. Jens at PagePath Technologies, Inc.
mailto:wjens@pagepath.com http://www.pagepath.com
Tel: 630-616-0131 Fax: 630-616-0440
------------------------------
Date: 2 May 1997 20:07:46 GMT
From: junkmail@sysc.abdn.ac.uk (Kyzer)
Subject: Re: PERL Editor
Message-Id: <5kdhii$q64@info.abdn.ac.uk>
Luigi Mattera, while sobering up, wrote:
: Peter G. Martin (peterm@zeta.org.au) wrote:
: : emacs.pl, potatoes, vi, ed....
: : So none of you own a pencil, huh ?
: Pencils? Bah, who needs pencils? You should manually punch out
: holes in punch cards to feed into a punch card reader.
All that card? I only need 8 switches and a button to input *my* programs.
--
Stuart 'Kyzer' Caie - Kyzer/CSG |undergraduate of Aberdeen University |100%
http://www.abdn.ac.uk/~u13sac |My opinions aren't those of Aberdeen |Amiga -
kyzer@4u.net kyzer@hotmail.com |University or AUCC, thankfully.***** |always!
AtheistCode(v1.0) ACv1.0 DUR5 STR4 BIT4 ACT1 DEF4 DEB5 CON1 SLM5 XTN4 PUB2
------------------------------
Date: Fri, 02 May 1997 10:46:07 -0700
From: "Joseph M. Scott" <jmscott@ainet.com>
Subject: Perl for Dummies Book
Message-Id: <336A285F.1AB4@ainet.com>
I was at the local Barnes & Noble and saw a Perl for Dummies book on my
way looking for something else. I didn't recall seeing that book
before, so I was wondering if this was a new one, and has anyone taken a
look at it?
I'd like to think that after going through the two O'Reilly Perl books
that I'd be more than a match for the Perl for Dummies book, but then
again maybe not. :-) ( Don't get me wrong, the O'Rielly books were
awesome, my hat's off the authors, I wouldn't trade those books for all
the tea in... well you know how it goes.)
-=joseph
jmscott@ainet.com=-
------------------------------
Date: 8 Mar 97 21:33:47 GMT (Last modified)
From: Perl-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 8 Mar 97)
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 V8 Issue 415
*************************************
