Result for 19D95320835FE9C8E0B1C33FDEC8D946CE9C7DEB

Query result

Key Value
FileName./usr/lib/mipsel-linux-gnu/cmake/boost_container-1.71.0/libboost_container-variant-static.cmake
FileSize2044
MD5E6AF021DDC4FA74A059B9454D96C4E28
SHA-119D95320835FE9C8E0B1C33FDEC8D946CE9C7DEB
SHA-256B39D27EB14395D38924476725CC4701FECCF3E2FCCF122BDDF0A0EE958778DE9
SSDEEP24:8mpPZnzFT+gLfQdgxtIQ+wMHw2Knn0GTDUMDoxpcmeILfJNA6fKkDImRAwZid5IP:76ddut7bTTmxNHKIE5C
TLSHT18441ED90FF956898E2C3CD0DBAE2F11407D2EAA696540B58F75CD16AC1F483E802332B
hashlookup:parent-total7
hashlookup:trust85

Network graph view

Parents (Total: 7)

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

Key Value
FileSize261432
MD50AE2F019D49F192536B6FFD772004A1B
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b2
SHA-1F2C7B01CEF207F9E4A07C2E59BC9EC0FFCC8FB94
SHA-2568BFF3C9A0ECDDBAC9656FB342782661167BB538261442CE21DBDE57BC832C510
Key Value
FileSize266700
MD582C7A1AEB263BFA671E9BE6A0CE38E32
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b2
SHA-107B5AE852D1C796121367603CEBEAECD302234BB
SHA-256698308483F99954754566D39F4456D425A71B3DF425333B8FA04D4DE19C75B59
Key Value
FileSize261468
MD57FA6920EE0A4F6B69EBC58123637E40C
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b1
SHA-1AC3F597EB20F03F02408FDF4E365294AFC2DC6A1
SHA-256C5521CCE27CB57EF44EBB61D3132B34F187C898231200976C57513B03702CF99
Key Value
FileSize262244
MD53DD448BE1A50F2DC4506FEF95C7C32AD
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b2
SHA-14E23D31EAD2822929CCBE40D8599B94B2F022096
SHA-25650C211F36F4602D243A5DEE2DD58D792E02849A5843B04A71184CABEAB942D89
Key Value
FileSize267804
MD51CC4DA7C0CE50C63728D3EFDB24FDED8
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b2
SHA-10F353B2BF2241125F96C82C6E472DB0D09213FD3
SHA-256AAF85E48C03E661649C27B51852268944C2D9727ED76054191C7851F2AAC4448
Key Value
FileSize262280
MD5217B4E0C12AEA832B3BCC2F3BB8183BB
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b1
SHA-18812593138DF4A1A66397C1E35F155465233D06B
SHA-2562FA9F6A603B8A1EA0A3DD467D46A103887BB7179C4ABB1304E79848B2159793D
Key Value
FileSize267824
MD5951B83BFB6D70C269C2208FF715EF30C
PackageDescriptionC++ library that implements several well-known containers - dev files This package forms part of the Boost C++ Libraries collection. . Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard. . In short, what does Boost.Container offer? . * Move semantics are implemented, including move emulation for pre-C++11 compilers. * New advanced features (e.g. placement insertion, recursive containers) are present. * Containers support stateful allocators and are compatible with Boost.Interprocess (they can be safely placed in shared memory). * The library offers new useful containers: * flat_map, flat_set, flat_multimap and flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches. * stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures. * slist: the classic pre-standard singly linked list implementation offering constant-time size(). Note that C++11 forward_list has no size().
PackageMaintainerDebian Boost Team <team+boost@tracker.debian.org>
PackageNamelibboost-container1.71-dev
PackageSectionlibdevel
PackageVersion1.71.0-7+b1
SHA-15AEA72B5DCC9D116A78793A683EA9E0C266D9FA4
SHA-256349B699BFF20AC74DCFB42CCC74F6EFEB7F114FF65AD76EA68142E32261E893C