| Key | Value |
|---|---|
| FileName | ./usr/lib/i386-linux-gnu/cmake/boost_container-1.74.0/libboost_container-variant-shared.cmake |
| FileSize | 2578 |
| MD5 | 24C96460A5169FE540247BE668024591 |
| SHA-1 | B2AF2BAB4C1C70B3C37D28A3B6CFD04C4389E8F2 |
| SHA-256 | BC0B10020FC481FB5B6BB6754961352DEF364FCE8C60FED110EC144150D48719 |
| SSDEEP | 24:8mptGbr9izFUwKhk9fQVZkKKrhQ+wI4w2qWn0GTplMDox7BFTr4nIOvn7Z/IyNA4:QbI2xTUr2VTouylH2hr4KIbrEE |
| TLSH | T148512150FFD52C98E382CA4DBBF3A1044BDAA5E796981B18F75CC15991F581E406332B |
| hashlookup:parent-total | 9 |
| hashlookup:trust | 95 |
The searched file hash is included in 9 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 252444 |
| MD5 | B17790467F9281A1322A285A08002CCA |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-20 |
| SHA-1 | 473629D18F4DCF6CD245BCE829848CB42B1D701D |
| SHA-256 | 68029294602E75209CD1754E7CC8815FB52440DBAFD42FACA6F60178FE93E6A9 |
| Key | Value |
|---|---|
| FileSize | 247508 |
| MD5 | 9F6003F71D71501AA36B46E5E4BCACF4 |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-20 |
| SHA-1 | DB842A9D01BA898189A02B59652EDB237BC41999 |
| SHA-256 | D3600E70AE88E72FDB9C4389BA6818DE76FC86E6247C18407BF26AEF6DE73E41 |
| Key | Value |
|---|---|
| FileSize | 247492 |
| MD5 | 4D53A10727FBA23C2BD6962B0B30E7A2 |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-21 |
| SHA-1 | A601B47B81B707BC818F40218678C5D18CB2301E |
| SHA-256 | 7066C3C46202A452BA61E10ADCA4AFBB37958E3E5AAFDA7ACA2D0BB5827DF3B9 |
| Key | Value |
|---|---|
| FileSize | 246392 |
| MD5 | DACD7876F5AF4CEB023EA22335180434 |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0-17+b2 |
| SHA-1 | 3FE5067DBCF7CE644BAD41DBCD46355D9DE84739 |
| SHA-256 | 8A8F36AB08C3CEF82FB201C5259305CD1EE00C76C6B01F8CCBCAE945A6621C11 |
| Key | Value |
|---|---|
| FileSize | 246560 |
| MD5 | 9AEDD1C1AAB5B97FE2F323B049AA19BB |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-21 |
| SHA-1 | 4FC37E51F4E63995B7138DDE8EB3D5BF9882A760 |
| SHA-256 | 43E7D063B2F92CC140055AED864437D5C5A143BD9EBF81CBB1A8882B28D70989 |
| Key | Value |
|---|---|
| FileSize | 247464 |
| MD5 | 7DB996AADE332465A9B27A6C037AF98B |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0-17+b2 |
| SHA-1 | 4D372AB5B947B3FFD98C826C5DB1C36280CE682D |
| SHA-256 | CD0BB625689D5F01ECA630C604CF8FE97266AB4ED24218AE0ECF4F102FCFE6F4 |
| Key | Value |
|---|---|
| FileSize | 246448 |
| MD5 | 49A15E3FB1DC440AE7ABAAAB0037621E |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-20 |
| SHA-1 | 14C309616AFAD2ADDEDC75CC6306A383BE510CDB |
| SHA-256 | C54E3E515B2A93BF796DFF73CB6FDAF8D6CA5A48554C00DE2D96B7A9B5A7343A |
| Key | Value |
|---|---|
| FileSize | 252464 |
| MD5 | D168F40ADBD3C86740EAAE1426522E3E |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0+ds1-21 |
| SHA-1 | 59130CC85BAD35B2D1CC75FD7823D71F9AB36433 |
| SHA-256 | 659AC212A06BFF69EB229DB7149940FF1EB0CC824B65B2D84518A3DC8752B43A |
| Key | Value |
|---|---|
| FileSize | 252344 |
| MD5 | 6048DF1C46FB14F7BDF47C7E54A883B1 |
| PackageDescription | C++ 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(). |
| PackageMaintainer | Debian Boost Team <team+boost@tracker.debian.org> |
| PackageName | libboost-container1.74-dev |
| PackageSection | libdevel |
| PackageVersion | 1.74.0-17+b2 |
| SHA-1 | 090ADD79877838EFBB64E564C954FE61B656B6B4 |
| SHA-256 | 31B9F0636DEA708C4A5E06E2788A06C78D8F92B88A01D68A0370447FEF582E33 |