Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
String::LCSS(3)	      User Contributed Perl Documentation      String::LCSS(3)

NAME
       String::LCSS - Find The Longest Common Substring	of Two Strings.

SYNOPSIS
	 require String::LCSS;
	 my $longest = String::LCSS::lcss ( "zyzxx", "abczyzefg" );
	 print $longest, "\n";

	 my @result = String::LCSS::lcss ( "zyzxx", "abczyzefg"	);
	 print "$result[0] ($result[1],$result[2])\n";

DESCRIPTION
       String::LCSS provides the function "lcss" to ferret out the longest
       common substring	shared by two strings passed as	arguments.  "undef" is
       returned	if the susbstring length is one	char or	less.

       When used in an array context, lcss will	returns	the indexi of the
       match root in the two args.

COPYRIGHT
       This module is free software; you can redistribute it and/or modify it
       under the same terms as Perl itself.

BUGS
       None presently known.

AUTHOR
       Daniel Yacob,  Yacob@EthiopiaOnline.Net
       <mailto:Yacob@EthiopiaOnline.Net>

perl v5.32.1			  2021-03-01		       String::LCSS(3)

NAME | SYNOPSIS | DESCRIPTION | COPYRIGHT | BUGS | AUTHOR

Want to link to this manual page? Use this URL:
<https://www.freebsd.org/cgi/man.cgi?query=String::LCSS&sektion=3&manpath=FreeBSD+13.0-RELEASE+and+Ports>

home | help