Result for AE87A54BBD8AF355795E61C438F2FE5FE1FA27BD

Query result

Key Value
FileName./usr/share/lintian/overrides/libboost-container1.67.0
FileSize60
MD508F8C6850319C5BAD74899824071010A
SHA-1AE87A54BBD8AF355795E61C438F2FE5FE1FA27BD
SHA-2561CD42BE1BF7B64A93F314CF64804DA8E56063D5F16BD857617D13650262C56C2
SSDEEP3:EHRWudLRmXgWuGogz0aINLhAon:EQELRZAzFUWo
TLSHT16EA0022057114131A8664D4C5017C5085B09B6D7F4451B8C66DA5D426081E3520E580B
hashlookup:parent-total55
hashlookup:trust100

Network graph view

Parents (Total: 55)

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

Key Value
FileSize255936
MD5DFB1E697CD0174C28FAAEBE031D919CE
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-13+deb10u1
SHA-1046F6AD236899174BA17AE084BFB543A432C05F2
SHA-256131562F212353A3F33B6CCB2B8CFF6AAF4A77E23B852AE17FB1663E237CBF667
Key Value
FileSize232072
MD5804376A8E33FD692A9282A9E3ECF3FC6
PackageDescriptionC++ library that implements several well-known containers 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().
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibboost-container1.67.0
PackageSectionlibs
PackageVersion1.67.0-13ubuntu1
SHA-107815F52FA8A9DEC7B51C8F5742FF6E6D60E8913
SHA-2564548011ECFCEA298A3D7A05EC9A3475E0B61173D2E48F2BBF68BFDA122818E2C
Key Value
FileSize257228
MD5D52761EA44B23C0F37AF144B511A931A
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-17+b1
SHA-10B3C6B608DFB74647F7F8769ABEE45DCC91575C8
SHA-2568DD237F684BF48756C837B88DE25F355BDB524FDFE3DB0A17ED81111C26EB0DD
Key Value
FileSize229424
MD5224ABC9E68DF506EF8BE9D7E9666129A
PackageDescriptionC++ library that implements several well-known containers 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().
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibboost-container1.67.0
PackageSectionlibs
PackageVersion1.67.0-17ubuntu8
SHA-10F4CB5BFE4E027F99C331522A6F291C09BF70860
SHA-25669BD39C762A5F5F9DC2C41B53E78E4CA22D3CF899E5D5F758AE76572FEC2F083
Key Value
FileSize255922
MD5DFC37E6E00546FF28DAD1C2D7094DEB1
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-13+deb10u1~bpo9+1
SHA-10FAE14E31EBE5D0ECDF4C7A7D68580ACA5D642D3
SHA-2567697B90D9DFE71428FEB5C8E8A1ACF1909D481AE1D5EDFB5839F3DA49F512858
Key Value
FileSize254906
MD59D74F4B59316DF6BED2E526CA8EB2F6A
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-13+deb10u1~bpo9+1
SHA-10FD6C3AF846C8E982174B148F2A5DB5BB17F6293
SHA-256BE1A42D2D38A4BD1EA4D36A5AFEED41FB26EA9E7FABE5DD4F28855C01482E692
Key Value
FileSize230528
MD5B051EDA01AC70DC4000209941C3968CE
PackageDescriptionC++ library that implements several well-known containers 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().
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibboost-container1.67.0
PackageSectionlibs
PackageVersion1.67.0-7
SHA-113AD5C90625E44B513169EAFA3F015CB26997DCB
SHA-2569F7C054F8362A57E9769E481E306DA4A033186FDD4C42410E08391746986AD43
Key Value
FileSize229084
MD5EF1DBF06E201BA65002A9B9B96EE8D08
PackageDescriptionC++ library that implements several well-known containers 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().
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibboost-container1.67.0
PackageSectionlibs
PackageVersion1.67.0-7ubuntu0.1
SHA-1164268250E94A01D9F5C929D3534CACF17D7C830
SHA-256E78FD927E74274025A78AE924FC65661DA8AB2F5FA25439069DF397DBBF02B67
Key Value
FileSize251192
MD54F5CECD4CF7BE7BAFB51CEBE27FDFFD1
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-13+deb10u1
SHA-11BDDF2A11B46F55521D487EFC99C60B166B276C6
SHA-256EC3B75C98C629931D90C2793F6606826ECDB670442B6AEDB65B563641901F57E
Key Value
FileSize253500
MD5D38330951A06D568FC9648A122946C50
PackageDescriptionC++ library that implements several well-known containers 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.67.0
PackageSectionlibs
PackageVersion1.67.0-13+deb10u1
SHA-1299AFE0202BC3D50E759E9046967BBB59DB1E8FB
SHA-2566A3CCB2D4E11E006EF7D6F85E0A9CF82EAE7FFFF184600E902D0DC168D566B57