Result for 43573DA76F971F93BDE92557C285B2538E7142A3

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize16488
MD54E68EE6755C4F269E67D361711C31B1F
SHA-143573DA76F971F93BDE92557C285B2538E7142A3
SHA-256D92FDA66888C3027A0AE7FF61A9D3EFBF6CDEE8FD8F3940399606D5EFEF3E4A2
SSDEEP384:c53kzxo8UMkc0sE8XvnzAG3ZPsmHd5l5vt4W:c58UMkc0sE8XvnzL3ZPsGvmW
TLSHT11472B64BF762CD3EC8E8CA34859F4A2452B7A4156272011B6B60F6793DC37D84BBACD4
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
MD5B0C3AE4EBFC5A08B37ADF4CA908292E7
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
PackageRelease14.20200526.git1d13f96.fc34
PackageVersion1.0
SHA-19C196F0741E68E67943E6D244D89081F87708EB8
SHA-256502543E48473DEE8493F126FA53B5A7B268FC1CB94C8F9896489F54E5ADDEA62