Result for 49FFAEEF3A54E9526666B902F898B7564A6D8E01

Query result

Key Value
FileNamememtailor.spec
FileSize5219
MD5ACBA3F6CC0B2DB748771B8D741D74F4A
SHA-149FFAEEF3A54E9526666B902F898B7564A6D8E01
SHA-2561B79B7561980CEC19098568BD5544DFA2F40EFB7E19F09366BE91B7F7F4FF454
SSDEEP96:b1FPQIxMhI5CHaSHfPlh7D/AxRyx35JqhCS5ieVrxfErAHVi3TqiV:TD6OQ1bD/KRyxpABHHU3mg
TLSHT176B164761209047B33813BA6E9907608F3678676FBB5759C703D8054330AA69737F16E
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
MD5785596E3BECC442D327B726DB821856C
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
PackageRelease13.20200526.git1d13f96.fc33
PackageVersion1.0
SHA-135A6782A69E6883E52FF994498159993C14135F2
SHA-256ED95D2305BA6BC94BEFA64E0B2DA55D2103ED1A4CD2DDA676ADC5C15572E2FFD