[13402] in Perl-Users-Digest
Perl-Users Digest, Issue: 812 Volume: 9
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Wed Sep 15 22:07:25 1999
Date: Wed, 15 Sep 1999 19:05:09 -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 Wed, 15 Sep 1999 Volume: 9 Number: 812
Today's topics:
Re: better soundex/metaphone? (Larry Rosler)
Re: bin2hex and back again (Philip 'Yes, that's my address' Newton)
Re: division in list context (Philip 'Yes, that's my address' Newton)
End Of File <spam-me-sydneyfong@yahoo.com>
Help ! bootstrap warning !!! <alrope@zaz.com.br>
Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People (Larry Rosler)
Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People (Kragen Sitaker)
Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People (Kragen Sitaker)
Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People <elaine@chaos.wustl.edu>
Re: is this object a child of this class? (Kragen Sitaker)
Re: need to write www search engine (Benjamin Franz)
Re: need to write www search engine <cassell@mail.cor.epa.gov>
Re: need to write www search engine <channel@metalab.unc.edu>
Re: need to write www search engine (Abigail)
Re: need to write www search engine (Abigail)
Re: need to write www search engine (Martien Verbruggen)
Newbie Help: Syntax of Perl Command <Ghassemlou@home.com>
Re: Newbie Help: Syntax of Perl Command (Martien Verbruggen)
Re: Old Script Doesn't Like My New Perl? Help! (Dan Poynor)
Re: Parsing Tab Delimited File <tchrist@mox.perl.com>
PERL (cgi) and Databases -> How To? <lynchmanNOpaSPAM@cyberenet.net>
Re: Please help a newbie! (Kragen Sitaker)
Re: Please help a newbie! (Kragen Sitaker)
Re: Please help a newbie! (Larry Rosler)
Digest Administrivia (Last modified: 1 Jul 99) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Wed, 15 Sep 1999 17:20:50 -0700
From: lr@hpl.hp.com (Larry Rosler)
Subject: Re: better soundex/metaphone?
Message-Id: <MPG.1249d7bf72524159989f7c@nntp.hpl.hp.com>
In article <37E033F4.66B01DF0@mail.cor.epa.gov> on Wed, 15 Sep 1999
17:04:04 -0700, David Cassell <cassell@mail.cor.epa.gov> says...
...
> It will be more complex than this. Consider whether you want
> to then catch singular vs plural on your nouns. Then make sure
> you can handle:
Dangerous territory, man!
> cherub vs cherubim
> ox vs oxen
> genus vs genera
> octopus vs octopi
octopodes (Greek, not Latin)
> index vs indices
> phenomenon vs phenomena
> formula vs formulas vs formulae
Any of the words above (except 'ox' or 'genus') can now be pluralized by
'normal' English inflection, so 'formulas' is not unique.
And there are tons more:
alumna vs alumnae
alumnus vs alumni
datum vs data
deer vs deer
fish vs fish (more than one) vs fishes (more than one species)
pragma vs pragmata
...
I'm sure TomC has extensive lists.
--
(Just Another Larry) Rosler
Hewlett-Packard Laboratories
http://www.hpl.hp.com/personal/Larry_Rosler/
lr@hpl.hp.com
------------------------------
Date: Wed, 15 Sep 1999 04:39:35 GMT
From: nospam.newton@gmx.net (Philip 'Yes, that's my address' Newton)
Subject: Re: bin2hex and back again
Message-Id: <37df1f83.637824941@news.nikoma.de>
On Mon, 13 Sep 1999 15:39:44 -0300, "Kevin Howe"
<khowe@performance-net.com> wrote:
># open file
>open (F,"presentation.ppt");
>binmode (F);
>@binary = <F>;
>close F;
>
>$binary = join('',@binary);
Why read the file into an array and then join it together? You could
just read it into a string straight off by undefining the input record
separator:
{
local $/; # or just 'undef $/' if you don't care about the
# previous value
open (F,"presentation.ppt")
or die "Can't open presentation.ppt: $!";
binmode (F);
$binary = <F>;
close F or die "Error closing presentation.ppt: $!";
}
Cheers,
Philip
--
Philip Newton <nospam.newton@gmx.net>
------------------------------
Date: Wed, 15 Sep 1999 04:39:36 GMT
From: nospam.newton@gmx.net (Philip 'Yes, that's my address' Newton)
Subject: Re: division in list context
Message-Id: <37df213a.638263910@news.nikoma.de>
On Mon, 13 Sep 1999 19:56:18 +0200, Steven de Rooij
<srooij@wins.uva.nl> wrote:
>Having complained about that, why are the list functions max and sum
>missing?
>I'd like to call them like this:
>
>my $highest = max {abs($a) > abs($b)} @array;
>my $tot_chars = sum {length} @array;
I think that there's something you can use for this in the builtin.pm
(sp?) module, which you can get from CPAN. I don't remember the
details, though. (I think it was written by brian d foy.)
Cheers,
Philip
--
Philip Newton <nospam.newton@gmx.net>
------------------------------
Date: Thu, 16 Sep 1999 09:29:45 +0800
From: "eX-HTML" <spam-me-sydneyfong@yahoo.com>
Subject: End Of File
Message-Id: <7rpgrh$cun$1@lobster.vol.net>
could anyone tell me how to write the script like:
open (MYFILE, "test.dat");
while (*not end-of-file*) {
-*thescript*-
};
close MYFILE;
what should *not end-of-file* be in the script?
Thanks
--
Sidney Fong
ICQ#40658693
Homepage : http://come.to/eX-HTML/
Email : try-to-spam-me-sydneyfong@yahoo.com
Don't "Try to spam me" and you'll get my email address
------------------------------
Date: Wed, 15 Sep 1999 22:22:13 -0300
From: "Alexandre" <alrope@zaz.com.br>
Subject: Help ! bootstrap warning !!!
Message-Id: <7rpge6$hmr$1@srv4-poa.zaz.com.br>
Please Programmers,
I installed the DBD-ODBC in my system, and when a run a simple programm
appear the message:
" Install_driver(ODBC) failed: DBD::ODBC object version 0.21 does not match
bootstrap parameter
0 at C:\Perl\5.005\lib/MSWin32-x86-object/DynaLoader.pm line 187."
What should i make ?
The package was installed by VMP in the Internet.
Tanks,
Alexandre Roberto Perestrelo
alrope@zaz.com.br
------------------------------
Date: Wed, 15 Sep 1999 17:21:51 -0700
From: lr@hpl.hp.com (Larry Rosler)
Subject: Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People
Message-Id: <MPG.1249d7f6918cf8be989f7e@nntp.hpl.hp.com>
In article <37E02E34.60BD01DD@mail.cor.epa.gov> on Wed, 15 Sep 1999
16:39:32 -0700, David Cassell <cassell@mail.cor.epa.gov> says...
> [BTW, what *is* the appropriate collective noun for
> Perl programmers? A link? A hash? An array? A class?
> A study? Or perhaps a 'kill' of Perlites, as an analog
> of 'a murder of crows'? ]
A mongeries. By analogy to a congeries (of eels, usually, though my
dictionary indicates that is a general term for an aggregate or
collection).
--
(Just Another Larry) Rosler
Hewlett-Packard Laboratories
http://www.hpl.hp.com/personal/Larry_Rosler/
lr@hpl.hp.com
------------------------------
Date: Thu, 16 Sep 1999 00:26:06 GMT
From: kragen@dnaco.net (Kragen Sitaker)
Subject: Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People
Message-Id: <yOWD3.13713$N77.995055@typ11.nn.bcandid.com>
In article <7rpabs$8hd$1@nnrp1.deja.com>, <harad@my-deja.com> wrote:
>> Who's on your All Star team?
>
>Our co-heads of technology are Mark Steckel (VP, Product Development)
>who's been CTO at a number of startups and Michael Johnson (VP, Network
>Engineering) who was lead engineer at Earthlink and Ziff-Davis. Both
>have all most two decades of experience! Our technology advisors
>include Rich White, who founded Best Internet and Servon (a new ISP)
>and Serge Wilson, CEO of Freemerchant.com and a major networking
>consultant for more than 10 years.
OK. So your All Star team consists of All Management Stars? You don't
have e.g. Randal Schwartz, Larry Wall, Malcolm Beattie, Alan Cox,
Richard Stallman, Tom Christiansen, Steve Wozniak, Tim Bunce, Linus
Torvalds, Daniel Friedman, Jon Bentley, P.J. Plauger, Guy L. Steele,
Bill Joy, or anybody like that? See, I've never heard of the people
you mentioned, and it almost sounds like you don't currently have
anybody on board to actually do the work.
>They are all great to work with, love to teach, and are spearheading
>the development of some great technology for a very hot product. Send
>us your resume!
My resume is at http://pobox.com/~kragen/resume.html, if you want to
look at it.
--
<kragen@pobox.com> Kragen Sitaker <http://www.pobox.com/~kragen/>
Tue Sep 14 1999
55 days until the Internet stock bubble bursts on Monday, 1999-11-08.
<URL:http://www.pobox.com/~kragen/bubble.html>
------------------------------
Date: Thu, 16 Sep 1999 00:28:28 GMT
From: kragen@dnaco.net (Kragen Sitaker)
Subject: Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People
Message-Id: <MQWD3.13715$N77.993547@typ11.nn.bcandid.com>
In article <37E02E34.60BD01DD@mail.cor.epa.gov>,
David Cassell <cassell@mail.cor.epa.gov> wrote:
>> aiming to be the leading aggregator and
>> distributor of promotional offers.
>
>Like this one? Well, you're making friends reeeeeeal
>fast, pal.
>
>Surely you have enough 'tremendous entrepreneurial spirit
>and drive' to find the right place to post job offers.
This wasn't as bad as it looks -- they actually followed up to my
followup, so they're reading the newsgroup, and the ad is rather
relevant to this newsgroup. But I tend to think it's a bit hypey and
off-topic. They need to go read the Cluetrain Manifesto.
--
<kragen@pobox.com> Kragen Sitaker <http://www.pobox.com/~kragen/>
Tue Sep 14 1999
55 days until the Internet stock bubble bursts on Monday, 1999-11-08.
<URL:http://www.pobox.com/~kragen/bubble.html>
------------------------------
Date: Wed, 15 Sep 1999 21:33:24 -0400
From: Elaine -HFB- Ashton <elaine@chaos.wustl.edu>
Subject: Re: Hot, Fun S.F Startup Seeks a Gaggle of Perl People
Message-Id: <37E048DD.F37E6AA5@chaos.wustl.edu>
Jonathan Stowe wrote:
> > Who's on your All Star team?
>
> I'd go for it if they had:
[.....]
Racer X, Natasha, and Dr. Evil. :)
A start-up needs a little evil to even out the shiny-happy enthusiasm.
e.
------------------------------
Date: Thu, 16 Sep 1999 00:07:05 GMT
From: kragen@dnaco.net (Kragen Sitaker)
Subject: Re: is this object a child of this class?
Message-Id: <JwWD3.13691$N77.992685@typ11.nn.bcandid.com>
In article <Pine.NEB.3.96.990915165549.14715B-100000@www.yawp.com>,
Mike Stone <mike@yawp.com> wrote:
>again, switching on classname is generally a weak solution. it's far
>better to define your class interfaces in a way that makes such switching
>unnecessary.
I'm interested what you think about the lambda-calculus code I posted
yesterday. Some of it does both -- whichever seemed more sensible.
>as long as we're talking inheritance, anybody wanna warm up the old
>flamewar about aggregation v. composition?
>
> spot IS-A canis-tutti-frutti # i.e.: mutt
> canis-tutti-frutti IS-A species
>
> therefore, what's the truth value of 'spot IS-A species'?
>
>the trivial solution of eliminating the IS-A relationship entirely, and
>only using HAS-A, isn't much better:
>
> spot HAS-A tail (waggly)
> spot HAS-A species (canis-tutti-frutti)
>
>but while you can have a dog without a tail, you can't have a dog without
>a species.
Spot is an individual. Mutt is a species. Spot is a member of the
class mutt. Mutt could inherit from the 'animal' class, but not from
the 'species' class. You're confusing membership with inheritance.
--
<kragen@pobox.com> Kragen Sitaker <http://www.pobox.com/~kragen/>
Tue Sep 14 1999
55 days until the Internet stock bubble bursts on Monday, 1999-11-08.
<URL:http://www.pobox.com/~kragen/bubble.html>
------------------------------
Date: Thu, 16 Sep 1999 00:09:06 GMT
From: snowhare@long-lake.nihongo.org (Benjamin Franz)
Subject: Re: need to write www search engine
Message-Id: <CyWD3.246$pd.21650@typhoon01.swbell.net>
[posted and mailed]
In article <7rp8ac$3ou$1@fddinewz.oit.unc.edu>,
Roger Jacques <channel@sunsite.unc.edu> wrote:
>I want to write a robot program that will search all www sites by
>domain type and return the <title>.
Yow. You do realize you are talking about crawling on the order of
800 million web pages? And indexing, oh, six or seven million
of those pages? Even with optimzations, you probably will have
to crawl multi-tens of millions of pages to find _most_
web sites.
>But I've never written programs the comprehensively search a specified
>range of web sites and retrieve specific information.
>
>I would appreciate any help that would get me started.
1) This is a _lot_ tougher than it looks.
2) You are going to need a _LOT_ of disk space. 100,000
raw pages take roughly 800 megabytes of disk space before
indexing. So to store 6,000,000 pages prior to indexing
takes roughly 48 gigabytes. If you try to 'incremental'
it you will find there are algorithmic performance problems
with O(N^2) properties attached to making inverted indexes
that way. Bad juju. Do it as a single batch and it is
O(N log N).
3) You need a _big_ data pipe. T1 is _too small_. Fractional T3
is needed. You need to be able to pull hundreds of pages
a second sustained to traverse the 'web space' fast enough
to take less than 'forever'.
4) You have to write a multi-selected or threaded crawler that can
sustain on the order of 2000 simultaneous connections to get decent
throughput. You will find the _average_ page fetch takes
around 5 seconds. With 2000 connections you will attain
around 400 pages a second throughput. This is probably
easier in Java than Perl for various reasons.
5) You need a machine with a gig or two of memory for the indexer.
6) A backend engine available for Perl is Search::InvertedIndex
from CPAN. But it is borderline on being powerful enough. You may have
to use SWISH or WAIS or even write your own in C.
7) Don't even think about trying this unless you have _substantial_
resources behind you.
8) Buy a book called 'Managing Gigabytes', available at Amazon
for around $56 dollars US.
>One question: Do all .gov sites have a specified range in one of the
>dotted decimal quadrants: xxxx.xxxx.xx.xxx,
No.
--
Benjamin Franz
------------------------------
Date: Wed, 15 Sep 1999 17:32:44 -0700
From: David Cassell <cassell@mail.cor.epa.gov>
Subject: Re: need to write www search engine
Message-Id: <37E03AAC.C2EED7B9@mail.cor.epa.gov>
Roger Jacques wrote:
>
> I want to write a robot program that will search all www sites by
> domain type and return the <title>.
>
> For example I want to pull into a two column database the <title>s
> and URL's of all .gov sites.
And, if Abigail and Benjamin didn't dissuade you with their
cogent arguments, let me just point out one more highlight:
Many government webpages are not accessible by everyone on the
web, just as many corporations and organizations maintain
their own intranets.
David
--
David Cassell, OAO cassell@mail.cor.epa.gov
Senior computing specialist
mathematical statistician
------------------------------
Date: Wed, 15 Sep 1999 20:25:29 -0400
From: Roger Jacques <channel@metalab.unc.edu>
To: Benjamin Franz <snowhare@long-lake.nihongo.org>
Subject: Re: need to write www search engine
Message-Id: <Pine.GSO.4.05.9909152023560.27363-100000@titan.oit.unc.edu>
Benjamin,
I wasn't planning on searching the entire web all at once. I was thinking
of breaking it up into managable pieces by incrementing dotted decimal
address with set ranges. Is this not possible?
roger
------------------------------
Date: 15 Sep 1999 20:36:33 -0500
From: abigail@delanet.com (Abigail)
Subject: Re: need to write www search engine
Message-Id: <slrn7u0ihu.i4j.abigail@alexandra.delanet.com>
Benjamin Franz (snowhare@long-lake.nihongo.org) wrote on MMCCVII
September MCMXCIII in <URL:news:CyWD3.246$pd.21650@typhoon01.swbell.net>:
@@ [posted and mailed]
@@
@@ In article <7rp8ac$3ou$1@fddinewz.oit.unc.edu>,
@@ Roger Jacques <channel@sunsite.unc.edu> wrote:
@@ >I want to write a robot program that will search all www sites by
@@ >domain type and return the <title>.
@@
@@ >I would appreciate any help that would get me started.
@@
@@ 2) You are going to need a _LOT_ of disk space. 100,000
@@ raw pages take roughly 800 megabytes of disk space before
@@ indexing. So to store 6,000,000 pages prior to indexing
@@ takes roughly 48 gigabytes. If you try to 'incremental'
@@ it you will find there are algorithmic performance problems
@@ with O(N^2) properties attached to making inverted indexes
@@ that way. Bad juju. Do it as a single batch and it is
@@ O(N log N).
I don't understand the need to keep pages and run indexing algorithms
on them if he only wants to extract the titles. Given that the title
tends to be found in the beginning of the document, you don't even have
to download all of the document. Unless of course you want to extract
links from it; but then there's still no need to store the entire page.
@@ 5) You need a machine with a gig or two of memory for the indexer.
What indexer?
@@ 7) Don't even think about trying this unless you have _substantial_
@@ resources behind you.
That was what I thought at first as well. Then I noted his email address,
and realized that he may indeed have the resources.
Abigail
--
split // => '"';
${"@_"} = "/"; split // => eval join "+" => 1 .. 7;
*{"@_"} = sub {foreach (sort keys %_) {print "$_ $_{$_} "}};
%{"@_"} = %_ = (Just => another => Perl => Hacker); &{%{%_}};
-----------== 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: 15 Sep 1999 20:44:02 -0500
From: abigail@delanet.com (Abigail)
Subject: Re: need to write www search engine
Message-Id: <slrn7u0j01.i4j.abigail@alexandra.delanet.com>
Roger Jacques (channel@metalab.unc.edu) wrote on MMCCVII September
MCMXCIII in <URL:news:Pine.GSO.4.05.9909152023560.27363-100000@titan.oit.unc.edu>:
<>
<> I wasn't planning on searching the entire web all at once. I was thinking
<> of breaking it up into managable pieces by incrementing dotted decimal
<> address with set ranges. Is this not possible?
Well, for starters, 256^4 is a really big number [1]. But the mapping of
hostname to IP number isn't 1-to-1. It's many-to-many. Virtual hosting
can easily put thousands of "sites" on just a handful of IP numbers.
[1] Yes, I know. There aren't really 256^4 useable IP addresses out there.
Abigail
--
%0=map{reverse+chop,$_}ABC,ACB,BAC,BCA,CAB,CBA;$_=shift().AC;1while+s/(\d+)((.)
(.))/($0=$1-1)?"$0$3$0{$2}1$2$0$0{$2}$4":"$3 => $4\n"/xeg;print#Towers of Hanoi
-----------== 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, 16 Sep 1999 01:45:54 GMT
From: mgjv@comdyn.com.au (Martien Verbruggen)
Subject: Re: need to write www search engine
Message-Id: <mZXD3.114$E%1.6244@nsw.nnrp.telstra.net>
In article <Pine.GSO.4.05.9909152023560.27363-100000@titan.oit.unc.edu>,
Roger Jacques <channel@metalab.unc.edu> writes:
\begin{offtopic}
> I wasn't planning on searching the entire web all at once. I was thinking
> of breaking it up into managable pieces by incrementing dotted decimal
> address with set ranges. Is this not possible?
There is very little relationship between adjacent sets in ip address
space. FOr certain spaces it will make sense, for others it will make
little to no sense. You could probably find out more about this in
another group, maybe something with tcpip in the name or so.
Maybe you could use the DNS to get full domain lists, although many
DNS admins nowadays are a bit paranoid about this, and configure their
DNS accordingly. You could try to find out in a groups that talks
about DNS.
You could even try to use whois is an attempt tp make sense of how the
various ip ranges are allocated to the various owners, but I give you
only a very slim chance of succeeding.
There is virtually no sense in the way ip addresses have been
distributed, and it shouldn't worry you.
\end{offtopic}
Martien
--
Martien Verbruggen |
Interactive Media Division | Unix is user friendly. It's just
Commercial Dynamics Pty. Ltd. | selective about its friends.
NSW, Australia |
------------------------------
Date: Thu, 16 Sep 1999 00:30:00 GMT
From: "B.J.G." <Ghassemlou@home.com>
Subject: Newbie Help: Syntax of Perl Command
Message-Id: <cSWD3.37245$kL1.417741@news2.rdc1.on.home.com>
Q1- I need to find out to exit a "ForEach" loop!
is there such a thing like:
ForEach $elem (@Array) [Until ...] {...}
Q2- Where can I get a document which list the syntax of all Perl Command.?
Thank everyone
bGhassemlou@yahoo.com
------------------------------
Date: Thu, 16 Sep 1999 01:36:46 GMT
From: mgjv@comdyn.com.au (Martien Verbruggen)
Subject: Re: Newbie Help: Syntax of Perl Command
Message-Id: <OQXD3.113$E%1.6244@nsw.nnrp.telstra.net>
In article <cSWD3.37245$kL1.417741@news2.rdc1.on.home.com>,
"B.J.G." <Ghassemlou@home.com> writes:
> Q1- I need to find out to exit a "ForEach" loop!
# perldoc -f last
> Q2- Where can I get a document which list the syntax of all Perl Command.?
# perldoc perlsyn
In other words, perl comes with a great set of documentation. On
unices, this documentation is available with the standard man command.
On almost all platforms you can use perldoc:
# perldoc perl
# perldoc perltoc
# perldoc perldoc
If you are on a win32 system, and use the ActiveState distribution,
the documentation is included as HTML as well.
If you had read a few messages on this group, you would have known
that. If you had at least read one of the FAQ posts, you would have
known it as well.
Please, before posting next time, try to first _read_ a few of the
messages here. It's very useful.
Martien
--
Martien Verbruggen |
Interactive Media Division | Useful Statistic: 75% of the people
Commercial Dynamics Pty. Ltd. | make up 3/4 of the population.
NSW, Australia |
------------------------------
Date: Wed, 15 Sep 1999 17:13:59 -0700
From: designer@ricochet.net (Dan Poynor)
Subject: Re: Old Script Doesn't Like My New Perl? Help!
Message-Id: <designer-ya02408000R1509991713590001@news.ricochet.net>
I've got this working...
#! /usr/bin/perl
$oldlink = readlink("/home/httpd/foobar.com/current");
@dirs = sort grep {!-l $_ && -d _} </home/httpd/foobar.com/slideshows/*>;
push(@dirs, $dirs[0]);
for (1..@dirs) { $newlink = $dirs[$_] and last if $dirs[$_-1] eq $oldlink };
unlink "/home/httpd/foobar.com/current" || warn "unlink: $!";
symlink ($newlink, "/home/httpd/foobar.com/current") || die "symlink: $!";
Cheers,
DAN
In article <37d9b4e4.1087844@news.skynet.be>, bart.lateur@skynet.be (Bart
Lateur) wrote:
> Dan Poynor wrote:
>
> >I've tried the suggestions but have not been able to resolve this problem.
> >I do notice attempting to run my script is creating a tmp file like such...
> >
> >tmp.2973 -> /home/httpd/foobar.com/slideshows/1250
> >
> >which is a link to the correct directory in the array but it doesn't change
> >the name of the symbolic link named "current". It's like it's stuck for
> >some reason.
>
> Time for some diagnostic output! This is your code:
>
> symlink($newlink, "tmp.$$");
> rename("tmp.$$", "/home/httpd/foobar.com.com/current");
>
> Change it to (print to whatever filehandle you find appropriate):
>
> print STDERR "Name of new link = $newlink\n";
> symlink($newlink, "tmp.$$") or die "Failed to symlink: $!";
> rename("tmp.$$", "/home/httpd/foobar.com.com/current")
> or die "Cannot rename: $!";
>
> and it should tell you exactly why some of it fails. It could be a
> file/directory permissions problem.
>
> --
> Bart.
------------------------------
Date: 15 Sep 1999 19:34:30 -0700
From: Tom Christiansen <tchrist@mox.perl.com>
Subject: Re: Parsing Tab Delimited File
Message-Id: <37e04926@cs.colorado.edu>
[courtesy cc of this posting mailed to cited author]
In comp.lang.perl.misc,
abigail@delanet.com writes:
» But I am told that
» certain non-Unix-thinking programs generate warped things
»
» Bill, 'Peter''s Place, Mary and Ned', Fred
»
» which are rather un-split-friendly.
>I fail to see what "split" has to do with being Unix-thinking or I
>fail to see what "split" has to do with being Unix-thinking or non-Unix
>thinking.
>Could you cite some references please?
1) I know of no common Unix text databases that evince the sorts of
unpleasantries alluded to above.
2) Whenever I encounter files suffering similarly infelicitous
formats, these invariably derive from a non-Unix source.
I make no claims of inevitably: I no more pretend it impossible under
Unix to create a file in a format as annoying to parse as were those
from my original posting than do I allege that all non-Unix systems
should be somehow fated to generate files inherently cumbersome to
process. I simply relate my own previous experiences and consequent
perceptions--which, being clearly anecdotal, are more illustrative
than probative. Nevertheless, should this matter prove itself to be
in fact as it would otherwise in appearance suggest, this then would
be minor mystery whose explanation I confess myself somewhat reticent
to speculate upon. I am certainly open to entertaining any hypotheses
you or others might offer up.
--tom
--
": fighting for peace is like fucking for virginity (ado@bigcomm.gun.de)
Yes, but I did manage to increase the amount of virginity in the world
by that method." --Larry Wall
------------------------------
Date: Wed, 15 Sep 1999 18:37:30 +1700
From: LynchMan <lynchmanNOpaSPAM@cyberenet.net>
Subject: PERL (cgi) and Databases -> How To?
Message-Id: <0b51f39f.f8b3f1be@usw-ex0102-012.remarq.com>
Hey,
I am curently developing some PERL Cgi scripts, and I want
to get into using a database with my scripts. I was
wondering where I should start. I use my ISP to host my
pages (it is a unix box). So basically I was wondering what
database program I should use, and how do I connect to it
using perl. I am running a Linux box at home, so what I am
really looking for is some database that I can create
locally, then upload it to the server and be able to have
the scripts (which are running on the sever) hit it on a
needs be basis. My main concern is what my ISP will
support. I don't think they will install any modules for me
or a new database driver, so what types would a typical unix
ISP box support?
If it would work I could deal with an MS access DB. I do
have a windows box also so I could make the DB in that, but
then will I be able to access it using PERL and on a unix
ISP without having anything installed onto the server?
Thanks, and sorry if this sounds confusing... :o)
-Pete
* Sent from RemarQ http://www.remarq.com The Internet's Discussion Network *
The fastest and easiest way to search and participate in Usenet - Free!
------------------------------
Date: Thu, 16 Sep 1999 00:10:48 GMT
From: kragen@dnaco.net (Kragen Sitaker)
Subject: Re: Please help a newbie!
Message-Id: <cAWD3.13698$N77.992932@typ11.nn.bcandid.com>
In article <MPG.1249a335ca548e04989f70@nntp.hpl.hp.com>,
Larry Rosler <lr@hpl.hp.com> wrote:
>In article <oeRD3.13147$N77.951179@typ11.nn.bcandid.com> on Wed, 15 Sep
>1999 18:06:12 GMT, Kragen Sitaker <kragen@dnaco.net> says...
>> Oh yes, I forgot to flame about this. Whoever defined this mm/dd/yy
>> format for storing your data should be taken out and shot in 01/01/00.
>
>Reading responses such as these makes me wonder why Abigail and I spent
>so much time this week enlightening Benjamin Franz on the error
>underlying this kind of dogmatism. What a waste of effort! Sigh...
I agree with Abigail; he said storing 2-digit dates was a bad idea, but
they were a good idea for input, if I remember correctly. I agree.
What's your opinion? I can't remember it, because you're less
irritating -- although no less informative.
--
<kragen@pobox.com> Kragen Sitaker <http://www.pobox.com/~kragen/>
Tue Sep 14 1999
55 days until the Internet stock bubble bursts on Monday, 1999-11-08.
<URL:http://www.pobox.com/~kragen/bubble.html>
------------------------------
Date: Thu, 16 Sep 1999 00:11:59 GMT
From: kragen@dnaco.net (Kragen Sitaker)
Subject: Re: Please help a newbie!
Message-Id: <jBWD3.13699$N77.992714@typ11.nn.bcandid.com>
In article <7rp3l6$10j$1@gellyfish.btinternet.com>,
Jonathan Stowe <gellyfish@gellyfish.com> wrote:
>On Wed, 15 Sep 1999 18:06:12 GMT Kragen Sitaker wrote:
>> Oh yes, I forgot to flame about this. Whoever defined this mm/dd/yy
>> format for storing your data should be taken out and shot in 01/01/00.
>
>Why ?
>
>I for one have no way of knowing whether this will cause a problem or
>whether '01/01/00' will be ambiguous (as to the year) within the context
>of the dataset it comes from.
It's a trap. Different people will write programs that will
disambiguate the year in different ways.
--
<kragen@pobox.com> Kragen Sitaker <http://www.pobox.com/~kragen/>
Tue Sep 14 1999
55 days until the Internet stock bubble bursts on Monday, 1999-11-08.
<URL:http://www.pobox.com/~kragen/bubble.html>
------------------------------
Date: Wed, 15 Sep 1999 18:51:43 -0700
From: lr@hpl.hp.com (Larry Rosler)
Subject: Re: Please help a newbie!
Message-Id: <MPG.1249ed0aa2f6f64b989f80@nntp.hpl.hp.com>
In article <cAWD3.13698$N77.992932@typ11.nn.bcandid.com> on Thu, 16 Sep
1999 00:10:48 GMT, Kragen Sitaker <kragen@dnaco.net> says...
> In article <MPG.1249a335ca548e04989f70@nntp.hpl.hp.com>,
> Larry Rosler <lr@hpl.hp.com> wrote:
> >In article <oeRD3.13147$N77.951179@typ11.nn.bcandid.com> on Wed, 15 Sep
> >1999 18:06:12 GMT, Kragen Sitaker <kragen@dnaco.net> says...
> >> Oh yes, I forgot to flame about this. Whoever defined this mm/dd/yy
> >> format for storing your data should be taken out and shot in 01/01/00.
> >
> >Reading responses such as these makes me wonder why Abigail and I spent
> >so much time this week enlightening Benjamin Franz on the error
> >underlying this kind of dogmatism. What a waste of effort! Sigh...
>
> I agree with Abigail; he said storing 2-digit dates was a bad idea, but
> they were a good idea for input, if I remember correctly. I agree.
> What's your opinion? I can't remember it, because you're less
> irritating -- although no less informative.
Thanks, I guess. Being less irritating than Abigail is small praise
indeed, but better than none. :-)
My opinion is that whatever solves the problem in the problem domain is
best. If two-digit years are unambiguous in this domain. then they
might as well be stored that way in the data file.
Note that there is no issue of sorting according to them (which would
cause trouble at the '99' to '00' transition), because the dates are not
in sortable order in any case. So the disambiguation to four-digit
years could take place during sortkey extraction.
--
(Just Another Larry) Rosler
Hewlett-Packard Laboratories
http://www.hpl.hp.com/personal/Larry_Rosler/
lr@hpl.hp.com
------------------------------
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" from
almanac@ruby.oce.orst.edu. The real FAQ, as it appeared last in the
newsgroup, can be retrieved with the request "send perl-users FAQ" from
almanac@ruby.oce.orst.edu. 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" from
almanac@ruby.oce.orst.edu.
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 812
*************************************
