Result for F0661E25B4512871B3C659432437DCE8A6B1FFE3

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize15996
MD5FD357421E49C6D5A233E460B58EA1E42
SHA-1F0661E25B4512871B3C659432437DCE8A6B1FFE3
SHA-2567C4CD74AAC068D3BD8EEA3A3702F41CAD13AF0D9EDA6D4B4ED9F42B51D324FFD
SSDEEP192:/zy8R6XNtih+Ryz1hSbtb4bjzLVi4lLl+0kz4ZYV2d2Okxi4:W4bjzQ4lxk8ZYwx4
TLSHT17672E75BFF77CD32E1508A38069F9F2503A2D02522574A377618E7293CE73D84F49AA9
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
MD51EA8A879A0A3A7E8A0AAB63F30C30B40
PackageArchi686
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-1143FDFBD7ED485840793D4245F0C20EB8223485D
SHA-256419809DB8366D6AA47699938B326427A0811D1EAC50EF76C481E526EEA40B2CB