Parents (Total: 12)

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

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	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	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	AC261BF24E15D4C28C361C1573F6D26D
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	17.mga8
PackageVersion	0.8.0
SHA-1	50ABA45326B73A80C3358AC132BC4C6F6579E991
SHA-256	E2FF8D545CAAA22A1D3460BBB59978D612F79298AC22342132104DBFF1C55289

Key	Value
MD5	98C83DC2B284A335BB80C1068CE1471D
PackageArch	i586
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	71B7F59D696C30E346C237A69DD1519116EE5BBB
SHA-256	2AC6C3656F28AFAE4B3858637900221265E642B0A998300A90EB389B843834B9

Key	Value
MD5	5C107C5F818C08DD7F2B6C3A8A647F2E
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	17.mga8
PackageVersion	0.8.0
SHA-1	E21131BB3005534699C2327E858BE4EB6D490335
SHA-256	7A7C25655B68D69D439C096F72FB2034B52A0985CC2B68B5A9DA80B563AE675B

Key	Value
MD5	3ABC466B4C4B746BAC1F5B36AAD965E2
PackageArch	i586
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	53A9DF763607CF4F0738CD69C0A28DA75936312B
SHA-256	4199D4240B2B3D5045A257F936F27B7E67945F43F0061CA1FF5238218C9202F9

Key	Value
MD5	D43ACAC7C8021F10C2210C1A89562EC8
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	18.mga9
PackageVersion	0.8.0
SHA-1	7675FCC38CF866CCDD0ABCA89234486527075A29
SHA-256	B9A593F0AE13A8875EEDE68BF7E99C2C3C38D167850EEF1869F2E02C7DE06486

Key	Value
MD5	C10C8B2E84CEE641D4A733DD61C6ECDE
PackageArch	i586
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	17.mga8
PackageVersion	0.8.0
SHA-1	CDB6FA94A69AED5ABF812F3A6777906A5B90D6DE
SHA-256	37F7C778FBFEDDC20E8C14219D46B0475CFE4DC52AD8C85CEBF259200AB1CCFB

Key	Value
MD5	F2BF54D511E9774D5900D941A118A3FC
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	17.mga8
PackageVersion	0.8.0
SHA-1	63EDE6AB8ED9D38C9C18CBE436EE47ACF81B1EC7
SHA-256	F8515E17CD5D98B0B498BC93AF2A6A731E67A4788171280916D36891D6866955

Key	Value
MD5	D427276C8658F93FF02FC8044578AEC1
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	18.mga9
PackageVersion	0.8.0
SHA-1	D693C8291681CB49B04376B734A278648EF60895
SHA-256	01E34ED09750D984DD56A833D6F4404C1E6515887030B32D309F1DEFD230608A

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