[31884] in Perl-Users-Digest
Perl-Users Digest, Issue: 3147 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sun Sep 26 21:09:27 2010
Date: Sun, 26 Sep 2010 18:09:11 -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 Sun, 26 Sep 2010 Volume: 11 Number: 3147
Today's topics:
Re: Long script "just stops" sometime <xhoster@gmail.com>
Re: Long script "just stops" sometime <ben@morrow.me.uk>
Re: Removing tag + closing tag sln@netherlands.com
Re: toy list processing problem: collect similar terms <usenet@bitblocks.com>
Re: toy list processing problem: collect similar terms <jurgenex@hotmail.com>
Re: toy list processing problem: collect similar terms <rhodri@wildebst.demon.co.uk>
Re: toy list processing problem: collect similar terms <es@ertes.de>
Re: toy list processing problem: collect similar terms <es@ertes.de>
Re: toy list processing problem: collect similar terms <ben@morrow.me.uk>
Re: why does this happen? <jurgenex@hotmail.com>
Re: why does this happen? <hadronquark@gmail.com>
Re: why does this happen? <hadronquark@gmail.com>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sun, 26 Sep 2010 16:06:36 -0700
From: Xho Jingleheimerschmidt <xhoster@gmail.com>
Subject: Re: Long script "just stops" sometime
Message-Id: <4c9fd4e7$0$20863$ed362ca5@nr5-q3a.newsreader.com>
Peter J. Holzer wrote:
> On 2010-09-25 20:50, Ilya Zakharevich <nospam-abuse@ilyaz.org> wrote:
>> On 2010-09-24, Jerry Krinock <jerrykrinock@gmail.com> wrote:
>>> operation, I find that its CPU and memory usage are hardly noticeable,
>>> maybe 3% and a few tens of megabytes.
>>>
>>> Are there any conditions under which Perl would "just stop"?
>> With no CPU usage? I would say it reads from STDIN. Did you try to
>> press Enter or C-d?
>
> Two tools I find indispensable when trying to figure out "strange"
> behaviour of programs are lsof and strace.
>
> lsof lists the open files of a process. It has been ported to lots of
> unixoid systems (I first encountered it on HP-UX) and should be
> available on MacOS.
>
> strace prints out the system calls a process invokes. Unfortunately,
> while most unixoid systems have a program which does this, it seems to
> have a different name on each ("truss" on Solaris, "tusc" on HP-UX, ...)
> so the OP will have to find out himself how its called on MacOS.
>
> In this case, if your guess is right, strace would show that the process
> is currently waiting for a read on fd 0 to complete, and then lsof could
> be used to find out which file fd 0 is (ok, so for fd 0 you may know
> that it's the tty, for for (say) fd 43 you want a tool to look it up).
Unfortunately, if you use strace "-p" option to attach to an
already-running process, if often doesn't show you what call the process
was waiting on at the time of the attachment. You would have to start
stracing the process from the beginning, which is inconvenient if the
situation at question only happens occasionally.
Xho
------------------------------
Date: Mon, 27 Sep 2010 00:56:38 +0100
From: Ben Morrow <ben@morrow.me.uk>
Subject: Re: Long script "just stops" sometime
Message-Id: <m635n7-9og1.ln1@osiris.mauzo.dyndns.org>
Quoth Xho Jingleheimerschmidt <xhoster@gmail.com>:
> Peter J. Holzer wrote:
>
> Unfortunately, if you use strace "-p" option to attach to an
> already-running process, if often doesn't show you what call the process
> was waiting on at the time of the attachment. You would have to start
> stracing the process from the beginning, which is inconvenient if the
> situation at question only happens occasionally.
You can find out what call the process is currently blocking in with ps.
Ben
------------------------------
Date: Sun, 26 Sep 2010 15:14:41 -0700
From: sln@netherlands.com
Subject: Re: Removing tag + closing tag
Message-Id: <qvdv96pk1faomm46d5simcoudovb5ktaj1@4ax.com>
On Fri, 24 Sep 2010 12:14:24 +0100, Ben Morrow <ben@morrow.me.uk> wrote:
>Just for fun, here's a not-quite-complete but otherwise correct (modulo
>bugs, obviously) implementation of an XML parser as a single regex (I
>omitted PIs and DTDs, since they added about as many productions again).
>It's not terribly useful as it stands (it just tells you if a given
>string contains a valid XML document or not) but it could be made to
>build a parse tree fairly easily using (?{}) (subject to the usual
>caveats with that construction).
>
Thanks for this Ben.
I like the way you put this together, following the naming of
the w3c xml 1.1 recommendations document
http://www.w3.org/TR/xml11/#NT-AttValue
There are a few missing things but all in all, its pretty good.
I tried it out and discovered some issues using recursion on it,
with the xml standard goals.
I'll just note the issues on the sections, then have a full demo
of your regex, modified (below). The focus is on elements and nesting mostly.
Also included is a proof of concept (the small sample code), of element
nesting and recursion.
I haven't checked out everything, but it looks fairly conformative to the
xml 1.1 recommendations. Many test cases would have to be developed.
But, in any case, the Perl 5.10 engine is still lacking, the (?{ code })
is perilous, and I hope to see some improvements in version 6.
How you had the patience to put this together is anybodys guess, but thanks.
Btw, I don't hold out a lot of hope on the speed. I could be wrong, and I will
have to check that.
-sln
------------------------
>m(
> (?&document)
>
> (?(DEFINE)
>
> # Document
>
> (?<document>
> (?&prolog) (?&element) (?&Misc)*
needs to be a check for root content here (see code)
> )
>
> # Character sets
>
> (?<Char>
> [\x9-\xA\xD\x20-\x7E\x85\xA0-\x{D7FF}] |
[\x9] style doesen't work for my version, [\x{9}] does
> [\x{E000}-\x{FFFD}\x{10000}-\x{10FFFF}]
> )
> (?<S> [\x20\x9\xD\xA]+ )
>
[snip Names, Comments]
> # Prolog
>
> (?<prolog> (?&XMLDecl) (?&Misc)* )
> (?<XMLDecl>
> <\?xml (?&VersionInfo) (?&EncodingDecl)? (?&S)? \?>
there needs to be more options in the xml declaration body and
not sure but also there might also be <?xml-stylesheet ... ?>
> )
> (?<Misc> (?&Comment) | (?&S) )
> (?<Eq> (?&S)? = (?&S)? )
>
> (?<VersionInfo> (?&S) version (?&Eq) (?: '1\.[10]' | "1\.[10]" ) )
>
> (?<EncodingDecl>
> (?&S) encoding (?&Eq) (?: "(?&EncName)" | '(?&EncName)' )
> )
> (?<EncName> [A-Za-z] (?: [A-Za-z0-9._-] )* )
>
[snip CDATA]
> # Element
>
> (?<element> (?&EmptyElemTag) | (?&STag) (?&content) (?&ETag) )
^^^^
This is a big problem. As it is now, any </tag> end tag can satisfy,
or balance any <tag> start tag. Should there be a *counter* imbalance
later, sucessfull recursive matching will occurr (on the whole).
There is a balance, but only with start and end tags, tag names are not.
This matches:
<A> content </B>
A *better* scheme is to match with a backreference (see code).
The really bad problem is if there is not a sucessfull match in
the code path (?&ETag), the engine will sit in a infinite backtracking loop
recursing the same element. Consider this:
<A> <B> </A> <C> </C>
This can be fixed with backreference or'd with some verbs (*COMMIT)(?{ msg })(*FAIL)
(see code).
>
> (?<STag> < (?&Name) (?: (?&S) (?&Attribute) )* (?&S)? > )
> (?<Attribute> (?&Name) (?&Eq) (?&AttValue) )
> (?<ETag> </ (?&Name) (?&S)? > )
>
> (?<AttValue>
> " (?: [^<&"] | (?&Reference) )* " |
> ' (?: [^<&'] | (?&Reference) )* '
> )
>
[snip content, empty elements, references]
>)xs
Test of balanced named tags (proof of concept)
----------------------
use strict;
use warnings;
use re 'eval';
##
my $xml=<<EXML;
<aa> textaa
<bb> textbb
<cc> textbb
</cc>
</bb>
end textaa
</aa>
EXML
##
my $regx = qr/
(?:
( #1
# Start tag
< (?<name> [a-z]+ ) >
(?{ print "our name is $+{name}\n" })
# content
(?:
(?> (?: (?! <[a-z]+> | <\/[a-z]+> ) .)+ )
| (?1)
)*
(?{ print "we need $+{name}\n" })
# End tag
<\/ \k<name> >
(?{ print "have $+{name}\n" })
)
(?{print "\nmatched: \n$^N\n\n" })
|
.
)+
/xs;
##
if ( $xml =~ /$regx/ )
{
print "yes, valid xml\n";
}
__END__
Modified of your single regex validation focusing on
elements, nesting and root content.
All the prints could be taken out, whats left is the recursion
fixes.
--------------------
use strict;
use warnings;
use re 'eval';
##
my @atts;
my ($atn,$atv);
my $indent = 0;
my $rxml = qr(
(?&document)
(?(DEFINE)
# Document
(?<document>
(?&prolog) (?&element) (?&Misc)*
(?: (?! .)
| (?<_rootcontent> .*? ) (?&S)? $
(*COMMIT)
(?{ print "\n!! FAILED !! content at root level '$+{_rootcontent}'",
" pos ",(pos),"\n" })
(*FAIL)
)
)
# Character sets
(?<Char>
[\x{9}-\x{A}\x{D}\x{20}-\x{7E}\x{85}\x{A0}-\x{D7FF}] |
[\x{E000}-\x{FFFD}\x{10000}-\x{10FFFF}]
)
(?<S> [\x{20}\x{9}\x{D}\x{A}]+ )
# Names
(?<NameStartChar>
[:A-Z_a-z\x{C0}-\x{D6}\x{D8}-\x{F6}\x{F8}-\x{2FF}\x{370}-\x{37D}] |
[\x{37F}-\x{1FFF}\x{200C}-\x{200D}\x{2070}-\x{218F}] |
[\x{2C00}-\x{2FEF}\x{3001}-\x{D7FF}\x{F900}-\x{FDCD}] |
[\x{FDF0}-\x{FFFD}\x{10000}-\x{EFFFF}]
)
(?<NameChar>
(?&NameStartChar) |
[-.0-9\xB7\x{0300}-\x{036F}\x{203F}-\x{2040}]
)
(?<Name> (?&NameStartChar) (?&NameChar)* )
(?<Names> (?&Name) (?: \x20 (?&Name) )* )
# Comments
(?<Comment>
<!-- (?:
(?: (?! - ) (?&Char) ) |
(?: - (?! - ) (?&Char) )
)* -->
)
# Prolog
(?<prolog> (?&XMLDecl) (?&Misc)* )
(?<XMLDecl>
<\?xml (?&VersionInfo) (?&EncodingDecl)? (?&S)? \?>
)
(?<Misc> (?&Comment) | (?&S) )
(?<Eq> (?&S)? = (?&S)? )
(?<VersionInfo> (?&S) version (?&Eq) (?: '1\.[10]' | "1\.[10]" ) )
(?<EncodingDecl>
(?&S) encoding (?&Eq) (?: "(?&EncName)" | '(?&EncName)' )
)
(?<EncName> [A-Za-z] (?: [A-Za-z0-9._-] )* )
# CDATA sections
(?<CDSect> (?&CDStart) (?&CData) (?&CDEnd) )
(?<CDStart> <!\[CDATA\[ )
(?<CData> (?: (?! \]\]> ) (?&Char) )* )
(?<CDEnd> \]\]> )
# Element
(?<element>
(?&EmptyElemTag)
| (?<STag>
< (?<_Stname> (?&Name) ) (?{ @atts=() })
(?: (?&S) (?&Attribute) )* (?&S)?
>
(?{ print '. 'x$indent, $+{_Stname},"\n";
print ' 'x$indent, " $atn -> $atv\n" while ($atn,$atv) = splice(@atts,0,2)
})
(?{ ++$indent })
)
(?&content)
(?<ETag>
</ \k<_Stname> (?&S)? > (?{ --$indent })
| (*COMMIT)
(?{ print "\n!! FAILED !! expected end tag </$+{_Stname}> at pos ",(pos),"\n" })
(*FAIL)
)
)
(?<Attribute> (?<_atn> (?&Name) )
(?&Eq)
(?<_atv> (?&AttValue) )
(?{ push @atts, $+{_atn},$+{_atv} })
)
(?<AttValue>
" (?: [^<&"] | (?&Reference) )* " |
' (?: [^<&'] | (?&Reference) )* '
)
# Content of elements
(?<content>
(?&CharData)? (?:
(?: (?&element) | (?&Reference) | (?&CDSect) |
(?&Comment)
)
(?&CharData)?
)*
)
(?<CharData> (?! [^<&]* \]\]> [^<&]* ) [^<&]* )
# Empty elements
(?<EmptyElemTag>
< (?<_EStname> (?&Name) ) (?{ @atts=() })
(?: (?&S) (?&Attribute) )* (?&S)?
/>
(?{ print '. 'x$indent, "$+{_EStname}\n";
print ' 'x$indent, " $atn -> $atv\n" while ($atn,$atv) = splice(@atts,0,2);
print ' 'x$indent, "/\n";
})
)
# Character reference
(?<Reference> (?&EntityRef) | (?&CharRef) )
(?<CharRef> &\# [0-9]+ ; | &\#x [0-9a-fA-F]+ ; )
(?<EntityRef> & (?&Name) ; )
)
)xs;
##
my $xml = join '', <DATA>;
if ($xml =~ /$rxml/)
{
print "\nValid xml!\n";
}
else {
print "\nXml not valid.\n";
}
##
__DATA__
<?xml version="1.0" encoding="UTF-8"?>
<DATA>
<test name = " thi> is a " />
<SubData>
<a/> href=" > "
<here n="------------">
<IMG SRC = "foo.gif" ALT = "A \">
<IMG SRC = "foo.gif"
ALT = "A > B">
<!-- <A comment> -->
<tagme src = "a > b" dst = "c > d" >
<![CDATA[ This </DATA> ]]>
</tagme>
</IMG>
</IMG>
</here>
<script>
hello if (a < b && a > c)
</script>
<!-- This section commented out.
<B>You can't see me!</B>
-->
<here n="+++++++++++">
<TEST SRC = "foo.gif" />
<tag0>
<sp> </sp>
<tag1/>
</tag0>
</here>
</SubData>
<this></this>
<test name = " near end " />
</DATA>
------------------------------
Date: Sun, 26 Sep 2010 15:10:46 -0700
From: Bakul Shah <usenet@bitblocks.com>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <4C9FC4E6.3030405@bitblocks.com>
On 9/25/10 9:05 PM, Xah Lee wrote:
> here's a interesting toy list processing problem.
>
> I have a list of lists, where each sublist is labelled by
> a number. I need to collect together the contents of all sublists
> sharing
> the same label. So if I have the list
>
> ((0 a b) (1 c d) (2 e f) (3 g h) (1 i j) (2 k l) (4 m n) (2 o p) (4 q
> r) (5 s t))
>
> where the first element of each sublist is the label, I need to
> produce:
>
> output:
> ((a b) (c d i j) (e f k l o p) (g h) (m n q r) (s t))
...
> anyone care to give a solution in Python, Perl, javascript, or other
> lang? am guessing the scheme solution can be much improved... perhaps
> using some lib but that seems to show scheme is pretty weak if the lib
> is non-standard.
In Q (from kx.com)[1]:
x:((0; "a"; "b");(1; "c"; "d");(2; "e"; "f");(3; "g"; "h");(1; "i"; "j")
(2; "k"; "l");(4; "m"; "n");(2; "o"; "p");(4; "q"; "r");(5; "s"; "t"))
f:{each [,/] each [each [1 _]] x @ value group x[;0]}
f x
outputs
"ab"
"cdij"
"efklop"
"gh"
"mnqr"
"st"
Note that this is actually a pretty general solution in that *all*
the functions used in it operate on a variety of types.
- The label could be anything, not just an integer.
- What follows a label can be a list of anything.
- Everything, except for = (the group function), has to do with
*shaping* the output in the way you want. It is all basically
cut-n-paste or pulling apart your Lego blocks and constructing
a new toy from them! And most languages are really poor at that.
*This* is why proponents of various languages should pay attention
to such problems.
----
[1] In k3 (an older language from kx.com that you may be able to find
online), x is the same but f is as follows:
f:{,/'1_''x@=x[;0]}
------------------------------
Date: Sun, 26 Sep 2010 15:16:24 -0700
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <t2hv965ieq3m0acd5fpviu0ko1530518j1@4ax.com>
John Bokma <john@castleamber.com> wrote:
>Jürgen Exner <jurgenex@hotmail.com> writes:
>
>> livibetter <livibetter@gmail.com> wrote:
>>>Here is mine for Python:
>>
>> What the f*** does Python have to do with Perl?
>
>Clueless fuck. I unsubscribed from comp.lang.perl.misc to avoid the
>retards like you and now you come in via the backdoor. If you have a
>problem with Xah report him with Google Groups and with his hosting
>provider 1&1 like I do. Dreamhost kicked him out that way.
I have solved my problems with Xah years ago, that's what killfiles are
for. And I have no idea why you are bringing up Xah in your current
rant.
It was livibetter who without any motivation or reasoning posted Python
code in CLPM. If at least he had asked something like "How can I write
something similar in Perl?" or _ANYTHING_ that would have made this even
remotely meaningful for CLPM, then ok.
But he didn't. He just dumped 7 lines of Python code to CLPM and his
only comment was "Here is mine for Python". Yeah, great comment. Why
would anyone in CLPM possibly care about those 7 lines of Phython code?
jue
jue
------------------------------
Date: Mon, 27 Sep 2010 00:19:58 +0100
From: "Rhodri James" <rhodri@wildebst.demon.co.uk>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <op.vjnxrkjta8ncjz@gnudebst>
On Sun, 26 Sep 2010 23:16:24 +0100, Jürgen Exner <jurgenex@hotmail.com>
wrote:
> I have solved my problems with Xah years ago, that's what killfiles are
> for. And I have no idea why you are bringing up Xah in your current
> rant.
>
> It was livibetter who without any motivation or reasoning posted Python
> code in CLPM. If at least he had asked something like "How can I write
> something similar in Perl?" or _ANYTHING_ that would have made this even
> remotely meaningful for CLPM, then ok.
> But he didn't. He just dumped 7 lines of Python code to CLPM and his
> only comment was "Here is mine for Python". Yeah, great comment. Why
> would anyone in CLPM possibly care about those 7 lines of Phython code?
Check the Newsgroups line: this is a standard Xah "cross-post to
everywhere in sight" troll. Hence (a) bringing up Xah, since he
originated this thread, and (b) livibetter not thinking to trim the
crossposts. Which you didn't either, I note.
The only downside to killfiles is that you have to pay attention or
you sometimes get bitten by this stuff.
--
Rhodri James *-* Wildebeest Herder to the Masses
------------------------------
Date: Mon, 27 Sep 2010 01:41:37 +0200
From: Ertugrul =?UTF-8?B?U8O2eWxlbWV6?= <es@ertes.de>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <20100927014137.41627b49@tritium.streitmacht.eu>
Xah Lee <xahlee@gmail.com> wrote:
> here's a interesting toy list processing problem.
>
> I have a list of lists, where each sublist is labelled by a number. I
> need to collect together the contents of all sublists sharing the same
> label. So if I have the list
>
> ((0 a b) (1 c d) (2 e f) (3 g h) (1 i j) (2 k l) (4 m n) (2 o p) (4 q
> r) (5 s t))
>
> where the first element of each sublist is the label, I need to
> produce:
>
> output:
> ((a b) (c d i j) (e f k l o p) (g h) (m n q r) (s t))
>
> [...]
>
> anyone care to give a solution in Python, Perl, javascript, or other
> lang? am guessing the scheme solution can be much improved... perhaps
> using some lib but that seems to show scheme is pretty weak if the lib
> is non-standard.
In Haskell the solution looks like this:
import qualified Data.Map as M
import qualified Data.Set as S
import Data.Map (Map)
import Data.Set (Set)
collect :: (Ord a, Ord k) => [Map k (Set a)] -> Map k (Set a)
collect = M.unionsWith S.union
Greets,
Ertugrul
--
nightmare = unsafePerformIO (getWrongWife >>= sex)
http://ertes.de/
------------------------------
Date: Mon, 27 Sep 2010 01:47:59 +0200
From: Ertugrul =?UTF-8?B?U8O2eWxlbWV6?= <es@ertes.de>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <20100927014759.2ccee77f@tritium.streitmacht.eu>
Ertugrul S=C3=B6ylemez <es@ertes.de> wrote:
> In Haskell the solution looks like this:
>
> [...]
And before anyone starts to rant, I didn't pay attention to where I'm
X-posting this stuff. Sorry for that. But on the other hand you could
say that I'm giving the Perl people (apparently the only people feeling
the urge to rant anyway) the chance to come up with a more elegant
solution. =3D)
Greets,
Ertugrul
--=20
nightmare =3D unsafePerformIO (getWrongWife >>=3D sex)
http://ertes.de/
------------------------------
Date: Mon, 27 Sep 2010 01:56:11 +0100
From: Ben Morrow <ben@morrow.me.uk>
Subject: Re: toy list processing problem: collect similar terms
Message-Id: <bm65n7-75h1.ln1@osiris.mauzo.dyndns.org>
Quoth Ertugrul =?UTF-8?B?U8O2eWxlbWV6?= <es@ertes.de>:
> Ertugrul Söylemez <es@ertes.de> wrote:
>
> > In Haskell the solution looks like this:
>
> And before anyone starts to rant, I didn't pay attention to where I'm
> X-posting this stuff. Sorry for that. But on the other hand you could
> say that I'm giving the Perl people (apparently the only people feeling
> the urge to rant anyway)
I don't know about the other groups, but we get Xah Lee threads fairly
regularly. After a while they start to get on your nerves...
> the chance to come up with a more elegant
> solution. =)
Hmmm. Not likely :)
Ben
------------------------------
Date: Sun, 26 Sep 2010 15:22:48 -0700
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: why does this happen?
Message-Id: <fihv96llj259praqv9jmcc0uq6u68r8gmm@4ax.com>
Hadron<hadronquark@gmail.com> wrote:
>So
>"So I rename rm1.f90 to rm2.f90,"
>Doesn't mean anything to you either?
No, in this context it means the OP isn't telling the real story.
The obvious interpretion of "rename" using "mv old.pl new.pl" cannot be
right because mv doesn't change any permissions.
Therefore there must be something else going on which the OP is not
telling. So, no, "rename" doesn't mean anything in this context.
jue
------------------------------
Date: Mon, 27 Sep 2010 00:47:54 +0200
From: Hadron<hadronquark@gmail.com>
Subject: Re: why does this happen?
Message-Id: <i7oiis$bbb$1@news.eternal-september.org>
Mart van de Wege <mvdwege@mail.com> writes:
> Hadron<hadronquark@gmail.com> writes:
>
>> Mart van de Wege <mvdwege@mail.com> writes:
>>
>>> Hadron<hadronquark@gmail.com> writes:
>>>
>>>>
>>>> As a side note regarding perl if he's a complete beginner which seems
>>>> likely it might be worth suggesting he doesnt put his scripts on the
>>>> path and he doesn't set them for exec
>>>
>>> As usual, you are talking bollocks.
>>>
>>> He's using syntax that indicates he is *NOT* executing his scripts from
>>> his $PATH. And as long as you do not explicitly do what every Linux
>>> distribution has prevented you from doing, setting a script in your
>>> current directory to executable is no problem at all.
>>
>> I suggested that its not on the path IN CASE : hence I mentioned
>> SPECIFICALLY running perl. At no point did I say they are currently on
>> the path either.
>>
> Actually, you did. Otherwise your suggestion that he shouldn't put his
> scripts in his $PATH wouldn't make any sense.
Oh ffs : his entire issue was permissions. My point, which I extended
on, was that he doesnt NEED permissions AND mentioned the path too.
You're not a programmer, you havent worked on any developments of any
size. Your dismal grasp of the importance of permissions and paths are
not my concern.
If you were and HAD you done so you would know that my advice was both
correct AND helpful. Unlike the rest of the usual contrary dross from
smart arses going out of the way NOT to understand him.
If you have something to contribute, as I did, then do so. Else fuck off
back to COLA.
------------------------------
Date: Mon, 27 Sep 2010 00:50:16 +0200
From: Hadron<hadronquark@gmail.com>
Subject: Re: why does this happen?
Message-Id: <i7oinb$bbb$2@news.eternal-september.org>
"Peter J. Holzer" <hjp-usenet2@hjp.at> writes:
> On 2010-09-26 15:52, Hadron <hadronquark@gmail.com> wrote:
>> Tad McClellan <tadmc@seesig.invalid> writes:
>>> Jürgen Exner <jurgenex@hotmail.com> wrote:
>>>> Uno <merrilljensen@q.com> wrote:
>>>>>So I rename rm1.f90 to rm2.f90, and I have no problem on the command
>>>>>line except to iterate the integer that postpends the source file.
>>>>
>>>> What do you mean by "iterate the integer that postpends the source
>>>> file"? And what's a f90 file?
>>>
>>> I expect that he did something like:
>>>
>>> rename 1 2 rm1.f90
>>>
>>> Though he never said what he did, which is pretty silly, as what
>>> he did is germane to what ended up happening...
>>
>> "So I rename rm1.f90 to rm2.f90,"
>>
>> Doesn't mean anything to you either?
>
> That would normally mean that he invoked
>
> mv rm1.f90 rm2.f90
>
> But that doesn't have to claimed effect of changing the permissions, so
> I doubt he did that.
>
Agreed, but as I way saying there are deeper issues than that as he is
clearly a complete noob. Hence my sugegstion he explicitly passed them
to perl for now.
He DID say what he THOUGHT he did.
------------------------------
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 3147
***************************************
