Result for 67EBDD825A82AF17442EBDCB02FD1DB7D28C8382

Query result

Key Value
FileName./usr/share/licenses/memtailor/license.txt
FileSize1565
MD50CC062104B47D37EF867B9F2707B0555
SHA-167EBDD825A82AF17442EBDCB02FD1DB7D28C8382
SHA-256E6CFD851725A94ED74CBD0CC23E2B63B2094BB638874067D06EA93ECC80C9396
SSDEEP48:MNppOVRrYJuRrYJ+YvWPDB432sVon/32s3EiT3tQHy:PVRrYJuRrYJBvIu3I/3z5SS
TLSHT1C731755712444BD369F146857669BAC0F19EC02E3B275E05387DF3585B7B03EE877094
hashlookup:parent-total18
hashlookup:trust100

Network graph view

Parents (Total: 18)

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

Key Value
MD51EA8A879A0A3A7E8A0AAB63F30C30B40
PackageArchi686
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
PackageRelease11.20160311.gite85453b.fc32
PackageVersion1.0
SHA-1143FDFBD7ED485840793D4245F0C20EB8223485D
SHA-256419809DB8366D6AA47699938B326427A0811D1EAC50EF76C481E526EEA40B2CB
Key Value
MD572F74312D84A26E1131AFFF9EE11A0CA
PackageArchaarch64
PackageDescriptionMacaulay 2 is a new software system devoted to supporting research in algebraic geometry and commutative algebra written by Daniel R. Grayson and Michael E. Stillman
PackageMaintainerFedora Project
PackageNameMacaulay2
PackageRelease2.fc34
PackageVersion1.17
SHA-118B901785017C887E30728B34C5DF8C59FE174DA
SHA-25633A00F510872E8400EA7CF9C81A66499F6312A5486AD6792B233E455D59FA3ED
Key Value
MD5CFEDF2794CC9958232329E4D1AA53754
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
PackageRelease11.20160311.gite85453b.fc32
PackageVersion1.0
SHA-11B474A7EE7B8577C67A9656FAE16D3E4A999D310
SHA-256D93E7029122C9111087B441A5C529D9CCA59A3AEB0CDB99CC05A4D15102F9446
Key Value
MD5264CE6FB8309F903195FA613F0204BAD
PackageArchaarch64
PackageDescriptionMacaulay 2 is a new software system devoted to supporting research in algebraic geometry and commutative algebra written by Daniel R. Grayson and Michael E. Stillman
PackageMaintainerFedora Project
PackageNameMacaulay2
PackageRelease1.fc33
PackageVersion1.16
SHA-145DE64FCCAD0110A58401C7C1855318106A64FFE
SHA-25666BC7FF9AF286D6ECFB8C4E74B379CD2D74D75AD88486502EAB3682F7D0CFA35
Key Value
MD5D8EC1F7DFB42E44116C86F151F1654DB
PackageArchi686
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-14A521722F796EB485B954CC06FEFD3B34A51C988
SHA-2563CE167803071C68422196A1527969253E66E5812F3B04545F25CBE06BFF25B9B
Key Value
MD59D518C1D90527BE1123E7A7890AD950C
PackageArchx86_64
PackageDescriptionMacaulay 2 is a new software system devoted to supporting research in algebraic geometry and commutative algebra written by Daniel R. Grayson and Michael E. Stillman
PackageMaintainerFedora Project
PackageNameMacaulay2
PackageRelease2.fc34
PackageVersion1.17
SHA-15808471722710BC07EA8300DE8944E67E31DB776
SHA-256A76E66953A534DBC85A20C93F8EB03514C6B34172BCFBE0C30AF2269A04F4AA0
Key Value
MD5C64C3634D2F111B71B67674F4E6946C2
PackageArchi686
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-15A43D6778F278C56DD2B206387AC7DE05B1B0CD0
SHA-256EC3EAFC65FE1A65CF0E5DFD96D56B0D229EFE01F8AC3194AE1FC427EB9DC6DB3
Key Value
MD552C68831E4960598783DA4308D2A0186
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-16E0CC8773F346F817169ADEB0290DD3F532E950B
SHA-25662A9845CE175AE37B6689BAAC35AF67F8B37A5DB8D7A5FD8375EE38C2C91C37A
Key Value
MD55D63681E24F3009847E08B7A7F766902
PackageArchx86_64
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-17357D8637B0CE4B5D8095A3428306F3DB8DD0878
SHA-256BE4587FF155E34D6F6E8240FC3B73A5121CB084100CFB75B8FCA98C415BB3216
Key Value
MD5E074304CFE84A3203661B833E13EF93A
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
PackageRelease11.20160311.gite85453b.fc32
PackageVersion1.0
SHA-17C7EEC44ECC6A3423884734B5A026E4BB9C042AE
SHA-256E730A0A2076F930F41A8DAC69562A9287D058D7709FE64ACD7835B63A87653BB