Result for 393EABA7330F24D76BB6E3AF18C1CFBC84692BB6

Query result

Key Value
FileNameMacaulay2-memtailor-1d13f96.tar.gz
FileSize26153
MD51A124B9A59009D2424FEE6427362B8C7
SHA-1393EABA7330F24D76BB6E3AF18C1CFBC84692BB6
SHA-25659E56ED397F9C1CBB95E5FCC3CF3A9BFEFD9A0B26E236BD9F9248D2380CACB45
SSDEEP768:CQFd7DP27qhx1OzW/rubFKYOKPLBjNpd4M:7FpDu7qhvpruYD6n
TLSHT14CC2D08316F06E0E7063A7E9A93FD862549F26F45FE9D31593E741C293E7A80105237E
hashlookup:parent-total3
hashlookup:trust65

Network graph view

Parents (Total: 3)

The searched file hash is included in 3 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
MD5A8346732CEB89BD990C3A9C65C3680DF
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
PackageRelease1.fc33
PackageVersion1.16
SHA-146B6E04D3FFAF7334C635C19A542C8C17D398CDB
SHA-256E76D41B69E3A129FD0D1F8EE0E8D9B330AC58655EDC12A248BFBF67D56341A49
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