Result for 40437379C59B991A9297E9AB8B2C46F64FC8B6D7

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize69264
MD51B2F433565181ECB60377FFC5A3CBB91
SHA-140437379C59B991A9297E9AB8B2C46F64FC8B6D7
SHA-2568244F0C7CBEB463B1F30A4C9FDA2C78EADD09590B140368F75E81FA7D8D37945
SSDEEP192:FRc8p0XXNtih+Ryz1h7b1HqnvayegP1x84Gt8+dLrKdcYQypiNqOIto:FZqnvTxQ8CvKdcYQy
TLSHT1F46383D23355295BC15D1B3051AE3BB0B73E69913726620BFB07636F29E7384BC1BA84
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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
MD50905CD9B749E12220A16DF4F6792BE78
PackageArchppc64
PackageDescriptionMemtailor is a C++ library of special purpose memory allocators. It currently offers an arena allocator and a memory pool. The main motivation to use a memtailor allocator is better and more predictable performance than you get with new/delete. Sometimes a memtailor allocator can also be more convenient due to the ability to free many allocations at one time. The Memtailor memory pool is useful if you need to do many allocations of a fixed size. For example a memory pool is well suited to allocate the nodes in a linked list. You can think of the Memtailor arena allocator as being similar to stack allocation. Both kinds of allocation are very fast and require you to allocate/deallocate memory in last-in-first-out order. Arena allocation has the further benefits that it stays within the C++ standard, it will not cause a stack overflow, you can have multiple arena allocators at the same time and allocation is not tied to a function invocation.
PackageMaintainerFedora Project
PackageNamememtailor
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1D1BF8EA74F8DDED829045162DDCEE705C609A74B
SHA-256644620C8A874A5ACD3F7F3478E15AF3E7443D4BB962F5D739D1B9FFA1410A7A6