| Key | Value |
|---|---|
| FileName | ./usr/share/gocode/src/github.com/hashicorp/go-immutable-radix/CHANGELOG.md |
| FileSize | 187 |
| MD5 | B95E9103FD98A7CA5821731B9D9F600C |
| SHA-1 | FEA29A86D0B523D65B483B43D3C782C192D09F67 |
| SHA-256 | 2160B50782E3CBB1BFFB8F08049AA6554D645D056ED54AB247BF877B36DD1626 |
| SSDEEP | 3:S9CglCzG3w7nJFe27qXE2gBSdAoRGEd9EvKJIMaREpAI+qK643V2XQWs7bl/FCKY:S9hG7nJFe3XE2gBSdAoR3QvKJIMaEpAG |
| TLSH | T1C3C080537AAC3489A7304DE5C8C2A945942F87B899144FDA7181966781554B1513DC44 |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | C9DA7A107E77828577E9BD0D8E877515 |
| 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 | 1.fc33 |
| PackageVersion | 1.2.0 |
| SHA-1 | 60C6819753577868D5A2A4A8205001543FBF7E7C |
| SHA-256 | 3DCF58374855BA1B446ED32D26D7B7AA66EF29B693C5A54C84778F1AC9F9076F |