{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.2334SGI6/b1/boost1.74_1.74.0-9_armhf.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.2334SGI6/b2/boost1.74_1.74.0-9_armhf.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -91,10 +91,10 @@\n b2d52a2007ab7da8a4d0bbd8d8c009c1 164684 debug optional libboost-type-erasure1.74.0-dbgsym_1.74.0-9_armhf.deb\n 2e693f5c45648e446737c83f00536b35 250792 libs optional libboost-type-erasure1.74.0_1.74.0-9_armhf.deb\n 22c834a0bde8958964f59f052d2ae6f9 502700 libdevel optional libboost-wave1.74-dev_1.74.0-9_armhf.deb\n f6b74bf25cb6d888651d01f343c193b8 4614508 debug optional libboost-wave1.74.0-dbgsym_1.74.0-9_armhf.deb\n 63ef5b8ea3bcfefb51ecbfb600874e2f 413648 libs optional libboost-wave1.74.0_1.74.0-9_armhf.deb\n b789e8f476ebd871309657ab79ba5c63 240280 libdevel optional libboost1.74-all-dev_1.74.0-9_armhf.deb\n dec1c53aaf17f5d5d5e462ce6e73811f 9534168 libdevel optional libboost1.74-dev_1.74.0-9_armhf.deb\n- 214cc6b815625fd0796492a24617d174 7371792 doc optional libboost1.74-doc_1.74.0-9_all.deb\n+ 1d03cf2a8ad8df1dbdf613d3c22c58f0 7371784 doc optional libboost1.74-doc_1.74.0-9_all.deb\n 136c88fa7f69f21fc0389d3cb6c34bf2 9565712 debug optional libboost1.74-tools-dev-dbgsym_1.74.0-9_armhf.deb\n 244cc08d6b1bc6c83b7a99809775acb9 1322408 libdevel optional libboost1.74-tools-dev_1.74.0-9_armhf.deb\n"}, {"source1": "libboost1.74-doc_1.74.0-9_all.deb", "source2": "libboost1.74-doc_1.74.0-9_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2021-03-13 08:21:38.000000 debian-binary\n--rw-r--r-- 0 0 0 185920 2021-03-13 08:21:38.000000 control.tar.xz\n--rw-r--r-- 0 0 0 7185680 2021-03-13 08:21:38.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 185948 2021-03-13 08:21:38.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 7185644 2021-03-13 08:21:38.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "./usr/share/doc/libboost1.74-doc/doc/html/accumulators.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/accumulators.html", "unified_diff": "@@ -80,15 +80,15 @@\n are grouped within an accumulator set. Boost.Accumulators\n resolves the inter-dependencies between accumulators in a set and ensures that\n accumulators are processed in the proper order.\n

\n \n \n \n-\n+\n \n

Last revised: January 10, 2024 at 02:47:20 GMT

Last revised: January 10, 2024 at 05:28:09 GMT

\n
\n
\n \"Prev\"\"Up\"\"Home\"\"Next\"\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -30,10 +30,10 @@\n library deals primarily with the concept of an accumulator, which is a\n primitive computational entity that accepts data one sample at a time and\n maintains some internal state. These accumulators may offload some of their\n computations on other accumulators, on which they depend. Accumulators are\n grouped within an accumulator set. Boost.Accumulators resolves the inter-\n dependencies between accumulators in a set and ensures that accumulators are\n processed in the proper order.\n-Last revised: January 10, 2024 at 02:47:20 GMT\n+Last revised: January 10, 2024 at 05:28:09 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/align.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/align.html", "unified_diff": "@@ -64,15 +64,15 @@\n

\n The Boost Align C++ library provides functions, classes, templates, traits,\n and macros, for the control, inspection, and diagnostic of memory alignment.\n

\n \n \n \n-\n+\n \n

Last revised: January 10, 2024 at 02:47:20 GMT

Last revised: January 10, 2024 at 05:28:09 GMT

\n
\n
\n \"Prev\"\"Up\"\"Home\"\"Next\"\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -22,10 +22,10 @@\n Vocabulary\n Compatibility\n Acknowledgments\n History\n Introduction\n The Boost Align C++ library provides functions, classes, templates, traits, and\n macros, for the control, inspection, and diagnostic of memory alignment.\n-Last revised: January 10, 2024 at 02:47:20 GMT\n+Last revised: January 10, 2024 at 05:28:09 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/atomic.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/atomic.html", "unified_diff": "@@ -173,15 +173,15 @@\n Take a look at the examples\n section for common patterns.\n

\n \n \n \n \n-\n+\n \n

Last revised: January 10, 2024 at 02:47:20 GMT

Last revised: January 10, 2024 at 05:28:09 GMT

\n
\n
\n \"Prev\"\"Up\"\"Home\"\"Next\"\n
\n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -75,10 +75,10 @@\n that each operation behaves as if it were strictly sequentialized with respect\n to the other.\n Atomic variables are useful for two purposes:\n * as a means for coordinating multiple threads via custom coordination\n protocols\n * as faster alternatives to \"locked\" access to simple variables\n Take a look at the examples section for common patterns.\n-Last revised: January 10, 2024 at 02:47:20 GMT\n+Last revised: January 10, 2024 at 05:28:09 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_dll.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_dll.html", "unified_diff": "@@ -148,15 +148,15 @@\n
  • \n getting program and module location by exported symbol\n
    • \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:18 GMT

    Last revised: January 10, 2024 at 05:28:05 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -63,10 +63,10 @@\n Library provides a portable across platforms way to:\n * load libraries\n * import any native functions and variables\n * make alias names for C++ mangled functions and symbols\n * query libraries for sections and exported symbols\n * self loading and self querying\n * getting program and module location by exported symbol\n-Last revised: January 10, 2024 at 02:47:18 GMT\n+Last revised: January 10, 2024 at 05:28:05 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_lexical_cast.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_lexical_cast.html", "unified_diff": "@@ -151,15 +151,15 @@\n Herb Sutter's article, The\n String Formatters of Manor Farm. Also, take a look at the Performance\n section.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:33 GMT

    Last revised: January 10, 2024 at 05:24:47 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -73,10 +73,10 @@\n behavior of lexical_cast, the conventional std::stringstream approach is\n recommended. Where the conversions are numeric to numeric, boost::numeric_cast\n may offer more reasonable behavior than lexical_cast.\n For a good discussion of the options and issues involved in string-based\n formatting, including comparison of stringstream, lexical_cast, and others, see\n Herb Sutter's article, The_String_Formatters_of_Manor_Farm. Also, take a look\n at the Performance section.\n-Last revised: January 10, 2024 at 02:45:33 GMT\n+Last revised: January 10, 2024 at 05:24:47 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_random.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_random.html", "unified_diff": "@@ -91,15 +91,15 @@\n // distribution that maps to 1..6\n // see random number distributions\n int x = six(rng); // simulate rolling a die\n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:29 GMT

    Last revised: January 10, 2024 at 05:24:38 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -38,10 +38,10 @@\n For a very quick start, here's an example:\n boost::random::mt19937 rng; // produces randomness out of thin air\n // see pseudo-random number generators\n boost::random::uniform_int_distribution<> six(1,6);\n // distribution that maps to 1..6\n // see random number distributions\n int x = six(rng); // simulate rolling a die\n-Last revised: January 10, 2024 at 02:45:29 GMT\n+Last revised: January 10, 2024 at 05:24:38 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_typeerasure.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_typeerasure.html", "unified_diff": "@@ -198,15 +198,15 @@\n

    \n Boost.TypeErasure generalizes this to support arbitrary requirements and provides\n a predefined set of common concepts\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:35 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -109,10 +109,10 @@\n templates, with the runtime flexibility of virtual functions.\n Boost includes several special cases of this kind of polymorphism:\n * boost::any for CopyConstructible types.\n * boost::function for objects that can be called like functions.\n * Boost.Range provides any_iterator.\n Boost.TypeErasure generalizes this to support arbitrary requirements and\n provides a predefined_set_of_common_concepts\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:35 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_typeindex.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_typeindex.html", "unified_diff": "@@ -154,15 +154,15 @@\n T means type here. Think\n of it as of T in template <class T>\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:35 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -64,10 +64,10 @@\n * no easy way to store type info without stripping const, volatile and\n references\n * no nice and portable way to get human readable type names\n * no way to easily make your own type info class\n Boost.TypeIndex library was designed to work around all those issues.\n [[Note]] Note\n T means type here. Think of it as of T in template \n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:35 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_units/version_id.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_units/version_id.html", "unified_diff": "@@ -27,15 +27,15 @@\n

    \n Version Info\n

    \n

    \n Boost root\n

    \n

    \n- Last edit to Quickbook file units.qbk was at 02:45:28 PM on 2024-Jan-09.\n+ Last edit to Quickbook file units.qbk was at 07:24:35 PM on 2024-Jan-10.\n

    \n
    \n \n \n \n \n \n
    \"[Tip]\"Tip

    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -4,15 +4,15 @@\n \n \n [Boost C++ Libraries] Home Libraries People FAQ More\n ===============================================================================\n [Prev][Up][Home][Next]\n Version_Info\n Boost_root\n-Last edit to Quickbook file units.qbk was at 02:45:28 PM on 2024-Jan-09.\n+Last edit to Quickbook file units.qbk was at 07:24:35 PM on 2024-Jan-10.\n [[Tip]] Tip\n This should appear on the pdf version (but may be redundant on html).\n Copyright \u00a9 2003-2008 Matthias Christian Schabel\n Copyright \u00a9 2007-2010 Steven Watanabe\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n ===============================================================================\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/boost_units.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/boost_units.html", "unified_diff": "@@ -206,15 +206,15 @@\n

  • \n All versions of Borland.\n
    • \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:35 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -101,10 +101,10 @@\n 7. Sun CC 5.9 on Solaris and Linux\n The following compilers/platforms are known not to work :\n 1. g++ 3.3.x\n 2. Microsoft Visual C++ 6.0 on Windows XP\n 3. Microsoft Visual C++ 7.0 on Windows XP\n 4. Metrowerks CodeWarrior 8.0 on Windows XP.\n 5. All versions of Borland.\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:35 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/chrono.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/chrono.html", "unified_diff": "@@ -314,15 +314,15 @@\n on their accuracy, unless you have become deeply familiar with exactly what\n the specific operating system is guaranteeing, which is often very little.\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:19 GMT

    Last revised: January 10, 2024 at 05:28:08 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -147,10 +147,10 @@\n Caveat_Emptor\n The underlying clocks provided by operating systems are subject to many\n seemingly arbitrary policies and implementation irregularities. That's a polite\n way of saying they tend to be flakey, and each operating system or even each\n clock has its own cruel and unusual forms of flakiness. Don't bet the farm on\n their accuracy, unless you have become deeply familiar with exactly what the\n specific operating system is guaranteeing, which is often very little.\n-Last revised: January 10, 2024 at 02:47:19 GMT\n+Last revised: January 10, 2024 at 05:28:08 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/circular_buffer/version_id.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/circular_buffer/version_id.html", "unified_diff": "@@ -24,15 +24,15 @@\n \"Prev\"\"Up\"\"Home\"\"Next\"\n \n
    \n
    \n

    \n- Last edit to Quickbook file circular_buffer.qbk was at 02:47:19 PM on 2024-Jan-09.\n+ Last edit to Quickbook file circular_buffer.qbk was at 07:28:08 PM on 2024-Jan-10.\n

    \n
    \n \n \n \n \n \n
    \"[Tip]\"Tip

    \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -3,16 +3,16 @@\n \n \n \n [Boost C++ Libraries] Home Libraries People FAQ More\n ===============================================================================\n [Prev][Up][Home][Next]\n Documentation_Version_Info\n-Last edit to Quickbook file circular_buffer.qbk was at 02:47:19 PM on 2024-Jan-\n-09.\n+Last edit to Quickbook file circular_buffer.qbk was at 07:28:08 PM on 2024-Jan-\n+10.\n [[Tip]] Tip\n This should appear on the pdf version (but may be redundant on a html\n version where the last edit date is on the first (home) page).\n [[Warning]] Warning\n Home page \"Last revised\" is GMT, not local time. Last edit date is\n local time.\n Copyright \u00a9 2003-2013 Jan Gaspar\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/circular_buffer.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/circular_buffer.html", "unified_diff": "@@ -144,15 +144,15 @@\n

    \n

    \n The space-optimized version is, of course, a little slower.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:19 GMT

    Last revised: January 10, 2024 at 05:28:08 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -61,10 +61,10 @@\n The memory allocation process of the space-optimized circular buffer. The\n min_capacity of the capacity controller represents the minimal guaranteed\n amount of allocated memory. The allocated memory will never drop under this\n value. The default value of the min_capacity is set to 0. The min_capacity can\n be set using the constructor parameter () capacity_control or the function\n set_capacity.\n The space-optimized version is, of course, a little slower.\n-Last revised: January 10, 2024 at 02:47:19 GMT\n+Last revised: January 10, 2024 at 05:28:08 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/container.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/container.html", "unified_diff": "@@ -361,15 +361,15 @@\n GCC >= 4.8\n \n \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:19 GMT

    Last revised: January 10, 2024 at 05:28:08 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -182,10 +182,10 @@\n linker. If you followed the Boost_Getting_Started instructions, that's already\n been done for you.\n Tested_compilers\n Boost.Container requires a decent C++03 compatibility. Some compilers known to\n work are:\n * Visual C++ >= 10.0\n * GCC >= 4.8\n-Last revised: January 10, 2024 at 02:47:19 GMT\n+Last revised: January 10, 2024 at 05:28:08 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/crc.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/crc.html", "unified_diff": "@@ -64,15 +64,15 @@\n provides access to two styles of CRC computation, one as a function template,\n the other as a function template and two computation object class templates,\n where the two class templates differ in speed.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:18 GMT

    Last revised: January 10, 2024 at 05:28:07 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -26,10 +26,10 @@\n Header_\n What_is_Boost.CRC?\n CRCs (cyclic redundancy codes) is one common technique to confirming data\n integrity after transmission. The Boost.CRC library provides access to two\n styles of CRC computation, one as a function template, the other as a function\n template and two computation object class templates, where the two class\n templates differ in speed.\n-Last revised: January 10, 2024 at 02:47:18 GMT\n+Last revised: January 10, 2024 at 05:28:07 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/foreach.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/foreach.html", "unified_diff": "@@ -300,15 +300,15 @@\n

    \n This will work around some of the problems you're likely\n to encounter, but not all. Prefer using a different identifier.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:18 GMT

    Last revised: January 10, 2024 at 05:28:05 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -155,10 +155,10 @@\n // Suggested work-around for https://svn.boost.org/trac/boost/ticket/6131\n namespace BOOST_FOREACH = foreach;\n }\n \n #define foreach BOOST_FOREACH\n This will work around some of the problems you're likely to encounter, but not\n all. Prefer using a different identifier.\n-Last revised: January 10, 2024 at 02:47:18 GMT\n+Last revised: January 10, 2024 at 05:28:05 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/hash.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/hash.html", "unified_diff": "@@ -122,15 +122,15 @@\n and is not suitable as a general purpose hash function. For more details\n see the rationale.\n

    \n
    \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:19 GMT

    Last revised: January 10, 2024 at 05:28:07 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -42,10 +42,10 @@\n * std::pair\n * the standard containers.\n * extending boost::hash for custom types.\n [[Note]] Note\n This hash function is designed to be used in containers based on the\n STL and is not suitable as a general purpose hash function. For more\n details see the rationale.\n-Last revised: January 10, 2024 at 02:47:19 GMT\n+Last revised: January 10, 2024 at 05:28:07 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/heap.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/heap.html", "unified_diff": "@@ -104,15 +104,15 @@\n Comparison: Heaps can be compared for\n equivalence.\n \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:18 GMT

    Last revised: January 10, 2024 at 05:28:05 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -41,10 +41,10 @@\n structures with more functionality and different performance characteristics.\n Especially, it deals with additional aspects:\n * Mutability: The priority of heap elements can be modified.\n * Iterators: Heaps provide iterators to iterate all elements.\n * Mergable: While all heaps can be merged, some can be merged efficiently.\n * Stability: Heaps can be configured to be stable sorted.\n * Comparison: Heaps can be compared for equivalence.\n-Last revised: January 10, 2024 at 02:47:18 GMT\n+Last revised: January 10, 2024 at 05:28:05 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/interprocess.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/interprocess.html", "unified_diff": "@@ -317,15 +317,15 @@\n next version.\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:47:18 GMT

    Last revised: January 10, 2024 at 05:28:04 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -131,10 +131,10 @@\n Tested_compilers\n Boost.Interprocess has been tested in the following compilers/platforms:\n * Visual C++ >= 7.1.\n * GCC >= 4.1.\n [[Warning]] Warning\n GCC < 4.3 and MSVC < 9.0 are deprecated and will be removed in the\n next version.\n-Last revised: January 10, 2024 at 02:47:18 GMT\n+Last revised: January 10, 2024 at 05:28:04 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/intrusive.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/intrusive.html", "unified_diff": "@@ -428,15 +428,15 @@\n next version.\n

    \n \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:33 GMT

    Last revised: January 10, 2024 at 05:24:48 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -220,10 +220,10 @@\n Tested_compilers\n Boost.Intrusive has been tested on the following compilers/platforms:\n * Visual C++ >= 7.1.\n * GCC >= 4.1.\n [[Warning]] Warning\n GCC < 4.3 and MSVC < 9.0 are deprecated and will be removed in the\n next version.\n-Last revised: January 10, 2024 at 02:45:33 GMT\n+Last revised: January 10, 2024 at 05:24:48 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/lockfree.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/lockfree.html", "unified_diff": "@@ -267,15 +267,15 @@\n Intel's Thread Building\n Blocks library provides many efficient concurrent data structures,\n which are not necessarily lock-free.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:33 GMT

    Last revised: January 10, 2024 at 05:24:47 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -126,10 +126,10 @@\n \n ===============================================================================\n [8] Spinlocks do not directly interact with the operating system either.\n However it is possible that the owning thread is preempted by the operating\n system, which violates the lock-free property.\n [9] Intel's_Thread_Building_Blocks_library provides many efficient concurrent\n data structures, which are not necessarily lock-free.\n-Last revised: January 10, 2024 at 02:45:33 GMT\n+Last revised: January 10, 2024 at 05:24:47 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/metaparse.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/metaparse.html", "unified_diff": "@@ -175,15 +175,15 @@\n

    \n

    \n An external tutorial can be found at https://github.com/sabel83/metaparse_tutorial#metaparse-tutorial\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:33 GMT

    Last revised: January 10, 2024 at 05:24:46 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -76,10 +76,10 @@\n Based on C++11 features the library can provide advanced utilities for defining\n the input string, the rest of the library works on C++98-based compilers as\n well. Note that if you build the tests and examples with Boost.Build using GCC\n or Clang, the compiler will not have C++11 (or newer) enabled. To build the\n tests and examples in C++11-mode, you need to run b2 cxxflags=\"-std=c++11\".\n An external tutorial can be found at https://github.com/sabel83/\n metaparse_tutorial#metaparse-tutorial\n-Last revised: January 10, 2024 at 02:45:33 GMT\n+Last revised: January 10, 2024 at 05:24:46 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/move.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/move.html", "unified_diff": "@@ -176,15 +176,15 @@\n GCC < 4.3 and MSVC < 9.0 are deprecated and will be removed in the\n next version.\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:33 GMT

    Last revised: January 10, 2024 at 05:24:46 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -81,10 +81,10 @@\n Tested_compilers\n Boost.Move has been tested in the following compilers/platforms:\n * Visual C++ >= 7.1.\n * GCC >= 4.1.\n [[Warning]] Warning\n GCC < 4.3 and MSVC < 9.0 are deprecated and will be removed in the\n next version.\n-Last revised: January 10, 2024 at 02:45:33 GMT\n+Last revised: January 10, 2024 at 05:24:46 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/mpi.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/mpi.html", "unified_diff": "@@ -170,15 +170,15 @@\n

    \n Boost.MPI can be accessed either through its native C++ bindings, or through\n its alternative, Python interface.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:32 GMT

    Last revised: January 10, 2024 at 05:24:45 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -102,10 +102,10 @@\n * Separating structure from content: Boost.MPI can transfer the shape (or\n \"skeleton\") of complex data structures (lists, maps, etc.) and then\n separately transfer their content. This facility optimizes for cases\n where the data within a large, static data structure needs to be\n transmitted many times.\n Boost.MPI can be accessed either through its native C++ bindings, or through\n its alternative, Python_interface.\n-Last revised: January 10, 2024 at 02:45:32 GMT\n+Last revised: January 10, 2024 at 05:24:45 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/poly_collection.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/poly_collection.html", "unified_diff": "@@ -196,15 +196,15 @@\n The library has been verified to work with Visual Studio 2015, GCC 4.8 and\n Clang 3.3.\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:32 GMT

    Last revised: January 10, 2024 at 05:24:45 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -82,10 +82,10 @@\n feature called type restitution that allows user code to provide clues on the\n concrete types of the elements stored for further opportunities of increased\n efficiency related to inlining and devirtualization.\n [[Note]] Note\n Boost.PolyCollection is a header-only library. C++11 support is\n required. The library has been verified to work with Visual Studio\n 2015, GCC 4.8 and Clang 3.3.\n-Last revised: January 10, 2024 at 02:45:32 GMT\n+Last revised: January 10, 2024 at 05:24:45 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/process.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/process.html", "unified_diff": "@@ -165,15 +165,15 @@\n }\n \n

    \n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:30 GMT

    Last revised: January 10, 2024 at 05:24:39 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -93,10 +93,10 @@\n std::string line;\n \n while (pipe_stream && std::getline(pipe_stream, line) && !line.empty())\n std::cerr << line << std::endl;\n \n c.wait();\n }\n-Last revised: January 10, 2024 at 02:45:30 GMT\n+Last revised: January 10, 2024 at 05:24:39 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/property_tree.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/property_tree.html", "unified_diff": "@@ -114,15 +114,15 @@\n Many software projects develop a similar tool at some point of their lifetime,\n and property tree originated the same way. We hope the library can save many\n from reinventing the wheel.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:30 GMT

    Last revised: January 10, 2024 at 05:24:39 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -56,10 +56,10 @@\n };\n Both key_type and data_type are configurable to some extent, but will usually\n be std::string or std::wstring, and the parsers only work with this kind of\n tree.\n Many software projects develop a similar tool at some point of their lifetime,\n and property tree originated the same way. We hope the library can save many\n from reinventing the wheel.\n-Last revised: January 10, 2024 at 02:45:30 GMT\n+Last revised: January 10, 2024 at 05:24:39 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/proto.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/proto.html", "unified_diff": "@@ -259,15 +259,15 @@\n

    [33] \n See Expression\n Templates\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:29 GMT

    Last revised: January 10, 2024 at 05:24:38 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -147,10 +147,10 @@\n namespace proto = boost::proto;\n \n // Allow unqualified use of Proto's wildcard pattern\n using proto::_;\n \n ===============================================================================\n [33] See Expression_Templates\n-Last revised: January 10, 2024 at 02:45:29 GMT\n+Last revised: January 10, 2024 at 05:24:38 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/quickbook/syntax/block.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/quickbook/syntax/block.html", "unified_diff": "@@ -904,15 +904,15 @@\n \n

    \n Today's date\n

    \n \n \n

    \n- 2024-Jan-09\n+ 2024-Jan-10\n

    \n \n \n \n \n

    \n __TIME__\n@@ -921,15 +921,15 @@\n \n

    \n The current time\n

    \n \n \n

    \n- 02:47:20 PM\n+ 07:28:10 PM\n

    \n \n \n \n \n

    \n __FILENAME__\n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -381,16 +381,16 @@\n Hi __spirit__ :-)\n will generate this:\n Hi Spirit [../../../src/images/smiley.png]\n Predefined_Macros\n Quickbook has some predefined macros that you can already use.\n Table\u00a050.3.\u00a0Predefined Macros\n Macro Meaning Example\n-__DATE__ Today's date 2024-Jan-09\n-__TIME__ The current time 02:47:20 PM\n+__DATE__ Today's date 2024-Jan-10\n+__TIME__ The current time 07:28:10 PM\n __FILENAME__ Quickbook source filename block.qbk\n \n Templates\n Templates provide a more versatile text substitution mechanism. Templates come\n in handy when you need to create parameterizable, multi-line, boilerplate text\n that you specify once and expand many times. Templates accept one or more\n arguments. These arguments act like place-holders for text replacement. Unlike\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/ratio.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/ratio.html", "unified_diff": "@@ -179,15 +179,15 @@\n of Boost.MPL numeric metafunctions.\n \n \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:29 GMT

    Last revised: January 10, 2024 at 05:24:38 GMT

    \n

    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -77,10 +77,10 @@\n represents a compile time ratio of compile time constants with support\n for compile time arithmetic with overflow and division by zero\n protection.\n * It provides a textual representation of boost::ratio in the form of\n a std::basic_string which can be useful for I/O.\n * Some extension related to the Rational_Constant concept enabling the use\n of ratio<> in the context of Boost.MPL numeric metafunctions.\n-Last revised: January 10, 2024 at 02:45:29 GMT\n+Last revised: January 10, 2024 at 05:24:38 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/stacktrace.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/stacktrace.html", "unified_diff": "@@ -86,15 +86,15 @@\n

    \n Boost.Stacktrace library is a simple C++03 library that provides information\n about call sequence in a human-readable form.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:29 GMT

    Last revised: January 10, 2024 at 05:24:37 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -32,10 +32,10 @@\n Header_\n Header_\n Motivation\n How can one display the call sequence in C++? What function called the current\n function? What call sequence led to an exception?\n Boost.Stacktrace library is a simple C++03 library that provides information\n about call sequence in a human-readable form.\n-Last revised: January 10, 2024 at 02:45:29 GMT\n+Last revised: January 10, 2024 at 05:24:37 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/stl_interfaces.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/stl_interfaces.html", "unified_diff": "@@ -319,15 +319,15 @@\n Boost.STLInterfaces's iterator_interface\n implements iterators that model the C++20 iterator concepts.\n

    \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:29 GMT

    Last revised: January 10, 2024 at 05:24:37 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -226,10 +226,10 @@\n };\n Ah, that's better. Both of these definitions for repeated_chars_iterator have\n the same semantics and performance profile. It's just a lot less code to write\n the second one, and writing the second one is more novice-friendly.\n [[Note]] Note\n Boost.STLInterfaces's iterator_interface implements iterators that\n model the C++20 iterator concepts.\n-Last revised: January 10, 2024 at 02:45:29 GMT\n+Last revised: January 10, 2024 at 05:24:37 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/thread.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/thread.html", "unified_diff": "@@ -173,15 +173,15 @@\n \n

    \n which includes all the other headers in turn.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:36 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -88,10 +88,10 @@\n minor non-standard features have been added also as thread attributes,\n reverse_lock, shared_lock_guard.\n In order to use the classes and functions described here, you can either\n include the specific headers specified by the descriptions of each class or\n function, or include the master thread library header:\n #include \n which includes all the other headers in turn.\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:36 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/unordered.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/unordered.html", "unified_diff": "@@ -180,15 +180,15 @@\n

    \n There are other differences, which are listed in the Comparison\n with Associative Containers section.\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:35 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -106,10 +106,10 @@\n uses boost::hash it also supports some other types, including standard\n containers. To use any types not supported by these methods you have to extend\n Boost.Hash to support the type or use your own custom equality predicates and\n hash functions. See the Equality Predicates and Hash Functions section for more\n details.\n There are other differences, which are listed in the Comparison with\n Associative Containers section.\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:35 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/xpressive.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/xpressive.html", "unified_diff": "@@ -185,15 +185,15 @@\n 6 redesign and GRETA.\n (You can read a summary of the changes Perl 6 will bring to regex culture\n here.)\n

    \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:34 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -101,10 +101,10 @@\n Influences_and_Related_Work\n The design of xpressive's interface has been strongly influenced by John\n Maddock's Boost.Regex library and his proposal to add regular expressions to\n the Standard Library. I also drew a great deal of inspiration from Joel de\n Guzman's Spirit_Parser_Framework, which served as the model for static\n xpressive. Other sources of inspiration are the Perl_6 redesign and GRETA. (You\n can read a summary of the changes Perl 6 will bring to regex culture here.)\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:34 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}, {"source1": "./usr/share/doc/libboost1.74-doc/doc/html/yap.html", "source2": "./usr/share/doc/libboost1.74-doc/doc/html/yap.html", "unified_diff": "@@ -224,15 +224,15 @@\n (and used within Boost.YAP) that manipulate expressions or their subexpressions.\n These simplify the process of writing user-defined transforms, for example.\n \n \n \n \n \n-\n+\n \n

    Last revised: January 10, 2024 at 02:45:28 GMT

    Last revised: January 10, 2024 at 05:24:34 GMT

    \n
    \n
    \n \"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -106,10 +106,10 @@\n subexpressions or appropriate values and to leave other subexpressions\n unchanged. This evaluate(transform(expr)) idiom is expected to be one of\n the most common ways of using Yap to manipulate and evaluate expressions.\n * Functions that operate on or create expressions. Functions are provided\n (and used within Boost.YAP) that manipulate expressions or their\n subexpressions. These simplify the process of writing user-defined\n transforms, for example.\n-Last revised: January 10, 2024 at 02:45:28 GMT\n+Last revised: January 10, 2024 at 05:24:34 GMT\n ===============================================================================\n [Prev][Up][Home][Next]\n"}]}]}]}]}]}