Result for CCC5E59D53F8E91E2A9FD5C22EEF10DD4A5FAB6F

Query result

Key Value
FileName./usr/share/cmake/tsl-robin-map/tsl-robin-mapConfigVersion.cmake
FileSize2739
MD56377A34BA1317D61494D82C6849E6411
SHA-1CCC5E59D53F8E91E2A9FD5C22EEF10DD4A5FAB6F
SHA-2560AB1E58DC3170C6305E5325FBAE836F22C0AF790A4BC987EC955AEEBDB68EBBD
SSDEEP48:pifh430Y30gu/Ei30g30bUKl30gqhmmdmCfKutmEpNATIuUSMV30gcpUEa30bzhr:uRguMn5bUK+gt9CfjtmEpNATIuUSMOgU
TLSHT1E8517A47954899F253868BD316C77938BA351096A3B380E8F14EB88D4754D7843FE3ED
tar:gnamebin
tar:unameroot
hashlookup:parent-total12
hashlookup:trust100

Network graph view

Parents (Total: 12)

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

Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//mips64//robin-map-0.6.3.tgz
MD5C575DC834F11A7F8D8990F109FD02D82
SHA-12CB294D6DC9779BDB6636C8B3424BDB8B797D32D
SHA-2565638C79C27C1B507EDB567141857BD661D04B6F8E514F35C7837AF467B64817A
SSDEEP384:E9h/gVg6MQy9KIi35ELefkRVlFVL9KXt1SiWkSwK39b3KLRcsq9wPsHJ03KgnTVS:E91gVgbVVbEkT9La1S/kxCbg29wq+V9w
TLSHT17FA2F126BBF3FA19E54DB140DBD0060445EECCE9D2324906C3A595485FA9BFBBC1D839
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//arm//robin-map-0.6.3.tgz
MD53D753E96008AED1A923C454689CB060A
SHA-14CD27C23B295E3C11F1180D9F16BC947DB787362
SHA-256E07ABB5E84AE95B39087E9902E25D382211438E157ACE25555C3A971F380528D
SSDEEP384:z79IfM2wNDrQwpb0sAoYf7J90RgTeU/ro/87wslyWxTfi5ZzF5UAjHt7:P9wTwDrQwpQ5heGhfyWxTfEzvdd
TLSHT180A2E17ADFB7C0D8F1A36D3827390ED1AB40C5312394E89CB11F1AACDC252283A89168
Key Value
MD5BDDA8458CFF4A9A7472AC91C78ABDEB6
PackageArchnoarch
PackageDescriptionThe 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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageNamerobin-map-devel
PackageRelease1.1
PackageVersion0.6.3
SHA-1D5A8F74AAAB54FFCB4CACD4D5ADA3FE91B81DCB6
SHA-2565A4E4C0D36E3C7B550F00E84D755756A2FE82FE9EFCAE93F89063F5F6544D8FD
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//mips64el//robin-map-0.6.3.tgz
MD5F9E1B599870E1C622A35D91B17B89E52
SHA-153E82DBD67C6DEB4FCE945A307FF4CB951FEE225
SHA-256004EA3FAD16F3DDE7460238AD0BC38F9342C53F2E600DE96DA9408783DEAEEDE
SSDEEP384:nn90a1cDNrm99tg3kV5vbnjCzZNfSNoNYihL+ytoeCnMiptLGZU+3lcBSvQP0lUi:n90yWNrm9LgbiihL+yto3ZpV8bGBS4sf
TLSHT1ACA2E124CBC64973BD9C835A87C3C81B6D00D554C43EB87FEEE9A6362513D807E46B92
Key Value
MD51F55AB14DAA5D3BA25AFA05932581541
PackageArchnoarch
PackageDescriptionThe 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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainerhttps://bugs.opensuse.org
PackageNamerobin-map-devel
PackageReleasebp154.1.29
PackageVersion0.6.3
SHA-19B295FC96EC3C4594CA18B58B2B5EC4AF7465D62
SHA-25646449D24A2D8FEDAC26B3826382FADCC283E75737E0F0A6522C60AD5CC0AF31E
Key Value
MD59F303E878AB3E4AEFB06BA476918EFF4
PackageArchnoarch
PackageDescriptionThe 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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainerhttps://www.suse.com/
PackageNamerobin-map-devel
PackageRelease150400.5.1
PackageVersion0.6.3
SHA-18BE0DDC266F2D28E1DA1F30AC1AE89C6F36C34F3
SHA-2567E282553B1E4CDCBC22EBC863278B06AD443A2F8FA74B1EC1097BF52DBDE0945
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//amd64//robin-map-0.6.3.tgz
MD5E116B58DB85756E719F280C6416741EE
SHA-18641430D64B8D4C8E44562F651A83FEB8F5D1349
SHA-2567ED0A5F32FD41D6DCBD48C59D2DF3874DC7150D89A73B4B3932F7347857C1C31
SSDEEP384:GT9CQzrm99tg3kV5vbnjCzZNfSNoNYihL+ytoeCnMiptLGZU+3lcBSvQP0lUbU9Z:GT9bzrm9LgbiihL+yto3ZpV8bGBS4sCU
TLSHT17BA2D124CB9609B3B9EC835947C3C81F5D01D958C43DA47FEDA862393517E807E467A2
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//sparc64//robin-map-0.6.3.tgz
MD55F9840E447B90FD7FC1B1746C42A42FF
SHA-114DDE95977A8EA6F1D7A1281A5DD8DEC9F62DE4D
SHA-256CEF2AF062F42B7FA076DA17D18D0AB87E92120CC7FEFDE7E1F58E88846207BB8
SSDEEP384:n+929YYS8L82RoX6jiaUkxJW9bFP0RG2ZtXBoSjpUI55+zyyHZ9ujEomrb2qnz/s:+929WJ2RoKjAkTWHMG2ZjDn+z19ujEoX
TLSHT190A2E01AE1D70C8A082DB2F1F37478B6FF4AEE2749D0D6CA5627467D9D3610F422C068
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//powerpc//robin-map-0.6.3.tgz
MD5F26C9A0F8BB2CB43BA707CF885F585FF
SHA-16E826C20835E9BD8406E9ED68C0B5EE01F7A2565
SHA-2567D0A66A1D9572B9FE54FF21498DB21B2EAE0FC78617F571929A6FCAAC9D9C129
SSDEEP384:x9afytL82RoX6jiaUkxJW9bFP0RG2ZtXBoSjpUI55+zyyHZ9ujEomrb2qnz/VjL:x9afB2RoKjAkTWHMG2ZjDn+z19ujEomH
TLSHT1DCA2D01AE1D70CC6182AE2F2E3B47C75FF8EDD2609D0D6C651770A68AE3B50F062C068
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//powerpc64//robin-map-0.6.3.tgz
MD58206B9A74282460717C3421513AF14FF
SHA-1F8EDBAB7C5DF09ECCF8EBF12946AEECDFFEBD2AD
SHA-256CDDFD93327066F58EF6DDC327051107D85F778119D4A0AD6A44F9D84C8B9DE0D
SSDEEP384:X9xa1Y3SHAAUvLkpiwPmFBKY138dymdXEUVT+UMKqENeI/fA1/B+F61:X9o14SH5hPw1Md1d0UVT+FKqa41/Mg
TLSHT160A2D0180D270552BC60FFED9D2C910E32379AEB7CE9A1FB267FE960511584ED670270
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//i386//robin-map-0.6.3.tgz
MD54D414A08D01623E2F9A91F0117960E1F
SHA-14DE295D4A2184AA49FC149FAD321F656BF197B1D
SHA-256E82A3710FE48616A332153019ADB7D4BC3295911F40C1C77CB8F989261E677A9
SSDEEP384:x9QOQ7NzOeFLi1wNDrQwpb0sAoYf7J90RgTeU/ro/87wslyWxTfi5ZzF5UAjHtd:x9/cFLi1wDrQwpQ5heGhfyWxTfEzvdf
TLSHT1ACA2E17FDFB78499E1B21E3C163A0FD65F40C6212754E89CF25E1AACDC293147A88268
Key Value
MD5539F0957FCE539EFBBE9E3B9227BD4BB
PackageArchnoarch
PackageDescriptionThe 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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainerhttps://www.suse.com/
PackageNamerobin-map-devel
PackageReleaselp154.5.1
PackageVersion0.6.3
SHA-186F78A2BEC014778C9A7841E90313291184C5817
SHA-2563D08F8500DD558C1B9C0C9EE33D46BEC47CF49155B09FC0304A9F5EEBE2B158C