Result for 5A9380F45733B4606C4C6EC7991D5F4E7ADA4FEE

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize68392
MD5A5FEE726CFD1C6C207243938C468ABFF
SHA-15A9380F45733B4606C4C6EC7991D5F4E7ADA4FEE
SHA-256CE867097C6445B5D3319FB266EE7CCDFEAA0A2BF7AABE83BC7A3EFE920731E59
SSDEEP192:SFot8pcXXNtih+Ryz1h7bob9w6GtD2nr3NC:lF+2r3
TLSHT1BF639406FB6CDC5FD8D9DE3465CF4760A313A90B83234B873509C7587E862E84E285C9
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
MD561DD96D61089AE2D65CF3119000118AA
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1F565301FD049364E3F2D3B6D27F6C603F7C542F4
SHA-25694B5E7B44DEF06242035BFD59539EE26076E4868C5CA76B05F6595ED87F13230