| Key | Value |
|---|---|
| FileName | ./usr/lib/.build-id/ac/918c4e733b2da823e59919c7c3c73316e5dd0e |
| FileSize | 25 |
| MD5 | 0194F4D726B7FF2F68EE7492A9533EEF |
| SHA-1 | 18A29BB3B79EF3D4B9F3C150DB7EA949540C8589 |
| SHA-256 | 52E08CC55F50CFB453FB720059F0EB674C07B4B006A83EE1643585F5DFE5FA1E |
| SSDEEP | 3:gCDNP:X5 |
| TLSH | |
| hashlookup:parent-total | 25 |
| hashlookup:trust | 100 |
The searched file hash is included in 25 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | 3A218C67AEEC3380B6D550865AD03E71 |
| PackageArch | x86_64 |
| PackageDescription | Approximate pattern matching allows matches to be approximate, that is, allows the matches to be close to the searched pattern under some measure of closeness. TRE uses the edit-distance measure (also known as the Levenshtein distance) where characters can be inserted, deleted, or substituted in the searched text in order to get an exact match. Each insertion, deletion, or substitution adds the distance, or cost, of the match. TRE can report the matches which have a cost lower than some given threshold value. TRE can also be used to search for matches with the lowest cost. TRE includes a version of the agrep command line tool for approximate regexp matching in the style of grep. Unlike other agrep implementations (like the one by Sun Wu and Udi Manber from University of Arizona available) TRE agrep allows full regexps of any length, any number of errors, and non-uniform costs for insertion, deletion and substitution. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | agrep |
| PackageRelease | 16.mga7 |
| PackageVersion | 0.8.0 |
| SHA-1 | 03D373B0F219A23A148FAAD98083AAE7A1D50B0C |
| SHA-256 | 6E5BE4D155052F77A7502CA8DF8EF0ACF876956910D5A6107E8543259FC0EEB0 |
| Key | Value |
|---|---|
| MD5 | 0135C1FD56E7EE663EFC55648AFD1018 |
| PackageArch | aarch64 |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 27.20140228gitc2f5d13.el8 |
| PackageVersion | 0.8.0 |
| SHA-1 | 069C0BD82CD1E72AB3A1835E7CE1FDF5785BFF50 |
| SHA-256 | C1B277C029F0969D694EF687822A68D8F34C9AC27C9F5B638F62245154DCB4F0 |
| Key | Value |
|---|---|
| MD5 | 498B0D370660BBBC898F3388D17D72EB |
| PackageArch | x86_64 |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 31.20140228gitc2f5d13.fc33 |
| PackageVersion | 0.8.0 |
| SHA-1 | 0712813A1BCA72C8FD68240146547FFFB9B6C17F |
| SHA-256 | 8DD15F24A58DD2D2D1178ED5B4711D27C72324FB7868A629F1370E280D38B2DB |
| Key | Value |
|---|---|
| MD5 | D66A7AB9FE010F39A4749F603B0F4AC4 |
| PackageArch | aarch64 |
| PackageDescription | Approximate pattern matching allows matches to be approximate, that is, allows the matches to be close to the searched pattern under some measure of closeness. TRE uses the edit-distance measure (also known as the Levenshtein distance) where characters can be inserted, deleted, or substituted in the searched text in order to get an exact match. Each insertion, deletion, or substitution adds the distance, or cost, of the match. TRE can report the matches which have a cost lower than some given threshold value. TRE can also be used to search for matches with the lowest cost. TRE includes a version of the agrep command line tool for approximate regexp matching in the style of grep. Unlike other agrep implementations (like the one by Sun Wu and Udi Manber from University of Arizona available) TRE agrep allows full regexps of any length, any number of errors, and non-uniform costs for insertion, deletion and substitution. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | agrep |
| PackageRelease | 16.mga7 |
| PackageVersion | 0.8.0 |
| SHA-1 | 08C0DBE376695821E64C3B4A8CEBDE43D18314B4 |
| SHA-256 | B8E202DDA3F70D724F065DC5EAF8FFE1F198E6C639377CE7AB6E2DA58C2BB5EA |
| Key | Value |
|---|---|
| MD5 | BDBA225CD9AE71A61CE431D6A3093316 |
| PackageArch | armv7hl |
| PackageDescription | Approximate pattern matching allows matches to be approximate, that is, allows the matches to be close to the searched pattern under some measure of closeness. TRE uses the edit-distance measure (also known as the Levenshtein distance) where characters can be inserted, deleted, or substituted in the searched text in order to get an exact match. Each insertion, deletion, or substitution adds the distance, or cost, of the match. TRE can report the matches which have a cost lower than some given threshold value. TRE can also be used to search for matches with the lowest cost. TRE includes a version of the agrep command line tool for approximate regexp matching in the style of grep. Unlike other agrep implementations (like the one by Sun Wu and Udi Manber from University of Arizona available) TRE agrep allows full regexps of any length, any number of errors, and non-uniform costs for insertion, deletion and substitution. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | agrep |
| PackageRelease | 16.mga7 |
| PackageVersion | 0.8.0 |
| SHA-1 | 0C525D339B37F415D17271946AFFEE0518FD7B5F |
| SHA-256 | ECC27FAC59F973D6C98E14B0F71BE0A61805A8037E54EADE9A25192F0704581B |
| Key | Value |
|---|---|
| MD5 | 43C4A9C20C5E8195D3E84BDAD01B4553 |
| PackageArch | s390x |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 27.20140228gitc2f5d13.el8 |
| PackageVersion | 0.8.0 |
| SHA-1 | 1B1E84314CD4F8F319215934ADE631F3A609C7D4 |
| SHA-256 | 2FF7BE5C9A36AA7781CA802F097A76BDE7B8D3B02356BD311767654BF7E22898 |
| Key | Value |
|---|---|
| MD5 | 8E51F8108762DB9E3EACD13A57F73F6B |
| PackageArch | aarch64 |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 29.20140228gitc2f5d13.fc32 |
| PackageVersion | 0.8.0 |
| SHA-1 | 231B2FA489D754BEC9AC02CBD3E434547C88E087 |
| SHA-256 | E0E315FCD6F4FDF282EC634EC38DD81687AF97CFBF2666ACCCF282EE990ADE6D |
| Key | Value |
|---|---|
| MD5 | 7887D91F3B9845E720ABB69BAE73C714 |
| PackageArch | armv7hl |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 29.20140228gitc2f5d13.fc32 |
| PackageVersion | 0.8.0 |
| SHA-1 | 2473E45B430A5CC6705DAAB4C202BE8030972E5C |
| SHA-256 | A5899561AE253E62BC7745B7E5DA6646FE66714A685BA88B93C9408B6D7DDD42 |
| Key | Value |
|---|---|
| MD5 | 1F2D09AFF689137079F99C2F8A20FF6C |
| PackageArch | x86_64 |
| PackageDescription | The agrep tool is similar to the commonly used grep utility, but agrep can be used to search for approximate matches. The agrep tool searches text input for lines (or records separated by strings matching arbitrary regexps) that contain an approximate, or fuzzy, match to a specified regexp, and prints the matching lines. Limits can be set on how many errors of each kind are allowed, or only the best matching lines can be output. Unlike other agrep implementations, TRE agrep allows full POSIX regexps of any length, any number of errors, and non-uniform costs. |
| PackageMaintainer | Fedora Project |
| PackageName | agrep |
| PackageRelease | 27.20140228gitc2f5d13.el8 |
| PackageVersion | 0.8.0 |
| SHA-1 | 2D16919034583A31A1C315D55A07CA7259FCDC20 |
| SHA-256 | C69F1F0F2B7DB33A1DEF5E42236A269EDA0547AF50EAF43C91F042CF60720402 |
| Key | Value |
|---|---|
| MD5 | C587B17F1F08D10ECB3AF854C7F4EB8D |
| PackageArch | x86_64 |
| PackageDescription | Approximate pattern matching allows matches to be approximate, that is, allows the matches to be close to the searched pattern under some measure of closeness. TRE uses the edit-distance measure (also known as the Levenshtein distance) where characters can be inserted, deleted, or substituted in the searched text in order to get an exact match. Each insertion, deletion, or substitution adds the distance, or cost, of the match. TRE can report the matches which have a cost lower than some given threshold value. TRE can also be used to search for matches with the lowest cost. TRE includes a version of the agrep command line tool for approximate regexp matching in the style of grep. Unlike other agrep implementations (like the one by Sun Wu and Udi Manber from University of Arizona available) TRE agrep allows full regexps of any length, any number of errors, and non-uniform costs for insertion, deletion and substitution. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | agrep |
| PackageRelease | 18.mga9 |
| PackageVersion | 0.8.0 |
| SHA-1 | 31668944D8628B6CF37CBA44A5050DEABE4C309D |
| SHA-256 | EFA2E0DE6506F1581E2562977F66DD079135C122228442C98F4E206081ECF384 |