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
MD5	C5D75B06A6F7C4325BBB812FC5167E31
PackageArch	noarch
PackageDescription	HttpRouter is a lightweight high performance HTTP request router (also called multiplexer or just mux for short) for Go. In contrast to the default mux of Go's net/http package, this router supports variables in the routing pattern and matches against the request method. It also scales better. The router is optimized for high performance and a small memory footprint. It scales well even with very long paths and a large number of routes. A compressing dynamic trie (radix tree) structure is used for efficient matching. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/julienschmidt/httprouter
PackageMaintainer	umeabot <umeabot>
PackageName	golang-github-julienschmidt-httprouter-devel
PackageRelease	3.mga9
PackageVersion	1.3.0
SHA-1	1DA9339D5C86BE4FBAEFAF688B3F35F7EF844C59
SHA-256	6E2B6AA95FE9403695098B8319C55F450F629B1D343B2C0D98235A63D8F44AE4

Key	Value
MD5	A809D3B5BBCF658C4DC4397462DE36C3
PackageArch	noarch
PackageDescription	Goroutine Leak Detector. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/fortytw2/leaktest
PackageMaintainer	umeabot <umeabot>
PackageName	golang-github-fortytw2-leaktest-devel
PackageRelease	3.mga9
PackageVersion	1.3.0
SHA-1	8B7A47E7900B503357897511950C33718F007133
SHA-256	25AC68E21B2C0943CA5D589DA890302EB1170AF4EA4E75AB24FABCFF86CD9F4A

Key	Value
MD5	72B3519D3C1A63665022BEA2E2E11487
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	umeabot <umeabot>
PackageName	golang-github-hashicorp-immutable-radix-devel
PackageRelease	3.mga9
PackageVersion	1.3.0
SHA-1	73E6BEC8F9BA38EDEC70DBE20F505665C958E3D2
SHA-256	780352E89E4CDC572B9FBE369BAE21CC8D0632FD25CC2A2098C89E325B977489