Result for D1EDAAD89A27A48A91795FAFF385457CA7CDACD7

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize15544
MD588F0ACDCB636E36E94F5B85F36CFFEC0
SHA-1D1EDAAD89A27A48A91795FAFF385457CA7CDACD7
SHA-2562F902FF25C56FB56D6CB9E3995C3EF471A280818800A093ACABC2B54CD5E3336
SSDEEP192:FUJ2589+SkmRBbX4JNzafX3QgheX3L+LnLKucWGflc/L10wlry/GLY:CoEggheX3KLmjWGq/L10UeD
TLSHT18562D707BB6FCD32E1A18E380A9F5F254372842961575B37BA68E7483CA33C89F05695
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
MD5C64C3634D2F111B71B67674F4E6946C2
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
PackageRelease13.20200526.git1d13f96.fc33
PackageVersion1.0
SHA-15A43D6778F278C56DD2B206387AC7DE05B1B0CD0
SHA-256EC3EAFC65FE1A65CF0E5DFD96D56B0D229EFE01F8AC3194AE1FC427EB9DC6DB3