Result for 79D9D45C3B46839E83195A49BEA606B2F3701CD8

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize15716
MD51EDA3B36B6F3BD33470A6357C433C5FB
SHA-179D9D45C3B46839E83195A49BEA606B2F3701CD8
SHA-256E5D4EB00B9F4A9339DBE120AFFB8D90F2B8B3BE38DE6123466C72C0C657FCB1E
SSDEEP192:zU/389+SkmRBbX4JNzaob/jsBLgpLsw2cawslGZaJbX:gB/jsBywvcawslaK7
TLSHT1D562C487BF77CD72D1918E38069F5F150263902622474A37BB24DB5D3CEB3C88B45965
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
MD5D8EC1F7DFB42E44116C86F151F1654DB
PackageArchi686
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-14A521722F796EB485B954CC06FEFD3B34A51C988
SHA-2563CE167803071C68422196A1527969253E66E5812F3B04545F25CBE06BFF25B9B