Result for FE133F473144B7B95E6E9153FFD7CB9EA7BD00A4

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize69528
MD5A79A3D9C93EDD0D0FE77B492708E0A48
SHA-1FE133F473144B7B95E6E9153FFD7CB9EA7BD00A4
SHA-2562C2F9782D48B9A3282E90D03FD4D1B9E5709E7881CD0B969A79D336C1EFBED4C
SSDEEP192:+7yc2+8z+uTmRBbX4JNza2GFUiqqUCrtA6EQxjgLNR:NGUCrahsgLN
TLSHT1AE63A546FB6EEC2BD5D98A38179F83A46323F86691675B833504D3083D8B5C44F269C9
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
MD5FD86186347A257267F29A5ED4CD540A0
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
PackageRelease13.20200526.git1d13f96.fc33
PackageVersion1.0
SHA-1F539DA268198BEB105797040B2CCC094705E2227
SHA-2569D7F1AF2FC96A8219A336596D90F269F0CFDAD075A5B4F358FB724224652E021