Parents (Total: 7)

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

Key	Value
FileSize	24692
MD5	7FD0B860C68E38F4C583369F1F27FF62
PackageDescription	immutable radix tree implementation in Golang Golang implementation of an immutable radix tree (http://en.wikipedia.org/wiki/Radix_tree). The package only provides a single Tree implementation, optimized for sparse nodes.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	golang-github-hashicorp-go-immutable-radix-dev
PackageSection	devel
PackageVersion	1.3.0-1
SHA-1	87EEBE5E205FCFD469BA7C110EDA91A3F0CC4759
SHA-256	10C3681718813FA6E8402B49EC17A16965F4C588DDC24A03E459DA93CDCAB28B

Key	Value
FileSize	26800
MD5	EEE07A084EEFE590854C5926D24C32A0
PackageDescription	immutable radix tree implementation in Golang Golang implementation of an immutable radix tree (http://en.wikipedia.org/wiki/Radix_tree). The package only provides a single Tree implementation, optimized for sparse nodes.
PackageMaintainer	Debian Go Packaging Team <team+pkg-go@tracker.debian.org>
PackageName	golang-github-hashicorp-go-immutable-radix-dev
PackageSection	golang
PackageVersion	1.3.1-1
SHA-1	9CE2BEEC379CA3E5C9BDF7847EEB5E1E965F77AC
SHA-256	5F7258F4DFF41334FD2FCE58034F147A6503304F6B76543F78E9B41B7E9E6CC2

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

Key	Value
SHA-1	03BD1018751C915F71C1E2AE51345C94CA1942ED
snap-authority	canonical
snap-filename	mdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15.snap
snap-id	mdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15
snap-name	axiom
snap-publisher-id	1gYihke6YA9pGfV8JRS1Ohe64f0Qs5nG
snap-signkey	BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp	2021-10-01T17:34:13.464567Z
source-url	https://api.snapcraft.io/api/v1/snaps/download/mdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15.snap

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
FileSize	24988
MD5	7EFABA723A762F4EC58686200AA0D27D
PackageDescription	immutable radix tree implementation in Golang Golang implementation of an immutable radix tree (http://en.wikipedia.org/wiki/Radix_tree). The package only provides a single Tree implementation, optimized for sparse nodes.
PackageMaintainer	Debian Go Packaging Team <team+pkg-go@tracker.debian.org>
PackageName	golang-github-hashicorp-go-immutable-radix-dev
PackageSection	devel
PackageVersion	1.3.0-1
SHA-1	7F46E9E81C397901F3B8FD1000CEA43E49DF4AB9
SHA-256	D73A25D48A9297EFACEB41F966533B9CB081A588BABA6CBD497FB5B75AB64C69