Result for E085D0E96BA377EE2691373874A5C8A6DD4DE092

Query result

Key Value
FileName./usr/share/licenses/memtailor/license.txt
FileSize1542
MD5A0B459B4E7210F1E76586D9FB4472703
SHA-1E085D0E96BA377EE2691373874A5C8A6DD4DE092
SHA-2562999D8152A38F0FED9BE5A6037D61AC375E126CB274C4F1A92618508F3C53263
SSDEEP48:6NpOVRrYJuRrYJUYvWPDB432sVoF/32s3EiT3tQHy:tVRrYJuRrYJLvIu34/3z5SS
TLSHT1F131535B02444BA369F14644756ABAC0F19DC02E3B276E06387EE2589B7B13EE87B494
hashlookup:parent-total5
hashlookup:trust75

Network graph view

Parents (Total: 5)

The searched file hash is included in 5 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD50D5D393129DB65B8460B1FE322D27D7B
PackageArchs390x
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-14C165A39336D6D346D9D42C03A364CFBE391E2D4
SHA-256EABD7B4F12D242E23A22660EC3F6527863293196EE1E04AA704D3F131DD590E6
Key Value
MD5F1A339A0CF7E0E6E227BEDDF1CFAAFD2
PackageArchppc64le
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1BA15CA3BD50A6B482358D7DD6847353CCCF01011
SHA-256B354E57D1809C4C28196FA859B8D6B19EDE473CF5A1F14EC517D8904D1613968
Key Value
MD50905CD9B749E12220A16DF4F6792BE78
PackageArchppc64
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1D1BF8EA74F8DDED829045162DDCEE705C609A74B
SHA-256644620C8A874A5ACD3F7F3478E15AF3E7443D4BB962F5D739D1B9FFA1410A7A6
Key Value
MD561DD96D61089AE2D65CF3119000118AA
PackageArchaarch64
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1F565301FD049364E3F2D3B6D27F6C603F7C542F4
SHA-25694B5E7B44DEF06242035BFD59539EE26076E4868C5CA76B05F6595ED87F13230
Key Value
MD5FB849A9202B3BD74E40A3FF4994EF066
PackageArchs390
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
PackageRelease1.20130809.git722a30c.fc23
PackageVersion0
SHA-1A239C8F324F961E4599F13507011712840C7B815
SHA-25694A598A8349E13F26D881EF9669F5E94A032C8FF8DFFB7688C777A0119BAEE80