[32165] in Perl-Users-Digest
Perl-Users Digest, Issue: 3430 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Fri Jul 1 06:09:25 2011
Date: Fri, 1 Jul 2011 03:09:06 -0700 (PDT)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Fri, 1 Jul 2011 Volume: 11 Number: 3430
Today's topics:
Convert GMT/Zulu time to CDT <dpich@polartel.com>
Re: Convert GMT/Zulu time to CDT <anfi@onet.eu>
Re: Convert GMT/Zulu time to CDT <kst-u@mib.org>
Re: Module to check overlap? <ela@yantai.org>
Re: Module to check overlap? <jurgenex@hotmail.com>
Re: Module to check overlap? <tzz@lifelogs.com>
Re: Module to check overlap? <ela@yantai.org>
Re: Module to check overlap? <bugbear@trim_papermule.co.uk_trim>
perl prevayler? www.prevayler.org <gavcomedy@gmail.com>
Posting Guidelines for comp.lang.perl.misc ($Revision: tadmc@seesig.invalid
Re: read small file, get array of hashes? [newbie] <marc.girod@gmail.com>
Re: upload file rom solaris to debian using perl base i <gavcomedy@gmail.com>
Re: utf-8 of a string <kst-u@mib.org>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Thu, 30 Jun 2011 11:14:39 -0500
From: Don Pich <dpich@polartel.com>
Subject: Convert GMT/Zulu time to CDT
Message-Id: <yrSdnb2v-81yPZHTnZ2dnUVZ_uSdnZ2d@polarcomm.com>
Greetings,
This is a simple question, but it's eluding me. I have data that is
formatted like this:
2011-06-09T06:05:55Z
2011-06-09T06:42:02Z
2011-06-16T05:04:11Z
2011-06-16T09:55:38Z
2011-06-15T22:57:18Z
2011-06-15T22:46:16Z
2011-06-18T02:16:12Z
2011-06-18T02:16:18Z
2011-02-22T19:51:53Z
2011-03-01T05:04:18Z
2011-04-21T07:33:17Z
2011-06-24T18:08:29Z
What is the most effective manner to convert the time portion from GMT/
Zulu time to CDT? I've starting reading CPAN about Time::Piece and also
thought about trying DateTime.
Just wondering if there was any other tricks someone might know of.
Thanks
------------------------------
Date: Thu, 30 Jun 2011 20:09:33 +0200
From: Andrzej Adam Filip <anfi@onet.eu>
Subject: Re: Convert GMT/Zulu time to CDT
Message-Id: <mpz7mnznu2+B6U@valerie.huge.strangled.net>
Don Pich <dpich@polartel.com> wrote:
> Greetings,
>
> This is a simple question, but it's eluding me. I have data that is
> formatted like this:
>
> 2011-06-09T06:05:55Z
> 2011-06-09T06:42:02Z
> 2011-06-16T05:04:11Z
> 2011-06-16T09:55:38Z
> 2011-06-15T22:57:18Z
> 2011-06-15T22:46:16Z
> 2011-06-18T02:16:12Z
> 2011-06-18T02:16:18Z
> 2011-02-22T19:51:53Z
> 2011-03-01T05:04:18Z
> 2011-04-21T07:33:17Z
> 2011-06-24T18:08:29Z
>
> What is the most effective manner to convert the time portion from GMT/
> Zulu time to CDT? I've starting reading CPAN about Time::Piece and also
> thought about trying DateTime.
>
> Just wondering if there was any other tricks someone might know of.
>
> Thanks
use Date::Parse;
use Date::Format;
my $time=str2time('2011-04-21T07:33:17Z'); # function from Date::Parse
print ctime($time,"CDT")'; # function from Date::Format
--
[pl>en Andrew] Andrzej A. Filip : anfi@onet.eu : Andrzej.Filip@gmail.com
"Say yur prayers, yuh flea-pickin' varmint!"
-- Yosemite Sam
------------------------------
Date: Thu, 30 Jun 2011 13:01:04 -0700
From: Keith Thompson <kst-u@mib.org>
Subject: Re: Convert GMT/Zulu time to CDT
Message-Id: <lnei2b6qdb.fsf@nuthaus.mib.org>
Don Pich <dpich@polartel.com> writes:
> Greetings,
>
> This is a simple question, but it's eluding me. I have data that is
> formatted like this:
>
> 2011-06-09T06:05:55Z
> 2011-06-09T06:42:02Z
> 2011-06-16T05:04:11Z
> 2011-06-16T09:55:38Z
> 2011-06-15T22:57:18Z
> 2011-06-15T22:46:16Z
> 2011-06-18T02:16:12Z
> 2011-06-18T02:16:18Z
> 2011-02-22T19:51:53Z
> 2011-03-01T05:04:18Z
> 2011-04-21T07:33:17Z
> 2011-06-24T18:08:29Z
>
> What is the most effective manner to convert the time portion from GMT/
> Zulu time to CDT? I've starting reading CPAN about Time::Piece and also
> thought about trying DateTime.
>
> Just wondering if there was any other tricks someone might know of.
It looks like Andrzej has answered the question you asked, but there are
a couple more questions you should ask yourself.
Do you really want CDT (Central (US) Daylight Time, I presume)? Or do
you want Central Time (which will be CDT or CST, depending on the time
of year)? Or do you want local time?
--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
Nokia
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"
------------------------------
Date: Thu, 30 Jun 2011 13:20:49 -0700
From: "ela" <ela@yantai.org>
Subject: Re: Module to check overlap?
Message-Id: <iugtfd$o9b$1@ijustice.itsc.cuhk.edu.hk>
"Ted Zlatanov" <tzz@lifelogs.com> wrote in message
news:8739iuqjb5.fsf@lifelogs.com...
> On Tue, 28 Jun 2011 12:40:45 -0700 "ela" <ela@yantai.org> wrote:
>
> The set of "completely overlapping" points is the union of your two
> inversion lists.
>
> The set of "partially overlapping" points is the intersection of your
> two inversion lists.
>
> Think of your problem as a set problem, not as operations on ranges.
> Your database ranges and the inversion lists we build from them are just
> representations of the underlying truth. So in terms of sets and set
> membership, what are you missing?
>
> Ted
Take 2 sets as example.
A (100-200, 205, 888-1343, 900-1300)
B (1-777, 1100-5000)
So B's 1-777 completely include A's 100-200 and 205; 1100-5000 partially
includes 888-1343 and 900-1300. The problem is, why the complete inclusion a
union? It seems that 1-777 then becomes a superset, and the intersection for
the latter yields some common elements (in this case 1100-1343, and
1100-1300) here.
Certainly I can loop through two lists and compare all the ranges, but then
it somehow becomes meaningless for most of the ranges when the number grows
large 10^6. I guess you are talking about some convenient feature (union and
intersection) that can help avoid this O(N^2) process but I couldn't find
out exactly how to do (or the exact Perl modules serving the purpose).
------------------------------
Date: Wed, 29 Jun 2011 22:14:35 -0700
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: Module to check overlap?
Message-Id: <l40o079ste8nu1trdp4fh419anv1rhbooh@4ax.com>
"ela" <ela@yantai.org> wrote:
>"Ted Zlatanov" <tzz@lifelogs.com> wrote in message
>> Think of your problem as a set problem, not as operations on ranges.
>> Your database ranges and the inversion lists we build from them are just
>> representations of the underlying truth. So in terms of sets and set
>> membership, what are you missing?
>
>Take 2 sets as example.
>
>A (100-200, 205, 888-1343, 900-1300)
>B (1-777, 1100-5000)
>
>So B's 1-777 completely include A's 100-200 and 205; 1100-5000 partially
>includes 888-1343 and 900-1300. The problem is, why the complete inclusion a
>union? It seems that 1-777 then becomes a superset, and the intersection for
>the latter yields some common elements (in this case 1100-1343, and
>1100-1300) here.
>
>Certainly I can loop through two lists and compare all the ranges, but then
>it somehow becomes meaningless for most of the ranges when the number grows
>large 10^6. I guess you are talking about some convenient feature (union and
>intersection) that can help avoid this O(N^2) process but I couldn't find
>out exactly how to do (or the exact Perl modules serving the purpose).
Your problem is easily solvable in linear time because your ranges are
already sorted by starting value.
Step 1: normalize your two range lists A and B such that each list does
not contain overlapping ranges, e.g. normalize 888-1343, 900-1300 to
just 888-1343. This is simple: if the lower limit of the next range
falls within the previous range or is adjacent to it, then merge the two
ranges with an upper value of the max of both upper values. This is an
O(n) process.
Step 2: walk through both lists synchroniously based on the current
range values, e.g. if the upper value of your current range from list A
is smaller than the lower value of your current range from list B, then
advance to the next range from list A and similar for all other
combinations.
This also is a linear process with O(m+n), because with each iteration
you are eliminating one range from either A or B.
jue
------------------------------
Date: Thu, 30 Jun 2011 07:05:03 -0500
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: Module to check overlap?
Message-Id: <87wrg3y174.fsf@lifelogs.com>
On Thu, 30 Jun 2011 13:20:49 -0700 "ela" <ela@yantai.org> wrote:
e> Take 2 sets as example.
e> A (100-200, 205, 888-1343, 900-1300)
e> B (1-777, 1100-5000)
e> So B's 1-777 completely include A's 100-200 and 205; 1100-5000 partially
e> includes 888-1343 and 900-1300. The problem is, why the complete inclusion a
e> union?
That last sentence is missing a verb somewhere and, unfortunately, is
central to your question.
e> It seems that 1-777 then becomes a superset, and the intersection for
e> the latter yields some common elements (in this case 1100-1343, and
e> 1100-1300) here.
"superset" doesn't mean what you think it means. You need to normalize
your intervals, as Jurgen explained.
e> Certainly I can loop through two lists and compare all the ranges, but then
e> it somehow becomes meaningless for most of the ranges when the number grows
e> large 10^6.
The number of intervals is in the millions? Or elements? It's a linear
operation to do a list intersection in any case, but if you have
millions of intervals you need to be extra careful about your algorithms.
e> I guess you are talking about some convenient feature (union and
e> intersection) that can help avoid this O(N^2) process but I couldn't
e> find out exactly how to do (or the exact Perl modules serving the
e> purpose).
I thought the references were pretty clear. Do you understand:
1) how to normalize your list of intervals (what Jurgen explained)?
Then, how to convert your list of intervals to an inversion list,
assuming you want to use that structure?
2) assuming you can use inversion lists, how to negate an inversion
list? This is an O(1) operation.
3) ditto, how to create the union of two inversion lists? This is an
O(n) operation.
If you can do the 3 things above, you can also find the intersection
because it's the negated union of the two negated source inversion
lists. What part of the above do you have trouble doing? Do you have
trouble with the algorithms or with their implementation in Perl?
If you don't want to use inversion lists because they're too
complicated, use the list of intervals (what Jurgen suggested). It will
work the same way, and you have to answer the same questions. Negation
will be an O(n) operation, though, and it's a little tricky because you
have to pick an arbitrary "infinity" value. Or you could write an
algorithm to do it directly without negation, where you're not doing
pure set operations anymore.
If you're sure all you'll ever need is to find the intersection of your
interval lists, you can write simple single-purpose algorithms to do
just that (which is what Jurgen is suggesting). You're sacrificing
reusability in favor of faster development, which is often a good tradeoff.
Ted
------------------------------
Date: Fri, 1 Jul 2011 13:42:32 -0700
From: "ela" <ela@yantai.org>
Subject: Re: Module to check overlap?
Message-Id: <iujj44$ntg$1@ijustice.itsc.cuhk.edu.hk>
"Ted Zlatanov" <tzz@lifelogs.com> wrote in message
news:87wrg3y174.fsf@lifelogs.com...
> On Thu, 30 Jun 2011 13:20:49 -0700 "ela" <ela@yantai.org> wrote:
>
> e> Take 2 sets as example.
>
> e> A (100-200, 205, 888-1343, 900-1300)
> e> B (1-777, 1100-5000)
>
> e> So B's 1-777 completely include A's 100-200 and 205; 1100-5000
> partially
> e> includes 888-1343 and 900-1300. The problem is, why the complete
> inclusion a
> e> union?
>
> That last sentence is missing a verb somewhere and, unfortunately, is
> central to your question.
Why is the complete inclusion a union?
> e> It seems that 1-777 then becomes a superset, and the intersection for
> e> the latter yields some common elements (in this case 1100-1343, and
> e> 1100-1300) here.
>
> "superset" doesn't mean what you think it means. You need to normalize
> your intervals, as Jurgen explained.
Normalization, although easy, how to distinguish which set(s) of this merged
superset are actually overlapping?
> e> Certainly I can loop through two lists and compare all the ranges, but
> then
> e> it somehow becomes meaningless for most of the ranges when the number
> grows
> e> large 10^6.
>
> The number of intervals is in the millions? Or elements? It's a linear
> operation to do a list intersection in any case, but if you have
> millions of intervals you need to be extra careful about your algorithms.
sorry for being naive in terminology, but for example, I have 1-1000,
2000-3000, 3344-3879, 3668-3854, etc and the number of these intervals is
about a million.
> 3) ditto, how to create the union of two inversion lists? This is an
> O(n) operation.
according to perlmonk reference, they just say "intersection(a, b)", I can't
find this function in Perl and unfortunately since these are ranges but not
discrete numbers, for loops to exhaust all elements obviously is not the
answer.
> If you don't want to use inversion lists because they're too
> complicated, use the list of intervals (what Jurgen suggested). It will
> work the same way, and you have to answer the same questions. Negation
> will be an O(n) operation, though, and it's a little tricky because you
> have to pick an arbitrary "infinity" value. Or you could write an
> algorithm to do it directly without negation, where you're not doing
> pure set operations anymore.
>
If I go for the simpler solution, I still don't know how to work on
"normalized" intervals... Maybe it's too difficult for a life scientist to
go for programming without formal training...
------------------------------
Date: Fri, 01 Jul 2011 09:21:26 +0100
From: bugbear <bugbear@trim_papermule.co.uk_trim>
Subject: Re: Module to check overlap?
Message-Id: <Mu6dndxND9IbHpDTnZ2dnUVZ8l2dnZ2d@brightview.co.uk>
ela wrote:
> If I go for the simpler solution, I still don't know how to work on
> "normalized" intervals... Maybe it's too difficult for a life scientist to
> go for programming without formal training...
If only there were some way to mix the two...
http://en.wikipedia.org/wiki/Computational_biology
BugBear
------------------------------
Date: Thu, 30 Jun 2011 23:08:19 -0700 (PDT)
From: gavino <gavcomedy@gmail.com>
Subject: perl prevayler? www.prevayler.org
Message-Id: <00981bcc-9b56-4bd3-a906-b1f344cede87@s33g2000prg.googlegroups.com>
even ncier without any oo bs
can someone translate this to perl?
transactions log to disk
updates n queries on in memory data
dump all in memory data once an hour or so
throw away postgresql/oracle/other shit
------------------------------
Date: Fri, 01 Jul 2011 02:16:59 -0500
From: tadmc@seesig.invalid
Subject: Posting Guidelines for comp.lang.perl.misc ($Revision: 1.9 $)
Message-Id: <HKidncW2G8z26ZDTnZ2dnUVZ5tCdnZ2d@giganews.com>
Outline
Before posting to comp.lang.perl.misc
Must
- Check the Perl Frequently Asked Questions (FAQ)
- Check the other standard Perl docs (*.pod)
Really Really Should
- Lurk for a while before posting
- Search a Usenet archive
If You Like
- Check Other Resources
Posting to comp.lang.perl.misc
Is there a better place to ask your question?
- Question should be about Perl, not about the application area
How to participate (post) in the clpmisc community
- Carefully choose the contents of your Subject header
- Use an effective followup style
- Speak Perl rather than English, when possible
- Ask perl to help you
- Do not re-type Perl code
- Provide enough information
- Do not provide too much information
- Do not post binaries, HTML, or MIME
Social faux pas to avoid
- Asking a Frequently Asked Question
- Asking a question easily answered by a cursory doc search
- Asking for emailed answers
- Beware of saying "doesn't work"
- Sending a "stealth" Cc copy
Be extra cautious when you get upset
- Count to ten before composing a followup when you are upset
- Count to ten after composing and before posting when you are upset
-----------------------------------------------------------------
Posting Guidelines for comp.lang.perl.misc ($Revision: 1.9 $)
This newsgroup, commonly called clpmisc, is a technical newsgroup
intended to be used for discussion of Perl related issues (except job
postings), whether it be comments or questions.
As you would expect, clpmisc discussions are usually very technical in
nature and there are conventions for conduct in technical newsgroups
going somewhat beyond those in non-technical newsgroups.
The article at:
http://www.catb.org/~esr/faqs/smart-questions.html
describes how to get answers from technical people in general.
This article describes things that you should, and should not, do to
increase your chances of getting an answer to your Perl question. It is
available in POD, HTML and plain text formats at:
http://www.rehabitation.com/clpmisc.shtml
For more information about netiquette in general, see the "Netiquette
Guidelines" at:
http://andrew2.andrew.cmu.edu/rfc/rfc1855.html
A note to newsgroup "regulars":
Do not use these guidelines as a "license to flame" or other
meanness. It is possible that a poster is unaware of things
discussed here. Give them the benefit of the doubt, and just
help them learn how to post, rather than assume that they do
know and are being the "bad kind" of Lazy.
A note about technical terms used here:
In this document, we use words like "must" and "should" as
they're used in technical conversation (such as you will
encounter in this newsgroup). When we say that you *must* do
something, we mean that if you don't do that something, then
it's unlikely that you will benefit much from this group.
We're not bossing you around; we're making the point without
lots of words.
Do *NOT* send email to the maintainer of these guidelines. It will be
discarded unread. The guidelines belong to the newsgroup so all
discussion should appear in the newsgroup. I am just the secretary that
writes down the consensus of the group.
Before posting to comp.lang.perl.misc
Must
This section describes things that you *must* do before posting to
clpmisc, in order to maximize your chances of getting meaningful replies
to your inquiry and to avoid getting flamed for being lazy and trying to
have others do your work.
The perl distribution includes documentation that is copied to your hard
drive when you install perl. Also installed is a program for looking
things up in that (and other) documentation named 'perldoc'.
You should either find out where the docs got installed on your system,
or use perldoc to find them for you. Type "perldoc perldoc" to learn how
to use perldoc itself. Type "perldoc perl" to start reading Perl's
standard documentation.
Check the Perl Frequently Asked Questions (FAQ)
Checking the FAQ before posting is required in Big 8 newsgroups in
general, there is nothing clpmisc-specific about this requirement.
You are expected to do this in nearly all newsgroups.
You can use the "-q" switch with perldoc to do a word search of the
questions in the Perl FAQs.
Check the other standard Perl docs (*.pod)
The perl distribution comes with much more documentation than is
available for most other newsgroups, so in clpmisc you should also
see if you can find an answer in the other (non-FAQ) standard docs
before posting.
It is *not* required, or even expected, that you actually *read* all of
Perl's standard docs, only that you spend a few minutes searching them
before posting.
Try doing a word-search in the standard docs for some words/phrases
taken from your problem statement or from your very carefully worded
"Subject:" header.
Really Really Should
This section describes things that you *really should* do before posting
to clpmisc.
Lurk for a while before posting
This is very important and expected in all newsgroups. Lurking means
to monitor a newsgroup for a period to become familiar with local
customs. Each newsgroup has specific customs and rituals. Knowing
these before you participate will help avoid embarrassing social
situations. Consider yourself to be a foreigner at first!
Search a Usenet archive
There are tens of thousands of Perl programmers. It is very likely
that your question has already been asked (and answered). See if you
can find where it has already been answered.
One such searchable archive is:
http://groups.google.com/advanced_search
If You Like
This section describes things that you *can* do before posting to
clpmisc.
Check Other Resources
You may want to check in books or on web sites to see if you can
find the answer to your question.
But you need to consider the source of such information: there are a
lot of very poor Perl books and web sites, and several good ones
too, of course.
Posting to comp.lang.perl.misc
There can be 200 messages in clpmisc in a single day. Nobody is going to
read every article. They must decide somehow which articles they are
going to read, and which they will skip.
Your post is in competition with 199 other posts. You need to "win"
before a person who can help you will even read your question.
These sections describe how you can help keep your article from being
one of the "skipped" ones.
Is there a better place to ask your question?
Question should be about Perl, not about the application area
It can be difficult to separate out where your problem really is,
but you should make a conscious effort to post to the most
applicable newsgroup. That is, after all, where you are the most
likely to find the people who know how to answer your question.
Being able to "partition" a problem is an essential skill for
effectively troubleshooting programming problems. If you don't get
that right, you end up looking for answers in the wrong places.
It should be understood that you may not know that the root of your
problem is not Perl-related (the two most frequent ones are CGI and
Operating System related), so off-topic postings will happen from
time to time. Be gracious when someone helps you find a better place
to ask your question by pointing you to a more applicable newsgroup.
How to participate (post) in the clpmisc community
Carefully choose the contents of your Subject header
You have 40 precious characters of Subject to win out and be one of
the posts that gets read. Don't waste them. Take care while
composing them, they are the key that opens the door to getting an
answer.
Spend them indicating what aspect of Perl others will find if they
should decide to read your article.
Do not spend them indicating "experience level" (guru, newbie...).
Do not spend them pleading (please read, urgent, help!...).
Do not spend them on non-Subjects (Perl question, one-word
Subject...)
For more information on choosing a Subject see "Choosing Good
Subject Lines":
http://www.cpan.org/authors/id/D/DM/DMR/subjects.post
Part of the beauty of newsgroup dynamics, is that you can contribute
to the community with your very first post! If your choice of
Subject leads a fellow Perler to find the thread you are starting,
then even asking a question helps us all.
Use an effective followup style
When composing a followup, quote only enough text to establish the
context for the comments that you will add. Always indicate who
wrote the quoted material. Never quote an entire article. Never
quote a .signature (unless that is what you are commenting on).
Intersperse your comments *following* each section of quoted text to
which they relate. Unappreciated followup styles are referred to as
"top-posting", "Jeopardy" (because the answer comes before the
question), or "TOFU" (Text Over, Fullquote Under).
Reversing the chronology of the dialog makes it much harder to
understand (some folks won't even read it if written in that style).
For more information on quoting style, see:
http://web.presby.edu/~nnqadmin/nnq/nquote.html
Speak Perl rather than English, when possible
Perl is much more precise than natural language. Saying it in Perl
instead will avoid misunderstanding your question or problem.
Do not say: I have variable with "foo\tbar" in it.
Instead say: I have $var = "foo\tbar", or I have $var = 'foo\tbar',
or I have $var = <DATA> (and show the data line).
Ask perl to help you
You can ask perl itself to help you find common programming mistakes
by doing two things: enable warnings (perldoc warnings) and enable
"strict"ures (perldoc strict).
You should not bother the hundreds/thousands of readers of the
newsgroup without first seeing if a machine can help you find your
problem. It is demeaning to be asked to do the work of a machine. It
will annoy the readers of your article.
You can look up any of the messages that perl might issue to find
out what the message means and how to resolve the potential mistake
(perldoc perldiag). If you would like perl to look them up for you,
you can put "use diagnostics;" near the top of your program.
Do not re-type Perl code
Use copy/paste or your editor's "import" function rather than
attempting to type in your code. If you make a typo you will get
followups about your typos instead of about the question you are
trying to get answered.
Provide enough information
If you do the things in this item, you will have an Extremely Good
chance of getting people to try and help you with your problem!
These features are a really big bonus toward your question winning
out over all of the other posts that you are competing with.
First make a short (less than 20-30 lines) and *complete* program
that illustrates the problem you are having. People should be able
to run your program by copy/pasting the code from your article. (You
will find that doing this step very often reveals your problem
directly. Leading to an answer much more quickly and reliably than
posting to Usenet.)
Describe *precisely* the input to your program. Also provide example
input data for your program. If you need to show file input, use the
__DATA__ token (perldata.pod) to provide the file contents inside of
your Perl program.
Show the output (including the verbatim text of any messages) of
your program.
Describe how you want the output to be different from what you are
getting.
If you have no idea at all of how to code up your situation, be sure
to at least describe the 2 things that you *do* know: input and
desired output.
Do not provide too much information
Do not just post your entire program for debugging. Most especially
do not post someone *else's* entire program.
Do not post binaries, HTML, or MIME
clpmisc is a text only newsgroup. If you have images or binaries
that explain your question, put them in a publically accessible
place (like a Web server) and provide a pointer to that location. If
you include code, cut and paste it directly in the message body.
Don't attach anything to the message. Don't post vcards or HTML.
Many people (and even some Usenet servers) will automatically filter
out such messages. Many people will not be able to easily read your
post. Plain text is something everyone can read.
Social faux pas to avoid
The first two below are symptoms of lots of FAQ asking here in clpmisc.
It happens so often that folks will assume that it is happening yet
again. If you have looked but not found, or found but didn't understand
the docs, say so in your article.
Asking a Frequently Asked Question
It should be understood that you may have missed the applicable FAQ
when you checked, which is not a big deal. But if the Frequently
Asked Question is worded similar to your question, folks will assume
that you did not look at all. Don't become indignant at pointers to
the FAQ, particularly if it solves your problem.
Asking a question easily answered by a cursory doc search
If folks think you have not even tried the obvious step of reading
the docs applicable to your problem, they are likely to become
annoyed.
If you are flamed for not checking when you *did* check, then just
shrug it off (and take the answer that you got).
Asking for emailed answers
Emailed answers benefit one person. Posted answers benefit the
entire community. If folks can take the time to answer your
question, then you can take the time to go get the answer in the
same place where you asked the question.
It is OK to ask for a *copy* of the answer to be emailed, but many
will ignore such requests anyway. If you munge your address, you
should never expect (or ask) to get email in response to a Usenet
post.
Ask the question here, get the answer here (maybe).
Beware of saying "doesn't work"
This is a "red flag" phrase. If you find yourself writing that,
pause and see if you can't describe what is not working without
saying "doesn't work". That is, describe how it is not what you
want.
Sending a "stealth" Cc copy
A "stealth Cc" is when you both email and post a reply without
indicating *in the body* that you are doing so.
Be extra cautious when you get upset
Count to ten before composing a followup when you are upset
This is recommended in all Usenet newsgroups. Here in clpmisc, most
flaming sub-threads are not about any feature of Perl at all! They
are most often for what was seen as a breach of netiquette. If you
have lurked for a bit, then you will know what is expected and won't
make such posts in the first place.
But if you get upset, wait a while before writing your followup. I
recommend waiting at least 30 minutes.
Count to ten after composing and before posting when you are upset
After you have written your followup, wait *another* 30 minutes
before committing yourself by posting it. You cannot take it back
once it has been said.
AUTHOR
Tad McClellan and many others on the comp.lang.perl.misc newsgroup.
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.liamg\100cm.j.dat/"
The above message is a Usenet post.
I don't recall having given anyone permission to use it on a Web site.
------------------------------
Date: Thu, 30 Jun 2011 02:39:41 -0700 (PDT)
From: Marc Girod <marc.girod@gmail.com>
Subject: Re: read small file, get array of hashes? [newbie]
Message-Id: <dd8489e4-1ae2-42c1-8fe4-94b786e7b112@x1g2000yqa.googlegroups.com>
On Jun 27, 8:07=A0pm, gry <georgeryo...@gmail.com> wrote:
> =A0 Reference found where even-sized list expected
You try to assign a hash reference to a hash.
Perl complains that it expects an 'even-sized list', and it finds only
one 'reference'.
Try instead:
my $test =3D $tests[1];
print 'dbname of tests[1]=3D', $test->{'dbname'}, "\n";
Marc
------------------------------
Date: Wed, 29 Jun 2011 13:58:39 -0700 (PDT)
From: gavino <gavcomedy@gmail.com>
Subject: Re: upload file rom solaris to debian using perl base install
Message-Id: <c3ddc4f8-820c-4f01-8f9e-e1b6cb6995be@v11g2000prn.googlegroups.com>
On Jun 17, 8:57=A0pm, gavino <gavcom...@gmail.com> wrote:
> how?
>
> I tried fo rhours to piece this one together.
>
> Whew
>
> it seems u need a cgi on box 2 to accept some kinda wget uplaod from
> box1
>
> by the way I am not allowed anything but base perl 5.10 with cgi.pm
> and wget
>
> no curl
>
> on soalris 10 box1
>
> have to upload files to webserver on debian box2
>
> how?
>
> read about 30 pages mostly with upload forms
>
> I want to command line script this and put in cron on box1
>
> lighttps on debian is also annoying as docs are light for cgi
what I need for cron automated command line job is this translated
into perl:
<html><head><title>Post Upload Tool</title><body>
<?php
$filename =3D $_POST['filename'];
$filedata =3D base64_decode($_POST['filedata']);
echo "<h1>$filename</h1>";
$fout =3D fopen($filename,"wb");
fwrite($fout, $filedata);
fclose($fout);
?>
</body></html>
http://www.noah.org/wiki/WGET_CGI_Post
the upload part on the client is
#!/usr/bin/env python
import sys, urllib, base64
input_filename =3D sys.argv[1]
postwad_filename =3D input_filename + ".post"
datawad =3D base64.encodestring(file(input_filename, "rb").read())
postwad =3D urllib.urlencode({"filedata":datawad,
"filename":input_filename})
file(postwad_filename, "wb").write(postwad)
print postwad_filename
and upload command is
wget --post-file=3D`./postencode.py FILENAME` http://www.example.com/upload=
.php
server sadly has no php
------------------------------
Date: Thu, 30 Jun 2011 12:58:42 -0700
From: Keith Thompson <kst-u@mib.org>
Subject: Re: utf-8 of a string
Message-Id: <lniprn6qh9.fsf@nuthaus.mib.org>
"dn.perl@gmail.com" <dn.perl@gmail.com> writes:
> I am asking part one of my questions here because I do not know where
> else to ask it.
> I have been sent a string in some language whose alphabet
> is not known to me. How can I find utf-8 representation
> of this string?
[...]
Do you really have just a single string in an unknown alphabet?
If so, why is asking whoever sent it to you not a solution?
Or are you expecting to be sent multiple strings? Are they all going
to be in the same alphabet, or are they going to be in different
alphabets? What assumptions, if any, can you reasonably make?
Are there any limitations on the possible set of encodings?
How exactly are these strings represented? Where are they coming
from? Why isn't whatever entity is providing them to you also
telling you how to interpret them?
There is no basis in the information you've given us for guessing
how to decode these strings. They may be in the information you
haven't given us.
--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
Nokia
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"
------------------------------
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:
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
Back issues are available via anonymous ftp from
ftp://cil-www.oce.orst.edu/pub/perl/old-digests.
#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 V11 Issue 3430
***************************************
