Parents (Total: 3)

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

Key	Value
MD5	72B3519D3C1A63665022BEA2E2E11487
PackageArch	noarch
PackageDescription	Provides the iradix package that implements an immutable radix tree. The package only provides a single Tree implementation, optimized for sparse nodes. As a radix tree, it provides the following: – O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality. – Minimum / Maximum value lookups – Ordered iteration A tree supports using a transaction to batch multiple updates (insert, delete) in a more efficient manner than performing each operation one at a time. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/hashicorp/go-immutable-radix
PackageMaintainer	umeabot <umeabot>
PackageName	golang-github-hashicorp-immutable-radix-devel
PackageRelease	3.mga9
PackageVersion	1.3.0
SHA-1	73E6BEC8F9BA38EDEC70DBE20F505665C958E3D2
SHA-256	780352E89E4CDC572B9FBE369BAE21CC8D0632FD25CC2A2098C89E325B977489

Key	Value
MD5	A567D2F211E97A7C38A754D2A138C82D
PackageArch	noarch
PackageDescription	Provides the iradix package that implements an immutable radix tree. The package only provides a single Tree implementation, optimized for sparse nodes. As a radix tree, it provides the following: – O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality. – Minimum / Maximum value lookups – Ordered iteration A tree supports using a transaction to batch multiple updates (insert, delete) in a more efficient manner than performing each operation one at a time. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/hashicorp/go-immutable-radix
PackageMaintainer	pterjan <pterjan>
PackageName	golang-github-hashicorp-immutable-radix-devel
PackageRelease	1.mga8
PackageVersion	1.3.0
SHA-1	F662EC9B32B33B681EBE15E0AC65D7490D0BFCFB
SHA-256	1D6E8DB803C476C655F52A67CE9176EF9239F3C548C48AF6891807097690B249

Key	Value
MD5	3946C6D9C1182CBE412B25F13BF0F7F8
PackageArch	noarch
PackageDescription	Provides the iradix package that implements an immutable radix tree. The package only provides a single Tree implementation, optimized for sparse nodes. As a radix tree, it provides the following: – O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality. – Minimum / Maximum value lookups – Ordered iteration A tree supports using a transaction to batch multiple updates (insert, delete) in a more efficient manner than performing each operation one at a time. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/hashicorp/go-immutable-radix
PackageMaintainer	Fedora Project
PackageName	golang-github-hashicorp-immutable-radix-devel
PackageRelease	2.fc34
PackageVersion	1.3.0
SHA-1	2946A93F242653E8AD9B18FB36CBCDD8AF8641EB
SHA-256	32E2C4F1A07DD7BAAFA7CD62C44911773B9EE978E0852994919085D7CAA1CC28