Result for DC1E100AE21563254EF0DF95A697BB5E2CCCD5E3

Query result

Key Value
FileNamememtailor.spec
FileSize5410
MD526F1C4C0E892F2EDB327EB1D26C7BBB8
SHA-1DC1E100AE21563254EF0DF95A697BB5E2CCCD5E3
SHA-256BAC9A192CCB0C1B4A5CA510540BB8FA2AAD8AD66FD4459C67F30245028D8C9CE
SSDEEP96:b1FPQPx8hI5CHaSHfPlh7D/AxRy+35JqhCS5ieVrxfErAHVi3TqiV:TkiOQ1bD/KRy+pABHHU3mg
TLSHT14BB152761209047B33813BA6E9907608F3678676FBB5759C703E8054330AA6A737F56E
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
MD5227421C21820BEF1A57A830FB0309FB1
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
PackageRelease14.20200526.git1d13f96.fc34
PackageVersion1.0
SHA-18D11226181BCF10863D39EF4381A340525FD60A8
SHA-25646C03A2A9B0F87416092E3DA7A04CA8DC5D2B51F81F7FBC37B638FA942FEDF77