[26182] in Perl-Users-Digest
Perl-Users Digest, Issue: 8371 Volume: 10
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Tue Aug 30 11:05:45 2005
Date: Tue, 30 Aug 2005 08:05:05 -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 Tue, 30 Aug 2005 Volume: 10 Number: 8371
Today's topics:
Re: AS400/ RPG/ CGI/ CAREER POSITION/ MICH <tadmc@augustmail.com>
Re: Calling Diff on Arrays <jkeen_via_google@yahoo.com>
Re: Can I Force Perl to Bypass File Write Buffers? xhoster@gmail.com
Re: comparing 2 arrays (Anno Siegel)
Re: comparing 2 arrays <sppNOSPAM@libello.com>
Re: comparing 2 arrays (Anno Siegel)
Re: comparing 2 arrays <sppNOSPAM@libello.com>
Re: comparing 2 arrays <mark.clementsREMOVETHIS@wanadoo.fr>
Re: comparing 2 arrays (Anno Siegel)
Re: Jargons of Info Tech industry axel@white-eagle.invalid.uk
Re: Net::POP3 with SSL <zentara@highstream.net>
Re: Wrote a eBayAPI perl module, how to release it to C <sherm@dot-app.org>
Re: Wrote a eBayAPI perl module, how to release it to C <tadmc@augustmail.com>
Re: Wrote a eBayAPI perl module, how to release it to C <Peter@PSDT.com>
Re: Wrote a eBayAPI perl module, how to release it to C <ignoramus8644@NOSPAM.8644.invalid>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Tue, 30 Aug 2005 07:26:14 -0500
From: Tad McClellan <tadmc@augustmail.com>
Subject: Re: AS400/ RPG/ CGI/ CAREER POSITION/ MICH
Message-Id: <slrndh8k36.t3o.tadmc@magna.augustmail.com>
TOM GUGGER <tgugger@aimexec.com> wrote:
> Our client
Commercial posts to most Usenet newsgroups are widely reviled as spam.
(Notable exceptions are newsgroups with "jobs" in the newsgroup name,
this is not such a newsgroup.
)
Please stop being a spammer. You are doing damage to your reputation.
There is also a mailing list for advertising Perl jobs:
http://lists.cpan.org/showlist.cgi?name=jobs
> is searching for an AS400 programmer/ analyst who has solid
> experience with BOTH RPG and CGI.
What connection does your work have with the _Perl_ programming language?
This _is_ the Perl newsgroup you know...
> They are a real company, not a consulting company.
A consulting company is a fake? How so?
> 6.. Salary requirements -----------------------K + benefits
Many people will not be satisfied with compensation in Potassium.
Most will need a salary expressed in some form of currency.
:-)
--
Tad McClellan SGML consulting
tadmc@augustmail.com Perl programming
Fort Worth, Texas
------------------------------
Date: Tue, 30 Aug 2005 12:56:05 GMT
From: James E Keenan <jkeen_via_google@yahoo.com>
Subject: Re: Calling Diff on Arrays
Message-Id: <4314576A.3000809@yahoo.com>
Robert Love wrote:
> I can read in two text files into arrays of lines, manipulate and sort
> the contents. I then want to pass the arrays to diff and manipulate and
> print the results of the diff. I have it working using temporary files
> that I write the arrays into. My question is how do I do this directly,
> without writing to temporary files?
>
You state that you "manipulate" the contents in the temp files and then
"manipulate" the arrays. My hunch is that the solution depends on what
you mean by "manipulate" in each context. Algorithm::Diff, as others
have suggested, may be of use here. For determining the differences
between two or more sets, my CPAN distribution List::Compare may be useful.
jimk
------------------------------
Date: 30 Aug 2005 14:57:27 GMT
From: xhoster@gmail.com
Subject: Re: Can I Force Perl to Bypass File Write Buffers?
Message-Id: <20050830105727.109$gL@newsreader.com>
Hal Vaughan <hal@thresholddigital.com> wrote:
> I'm using Perl 5.6.1 (and in some cases 5.8) on Linux. I've noticed that
> when I'm processing files, that Perl writes in blocks, so it'll process a
> number of items, and instead of the file having one line at a time
> written to it, it'll get a whole block at once suddenly written to the
> disk.
To answer the question you asked, check out the variable $|.
To answer the question you didn't ask, your method isn't very good. If you
are truly concerned about data integrity, use a transactional database for
both the data and the log, and make sure both data write and log write are
in the same transaction. Or make your program, upon restarting, tail the
existing data file and figure out where to pick up based solely on the data
file, and dispense with the logging altogether. Or do both--write the data
into a database, and have the entry in the database by its own log.
>
> Is there any way to avoid this and force Perl to write each line as I use
> a "print" statement to output the line? I log (in MySQL) each item as I
> finish it, so if power fails or the program is aborted, the system can
> pick up right where it left off. Because of the buffers, the log is
> ahead of what is written to the file, which would mean I'd lose the data
> between what's written and what's logged.
Xho
--
-------------------- http://NewsReader.Com/ --------------------
Usenet Newsgroup Service $9.95/Month 30GB
------------------------------
Date: 30 Aug 2005 10:12:17 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: comparing 2 arrays
Message-Id: <df1be1$bs7$1@mamenchi.zrz.TU-Berlin.DE>
Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> Anno Siegel a écrit :
> > Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> >
> >>Hi all,
> >>
> >>I have those two arrays:
> >>
> >>@estimated = qw ( 1 3 6 7 3 1 2 4 6 9);
> >>@arrived = qw ( 6 7 1 0 4);
>
> The real situation is that:
> I work in the public car park of monaco (about 30 car parks).
Ugh. I asked for concretisation, but this is rather more concrete
than I expected.
> A customer of mine, on internet, can plan a route that he want to do.
> 1st : Go to car park n°1
> 2nd : Go to car park n°3
> 3rd : Go to car park n°6
> ...
> it represents @estimated array.
Okay. Why would he visit some of the car parks twice?
> But when he comes in monaco, he finally decides to come first to car
> park n°6, then car park n°7, then car park n°1, ... and car park n°4.
> It represents @arrived array.
>
> I need, when he want to exit a car park, to ask him if he plan to go to
> the next car park n°....
It looks like you *don't* want to ask him...
> In that precise case : I need to program an algorithm that give me '6'.
...but to predict what he'll do, though I don't see how.
So he comes in and visits car parks in a different sequence than
originally planned. In my view, that cancels the original plan.
What bearing does it still have? Is the assumption that he always
goes from park 4 to park 6? What if the last element in @arrived was
3 instead of 4? He can go to 6 or 1 from there.
> I smell now a recursive function.
Why?
> First check the 6 (first element in @arrived) in @estimated.
> Foreach position found, try to find now the 7 ...
What does it mean to "find the 7 for a position found" and how does
that lead to the answer 6? I still don't know what you want to achieve.
Is he going to visit all the places on the plan, but in a different
order? Or has he skipped the (first) visit to 1 and both visits to 3
for good because the @arrives list doesn't begin with them?
Anno
--
If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.
------------------------------
Date: Tue, 30 Aug 2005 12:38:29 +0200
From: =?ISO-8859-1?Q?S=E9bastien_Cottalorda?= <sppNOSPAM@libello.com>
Subject: Re: comparing 2 arrays
Message-Id: <43143722$0$18579$636a15ce@news.free.fr>
Anno Siegel a écrit :
> Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
>
>>Anno Siegel a écrit :
>>
>>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
>>>
>>>
>>>>Hi all,
>>>>
>>>>I have those two arrays:
>>>>
>>>>@estimated = qw ( 1 3 6 7 3 1 2 4 6 9);
>>>>@arrived = qw ( 6 7 1 0 4);
>>
>>The real situation is that:
>>I work in the public car park of monaco (about 30 car parks).
>
>
> Ugh. I asked for concretisation, but this is rather more concrete
> than I expected.
You asked for concretisation, you've got it ;-)
>>A customer of mine, on internet, can plan a route that he want to do.
>>1st : Go to car park n°1
>>2nd : Go to car park n°3
>>3rd : Go to car park n°6
>>...
>>it represents @estimated array.
>
>
> Okay. Why would he visit some of the car parks twice?
Why not ?
>
>>But when he comes in monaco, he finally decides to come first to car
>>park n°6, then car park n°7, then car park n°1, ... and car park n°4.
>>It represents @arrived array.
>>
>>I need, when he want to exit a car park, to ask him if he plan to go to
>>the next car park n°....
>
>
> It looks like you *don't* want to ask him...
In fact, I would like to predict his new car park *according* to the
original planning.
I gave a complicate example with, I think, all possibility.
a less complicated example is :
@estimated (1 2 3 1 6 12);
@arrived (1 6);
because the customer arrived in late in monaco, he decides to make less
visit and goes to the 3 last car parks, respectively 1, 6 and ... => 12.
When he exits of the car park n°6, I *want* him to tell me if he plans
to go to car park ...12 because I need to tell him if the car park if
free or full.
The sequence he does is exactly the same as planned, but truncated.
On a more complicate example, I add some "polution" in the effective
route (@arrived) of the customer : he decides to go to car park 4 before
the n°12 because he has finally enough time to visit everything.
>>I smell now a recursive function.
>
>
> Why?
Let's take :
@estimated = qw ( 1 3 4 5 6 3 2 1 9);
@arrived = qw ( 3 4 6);
I think it's a good idea to construct a tree like this:
...
2 => never here
3 => never here
6 => found *6* => end of processing
5 => polution
4 => found *4*
@estimated = 1 3 => found *3*
2 => polution
1 => polution
9 => polution
End of array
going all over the tree, I find the value 3 at positions 1 and 5 of
@estimated.
I try to program such an algorithm, but it never goes in the 1 3 2 1 9
branch.
Sebastien
------------------------------
Date: 30 Aug 2005 11:30:54 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: comparing 2 arrays
Message-Id: <df1g1e$epg$1@mamenchi.zrz.TU-Berlin.DE>
Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> Anno Siegel a écrit :
> > Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> >>Anno Siegel a écrit :
> >>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
[...]
> >>A customer of mine, on internet, can plan a route that he want to do.
> >>1st : Go to car park n°1
> >>2nd : Go to car park n°3
> >>3rd : Go to car park n°6
> >>...
> >>it represents @estimated array.
> >
> >
> > Okay. Why would he visit some of the car parks twice?
>
> Why not ?
Because it makes the problem harder.
> >>But when he comes in monaco, he finally decides to come first to car
> >>park n°6, then car park n°7, then car park n°1, ... and car park n°4.
> >>It represents @arrived array.
> >>
> >>I need, when he want to exit a car park, to ask him if he plan to go to
> >>the next car park n°....
> >
> >
> > It looks like you *don't* want to ask him...
>
> In fact, I would like to predict his new car park *according* to the
> original planning.
> I gave a complicate example with, I think, all possibility.
> a less complicated example is :
> @estimated (1 2 3 1 6 12);
> @arrived (1 6);
> because the customer arrived in late in monaco, he decides to make less
> visit and goes to the 3 last car parks, respectively 1, 6 and ... => 12.
>
> When he exits of the car park n°6, I *want* him to tell me if he plans
> to go to car park ...12 because I need to tell him if the car park if
> free or full.
Okay... There's always a possibility that the recorded arrivals match
at more than one place in the plan, so we can't expect the prediction
to be unique. Here is a sketch how to go about it:
my @estimated = qw(1 2 3 1 6 12);
my @arrived = qw( 1 6);
my @matches = grep match_at( $_, \ @arrived, \ @estimated),
0 .. $#estimated - @arrived;
my @predictions = map $estimated[ $_ + @arrived], @matches;
print "predictions: @predictions\n";
sub match_at {
my ( $i, $arr, $est) = @_;
for ( 0 .. $#$arr ) {
return 0 unless $est->[ $i + $_] == $arr->[ $_];
}
return 1;
}
In this case, the prediction is unique: 12, but it is easy to
construct examples where it isn't.
> The sequence he does is exactly the same as planned, but truncated.
>
> On a more complicate example, I add some "polution" in the effective
Let me skip that for now. If my approach above is about right, you
could modify the function match_at() to return "fuzzy" values between
0 and 1 for imperfect matches. You would then have to decide for a
limit and extract the matches like
my @matches = grep match_at( $_, \ @arrived, \ @estimated) > $limit,
0 .. $#estimated - @arrived;
I still don't see recursion looming anywhere.
Anno
--
If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.
------------------------------
Date: Tue, 30 Aug 2005 14:15:39 +0200
From: =?ISO-8859-1?Q?S=E9bastien_Cottalorda?= <sppNOSPAM@libello.com>
Subject: Re: comparing 2 arrays
Message-Id: <43144dea$0$12775$636a15ce@news.free.fr>
Anno Siegel a écrit :
> Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
>
>>Anno Siegel a écrit :
>>
>>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
>>>
>>>>Anno Siegel a écrit :
>>>>
>>>>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
>
>
> [...]
>
>
>>>>A customer of mine, on internet, can plan a route that he want to do.
>>>>1st : Go to car park n°1
>>>>2nd : Go to car park n°3
>>>>3rd : Go to car park n°6
>>>>...
>>>>it represents @estimated array.
>>>
>>>
>>>Okay. Why would he visit some of the car parks twice?
>>
>>Why not ?
>
>
> Because it makes the problem harder.
Of course, but it's the reality.
>>>>But when he comes in monaco, he finally decides to come first to car
>>>>park n°6, then car park n°7, then car park n°1, ... and car park n°4.
>>>>It represents @arrived array.
>>>>
>>>>I need, when he want to exit a car park, to ask him if he plan to go to
>>>>the next car park n°....
>>>
>>>
>>>It looks like you *don't* want to ask him...
>>
>>In fact, I would like to predict his new car park *according* to the
>>original planning.
>>I gave a complicate example with, I think, all possibility.
>>a less complicated example is :
>>@estimated (1 2 3 1 6 12);
>>@arrived (1 6);
>>because the customer arrived in late in monaco, he decides to make less
>>visit and goes to the 3 last car parks, respectively 1, 6 and ... => 12.
>>
>>When he exits of the car park n°6, I *want* him to tell me if he plans
>>to go to car park ...12 because I need to tell him if the car park if
>>free or full.
>
>
> Okay... There's always a possibility that the recorded arrivals match
> at more than one place in the plan, so we can't expect the prediction
> to be unique. Here is a sketch how to go about it:
>
> my @estimated = qw(1 2 3 1 6 12);
> my @arrived = qw( 1 6);
>
> my @matches = grep match_at( $_, \ @arrived, \ @estimated),
> 0 .. $#estimated - @arrived;
>
> my @predictions = map $estimated[ $_ + @arrived], @matches;
>
> print "predictions: @predictions\n";
>
> sub match_at {
> my ( $i, $arr, $est) = @_;
> for ( 0 .. $#$arr ) {
> return 0 unless $est->[ $i + $_] == $arr->[ $_];
> }
> return 1;
> }
>
> In this case, the prediction is unique: 12, but it is easy to
> construct examples where it isn't.
>
>>The sequence he does is exactly the same as planned, but truncated.
>>
>>On a more complicate example, I add some "polution" in the effective
>
>
> Let me skip that for now. If my approach above is about right, you
> could modify the function match_at() to return "fuzzy" values between
> 0 and 1 for imperfect matches. You would then have to decide for a
> limit and extract the matches like
>
> my @matches = grep match_at( $_, \ @arrived, \ @estimated) > $limit,
> 0 .. $#estimated - @arrived;
>
> I still don't see recursion looming anywhere.
>
> Anno
In a recursive way I see:
1st path:
1-> 0st element of @estimated
6-> 6th element of @estimated
==> next car parc = 7th element of @estimated ==> "12"
2nd path:
1-> 3rd element of @estimated
6-> 6th element of @estimated
==> next car parc = 7th element of @estimated ==> "12"
I've 2 differents ways, both gives car parc 12 as a result .
I'm impressed by your code.
I've checked that couple with your program:
my @estimated = qw(1 2 3 1 6 5 7 0 9);
my @arrived = qw(1 6 5 0);
but it doesn't predicate anything.
Normaly it should predicate 9.
Sebastien
------------------------------
Date: Tue, 30 Aug 2005 14:24:16 +0200
From: Mark Clements <mark.clementsREMOVETHIS@wanadoo.fr>
Subject: Re: comparing 2 arrays
Message-Id: <43144ff3$0$5366$8fcfb975@news.wanadoo.fr>
Sébastien Cottalorda wrote:
> Hi all,
>
> I have those two arrays:
>
> @estimated = qw ( 1 3 6 7 3 1 2 4 6 9);
> @arrived = qw ( 6 7 1 0 4);
>
> I need to determine the next value that will probably come in the
> @arrived array.
> As you can see, I can have some "polution" in the @arrived array (with
> the 0 value that should not have occured, but we need to to with that).
>
> I need an algorithm that can give me the probably next value => 6
> It smells a 2 arrays comparaison, but ...
>
> How can I manage to do that.
>
> Is someone have a clue ?
>
> Thanks in advance for any kind of help.
>
> Sebastien
<ignoring ongoing discussion>
Have you considered something like looking at
AI::NeuralNet::Simple
or some of the
AI::Fuzzy
hierarchy?
I may be way off the mark here, but it occurred to me that these are a
possible match for your problem domain.
Mark
------------------------------
Date: 30 Aug 2005 14:08:53 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: comparing 2 arrays
Message-Id: <df1p9l$kit$1@mamenchi.zrz.TU-Berlin.DE>
Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> Anno Siegel a écrit :
> > Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> >>Anno Siegel a écrit :
> >>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> >>>>Anno Siegel a écrit :
> >>>>>Sébastien Cottalorda <sppNOSPAM@libello.com> wrote in comp.lang.perl.misc:
> >
> >
> > [...]
> >
> >
> >>>>A customer of mine, on internet, can plan a route that he want to do.
> >>>>1st : Go to car park n°1
> >>>>2nd : Go to car park n°3
> >>>>3rd : Go to car park n°6
> >>>>...
> >>>>it represents @estimated array.
[...]
> >>>>But when he comes in monaco, he finally decides to come first to car
> >>>>park n°6, then car park n°7, then car park n°1, ... and car park n°4.
> >>>>It represents @arrived array.
> >>>>
> >>>>I need, when he want to exit a car park, to ask him if he plan to go to
> >>>>the next car park n°....
> >>>
> >>>
> >>>It looks like you *don't* want to ask him...
> >>
> >>In fact, I would like to predict his new car park *according* to the
> >>original planning.
> >>I gave a complicate example with, I think, all possibility.
> >>a less complicated example is :
> >>@estimated (1 2 3 1 6 12);
> >>@arrived (1 6);
> >>because the customer arrived in late in monaco, he decides to make less
> >>visit and goes to the 3 last car parks, respectively 1, 6 and ... => 12.
> >>
> >>When he exits of the car park n°6, I *want* him to tell me if he plans
> >>to go to car park ...12 because I need to tell him if the car park if
> >>free or full.
> >
> >
> > Okay... There's always a possibility that the recorded arrivals match
> > at more than one place in the plan, so we can't expect the prediction
> > to be unique. Here is a sketch how to go about it:
> >
> > my @estimated = qw(1 2 3 1 6 12);
> > my @arrived = qw( 1 6);
> >
> > my @matches = grep match_at( $_, \ @arrived, \ @estimated),
> > 0 .. $#estimated - @arrived;
> >
> > my @predictions = map $estimated[ $_ + @arrived], @matches;
> >
> > print "predictions: @predictions\n";
> >
> > sub match_at {
> > my ( $i, $arr, $est) = @_;
> > for ( 0 .. $#$arr ) {
> > return 0 unless $est->[ $i + $_] == $arr->[ $_];
> > }
> > return 1;
> > }
> >
> > In this case, the prediction is unique: 12, but it is easy to
> > construct examples where it isn't.
> >
> >>The sequence he does is exactly the same as planned, but truncated.
> >>
> >>On a more complicate example, I add some "polution" in the effective
> >
> >
> > Let me skip that for now. If my approach above is about right, you
> > could modify the function match_at() to return "fuzzy" values between
> > 0 and 1 for imperfect matches. You would then have to decide for a
> > limit and extract the matches like
> >
> > my @matches = grep match_at( $_, \ @arrived, \ @estimated) > $limit,
> > 0 .. $#estimated - @arrived;
> >
> > I still don't see recursion looming anywhere.
> >
> > Anno
>
> In a recursive way I see:
>
> 1st path:
> 1-> 0st element of @estimated
> 6-> 6th element of @estimated
4th
> ==> next car parc = 7th element of @estimated ==> "12"
5th
> 2nd path:
> 1-> 3rd element of @estimated
> 6-> 6th element of @estimated
4th
> ==> next car parc = 7th element of @estimated ==> "12"
5th
>
> I've 2 differents ways, both gives car parc 12 as a result .
Ugh. A diagram with two kinds of arrows, none of which is explained.
All I can see from it is that you arrive at 12 because 6 precedes it,
but in fact the second "path" is a much better match because it has
two consecutive matches at 3 and 4. How would a recursive routine
make use of that?
Mind you, I'm sure you can come up with a recursive function to solve
this (you almost always can). The big question about recursion is
when *not* to use it (it is inefficient and usually harder to understand
than a non-recursive solution). I don't see how your problem naturally
splits off a smaller partial problem that can be solved in the same way.
That is the usual indicator for a recursive approach.
> I'm impressed by your code.
>
> I've checked that couple with your program:
> my @estimated = qw(1 2 3 1 6 5 7 0 9);
> my @arrived = qw(1 6 5 0);
> but it doesn't predicate anything.
No, it wouldn't. As I said, the code doesn't deal with errors in the
data. It needs a perfect match anywhere in the @estimated array to
make a prediction.
> Normaly it should predicate 9.
On what ground? You seem to assume he skipped 7. If he swapped
0 and 7, the prediction would have to be 7. You need to define
an (idealized) behavior of your client to make predictions about it.
So far your haven't done that.
Anno
--
If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.
------------------------------
Date: Tue, 30 Aug 2005 11:30:19 GMT
From: axel@white-eagle.invalid.uk
Subject: Re: Jargons of Info Tech industry
Message-Id: <frXQe.34716$5m3.17574@fe1.news.blueyonder.co.uk>
In comp.lang.perl.misc John Bokma <john@castleamber.com> wrote:
> Alan Balmer <albalmer@att.net> wrote:
>> On 29 Aug 2005 21:12:13 GMT, John Bokma <john@castleamber.com> wrote:
>>>> Now, go away. And please, stay away.
>>>Like I already said, it doesn't work that way.
>> Goodbye, John. Filters set.
> Saidly you didn't get the message. Moreover you think that the Usenet
> /needs/ a public ploink message. Get a clue. People like you add more noise
> to Usenet compared to a thread which runs a bit wide.
Why do I think of a Dutch expression 'mieren neuker' with regards to
Balmer's posts?
Axel
------------------------------
Date: Tue, 30 Aug 2005 09:37:11 -0400
From: zentara <zentara@highstream.net>
Subject: Re: Net::POP3 with SSL
Message-Id: <kfn8h15df2sn9dng8lbt1lgkeemofghdua@4ax.com>
On Tue, 30 Aug 2005 06:27:50 GMT, Avi Kak <kak@purdue.edu> wrote:
>Is there a version of the Net::POP3 module that works with SSL but
>has essentially the same interface?
>
>Any help would be much appreciated. Thanks.
Hi, here is an untested script from origins unknown.
#!/usr/bin/perl
use Mail::POP3Client;
$pop = new Mail::POP3Client( USER => "me",
PASSWORD => "mypassword",
HOST => "pop3.do.main" );
for( $i = 1; $i <= $pop->Count(); $i++ ) {
foreach( $pop->Head( $i ) ) {
/^(From|Subject):\s+/i && print $_, "\n";
}
}
$pop->Close();
# OR with SSL
##**<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
$pop = new Mail::POP3Client( USER => "me",
PASSWORD => "mypassword",
HOST => "pop3.do.main",
USESSL => true,
);
# OR
$pop2 = new Mail::POP3Client( HOST => "pop3.otherdo.main" );
$pop2->User( "somebody" );
$pop2->Pass( "doublesecret" );
$pop2->Connect() >= 0 || die $pop2->Message();
$pop2->Close();
# OR to use your own SSL socket...
my $socket = IO::Socket::SSL->new( PeerAddr => 'pop.securedo.main',
PeerPort => 993,
Proto => 'tcp') || die "No
socket!";
my $pop = Mail::POP3Client->new();
$pop->User('somebody');
$pop->Pass('doublesecret');
$pop->Socket($socket);
$pop->Connect();
__END__
--
I'm not really a human, but I play one on earth.
http://zentara.net/japh.html
------------------------------
Date: Tue, 30 Aug 2005 07:14:10 -0400
From: Sherm Pendley <sherm@dot-app.org>
Subject: Re: Wrote a eBayAPI perl module, how to release it to CPAN?
Message-Id: <m21x4b7k3h.fsf@Sherm-Pendleys-Computer.local>
Ignoramus23186 <ignoramus23186@NOSPAM.23186.invalid> writes:
> I am looking for helpful (as opposed to unhelpful) replies.
I would have been happy to help, but not after being insulted.
Sorry.
sherm--
--
Cocoa programming in Perl: http://camelbones.sourceforge.net
Hire me! My resume: http://www.dot-app.org
------------------------------
Date: Tue, 30 Aug 2005 08:00:02 -0500
From: Tad McClellan <tadmc@augustmail.com>
Subject: Re: Wrote a eBayAPI perl module, how to release it to CPAN?
Message-Id: <slrndh8m2i.te8.tadmc@magna.augustmail.com>
John Bokma <john@castleamber.com> wrote:
> Ignoramus23186 <ignoramus23186@NOSPAM.23186.invalid> wrote:
>> What I recall is that there is a super nice system for making
>> Makefile.PL and whatnot, make test etc. Unfortunately, I forgot the
>> name of that system.
>
> h2xs? And yeah, it's easy to forget :-)
But the Perl FAQ isn't. :-) :-)
perldoc -q 'create a module'
--
Tad McClellan SGML consulting
tadmc@augustmail.com Perl programming
Fort Worth, Texas
------------------------------
Date: Tue, 30 Aug 2005 13:36:56 GMT
From: Peter Scott <Peter@PSDT.com>
Subject: Re: Wrote a eBayAPI perl module, how to release it to CPAN?
Message-Id: <pan.2005.08.30.13.36.40.988903@PSDT.com>
On Mon, 29 Aug 2005 20:57:24 +0000, Ignoramus23186 wrote:
> My question is, how do I make a nice CPAN distribution out of that
> module, so that it installs with MakeMaker, or whatever.
Sam Tregar wrote a good book on this topic, and IMHO it is
underappreciated, so I am glad for the opportunity to plug it:
Writing Perl Modules for CPAN
Sam Tregar
APress
--
Peter Scott
http://www.perlmedic.com/
http://www.perldebugged.com/
------------------------------
Date: Tue, 30 Aug 2005 14:48:51 GMT
From: Ignoramus8644 <ignoramus8644@NOSPAM.8644.invalid>
Subject: Re: Wrote a eBayAPI perl module, how to release it to CPAN?
Message-Id: <nl_Qe.123556$cR1.68162@fe71.usenetserver.com>
I will check it out. I already uploaded my module and will son do
another upload.
i
On Tue, 30 Aug 2005 13:36:56 GMT, Peter Scott <Peter@PSDT.com> wrote:
> On Mon, 29 Aug 2005 20:57:24 +0000, Ignoramus23186 wrote:
>> My question is, how do I make a nice CPAN distribution out of that
>> module, so that it installs with MakeMaker, or whatever.
>
> Sam Tregar wrote a good book on this topic, and IMHO it is
> underappreciated, so I am glad for the opportunity to plug it:
>
> Writing Perl Modules for CPAN
> Sam Tregar
> APress
>
--
------------------------------
Date: 6 Apr 2001 21:33:47 GMT (Last modified)
From: Perl-Users-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 6 Apr 01)
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.
NOTE: due to the current flood of worm email banging on ruby, the smtp
server on ruby has been shut off until further notice.
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.
#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 V10 Issue 8371
***************************************
