Result for 07D792FC3004A660B3148516532CDA13BD1FF936

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize11160
MD50820ED0D41DADE0717BC00B56FBD9FA0
SHA-107D792FC3004A660B3148516532CDA13BD1FF936
SHA-256262448CDBAEC750C51C3A203D99F5B56D9298FFAF94B62E341C93D09D1383760
SSDEEP192:TRhd8o6XNtih+Ryz1hSx2USbCpA7FJTFWlUugEEEEEEEEEEEEEL4JlDeyOC:VhtGO7FJElt4JlDT
TLSHT1BD32B64AFA6BDE32C5F45F38725F5B242322C86642C34F43821EC8513E571E89F2AB95
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
MD5CFEDF2794CC9958232329E4D1AA53754
PackageArcharmv7hl
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-11B474A7EE7B8577C67A9656FAE16D3E4A999D310
SHA-256D93E7029122C9111087B441A5C529D9CCA59A3AEB0CDB99CC05A4D15102F9446