Result for 8AA6A3775467701618F02BD7CE7291F5BB708FFD

Query result

Key Value
FileName./usr/share/gocode/src/github.com/hashicorp/go-immutable-radix/README.md
FileSize1946
MD5379BAAE0D824292EA1C02348BC2FB11B
SHA-18AA6A3775467701618F02BD7CE7291F5BB708FFD
SHA-2569AD3419694B4A33091AE57DA7FF375B87B173C3B534FFE3C8404A4FC1BD70535
SHA-51230FF4B83F4A6EAB4184B3383E1C12E02B0BB327088C5F1AE0DAA875E36F9E59E525E66DB133AB1C0F01918EDCE76268A6ACDAB950FBB690E532AB81904F93A4C
SSDEEP48:uBwsq39sEBI3FEsiEoeLakgA+M5WieKT0K/ArS8tD5j9j3:uBwD9nBIusxoeLakgAj5Wi5/bA3
TLSHT183416692FB84205C37469C746FDF04A96E2D407A77AE01DA750D687A8A03EB491BBCC4
insert-timestamp1659226705.4636075
mimetypetext/plain
sourcesnap:mdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15
hashlookup:parent-total8
hashlookup:trust90

Network graph view

Parents (Total: 8)

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

Key Value
FileSize24692
MD57FD0B860C68E38F4C583369F1F27FF62
PackageDescriptionimmutable 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamegolang-github-hashicorp-go-immutable-radix-dev
PackageSectiondevel
PackageVersion1.3.0-1
SHA-187EEBE5E205FCFD469BA7C110EDA91A3F0CC4759
SHA-25610C3681718813FA6E8402B49EC17A16965F4C588DDC24A03E459DA93CDCAB28B
Key Value
FileSize26800
MD5EEE07A084EEFE590854C5926D24C32A0
PackageDescriptionimmutable 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.
PackageMaintainerDebian Go Packaging Team <team+pkg-go@tracker.debian.org>
PackageNamegolang-github-hashicorp-go-immutable-radix-dev
PackageSectiongolang
PackageVersion1.3.1-1
SHA-19CE2BEEC379CA3E5C9BDF7847EEB5E1E965F77AC
SHA-2565F7258F4DFF41334FD2FCE58034F147A6503304F6B76543F78E9B41B7E9E6CC2
Key Value
MD5A567D2F211E97A7C38A754D2A138C82D
PackageArchnoarch
PackageDescriptionProvides 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
PackageMaintainerpterjan <pterjan>
PackageNamegolang-github-hashicorp-immutable-radix-devel
PackageRelease1.mga8
PackageVersion1.3.0
SHA-1F662EC9B32B33B681EBE15E0AC65D7490D0BFCFB
SHA-2561D6E8DB803C476C655F52A67CE9176EF9239F3C548C48AF6891807097690B249
Key Value
MD5C9DA7A107E77828577E9BD0D8E877515
PackageArchnoarch
PackageDescriptionProvides 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
PackageMaintainerFedora Project
PackageNamegolang-github-hashicorp-immutable-radix-devel
PackageRelease1.fc33
PackageVersion1.2.0
SHA-160C6819753577868D5A2A4A8205001543FBF7E7C
SHA-2563DCF58374855BA1B446ED32D26D7B7AA66EF29B693C5A54C84778F1AC9F9076F
Key Value
MD53946C6D9C1182CBE412B25F13BF0F7F8
PackageArchnoarch
PackageDescriptionProvides 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
PackageMaintainerFedora Project
PackageNamegolang-github-hashicorp-immutable-radix-devel
PackageRelease2.fc34
PackageVersion1.3.0
SHA-12946A93F242653E8AD9B18FB36CBCDD8AF8641EB
SHA-25632E2C4F1A07DD7BAAFA7CD62C44911773B9EE978E0852994919085D7CAA1CC28
Key Value
SHA-103BD1018751C915F71C1E2AE51345C94CA1942ED
snap-authoritycanonical
snap-filenamemdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15.snap
snap-idmdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15
snap-nameaxiom
snap-publisher-id1gYihke6YA9pGfV8JRS1Ohe64f0Qs5nG
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-10-01T17:34:13.464567Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/mdTwaNga8m8NrBqqSH4FVIbtUwLWAhWj_15.snap
Key Value
MD572B3519D3C1A63665022BEA2E2E11487
PackageArchnoarch
PackageDescriptionProvides 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
PackageMaintainerumeabot <umeabot>
PackageNamegolang-github-hashicorp-immutable-radix-devel
PackageRelease3.mga9
PackageVersion1.3.0
SHA-173E6BEC8F9BA38EDEC70DBE20F505665C958E3D2
SHA-256780352E89E4CDC572B9FBE369BAE21CC8D0632FD25CC2A2098C89E325B977489
Key Value
FileSize24988
MD57EFABA723A762F4EC58686200AA0D27D
PackageDescriptionimmutable 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.
PackageMaintainerDebian Go Packaging Team <team+pkg-go@tracker.debian.org>
PackageNamegolang-github-hashicorp-go-immutable-radix-dev
PackageSectiondevel
PackageVersion1.3.0-1
SHA-17F46E9E81C397901F3B8FD1000CEA43E49DF4AB9
SHA-256D73A25D48A9297EFACEB41F966533B9CB081A588BABA6CBD497FB5B75AB64C69