| Key | Value |
|---|---|
| FileName | ./usr/share/gocode/src/github.com/hashicorp/go-immutable-radix/iradix_test.go |
| FileSize | 36288 |
| MD5 | D5FFE568AFF84C3B6F5EDC68D5AB8101 |
| SHA-1 | 4137D09D7A7DAA680E2DB99D4B2591F76E032EBA |
| SHA-256 | 6D010B2BB102344572752E578C05DD13B1B796AB9AB96226EE98F134089FFBAF |
| SSDEEP | 768:qOv/EgTYoOzc3AMrEW1Rctc+sc3E+Onq3sxJ48bQSQoRpPDPB0dIuDs:qOv/VTYoOzc3AMrEW1Rctc+sc3E+On8e |
| TLSH | T1F4F284E6FB5D001A5A9071B8496D59C71A2CC433CEF21AEBE5CC39A6324C9D29235FD1 |
| 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 |