Result for 00F431F8F25AC3B23423828B22F6932E4AEE946D

Query result

Key Value
FileName./usr/share/doc/ruby-diff-lcs/changelog.Debian.gz
FileSize1023
MD514BF5E606FA8BDF22C81E977AF9EA55E
SHA-100F431F8F25AC3B23423828B22F6932E4AEE946D
SHA-256D8C84034D75696AD206FF2F6F51E0CFC56E851AA1E46C559F755E4A5BDB08430
SSDEEP24:XlNJfUDPyuYXkZtCHQVqmleaevEWuwXjY4tzoiSJw2xRCiWzWn:XfOryVkTCHQ5l54Y4toiAwysU
TLSHT1BD11C85390E80B075A56AD0C81B30E7010DCF9FDB48A87BD002A9D2B6377ACFE914C16
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize23370
MD524AAE7EE4A15B6218923D10C08E6DEF5
PackageDescriptionMcIlroy-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).
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNameruby-diff-lcs
PackageSectionruby
PackageVersion1.1.3-1
SHA-1CF8AAF296B692055858463293E4EFA5201A36323
SHA-256F31E4A76E5370BD6366EBA3C5533E52F0779D5533647A7078BCD58FC905B640C