Result for 3E1A47A01BA3A2D70E46488E7DA7DC61B558C5BF

Query result

Key Value
FileName./usr/share/gocode/src/github.com/hashicorp/go-immutable-radix/reverse_iter.go
FileSize4703
MD5E351A5A29F5BAFEAFB92CF52D92C62A0
SHA-13E1A47A01BA3A2D70E46488E7DA7DC61B558C5BF
SHA-256CF7DAD47216691D6CE74314D4A5E45F9212DA17ED662627AB687C167EA334466
SSDEEP96:qU4PLR7cVTCw2l6UBw7My2bGSsLr5gS+DoOLG6W7GKUSb3PIs6z:qU4Tx8T66UBw7XIogGF3s
TLSHT1A1A12F76B5ACC22E89602268CA8911D7FBAFC8B9C6319190D55859383107F9E423FDE3
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

The searched file hash is included in 6 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
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
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
MD5FD9436DBFCD3DA30B7343E5AB6B0FE9B
PackageArchx86_64
PackageDescriptionThis package provides debug information for package dnscrypt-proxy2. Debug information is useful when developing applications that use this package or when debugging this package.
PackageMaintainerFedora Project
PackageNamednscrypt-proxy2-debuginfo
PackageRelease1.el7
PackageVersion2.0.45
SHA-181F4EB9152918E861E45D0899B2623198B366088
SHA-2562DB09156EDF4B84FA3CD5F3CB0E3085FC5921B522BEE1E55C6E66D0882C525D8
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