2002 5:29 PM
--=={--=={To: [EMAIL PROTECTED]
--=={--=={Subject: RE: Please explain
--=={--=={
--=={--=={
--=={--=={Mark Schoonover <[EMAIL PROTECTED]> wrote:
--=={--=={
--=={--=={> I can see how the characters in
--=={--=={> elvis and lives word sort the same. So would viles.
--=={I
fully understand the problem
at hand!
Thanks Again!
..mark
--=={-Original Message-
--=={From: Keith C. Ivey [mailto:[EMAIL PROTECTED]]
--=={Sent: Monday, April 08, 2002 5:29 PM
--=={To: [EMAIL PROTECTED]
--=={Subject: RE: Please explain
--=={
--=={
--=={Mark Schoonover <[EMAIL PROTECTED
Mark Schoonover <[EMAIL PROTECTED]> wrote:
> I can see how the characters in
> elvis and lives word sort the same. So would viles. IIUC, seliv
> would sort the same way as viles but seliv is not a word, it is
> merely a string of letters. Am I thinking too hard on this one
> or am I just royally
On Mon, Apr 08, 2002 at 11:05:28PM +, Jean-Pierre Vidal wrote:
> > So, to summarize, there is no dictionary magic, just
> > unwholesome programming dirty tricks. :)
>
> I don't agree,
Well, okay, you're right. Probably that unwholesome's
too feeble a word to describe the brillia
Le Lundi 8 Avril 2002 22:23, Yanick a écrit :
[snip]
> So, to summarize, there is no dictionary magic, just
> unwholesome programming dirty tricks. :)
>
> Joy,
> `/anick
I don't agree, I reduce the problem:
hack
snooped
tables
salt
spiff
feeling
spooned
last
grep
bleats
gas
ablest
fleei
--=={Valid words? The sorted words aren't valid words, if
--=={that's what you mean.
--=={But, for example, you can tell elvis and lives are
--=={anagrams, because for
--=={each of them sort/./g is (e, i, l, s, v).
This is the part that is confusing me. I fairly understand how the
cod
On Mon, Apr 08, 2002 at 09:52:41PM +, Jean-Pierre wrote:
> Le Lundi 8 Avril 2002 20:47, Yanick a écrit :
> >
> > map$1{join$|,sort/./g}.=$_,sort<>;
> >
> > what it means is simply:
> >
> Thks to you Yanick, and to Stephen. I think the answer to my question is so
> obvious you cannot imagine I
Le Lundi 8 Avril 2002 20:47, Yanick a écrit :
>
> map$1{join$|,sort/./g}.=$_,sort<>;
>
> what it means is simply:
>
Thks to you Yanick, and to Stephen. I think the answer to my question is so
obvious you cannot imagine I do not know it, or maybe the question was badly
formulated.
Let me expose i
In article <[EMAIL PROTECTED]>,
Jean-Pierre <[EMAIL PROTECTED]> writes:
> Although I have entered tpr(0,2) as a veteran, although I am in fact a
> veteran, I am also a perl's newbie. I play golf because it is fun, of course,
> but also because it helps me to read perldoc more and more.
>
On Mon, Apr 08, 2002 at 02:07:03PM -0700, Mark Schoonover wrote:
>
> --=={First, sort puts its arguments into list context.
>
> Cool so far...
>
> --=={This is then sorted by the
> --=={sort, and two words are anagrams if and only if they agree
> --=={about their sorted letters.
>
> Huh?? Thi
On Mon, 8 Apr 2002, Mark Schoonover wrote:
>
> --=={First, sort puts its arguments into list context.
>
> Cool so far...
>
> --=={This is then sorted by the
> --=={sort, and two words are anagrams if and only if they agree
> --=={about their sorted letters.
>
> Huh?? This is the part that tr
--=={First, sort puts its arguments into list context.
Cool so far...
--=={This is then sorted by the
--=={sort, and two words are anagrams if and only if they agree
--=={about their sorted letters.
Huh?? This is the part that tripped me up. I don't understand how it knows
if the new words ar
On Mon, 8 Apr 2002, Jean-Pierre wrote:
>
> So : I caught the construction "sort/./g", used by 60% of the solutions, on
> the web, querying for "perl anagram".
>
Oh yes, the top link on Google is quite a clue. I didn't think of doing
that.
--
Stephen Turner, Cambridge, UKhttp://homepage.
On Mon, 8 Apr 2002, Jean-Pierre wrote:
> Although I have entered tpr(0,2) as a veteran, although I am in fact a
> veteran, I am also a perl's newbie. I play golf because it is fun, of course,
> but also because it helps me to read perldoc more and more.
>
> So : I caught the construction "sor
On Mon, Apr 08, 2002 at 08:20:53PM +, Jean-Pierre wrote:
> [..] I caught the construction "sort/./g", used by 60% of the solutions, on
> the web, querying for "perl anagram".
>
> Could someone give me either an explanation or a link?
I guess it would be easier if we expand the expression a
15 matches
Mail list logo
