Result for E42D13E24DD7E4976680926C64F5D70C5D50E40A

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize16384
MD56186521D3FA95A81F5DAF4779EF78F5A
SHA-1E42D13E24DD7E4976680926C64F5D70C5D50E40A
SHA-256C90AEE0D8E47ACE4A9887A149D0C42545A081DB7D8C1887F458750E4988320B5
SSDEEP192:RT7Az89+uTmRBbX4JNzarkyxe2q7TeMSK/Oot9uWnqBCGYANY:akyxe/9D/OoruVCGYl
TLSHT19572B443F772CD3FC5D8CB7880AF0B75A37A941252B31A1B6604E6383D827D49E1A9D5
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
MD55D63681E24F3009847E08B7A7F766902
PackageArchx86_64
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-17357D8637B0CE4B5D8095A3428306F3DB8DD0878
SHA-256BE4587FF155E34D6F6E8240FC3B73A5121CB084100CFB75B8FCA98C415BB3216