Key | Value |
---|---|
FileName | ./usr/lib64/python3.8/site-packages/patiencediff-0.2.1-py3.8.egg-info/SOURCES.txt |
FileSize | 341 |
MD5 | E29B633D246C252AC40B403209B112CF |
SHA-1 | BEE221F769D5C4F9D11EBF07E968EAD9FA6786D1 |
SHA-256 | 16CE5144EB942557026638F6A10784DFA0B9FFE1618B56DE59265FD09C650782 |
SSDEEP | 6:vGQq0QT6EXRX6E5e6AX6j6AX6p6s9X6168CGWoBT68CGWuR3O68CGWMEZJTO68Cu:+0QeEBqE5TZuZUh48C008CUD8CjVD8Cu |
TLSH | T1BEE012F642995D43E167AC94F16FE623D8FB70533D4D94D2F414E848F0255430B0AC34 |
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 | A6BBADDD0DE3CD5B03BC1F782CE71A73 |
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 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 | BAA6247C3340BD2951A934D612A14BAD1FDEAF7C |
SHA-256 | 9CB866B94E51C0042C455502C4FB6A02E6C2D9EFBB263E435342B23E969C7546 |
Key | Value |
---|---|
MD5 | 0598EE527DEC40AF588CE9A4778E231C |
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 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 | CA99789FBADB7C7A658438024E24041D05676B9A |
SHA-256 | 7F5E8FFB1AA66B201CFF0054E4CE1ED983C37AFFC6266097406BA974E15704DC |
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 |
Key | Value |
---|---|
MD5 | 6F99876604F163CD639F726CE29E3618 |
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 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 | 32A79758A2C428767BAFD3EA3FA0DE28544E7993 |
SHA-256 | 0A9C18818026777331B6CC072008AADC0CAED450FBE14E8B88AED75A4945905F |