Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^2: Algorithm::Diff icult to use

by Aristotle (Chancellor)
on Aug 22, 2002 at 05:12 UTC ( [id://191929]=note: print w/replies, xml ) Need Help??


in reply to Re: Algorithm::Diff icult to use
in thread Algorithm::Diff icult to use

I've found the output from diff a little too deeply nested
You can hardly call a LoL deeply nested though. The flat list format also requires monkeying with splice, which is definitely not preferrable IMHO.

Makeshifts last the longest.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://191929]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (2)
As of 2024-04-25 20:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found