Parents (Total: 6)

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

Key	Value
MD5	1EA8A879A0A3A7E8A0AAB63F30C30B40
PackageArch	i686
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	11.20160311.gite85453b.fc32
PackageVersion	1.0
SHA-1	143FDFBD7ED485840793D4245F0C20EB8223485D
SHA-256	419809DB8366D6AA47699938B326427A0811D1EAC50EF76C481E526EEA40B2CB

Key	Value
MD5	CFEDF2794CC9958232329E4D1AA53754
PackageArch	armv7hl
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	11.20160311.gite85453b.fc32
PackageVersion	1.0
SHA-1	1B474A7EE7B8577C67A9656FAE16D3E4A999D310
SHA-256	D93E7029122C9111087B441A5C529D9CCA59A3AEB0CDB99CC05A4D15102F9446

Key	Value
MD5	5A2374637FDE663706CD567284FAF037
PackageArch	armv7hl
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	14.20200526.git1d13f96.fc34
PackageVersion	1.0
SHA-1	D33F40E40300DBED6EDD27C89374A435CD31DA18
SHA-256	2EAA9FC974F43CCB88ACDA2E69B2436B1D1B391CE9731CDD596BAD0EC4DB127E

Key	Value
MD5	52C68831E4960598783DA4308D2A0186
PackageArch	armv7hl
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	13.20200526.git1d13f96.fc33
PackageVersion	1.0
SHA-1	6E0CC8773F346F817169ADEB0290DD3F532E950B
SHA-256	62A9845CE175AE37B6689BAAC35AF67F8B37A5DB8D7A5FD8375EE38C2C91C37A

Key	Value
MD5	C64C3634D2F111B71B67674F4E6946C2
PackageArch	i686
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	13.20200526.git1d13f96.fc33
PackageVersion	1.0
SHA-1	5A43D6778F278C56DD2B206387AC7DE05B1B0CD0
SHA-256	EC3EAFC65FE1A65CF0E5DFD96D56B0D229EFE01F8AC3194AE1FC427EB9DC6DB3

Key	Value
MD5	D8EC1F7DFB42E44116C86F151F1654DB
PackageArch	i686
PackageDescription	Memtailor 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.
PackageMaintainer	Fedora Project
PackageName	memtailor
PackageRelease	14.20200526.git1d13f96.fc34
PackageVersion	1.0
SHA-1	4A521722F796EB485B954CC06FEFD3B34A51C988
SHA-256	3CE167803071C68422196A1527969253E66E5812F3B04545F25CBE06BFF25B9B