Result for 069A2A03397F17B4E6F02CEB0E084A3BFE2E7E04

Query result

Key Value
FileName./usr/lib64/libmemtailor.so.0.0.0
FileSize15200
MD5F12483D5BBA758587FF394D4A4282F25
SHA-1069A2A03397F17B4E6F02CEB0E084A3BFE2E7E04
SHA-256C3C4517D4580F96FCFC24DAF52828925F67C6D7F5D2D58A840F7FE9A106C816A
SSDEEP192:+as/EB8pcXXNtih+Ryz1h7b1ymZLI9YCPIMK4SemcPOTCXjc:I/E3gOYMIMK4SbcPO+Tc
TLSHT14062961BB738CD9BC4A47B3425CF43B0A3362C65B3579B09BB9ADB352D827804B25E51
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
MD50D5D393129DB65B8460B1FE322D27D7B
PackageArchs390x
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-14C165A39336D6D346D9D42C03A364CFBE391E2D4
SHA-256EABD7B4F12D242E23A22660EC3F6527863293196EE1E04AA704D3F131DD590E6