Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Is there any API available in perl to find longest common substring from two strings

by RichardK (Priest)
on Dec 31, 2012 at 11:34 UTC ( #1011045=note: print w/ replies, xml ) Need Help??


in reply to Is there any API available in perl to find longest common substring from two strings

You could use the File::Spec functions: spitpath & splitdir, to simplify your matching.

($volume,$directories,$file) = File::Spec->splitpath( $path ); @dirs = File::Spec->splitdir( $directories );

then it's simple to compare the arrays to see how much they have in common.


Comment on Re: Is there any API available in perl to find longest common substring from two strings
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2014-10-21 21:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (111 votes), past polls