Result for CD824A7940198D58741DAC101CF6BD4335ED4B0B

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize68808
MD5D24836EBD6BE2BDD35B1B43CB8D62172
SHA-1CD824A7940198D58741DAC101CF6BD4335ED4B0B
SHA-256E2FC2DF8A4137470F72727D9F44EC809B86C57E167BC9B4E98058BB2CBF1A413
SSDEEP192:Njq7J8p0XXNtih+Ryz1h7b1GhG2h7wLHJkuAyqpdgF:gNhG2h7snK
TLSHT1136363237B69EDABDB54663A068F433173626C0203530717BA04832F3DDBF64CB6A985
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
MD5F1A339A0CF7E0E6E227BEDDF1CFAAFD2
PackageArchppc64le
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1BA15CA3BD50A6B482358D7DD6847353CCCF01011
SHA-256B354E57D1809C4C28196FA859B8D6B19EDE473CF5A1F14EC517D8904D1613968