Key | Value |
---|---|
FileName | ./usr/lib64/python3.10/site-packages/patiencediff-0.2.3-py3.10.egg-info/PKG-INFO |
FileSize | 2147 |
MD5 | 997CF4AD919622A22A3173536C82FDB7 |
SHA-1 | 10C4D46EA4309EA65A86D7962BE4E9CDD593B051 |
SHA-256 | E2DF4DC9B678F0F6C0F6D56C4F902DD53FD88DF424E68D34DA243047DC718001 |
SSDEEP | 48:D6W/cO6eLiPktjaxsx2QIT4gzVDJEKDYOU5w:DlUimPktjaxsx2QITdEKDr |
TLSH | T11241219329C81EB5AA870447A25F404B5A228927AD5D44CCF8FDC10CA7A1E7383BD83C |
hashlookup:parent-total | 4 |
hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 6FC57EF4E3C11DB9065A8D6970072F88 |
PackageArch | armv7hl |
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 convenience 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 | neoclust <neoclust> |
PackageName | python3-patiencediff |
PackageRelease | 1.mga9 |
PackageVersion | 0.2.3 |
SHA-1 | 3C8A27A2EFE6FD1E47BD92BE1CCE97FC56CBE894 |
SHA-256 | 71374FF74484F10A70680C9F553A5D7CE88A5B4D0E798886EE7D8E90E7D41C06 |
Key | Value |
---|---|
MD5 | 11EAED94C6D3BBF3D2690243E3728183 |
PackageArch | aarch64 |
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 convenience 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 | neoclust <neoclust> |
PackageName | python3-patiencediff |
PackageRelease | 1.mga9 |
PackageVersion | 0.2.3 |
SHA-1 | 8FCFCDD3E54F1761170AFC8B4249CDA5E574669D |
SHA-256 | C8FF6A91BB307EF82C84E921A59B0D95227A407737B109F3F27362D0BA0F1E4D |
Key | Value |
---|---|
MD5 | 20779C02B1DC40396F6ADCE4842769F1 |
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 convenience 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 | neoclust <neoclust> |
PackageName | python3-patiencediff |
PackageRelease | 1.mga9 |
PackageVersion | 0.2.3 |
SHA-1 | 9A79AABBD1FD58E68F0A692BA83224AA66D78500 |
SHA-256 | 8A03926724030B99DA9628C31066F02E910422039533E42EEAE252233916774A |
Key | Value |
---|---|
MD5 | A6DA6F859D775FBFEA00C7304110F296 |
PackageArch | x86_64 |
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 convenience 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 | neoclust <neoclust> |
PackageName | python3-patiencediff |
PackageRelease | 1.mga9 |
PackageVersion | 0.2.3 |
SHA-1 | 861603789911468795856AF8926E4A3E5135B625 |
SHA-256 | D8A10CF60BA3CEAC3400B6D3CF386D5CE4AB192AB7C3437240DD07A47C2E0ABE |