Result for 4A354CA7455F1666C4E99C01B929D9AECB01B880

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize16768
MD59235C2AE712B7C0229403A01E7B7E3E5
SHA-14A354CA7455F1666C4E99C01B929D9AECB01B880
SHA-25689ABF6070DBB2BB19995C3382718E9C190FF70A71DC30401D712A534FD625965
SSDEEP192:Re7Al2G68HXXNtih+Ryz1h7b5krxo8U6vkc0sE8Xvn4eENYGLjPzNWrxp6r+EUn:HfMkrxo8UMkc0sE8Xvn4bNYMN+TvE
TLSHT1EA72D61BF762CE3EC8D88774459F8E6053B790216272021B6A44E7393CC37E85F6AD94
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
MD558D0B7D01D3924BC6DE040DC7C2AEDA8
PackageArchx86_64
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
PackageRelease11.20160311.gite85453b.fc32
PackageVersion1.0
SHA-1A42FF8D0115EE015DA9077DE5E6BAC8F2CA63D42
SHA-2566D065C35759CEF8E29F13C8448FED5EEC90230A30138F299AADF7978939DE3EA