Parents (Total: 9)
The searched file hash is included in 9 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
FileSize | 25654 |
MD5 | C5ED1877D1FF63A955BB26537865EEB4 |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Debian Ruby Extras Maintainers <pkg-ruby-extras-maintainers@lists.alioth.debian.org> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.3-1 |
SHA-1 | 21972FD0282011CC5C4EF9593EA1DF61968B5C63 |
SHA-256 | 5F1348FA4FE9DC47FFE94CA4FE5E301871F5CBCE52866F9A22F449732385C179 |
Key |
Value |
FileSize | 26904 |
MD5 | 3E7B052CF68E6F75F4559E482A1A1525 |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.2.4-1 |
SHA-1 | DDED12F73E5086A18BEC1D69E8342B39C206BD92 |
SHA-256 | D780A3E5C3716ED104D792B9853B5DE5384C7E0CB8E8A5589254C7D63EA3E7FE |
Key |
Value |
FileSize | 23838 |
MD5 | 76A7CE09C64199199951F7F1D3E4D5A1 |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.2.5-2build1 |
SHA-1 | 038C7A7B8C1E0B87D39CBB757F48AB2D9C3EF934 |
SHA-256 | 3BE0EE0E6A3FA96EF327EB125FABE2E092E06C021FD1AB60D195FA84DE5780C1 |
Key |
Value |
FileSize | 26688 |
MD5 | E751C12786F80C520AA23311503414E4 |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Debian Ruby Extras Maintainers <pkg-ruby-extras-maintainers@lists.alioth.debian.org> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.2.5-1 |
SHA-1 | FE202008916A9AC58C14EB633D74D7E8F74DBEAF |
SHA-256 | 4DE68C448BA298D3468161D4DB8385A3F95AC142E87919D5C2ED132CA368F1FA |
Key |
Value |
MD5 | BF252270743FB595E4B36BB1C964D0CE |
PackageArch | noarch |
PackageDescription | Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt longest
common subsequence (LCS) algorithm to compute intelligent differences
between two sequenced enumerable containers. The implementation is based on
Mario I. Wolczko's Smalltalk version (1.2, 1993) and Ned Konz's Perl version
(Algorithm::Diff). |
PackageMaintainer | daviddavid <daviddavid> |
PackageName | ruby-diff-lcs |
PackageRelease | 3.mga7 |
PackageVersion | 1.3 |
SHA-1 | CA026E78F3B6ADA24DB1F08EAC51B3B39C1233AD |
SHA-256 | 48F692BC71D07CC3CF3831498FB9ECBFF626E0C6D1C0E4F184544A17B5EC57FB |
Key |
Value |
MD5 | 885C8F524715EA444A1BBBBD449112A6 |
PackageArch | noarch |
PackageDescription | Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt longest
common subsequence (LCS) algorithm to compute intelligent differences
between two sequenced enumerable containers. The implementation is based on
Mario I. Wolczko's Smalltalk version (1.2, 1993) and Ned Konz's Perl version
(Algorithm::Diff). |
PackageMaintainer | umeabot <umeabot> |
PackageName | ruby-diff-lcs |
PackageRelease | 4.mga8 |
PackageVersion | 1.3 |
SHA-1 | 0E9D21D636525016A4F76FE2C211F883E7A54065 |
SHA-256 | 1E6C081B31A92390CD1C325C735FEEFC49568AD64285527256279491AC047A53 |
Key |
Value |
FileSize | 26718 |
MD5 | F04FE9B278FD2E5ACD429C2F8705403A |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Debian Ruby Extras Maintainers <pkg-ruby-extras-maintainers@lists.alioth.debian.org> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.2.5-2 |
SHA-1 | 818463DAD8F07F6A713350311A9C7823D7B10FC9 |
SHA-256 | 8E415924704DB3D110448C9702055DEF797EF9D8CE4E90F7E25C7C933D7407DC |
Key |
Value |
FileSize | 22172 |
MD5 | AF48D77B08611BB9AE911A9B189518BA |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.3-1 |
SHA-1 | 1374E73625385B41542F4052E36D61D3EB7C4FC1 |
SHA-256 | 8BC7518BFEA9AC984E26370DD5E06ABF7AE54858F7FF750A5E95F6A6604F3379 |
Key |
Value |
FileSize | 23756 |
MD5 | ADD9E372D8BED0D91372644ACC3B7431 |
PackageDescription | McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff). |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ruby-diff-lcs |
PackageSection | ruby |
PackageVersion | 1.2.5-1 |
SHA-1 | 2E289D3AEE442CA1E271C72DCBBE5D9AA27C7AD6 |
SHA-256 | 3EF00EF9C726F3B2E1819974776F6B66382B61109E7567DB49288CAF4BB02064 |