Result for 5F30D023673243AB53D0EA4BA7290A67B7C6E4F4

Query result

Key Value
FileName./usr/share/doc/robin-map-dev/README.md.gz
FileSize5192
MD572FF69E2DCC7F33D8F79DEAE5C60CE02
SHA-15F30D023673243AB53D0EA4BA7290A67B7C6E4F4
SHA-256E474C67F6E7CEE1DFE9ADDE0B1F403CA21140AD213AB79D1F2F437EC09FE885E
SSDEEP96:NJdPU4P0Z2OQLM39oxrOs+SXQ/IZKFjL1iDgIHEF2Lg6YnCZ:NvPU4PE2TLM39U+EQ/AqjEDgKEPCZ
TLSHT18EB1B0A21A2D4083C364936C547C5B8CC58E39EF3B1970F23D65F665334CDAE8511B3A
hashlookup:parent-total4
hashlookup:trust70

Network graph view

Parents (Total: 4)

The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize22860
MD51380EBEA183C1B45D1892086815BEC18
PackageDescriptionC++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.6.2-1
SHA-1E01B61A5481D802EA267A6F06206FE87A2CE98C4
SHA-256DF2BA3E86F7577605CFDFEAAEE2DEA4087D91C39FA011F49F2568FEA4B7214E1
Key Value
FileSize25276
MD5839016EF237A3DF8F84439465B8D6960
PackageDescriptionC++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainerMatteo F. Vescovi <mfv@debian.org>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.6.3-1
SHA-13B78C08CD65B552369193646B4188EAE607AF5B3
SHA-2566D7D10A25CBF8941404102407C8D714AECC35F2D0AA92BFD2AAFA7B312593C93
Key Value
FileSize25316
MD552505A93EB2C0BAE761949BE91AC2A43
PackageDescriptionC++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.6.3-1
SHA-1F4EA795130B26D35F957EB0890A9CDBA2E488FE5
SHA-25698523E62FD66BD48586DF306A5CF5D5E7DA01B2ED1ABEC45E1AEAF938B54503C
Key Value
FileSize25288
MD54D10EA9BDEF3D72DD1B1C7656FC21FB7
PackageDescriptionC++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainerMatteo F. Vescovi <mfv@debian.org>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.6.3-1~bpo10+1
SHA-15A840C0134E3F06B40B61C0230A21F0DC0F53ED0
SHA-2565FFE16BAD6E8E8D5A1AF5A3431F2CCF19D040012143A06D411F86F87A5E7378B