Result for 263B1D5B4C38527613D2A2B79B8D3A89D51904CD

Query result

Key Value
FileName./usr/lib/libmemtailor.so.0.0.0
FileSize10372
MD5F0185C88837BFF2EEAF3A06BDC2CCFAF
SHA-1263B1D5B4C38527613D2A2B79B8D3A89D51904CD
SHA-2563668E770DCB891E99361AA38DD89C7C1C017F24FE5ADC6DF61D66500C24F7FEE
SSDEEP192:qvbW8pcXXNtih+Ryz1h7b1xbdxBpI9J9zq9teo/h:KbPRU+Vh
TLSHT15D22940BB3B98E36C8651B7D49BF83AB776108A1C55B03DFB749D629BC862948908D41
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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

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