Key | Value |
---|---|
FileName | ./usr/share/doc/golang-github-armon-go-radix-dev/changelog.Debian.gz |
FileSize | 169 |
MD5 | 0B60EA2EA85F601AD6E4E4133894A4FA |
SHA-1 | FD5D3EB09A80BA617E5A647ED2705C68E105DC6C |
SHA-256 | 15A2D9E6B12CEEFD42D7EE0E8E67A57AA25B0065277E03EAE620B268FD784589 |
SSDEEP | 3:FttHDo1H1H+0ct9NX+dvzInKS2EW7oqwBSiVUTdY1EvEwh1v8H8zQ7D:XtjovrcPNIbS2/7t2Ke1EcmUHt |
TLSH | T1BEC080DF1752D155C554463D2B46DC97012CA14156FD507D70C84417AC86E9AC55267C |
hashlookup:parent-total | 2 |
hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 6516 |
MD5 | 83B3360BA57ACF73188CF1949A5D0502 |
PackageDescription | Golang 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. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | golang-github-armon-go-radix-dev |
PackageSection | devel |
PackageVersion | 0.0~git20150602.0.fbd82e8-1 |
SHA-1 | 94EB7963311C5CEDFDA4B3629919C43EEFDA08A0 |
SHA-256 | DB3FE442C5B4BB3115264B5BD13DDDC79ACF8D24BD2FB60E3F6BE015D79D5B1F |
Key | Value |
---|---|
FileSize | 6472 |
MD5 | 8A6998ECB01C5FB4CCDE8A9C7203C992 |
PackageDescription | Golang 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. |
PackageMaintainer | Debian Go Packaging Team <pkg-go-maintainers@lists.alioth.debian.org> |
PackageName | golang-github-armon-go-radix-dev |
PackageSection | devel |
PackageVersion | 0.0~git20150602.0.fbd82e8-1 |
SHA-1 | E3C79198C862A91D867CBC5621B335F526774B96 |
SHA-256 | 0B5364F29978FA6B9EA9315C2049EDFA26C2F494E78A37680908BBDD1F0D834E |