Result for 364010489BA01F4CC129306B3A8149BFF5C5B226

Query result

Key Value
FileName./usr/share/doc/golang-github-armon-go-radix-dev/copyright
FileSize1403
MD5B6B2585317454216C9E99C8196A0EB03
SHA-1364010489BA01F4CC129306B3A8149BFF5C5B226
SHA-256C76F3BA17D7B8D473D952D8F3B1C945DE510C6B37A30ACE20582765A29207BFA
SSDEEP24:g0t/tjmprwNJHZH0yf3gtneHc1hMK9QH0sUv4Lk4/+dJRoOqBFD:nRCyJxl/Ev5QH0s5gT0O0FD
TLSHT16F21B69DB7C003B2299623F0A979A8D5F32B714AB95B0788942FE308272601DC1FB414
hashlookup:parent-total3
hashlookup:trust65

Network graph view

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
FileSize6516
MD583B3360BA57ACF73188CF1949A5D0502
PackageDescriptionGolang implementation of Radix trees Provides the radix package that implements a 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 . For an immutable variant, see go-immutable-radix. . This package contains the source.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamegolang-github-armon-go-radix-dev
PackageSectiondevel
PackageVersion0.0~git20150602.0.fbd82e8-1
SHA-194EB7963311C5CEDFDA4B3629919C43EEFDA08A0
SHA-256DB3FE442C5B4BB3115264B5BD13DDDC79ACF8D24BD2FB60E3F6BE015D79D5B1F
Key Value
FileSize6722
MD5F0D57AC5899DE6BAEDB28AE4C52B7672
PackageDescriptionGolang implementation of Radix trees Provides the radix package that implements a 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 . For an immutable variant, see go-immutable-radix. . This package contains the source.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamegolang-github-armon-go-radix-dev
PackageSectiondevel
PackageVersion0.0~git20150602.0.fbd82e8-2
SHA-1C1756F0F7C72DB4DDC3ECDC42DAC9A8C3ABCC6C0
SHA-256BC7A7C04C271FB793DC06E6E708660C9CDAC5F5A35AD8529569D524EE19EF487
Key Value
FileSize6472
MD58A6998ECB01C5FB4CCDE8A9C7203C992
PackageDescriptionGolang implementation of Radix trees Provides the radix package that implements a 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 . For an immutable variant, see go-immutable-radix. . This package contains the source.
PackageMaintainerDebian Go Packaging Team <pkg-go-maintainers@lists.alioth.debian.org>
PackageNamegolang-github-armon-go-radix-dev
PackageSectiondevel
PackageVersion0.0~git20150602.0.fbd82e8-1
SHA-1E3C79198C862A91D867CBC5621B335F526774B96
SHA-2560B5364F29978FA6B9EA9315C2049EDFA26C2F494E78A37680908BBDD1F0D834E