Key | Value |
---|---|
FileName | ./usr/lib/.build-id/c0/25f1cf0a8c56c85dde72d97fbf829e4a0de949 |
FileSize | 101 |
MD5 | 5FD6FEE1A1640AEC064E6AEB0E17B1A4 |
SHA-1 | AF98EF557F965D8CCE80979D089E29337610F894 |
SHA-256 | FBFBFFE5166BD6F3CA8067E4421A7FBF902C3BE53C8B5489C208580147EB2D64 |
SSDEEP | 3:gCD/9YAKWMmoWrz2uX6ZuquX6BCcVMWu0p:X/9YvLorPX6AX6DMWu0p |
TLSH | T1A9B01270442C5621D9437824E2035C17C3142CD1774A1F80B22886A064401E60232D70 |
hashlookup:parent-total | 1 |
hashlookup:trust | 55 |
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 |
---|---|
MD5 | D831281BBC665A96EEA3A36DD775CA3C |
PackageArch | i586 |
PackageDescription | This package contains the implementation of the patiencediff algorithm, as first described by Bram Cohen. Like Python’s difflib, this module provides both a convience unified_diff function for the generation of unified diffs of text files as well as a SequenceMatcher that can be used on arbitrary lists. Patiencediff provides a good balance of performance, nice output for humans, and implementation simplicity. The code in this package was extracted from the Bazaar code base. The package comes with two implementations: - A Python implementation (_patiencediff_py.py); this implementation only requires a Python interpreter and is the more readable version of the two. - A C implementation implementation (_patiencediff_c.c); this implementation is faster, but requires a C compiler and is less readable. |
PackageMaintainer | guillomovitch <guillomovitch> |
PackageName | python3-patiencediff |
PackageRelease | 1.mga8 |
PackageVersion | 0.2.1 |
SHA-1 | AB9B1EC4FF74088C66CA1C2CAAF82C3F2AE6C41A |
SHA-256 | 11CCC7A3A1C7A44D0475DAAA891898892CFB06A246FBA24DD31CE96AB753FEC6 |