Result for 2DAD4C3217CFB1146B5AF5ED316572CC0D39754B

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize11112
MD5B1E9F7049D19CE5379DA382F31354360
SHA-12DAD4C3217CFB1146B5AF5ED316572CC0D39754B
SHA-256C9816A2450DDB2B32263A318A400A9BA2BB3B706276D4C54D9B3EEF92B9D5CA9
SSDEEP192:kNvPW8cH7kmRBbX4JNzac2USbzpM5WuLa34IEEEEEEEEEEEEERkvTK:EenluL7k
TLSHT16132C70AF626CE32CCE45F38B29F5B252722CD6742C34B038219A4503E676F84F5B765
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
MD55A2374637FDE663706CD567284FAF037
PackageArcharmv7hl
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-1D33F40E40300DBED6EDD27C89374A435CD31DA18
SHA-2562EAA9FC974F43CCB88ACDA2E69B2436B1D1B391CE9731CDD596BAD0EC4DB127E