Result for 520307AD8EACD85BDB6E3796DE9D610BC097B8EF

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize69768
MD520FD987413F68D4467800592EEC40619
SHA-1520307AD8EACD85BDB6E3796DE9D610BC097B8EF
SHA-256BEE03514B8AA5791D35DB907D7CDBD0B465BABFD4F7EDD4C4E7E9B19E6161761
SSDEEP192:27yjiebUhDT8hXXNtih+Ryz1h7b48xC/FczPQLyu7Y42fnDv:lxghDA8qCu7Y4G
TLSHT1C163C702FB6EDC17E0D98A38199F8BA06327F86692635B837A04D3587D872D48F256C5
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
MD5E074304CFE84A3203661B833E13EF93A
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
PackageRelease11.20160311.gite85453b.fc32
PackageVersion1.0
SHA-17C7EEC44ECC6A3423884734B5A026E4BB9C042AE
SHA-256E730A0A2076F930F41A8DAC69562A9287D058D7709FE64ACD7835B63A87653BB