Result for BEB4B43DE9FFCB2A3148C84F29E633BE669B7B12

Query result

Key Value
FileNamememtailor-gtest.patch
FileSize1596
MD50418863F81CB9229BD7F58725F607301
SHA-1BEB4B43DE9FFCB2A3148C84F29E633BE669B7B12
SHA-256784A5B841527831D43D4EFFC5E6B9BA488E39C77ED727FDB02B2E01B741210FF
SSDEEP24:eIy5tTZB+HtT1jV/9WGtTZBStT1O/aFNTK/1IyjlutWvLY8EneIy/cCSJ/R2569U:XcdZB8dblDdZBSd1OG9fQl88L6f2b
TLSHT19731312AC86F0C22F6AD1247AE58B880D576F1BF9CE8D1087ACFC5E4EE13775045B491
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 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
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