Result for DE372A51780EA2608E23964E22FA90E443732235

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize69616
MD57C593A8FDB7805AA58560327C058F22F
SHA-1DE372A51780EA2608E23964E22FA90E443732235
SHA-256216581733FFA46D27979B448A77AA050069B18E69036BB174D8F4B79DF2F5E30
SSDEEP192:r7yZ8z+uTmRBbX4JNza2yUUtiqq9GTQpDzpNE:LyUuTQpB
TLSHT1C063B586FB29DC2BC1D88A344BDB8B607327E45BA2934B837214C3597D473D94E25AC9
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
MD55947A6287191EC1B0C9757DA8C8C4BF7
PackageArchaarch64
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-1C3DAC95A7C0141FCF14F880ADD3C4DA766BD1440
SHA-256BC695009650301A4B0AA744D7610DC5DAED0EDCA1E2AF45EBC5CB2D7F946EC21